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