[ 0:00] compiling /home/xrockai/src/divine/nightly/test/libcxx/forwardlist/assign_copy.pass.cpp [ 0:00] compiling /dios/lib/config/seqklee.bc [ 0:01] 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.9/_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:06] [ 0:06] KLEE: WARNING: undefined reference to function: _Z10klee_abortv [ 0:10] KLEE: WARNING: undefined reference to function: __dios_tainted_init [ 0:10] KLEE: WARNING: undefined reference to function: klee_free [ 0:10] KLEE: WARNING: undefined reference to function: klee_malloc [ 0:10] KLEE: WARNING ONCE: Using zero size array fix for landingpad instruction filter [ 0:10] i:1 [ 0:10] KLEE: WARNING ONCE: Alignment of memory from call "klee_malloc" is not modelled. Using alignment of 8. [ 0:10] about to __boot:0 [ 0:10] 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: 78196 [ 0:11] Stack: [ 0:11] #000078196 in __dios_start (l=0, argc=1, argv=94693395362312, envp=94693395415048) at /dios/libc/sys/start.cpp:87 [ 0:11] #100026198 in _ZN6__dios10sched_nullINS_5ClockINS_10NondetKleeINS_4BaseEEEEEE13run_schedulerINS_7ContextEEEvv () at /dios/sys/sched_null.hpp:163 [ 0:11] #200086776 in klee_boot (argc=2, argv=94693360572800) 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 // forward_list& operator=(const forward_list& x); [ 0:11] 15 [ 0:11] 16 #include [ 0:11] 17 #include [ 0:11] 18 #include [ 0:11] 19 [ 0:11] 20 #include "test_allocator.h" [ 0:11] 21 #include "min_allocator.h" [ 0:11] 22 [ 0:11] 23 int main() [ 0:11] 24 { [ 0:11] 25 { [ 0:11] 26 typedef int T; [ 0:11] 27 typedef test_allocator A; [ 0:11] 28 typedef std::forward_list C; [ 0:11] 29 const T t0[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}; [ 0:11] 30 const T t1[] = {10, 11, 12, 13}; [ 0:11] 31 C c0(std::begin(t0), std::end(t0), A(10)); [ 0:11] 32 C c1(std::begin(t1), std::end(t1), A(10)); [ 0:11] 33 c1 = c0; [ 0:11] 34 assert(c1 == c0); [ 0:11] 35 assert(c1.get_allocator() == A(10)); [ 0:11] 36 } [ 0:11] 37 { [ 0:11] 38 typedef int T; [ 0:11] 39 typedef test_allocator A; [ 0:11] 40 typedef std::forward_list C; [ 0:11] 41 const T t0[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}; [ 0:11] 42 const T t1[] = {10, 11, 12, 13}; [ 0:11] 43 C c0(std::begin(t0), std::end(t0), A(10)); [ 0:11] 44 C c1(std::begin(t1), std::end(t1), A(11)); [ 0:11] 45 c1 = c0; [ 0:11] 46 assert(c1 == c0); [ 0:11] 47 assert(c1.get_allocator() == A(11)); [ 0:11] 48 } [ 0:11] 49 { [ 0:11] 50 typedef int T; [ 0:11] 51 typedef test_allocator A; [ 0:11] 52 typedef std::forward_list C; [ 0:11] 53 const T t0[] = {10, 11, 12, 13}; [ 0:11] 54 const T t1[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}; [ 0:11] 55 C c0(std::begin(t0), std::end(t0), A(10)); [ 0:11] 56 C c1(std::begin(t1), std::end(t1), A(10)); [ 0:11] 57 c1 = c0; [ 0:11] 58 assert(c1 == c0); [ 0:11] 59 assert(c1.get_allocator() == A(10)); [ 0:11] 60 } [ 0:11] 61 { [ 0:11] 62 typedef int T; [ 0:11] 63 typedef test_allocator A; [ 0:11] 64 typedef std::forward_list C; [ 0:11] 65 const T t0[] = {10, 11, 12, 13}; [ 0:11] 66 const T t1[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}; [ 0:11] 67 C c0(std::begin(t0), std::end(t0), A(10)); [ 0:11] 68 C c1(std::begin(t1), std::end(t1), A(11)); [ 0:11] 69 c1 = c0; [ 0:11] 70 assert(c1 == c0); [ 0:11] 71 assert(c1.get_allocator() == A(11)); [ 0:11] 72 } [ 0:11] 73 [ 0:11] 74 { [ 0:11] 75 typedef int T; [ 0:11] 76 typedef other_allocator A; [ 0:11] 77 typedef std::forward_list C; [ 0:11] 78 const T t0[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}; [ 0:11] 79 const T t1[] = {10, 11, 12, 13}; [ 0:11] 80 C c0(std::begin(t0), std::end(t0), A(10)); [ 0:11] 81 C c1(std::begin(t1), std::end(t1), A(10)); [ 0:11] 82 c1 = c0; [ 0:11] 83 assert(c1 == c0); [ 0:11] 84 assert(c1.get_allocator() == A(10)); [ 0:11] 85 } [ 0:11] 86 { [ 0:11] 87 typedef int T; [ 0:11] 88 typedef other_allocator A; [ 0:11] 89 typedef std::forward_list C; [ 0:11] 90 const T t0[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}; [ 0:11] 91 const T t1[] = {10, 11, 12, 13}; [ 0:11] 92 C c0(std::begin(t0), std::end(t0), A(10)); [ 0:11] 93 C c1(std::begin(t1), std::end(t1), A(11)); [ 0:11] 94 c1 = c0; [ 0:11] 95 assert(c1 == c0); [ 0:11] 96 assert(c1.get_allocator() == A(10)); [ 0:11] 97 } [ 0:11] 98 { [ 0:11] 99 typedef int T; [ 0:11] 100 typedef other_allocator A; [ 0:11] 101 typedef std::forward_list C; [ 0:11] 102 const T t0[] = {10, 11, 12, 13}; [ 0:11] 103 const T t1[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}; [ 0:11] 104 C c0(std::begin(t0), std::end(t0), A(10)); [ 0:11] 105 C c1(std::begin(t1), std::end(t1), A(10)); [ 0:11] 106 c1 = c0; [ 0:11] 107 assert(c1 == c0); [ 0:11] 108 assert(c1.get_allocator() == A(10)); [ 0:11] 109 } [ 0:11] 110 { [ 0:11] 111 typedef int T; [ 0:11] 112 typedef other_allocator A; [ 0:11] 113 typedef std::forward_list C; [ 0:11] 114 const T t0[] = {10, 11, 12, 13}; [ 0:11] 115 const T t1[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}; [ 0:11] 116 C c0(std::begin(t0), std::end(t0), A(10)); [ 0:11] 117 C c1(std::begin(t1), std::end(t1), A(11)); [ 0:11] 118 c1 = c0; [ 0:11] 119 assert(c1 == c0); [ 0:11] 120 assert(c1.get_allocator() == A(10)); [ 0:11] 121 } [ 0:11] 122 #if __cplusplus >= 201103L [ 0:11] 123 { [ 0:11] 124 typedef int T; [ 0:11] 125 typedef min_allocator A; [ 0:11] 126 typedef std::forward_list C; [ 0:11] 127 const T t0[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}; [ 0:11] 128 const T t1[] = {10, 11, 12, 13}; [ 0:11] 129 C c0(std::begin(t0), std::end(t0), A()); [ 0:11] 130 C c1(std::begin(t1), std::end(t1), A()); [ 0:11] 131 c1 = c0; [ 0:11] 132 assert(c1 == c0); [ 0:11] 133 assert(c1.get_allocator() == A()); [ 0:11] 134 } [ 0:11] 135 { [ 0:11] 136 typedef int T; [ 0:11] 137 typedef min_allocator A; [ 0:11] 138 typedef std::forward_list C; [ 0:11] 139 const T t0[] = {10, 11, 12, 13}; [ 0:11] 140 const T t1[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}; [ 0:11] 141 C c0(std::begin(t0), std::end(t0), A()); [ 0:11] 142 C c1(std::begin(t1), std::end(t1), A()); [ 0:11] 143 c1 = c0; [ 0:11] 144 assert(c1 == c0); [ 0:11] 145 assert(c1.get_allocator() == A()); [ 0:11] 146 } [ 0:11] 147 #endif [ 0:11] 148 } [ 0:11] # no errors were expected but one was found anyway