[ 0:00] compiling /home/xrockai/src/divine/nightly/test/libcxx/algorithms/is_partitioned.pass.cpp
[ 0:00] In file included from /home/xrockai/src/divine/nightly/test/libcxx/algorithms/is_partitioned.pass.cpp:18:
[ 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:01] compiling /dios/lib/config/seqklee.bc
[ 0:01] 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.13/_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:06] 
[ 0:06] KLEE: WARNING: undefined reference to function: _Z10klee_abortv
[ 0:10] KLEE: WARNING: undefined reference to function: __dios_tainted_init
[ 0:10] KLEE: WARNING: undefined reference to function: klee_free
[ 0:10] KLEE: WARNING: undefined reference to function: klee_malloc
[ 0:10] KLEE: WARNING ONCE: Using zero size array fix for landingpad instruction filter
[ 0:10] i:1
[ 0:10] KLEE: WARNING ONCE: Alignment of memory from call "klee_malloc" is not modelled. Using alignment of 8.
[ 0:10] about to __boot:0
[ 0:10] about to run the scheduler:0
[ 0:10] KLEE: WARNING ONCE: calling external: __dios_tainted_init() at /dios/libc/sys/start.cpp:49 5
[ 0:10] KLEE: ERROR: /dios/libc/sys/start.cpp:87: failed external call: __dios_tainted_init
[ 0:10] KLEE: NOTE: now ignoring this error at this location
[ 0:10] KLEE: ERROR: EXITING ON ERROR:
[ 0:11] Error: failed external call: __dios_tainted_init
[ 0:11] File: /dios/libc/sys/start.cpp
[ 0:11] Line: 87
[ 0:11] assembly.ll line: 65240
[ 0:11] Stack: 
[ 0:11] 	#000065240 in __dios_start (l=2, argc=1, argv=94024679666184, envp=94024679727112) at /dios/libc/sys/start.cpp:87
[ 0:11] 	#100013235 in _ZN6__dios10sched_nullINS_5ClockINS_10NondetKleeINS_4BaseEEEEEE13run_schedulerINS_7ContextEEEvv () at /dios/sys/sched_null.hpp:163
[ 0:11] 	#200073820 in klee_boot (argc=2, argv=94024654605696) at /dios/arch/klee/boot.c:41
[ 0:11] 
[ 0:11] 
[ 0:11]      1	/* TAGS: c++ fin */
[ 0:11]      2	/* CC_OPTS: -std=c++2a */
[ 0:11]      3	/* VERIFY_OPTS: -o nofail:malloc */
[ 0:11]      4	//===----------------------------------------------------------------------===//
[ 0:11]      5	//
[ 0:11]      6	// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
[ 0:11]      7	// See https://llvm.org/LICENSE.txt for license information.
[ 0:11]      8	// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
[ 0:11]      9	//
[ 0:11]     10	//===----------------------------------------------------------------------===//
[ 0:11]     11	
[ 0:11]     12	// <algorithm>
[ 0:11]     13	
[ 0:11]     14	// template <class InputIterator, class Predicate>
[ 0:11]     15	//     constpexr bool       // constexpr after C++17
[ 0:11]     16	//     is_partitioned(InputIterator first, InputIterator last, Predicate pred);
[ 0:11]     17	
[ 0:11]     18	#include <algorithm>
[ 0:11]     19	#include <functional>
[ 0:11]     20	#include <cstddef>
[ 0:11]     21	#include <cassert>
[ 0:11]     22	
[ 0:11]     23	#include "test_macros.h"
[ 0:11]     24	#include "test_iterators.h"
[ 0:11]     25	#include "counting_predicates.hpp"
[ 0:11]     26	
[ 0:11]     27	struct is_odd {
[ 0:11]     28	  TEST_CONSTEXPR bool operator()(const int &i) const { return i & 1; }
[ 0:11]     29	};
[ 0:11]     30	
[ 0:11]     31	#if TEST_STD_VER > 17
[ 0:11]     32	TEST_CONSTEXPR bool test_constexpr() {
[ 0:11]     33	    int ia[] = {1, 3, 5, 2, 4, 6};
[ 0:11]     34	    int ib[] = {1, 2, 3, 4, 5, 6};
[ 0:11]     35	    return     std::is_partitioned(std::begin(ia), std::end(ia), is_odd())
[ 0:11]     36	           && !std::is_partitioned(std::begin(ib), std::end(ib), is_odd());
[ 0:11]     37	    }
[ 0:11]     38	#endif
[ 0:11]     39	
[ 0:11]     40	
[ 0:11]     41	int main(int, char**) {
[ 0:11]     42	  {
[ 0:11]     43	    const int ia[] = {1, 2, 3, 4, 5, 6};
[ 0:11]     44	    unary_counting_predicate<is_odd, int> pred((is_odd()));
[ 0:11]     45	    assert(!std::is_partitioned(input_iterator<const int *>(std::begin(ia)),
[ 0:11]     46	                                input_iterator<const int *>(std::end(ia)),
[ 0:11]     47	                                std::ref(pred)));
[ 0:11]     48	    assert(static_cast<std::ptrdiff_t>(pred.count()) <=
[ 0:11]     49	           std::distance(std::begin(ia), std::end(ia)));
[ 0:11]     50	  }
[ 0:11]     51	  {
[ 0:11]     52	    const int ia[] = {1, 3, 5, 2, 4, 6};
[ 0:11]     53	    unary_counting_predicate<is_odd, int> pred((is_odd()));
[ 0:11]     54	    assert(std::is_partitioned(input_iterator<const int *>(std::begin(ia)),
[ 0:11]     55	                               input_iterator<const int *>(std::end(ia)),
[ 0:11]     56	                               std::ref(pred)));
[ 0:11]     57	    assert(static_cast<std::ptrdiff_t>(pred.count()) <=
[ 0:11]     58	           std::distance(std::begin(ia), std::end(ia)));
[ 0:11]     59	  }
[ 0:11]     60	  {
[ 0:11]     61	    const int ia[] = {2, 4, 6, 1, 3, 5};
[ 0:11]     62	    unary_counting_predicate<is_odd, int> pred((is_odd()));
[ 0:11]     63	    assert(!std::is_partitioned(input_iterator<const int *>(std::begin(ia)),
[ 0:11]     64	                                input_iterator<const int *>(std::end(ia)),
[ 0:11]     65	                                std::ref(pred)));
[ 0:11]     66	    assert(static_cast<std::ptrdiff_t>(pred.count()) <=
[ 0:11]     67	           std::distance(std::begin(ia), std::end(ia)));
[ 0:11]     68	  }
[ 0:11]     69	  {
[ 0:11]     70	    const int ia[] = {1, 3, 5, 2, 4, 6, 7};
[ 0:11]     71	    unary_counting_predicate<is_odd, int> pred((is_odd()));
[ 0:11]     72	    assert(!std::is_partitioned(input_iterator<const int *>(std::begin(ia)),
[ 0:11]     73	                                input_iterator<const int *>(std::end(ia)),
[ 0:11]     74	                                std::ref(pred)));
[ 0:11]     75	    assert(static_cast<std::ptrdiff_t>(pred.count()) <=
[ 0:11]     76	           std::distance(std::begin(ia), std::end(ia)));
[ 0:11]     77	  }
[ 0:11]     78	  {
[ 0:11]     79	    const int ia[] = {1, 3, 5, 2, 4, 6, 7};
[ 0:11]     80	    unary_counting_predicate<is_odd, int> pred((is_odd()));
[ 0:11]     81	    assert(std::is_partitioned(input_iterator<const int *>(std::begin(ia)),
[ 0:11]     82	                               input_iterator<const int *>(std::begin(ia)),
[ 0:11]     83	                               std::ref(pred)));
[ 0:11]     84	    assert(static_cast<std::ptrdiff_t>(pred.count()) <=
[ 0:11]     85	           std::distance(std::begin(ia), std::begin(ia)));
[ 0:11]     86	  }
[ 0:11]     87	  {
[ 0:11]     88	    const int ia[] = {1, 3, 5, 7, 9, 11, 2};
[ 0:11]     89	    unary_counting_predicate<is_odd, int> pred((is_odd()));
[ 0:11]     90	    assert(std::is_partitioned(input_iterator<const int *>(std::begin(ia)),
[ 0:11]     91	                               input_iterator<const int *>(std::end(ia)),
[ 0:11]     92	                               std::ref(pred)));
[ 0:11]     93	    assert(static_cast<std::ptrdiff_t>(pred.count()) <=
[ 0:11]     94	           std::distance(std::begin(ia), std::end(ia)));
[ 0:11]     95	  }
[ 0:11]     96	
[ 0:11]     97	#if TEST_STD_VER > 17
[ 0:11]     98	    static_assert(test_constexpr());
[ 0:11]     99	#endif
[ 0:11]    100	
[ 0:11]    101	  return 0;
[ 0:11]    102	}
[ 0:11] # no errors were expected but one was found anyway