// verifast_options{disable_overflow_check target:ILP32}

extern void abort(void);//@ requires true; 
//@ ensures true;


extern void __assert_fail (const char *__assertion, const char *__file,
      unsigned int __line, const char *__function)
     __attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__noreturn__));
extern void __assert_perror_fail (int __errnum, const char *__file,
      unsigned int __line, const char *__function)
     __attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__noreturn__));
extern void __assert (const char *__assertion, const char *__file, int __line)
     __attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__noreturn__));

void reach_error() //@ requires false; 
//@ ensures true;
{ ((void) sizeof ((0) ? 1 : 0), __extension__ ({ if (0) ; else __assert_fail ("0", "divbin2.c", 10, __extension__ __PRETTY_FUNCTION__); })); }
extern unsigned __VERIFIER_nondet_uint(void);//@ requires true; 
//@ ensures true;

extern void abort(void);
void assume_abort_if_not(int cond) //@ requires true; 
//@ ensures true;
{
  if(!cond) {abort();}
}
void __VERIFIER_assert(int cond) //@ requires integer(&counter, ?veri_req_counter) &*& ((1 <= veri_req_counter) && (1 <= cond)); 
//@ ensures integer(&counter, ?veri_ens_counter) &*& (((veri_ens_counter == veri_req_counter) && (1 <= veri_ens_counter)) && (1 <= cond));
{
    if (!(cond)) {
    ERROR:
        {reach_error();}
    }
    return;
}
int counter = 0;
int main() //@ requires module(divbin2_unwindbound1__verifast_instrumented_modified, true); 
//@ ensures junk();
{
  unsigned A, B;
//@ invariant integer(&counter, ?veri_req_counter) &*& (veri_req_counter == 0);
  unsigned q, r, b;
    A = __VERIFIER_nondet_uint();
    B = 1;
    q = 0;
    r = A;
    b = B;
    while (counter++<1)//@ invariant integer(&counter, ?veri_inv_counter) &*& ((veri_req_counter == 0) && ((((A == r) && (veri_inv_counter == 0)) && (q == 0)) || (((A == r) && (1 <= veri_inv_counter)) && (q == 0))));
 {
        if (!(r >= b)) break;
        b = 2 * b;
    }
    while (counter++<1)//@ invariant integer(&counter, ?veri_inv_counter) &*& ((((A == r) && (1 <= veri_inv_counter)) && (veri_req_counter == 0)) && (q == 0));
 {
        __VERIFIER_assert(A == q * b + r);
        if (!(b != B)) break;
        q = 2 * q;
        b = b / 2;
        if (r >= b) {
            q = q + 1;
            r = r - b;
        }
    }
    __VERIFIER_assert(A == q * b + r);
    return 0;
}