[ 0:01] compiling /home/xrockai/src/divine/nightly/test/libcxx/forwardlist/insert_after_size_value.pass.cpp [ 0:01] compiling /dios/lib/config/seqklee.bc [ 0:02] setting up pass: functionmeta, options = [ 0:03] setting up pass: fuse-ctors, options = [ 0:03] KLEE: output directory is "/var/obj/divine-nightly/semidbg/test/__test_work_dir.2/_klee_out" [ 0:06] KLEE: Using Z3 solver backend [ 0:06] WARNING: this target does not support the llvm.stacksave intrinsic. [ 0:06] 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:07] [ 0:07] KLEE: WARNING: undefined reference to function: _Z10klee_abortv [ 0:11] KLEE: WARNING: undefined reference to function: __dios_tainted_init [ 0:11] KLEE: WARNING: undefined reference to function: klee_free [ 0:11] KLEE: WARNING: undefined reference to function: klee_malloc [ 0:11] KLEE: WARNING ONCE: Using zero size array fix for landingpad instruction filter [ 0:11] i:1 [ 0:11] KLEE: WARNING ONCE: Alignment of memory from call "klee_malloc" is not modelled. Using alignment of 8. [ 0:11] about to __boot:0 [ 0:11] about to run the scheduler:0 [ 0:11] KLEE: WARNING ONCE: calling external: __dios_tainted_init() at /dios/libc/sys/start.cpp:49 5 [ 0:11] KLEE: ERROR: /dios/libc/sys/start.cpp:87: failed external call: __dios_tainted_init [ 0:11] KLEE: NOTE: now ignoring this error at this location [ 0:11] KLEE: ERROR: EXITING ON ERROR: [ 0:11] Error: failed external call: __dios_tainted_init [ 0:11] File: /dios/libc/sys/start.cpp [ 0:11] Line: 87 [ 0:11] assembly.ll line: 74305 [ 0:11] Stack: [ 0:11] #000074305 in __dios_start (l=0, argc=1, argv=94283656434184, envp=94283656503304) at /dios/libc/sys/start.cpp:87 [ 0:11] #100022134 in _ZN6__dios10sched_nullINS_5ClockINS_10NondetKleeINS_4BaseEEEEEE13run_schedulerINS_7ContextEEEvv () at /dios/sys/sched_null.hpp:163 [ 0:11] #200082885 in klee_boot (argc=2, argv=94283622370688) at /dios/arch/klee/boot.c:41 [ 0:11] [ 0:11] [ 0:11] 1 /* TAGS: c++ */ [ 0:11] 2 /* VERIFY_OPTS: -o nofail:malloc */ [ 0:11] 3 //===----------------------------------------------------------------------===// [ 0:11] 4 // [ 0:11] 5 // The LLVM Compiler Infrastructure [ 0:11] 6 // [ 0:11] 7 // This file is dual licensed under the MIT and the University of Illinois Open [ 0:11] 8 // Source Licenses. See LICENSE.TXT for details. [ 0:11] 9 // [ 0:11] 10 //===----------------------------------------------------------------------===// [ 0:11] 11 [ 0:11] 12 // [ 0:11] 13 [ 0:11] 14 // iterator insert_after(const_iterator p, size_type n, const value_type& v); [ 0:11] 15 [ 0:11] 16 #include [ 0:11] 17 #include [ 0:11] 18 [ 0:11] 19 #include "min_allocator.h" [ 0:11] 20 [ 0:11] 21 int main() [ 0:11] 22 { [ 0:11] 23 { [ 0:11] 24 typedef int T; [ 0:11] 25 typedef std::forward_list C; [ 0:11] 26 typedef C::iterator I; [ 0:11] 27 C c; [ 0:11] 28 I i = c.insert_after(c.cbefore_begin(), 0, 0); [ 0:11] 29 assert(i == c.before_begin()); [ 0:11] 30 assert(distance(c.begin(), c.end()) == 0); [ 0:11] 31 [ 0:11] 32 i = c.insert_after(c.cbefore_begin(), 3, 3); [ 0:11] 33 assert(i == next(c.before_begin(), 3)); [ 0:11] 34 assert(distance(c.begin(), c.end()) == 3); [ 0:11] 35 assert(*next(c.begin(), 0) == 3); [ 0:11] 36 assert(*next(c.begin(), 1) == 3); [ 0:11] 37 assert(*next(c.begin(), 2) == 3); [ 0:11] 38 [ 0:11] 39 i = c.insert_after(c.begin(), 2, 2); [ 0:11] 40 assert(i == next(c.begin(), 2)); [ 0:11] 41 assert(distance(c.begin(), c.end()) == 5); [ 0:11] 42 assert(*next(c.begin(), 0) == 3); [ 0:11] 43 assert(*next(c.begin(), 1) == 2); [ 0:11] 44 assert(*next(c.begin(), 2) == 2); [ 0:11] 45 assert(*next(c.begin(), 3) == 3); [ 0:11] 46 assert(*next(c.begin(), 4) == 3); [ 0:11] 47 } [ 0:11] 48 #if __cplusplus >= 201103L [ 0:11] 49 { [ 0:11] 50 typedef int T; [ 0:11] 51 typedef std::forward_list> C; [ 0:11] 52 typedef C::iterator I; [ 0:11] 53 C c; [ 0:11] 54 I i = c.insert_after(c.cbefore_begin(), 0, 0); [ 0:11] 55 assert(i == c.before_begin()); [ 0:11] 56 assert(distance(c.begin(), c.end()) == 0); [ 0:11] 57 [ 0:11] 58 i = c.insert_after(c.cbefore_begin(), 3, 3); [ 0:11] 59 assert(i == next(c.before_begin(), 3)); [ 0:11] 60 assert(distance(c.begin(), c.end()) == 3); [ 0:11] 61 assert(*next(c.begin(), 0) == 3); [ 0:11] 62 assert(*next(c.begin(), 1) == 3); [ 0:11] 63 assert(*next(c.begin(), 2) == 3); [ 0:11] 64 [ 0:11] 65 i = c.insert_after(c.begin(), 2, 2); [ 0:11] 66 assert(i == next(c.begin(), 2)); [ 0:11] 67 assert(distance(c.begin(), c.end()) == 5); [ 0:11] 68 assert(*next(c.begin(), 0) == 3); [ 0:11] 69 assert(*next(c.begin(), 1) == 2); [ 0:11] 70 assert(*next(c.begin(), 2) == 2); [ 0:11] 71 assert(*next(c.begin(), 3) == 3); [ 0:11] 72 assert(*next(c.begin(), 4) == 3); [ 0:11] 73 } [ 0:11] 74 #endif [ 0:11] 75 } [ 0:11] # no errors were expected but one was found anyway