[ 0:00] compiling /home/xrockai/src/divine/nightly/test/libcxx/forwardlist/splice_after_one.pass.cpp
[ 0:00] compiling /dios/lib/config/seqklee.bc
[ 0:01] 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.21/_klee_out"
[ 0:06] KLEE: Using Z3 solver backend
[ 0:06] WARNING: this target does not support the llvm.stacksave intrinsic.
[ 0:06] 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:06] 
[ 0:06] KLEE: WARNING: undefined reference to function: _Z10klee_abortv
[ 0:11] KLEE: WARNING: undefined reference to function: __dios_tainted_init
[ 0:11] KLEE: WARNING: undefined reference to function: klee_free
[ 0:11] KLEE: WARNING: undefined reference to function: klee_malloc
[ 0:11] KLEE: WARNING ONCE: Using zero size array fix for landingpad instruction filter
[ 0:11] i:1
[ 0:11] KLEE: WARNING ONCE: Alignment of memory from call "klee_malloc" is not modelled. Using alignment of 8.
[ 0:11] about to __boot:0
[ 0:11] about to run the scheduler:0
[ 0:11] KLEE: WARNING ONCE: calling external: __dios_tainted_init() at /dios/libc/sys/start.cpp:49 5
[ 0:11] KLEE: ERROR: /dios/libc/sys/start.cpp:87: failed external call: __dios_tainted_init
[ 0:11] KLEE: NOTE: now ignoring this error at this location
[ 0:11] KLEE: ERROR: EXITING ON ERROR:
[ 0:12] Error: failed external call: __dios_tainted_init
[ 0:12] File: /dios/libc/sys/start.cpp
[ 0:12] Line: 87
[ 0:12] assembly.ll line: 73454
[ 0:12] Stack: 
[ 0:12] 	#000073454 in __dios_start (l=0, argc=1, argv=94561259434504, envp=94561259503624) at /dios/libc/sys/start.cpp:87
[ 0:12] 	#100021283 in _ZN6__dios10sched_nullINS_5ClockINS_10NondetKleeINS_4BaseEEEEEE13run_schedulerINS_7ContextEEEvv () at /dios/sys/sched_null.hpp:163
[ 0:12] 	#200082034 in klee_boot (argc=2, argv=94561226100096) at /dios/arch/klee/boot.c:41
[ 0:12] 
[ 0:12] 
[ 0:12]      1	/* TAGS: c++ */
[ 0:12]      2	/* VERIFY_OPTS: -o nofail:malloc */
[ 0:12]      3	//===----------------------------------------------------------------------===//
[ 0:12]      4	//
[ 0:12]      5	//                     The LLVM Compiler Infrastructure
[ 0:12]      6	//
[ 0:12]      7	// This file is dual licensed under the MIT and the University of Illinois Open
[ 0:12]      8	// Source Licenses. See LICENSE.TXT for details.
[ 0:12]      9	//
[ 0:12]     10	//===----------------------------------------------------------------------===//
[ 0:12]     11	
[ 0:12]     12	// <forward_list>
[ 0:12]     13	
[ 0:12]     14	// void splice_after(const_iterator p, forward_list&& x, const_iterator i);
[ 0:12]     15	
[ 0:12]     16	#include <forward_list>
[ 0:12]     17	#include <cassert>
[ 0:12]     18	#include <iterator>
[ 0:12]     19	
[ 0:12]     20	#include "min_allocator.h"
[ 0:12]     21	
[ 0:12]     22	typedef int T;
[ 0:12]     23	const T t1[] = {0, 1, 2, 3, 4, 5, 6, 7};
[ 0:12]     24	const T t2[] = {10, 11, 12};
[ 0:12]     25	const int size_t1 = std::end(t1) - std::begin(t1);
[ 0:12]     26	const int size_t2 = std::end(t2) - std::begin(t2);
[ 0:12]     27	
[ 0:12]     28	template <class C>
[ 0:12]     29	void
[ 0:12]     30	testd(const C& c, int p, int f)
[ 0:12]     31	{
[ 0:12]     32	    typename C::const_iterator i = c.begin();
[ 0:12]     33	    int n1 = 0;
[ 0:12]     34	    for (; n1 < p; ++n1, ++i)
[ 0:12]     35	        assert(*i == t1[n1]);
[ 0:12]     36	    for (int n2 = f; n2 < f+1; ++n2, ++i)
[ 0:12]     37	        assert(*i == t2[n2]);
[ 0:12]     38	    for (; n1 < size_t1; ++n1, ++i)
[ 0:12]     39	        assert(*i == t1[n1]);
[ 0:12]     40	    assert(distance(c.begin(), c.end()) == size_t1 + 1);
[ 0:12]     41	}
[ 0:12]     42	
[ 0:12]     43	template <class C>
[ 0:12]     44	void
[ 0:12]     45	tests(const C& c, int p, int f)
[ 0:12]     46	{
[ 0:12]     47	    typename C::const_iterator i = c.begin();
[ 0:12]     48	    int n = 0;
[ 0:12]     49	    int d = 1;
[ 0:12]     50	    if (p == f || p == f+1)
[ 0:12]     51	    {
[ 0:12]     52	        for (n = 0; n < size_t1; ++n, ++i)
[ 0:12]     53	            assert(*i == t1[n]);
[ 0:12]     54	    }
[ 0:12]     55	    else if (p < f)
[ 0:12]     56	    {
[ 0:12]     57	        for (n = 0; n < p; ++n, ++i)
[ 0:12]     58	            assert(*i == t1[n]);
[ 0:12]     59	        for (n = f; n < f+1; ++n, ++i)
[ 0:12]     60	            assert(*i == t1[n]);
[ 0:12]     61	        for (n = p; n < f; ++n, ++i)
[ 0:12]     62	            assert(*i == t1[n]);
[ 0:12]     63	        for (n = f+1; n < size_t1; ++n, ++i)
[ 0:12]     64	            assert(*i == t1[n]);
[ 0:12]     65	    }
[ 0:12]     66	    else // p > f+1
[ 0:12]     67	    {
[ 0:12]     68	        for (n = 0; n < f; ++n, ++i)
[ 0:12]     69	            assert(*i == t1[n]);
[ 0:12]     70	        for (n = f+1; n < p; ++n, ++i)
[ 0:12]     71	            assert(*i == t1[n]);
[ 0:12]     72	        for (n = f; n < f+1; ++n, ++i)
[ 0:12]     73	            assert(*i == t1[n]);
[ 0:12]     74	        for (n = p; n < size_t1; ++n, ++i)
[ 0:12]     75	            assert(*i == t1[n]);
[ 0:12]     76	    }
[ 0:12]     77	    assert(distance(c.begin(), c.end()) == size_t1);
[ 0:12]     78	}
[ 0:12]     79	
[ 0:12]     80	int main()
[ 0:12]     81	{
[ 0:12]     82	    {
[ 0:12]     83	    // splicing different containers
[ 0:12]     84	    typedef std::forward_list<T> C;
[ 0:12]     85	    for (int f = 0; f <= size_t2-1; ++f)
[ 0:12]     86	    {
[ 0:12]     87	        for (int p = 0; p <= size_t1; ++p)
[ 0:12]     88	        {
[ 0:12]     89	            C c1(std::begin(t1), std::end(t1));
[ 0:12]     90	            C c2(std::begin(t2), std::end(t2));
[ 0:12]     91	
[ 0:12]     92	            c1.splice_after(next(c1.cbefore_begin(), p), std::move(c2),
[ 0:12]     93	                  next(c2.cbefore_begin(), f));
[ 0:12]     94	            testd(c1, p, f);
[ 0:12]     95	        }
[ 0:12]     96	    }
[ 0:12]     97	
[ 0:12]     98	    // splicing within same container
[ 0:12]     99	    for (int f = 0; f <= size_t1-1; ++f)
[ 0:12]    100	    {
[ 0:12]    101	        for (int p = 0; p <= size_t1; ++p)
[ 0:12]    102	        {
[ 0:12]    103	            C c1(std::begin(t1), std::end(t1));
[ 0:12]    104	
[ 0:12]    105	            c1.splice_after(next(c1.cbefore_begin(), p), std::move(c1),
[ 0:12]    106	                  next(c1.cbefore_begin(), f));
[ 0:12]    107	            tests(c1, p, f);
[ 0:12]    108	        }
[ 0:12]    109	    }
[ 0:12]    110	    }
[ 0:12]    111	#if __cplusplus >= 201103L
[ 0:12]    112	    {
[ 0:12]    113	    // splicing different containers
[ 0:12]    114	    typedef std::forward_list<T, min_allocator<T>> C;
[ 0:12]    115	    for (int f = 0; f <= size_t2-1; ++f)
[ 0:12]    116	    {
[ 0:12]    117	        for (int p = 0; p <= size_t1; ++p)
[ 0:12]    118	        {
[ 0:12]    119	            C c1(std::begin(t1), std::end(t1));
[ 0:12]    120	            C c2(std::begin(t2), std::end(t2));
[ 0:12]    121	
[ 0:12]    122	            c1.splice_after(next(c1.cbefore_begin(), p), std::move(c2),
[ 0:12]    123	                  next(c2.cbefore_begin(), f));
[ 0:12]    124	            testd(c1, p, f);
[ 0:12]    125	        }
[ 0:12]    126	    }
[ 0:12]    127	
[ 0:12]    128	    // splicing within same container
[ 0:12]    129	    for (int f = 0; f <= size_t1-1; ++f)
[ 0:12]    130	    {
[ 0:12]    131	        for (int p = 0; p <= size_t1; ++p)
[ 0:12]    132	        {
[ 0:12]    133	            C c1(std::begin(t1), std::end(t1));
[ 0:12]    134	
[ 0:12]    135	            c1.splice_after(next(c1.cbefore_begin(), p), std::move(c1),
[ 0:12]    136	                  next(c1.cbefore_begin(), f));
[ 0:12]    137	            tests(c1, p, f);
[ 0:12]    138	        }
[ 0:12]    139	    }
[ 0:12]    140	    }
[ 0:12]    141	#endif
[ 0:12]    142	}
[ 0:12] # no errors were expected but one was found anyway