[ 0:01] compiling /home/xrockai/src/divine/nightly/test/libcxx/algorithms/move_backward.pass.cpp
[ 0:01] In file included from /home/xrockai/src/divine/nightly/test/libcxx/algorithms/move_backward.pass.cpp:19:
[ 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: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.10/_klee_out"
[ 0:07] KLEE: Using Z3 solver backend
[ 0:07] WARNING: this target does not support the llvm.stacksave intrinsic.
[ 0:07] 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:07] 
[ 0:07] KLEE: WARNING: undefined reference to function: _Z10klee_abortv
[ 0:12] KLEE: WARNING: undefined reference to function: __dios_tainted_init
[ 0:12] KLEE: WARNING: undefined reference to function: klee_free
[ 0:12] KLEE: WARNING: undefined reference to function: klee_malloc
[ 0:12] KLEE: WARNING ONCE: Using zero size array fix for landingpad instruction filter
[ 0:12] i:1
[ 0:12] KLEE: WARNING ONCE: Alignment of memory from call "klee_malloc" is not modelled. Using alignment of 8.
[ 0:12] about to __boot:0
[ 0:12] about to run the scheduler:0
[ 0:12] KLEE: WARNING ONCE: calling external: __dios_tainted_init() at /dios/libc/sys/start.cpp:49 5
[ 0:12] KLEE: ERROR: /dios/libc/sys/start.cpp:87: failed external call: __dios_tainted_init
[ 0:12] KLEE: NOTE: now ignoring this error at this location
[ 0:12] 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: 75695
[ 0:13] Stack: 
[ 0:13] 	#000075695 in __dios_start (l=2, argc=1, argv=94064664154632, envp=94064664231944) at /dios/libc/sys/start.cpp:87
[ 0:13] 	#100023697 in _ZN6__dios10sched_nullINS_5ClockINS_10NondetKleeINS_4BaseEEEEEE13run_schedulerINS_7ContextEEEvv () at /dios/sys/sched_null.hpp:163
[ 0:13] 	#200084275 in klee_boot (argc=2, argv=94064629140864) 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	// <algorithm>
[ 0:13]     13	
[ 0:13]     14	// template<BidirectionalIterator InIter, BidirectionalIterator OutIter>
[ 0:13]     15	//   requires OutputIterator<OutIter, RvalueOf<InIter::reference>::type>
[ 0:13]     16	//   OutIter
[ 0:13]     17	//   move_backward(InIter first, InIter last, OutIter result);
[ 0:13]     18	
[ 0:13]     19	#include <algorithm>
[ 0:13]     20	#include <cassert>
[ 0:13]     21	#include <memory>
[ 0:13]     22	
[ 0:13]     23	#include "test_macros.h"
[ 0:13]     24	#include "test_iterators.h"
[ 0:13]     25	
[ 0:13]     26	template <class InIter, class OutIter>
[ 0:13]     27	void
[ 0:13]     28	test()
[ 0:13]     29	{
[ 0:13]     30	    const unsigned N = 1000;
[ 0:13]     31	    int ia[N];
[ 0:13]     32	    for (unsigned i = 0; i < N; ++i)
[ 0:13]     33	        ia[i] = i;
[ 0:13]     34	    int ib[N] = {0};
[ 0:13]     35	
[ 0:13]     36	    OutIter r = std::move_backward(InIter(ia), InIter(ia+N), OutIter(ib+N));
[ 0:13]     37	    assert(base(r) == ib);
[ 0:13]     38	    for (unsigned i = 0; i < N; ++i)
[ 0:13]     39	        assert(ia[i] == ib[i]);
[ 0:13]     40	}
[ 0:13]     41	
[ 0:13]     42	#if TEST_STD_VER >= 11
[ 0:13]     43	template <class InIter, class OutIter>
[ 0:13]     44	void
[ 0:13]     45	test1()
[ 0:13]     46	{
[ 0:13]     47	    const unsigned N = 100;
[ 0:13]     48	    std::unique_ptr<int> ia[N];
[ 0:13]     49	    for (unsigned i = 0; i < N; ++i)
[ 0:13]     50	        ia[i].reset(new int(i));
[ 0:13]     51	    std::unique_ptr<int> ib[N];
[ 0:13]     52	
[ 0:13]     53	    OutIter r = std::move_backward(InIter(ia), InIter(ia+N), OutIter(ib+N));
[ 0:13]     54	    assert(base(r) == ib);
[ 0:13]     55	    for (unsigned i = 0; i < N; ++i)
[ 0:13]     56	        assert(*ib[i] == static_cast<int>(i));
[ 0:13]     57	}
[ 0:13]     58	#endif
[ 0:13]     59	
[ 0:13]     60	int main(int, char**)
[ 0:13]     61	{
[ 0:13]     62	    test<bidirectional_iterator<const int*>, bidirectional_iterator<int*> >();
[ 0:13]     63	    test<bidirectional_iterator<const int*>, random_access_iterator<int*> >();
[ 0:13]     64	    test<bidirectional_iterator<const int*>, int*>();
[ 0:13]     65	
[ 0:13]     66	    test<random_access_iterator<const int*>, bidirectional_iterator<int*> >();
[ 0:13]     67	    test<random_access_iterator<const int*>, random_access_iterator<int*> >();
[ 0:13]     68	    test<random_access_iterator<const int*>, int*>();
[ 0:13]     69	
[ 0:13]     70	    test<const int*, bidirectional_iterator<int*> >();
[ 0:13]     71	    test<const int*, random_access_iterator<int*> >();
[ 0:13]     72	    test<const int*, int*>();
[ 0:13]     73	
[ 0:13]     74	#if TEST_STD_VER >= 11
[ 0:13]     75	    test1<bidirectional_iterator<std::unique_ptr<int>*>, bidirectional_iterator<std::unique_ptr<int>*> >();
[ 0:13]     76	    test1<bidirectional_iterator<std::unique_ptr<int>*>, random_access_iterator<std::unique_ptr<int>*> >();
[ 0:13]     77	    test1<bidirectional_iterator<std::unique_ptr<int>*>, std::unique_ptr<int>*>();
[ 0:13]     78	
[ 0:13]     79	    test1<random_access_iterator<std::unique_ptr<int>*>, bidirectional_iterator<std::unique_ptr<int>*> >();
[ 0:13]     80	    test1<random_access_iterator<std::unique_ptr<int>*>, random_access_iterator<std::unique_ptr<int>*> >();
[ 0:13]     81	    test1<random_access_iterator<std::unique_ptr<int>*>, std::unique_ptr<int>*>();
[ 0:13]     82	
[ 0:13]     83	    test1<std::unique_ptr<int>*, bidirectional_iterator<std::unique_ptr<int>*> >();
[ 0:13]     84	    test1<std::unique_ptr<int>*, random_access_iterator<std::unique_ptr<int>*> >();
[ 0:13]     85	    test1<std::unique_ptr<int>*, std::unique_ptr<int>*>();
[ 0:13]     86	#endif // TEST_STD_VER >= 11
[ 0:13]     87	
[ 0:13]     88	  return 0;
[ 0:13]     89	}
[ 0:13] # no errors were expected but one was found anyway