[ 0:00] compiling /home/xrockai/src/divine/nightly/test/libcxx/deque/resize_size.pass.cpp
[ 0:00] compiling /dios/lib/config/seqklee.bc
[ 0:01] 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.23/_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:08] 
[ 0:08] KLEE: WARNING: undefined reference to function: _Z10klee_abortv
[ 0:13] KLEE: WARNING: undefined reference to function: __dios_tainted_init
[ 0:13] KLEE: WARNING: undefined reference to function: klee_free
[ 0:13] KLEE: WARNING: undefined reference to function: klee_malloc
[ 0:13] 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: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: 92612
[ 0:14] Stack: 
[ 0:14] 	#000092612 in __dios_start (l=0, argc=1, argv=93928104866312, envp=93928104927240) at /dios/libc/sys/start.cpp:87
[ 0:14] 	#100040441 in _ZN6__dios10sched_nullINS_5ClockINS_10NondetKleeINS_4BaseEEEEEE13run_schedulerINS_7ContextEEEvv () at /dios/sys/sched_null.hpp:163
[ 0:14] 	#200101192 in klee_boot (argc=2, argv=93928065740160) at /dios/arch/klee/boot.c:41
[ 0:14] 
[ 0:14] 
[ 0:14]      1	/* TAGS: c++ ext */
[ 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 resize(size_type n);
[ 0:14]     15	
[ 0:14]     16	#include <deque>
[ 0:14]     17	#include <cassert>
[ 0:14]     18	
[ 0:14]     19	#include "min_allocator.h"
[ 0:14]     20	
[ 0:14]     21	template <class C>
[ 0:14]     22	C
[ 0:14]     23	make(int size, int start = 0 )
[ 0:14]     24	{
[ 0:14]     25	    const int b = 4096 / sizeof(int);
[ 0:14]     26	    int init = 0;
[ 0:14]     27	    if (start > 0)
[ 0:14]     28	    {
[ 0:14]     29	        init = (start+1) / b + ((start+1) % b != 0);
[ 0:14]     30	        init *= b;
[ 0:14]     31	        --init;
[ 0:14]     32	    }
[ 0:14]     33	    C c(init, 0);
[ 0:14]     34	    for (int i = 0; i < init-start; ++i)
[ 0:14]     35	        c.pop_back();
[ 0:14]     36	    for (int i = 0; i < size; ++i)
[ 0:14]     37	        c.push_back(i);
[ 0:14]     38	    for (int i = 0; i < start; ++i)
[ 0:14]     39	        c.pop_front();
[ 0:14]     40	    return c;
[ 0:14]     41	}
[ 0:14]     42	
[ 0:14]     43	template <class C>
[ 0:14]     44	void
[ 0:14]     45	test(C& c1, int size)
[ 0:14]     46	{
[ 0:14]     47	    typedef typename C::const_iterator CI;
[ 0:14]     48	    typename C::size_type c1_osize = c1.size();
[ 0:14]     49	    c1.resize(size);
[ 0:14]     50	    assert(c1.size() == size);
[ 0:14]     51	    assert(distance(c1.begin(), c1.end()) == c1.size());
[ 0:14]     52	    CI i = c1.begin();
[ 0:14]     53	    for (int j = 0; j < std::min(c1_osize, c1.size()); ++j, ++i)
[ 0:14]     54	        assert(*i == j);
[ 0:14]     55	    for (int j = c1_osize; j < c1.size(); ++j, ++i)
[ 0:14]     56	        assert(*i == 0);
[ 0:14]     57	}
[ 0:14]     58	
[ 0:14]     59	template <class C>
[ 0:14]     60	void
[ 0:14]     61	testN(int start, int N, int M)
[ 0:14]     62	{
[ 0:14]     63	    typedef typename C::const_iterator CI;
[ 0:14]     64	    C c1 = make<C>(N, start);
[ 0:14]     65	    test(c1, M);
[ 0:14]     66	}
[ 0:14]     67	
[ 0:14]     68	int main()
[ 0:14]     69	{
[ 0:14]     70	    {
[ 0:14]     71	    int rng[] = {0, 1, 2, 3};
[ 0:14]     72	    const int N = sizeof(rng)/sizeof(rng[0]);
[ 0:14]     73	    for (int i = 0; i < N; ++i)
[ 0:14]     74	        for (int j = 0; j < N; ++j)
[ 0:14]     75	            for (int k = 0; k < N; ++k)
[ 0:14]     76	                testN<std::deque<int> >(rng[i], rng[j], rng[k]);
[ 0:14]     77	    }
[ 0:14]     78	#if __cplusplus >= 201103L
[ 0:14]     79	    {
[ 0:14]     80	    int rng[] = {0, 1, 2, 3};
[ 0:14]     81	    const int N = sizeof(rng)/sizeof(rng[0]);
[ 0:14]     82	    for (int i = 0; i < N; ++i)
[ 0:14]     83	        for (int j = 0; j < N; ++j)
[ 0:14]     84	            for (int k = 0; k < N; ++k)
[ 0:14]     85	                testN<std::deque<int, min_allocator<int>>>(rng[i], rng[j], rng[k]);
[ 0:14]     86	    }
[ 0:14]     87	#endif
[ 0:14]     88	}
[ 0:14] # no errors were expected but one was found anyway