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