[ 0:01] compiling /home/xrockai/src/divine/nightly/test/libcxx/containers/move_alloc.pass.cpp [ 0:01] In file included from /home/xrockai/src/divine/nightly/test/libcxx/containers/move_alloc.pass.cpp:20: [ 0:01] In file included from /dios/libcxx/include/set:427: [ 0:01] In file included from /dios/libcxx/include/__tree:14: [ 0:01] In file included from /dios/libcxx/include/iterator:420: [ 0:01] In file included from /dios/libcxx/include/iosfwd:95: [ 0:01] In file included from /dios/libcxx/include/wchar.h:118: [ 0:01] In file included from /dios/include/wchar.h:9: [ 0:01] In file included from /dios/include/_PDCLIB/int.h:16: [ 0:01] /dios/include/_PDCLIB/cdefs.h:69:10: warning: Unsupported _ _cplusplus (__cplusplus) (too new) (supported: ISO/IEC 14882:1997, ISO/IEC 14882:2011). [ 0:01] #warning Unsupported _ _cplusplus (__cplusplus) (too new) (supported: ISO/IEC 14882:1997, ISO/IEC 14882:2011). [ 0:01] ^ [ 0:01] 1 warning generated. [ 0:02] 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.11/_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:12] i:1 [ 0:12] KLEE: WARNING ONCE: Alignment of memory from call "klee_malloc" is not modelled. Using alignment of 8. [ 0:12] about to __boot:0 [ 0:12] about to run the scheduler:0 [ 0:12] KLEE: WARNING ONCE: calling external: __dios_tainted_init() at /dios/libc/sys/start.cpp:49 5 [ 0:12] KLEE: ERROR: /dios/libc/sys/start.cpp:87: failed external call: __dios_tainted_init [ 0:12] KLEE: NOTE: now ignoring this error at this location [ 0:12] KLEE: ERROR: EXITING ON ERROR: [ 0:12] Error: failed external call: __dios_tainted_init [ 0:12] File: /dios/libc/sys/start.cpp [ 0:12] Line: 87 [ 0:12] assembly.ll line: 87431 [ 0:12] Stack: [ 0:12] #000087431 in __dios_start (l=2, argc=1, argv=94544110547464, envp=94544110616584) at /dios/libc/sys/start.cpp:87 [ 0:12] #100035433 in _ZN6__dios10sched_nullINS_5ClockINS_10NondetKleeINS_4BaseEEEEEE13run_schedulerINS_7ContextEEEvv () at /dios/sys/sched_null.hpp:163 [ 0:12] #200096011 in klee_boot (argc=2, argv=94544073616768) at /dios/arch/klee/boot.c:41 [ 0:12] [ 0:12] [ 0:12] 1 /* TAGS: c++ fin */ [ 0:12] 2 /* CC_OPTS: -std=c++2a */ [ 0:12] 3 /* VERIFY_OPTS: -o nofail:malloc */ [ 0:12] 4 //===----------------------------------------------------------------------===// [ 0:12] 5 // [ 0:12] 6 // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. [ 0:12] 7 // See https://llvm.org/LICENSE.txt for license information. [ 0:12] 8 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception [ 0:12] 9 // [ 0:12] 10 //===----------------------------------------------------------------------===// [ 0:12] 11 [ 0:12] 12 // UNSUPPORTED: c++98, c++03 [ 0:12] 13 [ 0:12] 14 // [ 0:12] 15 [ 0:12] 16 // class set [ 0:12] 17 [ 0:12] 18 // set(set&& s, const allocator_type& a); [ 0:12] 19 [ 0:12] 20 #include [ 0:12] 21 #include [ 0:12] 22 [ 0:12] 23 #include "test_macros.h" [ 0:12] 24 #include "MoveOnly.h" [ 0:12] 25 #include "test_compare.h" [ 0:12] 26 #include "test_allocator.h" [ 0:12] 27 #include "Counter.h" [ 0:12] 28 [ 0:12] 29 int main(int, char**) [ 0:12] 30 { [ 0:12] 31 { [ 0:12] 32 typedef MoveOnly V; [ 0:12] 33 typedef test_compare > C; [ 0:12] 34 typedef test_allocator A; [ 0:12] 35 typedef std::set M; [ 0:12] 36 typedef std::move_iterator I; [ 0:12] 37 V a1[] = [ 0:12] 38 { [ 0:12] 39 V(1), [ 0:12] 40 V(1), [ 0:12] 41 V(1), [ 0:12] 42 V(2), [ 0:12] 43 V(2), [ 0:12] 44 V(2), [ 0:12] 45 V(3), [ 0:12] 46 V(3), [ 0:12] 47 V(3) [ 0:12] 48 }; [ 0:12] 49 M m1(I(a1), I(a1+sizeof(a1)/sizeof(a1[0])), C(5), A(7)); [ 0:12] 50 V a2[] = [ 0:12] 51 { [ 0:12] 52 V(1), [ 0:12] 53 V(1), [ 0:12] 54 V(1), [ 0:12] 55 V(2), [ 0:12] 56 V(2), [ 0:12] 57 V(2), [ 0:12] 58 V(3), [ 0:12] 59 V(3), [ 0:12] 60 V(3) [ 0:12] 61 }; [ 0:12] 62 M m2(I(a2), I(a2+sizeof(a2)/sizeof(a2[0])), C(5), A(7)); [ 0:12] 63 M m3(std::move(m1), A(7)); [ 0:12] 64 assert(m3 == m2); [ 0:12] 65 assert(m3.get_allocator() == A(7)); [ 0:12] 66 assert(m3.key_comp() == C(5)); [ 0:12] 67 LIBCPP_ASSERT(m1.empty()); [ 0:12] 68 } [ 0:12] 69 { [ 0:12] 70 typedef MoveOnly V; [ 0:12] 71 typedef test_compare > C; [ 0:12] 72 typedef test_allocator A; [ 0:12] 73 typedef std::set M; [ 0:12] 74 typedef std::move_iterator I; [ 0:12] 75 V a1[] = [ 0:12] 76 { [ 0:12] 77 V(1), [ 0:12] 78 V(1), [ 0:12] 79 V(1), [ 0:12] 80 V(2), [ 0:12] 81 V(2), [ 0:12] 82 V(2), [ 0:12] 83 V(3), [ 0:12] 84 V(3), [ 0:12] 85 V(3) [ 0:12] 86 }; [ 0:12] 87 M m1(I(a1), I(a1+sizeof(a1)/sizeof(a1[0])), C(5), A(7)); [ 0:12] 88 V a2[] = [ 0:12] 89 { [ 0:12] 90 V(1), [ 0:12] 91 V(1), [ 0:12] 92 V(1), [ 0:12] 93 V(2), [ 0:12] 94 V(2), [ 0:12] 95 V(2), [ 0:12] 96 V(3), [ 0:12] 97 V(3), [ 0:12] 98 V(3) [ 0:12] 99 }; [ 0:12] 100 M m2(I(a2), I(a2+sizeof(a2)/sizeof(a2[0])), C(5), A(7)); [ 0:12] 101 M m3(std::move(m1), A(5)); [ 0:12] 102 assert(m3 == m2); [ 0:12] 103 assert(m3.get_allocator() == A(5)); [ 0:12] 104 assert(m3.key_comp() == C(5)); [ 0:12] 105 LIBCPP_ASSERT(m1.empty()); [ 0:12] 106 } [ 0:12] 107 { [ 0:12] 108 typedef MoveOnly V; [ 0:12] 109 typedef test_compare > C; [ 0:12] 110 typedef other_allocator A; [ 0:12] 111 typedef std::set M; [ 0:12] 112 typedef std::move_iterator I; [ 0:12] 113 V a1[] = [ 0:12] 114 { [ 0:12] 115 V(1), [ 0:12] 116 V(1), [ 0:12] 117 V(1), [ 0:12] 118 V(2), [ 0:12] 119 V(2), [ 0:12] 120 V(2), [ 0:12] 121 V(3), [ 0:12] 122 V(3), [ 0:12] 123 V(3) [ 0:12] 124 }; [ 0:12] 125 M m1(I(a1), I(a1+sizeof(a1)/sizeof(a1[0])), C(5), A(7)); [ 0:12] 126 V a2[] = [ 0:12] 127 { [ 0:12] 128 V(1), [ 0:12] 129 V(1), [ 0:12] 130 V(1), [ 0:12] 131 V(2), [ 0:12] 132 V(2), [ 0:12] 133 V(2), [ 0:12] 134 V(3), [ 0:12] 135 V(3), [ 0:12] 136 V(3) [ 0:12] 137 }; [ 0:12] 138 M m2(I(a2), I(a2+sizeof(a2)/sizeof(a2[0])), C(5), A(7)); [ 0:12] 139 M m3(std::move(m1), A(5)); [ 0:12] 140 assert(m3 == m2); [ 0:12] 141 assert(m3.get_allocator() == A(5)); [ 0:12] 142 assert(m3.key_comp() == C(5)); [ 0:12] 143 LIBCPP_ASSERT(m1.empty()); [ 0:12] 144 } [ 0:12] 145 { [ 0:12] 146 typedef Counter V; [ 0:12] 147 typedef std::less C; [ 0:12] 148 typedef test_allocator A; [ 0:12] 149 typedef std::set M; [ 0:12] 150 typedef V* I; [ 0:12] 151 Counter_base::gConstructed = 0; [ 0:12] 152 { [ 0:12] 153 V a1[] = [ 0:12] 154 { [ 0:12] 155 V(1), [ 0:12] 156 V(1), [ 0:12] 157 V(1), [ 0:12] 158 V(2), [ 0:12] 159 V(2), [ 0:12] 160 V(2), [ 0:12] 161 V(3), [ 0:12] 162 V(3), [ 0:12] 163 V(3) [ 0:12] 164 }; [ 0:12] 165 const size_t num = sizeof(a1)/sizeof(a1[0]); [ 0:12] 166 assert(Counter_base::gConstructed == num); [ 0:12] 167 [ 0:12] 168 M m1(I(a1), I(a1+num), C(), A()); [ 0:12] 169 assert(Counter_base::gConstructed == 3+num); [ 0:12] 170 [ 0:12] 171 M m2(m1); [ 0:12] 172 assert(m2 == m1); [ 0:12] 173 assert(Counter_base::gConstructed == 6+num); [ 0:12] 174 [ 0:12] 175 M m3(std::move(m1), A()); [ 0:12] 176 assert(m3 == m2); [ 0:12] 177 LIBCPP_ASSERT(m1.empty()); [ 0:12] 178 assert(Counter_base::gConstructed >= (int)(6+num)); [ 0:12] 179 assert(Counter_base::gConstructed <= (int)(m1.size()+6+num)); [ 0:12] 180 [ 0:12] 181 { [ 0:12] 182 M m4(std::move(m2), A(5)); [ 0:12] 183 assert(Counter_base::gConstructed >= (int)(6+num)); [ 0:12] 184 assert(Counter_base::gConstructed <= (int)(m1.size()+m2.size()+6+num)); [ 0:12] 185 assert(m4 == m3); [ 0:12] 186 LIBCPP_ASSERT(m2.empty()); [ 0:12] 187 } [ 0:12] 188 assert(Counter_base::gConstructed >= (int)(3+num)); [ 0:12] 189 assert(Counter_base::gConstructed <= (int)(m1.size()+m2.size()+3+num)); [ 0:12] 190 } [ 0:12] 191 assert(Counter_base::gConstructed == 0); [ 0:12] 192 } [ 0:12] 193 [ 0:12] 194 [ 0:12] 195 return 0; [ 0:12] 196 } [ 0:12] # no errors were expected but one was found anyway