[ 0:00] compiling /home/xrockai/src/divine/nightly/test/libcxx/algorithms/equal_pred.pass.cpp [ 0:00] In file included from /home/xrockai/src/divine/nightly/test/libcxx/algorithms/equal_pred.pass.cpp:28: [ 0:00] In file included from /dios/libcxx/include/algorithm:639: [ 0:00] In file included from /dios/libcxx/include/initializer_list:46: [ 0:00] In file included from /dios/libcxx/include/cstddef:44: [ 0:00] In file included from /dios/include/stddef.h:10: [ 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:02] setting up pass: fuse-ctors, options = [ 0:02] KLEE: output directory is "/var/obj/divine-nightly/semidbg/test/__test_work_dir.12/_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: 35471 [ 0:07] Stack: [ 0:07] #000035471 in __dios_start (l=2, argc=1, argv=94388309135880, envp=94388309196808) at /dios/libc/sys/start.cpp:87 [ 0:07] #100011480 in _ZN6__dios10sched_nullINS_5ClockINS_10NondetKleeINS_4BaseEEEEEE13run_schedulerINS_7ContextEEEvv () at /dios/sys/sched_null.hpp:163 [ 0:07] #200043719 in klee_boot (argc=2, argv=94388283521792) 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 bool // constexpr after c++17 [ 0:07] 18 // equal(Iter1 first1, Iter1 last1, Iter2 first2, Pred pred); [ 0:07] 19 // [ 0:07] 20 // Introduced in C++14: [ 0:07] 21 // template Pred> [ 0:07] 23 // requires CopyConstructible [ 0:07] 24 // constexpr bool // constexpr after c++17 [ 0:07] 25 // equal(Iter1 first1, Iter1 last1, Iter2 first2, Iter2 last2, Pred pred); [ 0:07] 26 [ 0:07] 27 [ 0:07] 28 #include [ 0:07] 29 #include [ 0:07] 30 #include [ 0:07] 31 [ 0:07] 32 #include "test_macros.h" [ 0:07] 33 #include "test_iterators.h" [ 0:07] 34 [ 0:07] 35 #if TEST_STD_VER > 17 [ 0:07] 36 TEST_CONSTEXPR bool eq(int a, int b) { return a == b; } [ 0:07] 37 [ 0:07] 38 TEST_CONSTEXPR bool test_constexpr() { [ 0:07] 39 int ia[] = {1, 3, 6, 7}; [ 0:07] 40 int ib[] = {1, 3}; [ 0:07] 41 int ic[] = {1, 3, 5, 7}; [ 0:07] 42 typedef input_iterator II; [ 0:07] 43 typedef bidirectional_iterator BI; [ 0:07] 44 [ 0:07] 45 return !std::equal(std::begin(ia), std::end(ia), std::begin(ic) , eq) [ 0:07] 46 && !std::equal(std::begin(ia), std::end(ia), std::begin(ic), std::end(ic), eq) [ 0:07] 47 && std::equal(std::begin(ib), std::end(ib), std::begin(ic) , eq) [ 0:07] 48 && !std::equal(std::begin(ib), std::end(ib), std::begin(ic), std::end(ic), eq) [ 0:07] 49 [ 0:07] 50 && std::equal(II(std::begin(ib)), II(std::end(ib)), II(std::begin(ic)) , eq) [ 0:07] 51 && !std::equal(BI(std::begin(ib)), BI(std::end(ib)), BI(std::begin(ic)), BI(std::end(ic)), eq) [ 0:07] 52 ; [ 0:07] 53 } [ 0:07] 54 #endif [ 0:07] 55 [ 0:07] 56 [ 0:07] 57 int comparison_count = 0; [ 0:07] 58 template [ 0:07] 59 bool counting_equals ( const T &a, const T &b ) { [ 0:07] 60 ++comparison_count; [ 0:07] 61 return a == b; [ 0:07] 62 } [ 0:07] 63 [ 0:07] 64 int main(int, char**) [ 0:07] 65 { [ 0:07] 66 int ia[] = {0, 1, 2, 3, 4, 5}; [ 0:07] 67 const unsigned s = sizeof(ia)/sizeof(ia[0]); [ 0:07] 68 int ib[s] = {0, 1, 2, 5, 4, 5}; [ 0:07] 69 assert(std::equal(input_iterator(ia), [ 0:07] 70 input_iterator(ia+s), [ 0:07] 71 input_iterator(ia), [ 0:07] 72 std::equal_to())); [ 0:07] 73 #if TEST_STD_VER >= 14 [ 0:07] 74 assert(std::equal(input_iterator(ia), [ 0:07] 75 input_iterator(ia+s), [ 0:07] 76 input_iterator(ia), [ 0:07] 77 input_iterator(ia+s), [ 0:07] 78 std::equal_to())); [ 0:07] 79 assert(std::equal(random_access_iterator(ia), [ 0:07] 80 random_access_iterator(ia+s), [ 0:07] 81 random_access_iterator(ia), [ 0:07] 82 random_access_iterator(ia+s), [ 0:07] 83 std::equal_to())); [ 0:07] 84 [ 0:07] 85 comparison_count = 0; [ 0:07] 86 assert(!std::equal(input_iterator(ia), [ 0:07] 87 input_iterator(ia+s), [ 0:07] 88 input_iterator(ia), [ 0:07] 89 input_iterator(ia+s-1), [ 0:07] 90 counting_equals)); [ 0:07] 91 assert(comparison_count > 0); [ 0:07] 92 comparison_count = 0; [ 0:07] 93 assert(!std::equal(random_access_iterator(ia), [ 0:07] 94 random_access_iterator(ia+s), [ 0:07] 95 random_access_iterator(ia), [ 0:07] 96 random_access_iterator(ia+s-1), [ 0:07] 97 counting_equals)); [ 0:07] 98 assert(comparison_count == 0); [ 0:07] 99 #endif [ 0:07] 100 assert(!std::equal(input_iterator(ia), [ 0:07] 101 input_iterator(ia+s), [ 0:07] 102 input_iterator(ib), [ 0:07] 103 std::equal_to())); [ 0:07] 104 #if TEST_STD_VER >= 14 [ 0:07] 105 assert(!std::equal(input_iterator(ia), [ 0:07] 106 input_iterator(ia+s), [ 0:07] 107 input_iterator(ib), [ 0:07] 108 input_iterator(ib+s), [ 0:07] 109 std::equal_to())); [ 0:07] 110 assert(!std::equal(random_access_iterator(ia), [ 0:07] 111 random_access_iterator(ia+s), [ 0:07] 112 random_access_iterator(ib), [ 0:07] 113 random_access_iterator(ib+s), [ 0:07] 114 std::equal_to())); [ 0:07] 115 #endif [ 0:07] 116 [ 0:07] 117 #if TEST_STD_VER > 17 [ 0:07] 118 static_assert(test_constexpr()); [ 0:07] 119 #endif [ 0:07] 120 [ 0:07] 121 return 0; [ 0:07] 122 } [ 0:07] # no errors were expected but one was found anyway