c_decl {
  \#include "insertsort.h"
}

c_track "heap"      "sizeof(node) * MAX_NODES"    "Matched"
c_track "&node_p"   "sizeof(int)"                 "Matched"

c_track "&head"     "sizeof(node*)"               "Matched"

#define MAX 4

int x;

inline pick (var, n) {
  var = 0;
  do
  :: (var < n) -> var++;
  :: break
  od
}

active proctype main () {
  do
  :: pick(x, MAX);
     printf ("Inserting %d\n", x);
     c_code {insert(now.x);};
     assert (c_expr{is_sorted()});
  od;
}