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