[ 0:01] compiling /home/xrockai/src/divine/nightly/test/libcxx/containers/erase_key.pass.cpp [ 0:01] In file included from /home/xrockai/src/divine/nightly/test/libcxx/containers/erase_key.pass.cpp:18: [ 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:04] setting up pass: fuse-ctors, options = [ 0:04] KLEE: output directory is "/var/obj/divine-nightly/semidbg/test/__test_work_dir.2/_klee_out" [ 0:07] KLEE: Using Z3 solver backend [ 0:07] WARNING: this target does not support the llvm.stacksave intrinsic. [ 0:08] 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:08] [ 0:08] KLEE: WARNING: undefined reference to function: _Z10klee_abortv [ 0:13] KLEE: WARNING: undefined reference to function: __dios_tainted_init [ 0:13] KLEE: WARNING: undefined reference to function: klee_free [ 0:13] KLEE: WARNING: undefined reference to function: klee_malloc [ 0:13] KLEE: WARNING ONCE: Using zero size array fix for landingpad instruction filter [ 0:14] i:1 [ 0:14] KLEE: WARNING ONCE: Alignment of memory from call "klee_malloc" is not modelled. Using alignment of 8. [ 0:14] about to __boot:0 [ 0:14] about to run the scheduler:0 [ 0:14] KLEE: WARNING ONCE: calling external: __dios_tainted_init() at /dios/libc/sys/start.cpp:49 5 [ 0:14] KLEE: ERROR: /dios/libc/sys/start.cpp:87: failed external call: __dios_tainted_init [ 0:14] KLEE: NOTE: now ignoring this error at this location [ 0:14] KLEE: ERROR: EXITING ON ERROR: [ 0:14] Error: failed external call: __dios_tainted_init [ 0:14] File: /dios/libc/sys/start.cpp [ 0:14] Line: 87 [ 0:14] assembly.ll line: 121014 [ 0:14] Stack: [ 0:14] #000121014 in __dios_start (l=2, argc=1, argv=94536915833352, envp=94536915894280) at /dios/libc/sys/start.cpp:87 [ 0:14] #100068843 in _ZN6__dios10sched_nullINS_5ClockINS_10NondetKleeINS_4BaseEEEEEE13run_schedulerINS_7ContextEEEvv () at /dios/sys/sched_null.hpp:163 [ 0:14] #200129594 in klee_boot (argc=2, argv=94536878496128) at /dios/arch/klee/boot.c:41 [ 0:14] [ 0:14] [ 0:14] 1 /* TAGS: c++ fin */ [ 0:14] 2 /* CC_OPTS: -std=c++2a */ [ 0:14] 3 /* VERIFY_OPTS: -o nofail:malloc */ [ 0:14] 4 //===----------------------------------------------------------------------===// [ 0:14] 5 // [ 0:14] 6 // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. [ 0:14] 7 // See https://llvm.org/LICENSE.txt for license information. [ 0:14] 8 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception [ 0:14] 9 // [ 0:14] 10 //===----------------------------------------------------------------------===// [ 0:14] 11 [ 0:14] 12 // [ 0:14] 13 [ 0:14] 14 // class set [ 0:14] 15 [ 0:14] 16 // size_type erase(const key_type& k); [ 0:14] 17 [ 0:14] 18 #include [ 0:14] 19 #include [ 0:14] 20 [ 0:14] 21 #include "test_macros.h" [ 0:14] 22 #include "min_allocator.h" [ 0:14] 23 [ 0:14] 24 int main(int, char**) [ 0:14] 25 { [ 0:14] 26 { [ 0:14] 27 typedef std::set M; [ 0:14] 28 typedef int V; [ 0:14] 29 typedef M::size_type I; [ 0:14] 30 V ar[] = [ 0:14] 31 { [ 0:14] 32 1, [ 0:14] 33 2, [ 0:14] 34 3, [ 0:14] 35 4, [ 0:14] 36 5, [ 0:14] 37 6, [ 0:14] 38 7, [ 0:14] 39 8 [ 0:14] 40 }; [ 0:14] 41 M m(ar, ar + sizeof(ar)/sizeof(ar[0])); [ 0:14] 42 assert(m.size() == 8); [ 0:14] 43 I i = m.erase(9); [ 0:14] 44 assert(m.size() == 8); [ 0:14] 45 assert(i == 0); [ 0:14] 46 assert(*next(m.begin(), 0) == 1); [ 0:14] 47 assert(*next(m.begin(), 1) == 2); [ 0:14] 48 assert(*next(m.begin(), 2) == 3); [ 0:14] 49 assert(*next(m.begin(), 3) == 4); [ 0:14] 50 assert(*next(m.begin(), 4) == 5); [ 0:14] 51 assert(*next(m.begin(), 5) == 6); [ 0:14] 52 assert(*next(m.begin(), 6) == 7); [ 0:14] 53 assert(*next(m.begin(), 7) == 8); [ 0:14] 54 [ 0:14] 55 i = m.erase(4); [ 0:14] 56 assert(m.size() == 7); [ 0:14] 57 assert(i == 1); [ 0:14] 58 assert(*next(m.begin(), 0) == 1); [ 0:14] 59 assert(*next(m.begin(), 1) == 2); [ 0:14] 60 assert(*next(m.begin(), 2) == 3); [ 0:14] 61 assert(*next(m.begin(), 3) == 5); [ 0:14] 62 assert(*next(m.begin(), 4) == 6); [ 0:14] 63 assert(*next(m.begin(), 5) == 7); [ 0:14] 64 assert(*next(m.begin(), 6) == 8); [ 0:14] 65 [ 0:14] 66 i = m.erase(1); [ 0:14] 67 assert(m.size() == 6); [ 0:14] 68 assert(i == 1); [ 0:14] 69 assert(*next(m.begin(), 0) == 2); [ 0:14] 70 assert(*next(m.begin(), 1) == 3); [ 0:14] 71 assert(*next(m.begin(), 2) == 5); [ 0:14] 72 assert(*next(m.begin(), 3) == 6); [ 0:14] 73 assert(*next(m.begin(), 4) == 7); [ 0:14] 74 assert(*next(m.begin(), 5) == 8); [ 0:14] 75 [ 0:14] 76 i = m.erase(8); [ 0:14] 77 assert(m.size() == 5); [ 0:14] 78 assert(i == 1); [ 0:14] 79 assert(*next(m.begin(), 0) == 2); [ 0:14] 80 assert(*next(m.begin(), 1) == 3); [ 0:14] 81 assert(*next(m.begin(), 2) == 5); [ 0:14] 82 assert(*next(m.begin(), 3) == 6); [ 0:14] 83 assert(*next(m.begin(), 4) == 7); [ 0:14] 84 [ 0:14] 85 i = m.erase(3); [ 0:14] 86 assert(m.size() == 4); [ 0:14] 87 assert(i == 1); [ 0:14] 88 assert(*next(m.begin(), 0) == 2); [ 0:14] 89 assert(*next(m.begin(), 1) == 5); [ 0:14] 90 assert(*next(m.begin(), 2) == 6); [ 0:14] 91 assert(*next(m.begin(), 3) == 7); [ 0:14] 92 [ 0:14] 93 i = m.erase(6); [ 0:14] 94 assert(m.size() == 3); [ 0:14] 95 assert(i == 1); [ 0:14] 96 assert(*next(m.begin(), 0) == 2); [ 0:14] 97 assert(*next(m.begin(), 1) == 5); [ 0:14] 98 assert(*next(m.begin(), 2) == 7); [ 0:14] 99 [ 0:14] 100 i = m.erase(7); [ 0:14] 101 assert(m.size() == 2); [ 0:14] 102 assert(i == 1); [ 0:14] 103 assert(*next(m.begin(), 0) == 2); [ 0:14] 104 assert(*next(m.begin(), 1) == 5); [ 0:14] 105 [ 0:14] 106 i = m.erase(2); [ 0:14] 107 assert(m.size() == 1); [ 0:14] 108 assert(i == 1); [ 0:14] 109 assert(*next(m.begin(), 0) == 5); [ 0:14] 110 [ 0:14] 111 i = m.erase(5); [ 0:14] 112 assert(m.size() == 0); [ 0:14] 113 assert(i == 1); [ 0:14] 114 } [ 0:14] 115 #if TEST_STD_VER >= 11 [ 0:14] 116 { [ 0:14] 117 typedef std::set, min_allocator> M; [ 0:14] 118 typedef int V; [ 0:14] 119 typedef M::size_type I; [ 0:14] 120 V ar[] = [ 0:14] 121 { [ 0:14] 122 1, [ 0:14] 123 2, [ 0:14] 124 3, [ 0:14] 125 4, [ 0:14] 126 5, [ 0:14] 127 6, [ 0:14] 128 7, [ 0:14] 129 8 [ 0:14] 130 }; [ 0:14] 131 M m(ar, ar + sizeof(ar)/sizeof(ar[0])); [ 0:14] 132 assert(m.size() == 8); [ 0:14] 133 I i = m.erase(9); [ 0:14] 134 assert(m.size() == 8); [ 0:14] 135 assert(i == 0); [ 0:14] 136 assert(*next(m.begin(), 0) == 1); [ 0:14] 137 assert(*next(m.begin(), 1) == 2); [ 0:14] 138 assert(*next(m.begin(), 2) == 3); [ 0:14] 139 assert(*next(m.begin(), 3) == 4); [ 0:14] 140 assert(*next(m.begin(), 4) == 5); [ 0:14] 141 assert(*next(m.begin(), 5) == 6); [ 0:14] 142 assert(*next(m.begin(), 6) == 7); [ 0:14] 143 assert(*next(m.begin(), 7) == 8); [ 0:14] 144 [ 0:14] 145 i = m.erase(4); [ 0:14] 146 assert(m.size() == 7); [ 0:14] 147 assert(i == 1); [ 0:14] 148 assert(*next(m.begin(), 0) == 1); [ 0:14] 149 assert(*next(m.begin(), 1) == 2); [ 0:14] 150 assert(*next(m.begin(), 2) == 3); [ 0:14] 151 assert(*next(m.begin(), 3) == 5); [ 0:14] 152 assert(*next(m.begin(), 4) == 6); [ 0:14] 153 assert(*next(m.begin(), 5) == 7); [ 0:14] 154 assert(*next(m.begin(), 6) == 8); [ 0:14] 155 [ 0:14] 156 i = m.erase(1); [ 0:14] 157 assert(m.size() == 6); [ 0:14] 158 assert(i == 1); [ 0:14] 159 assert(*next(m.begin(), 0) == 2); [ 0:14] 160 assert(*next(m.begin(), 1) == 3); [ 0:14] 161 assert(*next(m.begin(), 2) == 5); [ 0:14] 162 assert(*next(m.begin(), 3) == 6); [ 0:14] 163 assert(*next(m.begin(), 4) == 7); [ 0:14] 164 assert(*next(m.begin(), 5) == 8); [ 0:14] 165 [ 0:14] 166 i = m.erase(8); [ 0:14] 167 assert(m.size() == 5); [ 0:14] 168 assert(i == 1); [ 0:14] 169 assert(*next(m.begin(), 0) == 2); [ 0:14] 170 assert(*next(m.begin(), 1) == 3); [ 0:14] 171 assert(*next(m.begin(), 2) == 5); [ 0:14] 172 assert(*next(m.begin(), 3) == 6); [ 0:14] 173 assert(*next(m.begin(), 4) == 7); [ 0:14] 174 [ 0:14] 175 i = m.erase(3); [ 0:14] 176 assert(m.size() == 4); [ 0:14] 177 assert(i == 1); [ 0:14] 178 assert(*next(m.begin(), 0) == 2); [ 0:14] 179 assert(*next(m.begin(), 1) == 5); [ 0:14] 180 assert(*next(m.begin(), 2) == 6); [ 0:14] 181 assert(*next(m.begin(), 3) == 7); [ 0:14] 182 [ 0:14] 183 i = m.erase(6); [ 0:14] 184 assert(m.size() == 3); [ 0:14] 185 assert(i == 1); [ 0:14] 186 assert(*next(m.begin(), 0) == 2); [ 0:14] 187 assert(*next(m.begin(), 1) == 5); [ 0:14] 188 assert(*next(m.begin(), 2) == 7); [ 0:14] 189 [ 0:14] 190 i = m.erase(7); [ 0:14] 191 assert(m.size() == 2); [ 0:14] 192 assert(i == 1); [ 0:14] 193 assert(*next(m.begin(), 0) == 2); [ 0:14] 194 assert(*next(m.begin(), 1) == 5); [ 0:14] 195 [ 0:14] 196 i = m.erase(2); [ 0:14] 197 assert(m.size() == 1); [ 0:14] 198 assert(i == 1); [ 0:14] 199 assert(*next(m.begin(), 0) == 5); [ 0:14] 200 [ 0:14] 201 i = m.erase(5); [ 0:14] 202 assert(m.size() == 0); [ 0:14] 203 assert(i == 1); [ 0:14] 204 } [ 0:14] 205 #endif [ 0:14] 206 [ 0:14] 207 return 0; [ 0:14] 208 } [ 0:14] # no errors were expected but one was found anyway