30.55/30.64	NO
30.55/30.64	
30.55/30.64	Solver Timeout: 4
30.55/30.64	Global Timeout: 300
30.55/30.64	No parsing errors!
30.55/30.64	Init Location: 0
30.55/30.64	Transitions:
30.55/30.64	<l0, l12, true>
30.55/30.64	<l1, l2, (undef9 = undef9), par{head_12^0 -> 0, i_11^0 -> 0, length_19^0 -> undef9}>
30.55/30.64	<l2, l3, (0 <= ((~(2) + (~(1) * i_11^0)) + length_10^0)) /\ (undef29 = undef29) /\ (undef27 = (0 + undef29)), par{head_12^0 -> (0 + undef27), i_11^0 -> (1 + i_11^0), tmp_13^0 -> undef27, tmp___0_14^0 -> undef29}>
30.55/30.64	<l2, l4, (((~(1) + (~(1) * i_11^0)) + length_10^0) <= 0) /\ (undef32 = (0 + head_12^0)) /\ (undef46 = (0 + undef32)) /\ (undef47 = undef47) /\ (undef45 = (0 + a_16^0)) /\ ((0 + undef45) <= 0) /\ (0 <= (0 + undef45)) /\ (undef48 = undef48) /\ (undef31 = undef31), par{Result_4^0 -> undef31, ___cil_tmp6_15^0 -> undef32, tmp_20^0 -> (0 + undef46), x_18^0 -> undef45}>
30.55/30.64	<l3, l5, (0 <= (0 + len_47^0)) /\ (0 <= ((~(2) + (~(1) * i_11^0)) + length_10^0)) /\ (undef62 = undef62) /\ (undef60 = (0 + undef62)), par{head_12^0 -> (0 + undef60), i_11^0 -> (1 + i_11^0), tmp_13^0 -> undef60, tmp___0_14^0 -> undef62}>
30.55/30.64	<l5, l3, true>
30.55/30.64	<l3, l6, (0 <= (0 + len_47^0)) /\ (((~(1) + (~(1) * i_11^0)) + length_10^0) <= 0) /\ (undef80 = (0 + head_12^0)) /\ (undef94 = (0 + undef80)) /\ (0 <= (0 + len_47^0)) /\ (undef79 = undef79) /\ (0 <= (0 + len_47^0)) /\ (0 <= (0 + len_47^0)) /\ (0 <= (0 + len_47^0)) /\ (0 <= (0 + len_47^0)), par{Result_4^0 -> undef79, ___cil_tmp6_15^0 -> undef80, tmp_20^0 -> (0 + undef94), x_18^0 -> (0 + a_16^0)}>
30.55/30.64	<l6, l7, ((1 + x_18^0) <= 0)>
30.55/30.64	<l6, l7, (1 <= (0 + x_18^0))>
30.55/30.64	<l7, l8, (undef140 = undef140) /\ (undef134 = undef134), par{lt_21^0 -> undef134, t_17^0 -> (0 + x_18^0), x_18^0 -> (0 + undef140)}>
30.55/30.64	<l8, l4, (0 <= (0 + a_140^0)) /\ ((0 + x_18^0) <= 0) /\ (0 <= (0 + x_18^0)) /\ (undef156 = undef156) /\ (undef141 = undef141), par{Result_4^0 -> undef141}>
30.55/30.64	<l8, l9, (0 <= (0 + a_140^0))>
30.55/30.64	<l9, l10, ((1 + x_18^0) <= 0)>
30.55/30.64	<l9, l10, (1 <= (0 + x_18^0))>
30.55/30.64	<l10, l11, (undef217 = undef217) /\ (undef211 = undef211), par{lt_21^0 -> undef211, t_17^0 -> (0 + x_18^0), x_18^0 -> (0 + undef217)}>
30.55/30.64	<l11, l8, true>
30.55/30.64	<l12, l1, true>
30.55/30.64	
30.55/30.64	Fresh variables:
30.55/30.64	undef9, undef27, undef29, undef31, undef32, undef45, undef46, undef47, undef48, undef60, undef62, undef79, undef80, undef94, undef134, undef140, undef141, undef156, undef211, undef217, 
30.55/30.64	
30.55/30.64	Undef variables:
30.55/30.64	undef9, undef27, undef29, undef31, undef32, undef45, undef46, undef47, undef48, undef60, undef62, undef79, undef80, undef94, undef134, undef140, undef141, undef156, undef211, undef217, 
30.55/30.64	
30.55/30.64	Abstraction variables:
30.55/30.64	
30.55/30.64	Exit nodes:
30.55/30.64	
30.55/30.64	Accepting locations:
30.55/30.64	
30.55/30.64	Asserts:
30.55/30.64	
30.55/30.64	Preprocessed LLVMGraph
30.55/30.64	Init Location: 0
30.55/30.64	Transitions:
30.55/30.64	<l0, l3, (undef9 = undef9) /\ (0 <= ((~(2) + (~(1) * 0)) + length_10^0)) /\ (undef29 = undef29) /\ (undef27 = (0 + undef29)), par{head_12^0 -> (0 + undef27), i_11^0 -> (1 + 0)}>
30.55/30.64	<l0, l4, (undef9 = undef9) /\ (((~(1) + (~(1) * 0)) + length_10^0) <= 0) /\ (undef32 = (0 + 0)) /\ (undef46 = (0 + undef32)) /\ (undef47 = undef47) /\ (undef45 = (0 + a_16^0)) /\ ((0 + undef45) <= 0) /\ (0 <= (0 + undef45)) /\ (undef48 = undef48) /\ (undef31 = undef31), par{head_12^0 -> 0, i_11^0 -> 0, x_18^0 -> undef45}>
30.55/30.64	<l3, l3, (0 <= (0 + len_47^0)) /\ (0 <= ((~(2) + (~(1) * i_11^0)) + length_10^0)) /\ (undef62 = undef62) /\ (undef60 = (0 + undef62)), par{head_12^0 -> (0 + undef60), i_11^0 -> (1 + i_11^0)}>
30.55/30.64	<l3, l8, (0 <= (0 + len_47^0)) /\ (((~(1) + (~(1) * i_11^0)) + length_10^0) <= 0) /\ (undef80 = (0 + head_12^0)) /\ (undef94 = (0 + undef80)) /\ (0 <= (0 + len_47^0)) /\ (undef79 = undef79) /\ (0 <= (0 + len_47^0)) /\ (0 <= (0 + len_47^0)) /\ (0 <= (0 + len_47^0)) /\ (0 <= (0 + len_47^0)) /\ ((1 + (0 + a_16^0)) <= 0) /\ (undef140 = undef140) /\ (undef134 = undef134), par{x_18^0 -> (0 + undef140)}>
30.55/30.64	<l3, l8, (0 <= (0 + len_47^0)) /\ (((~(1) + (~(1) * i_11^0)) + length_10^0) <= 0) /\ (undef80 = (0 + head_12^0)) /\ (undef94 = (0 + undef80)) /\ (0 <= (0 + len_47^0)) /\ (undef79 = undef79) /\ (0 <= (0 + len_47^0)) /\ (0 <= (0 + len_47^0)) /\ (0 <= (0 + len_47^0)) /\ (0 <= (0 + len_47^0)) /\ (1 <= (0 + (0 + a_16^0))) /\ (undef140 = undef140) /\ (undef134 = undef134), par{x_18^0 -> (0 + undef140)}>
30.55/30.64	<l8, l4, (0 <= (0 + a_140^0)) /\ ((0 + x_18^0) <= 0) /\ (0 <= (0 + x_18^0)) /\ (undef156 = undef156) /\ (undef141 = undef141)>
30.55/30.64	<l8, l8, (0 <= (0 + a_140^0)) /\ ((1 + x_18^0) <= 0) /\ (undef217 = undef217) /\ (undef211 = undef211), par{x_18^0 -> (0 + undef217)}>
30.55/30.64	<l8, l8, (0 <= (0 + a_140^0)) /\ (1 <= (0 + x_18^0)) /\ (undef217 = undef217) /\ (undef211 = undef211), par{x_18^0 -> (0 + undef217)}>
30.55/30.64	
30.55/30.64	Fresh variables:
30.55/30.64	undef9, undef27, undef29, undef31, undef32, undef45, undef46, undef47, undef48, undef60, undef62, undef79, undef80, undef94, undef134, undef140, undef141, undef156, undef211, undef217, 
30.55/30.64	
30.55/30.64	Undef variables:
30.55/30.64	undef9, undef27, undef29, undef31, undef32, undef45, undef46, undef47, undef48, undef60, undef62, undef79, undef80, undef94, undef134, undef140, undef141, undef156, undef211, undef217, 
30.55/30.64	
30.55/30.64	Abstraction variables:
30.55/30.64	
30.55/30.64	Exit nodes:
30.55/30.64	
30.55/30.64	Accepting locations:
30.55/30.64	
30.55/30.64	Asserts:
30.55/30.64	
30.55/30.64	*************************************************************
30.55/30.64	*******************************************************************************************
30.55/30.64	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
30.55/30.64	*******************************************************************************************
30.55/30.64	
30.55/30.64	Init Location: 0
30.55/30.64	Graph 0:
30.55/30.64	Transitions:
30.55/30.64	Variables:
30.55/30.64	
30.55/30.64	Graph 1:
30.55/30.64	Transitions:
30.55/30.64	<l3, l3, 0 <= len_47^0 /\ 2 + i_11^0 <= length_10^0 /\ undef60 = undef62, {head_12^0 -> undef60, i_11^0 -> 1 + i_11^0, rest remain the same}>
30.55/30.64	Variables:
30.55/30.64	head_12^0, i_11^0, len_47^0, length_10^0
30.55/30.64	
30.55/30.64	Graph 2:
30.55/30.64	Transitions:
30.55/30.64	<l8, l8, 0 <= a_140^0 /\ 1 + x_18^0 <= 0, {x_18^0 -> undef217, rest remain the same}>
30.55/30.64	<l8, l8, 0 <= a_140^0 /\ 1 <= x_18^0, {x_18^0 -> undef217, rest remain the same}>
30.55/30.64	Variables:
30.55/30.64	a_140^0, x_18^0
30.55/30.64	
30.55/30.64	Graph 3:
30.55/30.64	Transitions:
30.55/30.64	Variables:
30.55/30.64	
30.55/30.64	Precedence: 
30.55/30.64	Graph 0
30.55/30.64	
30.55/30.64	Graph 1
30.55/30.64	<l0, l3, 2 <= length_10^0 /\ undef27 = undef29, {head_12^0 -> undef27, i_11^0 -> 1, rest remain the same}>
30.55/30.64	
30.55/30.64	Graph 2
30.55/30.64	<l3, l8, 0 <= len_47^0 /\ 1 + a_16^0 <= 0 /\ length_10^0 <= 1 + i_11^0 /\ head_12^0 = undef80 /\ undef80 = undef94, {x_18^0 -> undef140, rest remain the same}>
30.55/30.64	<l3, l8, 0 <= len_47^0 /\ 1 <= a_16^0 /\ length_10^0 <= 1 + i_11^0 /\ head_12^0 = undef80 /\ undef80 = undef94, {x_18^0 -> undef140, rest remain the same}>
30.55/30.64	
30.55/30.64	Graph 3
30.55/30.64	<l0, l4, length_10^0 <= 1 /\ a_16^0 = undef45 /\ undef32 = 0 /\ undef32 = undef46 /\ undef45 = 0, {head_12^0 -> 0, i_11^0 -> 0, x_18^0 -> undef45, rest remain the same}>
30.55/30.64	<l8, l4, 0 <= a_140^0 /\ x_18^0 = 0, {all remain the same}>
30.55/30.64	
30.55/30.64	Map Locations to Subgraph:
30.55/30.64	( 0 , 0 )
30.55/30.64	( 3 , 1 )
30.55/30.64	( 4 , 3 )
30.55/30.64	( 8 , 2 )
30.55/30.64	
30.55/30.64	*******************************************************************************************
30.55/30.64	********************************    CHECKING ASSERTIONS    ********************************
30.55/30.64	*******************************************************************************************
30.55/30.64	
30.55/30.64	Proving termination of subgraph 0
30.55/30.64	Proving termination of subgraph 1
30.55/30.64	Checking unfeasibility...
30.55/30.64	Time used: 0.00317
30.55/30.64	
30.55/30.64	Checking conditional termination of SCC {l3}...
30.55/30.64	
30.55/30.64	LOG: CALL solveLinear
30.55/30.64	
30.55/30.64	LOG: RETURN solveLinear - Elapsed time: 0.001026s
30.55/30.64	Ranking function: -2 - i_11^0 + length_10^0
30.55/30.64	New Graphs: 
30.55/30.64	Proving termination of subgraph 2
30.55/30.64	Checking unfeasibility...
30.55/30.64	Time used: 0.00368
30.55/30.64	
30.55/30.64	Checking conditional termination of SCC {l8}...
30.55/30.64	
30.55/30.64	LOG: CALL solveLinear
30.55/30.64	
30.55/30.64	LOG: RETURN solveLinear - Elapsed time: 0.001037s
30.55/30.64	
30.55/30.64	LOG: CALL solveLinear
30.55/30.64	
30.55/30.64	LOG: RETURN solveLinear - Elapsed time: 0.003460s
30.55/30.64	Trying to remove transition: <l8, l8, 0 <= a_140^0 /\ 1 <= x_18^0, {x_18^0 -> undef217, rest remain the same}>
30.55/30.64	Solving with 1 template(s).
30.55/30.64	
30.55/30.64	LOG: CALL solveNonLinearGetFirstSolution
30.55/30.64	
30.55/30.64	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007769s
30.55/30.64	Time used: 0.007545
30.55/30.64	Trying to remove transition: <l8, l8, 0 <= a_140^0 /\ 1 + x_18^0 <= 0, {x_18^0 -> undef217, rest remain the same}>
30.55/30.64	Solving with 1 template(s).
30.55/30.64	
30.55/30.64	LOG: CALL solveNonLinearGetFirstSolution
30.55/30.64	
30.55/30.64	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006778s
30.55/30.64	Time used: 0.006294
30.55/30.64	Solving with 1 template(s).
30.55/30.64	
30.55/30.64	LOG: CALL solveNonLinearGetFirstSolution
30.55/30.64	
30.55/30.64	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.014960s
30.55/30.64	Time used: 0.014356
30.55/30.64	Improving Solution with cost 2 ...
30.55/30.64	
30.55/30.64	LOG: CALL solveNonLinearGetNextSolution
30.55/30.64	
30.55/30.64	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.032139s
30.55/30.64	Time used: 0.03213
30.55/30.64	
30.55/30.64	LOG: SAT solveNonLinear - Elapsed time: 0.047100s
30.55/30.64	Cost: 2; Total time: 0.046486
30.55/30.64	Failed at location 8: 1 + a_140^0 <= 0
30.55/30.64	Failed at location 8: 1 + a_140^0 <= 0
30.55/30.64	Before Improving: 
30.55/30.64	Quasi-invariant at l8: 1 + a_140^0 <= 0
30.55/30.64	Optimizing invariants...
30.55/30.64	
30.55/30.64	LOG: CALL solveLinear
30.55/30.64	
30.55/30.64	LOG: RETURN solveLinear - Elapsed time: 0.005105s
30.55/30.64	Remaining time after improvement: 0.998317
30.55/30.64	Termination implied by a set of quasi-invariant(s):
30.55/30.64	Quasi-invariant at l8: 1 + a_140^0 <= 0
30.55/30.64	[ Invariant Graph ]
30.55/30.64	Strengthening and disabling transitions...
30.55/30.64	
30.55/30.64	LOG: CALL solverLinear in Graph for feasibility
30.55/30.64	
30.55/30.64	LOG: RETURN solveLinear in Graph for feasibility
30.55/30.64	It's unfeasible. Removing transition: 
30.55/30.64	<l8, l8, 0 <= a_140^0 /\ 1 + x_18^0 <= 0, {x_18^0 -> undef217, rest remain the same}>
30.55/30.64	
30.55/30.64	LOG: CALL solverLinear in Graph for feasibility
30.55/30.64	
30.55/30.64	LOG: RETURN solveLinear in Graph for feasibility
30.55/30.64	It's unfeasible. Removing transition: 
30.55/30.64	<l8, l8, 0 <= a_140^0 /\ 1 <= x_18^0, {x_18^0 -> undef217, rest remain the same}>
30.55/30.64	[ Termination Graph ]
30.55/30.64	Strengthening and disabling transitions...
30.55/30.64	
30.55/30.64	LOG: CALL solverLinear in Graph for feasibility
30.55/30.64	
30.55/30.64	LOG: RETURN solveLinear in Graph for feasibility
30.55/30.64	It's unfeasible. Removing transition: 
30.55/30.64	<l8, l8, 0 <= a_140^0 /\ 1 + x_18^0 <= 0, {x_18^0 -> undef217, rest remain the same}>
30.55/30.64	
30.55/30.64	LOG: CALL solverLinear in Graph for feasibility
30.55/30.64	
30.55/30.64	LOG: RETURN solveLinear in Graph for feasibility
30.55/30.64	It's unfeasible. Removing transition: 
30.55/30.64	<l8, l8, 0 <= a_140^0 /\ 1 <= x_18^0, {x_18^0 -> undef217, rest remain the same}>
30.55/30.64	New Graphs: 
30.55/30.64	Calling Safety with literal 1 + a_140^0 <= 0 and entry <l3, l8, 0 <= len_47^0 /\ 1 + a_16^0 <= 0 /\ length_10^0 <= 1 + i_11^0 /\ head_12^0 = undef80 /\ undef80 = undef94, {x_18^0 -> undef140, rest remain the same}>
30.55/30.64	
30.55/30.64	LOG: CALL check - Post:1 + a_140^0 <= 0 - Process 1
30.55/30.64	* Exit transition: <l3, l8, 0 <= len_47^0 /\ 1 + a_16^0 <= 0 /\ length_10^0 <= 1 + i_11^0 /\ head_12^0 = undef80 /\ undef80 = undef94, {x_18^0 -> undef140, rest remain the same}>
30.55/30.64	* Postcondition  : 1 + a_140^0 <= 0
30.55/30.64	Postcodition moved up: 1 + a_140^0 <= 0
30.55/30.64	
30.55/30.64	LOG: Try proving POST
30.55/30.64	Postcondition: 1 + a_140^0 <= 0
30.55/30.64	
30.55/30.64	LOG: CALL check - Post:1 + a_140^0 <= 0 - Process 2
30.55/30.64	* Exit transition: <l0, l3, 0 <= len_47^0 /\ 2 <= length_10^0 /\ 1 + a_16^0 <= 0 /\ undef27 = undef29 /\ undef80 = undef94, {head_12^0 -> undef27, i_11^0 -> 1, rest remain the same}>
30.55/30.64	* Postcondition  : 1 + a_140^0 <= 0
30.55/30.64	
30.55/30.64	LOG: CALL solveLinear
30.55/30.64	
30.55/30.64	LOG: RETURN solveLinear - Elapsed time: 0.000714s
30.55/30.64	> Postcondition is not implied!
30.55/30.64	
30.55/30.64	LOG: RETURN check - Elapsed time: 0.000828s
30.55/30.64	
30.55/30.64	LOG: NarrowEntry size 1
30.55/30.64	Narrowing transition: 
30.55/30.64	<l3, l3, 0 <= len_47^0 /\ 2 + i_11^0 <= length_10^0 /\ undef60 = undef62, {head_12^0 -> undef60, i_11^0 -> 1 + i_11^0, rest remain the same}>
30.55/30.64	
30.55/30.64	LOG: Narrow transition size 1
30.55/30.64	ENTRIES:
30.55/30.64	<l0, l3, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 2 <= length_10^0 /\ 1 + a_16^0 <= 0 /\ undef27 = undef29 /\ undef80 = undef94, {head_12^0 -> undef27, i_11^0 -> 1, rest remain the same}>
30.55/30.64	END ENTRIES:
30.55/30.64	GRAPH:
30.55/30.64	<l3, l3, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 2 + i_11^0 <= length_10^0 /\ 1 + a_16^0 <= 0 /\ undef60 = undef62 /\ undef80 = undef94, {head_12^0 -> undef60, i_11^0 -> 1 + i_11^0, rest remain the same}>
30.55/30.64	END GRAPH:
30.55/30.64	EXIT: <l3, l8, 0 <= len_47^0 /\ 1 + a_16^0 <= 0 /\ length_10^0 <= 1 + i_11^0 /\ head_12^0 = undef80 /\ undef80 = undef94, {x_18^0 -> undef140, rest remain the same}>
30.55/30.64	POST: 1 + a_140^0 <= 0
30.55/30.64	
30.55/30.64	
30.55/30.64	LOG: Try proving POST
30.55/30.64	Solving with 1 template(s).
30.55/30.64	
30.55/30.64	LOG: CALL solveNonLinearGetFirstSolution
30.55/30.64	
30.55/30.64	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.020864s
30.55/30.64	Time used: 0.020664
30.55/30.64	Improving Solution with cost 51 ...
30.55/30.64	
30.55/30.64	LOG: CALL solveNonLinearGetNextSolution
30.55/30.64	
30.55/30.64	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000651s
30.55/30.64	Time used: 1.00043
30.55/30.64	
30.55/30.64	LOG: SAT solveNonLinear - Elapsed time: 1.021515s
30.55/30.64	Cost: 51; Total time: 1.02109
30.55/30.64	Failed at location 3: length_10^0 <= 1 + i_11^0
30.55/30.64	Before Improving: 
30.55/30.64	Quasi-invariant at l3: length_10^0 <= 1 + i_11^0
30.55/30.64	Optimizing invariants...
30.55/30.64	
30.55/30.64	LOG: CALL solveLinear
30.55/30.64	
30.55/30.64	LOG: RETURN solveLinear - Elapsed time: 0.003591s
30.55/30.64	Remaining time after improvement: 0.998461
30.55/30.64	Some transition disabled by a set of quasi-invariant(s):
30.55/30.64	Quasi-invariant at l3: length_10^0 <= 1 + i_11^0
30.55/30.64	
30.55/30.64	LOG: NEXT CALL check - disable
30.55/30.64	
30.55/30.64	LOG: CALL check - Post:length_10^0 <= 1 + i_11^0 - Process 3
30.55/30.64	* Exit transition: <l0, l3, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 2 <= length_10^0 /\ 1 + a_16^0 <= 0 /\ undef27 = undef29 /\ undef80 = undef94, {head_12^0 -> undef27, i_11^0 -> 1, rest remain the same}>
30.55/30.64	* Postcondition  : length_10^0 <= 1 + i_11^0
30.55/30.64	
30.55/30.64	LOG: CALL solveLinear
30.55/30.64	
30.55/30.64	LOG: RETURN solveLinear - Elapsed time: 0.000981s
30.55/30.64	> Postcondition is not implied!
30.55/30.64	
30.55/30.64	LOG: RETURN check - Elapsed time: 0.001109s
30.55/30.64	Solving with 2 template(s).
30.55/30.64	
30.55/30.64	LOG: CALL solveNonLinearGetFirstSolution
30.55/30.64	
30.55/30.64	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.634984s
30.55/30.64	Time used: 1.6344
30.55/30.64	Improving Solution with cost 51 ...
30.55/30.64	
30.55/30.64	LOG: CALL solveNonLinearGetNextSolution
30.55/30.64	
30.55/30.64	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000492s
30.55/30.64	Time used: 1.00042
30.55/30.64	
30.55/30.64	LOG: SAT solveNonLinear - Elapsed time: 2.635475s
30.55/30.64	Cost: 51; Total time: 2.63482
30.55/30.64	Failed at location 3: a_140^0 + length_10^0 <= 1 + i_11^0
30.55/30.64	Before Improving: 
30.55/30.64	Quasi-invariant at l3: 1 + a_16^0 <= i_11^0
30.55/30.64	Quasi-invariant at l3: a_140^0 + length_10^0 <= 1 + i_11^0
30.55/30.64	Optimizing invariants...
30.55/30.64	
30.55/30.64	LOG: CALL solveLinear
30.55/30.64	
30.55/30.64	LOG: RETURN solveLinear - Elapsed time: 0.007740s
30.55/30.64	Remaining time after improvement: 0.997838
30.55/30.64	Some transition disabled by a set of quasi-invariant(s):
30.55/30.64	Quasi-invariant at l3: 1 + a_16^0 <= i_11^0
30.55/30.64	Quasi-invariant at l3: a_140^0 + length_10^0 <= 1 + i_11^0
30.55/30.64	
30.55/30.64	LOG: NEXT CALL check - disable
30.55/30.64	
30.55/30.64	LOG: CALL check - Post:a_140^0 + length_10^0 <= 1 + i_11^0 - Process 4
30.55/30.64	* Exit transition: <l0, l3, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 2 <= length_10^0 /\ 1 + a_16^0 <= 0 /\ undef27 = undef29 /\ undef80 = undef94, {head_12^0 -> undef27, i_11^0 -> 1, rest remain the same}>
30.55/30.64	* Postcondition  : a_140^0 + length_10^0 <= 1 + i_11^0
30.55/30.64	
30.55/30.64	LOG: CALL solveLinear
30.55/30.64	
30.55/30.64	LOG: RETURN solveLinear - Elapsed time: 0.001164s
30.55/30.64	> Postcondition is not implied!
30.55/30.64	
30.55/30.64	LOG: RETURN check - Elapsed time: 0.001301s
30.55/30.64	Solving with 3 template(s).
30.55/30.64	
30.55/30.64	LOG: CALL solveNonLinearGetFirstSolution
30.55/30.64	
30.55/30.64	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.000348s
30.55/30.64	Time used: 1.00003
30.55/30.64	
30.55/30.64	LOG: Postcondition is not implied - no solution
30.55/30.64	> Postcondition is not implied!
30.55/30.64	
30.55/30.64	LOG: RETURN check - Elapsed time: 4.685906s
30.55/30.64	Calling Safety with literal 1 + a_140^0 <= 0 and entry <l3, l8, 0 <= len_47^0 /\ 1 <= a_16^0 /\ length_10^0 <= 1 + i_11^0 /\ head_12^0 = undef80 /\ undef80 = undef94, {x_18^0 -> undef140, rest remain the same}>
30.55/30.64	
30.55/30.64	LOG: CALL check - Post:1 + a_140^0 <= 0 - Process 5
30.55/30.64	* Exit transition: <l3, l8, 0 <= len_47^0 /\ 1 <= a_16^0 /\ length_10^0 <= 1 + i_11^0 /\ head_12^0 = undef80 /\ undef80 = undef94, {x_18^0 -> undef140, rest remain the same}>
30.55/30.64	* Postcondition  : 1 + a_140^0 <= 0
30.55/30.64	Postcodition moved up: 1 + a_140^0 <= 0
30.55/30.64	
30.55/30.64	LOG: Try proving POST
30.55/30.64	Postcondition: 1 + a_140^0 <= 0
30.55/30.64	
30.55/30.64	LOG: CALL check - Post:1 + a_140^0 <= 0 - Process 6
30.55/30.64	* Exit transition: <l0, l3, 0 <= len_47^0 /\ 2 <= length_10^0 /\ 1 <= a_16^0 /\ undef27 = undef29 /\ undef80 = undef94, {head_12^0 -> undef27, i_11^0 -> 1, rest remain the same}>
30.55/30.64	* Postcondition  : 1 + a_140^0 <= 0
30.55/30.64	
30.55/30.64	LOG: CALL solveLinear
30.55/30.64	
30.55/30.64	LOG: RETURN solveLinear - Elapsed time: 0.000844s
30.55/30.64	> Postcondition is not implied!
30.55/30.64	
30.55/30.64	LOG: RETURN check - Elapsed time: 0.000969s
30.55/30.64	
30.55/30.64	LOG: NarrowEntry size 1
30.55/30.64	Narrowing transition: 
30.55/30.64	<l3, l3, 0 <= len_47^0 /\ 2 + i_11^0 <= length_10^0 /\ undef60 = undef62, {head_12^0 -> undef60, i_11^0 -> 1 + i_11^0, rest remain the same}>
30.55/30.64	
30.55/30.64	LOG: Narrow transition size 1
30.55/30.64	ENTRIES:
30.55/30.64	<l0, l3, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 2 <= length_10^0 /\ 1 <= a_16^0 /\ undef27 = undef29 /\ undef80 = undef94, {head_12^0 -> undef27, i_11^0 -> 1, rest remain the same}>
30.55/30.64	END ENTRIES:
30.55/30.64	GRAPH:
30.55/30.64	<l3, l3, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 2 + i_11^0 <= length_10^0 /\ 1 <= a_16^0 /\ undef60 = undef62 /\ undef80 = undef94, {head_12^0 -> undef60, i_11^0 -> 1 + i_11^0, rest remain the same}>
30.55/30.64	END GRAPH:
30.55/30.64	EXIT: <l3, l8, 0 <= len_47^0 /\ 1 <= a_16^0 /\ length_10^0 <= 1 + i_11^0 /\ head_12^0 = undef80 /\ undef80 = undef94, {x_18^0 -> undef140, rest remain the same}>
30.55/30.64	POST: 1 + a_140^0 <= 0
30.55/30.64	
30.55/30.64	
30.55/30.64	LOG: Try proving POST
30.55/30.64	Solving with 1 template(s).
30.55/30.64	
30.55/30.64	LOG: CALL solveNonLinearGetFirstSolution
30.55/30.64	
30.55/30.64	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.021069s
30.55/30.64	Time used: 0.020869
30.55/30.64	Improving Solution with cost 51 ...
30.55/30.64	
30.55/30.64	LOG: CALL solveNonLinearGetNextSolution
30.55/30.64	
30.55/30.64	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000490s
30.55/30.64	Time used: 1.00042
30.55/30.64	
30.55/30.64	LOG: SAT solveNonLinear - Elapsed time: 1.021559s
30.55/30.64	Cost: 51; Total time: 1.02129
30.55/30.64	Failed at location 3: a_140^0 + length_10^0 <= 1 + i_11^0
30.55/30.64	Before Improving: 
30.55/30.64	Quasi-invariant at l3: a_140^0 + length_10^0 <= 1 + i_11^0
30.55/30.64	Optimizing invariants...
30.55/30.64	
30.55/30.64	LOG: CALL solveLinear
30.55/30.64	
30.55/30.64	LOG: RETURN solveLinear - Elapsed time: 0.003796s
30.55/30.64	Remaining time after improvement: 0.99833
30.55/30.64	Some transition disabled by a set of quasi-invariant(s):
30.55/30.64	Quasi-invariant at l3: a_140^0 + length_10^0 <= 1 + i_11^0
30.55/30.64	
30.55/30.64	LOG: NEXT CALL check - disable
30.55/30.64	
30.55/30.64	LOG: CALL check - Post:a_140^0 + length_10^0 <= 1 + i_11^0 - Process 7
30.55/30.64	* Exit transition: <l0, l3, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 2 <= length_10^0 /\ 1 <= a_16^0 /\ undef27 = undef29 /\ undef80 = undef94, {head_12^0 -> undef27, i_11^0 -> 1, rest remain the same}>
30.55/30.64	* Postcondition  : a_140^0 + length_10^0 <= 1 + i_11^0
30.55/30.64	
30.55/30.64	LOG: CALL solveLinear
30.55/30.64	
30.55/30.64	LOG: RETURN solveLinear - Elapsed time: 0.001184s
30.55/30.64	> Postcondition is not implied!
30.55/30.64	
30.55/30.64	LOG: RETURN check - Elapsed time: 0.001319s
30.55/30.64	Solving with 2 template(s).
30.55/30.64	
30.55/30.64	LOG: CALL solveNonLinearGetFirstSolution
30.55/30.64	
30.55/30.64	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.570760s
30.55/30.64	Time used: 1.57021
30.55/30.64	Improving Solution with cost 51 ...
30.55/30.64	
30.55/30.64	LOG: CALL solveNonLinearGetNextSolution
30.55/30.64	
30.55/30.64	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000650s
30.55/30.64	Time used: 1.00045
30.55/30.64	
30.55/30.64	LOG: SAT solveNonLinear - Elapsed time: 2.571411s
30.55/30.64	Cost: 51; Total time: 2.57067
30.55/30.64	Failed at location 3: a_140^0 + length_10^0 <= 1 + i_11^0
30.55/30.64	Before Improving: 
30.55/30.64	Quasi-invariant at l3: a_140^0 + length_10^0 <= 1 + i_11^0
30.55/30.64	Quasi-invariant at l3: 1 + i_11^0 <= length_10^0
30.55/30.64	Optimizing invariants...
30.55/30.64	
30.55/30.64	LOG: CALL solveLinear
30.55/30.64	
30.55/30.64	LOG: RETURN solveLinear - Elapsed time: 0.007940s
30.55/30.64	Remaining time after improvement: 0.997611
30.55/30.64	Some transition disabled by a set of quasi-invariant(s):
30.55/30.64	Quasi-invariant at l3: a_140^0 + length_10^0 <= 1 + i_11^0
30.55/30.64	Quasi-invariant at l3: 1 + i_11^0 <= length_10^0
30.55/30.64	
30.55/30.64	LOG: NEXT CALL check - disable
30.55/30.64	
30.55/30.64	LOG: CALL check - Post:a_140^0 + length_10^0 <= 1 + i_11^0 - Process 8
30.55/30.64	* Exit transition: <l0, l3, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 2 <= length_10^0 /\ 1 <= a_16^0 /\ undef27 = undef29 /\ undef80 = undef94, {head_12^0 -> undef27, i_11^0 -> 1, rest remain the same}>
30.55/30.64	* Postcondition  : a_140^0 + length_10^0 <= 1 + i_11^0
30.55/30.64	
30.55/30.64	LOG: CALL solveLinear
30.55/30.64	
30.55/30.64	LOG: RETURN solveLinear - Elapsed time: 0.001276s
30.55/30.64	> Postcondition is not implied!
30.55/30.64	
30.55/30.64	LOG: RETURN check - Elapsed time: 0.001413s
30.55/30.64	Solving with 3 template(s).
30.55/30.64	
30.55/30.64	LOG: CALL solveNonLinearGetFirstSolution
30.55/30.64	
30.55/30.64	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.000276s
30.55/30.64	Time used: 1.00009
30.55/30.64	
30.55/30.64	LOG: Postcondition is not implied - no solution
30.55/30.64	> Postcondition is not implied!
30.55/30.64	
30.55/30.64	LOG: RETURN check - Elapsed time: 4.635821s
30.55/30.64	INVARIANTS: 
30.55/30.64	8: 
30.55/30.64	Quasi-INVARIANTS to narrow Graph: 
30.55/30.64	8: 1 + a_140^0 <= 0 , 
30.55/30.64	Narrowing transition: 
30.55/30.64	<l8, l8, 0 <= a_140^0 /\ 1 + x_18^0 <= 0, {x_18^0 -> undef217, rest remain the same}>
30.55/30.64	
30.55/30.64	LOG: Narrow transition size 1
30.55/30.64	Narrowing transition: 
30.55/30.64	<l8, l8, 0 <= a_140^0 /\ 1 <= x_18^0, {x_18^0 -> undef217, rest remain the same}>
30.55/30.64	
30.55/30.64	LOG: Narrow transition size 1
30.55/30.64	invGraph after Narrowing: 
30.55/30.64	Transitions:
30.55/30.64	<l8, l8, 0 <= a_140^0 /\ 1 + x_18^0 <= 0, {x_18^0 -> undef217, rest remain the same}>
30.55/30.64	<l8, l8, 0 <= a_140^0 /\ 1 <= x_18^0, {x_18^0 -> undef217, rest remain the same}>
30.55/30.64	Variables:
30.55/30.64	a_140^0, x_18^0
30.55/30.64	Checking conditional termination of SCC {l8}...
30.55/30.64	
30.55/30.64	LOG: CALL solveLinear
30.55/30.64	
30.55/30.64	LOG: RETURN solveLinear - Elapsed time: 0.001058s
30.55/30.64	
30.55/30.64	LOG: CALL solveLinear
30.55/30.64	
30.55/30.64	LOG: RETURN solveLinear - Elapsed time: 0.003810s
30.55/30.64	Trying to remove transition: <l8, l8, 0 <= a_140^0 /\ 1 <= x_18^0, {x_18^0 -> undef217, rest remain the same}>
30.55/30.64	Solving with 1 template(s).
30.55/30.64	
30.55/30.64	LOG: CALL solveNonLinearGetFirstSolution
30.55/30.64	
30.55/30.64	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007290s
30.55/30.64	Time used: 0.007102
30.55/30.64	Trying to remove transition: <l8, l8, 0 <= a_140^0 /\ 1 + x_18^0 <= 0, {x_18^0 -> undef217, rest remain the same}>
30.55/30.64	Solving with 1 template(s).
30.55/30.64	
30.55/30.64	LOG: CALL solveNonLinearGetFirstSolution
30.55/30.64	
30.55/30.64	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007277s
30.55/30.64	Time used: 0.006695
30.55/30.64	Solving with 1 template(s).
30.55/30.64	
30.55/30.64	LOG: CALL solveNonLinearGetFirstSolution
30.55/30.64	
30.55/30.64	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.015412s
30.55/30.64	Time used: 0.014832
30.55/30.64	Solving with 2 template(s).
30.55/30.64	
30.55/30.64	LOG: CALL solveNonLinearGetFirstSolution
30.55/30.64	
30.55/30.64	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.059714s
30.55/30.64	Time used: 0.058545
30.55/30.64	Improving Solution with cost 4 ...
30.55/30.64	
30.55/30.64	LOG: CALL solveNonLinearGetNextSolution
30.55/30.64	
30.55/30.64	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.241209s
30.55/30.64	Time used: 0.241188
30.55/30.64	
30.55/30.64	LOG: SAT solveNonLinear - Elapsed time: 0.300924s
30.55/30.64	Cost: 4; Total time: 0.299733
30.55/30.64	Failed at location 8: 0 <= x_18^0
30.55/30.64	Failed at location 8: 0 <= x_18^0
30.55/30.64	Failed at location 8: x_18^0 <= 0
30.55/30.64	Failed at location 8: x_18^0 <= 0
30.55/30.64	Before Improving: 
30.55/30.64	Quasi-invariant at l8: 0 <= x_18^0
30.55/30.64	Quasi-invariant at l8: x_18^0 <= 0
30.55/30.64	Optimizing invariants...
30.55/30.64	
30.55/30.64	LOG: CALL solveLinear
30.55/30.64	
30.55/30.64	LOG: RETURN solveLinear - Elapsed time: 0.014721s
30.55/30.64	Remaining time after improvement: 0.997929
30.55/30.64	Termination implied by a set of quasi-invariant(s):
30.55/30.64	Quasi-invariant at l8: 0 <= x_18^0
30.55/30.64	Quasi-invariant at l8: x_18^0 <= 0
30.55/30.64	[ Invariant Graph ]
30.55/30.64	Strengthening and disabling transitions...
30.55/30.64	
30.55/30.64	LOG: CALL solverLinear in Graph for feasibility
30.55/30.64	
30.55/30.64	LOG: RETURN solveLinear in Graph for feasibility
30.55/30.64	It's unfeasible. Removing transition: 
30.55/30.64	<l8, l8, 0 <= a_140^0 /\ 1 + x_18^0 <= 0, {x_18^0 -> undef217, rest remain the same}>
30.55/30.64	
30.55/30.64	LOG: CALL solverLinear in Graph for feasibility
30.55/30.64	
30.55/30.64	LOG: RETURN solveLinear in Graph for feasibility
30.55/30.64	It's unfeasible. Removing transition: 
30.55/30.64	<l8, l8, 0 <= a_140^0 /\ 1 <= x_18^0, {x_18^0 -> undef217, rest remain the same}>
30.55/30.64	[ Termination Graph ]
30.55/30.64	Strengthening and disabling transitions...
30.55/30.64	
30.55/30.64	LOG: CALL solverLinear in Graph for feasibility
30.55/30.64	
30.55/30.64	LOG: RETURN solveLinear in Graph for feasibility
30.55/30.64	It's unfeasible. Removing transition: 
30.55/30.64	<l8, l8, 0 <= a_140^0 /\ 1 + x_18^0 <= 0, {x_18^0 -> undef217, rest remain the same}>
30.55/30.64	
30.55/30.64	LOG: CALL solverLinear in Graph for feasibility
30.55/30.64	
30.55/30.64	LOG: RETURN solveLinear in Graph for feasibility
30.55/30.64	It's unfeasible. Removing transition: 
30.55/30.64	<l8, l8, 0 <= a_140^0 /\ 1 <= x_18^0, {x_18^0 -> undef217, rest remain the same}>
30.55/30.64	New Graphs: 
30.55/30.64	Calling Safety with literal 0 <= x_18^0 and entry <l3, l8, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 1 + a_16^0 <= 0 /\ length_10^0 <= 1 + i_11^0 /\ head_12^0 = undef80 /\ undef80 = undef94, {x_18^0 -> undef140, rest remain the same}>
30.55/30.64	
30.55/30.64	LOG: CALL check - Post:0 <= x_18^0 - Process 9
30.55/30.64	* Exit transition: <l3, l8, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 1 + a_16^0 <= 0 /\ length_10^0 <= 1 + i_11^0 /\ head_12^0 = undef80 /\ undef80 = undef94, {x_18^0 -> undef140, rest remain the same}>
30.55/30.64	* Postcondition  : 0 <= x_18^0
30.55/30.64	Postcodition moved up: 0 <= undef140
30.55/30.64	
30.55/30.64	LOG: Try proving POST
30.55/30.64	Postcondition: 0 <= undef140
30.55/30.64	
30.55/30.64	LOG: CALL check - Post:0 <= undef140 - Process 10
30.55/30.64	* Exit transition: <l0, l3, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 2 <= length_10^0 /\ 1 + a_16^0 <= 0 /\ undef27 = undef29 /\ undef80 = undef94, {head_12^0 -> undef27, i_11^0 -> 1, rest remain the same}>
30.55/30.64	* Postcondition  : 0 <= undef140
30.55/30.64	
30.55/30.64	LOG: CALL solveLinear
30.55/30.64	
30.55/30.64	LOG: RETURN solveLinear - Elapsed time: 0.000940s
30.55/30.64	> Postcondition is not implied!
30.55/30.64	
30.55/30.64	LOG: RETURN check - Elapsed time: 0.001064s
30.55/30.64	
30.55/30.64	LOG: NarrowEntry size 1
30.55/30.64	Narrowing transition: 
30.55/30.64	<l3, l3, 0 <= len_47^0 /\ 2 + i_11^0 <= length_10^0 /\ undef60 = undef62, {head_12^0 -> undef60, i_11^0 -> 1 + i_11^0, rest remain the same}>
30.55/30.64	
30.55/30.64	LOG: Narrow transition size 1
30.55/30.64	ENTRIES:
30.55/30.64	<l0, l3, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 2 <= length_10^0 /\ 1 + a_16^0 <= 0 /\ 1 + undef140 <= 0 /\ undef27 = undef29 /\ undef80 = undef94, {head_12^0 -> undef27, i_11^0 -> 1, rest remain the same}>
30.55/30.64	END ENTRIES:
30.55/30.64	GRAPH:
30.55/30.64	<l3, l3, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 2 + i_11^0 <= length_10^0 /\ 1 + a_16^0 <= 0 /\ 1 + undef140 <= 0 /\ undef60 = undef62 /\ undef80 = undef94, {head_12^0 -> undef60, i_11^0 -> 1 + i_11^0, rest remain the same}>
30.55/30.64	END GRAPH:
30.55/30.64	EXIT: <l3, l8, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 1 + a_16^0 <= 0 /\ length_10^0 <= 1 + i_11^0 /\ head_12^0 = undef80 /\ undef80 = undef94, {x_18^0 -> undef140, rest remain the same}>
30.55/30.64	POST: 0 <= x_18^0
30.55/30.64	
30.55/30.64	
30.55/30.64	LOG: Try proving POST
30.55/30.64	Solving with 1 template(s).
30.55/30.64	
30.55/30.64	LOG: CALL solveNonLinearGetFirstSolution
30.55/30.64	
30.55/30.64	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.019719s
30.55/30.64	Time used: 0.019518
30.55/30.64	Improving Solution with cost 51 ...
30.55/30.64	
30.55/30.64	LOG: CALL solveNonLinearGetNextSolution
30.55/30.64	
30.55/30.64	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000749s
30.55/30.64	Time used: 1.00054
30.55/30.64	
30.55/30.64	LOG: SAT solveNonLinear - Elapsed time: 1.020468s
30.55/30.64	Cost: 51; Total time: 1.02006
30.55/30.64	Failed at location 3: length_10^0 <= 1 + i_11^0
30.55/30.64	Before Improving: 
30.55/30.64	Quasi-invariant at l3: length_10^0 <= 1 + i_11^0
30.55/30.64	Optimizing invariants...
30.55/30.64	
30.55/30.64	LOG: CALL solveLinear
30.55/30.64	
30.55/30.64	LOG: RETURN solveLinear - Elapsed time: 0.004264s
30.55/30.64	Remaining time after improvement: 0.998194
30.55/30.64	Some transition disabled by a set of quasi-invariant(s):
30.55/30.64	Quasi-invariant at l3: length_10^0 <= 1 + i_11^0
30.55/30.64	
30.55/30.64	LOG: NEXT CALL check - disable
30.55/30.64	
30.55/30.64	LOG: CALL check - Post:length_10^0 <= 1 + i_11^0 - Process 11
30.55/30.64	* Exit transition: <l0, l3, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 2 <= length_10^0 /\ 1 + a_16^0 <= 0 /\ 1 + undef140 <= 0 /\ undef27 = undef29 /\ undef80 = undef94, {head_12^0 -> undef27, i_11^0 -> 1, rest remain the same}>
30.55/30.64	* Postcondition  : length_10^0 <= 1 + i_11^0
30.55/30.64	
30.55/30.64	LOG: CALL solveLinear
30.55/30.64	
30.55/30.64	LOG: RETURN solveLinear - Elapsed time: 0.001381s
30.55/30.64	> Postcondition is not implied!
30.55/30.64	
30.55/30.64	LOG: RETURN check - Elapsed time: 0.001516s
30.55/30.64	Solving with 2 template(s).
30.55/30.64	
30.55/30.64	LOG: CALL solveNonLinearGetFirstSolution
30.55/30.64	
30.55/30.64	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.689357s
30.55/30.64	Time used: 0.68902
30.55/30.64	Improving Solution with cost 51 ...
30.55/30.64	
30.55/30.64	LOG: CALL solveNonLinearGetNextSolution
30.55/30.64	
30.55/30.64	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000969s
30.55/30.64	Time used: 1.00077
30.55/30.64	
30.55/30.64	LOG: SAT solveNonLinear - Elapsed time: 1.690326s
30.55/30.64	Cost: 51; Total time: 1.68979
30.55/30.64	Failed at location 3: length_10^0 <= 1 + i_11^0
30.55/30.64	Before Improving: 
30.55/30.64	Quasi-invariant at l3: 0 <= 1 + a_140^0 + i_11^0 + len_47^0
30.55/30.64	Quasi-invariant at l3: length_10^0 <= 1 + i_11^0
30.55/30.64	Optimizing invariants...
30.55/30.64	
30.55/30.64	LOG: CALL solveLinear
30.55/30.64	
30.55/30.64	LOG: RETURN solveLinear - Elapsed time: 0.008235s
30.55/30.64	Remaining time after improvement: 0.997585
30.55/30.64	Some transition disabled by a set of quasi-invariant(s):
30.55/30.64	Quasi-invariant at l3: 0 <= 1 + a_140^0 + i_11^0 + len_47^0
30.55/30.64	Quasi-invariant at l3: length_10^0 <= 1 + i_11^0
30.55/30.64	
30.55/30.64	LOG: NEXT CALL check - disable
30.55/30.64	
30.55/30.64	LOG: CALL check - Post:length_10^0 <= 1 + i_11^0 - Process 12
30.55/30.64	* Exit transition: <l0, l3, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 2 <= length_10^0 /\ 1 + a_16^0 <= 0 /\ 1 + undef140 <= 0 /\ undef27 = undef29 /\ undef80 = undef94, {head_12^0 -> undef27, i_11^0 -> 1, rest remain the same}>
30.55/30.64	* Postcondition  : length_10^0 <= 1 + i_11^0
30.55/30.64	
30.55/30.64	LOG: CALL solveLinear
30.55/30.64	
30.55/30.64	LOG: RETURN solveLinear - Elapsed time: 0.001545s
30.55/30.64	> Postcondition is not implied!
30.55/30.64	
30.55/30.64	LOG: RETURN check - Elapsed time: 0.001680s
30.55/30.64	Solving with 3 template(s).
30.55/30.64	
30.55/30.64	LOG: CALL solveNonLinearGetFirstSolution
30.55/30.64	
30.55/30.64	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.002511s
30.55/30.64	Time used: 1.00208
30.55/30.64	Improving Solution with cost 51 ...
30.55/30.64	
30.55/30.64	LOG: CALL solveNonLinearGetNextSolution
30.55/30.64	
30.55/30.64	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.043191s
30.55/30.64	Time used: 0.04318
30.55/30.64	
30.55/30.64	LOG: SAT solveNonLinear - Elapsed time: 1.045702s
30.55/30.64	Cost: 51; Total time: 1.04526
30.55/30.64	Failed at location 3: length_10^0 <= 1 + i_11^0
30.55/30.64	Before Improving: 
30.55/30.64	Quasi-invariant at l3: 1 + a_16^0 + i_11^0 <= a_140^0 + len_47^0 + length_10^0
30.55/30.64	Quasi-invariant at l3: 1 + i_11^0 <= len_47^0 + length_10^0
30.55/30.64	Quasi-invariant at l3: length_10^0 <= 1 + i_11^0
30.55/30.64	Optimizing invariants...
30.55/30.64	
30.55/30.64	LOG: CALL solveLinear
30.55/30.64	
30.55/30.64	LOG: RETURN solveLinear - Elapsed time: 0.015470s
30.55/30.64	Remaining time after improvement: 0.996798
30.55/30.64	Some transition disabled by a set of quasi-invariant(s):
30.55/30.64	Quasi-invariant at l3: 1 + a_16^0 + i_11^0 <= a_140^0 + len_47^0 + length_10^0
30.55/30.64	Quasi-invariant at l3: 1 + i_11^0 <= len_47^0 + length_10^0
30.55/30.64	Quasi-invariant at l3: length_10^0 <= 1 + i_11^0
30.55/30.64	
30.55/30.64	LOG: NEXT CALL check - disable
30.55/30.64	
30.55/30.64	LOG: CALL check - Post:length_10^0 <= 1 + i_11^0 - Process 13
30.55/30.64	* Exit transition: <l0, l3, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 2 <= length_10^0 /\ 1 + a_16^0 <= 0 /\ 1 + undef140 <= 0 /\ undef27 = undef29 /\ undef80 = undef94, {head_12^0 -> undef27, i_11^0 -> 1, rest remain the same}>
30.55/30.64	* Postcondition  : length_10^0 <= 1 + i_11^0
30.55/30.64	
30.55/30.64	LOG: CALL solveLinear
30.55/30.64	
30.55/30.64	LOG: RETURN solveLinear - Elapsed time: 0.001556s
30.55/30.64	> Postcondition is not implied!
30.55/30.64	
30.55/30.64	LOG: RETURN check - Elapsed time: 0.001692s
30.55/30.64	
30.55/30.64	LOG: Postcondition is not implied - no solution
30.55/30.64	> Postcondition is not implied!
30.55/30.64	
30.55/30.64	LOG: RETURN check - Elapsed time: 3.807110s
30.55/30.64	Calling Safety with literal x_18^0 <= 0 and entry <l3, l8, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 1 + a_16^0 <= 0 /\ length_10^0 <= 1 + i_11^0 /\ head_12^0 = undef80 /\ undef80 = undef94, {x_18^0 -> undef140, rest remain the same}>
30.55/30.64	
30.55/30.64	LOG: CALL check - Post:x_18^0 <= 0 - Process 14
30.55/30.64	* Exit transition: <l3, l8, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 1 + a_16^0 <= 0 /\ length_10^0 <= 1 + i_11^0 /\ head_12^0 = undef80 /\ undef80 = undef94, {x_18^0 -> undef140, rest remain the same}>
30.55/30.64	* Postcondition  : x_18^0 <= 0
30.55/30.64	Postcodition moved up: undef140 <= 0
30.55/30.64	
30.55/30.64	LOG: Try proving POST
30.55/30.64	Postcondition: undef140 <= 0
30.55/30.64	
30.55/30.64	LOG: CALL check - Post:undef140 <= 0 - Process 15
30.55/30.64	* Exit transition: <l0, l3, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 2 <= length_10^0 /\ 1 + a_16^0 <= 0 /\ undef27 = undef29 /\ undef80 = undef94, {head_12^0 -> undef27, i_11^0 -> 1, rest remain the same}>
30.55/30.64	* Postcondition  : undef140 <= 0
30.55/30.64	
30.55/30.64	LOG: CALL solveLinear
30.55/30.64	
30.55/30.64	LOG: RETURN solveLinear - Elapsed time: 0.001015s
30.55/30.64	> Postcondition is not implied!
30.55/30.64	
30.55/30.64	LOG: RETURN check - Elapsed time: 0.001139s
30.55/30.64	
30.55/30.64	LOG: NarrowEntry size 1
30.55/30.64	Narrowing transition: 
30.55/30.64	<l3, l3, 0 <= len_47^0 /\ 2 + i_11^0 <= length_10^0 /\ undef60 = undef62, {head_12^0 -> undef60, i_11^0 -> 1 + i_11^0, rest remain the same}>
30.55/30.64	
30.55/30.64	LOG: Narrow transition size 1
30.55/30.64	ENTRIES:
30.55/30.64	<l0, l3, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 2 <= length_10^0 /\ 1 + a_16^0 <= 0 /\ 1 <= undef140 /\ undef27 = undef29 /\ undef80 = undef94, {head_12^0 -> undef27, i_11^0 -> 1, rest remain the same}>
30.55/30.64	END ENTRIES:
30.55/30.64	GRAPH:
30.55/30.64	<l3, l3, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 2 + i_11^0 <= length_10^0 /\ 1 + a_16^0 <= 0 /\ 1 <= undef140 /\ undef60 = undef62 /\ undef80 = undef94, {head_12^0 -> undef60, i_11^0 -> 1 + i_11^0, rest remain the same}>
30.55/30.64	END GRAPH:
30.55/30.64	EXIT: <l3, l8, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 1 + a_16^0 <= 0 /\ length_10^0 <= 1 + i_11^0 /\ head_12^0 = undef80 /\ undef80 = undef94, {x_18^0 -> undef140, rest remain the same}>
30.55/30.64	POST: x_18^0 <= 0
30.55/30.64	
30.55/30.64	
30.55/30.64	LOG: Try proving POST
30.55/30.64	Solving with 1 template(s).
30.55/30.64	
30.55/30.64	LOG: CALL solveNonLinearGetFirstSolution
30.55/30.64	
30.55/30.64	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.020226s
30.55/30.64	Time used: 0.020024
30.55/30.64	Improving Solution with cost 51 ...
30.55/30.64	
30.55/30.64	LOG: CALL solveNonLinearGetNextSolution
30.55/30.64	
30.55/30.64	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.005841s
30.55/30.64	Time used: 1.00558
30.55/30.64	
30.55/30.64	LOG: SAT solveNonLinear - Elapsed time: 1.026067s
30.55/30.64	Cost: 51; Total time: 1.02561
30.55/30.64	Failed at location 3: length_10^0 <= 1 + i_11^0
30.55/30.64	Before Improving: 
30.55/30.64	Quasi-invariant at l3: length_10^0 <= 1 + i_11^0
30.55/30.64	Optimizing invariants...
30.55/30.64	
30.55/30.64	LOG: CALL solveLinear
30.55/30.64	
30.55/30.64	LOG: RETURN solveLinear - Elapsed time: 0.004309s
30.55/30.64	Remaining time after improvement: 0.998151
30.55/30.64	Some transition disabled by a set of quasi-invariant(s):
30.55/30.64	Quasi-invariant at l3: length_10^0 <= 1 + i_11^0
30.55/30.64	
30.55/30.64	LOG: NEXT CALL check - disable
30.55/30.64	
30.55/30.64	LOG: CALL check - Post:length_10^0 <= 1 + i_11^0 - Process 16
30.55/30.64	* Exit transition: <l0, l3, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 2 <= length_10^0 /\ 1 + a_16^0 <= 0 /\ 1 <= undef140 /\ undef27 = undef29 /\ undef80 = undef94, {head_12^0 -> undef27, i_11^0 -> 1, rest remain the same}>
30.55/30.64	* Postcondition  : length_10^0 <= 1 + i_11^0
30.55/30.64	
30.55/30.64	LOG: CALL solveLinear
30.55/30.64	
30.55/30.64	LOG: RETURN solveLinear - Elapsed time: 0.001622s
30.55/30.64	> Postcondition is not implied!
30.55/30.64	
30.55/30.64	LOG: RETURN check - Elapsed time: 0.001779s
30.55/30.64	Solving with 2 template(s).
30.55/30.64	
30.55/30.64	LOG: CALL solveNonLinearGetFirstSolution
30.55/30.64	
30.55/30.64	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.691459s
30.55/30.64	Time used: 0.691116
30.55/30.64	Improving Solution with cost 51 ...
30.55/30.64	
30.55/30.64	LOG: CALL solveNonLinearGetNextSolution
30.55/30.64	
30.55/30.64	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001133s
30.55/30.64	Time used: 1.00093
30.55/30.64	
30.55/30.64	LOG: SAT solveNonLinear - Elapsed time: 1.692591s
30.55/30.64	Cost: 51; Total time: 1.69204
30.55/30.64	Failed at location 3: length_10^0 <= 1 + i_11^0
30.55/30.64	Before Improving: 
30.55/30.64	Quasi-invariant at l3: 0 <= 1 + a_140^0 + i_11^0 + len_47^0
30.55/30.64	Quasi-invariant at l3: length_10^0 <= 1 + i_11^0
30.55/30.64	Optimizing invariants...
30.55/30.64	
30.55/30.64	LOG: CALL solveLinear
30.55/30.64	
30.55/30.64	LOG: RETURN solveLinear - Elapsed time: 0.008391s
30.55/30.64	Remaining time after improvement: 0.997424
30.55/30.64	Some transition disabled by a set of quasi-invariant(s):
30.55/30.64	Quasi-invariant at l3: 0 <= 1 + a_140^0 + i_11^0 + len_47^0
30.55/30.64	Quasi-invariant at l3: length_10^0 <= 1 + i_11^0
30.55/30.64	
30.55/30.64	LOG: NEXT CALL check - disable
30.55/30.64	
30.55/30.64	LOG: CALL check - Post:length_10^0 <= 1 + i_11^0 - Process 17
30.55/30.64	* Exit transition: <l0, l3, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 2 <= length_10^0 /\ 1 + a_16^0 <= 0 /\ 1 <= undef140 /\ undef27 = undef29 /\ undef80 = undef94, {head_12^0 -> undef27, i_11^0 -> 1, rest remain the same}>
30.55/30.64	* Postcondition  : length_10^0 <= 1 + i_11^0
30.55/30.64	
30.55/30.64	LOG: CALL solveLinear
30.55/30.64	
30.55/30.64	LOG: RETURN solveLinear - Elapsed time: 0.001748s
30.55/30.64	> Postcondition is not implied!
30.55/30.64	
30.55/30.64	LOG: RETURN check - Elapsed time: 0.001885s
30.55/30.64	Solving with 3 template(s).
30.55/30.64	
30.55/30.64	LOG: CALL solveNonLinearGetFirstSolution
30.55/30.64	
30.55/30.64	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.004386s
30.55/30.64	Time used: 1.00385
30.55/30.64	Improving Solution with cost 51 ...
30.55/30.64	
30.55/30.64	LOG: CALL solveNonLinearGetNextSolution
30.55/30.64	
30.55/30.64	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.061481s
30.55/30.64	Time used: 0.061468
30.55/30.64	
30.55/30.64	LOG: SAT solveNonLinear - Elapsed time: 1.065867s
30.55/30.64	Cost: 51; Total time: 1.06532
30.55/30.64	Failed at location 3: length_10^0 <= 1 + i_11^0
30.55/30.64	Before Improving: 
30.55/30.64	Quasi-invariant at l3: 1 + a_16^0 + i_11^0 <= a_140^0 + len_47^0 + length_10^0
30.55/30.64	Quasi-invariant at l3: 1 + i_11^0 <= len_47^0 + length_10^0
30.55/30.64	Quasi-invariant at l3: length_10^0 <= 1 + i_11^0
30.55/30.64	Optimizing invariants...
30.55/30.64	
30.55/30.64	LOG: CALL solveLinear
30.55/30.64	
30.55/30.64	LOG: RETURN solveLinear - Elapsed time: 0.015822s
30.55/30.64	Remaining time after improvement: 0.996777
30.55/30.64	Some transition disabled by a set of quasi-invariant(s):
30.55/30.64	Quasi-invariant at l3: 1 + a_16^0 + i_11^0 <= a_140^0 + len_47^0 + length_10^0
30.55/30.64	Quasi-invariant at l3: 1 + i_11^0 <= len_47^0 + length_10^0
30.55/30.64	Quasi-invariant at l3: length_10^0 <= 1 + i_11^0
30.55/30.64	
30.55/30.64	LOG: NEXT CALL check - disable
30.55/30.64	
30.55/30.64	LOG: CALL check - Post:length_10^0 <= 1 + i_11^0 - Process 18
30.55/30.64	* Exit transition: <l0, l3, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 2 <= length_10^0 /\ 1 + a_16^0 <= 0 /\ 1 <= undef140 /\ undef27 = undef29 /\ undef80 = undef94, {head_12^0 -> undef27, i_11^0 -> 1, rest remain the same}>
30.55/30.64	* Postcondition  : length_10^0 <= 1 + i_11^0
30.55/30.64	
30.55/30.64	LOG: CALL solveLinear
30.55/30.64	
30.55/30.64	LOG: RETURN solveLinear - Elapsed time: 0.001707s
30.55/30.64	> Postcondition is not implied!
30.55/30.64	
30.55/30.64	LOG: RETURN check - Elapsed time: 0.001846s
30.55/30.64	
30.55/30.64	LOG: Postcondition is not implied - no solution
30.55/30.64	> Postcondition is not implied!
30.55/30.64	
30.55/30.64	LOG: RETURN check - Elapsed time: 3.847325s
30.55/30.64	Calling Safety with literal 0 <= x_18^0 and entry <l3, l8, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 1 <= a_16^0 /\ length_10^0 <= 1 + i_11^0 /\ head_12^0 = undef80 /\ undef80 = undef94, {x_18^0 -> undef140, rest remain the same}>
30.55/30.64	
30.55/30.64	LOG: CALL check - Post:0 <= x_18^0 - Process 19
30.55/30.64	* Exit transition: <l3, l8, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 1 <= a_16^0 /\ length_10^0 <= 1 + i_11^0 /\ head_12^0 = undef80 /\ undef80 = undef94, {x_18^0 -> undef140, rest remain the same}>
30.55/30.64	* Postcondition  : 0 <= x_18^0
30.55/30.64	Postcodition moved up: 0 <= undef140
30.55/30.64	
30.55/30.64	LOG: Try proving POST
30.55/30.64	Postcondition: 0 <= undef140
30.55/30.64	
30.55/30.64	LOG: CALL check - Post:0 <= undef140 - Process 20
30.55/30.64	* Exit transition: <l0, l3, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 2 <= length_10^0 /\ 1 <= a_16^0 /\ undef27 = undef29 /\ undef80 = undef94, {head_12^0 -> undef27, i_11^0 -> 1, rest remain the same}>
30.55/30.64	* Postcondition  : 0 <= undef140
30.55/30.64	
30.55/30.64	LOG: CALL solveLinear
30.55/30.64	
30.55/30.64	LOG: RETURN solveLinear - Elapsed time: 0.001045s
30.55/30.64	> Postcondition is not implied!
30.55/30.64	
30.55/30.64	LOG: RETURN check - Elapsed time: 0.001185s
30.55/30.64	
30.55/30.64	LOG: NarrowEntry size 1
30.55/30.64	Narrowing transition: 
30.55/30.64	<l3, l3, 0 <= len_47^0 /\ 2 + i_11^0 <= length_10^0 /\ undef60 = undef62, {head_12^0 -> undef60, i_11^0 -> 1 + i_11^0, rest remain the same}>
30.55/30.64	
30.55/30.64	LOG: Narrow transition size 1
30.55/30.64	ENTRIES:
30.55/30.64	<l0, l3, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 2 <= length_10^0 /\ 1 <= a_16^0 /\ 1 + undef140 <= 0 /\ undef27 = undef29 /\ undef80 = undef94, {head_12^0 -> undef27, i_11^0 -> 1, rest remain the same}>
30.55/30.64	END ENTRIES:
30.55/30.64	GRAPH:
30.55/30.64	<l3, l3, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 2 + i_11^0 <= length_10^0 /\ 1 <= a_16^0 /\ 1 + undef140 <= 0 /\ undef60 = undef62 /\ undef80 = undef94, {head_12^0 -> undef60, i_11^0 -> 1 + i_11^0, rest remain the same}>
30.55/30.64	END GRAPH:
30.55/30.64	EXIT: <l3, l8, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 1 <= a_16^0 /\ length_10^0 <= 1 + i_11^0 /\ head_12^0 = undef80 /\ undef80 = undef94, {x_18^0 -> undef140, rest remain the same}>
30.55/30.64	POST: 0 <= x_18^0
30.55/30.64	
30.55/30.64	
30.55/30.64	LOG: Try proving POST
30.55/30.64	Solving with 1 template(s).
30.55/30.64	
30.55/30.64	LOG: CALL solveNonLinearGetFirstSolution
30.55/30.64	
30.55/30.64	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.019957s
30.55/30.64	Time used: 0.01975
30.55/30.64	Improving Solution with cost 51 ...
30.55/30.64	
30.55/30.64	LOG: CALL solveNonLinearGetNextSolution
30.55/30.64	
30.55/30.64	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001262s
30.55/30.64	Time used: 1.00105
30.55/30.64	
30.55/30.64	LOG: SAT solveNonLinear - Elapsed time: 1.021220s
30.55/30.64	Cost: 51; Total time: 1.0208
30.55/30.64	Failed at location 3: length_10^0 <= 1 + i_11^0
30.55/30.64	Before Improving: 
30.55/30.64	Quasi-invariant at l3: length_10^0 <= 1 + i_11^0
30.55/30.64	Optimizing invariants...
30.55/30.64	
30.55/30.64	LOG: CALL solveLinear
30.55/30.64	
30.55/30.64	LOG: RETURN solveLinear - Elapsed time: 0.004514s
30.55/30.64	Remaining time after improvement: 0.997665
30.55/30.64	Some transition disabled by a set of quasi-invariant(s):
30.55/30.64	Quasi-invariant at l3: length_10^0 <= 1 + i_11^0
30.55/30.64	
30.55/30.64	LOG: NEXT CALL check - disable
30.55/30.64	
30.55/30.64	LOG: CALL check - Post:length_10^0 <= 1 + i_11^0 - Process 21
30.55/30.64	* Exit transition: <l0, l3, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 2 <= length_10^0 /\ 1 <= a_16^0 /\ 1 + undef140 <= 0 /\ undef27 = undef29 /\ undef80 = undef94, {head_12^0 -> undef27, i_11^0 -> 1, rest remain the same}>
30.55/30.64	* Postcondition  : length_10^0 <= 1 + i_11^0
30.55/30.64	
30.55/30.64	LOG: CALL solveLinear
30.55/30.64	
30.55/30.64	LOG: RETURN solveLinear - Elapsed time: 0.001499s
30.55/30.64	> Postcondition is not implied!
30.55/30.64	
30.55/30.64	LOG: RETURN check - Elapsed time: 0.001635s
30.55/30.64	Solving with 2 template(s).
30.55/30.64	
30.55/30.64	LOG: CALL solveNonLinearGetFirstSolution
30.55/30.64	
30.55/30.64	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.807782s
30.55/30.64	Time used: 0.80743
30.55/30.64	Improving Solution with cost 51 ...
30.55/30.64	
30.55/30.64	LOG: CALL solveNonLinearGetNextSolution
30.55/30.64	
30.55/30.64	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000813s
30.55/30.64	Time used: 1.00073
30.55/30.64	
30.55/30.64	LOG: SAT solveNonLinear - Elapsed time: 1.808595s
30.55/30.64	Cost: 51; Total time: 1.80816
30.55/30.64	Failed at location 3: length_10^0 <= 1 + i_11^0
30.55/30.64	Before Improving: 
30.55/30.64	Quasi-invariant at l3: length_10^0 <= 1 + i_11^0
30.55/30.64	Quasi-invariant at l3: 1 <= length_10^0
30.55/30.64	Optimizing invariants...
30.55/30.64	
30.55/30.64	LOG: CALL solveLinear
30.55/30.64	
30.55/30.64	LOG: RETURN solveLinear - Elapsed time: 0.008586s
30.55/30.64	Remaining time after improvement: 0.997447
30.55/30.64	Some transition disabled by a set of quasi-invariant(s):
30.55/30.64	Quasi-invariant at l3: length_10^0 <= 1 + i_11^0
30.55/30.64	Quasi-invariant at l3: 1 <= length_10^0
30.55/30.64	
30.55/30.64	LOG: NEXT CALL check - disable
30.55/30.64	
30.55/30.64	LOG: CALL check - Post:length_10^0 <= 1 + i_11^0 - Process 22
30.55/30.64	* Exit transition: <l0, l3, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 2 <= length_10^0 /\ 1 <= a_16^0 /\ 1 + undef140 <= 0 /\ undef27 = undef29 /\ undef80 = undef94, {head_12^0 -> undef27, i_11^0 -> 1, rest remain the same}>
30.55/30.64	* Postcondition  : length_10^0 <= 1 + i_11^0
30.55/30.64	
30.55/30.64	LOG: CALL solveLinear
30.55/30.64	
30.55/30.64	LOG: RETURN solveLinear - Elapsed time: 0.001637s
30.55/30.64	> Postcondition is not implied!
30.55/30.64	
30.55/30.64	LOG: RETURN check - Elapsed time: 0.001774s
30.55/30.64	Solving with 3 template(s).
30.55/30.64	
30.55/30.64	LOG: CALL solveNonLinearGetFirstSolution
30.55/30.64	
30.55/30.64	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.002743s
30.55/30.64	Time used: 1.00214
30.55/30.64	Improving Solution with cost 51 ...
30.55/30.64	
30.55/30.64	LOG: CALL solveNonLinearGetNextSolution
30.55/30.64	
30.55/30.64	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.043457s
30.55/30.64	Time used: 0.043435
30.55/30.64	
30.55/30.64	LOG: SAT solveNonLinear - Elapsed time: 1.046200s
30.55/30.64	Cost: 51; Total time: 1.04558
30.55/30.64	Failed at location 3: length_10^0 <= 1 + i_11^0
30.55/30.64	Before Improving: 
30.55/30.64	Quasi-invariant at l3: length_10^0 <= 1 + i_11^0
30.55/30.64	Quasi-invariant at l3: 1 <= i_11^0
30.55/30.64	Quasi-invariant at l3: i_11^0 <= 1
30.55/30.64	Optimizing invariants...
30.55/30.64	
30.55/30.64	LOG: CALL solveLinear
30.55/30.64	
30.55/30.64	LOG: RETURN solveLinear - Elapsed time: 0.015884s
30.55/30.64	Remaining time after improvement: 0.99665
30.55/30.64	Some transition disabled by a set of quasi-invariant(s):
30.55/30.64	Quasi-invariant at l3: length_10^0 <= 1 + i_11^0
30.55/30.64	Quasi-invariant at l3: 1 <= i_11^0
30.55/30.64	Quasi-invariant at l3: i_11^0 <= 1
30.55/30.64	
30.55/30.64	LOG: NEXT CALL check - disable
30.55/30.64	
30.55/30.64	LOG: CALL check - Post:length_10^0 <= 1 + i_11^0 - Process 23
30.55/30.64	* Exit transition: <l0, l3, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 2 <= length_10^0 /\ 1 <= a_16^0 /\ 1 + undef140 <= 0 /\ undef27 = undef29 /\ undef80 = undef94, {head_12^0 -> undef27, i_11^0 -> 1, rest remain the same}>
30.55/30.64	* Postcondition  : length_10^0 <= 1 + i_11^0
30.55/30.64	
30.55/30.64	LOG: CALL solveLinear
30.55/30.64	
30.55/30.64	LOG: RETURN solveLinear - Elapsed time: 0.001735s
30.55/30.64	> Postcondition is not implied!
30.55/30.64	
30.55/30.64	LOG: RETURN check - Elapsed time: 0.001873s
30.55/30.64	
30.55/30.64	LOG: Postcondition is not implied - no solution
30.55/30.64	> Postcondition is not implied!
30.55/30.64	
30.55/30.64	LOG: RETURN check - Elapsed time: 3.929615s
30.55/30.64	Calling Safety with literal x_18^0 <= 0 and entry <l3, l8, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 1 <= a_16^0 /\ length_10^0 <= 1 + i_11^0 /\ head_12^0 = undef80 /\ undef80 = undef94, {x_18^0 -> undef140, rest remain the same}>
30.55/30.64	
30.55/30.64	LOG: CALL check - Post:x_18^0 <= 0 - Process 24
30.55/30.64	* Exit transition: <l3, l8, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 1 <= a_16^0 /\ length_10^0 <= 1 + i_11^0 /\ head_12^0 = undef80 /\ undef80 = undef94, {x_18^0 -> undef140, rest remain the same}>
30.55/30.64	* Postcondition  : x_18^0 <= 0
30.55/30.64	Postcodition moved up: undef140 <= 0
30.55/30.64	
30.55/30.64	LOG: Try proving POST
30.55/30.64	Postcondition: undef140 <= 0
30.55/30.64	
30.55/30.64	LOG: CALL check - Post:undef140 <= 0 - Process 25
30.55/30.64	* Exit transition: <l0, l3, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 2 <= length_10^0 /\ 1 <= a_16^0 /\ undef27 = undef29 /\ undef80 = undef94, {head_12^0 -> undef27, i_11^0 -> 1, rest remain the same}>
30.55/30.64	* Postcondition  : undef140 <= 0
30.55/30.64	
30.55/30.64	LOG: CALL solveLinear
30.55/30.64	
30.55/30.64	LOG: RETURN solveLinear - Elapsed time: 0.001068s
30.55/30.64	> Postcondition is not implied!
30.55/30.64	
30.55/30.64	LOG: RETURN check - Elapsed time: 0.001201s
30.55/30.64	
30.55/30.64	LOG: NarrowEntry size 1
30.55/30.64	Narrowing transition: 
30.55/30.64	<l3, l3, 0 <= len_47^0 /\ 2 + i_11^0 <= length_10^0 /\ undef60 = undef62, {head_12^0 -> undef60, i_11^0 -> 1 + i_11^0, rest remain the same}>
30.55/30.64	
30.55/30.64	LOG: Narrow transition size 1
30.55/30.64	ENTRIES:
30.55/30.64	<l0, l3, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 2 <= length_10^0 /\ 1 <= a_16^0 /\ 1 <= undef140 /\ undef27 = undef29 /\ undef80 = undef94, {head_12^0 -> undef27, i_11^0 -> 1, rest remain the same}>
30.55/30.64	END ENTRIES:
30.55/30.64	GRAPH:
30.55/30.64	<l3, l3, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 2 + i_11^0 <= length_10^0 /\ 1 <= a_16^0 /\ 1 <= undef140 /\ undef60 = undef62 /\ undef80 = undef94, {head_12^0 -> undef60, i_11^0 -> 1 + i_11^0, rest remain the same}>
30.55/30.65	END GRAPH:
30.55/30.65	EXIT: <l3, l8, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 1 <= a_16^0 /\ length_10^0 <= 1 + i_11^0 /\ head_12^0 = undef80 /\ undef80 = undef94, {x_18^0 -> undef140, rest remain the same}>
30.55/30.65	POST: x_18^0 <= 0
30.55/30.65	
30.55/30.65	
30.55/30.65	LOG: Try proving POST
30.55/30.65	Solving with 1 template(s).
30.55/30.65	
30.55/30.65	LOG: CALL solveNonLinearGetFirstSolution
30.55/30.65	
30.55/30.65	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.019928s
30.55/30.65	Time used: 0.01972
30.55/30.65	Improving Solution with cost 51 ...
30.55/30.65	
30.55/30.65	LOG: CALL solveNonLinearGetNextSolution
30.55/30.65	
30.55/30.65	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.004621s
30.55/30.65	Time used: 1.00441
30.55/30.65	
30.55/30.65	LOG: SAT solveNonLinear - Elapsed time: 1.024549s
30.55/30.65	Cost: 51; Total time: 1.02413
30.55/30.65	Failed at location 3: length_10^0 <= 1 + i_11^0
30.55/30.65	Before Improving: 
30.55/30.65	Quasi-invariant at l3: length_10^0 <= 1 + i_11^0
30.55/30.65	Optimizing invariants...
30.55/30.65	
30.55/30.65	LOG: CALL solveLinear
30.55/30.65	
30.55/30.65	LOG: RETURN solveLinear - Elapsed time: 0.004459s
30.55/30.65	Remaining time after improvement: 0.998078
30.55/30.65	Some transition disabled by a set of quasi-invariant(s):
30.55/30.65	Quasi-invariant at l3: length_10^0 <= 1 + i_11^0
30.55/30.65	
30.55/30.65	LOG: NEXT CALL check - disable
30.55/30.65	
30.55/30.65	LOG: CALL check - Post:length_10^0 <= 1 + i_11^0 - Process 26
30.55/30.65	* Exit transition: <l0, l3, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 2 <= length_10^0 /\ 1 <= a_16^0 /\ 1 <= undef140 /\ undef27 = undef29 /\ undef80 = undef94, {head_12^0 -> undef27, i_11^0 -> 1, rest remain the same}>
30.55/30.65	* Postcondition  : length_10^0 <= 1 + i_11^0
30.55/30.65	
30.55/30.65	LOG: CALL solveLinear
30.55/30.65	
30.55/30.65	LOG: RETURN solveLinear - Elapsed time: 0.001492s
30.55/30.65	> Postcondition is not implied!
30.55/30.65	
30.55/30.65	LOG: RETURN check - Elapsed time: 0.001630s
30.55/30.65	Solving with 2 template(s).
30.55/30.65	
30.55/30.65	LOG: CALL solveNonLinearGetFirstSolution
30.55/30.65	
30.55/30.65	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.807036s
30.55/30.65	Time used: 0.806685
30.55/30.65	Improving Solution with cost 51 ...
30.55/30.65	
30.55/30.65	LOG: CALL solveNonLinearGetNextSolution
30.55/30.65	
30.55/30.65	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000671s
30.55/30.65	Time used: 1.00058
30.55/30.65	
30.55/30.65	LOG: SAT solveNonLinear - Elapsed time: 1.807707s
30.55/30.65	Cost: 51; Total time: 1.80727
30.55/30.65	Failed at location 3: length_10^0 <= 1 + i_11^0
30.55/30.65	Before Improving: 
30.55/30.65	Quasi-invariant at l3: length_10^0 <= 1 + i_11^0
30.55/30.65	Quasi-invariant at l3: 1 <= length_10^0
30.55/30.65	Optimizing invariants...
30.55/30.65	
30.55/30.65	LOG: CALL solveLinear
30.55/30.65	
30.55/30.65	LOG: RETURN solveLinear - Elapsed time: 0.008582s
30.55/30.65	Remaining time after improvement: 0.997386
30.55/30.65	Some transition disabled by a set of quasi-invariant(s):
30.55/30.65	Quasi-invariant at l3: length_10^0 <= 1 + i_11^0
30.55/30.65	Quasi-invariant at l3: 1 <= length_10^0
30.55/30.65	
30.55/30.65	LOG: NEXT CALL check - disable
30.55/30.65	
30.55/30.65	LOG: CALL check - Post:length_10^0 <= 1 + i_11^0 - Process 27
30.55/30.65	* Exit transition: <l0, l3, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 2 <= length_10^0 /\ 1 <= a_16^0 /\ 1 <= undef140 /\ undef27 = undef29 /\ undef80 = undef94, {head_12^0 -> undef27, i_11^0 -> 1, rest remain the same}>
30.55/30.65	* Postcondition  : length_10^0 <= 1 + i_11^0
30.55/30.65	
30.55/30.65	LOG: CALL solveLinear
30.55/30.65	
30.55/30.65	LOG: RETURN solveLinear - Elapsed time: 0.001706s
30.55/30.65	> Postcondition is not implied!
30.55/30.65	
30.55/30.65	LOG: RETURN check - Elapsed time: 0.001844s
30.55/30.65	Solving with 3 template(s).
30.55/30.65	
30.55/30.65	LOG: CALL solveNonLinearGetFirstSolution
30.55/30.65	
30.55/30.65	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.002659s
30.55/30.65	Time used: 1.00198
30.55/30.65	Improving Solution with cost 51 ...
30.55/30.65	
30.55/30.65	LOG: CALL solveNonLinearGetNextSolution
30.55/30.65	
30.55/30.65	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.042366s
30.55/30.65	Time used: 0.042356
30.55/30.65	
30.55/30.65	LOG: SAT solveNonLinear - Elapsed time: 1.045024s
30.55/30.65	Cost: 51; Total time: 1.04434
30.55/30.65	Failed at location 3: length_10^0 <= 1 + i_11^0
30.55/30.65	Before Improving: 
30.55/30.65	Quasi-invariant at l3: length_10^0 <= 1 + i_11^0
30.55/30.65	Quasi-invariant at l3: 1 <= i_11^0
30.55/30.65	Quasi-invariant at l3: i_11^0 <= 1
30.55/30.65	Optimizing invariants...
30.55/30.65	
30.55/30.65	LOG: CALL solveLinear
30.55/30.65	
30.55/30.65	LOG: RETURN solveLinear - Elapsed time: 0.016125s
30.55/30.65	Remaining time after improvement: 0.996857
30.55/30.65	Some transition disabled by a set of quasi-invariant(s):
30.55/30.65	Quasi-invariant at l3: length_10^0 <= 1 + i_11^0
30.55/30.65	Quasi-invariant at l3: 1 <= i_11^0
30.55/30.65	Quasi-invariant at l3: i_11^0 <= 1
30.55/30.65	
30.55/30.65	LOG: NEXT CALL check - disable
30.55/30.65	
30.55/30.65	LOG: CALL check - Post:length_10^0 <= 1 + i_11^0 - Process 28
30.55/30.65	* Exit transition: <l0, l3, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 2 <= length_10^0 /\ 1 <= a_16^0 /\ 1 <= undef140 /\ undef27 = undef29 /\ undef80 = undef94, {head_12^0 -> undef27, i_11^0 -> 1, rest remain the same}>
30.55/30.65	* Postcondition  : length_10^0 <= 1 + i_11^0
30.55/30.65	
30.55/30.65	LOG: CALL solveLinear
30.55/30.65	
30.55/30.65	LOG: RETURN solveLinear - Elapsed time: 0.001743s
30.55/30.65	> Postcondition is not implied!
30.55/30.65	
30.55/30.65	LOG: RETURN check - Elapsed time: 0.001883s
30.55/30.65	
30.55/30.65	LOG: Postcondition is not implied - no solution
30.55/30.65	> Postcondition is not implied!
30.55/30.65	
30.55/30.65	LOG: RETURN check - Elapsed time: 3.931255s
30.55/30.65	INVARIANTS: 
30.55/30.65	8: 
30.55/30.65	Quasi-INVARIANTS to narrow Graph: 
30.55/30.65	8: x_18^0 <= 0 , 0 <= x_18^0 , 
30.55/30.65	Narrowing transition: 
30.55/30.65	<l8, l8, 0 <= a_140^0 /\ 1 + x_18^0 <= 0, {x_18^0 -> undef217, rest remain the same}>
30.55/30.65	
30.55/30.65	LOG: Narrow transition size 2
30.55/30.65	Narrowing transition: 
30.55/30.65	<l8, l8, 0 <= a_140^0 /\ 1 <= x_18^0, {x_18^0 -> undef217, rest remain the same}>
30.55/30.65	
30.55/30.65	LOG: Narrow transition size 2
30.55/30.65	invGraph after Narrowing: 
30.55/30.65	Transitions:
30.55/30.65	<l8, l8, 0 <= a_140^0 /\ 1 + x_18^0 <= 0, {x_18^0 -> undef217, rest remain the same}>
30.55/30.65	<l8, l8, 0 <= a_140^0 /\ 1 <= x_18^0, {x_18^0 -> undef217, rest remain the same}>
30.55/30.65	Variables:
30.55/30.65	a_140^0, x_18^0
30.55/30.65	Checking conditional termination of SCC {l8}...
30.55/30.65	
30.55/30.65	LOG: CALL solveLinear
30.55/30.65	
30.55/30.65	LOG: RETURN solveLinear - Elapsed time: 0.001101s
30.55/30.65	
30.55/30.65	LOG: CALL solveLinear
30.55/30.65	
30.55/30.65	LOG: RETURN solveLinear - Elapsed time: 0.003891s
30.55/30.65	Trying to remove transition: <l8, l8, 0 <= a_140^0 /\ 1 <= x_18^0, {x_18^0 -> undef217, rest remain the same}>
30.55/30.65	Solving with 1 template(s).
30.55/30.65	
30.55/30.65	LOG: CALL solveNonLinearGetFirstSolution
30.55/30.65	
30.55/30.65	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007981s
30.55/30.65	Time used: 0.007789
30.55/30.65	Trying to remove transition: <l8, l8, 0 <= a_140^0 /\ 1 + x_18^0 <= 0, {x_18^0 -> undef217, rest remain the same}>
30.55/30.65	Solving with 1 template(s).
30.55/30.65	
30.55/30.65	LOG: CALL solveNonLinearGetFirstSolution
30.55/30.65	
30.55/30.65	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007862s
30.55/30.65	Time used: 0.007179
30.55/30.65	Solving with 1 template(s).
30.55/30.65	
30.55/30.65	LOG: CALL solveNonLinearGetFirstSolution
30.55/30.65	
30.55/30.65	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.017794s
30.55/30.65	Time used: 0.017232
30.55/30.65	Solving with 2 template(s).
30.55/30.65	
30.55/30.65	LOG: CALL solveNonLinearGetFirstSolution
30.55/30.65	
30.55/30.65	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002829s
30.55/30.65	Time used: 4.00143
30.55/30.65	Solving with 3 template(s).
30.55/30.65	
30.55/30.65	LOG: CALL solveNonLinearGetFirstSolution
30.55/30.65	
30.55/30.65	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.011244s
30.55/30.65	Time used: 1.00084
30.55/30.65	Solving with 1 template(s).
30.55/30.65	
30.55/30.65	LOG: CALL solveNonLinearGetFirstSolution
30.55/30.65	
30.55/30.65	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.024064s
30.55/30.65	Time used: 0.015617
30.55/30.65	
30.55/30.65	Proving non-termination of subgraph 2
30.55/30.65	Transitions:
30.55/30.65	<l8, l8, 0 <= a_140^0 /\ 1 + x_18^0 <= 0, {x_18^0 -> undef217, rest remain the same}>
30.55/30.65	<l8, l8, 0 <= a_140^0 /\ 1 <= x_18^0, {x_18^0 -> undef217, rest remain the same}>
30.55/30.65	Variables:
30.55/30.65	a_140^0, x_18^0
30.55/30.65	
30.55/30.65	Checking conditional non-termination of SCC {l8}...
30.55/30.65	EXIT TRANSITIONS:
30.55/30.65	<l8, end, 0 <= a_140^0 /\ x_18^0 = 0, {all remain the same}>
30.55/30.65	<l8, end, 0 <= x_18^0 /\ 1 + a_140^0 <= 0, {all remain the same}>
30.55/30.65	<l8, end, 1 + a_140^0 <= 0 /\ 1 + x_18^0 <= 0, {all remain the same}>
30.55/30.65	
30.55/30.65	Solving with 1 template(s).
30.55/30.65	
30.55/30.65	LOG: CALL solveNonLinearGetFirstSolution
30.55/30.65	
30.55/30.65	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.021087s
30.55/30.65	Time used: 0.020822
30.55/30.65	Improving Solution with cost 3 ...
30.55/30.65	
30.55/30.65	LOG: CALL solveNonLinearGetNextSolution
30.55/30.65	
30.55/30.65	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.045056s
30.55/30.65	Time used: 0.045047
30.55/30.65	
30.55/30.65	LOG: SAT solveNonLinear - Elapsed time: 0.066143s
30.55/30.65	Cost: 3; Total time: 0.065869
30.55/30.65	Failed at location 8: 0 <= a_140^0
30.55/30.65	Failed at location 8: 0 <= a_140^0
30.55/30.65	Before Improving: 
30.55/30.65	Quasi-invariant at l8: 0 <= a_140^0
30.55/30.65	Optimizing invariants...
30.55/30.65	
30.55/30.65	LOG: CALL solveLinear
30.55/30.65	
30.55/30.65	LOG: RETURN solveLinear - Elapsed time: 0.008946s
30.55/30.65	Remaining time after improvement: 0.99813
30.55/30.65	Minimizing number of undef constraints...
30.55/30.65	
30.55/30.65	LOG: CALL solveNonLinear
30.55/30.65	
30.55/30.65	LOG: RETURN solveNonLinear - Elapsed time: 0.004367s
30.55/30.65	Number of undef constraints reduced!
30.55/30.65	
30.55/30.65	Non-termination implied by a set of quasi-invariant(s):
30.55/30.65	Quasi-invariant at l8: 0 <= a_140^0
30.55/30.65	
30.55/30.65	Strengthening and disabling EXIT transitions...
30.55/30.65	Closed exits from l8: 2
30.55/30.65	Strengthening exit transition (result): 
30.55/30.65	<l8, end, 0 <= a_140^0 /\ x_18^0 = 0, {all remain the same}>
30.55/30.65	
30.55/30.65	Strengthening and disabling transitions...
30.55/30.65	
30.55/30.65	LOG: CALL solverLinear in Graph for feasibility
30.55/30.65	
30.55/30.65	LOG: RETURN solveLinear in Graph for feasibility
30.55/30.65	Strengthening transition (result): 
30.55/30.65	<l8, l8, 0 <= a_140^0 /\ 1 + x_18^0 <= 0, {x_18^0 -> undef217, rest remain the same}>
30.55/30.65	
30.55/30.65	LOG: CALL solverLinear in Graph for feasibility
30.55/30.65	
30.55/30.65	LOG: RETURN solveLinear in Graph for feasibility
30.55/30.65	Strengthening transition (result): 
30.55/30.65	<l8, l8, 0 <= a_140^0 /\ 1 <= x_18^0, {x_18^0 -> undef217, rest remain the same}>
30.55/30.65	
30.55/30.65	Checking conditional non-termination of SCC {l8}...
30.55/30.65	EXIT TRANSITIONS:
30.55/30.65	<l8, end, 0 <= a_140^0 /\ x_18^0 = 0, {all remain the same}>
30.55/30.65	
30.55/30.65	Solving with 1 template(s).
30.55/30.65	
30.55/30.65	LOG: CALL solveNonLinearGetFirstSolution
30.55/30.65	
30.55/30.65	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.018129s
30.55/30.65	Time used: 0.017894
30.55/30.65	Improving Solution with cost 2 ...
30.55/30.65	
30.55/30.65	LOG: CALL solveNonLinearGetNextSolution
30.55/30.65	
30.55/30.65	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.023932s
30.55/30.65	Time used: 0.023924
30.55/30.65	
30.55/30.65	LOG: SAT solveNonLinear - Elapsed time: 0.042061s
30.55/30.65	Cost: 2; Total time: 0.041818
30.55/30.65	Failed at location 8: 1 + a_140^0 + x_18^0 <= 0
30.55/30.65	Failed at location 8: 1 + a_140^0 + x_18^0 <= 0
30.55/30.65	Before Improving: 
30.55/30.65	Quasi-invariant at l8: 1 + a_140^0 + x_18^0 <= 0
30.55/30.65	Optimizing invariants...
30.55/30.65	
30.55/30.65	LOG: CALL solveLinear
30.55/30.65	
30.55/30.65	LOG: RETURN solveLinear - Elapsed time: 0.007750s
30.55/30.65	Remaining time after improvement: 0.998246
30.55/30.65	Minimizing number of undef constraints...
30.55/30.65	
30.55/30.65	LOG: CALL solveNonLinear
30.55/30.65	
30.55/30.65	LOG: RETURN solveNonLinear - Elapsed time: 0.004106s
30.55/30.65	Number of undef constraints reduced!
30.55/30.65	
30.55/30.65	Non-termination implied by a set of quasi-invariant(s):
30.55/30.65	Quasi-invariant at l8: 1 + a_140^0 + x_18^0 <= 0
30.55/30.65	Constraint over undef '1 + a_140^0 + undef217 <= 0' in transition:
30.55/30.65	<l8, l8, 0 <= a_140^0 /\ 1 + x_18^0 <= 0, {x_18^0 -> undef217, rest remain the same}>
30.55/30.65	
30.55/30.65	Strengthening and disabling EXIT transitions...
30.55/30.65	Closed exits from l8: 1
30.55/30.65	
30.55/30.65	Strengthening and disabling transitions...
30.55/30.65	
30.55/30.65	LOG: CALL solverLinear in Graph for feasibility
30.55/30.65	
30.55/30.65	LOG: RETURN solveLinear in Graph for feasibility
30.55/30.65	Strengthening transition (result): 
30.55/30.65	<l8, l8, 0 <= a_140^0 /\ 1 + a_140^0 + x_18^0 <= 0 /\ 1 + a_140^0 + undef217 <= 0 /\ 1 + x_18^0 <= 0, {x_18^0 -> undef217, rest remain the same}>
30.55/30.65	
30.55/30.65	LOG: CALL solverLinear in Graph for feasibility
30.55/30.65	
30.55/30.65	LOG: RETURN solveLinear in Graph for feasibility
30.55/30.65	It's unfeasible. Removing transition: 
30.55/30.65	<l8, l8, 0 <= a_140^0 /\ 1 <= x_18^0, {x_18^0 -> undef217, rest remain the same}>
30.55/30.65	
30.55/30.65	Calling reachability with...
30.55/30.65	Transition: <l8, end, true, {all remain the same}>
30.55/30.65	Conditions: 0 <= a_140^0, 1 + a_140^0 + x_18^0 <= 0, 
30.55/30.65	Transition: <l8, end, true, {all remain the same}>
30.55/30.65	Conditions: 0 <= a_140^0, 1 + a_140^0 + x_18^0 <= 0, 
30.55/30.65	OPEN EXITS: 
30.55/30.65	<l8, end, 1 + a_140^0 + x_18^0 <= 0, {all remain the same}> (condsUp: 0 <= a_140^0)
30.55/30.65	<l8, end, 1 + a_140^0 + x_18^0 <= 0, {all remain the same}> (condsUp: 0 <= a_140^0)
30.55/30.65	
30.55/30.65	--- Reachability graph ---
30.55/30.65	> Graph without transitions.
30.55/30.65	
30.55/30.65	Calling reachability with...
30.55/30.65	Transition: <l3, l8, 0 <= len_47^0 /\ 1 + a_16^0 <= 0 /\ length_10^0 <= 1 + i_11^0 /\ head_12^0 = undef80 /\ undef80 = undef94, {x_18^0 -> undef140, rest remain the same}>
30.55/30.65	Conditions: 1 + a_140^0 + x_18^0 <= 0, 0 <= a_140^0, 
30.55/30.65	Transition: <l3, l8, 0 <= len_47^0 /\ 1 <= a_16^0 /\ length_10^0 <= 1 + i_11^0 /\ head_12^0 = undef80 /\ undef80 = undef94, {x_18^0 -> undef140, rest remain the same}>
30.55/30.65	Conditions: 1 + a_140^0 + x_18^0 <= 0, 0 <= a_140^0, 
30.55/30.65	Transition: <l3, l8, 0 <= len_47^0 /\ 1 + a_16^0 <= 0 /\ length_10^0 <= 1 + i_11^0 /\ head_12^0 = undef80 /\ undef80 = undef94, {x_18^0 -> undef140, rest remain the same}>
30.55/30.65	Conditions: 1 + a_140^0 + x_18^0 <= 0, 0 <= a_140^0, 
30.55/30.65	Transition: <l3, l8, 0 <= len_47^0 /\ 1 <= a_16^0 /\ length_10^0 <= 1 + i_11^0 /\ head_12^0 = undef80 /\ undef80 = undef94, {x_18^0 -> undef140, rest remain the same}>
30.55/30.65	Conditions: 1 + a_140^0 + x_18^0 <= 0, 0 <= a_140^0, 
30.55/30.65	OPEN EXITS: 
30.55/30.65	<l3, l8, length_10^0 <= 1 + i_11^0 /\ head_12^0 = undef80, {x_18^0 -> undef140, rest remain the same}> (condsUp: 0 <= len_47^0, 1 + a_16^0 <= 0, undef80 = undef94, 1 + a_140^0 + undef140 <= 0, 0 <= a_140^0)
30.61/30.65	<l3, l8, length_10^0 <= 1 + i_11^0 /\ head_12^0 = undef80, {x_18^0 -> undef140, rest remain the same}> (condsUp: 0 <= len_47^0, 1 <= a_16^0, undef80 = undef94, 1 + a_140^0 + undef140 <= 0, 0 <= a_140^0)
30.61/30.65	<l3, l8, length_10^0 <= 1 + i_11^0 /\ head_12^0 = undef80, {x_18^0 -> undef140, rest remain the same}> (condsUp: 0 <= len_47^0, 1 + a_16^0 <= 0, undef80 = undef94, 1 + a_140^0 + undef140 <= 0, 0 <= a_140^0)
30.61/30.65	<l3, l8, length_10^0 <= 1 + i_11^0 /\ head_12^0 = undef80, {x_18^0 -> undef140, rest remain the same}> (condsUp: 0 <= len_47^0, 1 <= a_16^0, undef80 = undef94, 1 + a_140^0 + undef140 <= 0, 0 <= a_140^0)
30.61/30.65	
30.61/30.65	--- Reachability graph ---
30.61/30.65	> Graph without transitions.
30.61/30.65	
30.61/30.65	Calling reachability with...
30.61/30.65	Transition: <l0, l3, 2 <= length_10^0 /\ undef27 = undef29, {head_12^0 -> undef27, i_11^0 -> 1, rest remain the same}>
30.61/30.65	Conditions: length_10^0 <= 1 + i_11^0, head_12^0 = undef80, 0 <= len_47^0, 1 + a_16^0 <= 0, undef80 = undef94, 1 + a_140^0 + undef140 <= 0, 0 <= a_140^0, 
30.61/30.65	Transition: <l0, l3, 2 <= length_10^0 /\ undef27 = undef29, {head_12^0 -> undef27, i_11^0 -> 1, rest remain the same}>
30.61/30.65	Conditions: length_10^0 <= 1 + i_11^0, head_12^0 = undef80, 0 <= len_47^0, 1 <= a_16^0, undef80 = undef94, 1 + a_140^0 + undef140 <= 0, 0 <= a_140^0, 
30.61/30.65	Transition: <l0, l3, 2 <= length_10^0 /\ undef27 = undef29, {head_12^0 -> undef27, i_11^0 -> 1, rest remain the same}>
30.61/30.65	Conditions: length_10^0 <= 1 + i_11^0, head_12^0 = undef80, 0 <= len_47^0, 1 + a_16^0 <= 0, undef80 = undef94, 1 + a_140^0 + undef140 <= 0, 0 <= a_140^0, 
30.61/30.65	Transition: <l0, l3, 2 <= length_10^0 /\ undef27 = undef29, {head_12^0 -> undef27, i_11^0 -> 1, rest remain the same}>
30.61/30.65	Conditions: length_10^0 <= 1 + i_11^0, head_12^0 = undef80, 0 <= len_47^0, 1 <= a_16^0, undef80 = undef94, 1 + a_140^0 + undef140 <= 0, 0 <= a_140^0, 
30.61/30.65	OPEN EXITS: 
30.61/30.65	<l0, l3, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 1 + a_140^0 + undef140 <= 0 /\ 1 + a_16^0 <= 0 /\ undef27 = undef29 /\ undef27 = undef80 /\ undef80 = undef94 /\ length_10^0 = 2, {head_12^0 -> undef27, i_11^0 -> 1, rest remain the same}>
30.61/30.65	<l0, l3, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 1 + a_140^0 + undef140 <= 0 /\ 1 <= a_16^0 /\ undef27 = undef29 /\ undef27 = undef80 /\ undef80 = undef94 /\ length_10^0 = 2, {head_12^0 -> undef27, i_11^0 -> 1, rest remain the same}>
30.61/30.65	<l0, l3, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 1 + a_140^0 + undef140 <= 0 /\ 1 + a_16^0 <= 0 /\ undef27 = undef29 /\ undef27 = undef80 /\ undef80 = undef94 /\ length_10^0 = 2, {head_12^0 -> undef27, i_11^0 -> 1, rest remain the same}>
30.61/30.65	<l0, l3, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 1 + a_140^0 + undef140 <= 0 /\ 1 <= a_16^0 /\ undef27 = undef29 /\ undef27 = undef80 /\ undef80 = undef94 /\ length_10^0 = 2, {head_12^0 -> undef27, i_11^0 -> 1, rest remain the same}>
30.61/30.65	
30.61/30.65	> Conditions are reachable!
30.61/30.65	
30.61/30.65	Program does NOT terminate
30.61/30.65	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
30.61/30.65	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
30.61/30.65	EOF