[ 0:00] compiling /home/xrockai/src/divine/nightly/test/libcxx/forwardlist/unique.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.17/_klee_out" [ 0:05] KLEE: Using Z3 solver backend [ 0:05] WARNING: this target does not support the llvm.stacksave intrinsic. [ 0:05] 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: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: 72222 [ 0:11] Stack: [ 0:11] #000072222 in __dios_start (l=0, argc=1, argv=94005978817544, envp=94005978886664) at /dios/libc/sys/start.cpp:87 [ 0:11] #100020051 in _ZN6__dios10sched_nullINS_5ClockINS_10NondetKleeINS_4BaseEEEEEE13run_schedulerINS_7ContextEEEvv () at /dios/sys/sched_null.hpp:163 [ 0:11] #200080802 in klee_boot (argc=2, argv=94005944405376) 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 // void unique(); [ 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 int main() [ 0:11] 23 { [ 0:11] 24 { [ 0:11] 25 typedef int T; [ 0:11] 26 typedef std::forward_list C; [ 0:11] 27 const T t1[] = {0, 5, 5, 0, 0, 0, 5}; [ 0:11] 28 const T t2[] = {0, 5, 0, 5}; [ 0:11] 29 C c1(std::begin(t1), std::end(t1)); [ 0:11] 30 C c2(std::begin(t2), std::end(t2)); [ 0:11] 31 c1.unique(); [ 0:11] 32 assert(c1 == c2); [ 0:11] 33 } [ 0:11] 34 { [ 0:11] 35 typedef int T; [ 0:11] 36 typedef std::forward_list C; [ 0:11] 37 const T t1[] = {0, 0, 0, 0}; [ 0:11] 38 const T t2[] = {0}; [ 0:11] 39 C c1(std::begin(t1), std::end(t1)); [ 0:11] 40 C c2(std::begin(t2), std::end(t2)); [ 0:11] 41 c1.unique(); [ 0:11] 42 assert(c1 == c2); [ 0:11] 43 } [ 0:11] 44 { [ 0:11] 45 typedef int T; [ 0:11] 46 typedef std::forward_list C; [ 0:11] 47 const T t1[] = {5, 5, 5}; [ 0:11] 48 const T t2[] = {5}; [ 0:11] 49 C c1(std::begin(t1), std::end(t1)); [ 0:11] 50 C c2(std::begin(t2), std::end(t2)); [ 0:11] 51 c1.unique(); [ 0:11] 52 assert(c1 == c2); [ 0:11] 53 } [ 0:11] 54 { [ 0:11] 55 typedef int T; [ 0:11] 56 typedef std::forward_list C; [ 0:11] 57 C c1; [ 0:11] 58 C c2; [ 0:11] 59 c1.unique(); [ 0:11] 60 assert(c1 == c2); [ 0:11] 61 } [ 0:11] 62 { [ 0:11] 63 typedef int T; [ 0:11] 64 typedef std::forward_list C; [ 0:11] 65 const T t1[] = {5, 5, 5, 0}; [ 0:11] 66 const T t2[] = {5, 0}; [ 0:11] 67 C c1(std::begin(t1), std::end(t1)); [ 0:11] 68 C c2(std::begin(t2), std::end(t2)); [ 0:11] 69 c1.unique(); [ 0:11] 70 assert(c1 == c2); [ 0:11] 71 } [ 0:11] 72 #if __cplusplus >= 201103L [ 0:11] 73 { [ 0:11] 74 typedef int T; [ 0:11] 75 typedef std::forward_list> C; [ 0:11] 76 const T t1[] = {0, 5, 5, 0, 0, 0, 5}; [ 0:11] 77 const T t2[] = {0, 5, 0, 5}; [ 0:11] 78 C c1(std::begin(t1), std::end(t1)); [ 0:11] 79 C c2(std::begin(t2), std::end(t2)); [ 0:11] 80 c1.unique(); [ 0:11] 81 assert(c1 == c2); [ 0:11] 82 } [ 0:11] 83 { [ 0:11] 84 typedef int T; [ 0:11] 85 typedef std::forward_list> C; [ 0:11] 86 const T t1[] = {0, 0, 0, 0}; [ 0:11] 87 const T t2[] = {0}; [ 0:11] 88 C c1(std::begin(t1), std::end(t1)); [ 0:11] 89 C c2(std::begin(t2), std::end(t2)); [ 0:11] 90 c1.unique(); [ 0:11] 91 assert(c1 == c2); [ 0:11] 92 } [ 0:11] 93 { [ 0:11] 94 typedef int T; [ 0:11] 95 typedef std::forward_list> C; [ 0:11] 96 const T t1[] = {5, 5, 5}; [ 0:11] 97 const T t2[] = {5}; [ 0:11] 98 C c1(std::begin(t1), std::end(t1)); [ 0:11] 99 C c2(std::begin(t2), std::end(t2)); [ 0:11] 100 c1.unique(); [ 0:11] 101 assert(c1 == c2); [ 0:11] 102 } [ 0:11] 103 { [ 0:11] 104 typedef int T; [ 0:11] 105 typedef std::forward_list> C; [ 0:11] 106 C c1; [ 0:11] 107 C c2; [ 0:11] 108 c1.unique(); [ 0:11] 109 assert(c1 == c2); [ 0:11] 110 } [ 0:11] 111 { [ 0:11] 112 typedef int T; [ 0:11] 113 typedef std::forward_list> C; [ 0:11] 114 const T t1[] = {5, 5, 5, 0}; [ 0:11] 115 const T t2[] = {5, 0}; [ 0:11] 116 C c1(std::begin(t1), std::end(t1)); [ 0:11] 117 C c2(std::begin(t2), std::end(t2)); [ 0:11] 118 c1.unique(); [ 0:11] 119 assert(c1 == c2); [ 0:11] 120 } [ 0:11] 121 #endif [ 0:11] 122 } [ 0:11] # no errors were expected but one was found anyway