21.23/21.27	NO
21.23/21.27	
21.23/21.27	Solver Timeout: 4
21.23/21.27	Global Timeout: 300
21.23/21.27	No parsing errors!
21.23/21.27	Init Location: 0
21.23/21.27	Transitions:
21.23/21.27	<l0, l15, true>
21.23/21.27	<l1, l2, true>
21.23/21.27	<l3, l4, (0 <= ((~(1) + (~(1) * y_6^0)) + z_7^0)) /\ (undef7 = undef7) /\ ((0 + undef7) <= 0) /\ (0 <= (0 + undef7)), par{tmp_8^0 -> undef7}>
21.23/21.27	<l3, l5, (0 <= ((~(1) + (~(1) * y_6^0)) + z_7^0)) /\ (undef12 = undef12), par{tmp_8^0 -> undef12}>
21.23/21.27	<l5, l6, ((1 + tmp_8^0) <= 0)>
21.23/21.27	<l5, l6, (1 <= (0 + tmp_8^0))>
21.23/21.27	<l6, l7, true, par{y_6^0 -> (1 + y_6^0)}>
21.23/21.27	<l7, l3, true>
21.23/21.27	<l3, l2, (((0 + (~(1) * y_6^0)) + z_7^0) <= 0), par{x_5^0 -> (1 + x_5^0)}>
21.23/21.27	<l2, l8, (0 <= ((~(1) + (~(1) * x_5^0)) + y_6^0))>
21.23/21.27	<l2, l9, (((0 + (~(1) * x_5^0)) + y_6^0) <= 0) /\ (undef46 = undef46), par{Result_4^0 -> undef46}>
21.23/21.27	<l8, l4, (0 <= ((~(1) + (~(1) * y_6^0)) + z_7^0)) /\ (undef52 = undef52) /\ ((0 + undef52) <= 0) /\ (0 <= (0 + undef52)), par{tmp_8^0 -> undef52}>
21.23/21.27	<l8, l10, (0 <= ((~(1) + (~(1) * y_6^0)) + z_7^0)) /\ (undef57 = undef57), par{tmp_8^0 -> undef57}>
21.23/21.27	<l10, l11, ((1 + tmp_8^0) <= 0)>
21.23/21.27	<l10, l11, (1 <= (0 + tmp_8^0))>
21.23/21.27	<l11, l3, true, par{y_6^0 -> (1 + y_6^0)}>
21.23/21.27	<l8, l2, (((0 + (~(1) * y_6^0)) + z_7^0) <= 0), par{x_5^0 -> (1 + x_5^0)}>
21.23/21.27	<l4, l12, (0 <= ((~(1) + (~(1) * y_6^0)) + z_7^0)) /\ (undef82 = undef82) /\ ((0 + undef82) <= 0) /\ (0 <= (0 + undef82)), par{tmp_8^0 -> undef82}>
21.23/21.27	<l12, l4, true>
21.23/21.27	<l4, l13, (0 <= ((~(1) + (~(1) * y_6^0)) + z_7^0)) /\ (undef92 = undef92), par{tmp_8^0 -> undef92}>
21.23/21.27	<l13, l14, ((1 + tmp_8^0) <= 0)>
21.23/21.27	<l13, l14, (1 <= (0 + tmp_8^0))>
21.23/21.27	<l14, l3, true, par{y_6^0 -> (1 + y_6^0)}>
21.23/21.27	<l15, l1, true>
21.23/21.27	
21.23/21.27	Fresh variables:
21.23/21.27	undef7, undef12, undef46, undef52, undef57, undef82, undef92, 
21.23/21.27	
21.23/21.27	Undef variables:
21.23/21.27	undef7, undef12, undef46, undef52, undef57, undef82, undef92, 
21.23/21.27	
21.23/21.27	Abstraction variables:
21.23/21.27	
21.23/21.27	Exit nodes:
21.23/21.27	
21.23/21.27	Accepting locations:
21.23/21.27	
21.23/21.27	Asserts:
21.23/21.27	
21.23/21.27	Preprocessed LLVMGraph
21.23/21.27	Init Location: 0
21.23/21.27	Transitions:
21.23/21.27	<l0, l2, true>
21.23/21.27	<l2, l4, (0 <= ((~(1) + (~(1) * x_5^0)) + y_6^0)) /\ (0 <= ((~(1) + (~(1) * y_6^0)) + z_7^0)) /\ (undef52 = undef52) /\ ((0 + undef52) <= 0) /\ (0 <= (0 + undef52))>
21.23/21.27	<l2, l3, (0 <= ((~(1) + (~(1) * x_5^0)) + y_6^0)) /\ (0 <= ((~(1) + (~(1) * y_6^0)) + z_7^0)) /\ (undef57 = undef57) /\ ((1 + undef57) <= 0), par{y_6^0 -> (1 + y_6^0)}>
21.23/21.27	<l2, l3, (0 <= ((~(1) + (~(1) * x_5^0)) + y_6^0)) /\ (0 <= ((~(1) + (~(1) * y_6^0)) + z_7^0)) /\ (undef57 = undef57) /\ (1 <= (0 + undef57)), par{y_6^0 -> (1 + y_6^0)}>
21.23/21.27	<l2, l2, (0 <= ((~(1) + (~(1) * x_5^0)) + y_6^0)) /\ (((0 + (~(1) * y_6^0)) + z_7^0) <= 0), par{x_5^0 -> (1 + x_5^0)}>
21.23/21.27	<l2, l9, (((0 + (~(1) * x_5^0)) + y_6^0) <= 0) /\ (undef46 = undef46)>
21.23/21.27	<l3, l4, (0 <= ((~(1) + (~(1) * y_6^0)) + z_7^0)) /\ (undef7 = undef7) /\ ((0 + undef7) <= 0) /\ (0 <= (0 + undef7))>
21.23/21.27	<l3, l3, (0 <= ((~(1) + (~(1) * y_6^0)) + z_7^0)) /\ (undef12 = undef12) /\ ((1 + undef12) <= 0), par{y_6^0 -> (1 + y_6^0)}>
21.23/21.27	<l3, l3, (0 <= ((~(1) + (~(1) * y_6^0)) + z_7^0)) /\ (undef12 = undef12) /\ (1 <= (0 + undef12)), par{y_6^0 -> (1 + y_6^0)}>
21.23/21.27	<l3, l2, (((0 + (~(1) * y_6^0)) + z_7^0) <= 0), par{x_5^0 -> (1 + x_5^0)}>
21.23/21.27	<l4, l4, (0 <= ((~(1) + (~(1) * y_6^0)) + z_7^0)) /\ (undef82 = undef82) /\ ((0 + undef82) <= 0) /\ (0 <= (0 + undef82))>
21.23/21.27	<l4, l3, (0 <= ((~(1) + (~(1) * y_6^0)) + z_7^0)) /\ (undef92 = undef92) /\ ((1 + undef92) <= 0), par{y_6^0 -> (1 + y_6^0)}>
21.23/21.27	<l4, l3, (0 <= ((~(1) + (~(1) * y_6^0)) + z_7^0)) /\ (undef92 = undef92) /\ (1 <= (0 + undef92)), par{y_6^0 -> (1 + y_6^0)}>
21.23/21.27	
21.23/21.27	Fresh variables:
21.23/21.27	undef7, undef12, undef46, undef52, undef57, undef82, undef92, 
21.23/21.27	
21.23/21.27	Undef variables:
21.23/21.27	undef7, undef12, undef46, undef52, undef57, undef82, undef92, 
21.23/21.27	
21.23/21.27	Abstraction variables:
21.23/21.27	
21.23/21.27	Exit nodes:
21.23/21.27	
21.23/21.27	Accepting locations:
21.23/21.27	
21.23/21.27	Asserts:
21.23/21.27	
21.23/21.27	*************************************************************
21.23/21.27	*******************************************************************************************
21.23/21.27	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
21.23/21.27	*******************************************************************************************
21.23/21.27	
21.23/21.27	Init Location: 0
21.23/21.27	Graph 0:
21.23/21.27	Transitions:
21.23/21.27	Variables:
21.23/21.27	
21.23/21.27	Graph 1:
21.23/21.27	Transitions:
21.23/21.27	<l2, l4, 1 + x_5^0 <= y_6^0 /\ 1 + y_6^0 <= z_7^0 /\ undef52 = 0, {all remain the same}>
21.23/21.27	<l2, l3, 1 + x_5^0 <= y_6^0 /\ 1 + y_6^0 <= z_7^0 /\ 1 + undef57 <= 0, {y_6^0 -> 1 + y_6^0, rest remain the same}>
21.23/21.27	<l2, l3, 1 + x_5^0 <= y_6^0 /\ 1 + y_6^0 <= z_7^0 /\ 1 <= undef57, {y_6^0 -> 1 + y_6^0, rest remain the same}>
21.23/21.27	<l2, l2, z_7^0 <= y_6^0 /\ 1 + x_5^0 <= y_6^0, {x_5^0 -> 1 + x_5^0, rest remain the same}>
21.23/21.27	<l3, l4, 1 + y_6^0 <= z_7^0 /\ undef7 = 0, {all remain the same}>
21.23/21.27	<l3, l3, 1 + y_6^0 <= z_7^0 /\ 1 + undef12 <= 0, {y_6^0 -> 1 + y_6^0, rest remain the same}>
21.23/21.27	<l3, l3, 1 + y_6^0 <= z_7^0 /\ 1 <= undef12, {y_6^0 -> 1 + y_6^0, rest remain the same}>
21.23/21.27	<l3, l2, z_7^0 <= y_6^0, {x_5^0 -> 1 + x_5^0, rest remain the same}>
21.23/21.27	<l4, l4, 1 + y_6^0 <= z_7^0 /\ undef82 = 0, {all remain the same}>
21.23/21.27	<l4, l3, 1 + y_6^0 <= z_7^0 /\ 1 + undef92 <= 0, {y_6^0 -> 1 + y_6^0, rest remain the same}>
21.23/21.27	<l4, l3, 1 + y_6^0 <= z_7^0 /\ 1 <= undef92, {y_6^0 -> 1 + y_6^0, rest remain the same}>
21.23/21.27	Variables:
21.23/21.27	x_5^0, y_6^0, z_7^0
21.23/21.27	
21.23/21.27	Graph 2:
21.23/21.27	Transitions:
21.23/21.27	Variables:
21.23/21.27	
21.23/21.27	Precedence: 
21.23/21.27	Graph 0
21.23/21.27	
21.23/21.27	Graph 1
21.23/21.27	<l0, l2, true, {all remain the same}>
21.23/21.27	
21.23/21.27	Graph 2
21.23/21.27	<l2, l9, y_6^0 <= x_5^0, {all remain the same}>
21.23/21.27	
21.23/21.27	Map Locations to Subgraph:
21.23/21.27	( 0 , 0 )
21.23/21.27	( 2 , 1 )
21.23/21.27	( 3 , 1 )
21.23/21.27	( 4 , 1 )
21.23/21.27	( 9 , 2 )
21.23/21.27	
21.23/21.27	*******************************************************************************************
21.23/21.27	********************************    CHECKING ASSERTIONS    ********************************
21.23/21.27	*******************************************************************************************
21.23/21.27	
21.23/21.27	Proving termination of subgraph 0
21.23/21.27	Proving termination of subgraph 1
21.23/21.27	Checking unfeasibility...
21.23/21.27	Time used: 0.060574
21.23/21.27	
21.23/21.27	Checking conditional termination of SCC {l2, l3, l4}...
21.23/21.27	
21.23/21.27	LOG: CALL solveLinear
21.23/21.27	
21.23/21.27	LOG: RETURN solveLinear - Elapsed time: 0.006599s
21.23/21.27	Ranking function: -7 - 3*x_5^0 - y_6^0 + 4*z_7^0
21.23/21.27	New Graphs: 
21.23/21.27	Transitions:
21.23/21.27	<l2, l4, 1 + x_5^0 <= y_6^0 /\ 1 + y_6^0 <= z_7^0 /\ undef52 = 0, {all remain the same}>
21.23/21.27	<l2, l2, z_7^0 <= y_6^0 /\ 1 + x_5^0 <= y_6^0, {x_5^0 -> 1 + x_5^0, rest remain the same}>
21.23/21.27	<l3, l4, 1 + y_6^0 <= z_7^0 /\ undef7 = 0, {all remain the same}>
21.23/21.27	<l3, l3, 1 + y_6^0 <= z_7^0 /\ 1 + undef12 <= 0, {y_6^0 -> 1 + y_6^0, rest remain the same}>
21.23/21.27	<l3, l3, 1 + y_6^0 <= z_7^0 /\ 1 <= undef12, {y_6^0 -> 1 + y_6^0, rest remain the same}>
21.23/21.27	<l3, l2, z_7^0 <= y_6^0, {x_5^0 -> 1 + x_5^0, rest remain the same}>
21.23/21.27	<l4, l4, 1 + y_6^0 <= z_7^0 /\ undef82 = 0, {all remain the same}>
21.23/21.27	<l4, l3, 1 + y_6^0 <= z_7^0 /\ 1 + undef92 <= 0, {y_6^0 -> 1 + y_6^0, rest remain the same}>
21.23/21.27	<l4, l3, 1 + y_6^0 <= z_7^0 /\ 1 <= undef92, {y_6^0 -> 1 + y_6^0, rest remain the same}>
21.23/21.27	Variables:
21.23/21.27	x_5^0, y_6^0, z_7^0
21.23/21.27	Checking conditional termination of SCC {l2, l3, l4}...
21.23/21.27	
21.23/21.27	LOG: CALL solveLinear
21.23/21.27	
21.23/21.27	LOG: RETURN solveLinear - Elapsed time: 0.002744s
21.23/21.27	Ranking function: -1 - y_6^0 + z_7^0
21.23/21.27	New Graphs: 
21.23/21.27	Transitions:
21.23/21.27	<l2, l2, z_7^0 <= y_6^0 /\ 1 + x_5^0 <= y_6^0, {x_5^0 -> 1 + x_5^0, rest remain the same}>
21.23/21.27	Variables:
21.23/21.27	x_5^0, y_6^0, z_7^0
21.23/21.27	Transitions:
21.23/21.27	<l4, l4, 1 + y_6^0 <= z_7^0 /\ undef82 = 0, {all remain the same}>
21.23/21.27	Variables:
21.23/21.27	y_6^0, z_7^0
21.23/21.27	Checking conditional termination of SCC {l2}...
21.23/21.27	
21.23/21.27	LOG: CALL solveLinear
21.23/21.27	
21.23/21.27	LOG: RETURN solveLinear - Elapsed time: 0.000934s
21.23/21.27	Ranking function: -1 - x_5^0 + y_6^0
21.23/21.27	New Graphs: 
21.23/21.27	Transitions:
21.23/21.27	<l4, l4, 1 + y_6^0 <= z_7^0 /\ undef82 = 0, {all remain the same}>
21.23/21.27	Variables:
21.23/21.27	y_6^0, z_7^0
21.23/21.27	> No variable changes in termination graph.
21.23/21.27	Checking conditional unfeasibility...
21.23/21.27	Calling Safety with literal z_7^0 <= y_6^0 and entry <l4, l4, true, {all remain the same}>
21.23/21.27	
21.23/21.27	LOG: CALL check - Post:z_7^0 <= y_6^0 - Process 1
21.23/21.27	* Exit transition: <l4, l4, true, {all remain the same}>
21.23/21.27	* Postcondition  : z_7^0 <= y_6^0
21.23/21.27	Quasi-invariants: 
21.23/21.27	Location 2: z_7^0 <= y_6^0 ; 
21.23/21.27	Location 3: z_7^0 <= y_6^0 ; 
21.23/21.27	Location 4: z_7^0 <= y_6^0 ; 
21.23/21.27	Postcondition: z_7^0 <= y_6^0
21.23/21.27	
21.23/21.27	LOG: CALL check - Post:z_7^0 <= y_6^0 - Process 2
21.23/21.27	* Exit transition: <l0, l2, true, {all remain the same}>
21.23/21.27	* Postcondition  : z_7^0 <= y_6^0
21.23/21.27	
21.23/21.27	LOG: CALL solveLinear
21.23/21.27	
21.23/21.27	LOG: RETURN solveLinear - Elapsed time: 0.000382s
21.23/21.27	> Postcondition is not implied!
21.23/21.27	
21.23/21.27	LOG: RETURN check - Elapsed time: 0.000450s
21.23/21.27	
21.23/21.27	LOG: NarrowEntry size 1
21.23/21.27	Narrowing transition: 
21.23/21.27	<l2, l4, 1 + x_5^0 <= y_6^0 /\ 1 + y_6^0 <= z_7^0 /\ undef52 = 0, {all remain the same}>
21.23/21.27	
21.23/21.27	LOG: Narrow transition size 1
21.23/21.27	Narrowing transition: 
21.23/21.27	<l2, l3, 1 + x_5^0 <= y_6^0 /\ 1 + y_6^0 <= z_7^0 /\ 1 + undef57 <= 0, {y_6^0 -> 1 + y_6^0, rest remain the same}>
21.23/21.27	
21.23/21.27	LOG: Narrow transition size 1
21.23/21.27	Narrowing transition: 
21.23/21.27	<l2, l3, 1 + x_5^0 <= y_6^0 /\ 1 + y_6^0 <= z_7^0 /\ 1 <= undef57, {y_6^0 -> 1 + y_6^0, rest remain the same}>
21.23/21.27	
21.23/21.27	LOG: Narrow transition size 1
21.23/21.27	It's unfeasible. Removing transition: 
21.23/21.27	<l2, l2, z_7^0 <= y_6^0 /\ 1 + x_5^0 <= y_6^0, {x_5^0 -> 1 + x_5^0, rest remain the same}>
21.23/21.27	Narrowing transition: 
21.23/21.27	<l3, l4, 1 + y_6^0 <= z_7^0 /\ undef7 = 0, {all remain the same}>
21.23/21.27	
21.23/21.27	LOG: Narrow transition size 1
21.23/21.27	Narrowing transition: 
21.23/21.27	<l3, l3, 1 + y_6^0 <= z_7^0 /\ 1 + undef12 <= 0, {y_6^0 -> 1 + y_6^0, rest remain the same}>
21.23/21.27	
21.23/21.27	LOG: Narrow transition size 1
21.23/21.27	Narrowing transition: 
21.23/21.27	<l3, l3, 1 + y_6^0 <= z_7^0 /\ 1 <= undef12, {y_6^0 -> 1 + y_6^0, rest remain the same}>
21.23/21.27	
21.23/21.27	LOG: Narrow transition size 1
21.23/21.27	It's unfeasible. Removing transition: 
21.23/21.27	<l3, l2, z_7^0 <= y_6^0, {x_5^0 -> 1 + x_5^0, rest remain the same}>
21.23/21.27	Narrowing transition: 
21.23/21.27	<l4, l4, 1 + y_6^0 <= z_7^0 /\ undef82 = 0, {all remain the same}>
21.23/21.27	
21.23/21.27	LOG: Narrow transition size 1
21.23/21.27	Narrowing transition: 
21.23/21.27	<l4, l3, 1 + y_6^0 <= z_7^0 /\ 1 + undef92 <= 0, {y_6^0 -> 1 + y_6^0, rest remain the same}>
21.23/21.27	
21.23/21.27	LOG: Narrow transition size 1
21.23/21.27	Narrowing transition: 
21.23/21.27	<l4, l3, 1 + y_6^0 <= z_7^0 /\ 1 <= undef92, {y_6^0 -> 1 + y_6^0, rest remain the same}>
21.23/21.27	
21.23/21.27	LOG: Narrow transition size 1
21.23/21.27	ENTRIES:
21.23/21.27	<l0, l2, 1 + y_6^0 <= z_7^0, {all remain the same}>
21.23/21.27	END ENTRIES:
21.23/21.27	GRAPH:
21.23/21.27	<l2, l4, 1 + x_5^0 <= y_6^0 /\ 1 + y_6^0 <= z_7^0 /\ undef52 = 0, {all remain the same}>
21.23/21.27	<l2, l3, 1 + x_5^0 <= y_6^0 /\ 1 + y_6^0 <= z_7^0 /\ 1 + undef57 <= 0, {y_6^0 -> 1 + y_6^0, rest remain the same}>
21.23/21.27	<l2, l3, 1 + x_5^0 <= y_6^0 /\ 1 + y_6^0 <= z_7^0 /\ 1 <= undef57, {y_6^0 -> 1 + y_6^0, rest remain the same}>
21.23/21.27	<l3, l4, 1 + y_6^0 <= z_7^0 /\ undef7 = 0, {all remain the same}>
21.23/21.27	<l3, l3, 1 + y_6^0 <= z_7^0 /\ 1 + undef12 <= 0, {y_6^0 -> 1 + y_6^0, rest remain the same}>
21.23/21.27	<l3, l3, 1 + y_6^0 <= z_7^0 /\ 1 <= undef12, {y_6^0 -> 1 + y_6^0, rest remain the same}>
21.23/21.27	<l4, l4, 1 + y_6^0 <= z_7^0 /\ undef82 = 0, {all remain the same}>
21.23/21.27	<l4, l3, 1 + y_6^0 <= z_7^0 /\ 1 + undef92 <= 0, {y_6^0 -> 1 + y_6^0, rest remain the same}>
21.23/21.27	<l4, l3, 1 + y_6^0 <= z_7^0 /\ 1 <= undef92, {y_6^0 -> 1 + y_6^0, rest remain the same}>
21.23/21.27	END GRAPH:
21.23/21.27	EXIT: <l4, l4, true, {all remain the same}>
21.23/21.27	POST: z_7^0 <= y_6^0
21.23/21.27	
21.23/21.27	
21.23/21.27	LOG: Try proving POST
21.23/21.27	Solving with 1 template(s).
21.23/21.27	
21.23/21.27	LOG: CALL solveNonLinearGetFirstSolution
21.23/21.27	
21.23/21.27	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.045009s
21.23/21.27	Time used: 0.044658
21.23/21.27	Improving Solution with cost 1 ...
21.23/21.27	
21.23/21.27	LOG: CALL solveNonLinearGetNextSolution
21.23/21.27	
21.23/21.27	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.082330s
21.23/21.27	Time used: 0.082324
21.23/21.27	
21.23/21.27	LOG: SAT solveNonLinear - Elapsed time: 0.127339s
21.23/21.27	Cost: 1; Total time: 0.126982
21.23/21.27	Failed at location 2: y_6^0 <= x_5^0
21.23/21.27	Before Improving: 
21.23/21.27	Quasi-invariant at l2: y_6^0 <= x_5^0
21.23/21.27	Quasi-invariant at l3: 1 <= 0
21.23/21.27	Quasi-invariant at l4: z_7^0 <= y_6^0
21.23/21.27	Optimizing invariants...
21.23/21.27	
21.23/21.27	LOG: CALL solveLinear
21.23/21.27	
21.23/21.27	LOG: RETURN solveLinear - Elapsed time: 0.011124s
21.23/21.27	Remaining time after improvement: 0.99739
21.23/21.27	Postcondition implied by a set of quasi-invariant(s):
21.23/21.27	Quasi-invariant at l2: y_6^0 <= x_5^0
21.23/21.27	Quasi-invariant at l3: 1 <= 0
21.23/21.27	Quasi-invariant at l4: z_7^0 <= y_6^0
21.23/21.27	Postcondition: y_6^0 <= x_5^0
21.23/21.27	
21.23/21.27	LOG: CALL check - Post:y_6^0 <= x_5^0 - Process 3
21.23/21.27	* Exit transition: <l0, l2, 1 + y_6^0 <= z_7^0, {all remain the same}>
21.23/21.27	* Postcondition  : y_6^0 <= x_5^0
21.23/21.27	
21.23/21.27	LOG: CALL solveLinear
21.23/21.27	
21.23/21.27	LOG: RETURN solveLinear - Elapsed time: 0.000924s
21.23/21.27	> Postcondition is not implied!
21.23/21.27	
21.23/21.27	LOG: RETURN check - Elapsed time: 0.001006s
21.23/21.27	
21.23/21.27	LOG: NarrowEntry size 1
21.23/21.27	INVARIANTS: 
21.23/21.27	2: 
21.23/21.27	3: 
21.23/21.27	4: 
21.23/21.27	Quasi-INVARIANTS to narrow Graph: 
21.23/21.27	2: y_6^0 <= x_5^0 , 
21.23/21.27	3: 1 <= 0 , 
21.23/21.27	4: z_7^0 <= y_6^0 , 
21.23/21.27	Narrowing transition: 
21.23/21.27	<l2, l4, 1 + x_5^0 <= y_6^0 /\ 1 + y_6^0 <= z_7^0 /\ undef52 = 0, {all remain the same}>
21.23/21.27	
21.23/21.27	LOG: Narrow transition size 1
21.23/21.27	Narrowing transition: 
21.23/21.27	<l2, l3, 1 + x_5^0 <= y_6^0 /\ 1 + y_6^0 <= z_7^0 /\ 1 + undef57 <= 0, {y_6^0 -> 1 + y_6^0, rest remain the same}>
21.23/21.27	
21.23/21.27	LOG: Narrow transition size 1
21.23/21.27	Narrowing transition: 
21.23/21.27	<l2, l3, 1 + x_5^0 <= y_6^0 /\ 1 + y_6^0 <= z_7^0 /\ 1 <= undef57, {y_6^0 -> 1 + y_6^0, rest remain the same}>
21.23/21.27	
21.23/21.27	LOG: Narrow transition size 1
21.23/21.27	Narrowing transition: 
21.23/21.27	<l3, l4, 1 + y_6^0 <= z_7^0 /\ undef7 = 0, {all remain the same}>
21.23/21.27	
21.23/21.27	LOG: Narrow transition size 1
21.23/21.27	Narrowing transition: 
21.23/21.27	<l3, l3, 1 + y_6^0 <= z_7^0 /\ 1 + undef12 <= 0, {y_6^0 -> 1 + y_6^0, rest remain the same}>
21.23/21.27	
21.23/21.27	LOG: Narrow transition size 1
21.23/21.27	Narrowing transition: 
21.23/21.27	<l3, l3, 1 + y_6^0 <= z_7^0 /\ 1 <= undef12, {y_6^0 -> 1 + y_6^0, rest remain the same}>
21.23/21.27	
21.23/21.27	LOG: Narrow transition size 1
21.23/21.27	Narrowing transition: 
21.23/21.27	<l4, l4, 1 + y_6^0 <= z_7^0 /\ undef82 = 0, {all remain the same}>
21.23/21.27	
21.23/21.27	LOG: Narrow transition size 1
21.23/21.27	Narrowing transition: 
21.23/21.27	<l4, l3, 1 + y_6^0 <= z_7^0 /\ 1 + undef92 <= 0, {y_6^0 -> 1 + y_6^0, rest remain the same}>
21.23/21.27	
21.23/21.27	LOG: Narrow transition size 1
21.23/21.27	Narrowing transition: 
21.23/21.27	<l4, l3, 1 + y_6^0 <= z_7^0 /\ 1 <= undef92, {y_6^0 -> 1 + y_6^0, rest remain the same}>
21.23/21.27	
21.23/21.27	LOG: Narrow transition size 1
21.23/21.27	ENTRIES:
21.23/21.27	<l0, l2, 1 + x_5^0 <= y_6^0 /\ 1 + y_6^0 <= z_7^0, {all remain the same}>
21.23/21.27	END ENTRIES:
21.23/21.27	GRAPH:
21.23/21.27	<l2, l4, 1 + x_5^0 <= y_6^0 /\ 1 + y_6^0 <= z_7^0 /\ undef52 = 0, {all remain the same}>
21.23/21.27	<l2, l3, 1 + x_5^0 <= y_6^0 /\ 1 + y_6^0 <= z_7^0 /\ 1 + undef57 <= 0, {y_6^0 -> 1 + y_6^0, rest remain the same}>
21.23/21.27	<l2, l3, 1 + x_5^0 <= y_6^0 /\ 1 + y_6^0 <= z_7^0 /\ 1 <= undef57, {y_6^0 -> 1 + y_6^0, rest remain the same}>
21.23/21.27	<l3, l4, 0 <= 0 /\ 1 + y_6^0 <= z_7^0 /\ undef7 = 0, {all remain the same}>
21.23/21.27	<l3, l3, 0 <= 0 /\ 1 + y_6^0 <= z_7^0 /\ 1 + undef12 <= 0, {y_6^0 -> 1 + y_6^0, rest remain the same}>
21.23/21.27	<l3, l3, 0 <= 0 /\ 1 + y_6^0 <= z_7^0 /\ 1 <= undef12, {y_6^0 -> 1 + y_6^0, rest remain the same}>
21.23/21.27	<l4, l4, 1 + y_6^0 <= z_7^0 /\ undef82 = 0, {all remain the same}>
21.23/21.27	<l4, l3, 1 + y_6^0 <= z_7^0 /\ 1 + undef92 <= 0, {y_6^0 -> 1 + y_6^0, rest remain the same}>
21.23/21.27	<l4, l3, 1 + y_6^0 <= z_7^0 /\ 1 <= undef92, {y_6^0 -> 1 + y_6^0, rest remain the same}>
21.23/21.27	END GRAPH:
21.23/21.27	EXIT: <l4, l4, true, {all remain the same}>
21.23/21.27	POST: z_7^0 <= y_6^0
21.23/21.27	
21.23/21.27	
21.23/21.27	LOG: Try proving POST
21.23/21.27	Solving with 1 template(s).
21.23/21.27	
21.23/21.27	LOG: CALL solveNonLinearGetFirstSolution
21.23/21.27	
21.23/21.27	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.086179s
21.23/21.27	Time used: 0.086079
21.23/21.27	Solving with 2 template(s).
21.23/21.27	
21.23/21.27	LOG: CALL solveNonLinearGetFirstSolution
21.23/21.27	
21.23/21.27	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.003955s
21.23/21.27	Time used: 4.00087
21.23/21.27	Solving with 3 template(s).
21.23/21.27	
21.23/21.27	LOG: CALL solveNonLinearGetFirstSolution
21.23/21.27	
21.23/21.27	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.013411s
21.23/21.27	Time used: 1.00016
21.23/21.27	
21.23/21.27	LOG: Postcondition is not implied - no solution
21.23/21.27	> Postcondition is not implied!
21.23/21.27	
21.23/21.27	LOG: RETURN check - Elapsed time: 5.286161s
21.23/21.27	
21.23/21.27	Proving non-termination of subgraph 1
21.23/21.27	Transitions:
21.23/21.27	<l2, l4, 1 + x_5^0 <= y_6^0 /\ 1 + y_6^0 <= z_7^0 /\ undef52 = 0, {all remain the same}>
21.23/21.27	<l2, l3, 1 + x_5^0 <= y_6^0 /\ 1 + y_6^0 <= z_7^0 /\ 1 + undef57 <= 0, {y_6^0 -> 1 + y_6^0, rest remain the same}>
21.23/21.27	<l2, l3, 1 + x_5^0 <= y_6^0 /\ 1 + y_6^0 <= z_7^0 /\ 1 <= undef57, {y_6^0 -> 1 + y_6^0, rest remain the same}>
21.23/21.27	<l2, l2, z_7^0 <= y_6^0 /\ 1 + x_5^0 <= y_6^0, {x_5^0 -> 1 + x_5^0, rest remain the same}>
21.23/21.27	<l3, l4, 1 + y_6^0 <= z_7^0 /\ undef7 = 0, {all remain the same}>
21.23/21.27	<l3, l3, 1 + y_6^0 <= z_7^0 /\ 1 + undef12 <= 0, {y_6^0 -> 1 + y_6^0, rest remain the same}>
21.23/21.27	<l3, l3, 1 + y_6^0 <= z_7^0 /\ 1 <= undef12, {y_6^0 -> 1 + y_6^0, rest remain the same}>
21.23/21.27	<l3, l2, z_7^0 <= y_6^0, {x_5^0 -> 1 + x_5^0, rest remain the same}>
21.23/21.27	<l4, l4, 1 + y_6^0 <= z_7^0 /\ undef82 = 0, {all remain the same}>
21.23/21.27	<l4, l3, 1 + y_6^0 <= z_7^0 /\ 1 + undef92 <= 0, {y_6^0 -> 1 + y_6^0, rest remain the same}>
21.23/21.27	<l4, l3, 1 + y_6^0 <= z_7^0 /\ 1 <= undef92, {y_6^0 -> 1 + y_6^0, rest remain the same}>
21.23/21.27	Variables:
21.23/21.27	x_5^0, y_6^0, z_7^0
21.23/21.27	
21.23/21.27	Checking conditional non-termination of SCC {l2, l3, l4}...
21.23/21.27	EXIT TRANSITIONS:
21.23/21.27	<l2, end, y_6^0 <= x_5^0, {all remain the same}>
21.23/21.27	<l4, end, z_7^0 <= y_6^0, {all remain the same}>
21.23/21.27	
21.23/21.27	Solving with 1 template(s).
21.23/21.27	
21.23/21.27	LOG: CALL solveNonLinearGetFirstSolution
21.23/21.27	
21.23/21.27	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.448195s
21.23/21.27	Time used: 0.447307
21.23/21.27	Improving Solution with cost 1 ...
21.23/21.27	
21.23/21.27	LOG: CALL solveNonLinearGetNextSolution
21.23/21.27	
21.23/21.27	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.123395s
21.23/21.27	Time used: 0.123377
21.23/21.27	
21.23/21.27	LOG: SAT solveNonLinear - Elapsed time: 0.571590s
21.23/21.27	Cost: 1; Total time: 0.570684
21.23/21.27	Minimizing number of undef constraints...
21.23/21.27	
21.23/21.27	LOG: CALL solveNonLinear
21.23/21.27	
21.23/21.27	LOG: RETURN solveNonLinear - Elapsed time: 0.019461s
21.23/21.27	Number of undef constraints reduced!
21.23/21.27	
21.23/21.27	Non-termination implied by a set of quasi-invariant(s):
21.23/21.27	Quasi-invariant at l3: y_6^0 <= 1 + z_7^0
21.23/21.27	Quasi-invariant at l4: 1 + y_6^0 <= z_7^0
21.23/21.27	
21.23/21.27	Strengthening and disabling EXIT transitions...
21.23/21.27	Closed exits from l4: 1
21.23/21.27	Strengthening exit transition (result): 
21.23/21.27	<l2, end, y_6^0 <= x_5^0, {all remain the same}>
21.23/21.27	
21.23/21.27	Strengthening and disabling transitions...
21.23/21.27	
21.23/21.27	LOG: CALL solverLinear in Graph for feasibility
21.23/21.27	
21.23/21.27	LOG: RETURN solveLinear in Graph for feasibility
21.23/21.27	Strengthening transition (result): 
21.23/21.27	<l2, l4, 1 + x_5^0 <= y_6^0 /\ 1 + y_6^0 <= z_7^0 /\ undef52 = 0, {all remain the same}>
21.23/21.27	
21.23/21.27	LOG: CALL solverLinear in Graph for feasibility
21.23/21.27	
21.23/21.27	LOG: RETURN solveLinear in Graph for feasibility
21.23/21.27	Strengthening transition (result): 
21.23/21.27	<l2, l3, 1 + x_5^0 <= y_6^0 /\ 1 + y_6^0 <= z_7^0 /\ 1 + undef57 <= 0, {y_6^0 -> 1 + y_6^0, rest remain the same}>
21.23/21.27	
21.23/21.27	LOG: CALL solverLinear in Graph for feasibility
21.23/21.27	
21.23/21.27	LOG: RETURN solveLinear in Graph for feasibility
21.23/21.27	Strengthening transition (result): 
21.23/21.27	<l2, l3, 1 + x_5^0 <= y_6^0 /\ 1 + y_6^0 <= z_7^0 /\ 1 <= undef57, {y_6^0 -> 1 + y_6^0, rest remain the same}>
21.23/21.27	
21.23/21.27	LOG: CALL solverLinear in Graph for feasibility
21.23/21.27	
21.23/21.27	LOG: RETURN solveLinear in Graph for feasibility
21.23/21.27	Strengthening transition (result): 
21.23/21.27	<l2, l2, z_7^0 <= y_6^0 /\ 1 + x_5^0 <= y_6^0, {x_5^0 -> 1 + x_5^0, rest remain the same}>
21.23/21.27	
21.23/21.27	LOG: CALL solverLinear in Graph for feasibility
21.23/21.27	
21.23/21.27	LOG: RETURN solveLinear in Graph for feasibility
21.23/21.27	Strengthening transition (result): 
21.23/21.27	<l3, l4, 1 + y_6^0 <= z_7^0 /\ undef7 = 0, {all remain the same}>
21.23/21.27	
21.23/21.27	LOG: CALL solverLinear in Graph for feasibility
21.23/21.27	
21.23/21.27	LOG: RETURN solveLinear in Graph for feasibility
21.23/21.27	Strengthening transition (result): 
21.23/21.27	<l3, l3, 1 + y_6^0 <= z_7^0 /\ 1 + undef12 <= 0, {y_6^0 -> 1 + y_6^0, rest remain the same}>
21.23/21.27	
21.23/21.27	LOG: CALL solverLinear in Graph for feasibility
21.23/21.27	
21.23/21.27	LOG: RETURN solveLinear in Graph for feasibility
21.23/21.27	Strengthening transition (result): 
21.23/21.27	<l3, l3, 1 + y_6^0 <= z_7^0 /\ 1 <= undef12, {y_6^0 -> 1 + y_6^0, rest remain the same}>
21.23/21.27	
21.23/21.27	LOG: CALL solverLinear in Graph for feasibility
21.23/21.27	
21.23/21.27	LOG: RETURN solveLinear in Graph for feasibility
21.23/21.27	Strengthening transition (result): 
21.23/21.27	<l3, l2, z_7^0 <= y_6^0 /\ y_6^0 <= 1 + z_7^0, {x_5^0 -> 1 + x_5^0, rest remain the same}>
21.23/21.27	
21.23/21.27	LOG: CALL solverLinear in Graph for feasibility
21.23/21.27	
21.23/21.27	LOG: RETURN solveLinear in Graph for feasibility
21.23/21.27	Strengthening transition (result): 
21.23/21.27	<l4, l4, 1 + y_6^0 <= z_7^0 /\ undef82 = 0, {all remain the same}>
21.23/21.27	
21.23/21.27	LOG: CALL solverLinear in Graph for feasibility
21.23/21.27	
21.23/21.27	LOG: RETURN solveLinear in Graph for feasibility
21.23/21.27	Strengthening transition (result): 
21.23/21.27	<l4, l3, 1 + y_6^0 <= z_7^0 /\ 1 + undef92 <= 0, {y_6^0 -> 1 + y_6^0, rest remain the same}>
21.23/21.27	
21.23/21.27	LOG: CALL solverLinear in Graph for feasibility
21.23/21.27	
21.23/21.27	LOG: RETURN solveLinear in Graph for feasibility
21.23/21.27	Strengthening transition (result): 
21.23/21.27	<l4, l3, 1 + y_6^0 <= z_7^0 /\ 1 <= undef92, {y_6^0 -> 1 + y_6^0, rest remain the same}>
21.23/21.27	
21.23/21.27	Checking conditional non-termination of SCC {l2, l3, l4}...
21.23/21.27	EXIT TRANSITIONS:
21.23/21.27	<l2, end, y_6^0 <= x_5^0, {all remain the same}>
21.23/21.27	
21.23/21.27	Solving with 1 template(s).
21.23/21.27	
21.23/21.27	LOG: CALL solveNonLinearGetFirstSolution
21.23/21.27	
21.23/21.27	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.053197s
21.23/21.27	Time used: 5.05148
21.23/21.27	Solving with 2 template(s).
21.23/21.27	
21.23/21.27	LOG: CALL solveNonLinearGetFirstSolution
21.23/21.27	
21.23/21.27	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.027345s
21.23/21.27	Time used: 5.0019
21.23/21.27	Solving with 3 template(s).
21.23/21.27	
21.23/21.27	LOG: CALL solveNonLinearGetFirstSolution
21.23/21.27	
21.23/21.27	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.004844s
21.23/21.27	Time used: 5.00016
21.23/21.27	> Checking if the negation of the conditions of every pending exit is quasi-invariant... NO
21.23/21.27	
21.23/21.27	Proving non-termination of subgraph 1
21.23/21.27	Transitions:
21.23/21.27	<l4, l4, 1 + y_6^0 <= z_7^0 /\ undef82 = 0, {all remain the same}>
21.23/21.27	Variables:
21.23/21.27	y_6^0, z_7^0
21.23/21.27	
21.23/21.27	Checking conditional non-termination of SCC {l4}...
21.23/21.27	EXIT TRANSITIONS:
21.23/21.27	<l4, end, z_7^0 <= y_6^0, {all remain the same}>
21.23/21.27	
21.23/21.27	Solving with 1 template(s).
21.23/21.27	
21.23/21.27	LOG: CALL solveNonLinearGetFirstSolution
21.23/21.27	
21.23/21.27	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012745s
21.23/21.27	Time used: 0.012639
21.23/21.27	
21.23/21.27	LOG: SAT solveNonLinear - Elapsed time: 0.012745s
21.23/21.27	Cost: 0; Total time: 0.012639
21.23/21.27	Minimizing number of undef constraints...
21.23/21.27	
21.23/21.27	LOG: CALL solveNonLinear
21.23/21.27	
21.23/21.27	LOG: RETURN solveNonLinear - Elapsed time: 0.003167s
21.23/21.27	Number of undef constraints reduced!
21.23/21.27	
21.23/21.27	Non-termination implied by a set of quasi-invariant(s):
21.23/21.27	Quasi-invariant at l4: 1 + y_6^0 <= z_7^0
21.23/21.27	
21.23/21.27	Strengthening and disabling EXIT transitions...
21.23/21.27	Closed exits from l4: 1
21.23/21.27	
21.23/21.27	Strengthening and disabling transitions...
21.23/21.27	
21.23/21.27	LOG: CALL solverLinear in Graph for feasibility
21.23/21.27	
21.23/21.27	LOG: RETURN solveLinear in Graph for feasibility
21.23/21.27	Strengthening transition (result): 
21.23/21.27	<l4, l4, 1 + y_6^0 <= z_7^0 /\ undef82 = 0, {all remain the same}>
21.23/21.27	
21.23/21.27	Calling reachability with...
21.23/21.27	Transition: <l2, end, true, {all remain the same}>
21.23/21.27	Conditions: 
21.23/21.27	OPEN EXITS: 
21.23/21.27	<l2, end, true, {all remain the same}>
21.23/21.27	
21.23/21.27	--- Reachability graph ---
21.23/21.27	> Graph without transitions.
21.23/21.27	
21.23/21.27	Calling reachability with...
21.23/21.27	Transition: <l0, l2, true, {all remain the same}>
21.23/21.27	Conditions: 
21.23/21.27	OPEN EXITS: 
21.23/21.27	<l0, l2, true, {all remain the same}>
21.23/21.27	
21.23/21.27	> Conditions are reachable!
21.23/21.27	
21.23/21.27	Program does NOT terminate
21.23/21.27	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
21.23/21.27	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
21.23/21.27	EOF