[ 0:01] compiling /home/xrockai/src/divine/nightly/test/libcxx/deque/iter_iter_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.22/_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: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: 95182
[ 0:13] Stack: 
[ 0:13] 	#000095182 in __dios_start (l=0, argc=1, argv=94060166735880, envp=94060166821384) at /dios/libc/sys/start.cpp:87
[ 0:13] 	#100043184 in _ZN6__dios10sched_nullINS_5ClockINS_10NondetKleeINS_4BaseEEEEEE13run_schedulerINS_7ContextEEEvv () at /dios/sys/sched_null.hpp:163
[ 0:13] 	#200103762 in klee_boot (argc=2, argv=94060133158272) 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	// template <class InputIterator>
[ 0:13]     15	//   deque(InputIterator f, InputIterator l, const allocator_type& a);
[ 0:13]     16	
[ 0:13]     17	#include <deque>
[ 0:13]     18	#include <cassert>
[ 0:13]     19	
[ 0:13]     20	#include "test_iterators.h"
[ 0:13]     21	#include "test_allocator.h"
[ 0:13]     22	#include "min_allocator.h"
[ 0:13]     23	
[ 0:13]     24	template <class InputIterator, class Allocator>
[ 0:13]     25	void
[ 0:13]     26	test(InputIterator f, InputIterator l, const Allocator& a)
[ 0:13]     27	{
[ 0:13]     28	    typedef typename std::iterator_traits<InputIterator>::value_type T;
[ 0:13]     29	    typedef std::deque<T, Allocator> C;
[ 0:13]     30	    typedef typename C::const_iterator const_iterator;
[ 0:13]     31	    C d(f, l, a);
[ 0:13]     32	    assert(d.get_allocator() == a);
[ 0:13]     33	    assert(d.size() == std::distance(f, l));
[ 0:13]     34	    assert(distance(d.begin(), d.end()) == d.size());
[ 0:13]     35	    for (const_iterator i = d.begin(), e = d.end(); i != e; ++i, ++f)
[ 0:13]     36	        assert(*i == *f);
[ 0:13]     37	}
[ 0:13]     38	
[ 0:13]     39	int main()
[ 0:13]     40	{
[ 0:13]     41	    int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45};
[ 0:13]     42	    int* an = ab + sizeof(ab)/sizeof(ab[0]);
[ 0:13]     43	    test(input_iterator<const int*>(ab), input_iterator<const int*>(an), test_allocator<int>(3));
[ 0:13]     44	    test(forward_iterator<const int*>(ab), forward_iterator<const int*>(an), test_allocator<int>(4));
[ 0:13]     45	    test(bidirectional_iterator<const int*>(ab), bidirectional_iterator<const int*>(an), test_allocator<int>(5));
[ 0:13]     46	    test(random_access_iterator<const int*>(ab), random_access_iterator<const int*>(an), test_allocator<int>(6));
[ 0:13]     47	#if __cplusplus >= 201103L
[ 0:13]     48	    test(input_iterator<const int*>(ab), input_iterator<const int*>(an), min_allocator<int>());
[ 0:13]     49	    test(forward_iterator<const int*>(ab), forward_iterator<const int*>(an), min_allocator<int>());
[ 0:13]     50	    test(bidirectional_iterator<const int*>(ab), bidirectional_iterator<const int*>(an), min_allocator<int>());
[ 0:13]     51	    test(random_access_iterator<const int*>(ab), random_access_iterator<const int*>(an), min_allocator<int>());
[ 0:13]     52	#endif
[ 0:13]     53	}
[ 0:13] # no errors were expected but one was found anyway