[ 0:00] compiling /home/xrockai/src/divine/nightly/test/svcomp/recursion/Fibonacci02_true.c
[ 0:00] compiling /dios/lib/config/seqklee.bc
[ 0:00] setting up pass: functionmeta, options = 
[ 0:01] setting up pass: fuse-ctors, options = 
[ 0:01] KLEE: output directory is "/var/obj/divine-nightly/semidbg/test/__test_work_dir.9/_klee_out"
[ 0:03] KLEE: Using Z3 solver backend
[ 0:03] WARNING: this target does not support the llvm.stacksave intrinsic.
[ 0:03] warning: Linking two modules of different target triples: klee_div_zero_check.bc' is 'x86_64-unknown-linux-gnu' whereas 'klee.bc' is 'x86_64-unknown-none-elf'
[ 0:03] 
[ 0:03] KLEE: WARNING: undefined reference to function: __dios_tainted_init
[ 0:05] KLEE: WARNING: undefined reference to function: klee_free
[ 0:05] KLEE: WARNING: undefined reference to function: klee_malloc
[ 0:05] i:1
[ 0:05] KLEE: WARNING ONCE: Alignment of memory from call "klee_malloc" is not modelled. Using alignment of 8.
[ 0:05] about to __boot:0
[ 0:05] about to run the scheduler:0
[ 0:05] KLEE: WARNING ONCE: calling external: __dios_tainted_init() at /dios/libc/sys/start.cpp:49 5
[ 0:05] KLEE: ERROR: /dios/libc/sys/start.cpp:87: failed external call: __dios_tainted_init
[ 0:05] KLEE: NOTE: now ignoring this error at this location
[ 0:05] KLEE: ERROR: EXITING ON ERROR:
[ 0:05] Error: failed external call: __dios_tainted_init
[ 0:05] File: /dios/libc/sys/start.cpp
[ 0:05] Line: 87
[ 0:05] assembly.ll line: 34030
[ 0:05] Stack: 
[ 0:05] 	#000034030 in __dios_start (l=0, argc=1, argv=94057005527560, envp=94057005604872) at /dios/libc/sys/start.cpp:87
[ 0:05] 	#100010049 in _ZN6__dios10sched_nullINS_5ClockINS_10NondetKleeINS_4BaseEEEEEE13run_schedulerINS_7ContextEEEvv () at /dios/sys/sched_null.hpp:163
[ 0:05] 	#200042295 in klee_boot (argc=2, argv=94056979536640) at /dios/arch/klee/boot.c:41
[ 0:05] 
[ 0:05] 
[ 0:05]      1	/* TAGS: c */
[ 0:05]      2	/* VERIFY_OPTS: --sequential -o nofail:malloc */
[ 0:05]      3	extern void __VERIFIER_error() __attribute__ ((__noreturn__));
[ 0:05]      4	
[ 0:05]      5	/*
[ 0:05]      6	 * Recursive computation of fibonacci numbers.
[ 0:05]      7	 *
[ 0:05]      8	 * Author: Matthias Heizmann
[ 0:05]      9	 * Date: 2013-07-13
[ 0:05]     10	 *
[ 0:05]     11	 */
[ 0:05]     12	
[ 0:05]     13	extern int __VERIFIER_nondet_int(void);
[ 0:05]     14	
[ 0:05]     15	
[ 0:05]     16	int fibonacci(int n) {
[ 0:05]     17	    if (n < 1) {
[ 0:05]     18	        return 0;
[ 0:05]     19	    } else if (n == 1) {
[ 0:05]     20	        return 1;
[ 0:05]     21	    } else {
[ 0:05]     22	        return fibonacci(n-1) + fibonacci(n-2);
[ 0:05]     23	    }
[ 0:05]     24	}
[ 0:05]     25	
[ 0:05]     26	
[ 0:05]     27	int main() {
[ 0:05]     28	    int x = 9;
[ 0:05]     29	    int result = fibonacci(x);
[ 0:05]     30	    if (result == 34) {
[ 0:05]     31	        return 0;
[ 0:05]     32	    } else {
[ 0:05]     33	        ERROR: __VERIFIER_error();
[ 0:05]     34	    }
[ 0:05]     35	}
[ 0:05] # no errors were expected but one was found anyway