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