[ 0:02] compiling /home/xrockai/src/divine/nightly/test/libcxx/containers/splice_after_flist.pass.cpp
[ 0:02] In file included from /home/xrockai/src/divine/nightly/test/libcxx/containers/splice_after_flist.pass.cpp:16:
[ 0:02] In file included from /dios/libcxx/include/forward_list:181:
[ 0:02] In file included from /dios/libcxx/include/initializer_list:46:
[ 0:02] In file included from /dios/libcxx/include/cstddef:44:
[ 0:02] In file included from /dios/include/stddef.h:10:
[ 0:02] In file included from /dios/include/_PDCLIB/int.h:16:
[ 0:02] /dios/include/_PDCLIB/cdefs.h:69:10: warning: Unsupported _ _cplusplus (__cplusplus) (too new) (supported: ISO/IEC 14882:1997, ISO/IEC 14882:2011).
[ 0:02]         #warning Unsupported _ _cplusplus (__cplusplus) (too new) (supported: ISO/IEC 14882:1997, ISO/IEC 14882:2011).
[ 0:02]          ^
[ 0:02] 1 warning generated.
[ 0:02] 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.4/_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:07] 
[ 0:07] 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:11] Error: failed external call: __dios_tainted_init
[ 0:11] File: /dios/libc/sys/start.cpp
[ 0:11] Line: 87
[ 0:11] assembly.ll line: 70644
[ 0:11] Stack: 
[ 0:11] 	#000070644 in __dios_start (l=2, argc=1, argv=94582420825096, envp=94582420886024) at /dios/libc/sys/start.cpp:87
[ 0:11] 	#100018473 in _ZN6__dios10sched_nullINS_5ClockINS_10NondetKleeINS_4BaseEEEEEE13run_schedulerINS_7ContextEEEvv () at /dios/sys/sched_null.hpp:163
[ 0:11] 	#200079224 in klee_boot (argc=2, argv=94582393433472) at /dios/arch/klee/boot.c:41
[ 0:11] 
[ 0:11] 
[ 0:11]      1	/* TAGS: c++ fin */
[ 0:11]      2	/* CC_OPTS: -std=c++2a */
[ 0:11]      3	/* VERIFY_OPTS: -o nofail:malloc */
[ 0:11]      4	//===----------------------------------------------------------------------===//
[ 0:11]      5	//
[ 0:11]      6	// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
[ 0:11]      7	// See https://llvm.org/LICENSE.txt for license information.
[ 0:11]      8	// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
[ 0:11]      9	//
[ 0:11]     10	//===----------------------------------------------------------------------===//
[ 0:11]     11	
[ 0:11]     12	// <forward_list>
[ 0:11]     13	
[ 0:11]     14	// void splice_after(const_iterator p, forward_list&& x);
[ 0:11]     15	
[ 0:11]     16	#include <forward_list>
[ 0:11]     17	#include <cassert>
[ 0:11]     18	#include <iterator>
[ 0:11]     19	#include <cstddef>
[ 0:11]     20	
[ 0:11]     21	#include "test_macros.h"
[ 0:11]     22	#include "min_allocator.h"
[ 0:11]     23	
[ 0:11]     24	typedef int T;
[ 0:11]     25	const T t1[] = {0, 1, 2, 3, 4, 5, 6, 7};
[ 0:11]     26	const T t2[] = {10, 11, 12, 13, 14, 15};
[ 0:11]     27	const std::ptrdiff_t size_t1 = std::end(t1) - std::begin(t1);
[ 0:11]     28	const std::ptrdiff_t size_t2 = std::end(t2) - std::begin(t2);
[ 0:11]     29	
[ 0:11]     30	template <class C>
[ 0:11]     31	void
[ 0:11]     32	testd(const C& c, int p, int l)
[ 0:11]     33	{
[ 0:11]     34	    typename C::const_iterator i = c.begin();
[ 0:11]     35	    int n1 = 0;
[ 0:11]     36	    for (; n1 < p; ++n1, ++i)
[ 0:11]     37	        assert(*i == t1[n1]);
[ 0:11]     38	    for (int n2 = 0; n2 < l; ++n2, ++i)
[ 0:11]     39	        assert(*i == t2[n2]);
[ 0:11]     40	    for (; n1 < size_t1; ++n1, ++i)
[ 0:11]     41	        assert(*i == t1[n1]);
[ 0:11]     42	    assert(distance(c.begin(), c.end()) == size_t1 + l);
[ 0:11]     43	}
[ 0:11]     44	
[ 0:11]     45	int main(int, char**)
[ 0:11]     46	{
[ 0:11]     47	    {
[ 0:11]     48	    // splicing different containers
[ 0:11]     49	    typedef std::forward_list<T> C;
[ 0:11]     50	    for (int l = 0; l <= size_t2; ++l)
[ 0:11]     51	    {
[ 0:11]     52	        for (int p = 0; p <= size_t1; ++p)
[ 0:11]     53	        {
[ 0:11]     54	            C c1(std::begin(t1), std::end(t1));
[ 0:11]     55	            C c2(t2, t2+l);
[ 0:11]     56	
[ 0:11]     57	            c1.splice_after(next(c1.cbefore_begin(), p), std::move(c2));
[ 0:11]     58	            testd(c1, p, l);
[ 0:11]     59	        }
[ 0:11]     60	    }
[ 0:11]     61	    }
[ 0:11]     62	#if TEST_STD_VER >= 11
[ 0:11]     63	    {
[ 0:11]     64	    // splicing different containers
[ 0:11]     65	    typedef std::forward_list<T, min_allocator<T>> C;
[ 0:11]     66	    for (int l = 0; l <= size_t2; ++l)
[ 0:11]     67	    {
[ 0:11]     68	        for (int p = 0; p <= size_t1; ++p)
[ 0:11]     69	        {
[ 0:11]     70	            C c1(std::begin(t1), std::end(t1));
[ 0:11]     71	            C c2(t2, t2+l);
[ 0:11]     72	
[ 0:11]     73	            c1.splice_after(next(c1.cbefore_begin(), p), std::move(c2));
[ 0:11]     74	            testd(c1, p, l);
[ 0:11]     75	        }
[ 0:11]     76	    }
[ 0:11]     77	    }
[ 0:11]     78	#endif
[ 0:11]     79	
[ 0:11]     80	  return 0;
[ 0:11]     81	}
[ 0:11] # no errors were expected but one was found anyway