[ 0:01] compiling /home/xrockai/src/divine/nightly/test/libcxx/forwardlist/erase_after_many.pass.cpp [ 0:01] 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.8/_klee_out" [ 0:07] KLEE: Using Z3 solver backend [ 0:07] WARNING: this target does not support the llvm.stacksave intrinsic. [ 0:07] 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:12] KLEE: WARNING: undefined reference to function: __dios_tainted_init [ 0:12] KLEE: WARNING: undefined reference to function: klee_free [ 0:12] KLEE: WARNING: undefined reference to function: klee_malloc [ 0:12] KLEE: WARNING ONCE: Using zero size array fix for landingpad instruction filter [ 0:13] i:1 [ 0:13] KLEE: WARNING ONCE: Alignment of memory from call "klee_malloc" is not modelled. Using alignment of 8. [ 0:13] about to __boot:0 [ 0:13] about to run the scheduler:0 [ 0:13] KLEE: WARNING ONCE: calling external: __dios_tainted_init() at /dios/libc/sys/start.cpp:49 5 [ 0:13] KLEE: ERROR: /dios/libc/sys/start.cpp:87: failed external call: __dios_tainted_init [ 0:13] KLEE: NOTE: now ignoring this error at this location [ 0:13] KLEE: ERROR: EXITING ON ERROR: [ 0:13] Error: failed external call: __dios_tainted_init [ 0:13] File: /dios/libc/sys/start.cpp [ 0:13] Line: 87 [ 0:13] assembly.ll line: 92367 [ 0:13] Stack: [ 0:13] #000092367 in __dios_start (l=0, argc=1, argv=93845480641032, envp=93845480718344) at /dios/libc/sys/start.cpp:87 [ 0:13] #100040196 in _ZN6__dios10sched_nullINS_5ClockINS_10NondetKleeINS_4BaseEEEEEE13run_schedulerINS_7ContextEEEvv () at /dios/sys/sched_null.hpp:163 [ 0:13] #200100947 in klee_boot (argc=2, argv=93845448805760) at /dios/arch/klee/boot.c:41 [ 0:13] [ 0:13] [ 0:13] 1 /* TAGS: c++ */ [ 0:13] 2 /* VERIFY_OPTS: -o nofail:malloc */ [ 0:13] 3 //===----------------------------------------------------------------------===// [ 0:13] 4 // [ 0:13] 5 // The LLVM Compiler Infrastructure [ 0:13] 6 // [ 0:13] 7 // This file is dual licensed under the MIT and the University of Illinois Open [ 0:13] 8 // Source Licenses. See LICENSE.TXT for details. [ 0:13] 9 // [ 0:13] 10 //===----------------------------------------------------------------------===// [ 0:13] 11 [ 0:13] 12 // [ 0:13] 13 [ 0:13] 14 // iterator erase_after(const_iterator first, const_iterator last); [ 0:13] 15 [ 0:13] 16 #include [ 0:13] 17 #include [ 0:13] 18 [ 0:13] 19 #include "min_allocator.h" [ 0:13] 20 [ 0:13] 21 int main() [ 0:13] 22 { [ 0:13] 23 { [ 0:13] 24 typedef int T; [ 0:13] 25 typedef std::forward_list C; [ 0:13] 26 const T t[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}; [ 0:13] 27 C c(std::begin(t), std::end(t)); [ 0:13] 28 [ 0:13] 29 C::iterator i = c.erase_after(next(c.cbefore_begin(), 4), next(c.cbefore_begin(), 4)); [ 0:13] 30 assert(i == next(c.cbefore_begin(), 4)); [ 0:13] 31 assert(distance(c.begin(), c.end()) == 10); [ 0:13] 32 assert(*next(c.begin(), 0) == 0); [ 0:13] 33 assert(*next(c.begin(), 1) == 1); [ 0:13] 34 assert(*next(c.begin(), 2) == 2); [ 0:13] 35 assert(*next(c.begin(), 3) == 3); [ 0:13] 36 assert(*next(c.begin(), 4) == 4); [ 0:13] 37 assert(*next(c.begin(), 5) == 5); [ 0:13] 38 assert(*next(c.begin(), 6) == 6); [ 0:13] 39 assert(*next(c.begin(), 7) == 7); [ 0:13] 40 assert(*next(c.begin(), 8) == 8); [ 0:13] 41 assert(*next(c.begin(), 9) == 9); [ 0:13] 42 [ 0:13] 43 i = c.erase_after(next(c.cbefore_begin(), 2), next(c.cbefore_begin(), 5)); [ 0:13] 44 assert(i == next(c.begin(), 2)); [ 0:13] 45 assert(distance(c.begin(), c.end()) == 8); [ 0:13] 46 assert(*next(c.begin(), 0) == 0); [ 0:13] 47 assert(*next(c.begin(), 1) == 1); [ 0:13] 48 assert(*next(c.begin(), 2) == 4); [ 0:13] 49 assert(*next(c.begin(), 3) == 5); [ 0:13] 50 assert(*next(c.begin(), 4) == 6); [ 0:13] 51 assert(*next(c.begin(), 5) == 7); [ 0:13] 52 assert(*next(c.begin(), 6) == 8); [ 0:13] 53 assert(*next(c.begin(), 7) == 9); [ 0:13] 54 [ 0:13] 55 i = c.erase_after(next(c.cbefore_begin(), 2), next(c.cbefore_begin(), 3)); [ 0:13] 56 assert(i == next(c.begin(), 2)); [ 0:13] 57 assert(distance(c.begin(), c.end()) == 8); [ 0:13] 58 assert(*next(c.begin(), 0) == 0); [ 0:13] 59 assert(*next(c.begin(), 1) == 1); [ 0:13] 60 assert(*next(c.begin(), 2) == 4); [ 0:13] 61 assert(*next(c.begin(), 3) == 5); [ 0:13] 62 assert(*next(c.begin(), 4) == 6); [ 0:13] 63 assert(*next(c.begin(), 5) == 7); [ 0:13] 64 assert(*next(c.begin(), 6) == 8); [ 0:13] 65 assert(*next(c.begin(), 7) == 9); [ 0:13] 66 [ 0:13] 67 i = c.erase_after(next(c.cbefore_begin(), 5), next(c.cbefore_begin(), 9)); [ 0:13] 68 assert(i == c.end()); [ 0:13] 69 assert(distance(c.begin(), c.end()) == 5); [ 0:13] 70 assert(*next(c.begin(), 0) == 0); [ 0:13] 71 assert(*next(c.begin(), 1) == 1); [ 0:13] 72 assert(*next(c.begin(), 2) == 4); [ 0:13] 73 assert(*next(c.begin(), 3) == 5); [ 0:13] 74 assert(*next(c.begin(), 4) == 6); [ 0:13] 75 [ 0:13] 76 i = c.erase_after(next(c.cbefore_begin(), 0), next(c.cbefore_begin(), 2)); [ 0:13] 77 assert(i == c.begin()); [ 0:13] 78 assert(distance(c.begin(), c.end()) == 4); [ 0:13] 79 assert(*next(c.begin(), 0) == 1); [ 0:13] 80 assert(*next(c.begin(), 1) == 4); [ 0:13] 81 assert(*next(c.begin(), 2) == 5); [ 0:13] 82 assert(*next(c.begin(), 3) == 6); [ 0:13] 83 [ 0:13] 84 i = c.erase_after(next(c.cbefore_begin(), 0), next(c.cbefore_begin(), 5)); [ 0:13] 85 assert(i == c.begin()); [ 0:13] 86 assert(i == c.end()); [ 0:13] 87 assert(distance(c.begin(), c.end()) == 0); [ 0:13] 88 } [ 0:13] 89 #if __cplusplus >= 201103L [ 0:13] 90 { [ 0:13] 91 typedef int T; [ 0:13] 92 typedef std::forward_list> C; [ 0:13] 93 const T t[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}; [ 0:13] 94 C c(std::begin(t), std::end(t)); [ 0:13] 95 [ 0:13] 96 C::iterator i = c.erase_after(next(c.cbefore_begin(), 4), next(c.cbefore_begin(), 4)); [ 0:13] 97 assert(i == next(c.cbefore_begin(), 4)); [ 0:13] 98 assert(distance(c.begin(), c.end()) == 10); [ 0:13] 99 assert(*next(c.begin(), 0) == 0); [ 0:13] 100 assert(*next(c.begin(), 1) == 1); [ 0:13] 101 assert(*next(c.begin(), 2) == 2); [ 0:13] 102 assert(*next(c.begin(), 3) == 3); [ 0:13] 103 assert(*next(c.begin(), 4) == 4); [ 0:13] 104 assert(*next(c.begin(), 5) == 5); [ 0:13] 105 assert(*next(c.begin(), 6) == 6); [ 0:13] 106 assert(*next(c.begin(), 7) == 7); [ 0:13] 107 assert(*next(c.begin(), 8) == 8); [ 0:13] 108 assert(*next(c.begin(), 9) == 9); [ 0:13] 109 [ 0:13] 110 i = c.erase_after(next(c.cbefore_begin(), 2), next(c.cbefore_begin(), 5)); [ 0:13] 111 assert(i == next(c.begin(), 2)); [ 0:13] 112 assert(distance(c.begin(), c.end()) == 8); [ 0:13] 113 assert(*next(c.begin(), 0) == 0); [ 0:13] 114 assert(*next(c.begin(), 1) == 1); [ 0:13] 115 assert(*next(c.begin(), 2) == 4); [ 0:13] 116 assert(*next(c.begin(), 3) == 5); [ 0:13] 117 assert(*next(c.begin(), 4) == 6); [ 0:13] 118 assert(*next(c.begin(), 5) == 7); [ 0:13] 119 assert(*next(c.begin(), 6) == 8); [ 0:13] 120 assert(*next(c.begin(), 7) == 9); [ 0:13] 121 [ 0:13] 122 i = c.erase_after(next(c.cbefore_begin(), 2), next(c.cbefore_begin(), 3)); [ 0:13] 123 assert(i == next(c.begin(), 2)); [ 0:13] 124 assert(distance(c.begin(), c.end()) == 8); [ 0:13] 125 assert(*next(c.begin(), 0) == 0); [ 0:13] 126 assert(*next(c.begin(), 1) == 1); [ 0:13] 127 assert(*next(c.begin(), 2) == 4); [ 0:13] 128 assert(*next(c.begin(), 3) == 5); [ 0:13] 129 assert(*next(c.begin(), 4) == 6); [ 0:13] 130 assert(*next(c.begin(), 5) == 7); [ 0:13] 131 assert(*next(c.begin(), 6) == 8); [ 0:13] 132 assert(*next(c.begin(), 7) == 9); [ 0:13] 133 [ 0:13] 134 i = c.erase_after(next(c.cbefore_begin(), 5), next(c.cbefore_begin(), 9)); [ 0:13] 135 assert(i == c.end()); [ 0:13] 136 assert(distance(c.begin(), c.end()) == 5); [ 0:13] 137 assert(*next(c.begin(), 0) == 0); [ 0:13] 138 assert(*next(c.begin(), 1) == 1); [ 0:13] 139 assert(*next(c.begin(), 2) == 4); [ 0:13] 140 assert(*next(c.begin(), 3) == 5); [ 0:13] 141 assert(*next(c.begin(), 4) == 6); [ 0:13] 142 [ 0:13] 143 i = c.erase_after(next(c.cbefore_begin(), 0), next(c.cbefore_begin(), 2)); [ 0:13] 144 assert(i == c.begin()); [ 0:13] 145 assert(distance(c.begin(), c.end()) == 4); [ 0:13] 146 assert(*next(c.begin(), 0) == 1); [ 0:13] 147 assert(*next(c.begin(), 1) == 4); [ 0:13] 148 assert(*next(c.begin(), 2) == 5); [ 0:13] 149 assert(*next(c.begin(), 3) == 6); [ 0:13] 150 [ 0:13] 151 i = c.erase_after(next(c.cbefore_begin(), 0), next(c.cbefore_begin(), 5)); [ 0:13] 152 assert(i == c.begin()); [ 0:13] 153 assert(i == c.end()); [ 0:13] 154 assert(distance(c.begin(), c.end()) == 0); [ 0:13] 155 } [ 0:13] 156 #endif [ 0:13] 157 } [ 0:13] # no errors were expected but one was found anyway