void abort() { };
                                                                                                                                                          
                                                                               

/*
 * Recursive computation of fibonacci numbers.
 * 
 * Author: Matthias Heizmann
 * Date: 2013-07-13
 * 
 */

extern int __VERIFIER_nondet_int();


/*@ 
    requires (1);
    ensures (((((2 <= n) && (n <= ((long long) \result + 1))) || ((n <= 0) && ((\result == 1) || (\result == 0)))) || ((\result == 1) && (1 == n))));
@*/
int fibonacci(int n) {
    if (n < 1) {
        return 0;
    } else if (n == 1) {
        return 1;
    } else {
        return fibonacci(n-1) + fibonacci(n-2);
    }
}


int main() {
    int x = __VERIFIER_nondet_int();
    if (x > 46 || x == -2147483648) {
        return 0;
    }
    int result = fibonacci(x);
    if (result >= x - 1) {
        return 0;
    } else {
        ERROR: {/*@ assert(0); */;abort();}
    }
}