/* hardware integer division program, by Manna returns q==A//B */ void abort() { }; extern void abort(); extern int __VERIFIER_nondet_int(); void assume_abort_if_not(int cond) { if(!cond) {abort();} } /*@ requires ((cond != 0)) && (cond != 0); ensures ((cond != 0)) && (1); @*/ void __VERIFIER_assert(int cond) { if (!(cond)) { ERROR: {/*@ assert(0); */;} } return; } int main() { int A, B; int r, d, p, q; A = __VERIFIER_nondet_int(); B = 1; r = A; d = B; p = 1; q = 0; /*@ loop invariant (((((((((A == r) && (((long long) A + d) == ((long long) p + r))) && (8 <= p)) && (q == 0)) && (B == 1)) || ((((((A == r) && (p == 2)) && (1 <= r)) && (d == 2)) && (q == 0)) && (B == 1))) || ((((((A == r) && (d == 4)) && (2 <= r)) && (q == 0)) && (B == 1)) && (p == 4))) || (((((A == r) && (d == 1)) && (q == 0)) && (B == 1)) && (p == 1)))); @*/ while (1) { __VERIFIER_assert(q == 0); __VERIFIER_assert(r == A); __VERIFIER_assert(d == B * p); if (!(r >= d)) break; d = 2 * d; p = 2 * p; } /*@ loop invariant (((((A == ((long long) q + r)) && (d == p)) && (1 <= p)) && (B == 1))); @*/ while (1) { __VERIFIER_assert(A == q*B + r); __VERIFIER_assert(d == B*p); if (!(p != 1)) break; d = d / 2; p = p / 2; if (r >= d) { r = r - d; q = q + p; } } __VERIFIER_assert(A == d*q + r); __VERIFIER_assert(B == d); return 0; }