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