[ 0:01] compiling /home/xrockai/src/divine/nightly/test/libcxx/deque/move_alloc.pass.cpp
[ 0:01] 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.13/_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: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: 110583
[ 0:15] Stack: 
[ 0:15] 	#000110583 in __dios_start (l=0, argc=1, argv=93853136605704, envp=93853136666632) at /dios/libc/sys/start.cpp:87
[ 0:15] 	#100058585 in _ZN6__dios10sched_nullINS_5ClockINS_10NondetKleeINS_4BaseEEEEEE13run_schedulerINS_7ContextEEEvv () at /dios/sys/sched_null.hpp:163
[ 0:15] 	#200119163 in klee_boot (argc=2, argv=93853099732352) at /dios/arch/klee/boot.c:41
[ 0:15] 
[ 0:15] 
[ 0:15]      1	/* TAGS: c++ */
[ 0:15]      2	/* VERIFY_OPTS: -o nofail:malloc */
[ 0:15]      3	//===----------------------------------------------------------------------===//
[ 0:15]      4	//
[ 0:15]      5	//                     The LLVM Compiler Infrastructure
[ 0:15]      6	//
[ 0:15]      7	// This file is dual licensed under the MIT and the University of Illinois Open
[ 0:15]      8	// Source Licenses. See LICENSE.TXT for details.
[ 0:15]      9	//
[ 0:15]     10	//===----------------------------------------------------------------------===//
[ 0:15]     11	
[ 0:15]     12	// <deque>
[ 0:15]     13	
[ 0:15]     14	// deque(deque&& c, const allocator_type& a);
[ 0:15]     15	
[ 0:15]     16	#include <deque>
[ 0:15]     17	#include <cassert>
[ 0:15]     18	
[ 0:15]     19	#include "MoveOnly.h"
[ 0:15]     20	#include "test_allocator.h"
[ 0:15]     21	#include "min_allocator.h"
[ 0:15]     22	
[ 0:15]     23	int main()
[ 0:15]     24	{
[ 0:15]     25	#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES
[ 0:15]     26	    {
[ 0:15]     27	        int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45};
[ 0:15]     28	        int* an = ab + sizeof(ab)/sizeof(ab[0]);
[ 0:15]     29	        typedef test_allocator<MoveOnly> A;
[ 0:15]     30	        std::deque<MoveOnly, A> c1(A(1));
[ 0:15]     31	        for (int* p = ab; p < an; ++p)
[ 0:15]     32	            c1.push_back(MoveOnly(*p));
[ 0:15]     33	        std::deque<MoveOnly, A> c2(A(1));
[ 0:15]     34	        for (int* p = ab; p < an; ++p)
[ 0:15]     35	            c2.push_back(MoveOnly(*p));
[ 0:15]     36	        std::deque<MoveOnly, A> c3(std::move(c1), A(3));
[ 0:15]     37	        assert(c2 == c3);
[ 0:15]     38	        assert(c3.get_allocator() == A(3));
[ 0:15]     39	        assert(c1.size() != 0);
[ 0:15]     40	    }
[ 0:15]     41	    {
[ 0:15]     42	        int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45};
[ 0:15]     43	        int* an = ab + sizeof(ab)/sizeof(ab[0]);
[ 0:15]     44	        typedef test_allocator<MoveOnly> A;
[ 0:15]     45	        std::deque<MoveOnly, A> c1(A(1));
[ 0:15]     46	        for (int* p = ab; p < an; ++p)
[ 0:15]     47	            c1.push_back(MoveOnly(*p));
[ 0:15]     48	        std::deque<MoveOnly, A> c2(A(1));
[ 0:15]     49	        for (int* p = ab; p < an; ++p)
[ 0:15]     50	            c2.push_back(MoveOnly(*p));
[ 0:15]     51	        std::deque<MoveOnly, A> c3(std::move(c1), A(1));
[ 0:15]     52	        assert(c2 == c3);
[ 0:15]     53	        assert(c3.get_allocator() == A(1));
[ 0:15]     54	        assert(c1.size() == 0);
[ 0:15]     55	    }
[ 0:15]     56	    {
[ 0:15]     57	        int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45};
[ 0:15]     58	        int* an = ab + sizeof(ab)/sizeof(ab[0]);
[ 0:15]     59	        typedef other_allocator<MoveOnly> A;
[ 0:15]     60	        std::deque<MoveOnly, A> c1(A(1));
[ 0:15]     61	        for (int* p = ab; p < an; ++p)
[ 0:15]     62	            c1.push_back(MoveOnly(*p));
[ 0:15]     63	        std::deque<MoveOnly, A> c2(A(1));
[ 0:15]     64	        for (int* p = ab; p < an; ++p)
[ 0:15]     65	            c2.push_back(MoveOnly(*p));
[ 0:15]     66	        std::deque<MoveOnly, A> c3(std::move(c1), A(3));
[ 0:15]     67	        assert(c2 == c3);
[ 0:15]     68	        assert(c3.get_allocator() == A(3));
[ 0:15]     69	        assert(c1.size() != 0);
[ 0:15]     70	    }
[ 0:15]     71	#if __cplusplus >= 201103L
[ 0:15]     72	    {
[ 0:15]     73	        int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45};
[ 0:15]     74	        int* an = ab + sizeof(ab)/sizeof(ab[0]);
[ 0:15]     75	        typedef min_allocator<MoveOnly> A;
[ 0:15]     76	        std::deque<MoveOnly, A> c1(A{});
[ 0:15]     77	        for (int* p = ab; p < an; ++p)
[ 0:15]     78	            c1.push_back(MoveOnly(*p));
[ 0:15]     79	        std::deque<MoveOnly, A> c2(A{});
[ 0:15]     80	        for (int* p = ab; p < an; ++p)
[ 0:15]     81	            c2.push_back(MoveOnly(*p));
[ 0:15]     82	        std::deque<MoveOnly, A> c3(std::move(c1), A());
[ 0:15]     83	        assert(c2 == c3);
[ 0:15]     84	        assert(c3.get_allocator() == A());
[ 0:15]     85	        assert(c1.size() == 0);
[ 0:15]     86	    }
[ 0:15]     87	#endif
[ 0:15]     88	#endif  // _LIBCPP_HAS_NO_RVALUE_REFERENCES
[ 0:15]     89	}
[ 0:15] # no errors were expected but one was found anyway