// verifast_options{disable_overflow_check target:ILP32}


extern void abort(void);
//@ requires true;
//@ ensures true;
void reach_error()
//@ requires false;
//@ ensures true;
{}void __VERIFIER_assert(int cond) 
//@ requires (cond != 0);
//@ ensures (cond != 0);
{ if(!(cond)) { ERROR: {reach_error();abort();} } }int main() 
//@ requires module(bh2017_ex1_poly__verifast_instrumented, true);
//@ ensures junk();
{
    //@ open_module(); 
  int i = 0;
while (i < 4)
//@ invariant ((0 < i) || (i == 0));
    {
    int j = 0;
while (j < 3)
//@ invariant ((((((j <= 4) && (2 <= j)) && (j == (i * 2))) || (((((i * 2) <= (j + 6)) && (j <= 4)) && (2 <= j)) && ((j + 2) <= (i * 2)))) || (((j == 0) && (1 <= i)) && (i <= 3))) || ((j == 0) && (i == 0)));
    {
      i++;
      j += 2;
      __VERIFIER_assert(0 <= j);
      __VERIFIER_assert(j <= 2 * i);
      __VERIFIER_assert(2 * i <= j + 6);
      __VERIFIER_assert(j <= 4);
    }
    __VERIFIER_assert(0 <= j);
    __VERIFIER_assert(j <= 2 * i);
    __VERIFIER_assert(2 * i <= j + 6);
    __VERIFIER_assert(j <= 4);
    i = i - j / 2 + 1;
  }
  return 0;
}