[ 0:00] compiling /home/xrockai/src/divine/nightly/test/libcxx/algorithms/inplace_merge_comp.pass.cpp
[ 0:00] In file included from /home/xrockai/src/divine/nightly/test/libcxx/algorithms/inplace_merge_comp.pass.cpp:20:
[ 0:00] In file included from /dios/libcxx/include/algorithm:639:
[ 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: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: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:09] 
[ 0:09] 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: 110695
[ 0:15] Stack: 
[ 0:15] 	#000110695 in __dios_start (l=2, argc=1, argv=93952552755208, envp=93952552773640) at /dios/libc/sys/start.cpp:87
[ 0:15] 	#100058523 in _ZN6__dios10sched_nullINS_5ClockINS_10NondetKleeINS_4BaseEEEEEE13run_schedulerINS_7ContextEEEvv () at /dios/sys/sched_null.hpp:163
[ 0:15] 	#200119275 in klee_boot (argc=2, argv=93952515920000) at /dios/arch/klee/boot.c:41
[ 0:15] 
[ 0:15] 
[ 0:15]      1	/* TAGS: c++ fin ext */
[ 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<BidirectionalIterator 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	//   inplace_merge(Iter first, Iter middle, Iter last, Compare comp);
[ 0:15]     19	
[ 0:15]     20	#include <algorithm>
[ 0:15]     21	#include <functional>
[ 0:15]     22	#include <random>
[ 0:15]     23	#include <cassert>
[ 0:15]     24	
[ 0:15]     25	#include "test_macros.h"
[ 0:15]     26	
[ 0:15]     27	#if TEST_STD_VER >= 11
[ 0:15]     28	#include <memory>
[ 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	struct S {
[ 0:15]     38	    S() : i_(0) {}
[ 0:15]     39	    S(int i) : i_(i) {}
[ 0:15]     40	
[ 0:15]     41	    S(const S&  rhs) : i_(rhs.i_) {}
[ 0:15]     42	    S(      S&& rhs) : i_(rhs.i_) { rhs.i_ = -1; }
[ 0:15]     43	
[ 0:15]     44	    S& operator =(const S&  rhs) { i_ = rhs.i_;              return *this; }
[ 0:15]     45	    S& operator =(      S&& rhs) { i_ = rhs.i_; rhs.i_ = -2; assert(this != &rhs); return *this; }
[ 0:15]     46	    S& operator =(int i)         { i_ = i;                   return *this; }
[ 0:15]     47	
[ 0:15]     48	    bool operator  <(const S&  rhs) const { return i_ < rhs.i_; }
[ 0:15]     49	    bool operator  >(const S&  rhs) const { return i_ > rhs.i_; }
[ 0:15]     50	    bool operator ==(const S&  rhs) const { return i_ == rhs.i_; }
[ 0:15]     51	    bool operator ==(int i)         const { return i_ == i; }
[ 0:15]     52	
[ 0:15]     53	    void set(int i) { i_ = i; }
[ 0:15]     54	
[ 0:15]     55	    int i_;
[ 0:15]     56	    };
[ 0:15]     57	
[ 0:15]     58	
[ 0:15]     59	#endif  // TEST_STD_VER >= 11
[ 0:15]     60	
[ 0:15]     61	#include "test_iterators.h"
[ 0:15]     62	#include "counting_predicates.hpp"
[ 0:15]     63	
[ 0:15]     64	std::mt19937 randomness;
[ 0:15]     65	
[ 0:15]     66	template <class Iter>
[ 0:15]     67	void
[ 0:15]     68	test_one(unsigned N, unsigned M)
[ 0:15]     69	{
[ 0:15]     70	    assert(M <= N);
[ 0:15]     71	    typedef typename std::iterator_traits<Iter>::value_type value_type;
[ 0:15]     72	    value_type* ia = new value_type[N];
[ 0:15]     73	    for (unsigned i = 0; i < N; ++i)
[ 0:15]     74	        ia[i] = i;
[ 0:15]     75	    std::shuffle(ia, ia+N, randomness);
[ 0:15]     76	    std::sort(ia, ia+M, std::greater<value_type>());
[ 0:15]     77	    std::sort(ia+M, ia+N, std::greater<value_type>());
[ 0:15]     78	    binary_counting_predicate<std::greater<value_type>, value_type, value_type> pred((std::greater<value_type>()));
[ 0:15]     79	    std::inplace_merge(Iter(ia), Iter(ia+M), Iter(ia+N), std::ref(pred));
[ 0:15]     80	    if(N > 0)
[ 0:15]     81	    {
[ 0:15]     82	        assert(ia[0] == static_cast<int>(N)-1);
[ 0:15]     83	        assert(ia[N-1] == 0);
[ 0:15]     84	        assert(std::is_sorted(ia, ia+N, std::greater<value_type>()));
[ 0:15]     85	        assert(pred.count() <= (N-1));
[ 0:15]     86	    }
[ 0:15]     87	    delete [] ia;
[ 0:15]     88	}
[ 0:15]     89	
[ 0:15]     90	template <class Iter>
[ 0:15]     91	void
[ 0:15]     92	test(unsigned N)
[ 0:15]     93	{
[ 0:15]     94	    test_one<Iter>(N, 0);
[ 0:15]     95	    test_one<Iter>(N, N/4);
[ 0:15]     96	    test_one<Iter>(N, N/2);
[ 0:15]     97	    test_one<Iter>(N, 3*N/4);
[ 0:15]     98	    test_one<Iter>(N, N);
[ 0:15]     99	}
[ 0:15]    100	
[ 0:15]    101	template <class Iter>
[ 0:15]    102	void
[ 0:15]    103	test()
[ 0:15]    104	{
[ 0:15]    105	    test_one<Iter>(0, 0);
[ 0:15]    106	    test_one<Iter>(1, 0);
[ 0:15]    107	    test_one<Iter>(1, 1);
[ 0:15]    108	    test_one<Iter>(2, 0);
[ 0:15]    109	    test_one<Iter>(2, 1);
[ 0:15]    110	    test_one<Iter>(2, 2);
[ 0:15]    111	    test_one<Iter>(3, 0);
[ 0:15]    112	    test_one<Iter>(3, 1);
[ 0:15]    113	    test_one<Iter>(3, 2);
[ 0:15]    114	    test_one<Iter>(3, 3);
[ 0:15]    115	    test<Iter>(4);
[ 0:15]    116	    test<Iter>(20);
[ 0:15]    117	    test<Iter>(100);
[ 0:15]    118	    test<Iter>(1000);
[ 0:15]    119	}
[ 0:15]    120	
[ 0:15]    121	struct less_by_first {
[ 0:15]    122	  template <typename Pair>
[ 0:15]    123	  bool operator()(const Pair& lhs, const Pair& rhs) {
[ 0:15]    124	    return std::less<typename Pair::first_type>()(lhs.first, rhs.first);
[ 0:15]    125	  }
[ 0:15]    126	};
[ 0:15]    127	
[ 0:15]    128	void test_PR31166 ()
[ 0:15]    129	{
[ 0:15]    130	    typedef std::pair<int, int> P;
[ 0:15]    131	    typedef std::vector<P> V;
[ 0:15]    132	    P vec[5] = {P(1, 0), P(2, 0), P(2, 1), P(2, 2), P(2, 3)};
[ 0:15]    133	    for ( int i = 0; i < 5; ++i ) {
[ 0:15]    134	        V res(vec, vec + 5);
[ 0:15]    135	        std::inplace_merge(res.begin(), res.begin() + i, res.end(), less_by_first());
[ 0:15]    136	        assert(res.size() == 5);
[ 0:15]    137	        assert(std::equal(res.begin(), res.end(), vec));
[ 0:15]    138	    }
[ 0:15]    139	}
[ 0:15]    140	
[ 0:15]    141	int main(int, char**)
[ 0:15]    142	{
[ 0:15]    143	    test<bidirectional_iterator<int*> >();
[ 0:15]    144	    test<random_access_iterator<int*> >();
[ 0:15]    145	    test<int*>();
[ 0:15]    146	
[ 0:15]    147	#if TEST_STD_VER >= 11
[ 0:15]    148	    test<bidirectional_iterator<S*> >();
[ 0:15]    149	    test<random_access_iterator<S*> >();
[ 0:15]    150	    test<S*>();
[ 0:15]    151	
[ 0:15]    152	    {
[ 0:15]    153	    int N = 100;
[ 0:15]    154	    unsigned M = 50;
[ 0:15]    155	    std::unique_ptr<int>* ia = new std::unique_ptr<int>[N];
[ 0:15]    156	    for (int i = 0; i < N; ++i)
[ 0:15]    157	        ia[i].reset(new int(i));
[ 0:15]    158	    std::shuffle(ia, ia+N, randomness);
[ 0:15]    159	    std::sort(ia, ia+M, indirect_less());
[ 0:15]    160	    std::sort(ia+M, ia+N, indirect_less());
[ 0:15]    161	    std::inplace_merge(ia, ia+M, ia+N, indirect_less());
[ 0:15]    162	    if(N > 0)
[ 0:15]    163	    {
[ 0:15]    164	        assert(*ia[0] == 0);
[ 0:15]    165	        assert(*ia[N-1] == N-1);
[ 0:15]    166	        assert(std::is_sorted(ia, ia+N, indirect_less()));
[ 0:15]    167	    }
[ 0:15]    168	    delete [] ia;
[ 0:15]    169	    }
[ 0:15]    170	#endif  // TEST_STD_VER >= 11
[ 0:15]    171	
[ 0:15]    172	    test_PR31166();
[ 0:15]    173	
[ 0:15]    174	  return 0;
[ 0:15]    175	}
[ 0:15] # no errors were expected but one was found anyway