// verifast_options{disable_overflow_check target:ILP32} extern void abort(void); //@ requires true; //@ ensures true; void reach_error() //@ requires false; //@ ensures true; {}extern short __VERIFIER_nondet_short(void); //@ requires true; //@ ensures true; void assume_abort_if_not(int cond) //@ requires true; //@ ensures (cond != 0); { if(!cond) {abort();} } void __VERIFIER_assert(int cond) //@ requires (1 <= cond); //@ ensures (1 <= cond); { if (!(cond)) { ERROR: {reach_error();} } return; } int main() //@ requires module(ps4_ll_valuebound5__verifast_instrumented, true); //@ ensures junk(); { //@ open_module(); short k; long long y, x, c; k = __VERIFIER_nondet_short(); assume_abort_if_not(k>=0 && k<=5); y = 0; x = 0; c = 0; while (1) //@ invariant ((((((((((k <= 5) && ((1 < k) || (k == 1))) && (y == 1)) && (x == 1)) && (c == 1)) || (((((y == 2) && (k <= 5)) && ((k == 2) || (2 < k))) && (c == 2)) && (x == 9))) || (((((k <= 5) && (4 <= k)) && (y == 4)) && (c == 4)) && (x == 100))) || (((((k <= 5) && ((k == 3) || (3 < k))) && (y == 3)) && (x == 36)) && (c == 3))) || (((((x == 0) && (k <= 5)) && (0 <= k)) && (c == 0)) && (y == 0))) || ((((((k <= 5) && (((c * 3) + (c * y)) == ((y * 3) + (y * y)))) && ((y * y) == (k * y))) && (((c * 2) + (c * y)) == ((y * 2) + (y * y)))) && ((((((y * y) * y) * y) + (y * y)) + (((y * y) * y) * 2)) == (x * 4))) && (5 <= c))); { __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0); if (!(c < k)) break; c = c + 1; y = y + 1; x = y * y * y + x; } __VERIFIER_assert(k*y - (y*y) == 0); __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0); return 0; }