[ 0:01] compiling /home/xrockai/src/divine/nightly/test/libcxx/algorithms/search_n.pass.cpp [ 0:01] In file included from /home/xrockai/src/divine/nightly/test/libcxx/algorithms/search_n.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: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.20/_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:07] KLEE: WARNING: undefined reference to function: klee_free [ 0:07] KLEE: WARNING: undefined reference to function: klee_malloc [ 0:07] 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: 44704 [ 0:08] Stack: [ 0:08] #000044704 in __dios_start (l=2, argc=1, argv=94916323979784, envp=94916324057096) at /dios/libc/sys/start.cpp:87 [ 0:08] #100020713 in _ZN6__dios10sched_nullINS_5ClockINS_10NondetKleeINS_4BaseEEEEEE13run_schedulerINS_7ContextEEEvv () at /dios/sys/sched_null.hpp:163 [ 0:08] #200052952 in klee_boot (argc=2, argv=94916293999360) 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 // constexpr ForwardIterator // constexpr after C++17 [ 0:08] 16 // search_n(ForwardIterator first, ForwardIterator last, Size count, [ 0:08] 17 // const T& value); [ 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 #include "user_defined_integral.hpp" [ 0:08] 25 [ 0:08] 26 #if TEST_STD_VER > 17 [ 0:08] 27 TEST_CONSTEXPR bool test_constexpr() { [ 0:08] 28 int ia[] = {0, 0, 1, 1, 2, 2}; [ 0:08] 29 return (std::search_n(std::begin(ia), std::end(ia), 1, 0) == ia) [ 0:08] 30 && (std::search_n(std::begin(ia), std::end(ia), 2, 1) == ia+2) [ 0:08] 31 && (std::search_n(std::begin(ia), std::end(ia), 1, 3) == std::end(ia)) [ 0:08] 32 ; [ 0:08] 33 } [ 0:08] 34 #endif [ 0:08] 35 [ 0:08] 36 template [ 0:08] 37 void [ 0:08] 38 test() [ 0:08] 39 { [ 0:08] 40 int ia[] = {0, 1, 2, 3, 4, 5}; [ 0:08] 41 const unsigned sa = sizeof(ia)/sizeof(ia[0]); [ 0:08] 42 assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 0) == Iter(ia)); [ 0:08] 43 assert(std::search_n(Iter(ia), Iter(ia+sa), 1, 0) == Iter(ia+0)); [ 0:08] 44 assert(std::search_n(Iter(ia), Iter(ia+sa), 2, 0) == Iter(ia+sa)); [ 0:08] 45 assert(std::search_n(Iter(ia), Iter(ia+sa), sa, 0) == Iter(ia+sa)); [ 0:08] 46 assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 3) == Iter(ia)); [ 0:08] 47 assert(std::search_n(Iter(ia), Iter(ia+sa), 1, 3) == Iter(ia+3)); [ 0:08] 48 assert(std::search_n(Iter(ia), Iter(ia+sa), 2, 3) == Iter(ia+sa)); [ 0:08] 49 assert(std::search_n(Iter(ia), Iter(ia+sa), sa, 3) == Iter(ia+sa)); [ 0:08] 50 assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 5) == Iter(ia)); [ 0:08] 51 assert(std::search_n(Iter(ia), Iter(ia+sa), 1, 5) == Iter(ia+5)); [ 0:08] 52 assert(std::search_n(Iter(ia), Iter(ia+sa), 2, 5) == Iter(ia+sa)); [ 0:08] 53 assert(std::search_n(Iter(ia), Iter(ia+sa), sa, 5) == Iter(ia+sa)); [ 0:08] 54 [ 0:08] 55 int ib[] = {0, 0, 1, 1, 2, 2}; [ 0:08] 56 const unsigned sb = sizeof(ib)/sizeof(ib[0]); [ 0:08] 57 assert(std::search_n(Iter(ib), Iter(ib+sb), 0, 0) == Iter(ib)); [ 0:08] 58 assert(std::search_n(Iter(ib), Iter(ib+sb), 1, 0) == Iter(ib+0)); [ 0:08] 59 assert(std::search_n(Iter(ib), Iter(ib+sb), 2, 0) == Iter(ib+0)); [ 0:08] 60 assert(std::search_n(Iter(ib), Iter(ib+sb), 3, 0) == Iter(ib+sb)); [ 0:08] 61 assert(std::search_n(Iter(ib), Iter(ib+sb), sb, 0) == Iter(ib+sb)); [ 0:08] 62 assert(std::search_n(Iter(ib), Iter(ib+sb), 0, 1) == Iter(ib)); [ 0:08] 63 assert(std::search_n(Iter(ib), Iter(ib+sb), 1, 1) == Iter(ib+2)); [ 0:08] 64 assert(std::search_n(Iter(ib), Iter(ib+sb), 2, 1) == Iter(ib+2)); [ 0:08] 65 assert(std::search_n(Iter(ib), Iter(ib+sb), 3, 1) == Iter(ib+sb)); [ 0:08] 66 assert(std::search_n(Iter(ib), Iter(ib+sb), sb, 1) == Iter(ib+sb)); [ 0:08] 67 assert(std::search_n(Iter(ib), Iter(ib+sb), 0, 2) == Iter(ib)); [ 0:08] 68 assert(std::search_n(Iter(ib), Iter(ib+sb), 1, 2) == Iter(ib+4)); [ 0:08] 69 assert(std::search_n(Iter(ib), Iter(ib+sb), 2, 2) == Iter(ib+4)); [ 0:08] 70 assert(std::search_n(Iter(ib), Iter(ib+sb), 3, 2) == Iter(ib+sb)); [ 0:08] 71 assert(std::search_n(Iter(ib), Iter(ib+sb), sb, 2) == Iter(ib+sb)); [ 0:08] 72 [ 0:08] 73 int ic[] = {0, 0, 0}; [ 0:08] 74 const unsigned sc = sizeof(ic)/sizeof(ic[0]); [ 0:08] 75 assert(std::search_n(Iter(ic), Iter(ic+sc), 0, 0) == Iter(ic)); [ 0:08] 76 assert(std::search_n(Iter(ic), Iter(ic+sc), 1, 0) == Iter(ic)); [ 0:08] 77 assert(std::search_n(Iter(ic), Iter(ic+sc), 2, 0) == Iter(ic)); [ 0:08] 78 assert(std::search_n(Iter(ic), Iter(ic+sc), 3, 0) == Iter(ic)); [ 0:08] 79 assert(std::search_n(Iter(ic), Iter(ic+sc), 4, 0) == Iter(ic+sc)); [ 0:08] 80 [ 0:08] 81 // Check that we properly convert the size argument to an integral. [ 0:08] 82 (void)std::search_n(Iter(ic), Iter(ic+sc), UserDefinedIntegral(0), 0); [ 0:08] 83 } [ 0:08] 84 [ 0:08] 85 int main(int, char**) [ 0:08] 86 { [ 0:08] 87 test >(); [ 0:08] 88 test >(); [ 0:08] 89 test >(); [ 0:08] 90 [ 0:08] 91 #if TEST_STD_VER > 17 [ 0:08] 92 static_assert(test_constexpr()); [ 0:08] 93 #endif [ 0:08] 94 [ 0:08] 95 return 0; [ 0:08] 96 } [ 0:08] # no errors were expected but one was found anyway