[ 0:00] compiling /home/xrockai/src/divine/nightly/test/libcxx/forwardlist/unique_pred.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.5/_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: 72136 [ 0:11] Stack: [ 0:11] #000072136 in __dios_start (l=0, argc=1, argv=94818882536456, envp=94818882581000) at /dios/libc/sys/start.cpp:87 [ 0:11] #100019965 in _ZN6__dios10sched_nullINS_5ClockINS_10NondetKleeINS_4BaseEEEEEE13run_schedulerINS_7ContextEEEvv () at /dios/sys/sched_null.hpp:163 [ 0:11] #200080716 in klee_boot (argc=2, argv=94818849549696) 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 // template void unique(BinaryPredicate binary_pred); [ 0:11] 15 [ 0:11] 16 #include [ 0:11] 17 #include [ 0:11] 18 #include [ 0:11] 19 [ 0:11] 20 #include "min_allocator.h" [ 0:11] 21 [ 0:11] 22 bool g(int x, int y) [ 0:11] 23 { [ 0:11] 24 return x == y; [ 0:11] 25 } [ 0:11] 26 [ 0:11] 27 int main() [ 0:11] 28 { [ 0:11] 29 { [ 0:11] 30 typedef int T; [ 0:11] 31 typedef std::forward_list C; [ 0:11] 32 const T t1[] = {0, 5, 5, 0, 0, 0, 5}; [ 0:11] 33 const T t2[] = {0, 5, 0, 5}; [ 0:11] 34 C c1(std::begin(t1), std::end(t1)); [ 0:11] 35 C c2(std::begin(t2), std::end(t2)); [ 0:11] 36 c1.unique(g); [ 0:11] 37 assert(c1 == c2); [ 0:11] 38 } [ 0:11] 39 { [ 0:11] 40 typedef int T; [ 0:11] 41 typedef std::forward_list C; [ 0:11] 42 const T t1[] = {0, 0, 0, 0}; [ 0:11] 43 const T t2[] = {0}; [ 0:11] 44 C c1(std::begin(t1), std::end(t1)); [ 0:11] 45 C c2(std::begin(t2), std::end(t2)); [ 0:11] 46 c1.unique(g); [ 0:11] 47 assert(c1 == c2); [ 0:11] 48 } [ 0:11] 49 { [ 0:11] 50 typedef int T; [ 0:11] 51 typedef std::forward_list C; [ 0:11] 52 const T t1[] = {5, 5, 5}; [ 0:11] 53 const T t2[] = {5}; [ 0:11] 54 C c1(std::begin(t1), std::end(t1)); [ 0:11] 55 C c2(std::begin(t2), std::end(t2)); [ 0:11] 56 c1.unique(g); [ 0:11] 57 assert(c1 == c2); [ 0:11] 58 } [ 0:11] 59 { [ 0:11] 60 typedef int T; [ 0:11] 61 typedef std::forward_list C; [ 0:11] 62 C c1; [ 0:11] 63 C c2; [ 0:11] 64 c1.unique(g); [ 0:11] 65 assert(c1 == c2); [ 0:11] 66 } [ 0:11] 67 { [ 0:11] 68 typedef int T; [ 0:11] 69 typedef std::forward_list C; [ 0:11] 70 const T t1[] = {5, 5, 5, 0}; [ 0:11] 71 const T t2[] = {5, 0}; [ 0:11] 72 C c1(std::begin(t1), std::end(t1)); [ 0:11] 73 C c2(std::begin(t2), std::end(t2)); [ 0:11] 74 c1.unique(g); [ 0:11] 75 assert(c1 == c2); [ 0:11] 76 } [ 0:11] 77 #if __cplusplus >= 201103L [ 0:11] 78 { [ 0:11] 79 typedef int T; [ 0:11] 80 typedef std::forward_list> C; [ 0:11] 81 const T t1[] = {0, 5, 5, 0, 0, 0, 5}; [ 0:11] 82 const T t2[] = {0, 5, 0, 5}; [ 0:11] 83 C c1(std::begin(t1), std::end(t1)); [ 0:11] 84 C c2(std::begin(t2), std::end(t2)); [ 0:11] 85 c1.unique(g); [ 0:11] 86 assert(c1 == c2); [ 0:11] 87 } [ 0:11] 88 { [ 0:11] 89 typedef int T; [ 0:11] 90 typedef std::forward_list> C; [ 0:11] 91 const T t1[] = {0, 0, 0, 0}; [ 0:11] 92 const T t2[] = {0}; [ 0:11] 93 C c1(std::begin(t1), std::end(t1)); [ 0:11] 94 C c2(std::begin(t2), std::end(t2)); [ 0:11] 95 c1.unique(g); [ 0:11] 96 assert(c1 == c2); [ 0:11] 97 } [ 0:11] 98 { [ 0:11] 99 typedef int T; [ 0:11] 100 typedef std::forward_list> C; [ 0:11] 101 const T t1[] = {5, 5, 5}; [ 0:11] 102 const T t2[] = {5}; [ 0:11] 103 C c1(std::begin(t1), std::end(t1)); [ 0:11] 104 C c2(std::begin(t2), std::end(t2)); [ 0:11] 105 c1.unique(g); [ 0:11] 106 assert(c1 == c2); [ 0:11] 107 } [ 0:11] 108 { [ 0:11] 109 typedef int T; [ 0:11] 110 typedef std::forward_list> C; [ 0:11] 111 C c1; [ 0:11] 112 C c2; [ 0:11] 113 c1.unique(g); [ 0:11] 114 assert(c1 == c2); [ 0:11] 115 } [ 0:11] 116 { [ 0:11] 117 typedef int T; [ 0:11] 118 typedef std::forward_list> C; [ 0:11] 119 const T t1[] = {5, 5, 5, 0}; [ 0:11] 120 const T t2[] = {5, 0}; [ 0:11] 121 C c1(std::begin(t1), std::end(t1)); [ 0:11] 122 C c2(std::begin(t2), std::end(t2)); [ 0:11] 123 c1.unique(g); [ 0:11] 124 assert(c1 == c2); [ 0:11] 125 } [ 0:11] 126 #endif [ 0:11] 127 } [ 0:11] # no errors were expected but one was found anyway