source: CIVL/examples/concurrency/spawn.cvl@ 9705dfd

/* spawn.cvl: simple example of spawning two processes.
 * A good test for reduction: verification should avoid
 * exploring all interleavings.  It should in fact 
 * reduce to a single interleaving.
 *      civl verify -inputN=10 spawn.cvl
 */
#include<civlc.h>

$input int N;

void f(int n) {
  int i = 0;

  for (i=0; i<n; i++) ;
  $assert i==n;
}

void main() {
  $proc p = $spawn f(N);
  $proc q = $spawn f(N);

  $wait p;
  $wait q;
}