[ 0:00] compiling /home/xrockai/src/divine/nightly/test/libcxx/containers/sort_pred.pass.cpp
[ 0:00] In file included from /home/xrockai/src/divine/nightly/test/libcxx/containers/sort_pred.pass.cpp:16:
[ 0:00] In file included from /dios/libcxx/include/forward_list:181:
[ 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:03] compiling /dios/lib/config/seqklee.bc
[ 0:03] 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.3/_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:08] 
[ 0:08] 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: 82177
[ 0:13] Stack: 
[ 0:13] 	#000082177 in __dios_start (l=2, argc=1, argv=94035761231368, envp=94035761325064) at /dios/libc/sys/start.cpp:87
[ 0:13] 	#100030005 in _ZN6__dios10sched_nullINS_5ClockINS_10NondetKleeINS_4BaseEEEEEE13run_schedulerINS_7ContextEEEvv () at /dios/sys/sched_null.hpp:163
[ 0:13] 	#200090757 in klee_boot (argc=2, argv=94035725217152) at /dios/arch/klee/boot.c:41
[ 0:13] 
[ 0:13] 
[ 0:13]      1	/* TAGS: c++ fin */
[ 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	// <forward_list>
[ 0:13]     13	
[ 0:13]     14	// template <class Compare> void sort(Compare comp);
[ 0:13]     15	
[ 0:13]     16	#include <forward_list>
[ 0:13]     17	#include <iterator>
[ 0:13]     18	#include <algorithm>
[ 0:13]     19	#include <vector>
[ 0:13]     20	#include <functional>
[ 0:13]     21	#include <random>
[ 0:13]     22	#include <cassert>
[ 0:13]     23	#include <iostream>
[ 0:13]     24	
[ 0:13]     25	#include "test_macros.h"
[ 0:13]     26	#include "min_allocator.h"
[ 0:13]     27	
[ 0:13]     28	std::mt19937 randomness;
[ 0:13]     29	
[ 0:13]     30	struct Payload
[ 0:13]     31	{
[ 0:13]     32	    int val;
[ 0:13]     33	    int side;
[ 0:13]     34	    Payload(int v) : val(v), side(0) {}
[ 0:13]     35	    Payload(int v, int s) : val(v), side(s) {}
[ 0:13]     36	    bool operator< (const Payload &rhs) const { return val <  rhs.val;}
[ 0:13]     37	};
[ 0:13]     38	
[ 0:13]     39	bool greater(const Payload &lhs, const Payload &rhs) { return lhs.val >  rhs.val; }
[ 0:13]     40	
[ 0:13]     41	void test_stable(int N)
[ 0:13]     42	{
[ 0:13]     43	    typedef Payload T;
[ 0:13]     44	    typedef std::forward_list<T> C;
[ 0:13]     45	    typedef std::vector<T> V;
[ 0:13]     46	    V v;
[ 0:13]     47	    for (int i = 0; i < N; ++i)
[ 0:13]     48	        v.push_back(Payload(i/2));
[ 0:13]     49	    std::shuffle(v.begin(), v.end(), randomness);
[ 0:13]     50	    for (int i = 0; i < N; ++i)
[ 0:13]     51	        v[i].side = i;
[ 0:13]     52	
[ 0:13]     53	    C c(v.begin(), v.end());
[ 0:13]     54	    c.sort(greater);
[ 0:13]     55	    assert(distance(c.begin(), c.end()) == N);
[ 0:13]     56	
[ 0:13]     57	//  Are we sorted?
[ 0:13]     58	    typename C::const_iterator j = c.begin();
[ 0:13]     59	    for (int i = 0; i < N; ++i, ++j)
[ 0:13]     60	        assert(j->val == (N-1-i)/2);
[ 0:13]     61	
[ 0:13]     62	//  Are we stable?
[ 0:13]     63	    for (C::const_iterator it = c.begin(); it != c.end(); ++it)
[ 0:13]     64	    {
[ 0:13]     65	        C::const_iterator next = std::next(it);
[ 0:13]     66	        if (next != c.end() && it->val == next->val)
[ 0:13]     67	            assert(it->side < next->side);
[ 0:13]     68	    }
[ 0:13]     69	}
[ 0:13]     70	
[ 0:13]     71	template <class C>
[ 0:13]     72	void test(int N)
[ 0:13]     73	{
[ 0:13]     74	    typedef typename C::value_type T;
[ 0:13]     75	    typedef std::vector<T> V;
[ 0:13]     76	    V v;
[ 0:13]     77	    for (int i = 0; i < N; ++i)
[ 0:13]     78	        v.push_back(i);
[ 0:13]     79	    std::shuffle(v.begin(), v.end(), randomness);
[ 0:13]     80	    C c(v.begin(), v.end());
[ 0:13]     81	    c.sort(std::greater<T>());
[ 0:13]     82	    assert(distance(c.begin(), c.end()) == N);
[ 0:13]     83	    typename C::const_iterator j = c.begin();
[ 0:13]     84	    for (int i = 0; i < N; ++i, ++j)
[ 0:13]     85	        assert(*j == N-1-i);
[ 0:13]     86	}
[ 0:13]     87	
[ 0:13]     88	int main(int, char**)
[ 0:13]     89	{
[ 0:13]     90	    for (int i = 0; i < 40; ++i)
[ 0:13]     91	        test<std::forward_list<int> >(i);
[ 0:13]     92	#if TEST_STD_VER >= 11
[ 0:13]     93	    for (int i = 0; i < 40; ++i)
[ 0:13]     94	        test<std::forward_list<int, min_allocator<int>> >(i);
[ 0:13]     95	#endif
[ 0:13]     96	
[ 0:13]     97	    for (int i = 0; i < 40; ++i)
[ 0:13]     98	        test_stable(i);
[ 0:13]     99	
[ 0:13]    100	  return 0;
[ 0:13]    101	}
[ 0:13] # no errors were expected but one was found anyway