[ 0:01] compiling /home/xrockai/src/divine/nightly/test/libcxx/algorithms/find_end.pass.cpp [ 0:01] In file included from /home/xrockai/src/divine/nightly/test/libcxx/algorithms/find_end.pass.cpp:19: [ 0:01] In file included from /dios/libcxx/include/algorithm:639: [ 0:01] In file included from /dios/libcxx/include/initializer_list:46: [ 0:01] In file included from /dios/libcxx/include/cstddef:44: [ 0:01] In file included from /dios/include/stddef.h:10: [ 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.1/_klee_out" [ 0:05] KLEE: Using Z3 solver backend [ 0:05] WARNING: this target does not support the llvm.stacksave intrinsic. [ 0:05] 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:05] [ 0:05] KLEE: WARNING: undefined reference to function: __dios_tainted_init [ 0:08] KLEE: WARNING: undefined reference to function: klee_free [ 0:08] KLEE: WARNING: undefined reference to function: klee_malloc [ 0:08] i:1 [ 0:08] KLEE: WARNING ONCE: Alignment of memory from call "klee_malloc" is not modelled. Using alignment of 8. [ 0:08] about to __boot:0 [ 0:08] about to run the scheduler:0 [ 0:08] KLEE: WARNING ONCE: calling external: __dios_tainted_init() at /dios/libc/sys/start.cpp:49 5 [ 0:08] KLEE: ERROR: /dios/libc/sys/start.cpp:87: failed external call: __dios_tainted_init [ 0:08] KLEE: NOTE: now ignoring this error at this location [ 0:08] KLEE: ERROR: EXITING ON ERROR: [ 0:08] Error: failed external call: __dios_tainted_init [ 0:08] File: /dios/libc/sys/start.cpp [ 0:08] Line: 87 [ 0:08] assembly.ll line: 45696 [ 0:08] Stack: [ 0:08] #000045696 in __dios_start (l=2, argc=1, argv=94096932614664, envp=94096932683784) at /dios/libc/sys/start.cpp:87 [ 0:08] #100021705 in _ZN6__dios10sched_nullINS_5ClockINS_10NondetKleeINS_4BaseEEEEEE13run_schedulerINS_7ContextEEEvv () at /dios/sys/sched_null.hpp:163 [ 0:08] #200053944 in klee_boot (argc=2, argv=94096903280640) at /dios/arch/klee/boot.c:41 [ 0:08] [ 0:08] [ 0:08] 1 /* TAGS: c++ fin */ [ 0:08] 2 /* CC_OPTS: -std=c++2a */ [ 0:08] 3 /* VERIFY_OPTS: -o nofail:malloc */ [ 0:08] 4 //===----------------------------------------------------------------------===// [ 0:08] 5 // [ 0:08] 6 // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. [ 0:08] 7 // See https://llvm.org/LICENSE.txt for license information. [ 0:08] 8 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception [ 0:08] 9 // [ 0:08] 10 //===----------------------------------------------------------------------===// [ 0:08] 11 [ 0:08] 12 // [ 0:08] 13 [ 0:08] 14 // template [ 0:08] 15 // requires HasEqualTo [ 0:08] 16 // constexpr Iter1 // constexpr after C++17 [ 0:08] 17 // find_end(Iter1 first1, Iter1 last1, Iter2 first2, Iter2 last2); [ 0:08] 18 [ 0:08] 19 #include [ 0:08] 20 #include [ 0:08] 21 [ 0:08] 22 #include "test_macros.h" [ 0:08] 23 #include "test_iterators.h" [ 0:08] 24 [ 0:08] 25 #if TEST_STD_VER > 17 [ 0:08] 26 TEST_CONSTEXPR bool test_constexpr() { [ 0:08] 27 int ia[] = {0, 1, 2}; [ 0:08] 28 int ib[] = {4, 5, 6}; [ 0:08] 29 int ic[] = {0, 1, 2, 3, 4, 5, 0, 1, 2, 3, 4, 0, 1, 2, 3, 0, 1, 2, 0, 1, 0}; [ 0:08] 30 typedef forward_iterator FI; [ 0:08] 31 typedef bidirectional_iterator BI; [ 0:08] 32 typedef random_access_iterator RI; [ 0:08] 33 [ 0:08] 34 return (std::find_end(FI(std::begin(ic)), FI(std::end(ic)), FI(std::begin(ia)), FI(std::end(ia))) == FI(ic+15)) [ 0:08] 35 && (std::find_end(FI(std::begin(ic)), FI(std::end(ic)), FI(std::begin(ib)), FI(std::end(ib))) == FI(std::end(ic))) [ 0:08] 36 && (std::find_end(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ia)), BI(std::end(ia))) == BI(ic+15)) [ 0:08] 37 && (std::find_end(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ib)), BI(std::end(ib))) == BI(std::end(ic))) [ 0:08] 38 && (std::find_end(RI(std::begin(ic)), RI(std::end(ic)), RI(std::begin(ia)), RI(std::end(ia))) == RI(ic+15)) [ 0:08] 39 && (std::find_end(RI(std::begin(ic)), RI(std::end(ic)), RI(std::begin(ib)), RI(std::end(ib))) == RI(std::end(ic))) [ 0:08] 40 ; [ 0:08] 41 } [ 0:08] 42 #endif [ 0:08] 43 [ 0:08] 44 template [ 0:08] 45 void [ 0:08] 46 test() [ 0:08] 47 { [ 0:08] 48 int ia[] = {0, 1, 2, 3, 4, 5, 0, 1, 2, 3, 4, 0, 1, 2, 3, 0, 1, 2, 0, 1, 0}; [ 0:08] 49 const unsigned sa = sizeof(ia)/sizeof(ia[0]); [ 0:08] 50 int b[] = {0}; [ 0:08] 51 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(b), Iter2(b+1)) == Iter1(ia+sa-1)); [ 0:08] 52 int c[] = {0, 1}; [ 0:08] 53 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(c), Iter2(c+2)) == Iter1(ia+18)); [ 0:08] 54 int d[] = {0, 1, 2}; [ 0:08] 55 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(d), Iter2(d+3)) == Iter1(ia+15)); [ 0:08] 56 int e[] = {0, 1, 2, 3}; [ 0:08] 57 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(e), Iter2(e+4)) == Iter1(ia+11)); [ 0:08] 58 int f[] = {0, 1, 2, 3, 4}; [ 0:08] 59 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(f), Iter2(f+5)) == Iter1(ia+6)); [ 0:08] 60 int g[] = {0, 1, 2, 3, 4, 5}; [ 0:08] 61 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(g), Iter2(g+6)) == Iter1(ia)); [ 0:08] 62 int h[] = {0, 1, 2, 3, 4, 5, 6}; [ 0:08] 63 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(h), Iter2(h+7)) == Iter1(ia+sa)); [ 0:08] 64 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(b), Iter2(b)) == Iter1(ia+sa)); [ 0:08] 65 assert(std::find_end(Iter1(ia), Iter1(ia), Iter2(b), Iter2(b+1)) == Iter1(ia)); [ 0:08] 66 } [ 0:08] 67 [ 0:08] 68 int main(int, char**) [ 0:08] 69 { [ 0:08] 70 test, forward_iterator >(); [ 0:08] 71 test, bidirectional_iterator >(); [ 0:08] 72 test, random_access_iterator >(); [ 0:08] 73 test, forward_iterator >(); [ 0:08] 74 test, bidirectional_iterator >(); [ 0:08] 75 test, random_access_iterator >(); [ 0:08] 76 test, forward_iterator >(); [ 0:08] 77 test, bidirectional_iterator >(); [ 0:08] 78 test, random_access_iterator >(); [ 0:08] 79 [ 0:08] 80 #if TEST_STD_VER > 17 [ 0:08] 81 static_assert(test_constexpr()); [ 0:08] 82 #endif [ 0:08] 83 [ 0:08] 84 return 0; [ 0:08] 85 } [ 0:08] # no errors were expected but one was found anyway