[ 0:01] compiling /home/xrockai/src/divine/nightly/test/libcxx/deque/push_back_rvalue.pass.cpp
[ 0:01] 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.20/_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:13] i:1
[ 0:13] KLEE: WARNING ONCE: Alignment of memory from call "klee_malloc" is not modelled. Using alignment of 8.
[ 0:13] about to __boot:0
[ 0:13] about to run the scheduler:0
[ 0:13] KLEE: WARNING ONCE: calling external: __dios_tainted_init() at /dios/libc/sys/start.cpp:49 5
[ 0:13] KLEE: ERROR: /dios/libc/sys/start.cpp:87: failed external call: __dios_tainted_init
[ 0:13] KLEE: NOTE: now ignoring this error at this location
[ 0:13] 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: 88903
[ 0:13] Stack: 
[ 0:13] 	#000088903 in __dios_start (l=0, argc=1, argv=94101514379272, envp=94101514397704) at /dios/libc/sys/start.cpp:87
[ 0:13] 	#100036732 in _ZN6__dios10sched_nullINS_5ClockINS_10NondetKleeINS_4BaseEEEEEE13run_schedulerINS_7ContextEEEvv () at /dios/sys/sched_null.hpp:163
[ 0:13] 	#200097483 in klee_boot (argc=2, argv=94101473750400) at /dios/arch/klee/boot.c:41
[ 0:13] 
[ 0:13] 
[ 0:13]      1	/* TAGS: c++ */
[ 0:13]      2	/* VERIFY_OPTS: -o nofail:malloc */
[ 0:13]      3	//===----------------------------------------------------------------------===//
[ 0:13]      4	//
[ 0:13]      5	//                     The LLVM Compiler Infrastructure
[ 0:13]      6	//
[ 0:13]      7	// This file is dual licensed under the MIT and the University of Illinois Open
[ 0:13]      8	// Source Licenses. See LICENSE.TXT for details.
[ 0:13]      9	//
[ 0:13]     10	//===----------------------------------------------------------------------===//
[ 0:13]     11	
[ 0:13]     12	// <deque>
[ 0:13]     13	
[ 0:13]     14	// void push_back(value_type&& v);
[ 0:13]     15	// void pop_back();
[ 0:13]     16	// void pop_front();
[ 0:13]     17	
[ 0:13]     18	#include <deque>
[ 0:13]     19	#include <cassert>
[ 0:13]     20	
[ 0:13]     21	#include "MoveOnly.h"
[ 0:13]     22	#include "min_allocator.h"
[ 0:13]     23	
[ 0:13]     24	#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES
[ 0:13]     25	
[ 0:13]     26	template <class C>
[ 0:13]     27	C
[ 0:13]     28	make(int size, int start = 0 )
[ 0:13]     29	{
[ 0:13]     30	    const int b = 4096 / sizeof(int);
[ 0:13]     31	    int init = 0;
[ 0:13]     32	    if (start > 0)
[ 0:13]     33	    {
[ 0:13]     34	        init = (start+1) / b + ((start+1) % b != 0);
[ 0:13]     35	        init *= b;
[ 0:13]     36	        --init;
[ 0:13]     37	    }
[ 0:13]     38	    C c(init);
[ 0:13]     39	    for (int i = 0; i < init-start; ++i)
[ 0:13]     40	        c.pop_back();
[ 0:13]     41	    for (int i = 0; i < size; ++i)
[ 0:13]     42	        c.push_back(MoveOnly(i));
[ 0:13]     43	    for (int i = 0; i < start; ++i)
[ 0:13]     44	        c.pop_front();
[ 0:13]     45	    return c;
[ 0:13]     46	}
[ 0:13]     47	
[ 0:13]     48	template <class C>
[ 0:13]     49	void test(int size)
[ 0:13]     50	{
[ 0:13]     51	    int rng[] = {0, 1, 2, 3};
[ 0:13]     52	    const int N = sizeof(rng)/sizeof(rng[0]);
[ 0:13]     53	    for (int j = 0; j < N; ++j)
[ 0:13]     54	    {
[ 0:13]     55	        C c = make<C>(size, rng[j]);
[ 0:13]     56	        typename C::const_iterator it = c.begin();
[ 0:13]     57	        for (int i = 0; i < size; ++i, ++it)
[ 0:13]     58	            assert(*it == MoveOnly(i));
[ 0:13]     59	    }
[ 0:13]     60	}
[ 0:13]     61	
[ 0:13]     62	#endif  // _LIBCPP_HAS_NO_RVALUE_REFERENCES
[ 0:13]     63	
[ 0:13]     64	int main()
[ 0:13]     65	{
[ 0:13]     66	#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES
[ 0:13]     67	    {
[ 0:13]     68	    int rng[] = {0, 1, 2, 3};
[ 0:13]     69	    const int N = sizeof(rng)/sizeof(rng[0]);
[ 0:13]     70	    for (int j = 0; j < N; ++j)
[ 0:13]     71	        test<std::deque<MoveOnly> >(rng[j]);
[ 0:13]     72	    }
[ 0:13]     73	#if __cplusplus >= 201103L
[ 0:13]     74	    {
[ 0:13]     75	    int rng[] = {0, 1, 2, 3};
[ 0:13]     76	    const int N = sizeof(rng)/sizeof(rng[0]);
[ 0:13]     77	    for (int j = 0; j < N; ++j)
[ 0:13]     78	        test<std::deque<MoveOnly, min_allocator<MoveOnly>> >(rng[j]);
[ 0:13]     79	    }
[ 0:13]     80	#endif
[ 0:13]     81	#endif  // _LIBCPP_HAS_NO_RVALUE_REFERENCES
[ 0:13]     82	}
[ 0:13] # no errors were expected but one was found anyway