[ 0:01] compiling /home/xrockai/src/divine/nightly/test/libcxx/algorithms/includes_comp.pass.cpp
[ 0:01] In file included from /home/xrockai/src/divine/nightly/test/libcxx/algorithms/includes_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.16/_klee_out"
[ 0:05] KLEE: Using Z3 solver backend
[ 0:05] WARNING: this target does not support the llvm.stacksave intrinsic.
[ 0:05] 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:05] 
[ 0:05] KLEE: WARNING: undefined reference to function: __dios_tainted_init
[ 0:08] KLEE: WARNING: undefined reference to function: klee_free
[ 0:08] KLEE: WARNING: undefined reference to function: klee_malloc
[ 0:08] i:1
[ 0:08] KLEE: WARNING ONCE: Alignment of memory from call "klee_malloc" is not modelled. Using alignment of 8.
[ 0:08] about to __boot:0
[ 0:08] about to run the scheduler:0
[ 0:08] KLEE: WARNING ONCE: calling external: __dios_tainted_init() at /dios/libc/sys/start.cpp:49 5
[ 0:08] KLEE: ERROR: /dios/libc/sys/start.cpp:87: failed external call: __dios_tainted_init
[ 0:08] KLEE: NOTE: now ignoring this error at this location
[ 0:08] KLEE: ERROR: EXITING ON ERROR:
[ 0:09] Error: failed external call: __dios_tainted_init
[ 0:09] File: /dios/libc/sys/start.cpp
[ 0:09] Line: 87
[ 0:09] assembly.ll line: 53801
[ 0:09] Stack: 
[ 0:09] 	#000053801 in __dios_start (l=2, argc=1, argv=94371336917512, envp=94371336994824) at /dios/libc/sys/start.cpp:87
[ 0:09] 	#100029810 in _ZN6__dios10sched_nullINS_5ClockINS_10NondetKleeINS_4BaseEEEEEE13run_schedulerINS_7ContextEEEvv () at /dios/sys/sched_null.hpp:163
[ 0:09] 	#200062049 in klee_boot (argc=2, argv=94371303151616) at /dios/arch/klee/boot.c:41
[ 0:09] 
[ 0:09] 
[ 0:09]      1	/* TAGS: c++ fin */
[ 0:09]      2	/* CC_OPTS: -std=c++2a */
[ 0:09]      3	/* VERIFY_OPTS: -o nofail:malloc */
[ 0:09]      4	//===----------------------------------------------------------------------===//
[ 0:09]      5	//
[ 0:09]      6	// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
[ 0:09]      7	// See https://llvm.org/LICENSE.txt for license information.
[ 0:09]      8	// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
[ 0:09]      9	//
[ 0:09]     10	//===----------------------------------------------------------------------===//
[ 0:09]     11	
[ 0:09]     12	// <algorithm>
[ 0:09]     13	
[ 0:09]     14	// template<InputIterator Iter1, InputIterator Iter2, typename Compare>
[ 0:09]     15	//   requires Predicate<Compare, Iter1::value_type, Iter2::value_type>
[ 0:09]     16	//         && Predicate<Compare, Iter2::value_type, Iter1::value_type>
[ 0:09]     17	//   constexpr bool             // constexpr after C++17
[ 0:09]     18	//   includes(Iter1 first1, Iter1 last1, Iter2 first2, Iter2 last2, Compare comp);
[ 0:09]     19	
[ 0:09]     20	#include <algorithm>
[ 0:09]     21	#include <functional>
[ 0:09]     22	#include <cassert>
[ 0:09]     23	
[ 0:09]     24	#include "test_macros.h"
[ 0:09]     25	#include "test_iterators.h"
[ 0:09]     26	
[ 0:09]     27	#if TEST_STD_VER > 17
[ 0:09]     28	TEST_CONSTEXPR bool test_constexpr() {
[ 0:09]     29	    int ia[] = {1, 2, 2, 3, 3, 3, 4, 4, 4, 4};
[ 0:09]     30	    int ib[] = {2, 4};
[ 0:09]     31	    int ic[] = {3, 3, 3, 3};
[ 0:09]     32	
[ 0:09]     33	    auto comp = [](int a, int b) {return a < b; };
[ 0:09]     34	    return  std::includes(std::begin(ia), std::end(ia), std::begin(ib), std::end(ib), comp)
[ 0:09]     35	        && !std::includes(std::begin(ia), std::end(ia), std::begin(ic), std::end(ic), comp)
[ 0:09]     36	           ;
[ 0:09]     37	    }
[ 0:09]     38	#endif
[ 0:09]     39	
[ 0:09]     40	
[ 0:09]     41	template <class Iter1, class Iter2>
[ 0:09]     42	void
[ 0:09]     43	test()
[ 0:09]     44	{
[ 0:09]     45	    int ia[] = {1, 2, 2, 3, 3, 3, 4, 4, 4, 4};
[ 0:09]     46	    const unsigned sa = sizeof(ia)/sizeof(ia[0]);
[ 0:09]     47	    int ib[] = {2, 4};
[ 0:09]     48	    const unsigned sb = sizeof(ib)/sizeof(ib[0]);
[ 0:09]     49	    int ic[] = {1, 2};
[ 0:09]     50	    const unsigned sc = sizeof(ic)/sizeof(ic[0]); ((void)sc);
[ 0:09]     51	    int id[] = {3, 3, 3, 3};
[ 0:09]     52	    const unsigned sd = sizeof(id)/sizeof(id[0]); ((void)sd);
[ 0:09]     53	
[ 0:09]     54	    assert(std::includes(Iter1(ia), Iter1(ia), Iter2(ib), Iter2(ib), std::less<int>()));
[ 0:09]     55	    assert(!std::includes(Iter1(ia), Iter1(ia), Iter2(ib), Iter2(ib+1), std::less<int>()));
[ 0:09]     56	    assert(std::includes(Iter1(ia), Iter1(ia+1), Iter2(ib), Iter2(ib), std::less<int>()));
[ 0:09]     57	    assert(std::includes(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+sa), std::less<int>()));
[ 0:09]     58	
[ 0:09]     59	    assert(std::includes(Iter1(ia), Iter1(ia+sa), Iter2(ib), Iter2(ib+sb), std::less<int>()));
[ 0:09]     60	    assert(!std::includes(Iter1(ib), Iter1(ib+sb), Iter2(ia), Iter2(ia+sa), std::less<int>()));
[ 0:09]     61	
[ 0:09]     62	    assert(std::includes(Iter1(ia), Iter1(ia+2), Iter2(ic), Iter2(ic+2), std::less<int>()));
[ 0:09]     63	    assert(!std::includes(Iter1(ia), Iter1(ia+2), Iter2(ib), Iter2(ib+2), std::less<int>()));
[ 0:09]     64	
[ 0:09]     65	    assert(std::includes(Iter1(ia), Iter1(ia+sa), Iter2(id), Iter2(id+1), std::less<int>()));
[ 0:09]     66	    assert(std::includes(Iter1(ia), Iter1(ia+sa), Iter2(id), Iter2(id+2), std::less<int>()));
[ 0:09]     67	    assert(std::includes(Iter1(ia), Iter1(ia+sa), Iter2(id), Iter2(id+3), std::less<int>()));
[ 0:09]     68	    assert(!std::includes(Iter1(ia), Iter1(ia+sa), Iter2(id), Iter2(id+4), std::less<int>()));
[ 0:09]     69	}
[ 0:09]     70	
[ 0:09]     71	int main(int, char**)
[ 0:09]     72	{
[ 0:09]     73	    test<input_iterator<const int*>, input_iterator<const int*> >();
[ 0:09]     74	    test<input_iterator<const int*>, forward_iterator<const int*> >();
[ 0:09]     75	    test<input_iterator<const int*>, bidirectional_iterator<const int*> >();
[ 0:09]     76	    test<input_iterator<const int*>, random_access_iterator<const int*> >();
[ 0:09]     77	    test<input_iterator<const int*>, const int*>();
[ 0:09]     78	
[ 0:09]     79	    test<forward_iterator<const int*>, input_iterator<const int*> >();
[ 0:09]     80	    test<forward_iterator<const int*>, forward_iterator<const int*> >();
[ 0:09]     81	    test<forward_iterator<const int*>, bidirectional_iterator<const int*> >();
[ 0:09]     82	    test<forward_iterator<const int*>, random_access_iterator<const int*> >();
[ 0:09]     83	    test<forward_iterator<const int*>, const int*>();
[ 0:09]     84	
[ 0:09]     85	    test<bidirectional_iterator<const int*>, input_iterator<const int*> >();
[ 0:09]     86	    test<bidirectional_iterator<const int*>, forward_iterator<const int*> >();
[ 0:09]     87	    test<bidirectional_iterator<const int*>, bidirectional_iterator<const int*> >();
[ 0:09]     88	    test<bidirectional_iterator<const int*>, random_access_iterator<const int*> >();
[ 0:09]     89	    test<bidirectional_iterator<const int*>, const int*>();
[ 0:09]     90	
[ 0:09]     91	    test<random_access_iterator<const int*>, input_iterator<const int*> >();
[ 0:09]     92	    test<random_access_iterator<const int*>, forward_iterator<const int*> >();
[ 0:09]     93	    test<random_access_iterator<const int*>, bidirectional_iterator<const int*> >();
[ 0:09]     94	    test<random_access_iterator<const int*>, random_access_iterator<const int*> >();
[ 0:09]     95	    test<random_access_iterator<const int*>, const int*>();
[ 0:09]     96	
[ 0:09]     97	    test<const int*, input_iterator<const int*> >();
[ 0:09]     98	    test<const int*, forward_iterator<const int*> >();
[ 0:09]     99	    test<const int*, bidirectional_iterator<const int*> >();
[ 0:09]    100	    test<const int*, random_access_iterator<const int*> >();
[ 0:09]    101	    test<const int*, const int*>();
[ 0:09]    102	
[ 0:09]    103	#if TEST_STD_VER > 17
[ 0:09]    104	   static_assert(test_constexpr());
[ 0:09]    105	#endif
[ 0:09]    106	
[ 0:09]    107	  return 0;
[ 0:09]    108	}
[ 0:09] # no errors were expected but one was found anyway