[ 0:01] compiling /home/xrockai/src/divine/nightly/test/libcxx/algorithms/partial_sort_comp.pass.cpp [ 0:01] In file included from /home/xrockai/src/divine/nightly/test/libcxx/algorithms/partial_sort_comp.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:04] setting up pass: fuse-ctors, options = [ 0:04] KLEE: output directory is "/var/obj/divine-nightly/semidbg/test/__test_work_dir.5/_klee_out" [ 0:08] KLEE: Using Z3 solver backend [ 0:08] WARNING: this target does not support the llvm.stacksave intrinsic. [ 0:08] 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:09] [ 0:09] KLEE: WARNING: undefined reference to function: _Z10klee_abortv [ 0:13] KLEE: WARNING: undefined reference to function: __dios_tainted_init [ 0:13] KLEE: WARNING: undefined reference to function: klee_free [ 0:13] KLEE: WARNING: undefined reference to function: klee_malloc [ 0:13] KLEE: WARNING ONCE: Using zero size array fix for landingpad instruction filter [ 0:14] i:1 [ 0:14] KLEE: WARNING ONCE: Alignment of memory from call "klee_malloc" is not modelled. Using alignment of 8. [ 0:14] about to __boot:0 [ 0:14] about to run the scheduler:0 [ 0:14] KLEE: WARNING ONCE: calling external: __dios_tainted_init() at /dios/libc/sys/start.cpp:49 5 [ 0:14] KLEE: ERROR: /dios/libc/sys/start.cpp:87: failed external call: __dios_tainted_init [ 0:14] KLEE: NOTE: now ignoring this error at this location [ 0:14] KLEE: ERROR: EXITING ON ERROR: [ 0:14] Error: failed external call: __dios_tainted_init [ 0:14] File: /dios/libc/sys/start.cpp [ 0:14] Line: 87 [ 0:14] assembly.ll line: 70462 [ 0:14] Stack: [ 0:14] #000070462 in __dios_start (l=2, argc=1, argv=94588632330760, envp=94588632391688) at /dios/libc/sys/start.cpp:87 [ 0:14] #100018290 in _ZN6__dios10sched_nullINS_5ClockINS_10NondetKleeINS_4BaseEEEEEE13run_schedulerINS_7ContextEEEvv () at /dios/sys/sched_null.hpp:163 [ 0:14] #200079042 in klee_boot (argc=2, argv=94588599209344) at /dios/arch/klee/boot.c:41 [ 0:14] [ 0:14] [ 0:14] 1 /* TAGS: c++ fin ext */ [ 0:14] 2 /* CC_OPTS: -std=c++2a */ [ 0:14] 3 /* VERIFY_OPTS: -o nofail:malloc */ [ 0:14] 4 //===----------------------------------------------------------------------===// [ 0:14] 5 // [ 0:14] 6 // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. [ 0:14] 7 // See https://llvm.org/LICENSE.txt for license information. [ 0:14] 8 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception [ 0:14] 9 // [ 0:14] 10 //===----------------------------------------------------------------------===// [ 0:14] 11 [ 0:14] 12 // [ 0:14] 13 [ 0:14] 14 // template Compare> [ 0:14] 15 // requires ShuffleIterator [ 0:14] 16 // && CopyConstructible [ 0:14] 17 // void [ 0:14] 18 // partial_sort(Iter first, Iter middle, Iter last, Compare comp); [ 0:14] 19 [ 0:14] 20 #include [ 0:14] 21 #include [ 0:14] 22 #include [ 0:14] 23 #include [ 0:14] 24 #include [ 0:14] 25 #include [ 0:14] 26 #include [ 0:14] 27 [ 0:14] 28 #include "test_macros.h" [ 0:14] 29 [ 0:14] 30 struct indirect_less [ 0:14] 31 { [ 0:14] 32 template [ 0:14] 33 bool operator()(const P& x, const P& y) [ 0:14] 34 {return *x < *y;} [ 0:14] 35 }; [ 0:14] 36 [ 0:14] 37 std::mt19937 randomness; [ 0:14] 38 [ 0:14] 39 void [ 0:14] 40 test_larger_sorts(int N, int M) [ 0:14] 41 { [ 0:14] 42 assert(N != 0); [ 0:14] 43 assert(N >= M); [ 0:14] 44 int* array = new int[N]; [ 0:14] 45 for (int i = 0; i < N; ++i) [ 0:14] 46 array[i] = i; [ 0:14] 47 std::shuffle(array, array+N, randomness); [ 0:14] 48 std::partial_sort(array, array+M, array+N, std::greater()); [ 0:14] 49 for (int i = 0; i < M; ++i) [ 0:14] 50 { [ 0:14] 51 assert(i < N); // quiet analysis warnings [ 0:14] 52 assert(array[i] == N-i-1); [ 0:14] 53 } [ 0:14] 54 delete [] array; [ 0:14] 55 } [ 0:14] 56 [ 0:14] 57 void [ 0:14] 58 test_larger_sorts(int N) [ 0:14] 59 { [ 0:14] 60 test_larger_sorts(N, 0); [ 0:14] 61 test_larger_sorts(N, 1); [ 0:14] 62 test_larger_sorts(N, 2); [ 0:14] 63 test_larger_sorts(N, 3); [ 0:14] 64 test_larger_sorts(N, N/2-1); [ 0:14] 65 test_larger_sorts(N, N/2); [ 0:14] 66 test_larger_sorts(N, N/2+1); [ 0:14] 67 test_larger_sorts(N, N-2); [ 0:14] 68 test_larger_sorts(N, N-1); [ 0:14] 69 test_larger_sorts(N, N); [ 0:14] 70 } [ 0:14] 71 [ 0:14] 72 int main(int, char**) [ 0:14] 73 { [ 0:14] 74 { [ 0:14] 75 int i = 0; [ 0:14] 76 std::partial_sort(&i, &i, &i); [ 0:14] 77 assert(i == 0); [ 0:14] 78 test_larger_sorts(10); [ 0:14] 79 test_larger_sorts(256); [ 0:14] 80 test_larger_sorts(257); [ 0:14] 81 test_larger_sorts(499); [ 0:14] 82 test_larger_sorts(500); [ 0:14] 83 test_larger_sorts(997); [ 0:14] 84 test_larger_sorts(1000); [ 0:14] 85 test_larger_sorts(1009); [ 0:14] 86 } [ 0:14] 87 [ 0:14] 88 #if TEST_STD_VER >= 11 [ 0:14] 89 { [ 0:14] 90 std::vector > v(1000); [ 0:14] 91 for (int i = 0; static_cast(i) < v.size(); ++i) [ 0:14] 92 v[i].reset(new int(i)); [ 0:14] 93 std::partial_sort(v.begin(), v.begin() + v.size()/2, v.end(), indirect_less()); [ 0:14] 94 for (int i = 0; static_cast(i) < v.size()/2; ++i) [ 0:14] 95 assert(*v[i] == i); [ 0:14] 96 } [ 0:14] 97 #endif [ 0:14] 98 [ 0:14] 99 return 0; [ 0:14] 100 } [ 0:14] # no errors were expected but one was found anyway