[ 0:01] compiling /home/xrockai/src/divine/nightly/test/libcxx/deque/erase_iter.invalidation.pass.cpp [ 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.10/_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:06] [ 0:06] 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: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: 79195 [ 0:11] Stack: [ 0:11] #000079195 in __dios_start (l=0, argc=1, argv=94475403961352, envp=94475404038664) at /dios/libc/sys/start.cpp:87 [ 0:11] #100027024 in _ZN6__dios10sched_nullINS_5ClockINS_10NondetKleeINS_4BaseEEEEEE13run_schedulerINS_7ContextEEEvv () at /dios/sys/sched_null.hpp:163 [ 0:11] #200087775 in klee_boot (argc=2, argv=94475369442304) 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 // iterator erase(const_iterator f) [ 0:11] 15 [ 0:11] 16 // Erasing items from the beginning or the end of a deque shall not invalidate iterators [ 0:11] 17 // to items that were not erased. [ 0:11] 18 [ 0:11] 19 #include [ 0:11] 20 #include [ 0:11] 21 [ 0:11] 22 template [ 0:11] 23 void del_at_start(C c) [ 0:11] 24 { [ 0:11] 25 typename C::iterator first = c.begin(); [ 0:11] 26 typename C::iterator it1 = first + 1; [ 0:11] 27 typename C::iterator it2 = c.end() - 1; [ 0:11] 28 [ 0:11] 29 c.erase (first); [ 0:11] 30 [ 0:11] 31 typename C::iterator it3 = c.begin(); [ 0:11] 32 typename C::iterator it4 = c.end() - 1; [ 0:11] 33 assert( it1 == it3); [ 0:11] 34 assert( *it1 == *it3); [ 0:11] 35 assert(&*it1 == &*it3); [ 0:11] 36 assert( it2 == it4); [ 0:11] 37 assert( *it2 == *it4); [ 0:11] 38 assert(&*it2 == &*it4); [ 0:11] 39 } [ 0:11] 40 [ 0:11] 41 template [ 0:11] 42 void del_at_end(C c) [ 0:11] 43 { [ 0:11] 44 typename C::iterator first = c.end() - 1; [ 0:11] 45 typename C::iterator it1 = c.begin(); [ 0:11] 46 typename C::iterator it2 = first - 1; [ 0:11] 47 [ 0:11] 48 c.erase (first); [ 0:11] 49 [ 0:11] 50 typename C::iterator it3 = c.begin(); [ 0:11] 51 typename C::iterator it4 = c.end() - 1; [ 0:11] 52 assert( it1 == it3); [ 0:11] 53 assert( *it1 == *it3); [ 0:11] 54 assert(&*it1 == &*it3); [ 0:11] 55 assert( it2 == it4); [ 0:11] 56 assert( *it2 == *it4); [ 0:11] 57 assert(&*it2 == &*it4); [ 0:11] 58 } [ 0:11] 59 [ 0:11] 60 int main() [ 0:11] 61 { [ 0:11] 62 std::deque queue; [ 0:11] 63 for (int i = 0; i < 20; ++i) [ 0:11] 64 queue.push_back(i); [ 0:11] 65 [ 0:11] 66 while (queue.size() > 1) [ 0:11] 67 { [ 0:11] 68 del_at_start(queue); [ 0:11] 69 del_at_end(queue); [ 0:11] 70 queue.pop_back(); [ 0:11] 71 } [ 0:11] 72 } [ 0:11] # no errors were expected but one was found anyway