// verifast_options{disable_overflow_check target:ILP32}
extern void abort(void);
//@ requires true;
//@ ensures true;


void reach_error()
//@ requires false;
//@ ensures true;
{}void assume_abort_if_not(int cond) 
//@ requires true;
//@ ensures true;
{  if(!cond) {abort();}
}
void __VERIFIER_assert(int cond) 
//@ requires (cond != 0);
//@ ensures (cond != 0);
{  if (!(cond)) {
    ERROR: {reach_error();abort();}
  }
  return;
}
int __VERIFIER_nondet_int();
int main() 
//@ requires module(nested6__verifast_instrumented, true);
//@ ensures junk();
{
    //@ open_module(); 
    int i,j,k,n;
    k = __VERIFIER_nondet_int();
    n = __VERIFIER_nondet_int();
    if (!(n < 1000000)) return 0;
    if( k == n) {
    } else {
        goto END;
    }
for (i=0;i<n;i++)
//@ invariant (n == k);
    {
for (j=2*i;j<n;j++)
//@ invariant ((n == k) && ((i * 2) <= j));
    {
if( __VERIFIER_nondet_int() ) 
//@ requires true;
//@ ensures true;
{for (k=j;k<n;k++)
//@ invariant (((((j + 1) <= n) && (k <= n)) && ((i * 2) <= j)) && ((i * 2) <= k));
    {
                    __VERIFIER_assert(k>=2*i);
                }
            }
            else {
                __VERIFIER_assert( k >= n );
                __VERIFIER_assert( k <= n );
            }
        }
    }
END:
  return 0;
}