36.29/36.35	NO
36.29/36.35	
36.29/36.35	Solver Timeout: 4
36.29/36.35	Global Timeout: 300
36.29/36.35	No parsing errors!
36.29/36.35	Init Location: 0
36.29/36.35	Transitions:
36.29/36.35	<l0, l6, true>
36.29/36.35	<l1, l2, (((0 + (~(1) * x_5^0)) + y_6^0) <= 0) /\ (((0 + x_5^0) + (~(1) * y_6^0)) <= 0) /\ (undef1 = undef1), par{Result_4^0 -> undef1}>
36.29/36.35	<l1, l3, (((0 + (~(1) * x_5^0)) + y_6^0) <= 0) /\ (0 <= ((~(1) + x_5^0) + (~(1) * y_6^0))), par{x_5^0 -> (1 + x_5^0)}>
36.29/36.35	<l3, l1, true>
36.29/36.35	<l1, l4, (0 <= ((~(1) + (~(1) * x_5^0)) + y_6^0)), par{x_5^0 -> (1 + x_5^0)}>
36.29/36.35	<l4, l1, true>
36.29/36.35	<l5, l1, true>
36.29/36.35	<l6, l5, true>
36.29/36.35	
36.29/36.35	Fresh variables:
36.29/36.35	undef1, 
36.29/36.35	
36.29/36.35	Undef variables:
36.29/36.35	undef1, 
36.29/36.35	
36.29/36.35	Abstraction variables:
36.29/36.35	
36.29/36.35	Exit nodes:
36.29/36.35	
36.29/36.35	Accepting locations:
36.29/36.35	
36.29/36.35	Asserts:
36.29/36.35	
36.29/36.35	Preprocessed LLVMGraph
36.29/36.35	Init Location: 0
36.29/36.35	Transitions:
36.29/36.35	<l0, l1, true>
36.29/36.35	<l1, l2, (((0 + (~(1) * x_5^0)) + y_6^0) <= 0) /\ (((0 + x_5^0) + (~(1) * y_6^0)) <= 0) /\ (undef1 = undef1)>
36.29/36.35	<l1, l1, (((0 + (~(1) * x_5^0)) + y_6^0) <= 0) /\ (0 <= ((~(1) + x_5^0) + (~(1) * y_6^0))), par{x_5^0 -> (1 + x_5^0)}>
36.29/36.35	<l1, l1, (0 <= ((~(1) + (~(1) * x_5^0)) + y_6^0)), par{x_5^0 -> (1 + x_5^0)}>
36.29/36.35	
36.29/36.35	Fresh variables:
36.29/36.35	undef1, 
36.29/36.35	
36.29/36.35	Undef variables:
36.29/36.35	undef1, 
36.29/36.35	
36.29/36.35	Abstraction variables:
36.29/36.35	
36.29/36.35	Exit nodes:
36.29/36.35	
36.29/36.35	Accepting locations:
36.29/36.35	
36.29/36.35	Asserts:
36.29/36.35	
36.29/36.35	*************************************************************
36.29/36.35	*******************************************************************************************
36.29/36.35	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
36.29/36.35	*******************************************************************************************
36.29/36.35	
36.29/36.35	Init Location: 0
36.29/36.35	Graph 0:
36.29/36.35	Transitions:
36.29/36.35	Variables:
36.29/36.35	
36.29/36.35	Graph 1:
36.29/36.35	Transitions:
36.29/36.35	<l1, l1, 1 + y_6^0 <= x_5^0, {x_5^0 -> 1 + x_5^0, rest remain the same}>
36.29/36.35	<l1, l1, 1 + x_5^0 <= y_6^0, {x_5^0 -> 1 + x_5^0, rest remain the same}>
36.29/36.35	Variables:
36.29/36.35	x_5^0, y_6^0
36.29/36.35	
36.29/36.35	Graph 2:
36.29/36.35	Transitions:
36.29/36.35	Variables:
36.29/36.35	
36.29/36.35	Precedence: 
36.29/36.35	Graph 0
36.29/36.35	
36.29/36.35	Graph 1
36.29/36.35	<l0, l1, true, {all remain the same}>
36.29/36.35	
36.29/36.35	Graph 2
36.29/36.35	<l1, l2, x_5^0 = y_6^0, {all remain the same}>
36.29/36.35	
36.29/36.35	Map Locations to Subgraph:
36.29/36.35	( 0 , 0 )
36.29/36.35	( 1 , 1 )
36.29/36.35	( 2 , 2 )
36.29/36.35	
36.29/36.35	*******************************************************************************************
36.29/36.35	********************************    CHECKING ASSERTIONS    ********************************
36.29/36.35	*******************************************************************************************
36.29/36.35	
36.29/36.35	Proving termination of subgraph 0
36.29/36.35	Proving termination of subgraph 1
36.29/36.35	Checking unfeasibility...
36.29/36.35	Time used: 0.003198
36.29/36.35	
36.29/36.35	Checking conditional termination of SCC {l1}...
36.29/36.35	
36.29/36.35	LOG: CALL solveLinear
36.29/36.35	
36.29/36.35	LOG: RETURN solveLinear - Elapsed time: 0.001348s
36.29/36.35	Ranking function: 1 - x_5^0 + y_6^0
36.29/36.35	New Graphs: 
36.29/36.35	Transitions:
36.29/36.35	<l1, l1, 1 + y_6^0 <= x_5^0, {x_5^0 -> 1 + x_5^0, rest remain the same}>
36.29/36.35	Variables:
36.29/36.35	x_5^0, y_6^0
36.29/36.35	Checking conditional termination of SCC {l1}...
36.29/36.35	
36.29/36.35	LOG: CALL solveLinear
36.29/36.35	
36.29/36.35	LOG: RETURN solveLinear - Elapsed time: 0.000620s
36.29/36.35	
36.29/36.35	LOG: CALL solveLinear
36.29/36.35	
36.29/36.35	LOG: RETURN solveLinear - Elapsed time: 0.001738s
36.29/36.35	Trying to remove transition: <l1, l1, 1 + y_6^0 <= x_5^0, {x_5^0 -> 1 + x_5^0, rest remain the same}>
36.29/36.35	Solving with 1 template(s).
36.29/36.35	
36.29/36.35	LOG: CALL solveNonLinearGetFirstSolution
36.29/36.35	
36.29/36.35	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004737s
36.29/36.35	Time used: 0.004603
36.29/36.35	Solving with 1 template(s).
36.29/36.35	
36.29/36.35	LOG: CALL solveNonLinearGetFirstSolution
36.29/36.35	
36.29/36.35	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008473s
36.29/36.35	Time used: 0.008154
36.29/36.35	Improving Solution with cost 1 ...
36.29/36.35	
36.29/36.35	LOG: CALL solveNonLinearGetNextSolution
36.29/36.35	
36.29/36.35	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.018267s
36.29/36.35	Time used: 0.01826
36.29/36.35	
36.29/36.35	LOG: SAT solveNonLinear - Elapsed time: 0.026739s
36.29/36.35	Cost: 1; Total time: 0.026414
36.29/36.35	Failed at location 1: x_5^0 <= y_6^0
36.29/36.35	Before Improving: 
36.29/36.35	Quasi-invariant at l1: x_5^0 <= y_6^0
36.29/36.35	Optimizing invariants...
36.29/36.35	
36.29/36.35	LOG: CALL solveLinear
36.29/36.35	
36.29/36.35	LOG: RETURN solveLinear - Elapsed time: 0.002513s
36.29/36.35	Remaining time after improvement: 0.999055
36.29/36.35	Termination implied by a set of quasi-invariant(s):
36.29/36.35	Quasi-invariant at l1: x_5^0 <= y_6^0
36.29/36.35	[ Invariant Graph ]
36.29/36.35	Strengthening and disabling transitions...
36.29/36.35	
36.29/36.35	LOG: CALL solverLinear in Graph for feasibility
36.29/36.35	
36.29/36.35	LOG: RETURN solveLinear in Graph for feasibility
36.29/36.35	It's unfeasible. Removing transition: 
36.29/36.35	<l1, l1, 1 + y_6^0 <= x_5^0, {x_5^0 -> 1 + x_5^0, rest remain the same}>
36.29/36.36	
36.29/36.36	LOG: CALL solverLinear in Graph for feasibility
36.29/36.36	
36.29/36.36	LOG: RETURN solveLinear in Graph for feasibility
36.29/36.36	Strengthening transition (result): 
36.29/36.36	<l1, l1, 1 + x_5^0 <= y_6^0, {x_5^0 -> 1 + x_5^0, rest remain the same}>
36.29/36.36	[ Termination Graph ]
36.29/36.36	Strengthening and disabling transitions...
36.29/36.36	> It's unfeasible. Removing transition: 
36.29/36.36	<l1, l1, 1 + y_6^0 <= x_5^0, {x_5^0 -> 1 + x_5^0, rest remain the same}>
36.29/36.36	New Graphs: 
36.29/36.36	Calling Safety with literal x_5^0 <= y_6^0 and entry <l0, l1, true, {all remain the same}>
36.29/36.36	
36.29/36.36	LOG: CALL check - Post:x_5^0 <= y_6^0 - Process 1
36.29/36.36	* Exit transition: <l0, l1, true, {all remain the same}>
36.29/36.36	* Postcondition  : x_5^0 <= y_6^0
36.29/36.36	
36.29/36.36	LOG: CALL solveLinear
36.29/36.36	
36.29/36.36	LOG: RETURN solveLinear - Elapsed time: 0.000330s
36.29/36.36	> Postcondition is not implied!
36.29/36.36	
36.29/36.36	LOG: RETURN check - Elapsed time: 0.000400s
36.29/36.36	INVARIANTS: 
36.29/36.36	1: 
36.29/36.36	Quasi-INVARIANTS to narrow Graph: 
36.29/36.36	1: x_5^0 <= y_6^0 , 
36.29/36.36	Narrowing transition: 
36.29/36.36	<l1, l1, 1 + y_6^0 <= x_5^0, {x_5^0 -> 1 + x_5^0, rest remain the same}>
36.29/36.36	
36.29/36.36	LOG: Narrow transition size 1
36.29/36.36	It's unfeasible. Removing transition: 
36.29/36.36	<l1, l1, 1 + x_5^0 <= y_6^0, {x_5^0 -> 1 + x_5^0, rest remain the same}>
36.29/36.36	invGraph after Narrowing: 
36.29/36.36	Transitions:
36.29/36.36	<l1, l1, 1 + y_6^0 <= x_5^0, {x_5^0 -> 1 + x_5^0, rest remain the same}>
36.29/36.36	Variables:
36.29/36.36	x_5^0, y_6^0
36.29/36.36	Checking conditional termination of SCC {l1}...
36.29/36.36	
36.29/36.36	LOG: CALL solveLinear
36.29/36.36	
36.29/36.36	LOG: RETURN solveLinear - Elapsed time: 0.000613s
36.29/36.36	
36.29/36.36	LOG: CALL solveLinear
36.29/36.36	
36.29/36.36	LOG: RETURN solveLinear - Elapsed time: 0.001728s
36.29/36.36	Trying to remove transition: <l1, l1, 1 + y_6^0 <= x_5^0, {x_5^0 -> 1 + x_5^0, rest remain the same}>
36.29/36.36	Solving with 1 template(s).
36.29/36.36	
36.29/36.36	LOG: CALL solveNonLinearGetFirstSolution
36.29/36.36	
36.29/36.36	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004427s
36.29/36.36	Time used: 0.004296
36.29/36.36	Solving with 1 template(s).
36.29/36.36	
36.29/36.36	LOG: CALL solveNonLinearGetFirstSolution
36.29/36.36	
36.29/36.36	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002098s
36.29/36.36	Time used: 4.00156
36.29/36.36	Solving with 2 template(s).
36.29/36.36	
36.29/36.36	LOG: CALL solveNonLinearGetFirstSolution
36.29/36.36	
36.29/36.36	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005829s
36.29/36.36	Time used: 4.00073
36.29/36.36	Solving with 3 template(s).
36.29/36.36	
36.29/36.36	LOG: CALL solveNonLinearGetFirstSolution
36.29/36.36	
36.29/36.36	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.007123s
36.29/36.36	Time used: 1.00379
36.29/36.36	Solving with 1 template(s).
36.29/36.36	
36.29/36.36	LOG: CALL solveNonLinearGetFirstSolution
36.29/36.36	
36.29/36.36	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009314s
36.29/36.36	Time used: 0.00626
36.29/36.36	Improving Solution with cost 1 ...
36.29/36.36	
36.29/36.36	LOG: CALL solveNonLinearGetNextSolution
36.29/36.36	
36.29/36.36	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.010725s
36.29/36.36	Time used: 0.010719
36.29/36.36	
36.29/36.36	LOG: SAT solveNonLinear - Elapsed time: 0.020039s
36.29/36.36	Cost: 1; Total time: 0.016979
36.29/36.36	Quasi-ranking function: 50000 - x_5^0 + y_6^0
36.29/36.36	New Graphs: 
36.29/36.36	Transitions:
36.29/36.36	<l1, l1, 50001 + y_6^0 <= x_5^0, {x_5^0 -> 1 + x_5^0, rest remain the same}>
36.29/36.36	Variables:
36.29/36.36	x_5^0, y_6^0
36.29/36.36	Checking conditional termination of SCC {l1}...
36.29/36.36	
36.29/36.36	LOG: CALL solveLinear
36.29/36.36	
36.29/36.36	LOG: RETURN solveLinear - Elapsed time: 0.000460s
36.29/36.36	
36.29/36.36	LOG: CALL solveLinear
36.29/36.36	
36.29/36.36	LOG: RETURN solveLinear - Elapsed time: 0.001733s
36.29/36.36	Trying to remove transition: <l1, l1, 50001 + y_6^0 <= x_5^0, {x_5^0 -> 1 + x_5^0, rest remain the same}>
36.29/36.36	Solving with 1 template(s).
36.29/36.36	
36.29/36.36	LOG: CALL solveNonLinearGetFirstSolution
36.29/36.36	
36.29/36.36	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005228s
36.29/36.36	Time used: 0.005092
36.29/36.36	Solving with 1 template(s).
36.29/36.36	
36.29/36.36	LOG: CALL solveNonLinearGetFirstSolution
36.29/36.36	
36.29/36.36	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.003122s
36.29/36.36	Time used: 4.00266
36.29/36.36	Solving with 2 template(s).
36.29/36.36	
36.29/36.36	LOG: CALL solveNonLinearGetFirstSolution
36.29/36.36	
36.29/36.36	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005667s
36.29/36.36	Time used: 4.00064
36.29/36.36	Solving with 3 template(s).
36.29/36.36	
36.29/36.36	LOG: CALL solveNonLinearGetFirstSolution
36.29/36.36	
36.29/36.36	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.003574s
36.29/36.36	Time used: 1.00059
36.29/36.36	Solving with 1 template(s).
36.29/36.36	
36.29/36.36	LOG: CALL solveNonLinearGetFirstSolution
36.29/36.36	
36.29/36.36	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010306s
36.29/36.36	Time used: 0.007129
36.29/36.36	Improving Solution with cost 1 ...
36.29/36.36	
36.29/36.36	LOG: CALL solveNonLinearGetNextSolution
36.29/36.36	
36.29/36.36	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.012789s
36.29/36.36	Time used: 0.012783
36.29/36.36	
36.29/36.36	LOG: SAT solveNonLinear - Elapsed time: 0.023095s
36.29/36.36	Cost: 1; Total time: 0.019912
36.29/36.36	Termination implied by a set of invariant(s):
36.29/36.36	Invariant at l1: 1 + y_6^0 <= x_5^0
36.29/36.36	[ Invariant Graph ]
36.29/36.36	Strengthening and disabling transitions...
36.29/36.36	
36.29/36.36	LOG: CALL solverLinear in Graph for feasibility
36.29/36.36	
36.29/36.36	LOG: RETURN solveLinear in Graph for feasibility
36.29/36.36	Strengthening transition (result): 
36.29/36.36	<l1, l1, 1 + y_6^0 <= x_5^0, {x_5^0 -> 1 + x_5^0, rest remain the same}>
36.29/36.36	[ Termination Graph ]
36.29/36.36	Strengthening and disabling transitions...
36.29/36.36	
36.29/36.36	LOG: CALL solverLinear in Graph for feasibility
36.29/36.36	
36.29/36.36	LOG: RETURN solveLinear in Graph for feasibility
36.29/36.36	Strengthening transition (result): 
36.29/36.36	<l1, l1, 50001 + y_6^0 <= x_5^0, {x_5^0 -> 1 + x_5^0, rest remain the same}>
36.29/36.36	Quasi-ranking function: 50000 - x_5^0
36.29/36.36	New Graphs: 
36.29/36.36	Transitions:
36.29/36.36	<l1, l1, 50001 <= x_5^0 /\ 50001 + y_6^0 <= x_5^0, {x_5^0 -> 1 + x_5^0, rest remain the same}>
36.29/36.36	Variables:
36.29/36.36	x_5^0, y_6^0
36.29/36.36	Checking conditional termination of SCC {l1}...
36.29/36.36	
36.29/36.36	LOG: CALL solveLinear
36.29/36.36	
36.29/36.36	LOG: RETURN solveLinear - Elapsed time: 0.000541s
36.29/36.36	
36.29/36.36	LOG: CALL solveLinear
36.29/36.36	
36.29/36.36	LOG: RETURN solveLinear - Elapsed time: 0.002049s
36.29/36.36	Trying to remove transition: <l1, l1, 50001 <= x_5^0 /\ 50001 + y_6^0 <= x_5^0, {x_5^0 -> 1 + x_5^0, rest remain the same}>
36.29/36.36	Solving with 1 template(s).
36.29/36.36	
36.29/36.36	LOG: CALL solveNonLinearGetFirstSolution
36.29/36.36	
36.29/36.36	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005009s
36.29/36.36	Time used: 0.004864
36.29/36.36	Solving with 1 template(s).
36.29/36.36	
36.29/36.36	LOG: CALL solveNonLinearGetFirstSolution
36.29/36.36	
36.29/36.36	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002591s
36.29/36.36	Time used: 4.0014
36.29/36.36	Solving with 2 template(s).
36.29/36.36	
36.29/36.36	LOG: CALL solveNonLinearGetFirstSolution
36.29/36.36	
36.29/36.36	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005080s
36.29/36.36	Time used: 4.00064
36.29/36.36	Solving with 3 template(s).
36.29/36.36	
36.29/36.36	LOG: CALL solveNonLinearGetFirstSolution
36.29/36.36	
36.29/36.36	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.003950s
36.29/36.36	Time used: 1.00056
36.29/36.36	Solving with 1 template(s).
36.29/36.36	
36.29/36.36	LOG: CALL solveNonLinearGetFirstSolution
36.29/36.36	
36.29/36.36	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010855s
36.29/36.36	Time used: 0.007881
36.29/36.36	Improving Solution with cost 1 ...
36.29/36.36	
36.29/36.36	LOG: CALL solveNonLinearGetNextSolution
36.29/36.36	
36.29/36.36	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.009477s
36.29/36.36	Time used: 0.009468
36.29/36.36	
36.29/36.36	LOG: SAT solveNonLinear - Elapsed time: 0.020332s
36.29/36.36	Cost: 1; Total time: 0.017349
36.29/36.36	Termination implied by a set of invariant(s):
36.29/36.36	Invariant at l1: y_6^0 <= 1 + x_5^0
36.29/36.36	[ Invariant Graph ]
36.29/36.36	Strengthening and disabling transitions...
36.29/36.36	
36.29/36.36	LOG: CALL solverLinear in Graph for feasibility
36.29/36.36	
36.29/36.36	LOG: RETURN solveLinear in Graph for feasibility
36.29/36.36	Strengthening transition (result): 
36.29/36.36	<l1, l1, 1 + y_6^0 <= x_5^0, {x_5^0 -> 1 + x_5^0, rest remain the same}>
36.29/36.36	[ Termination Graph ]
36.29/36.36	Strengthening and disabling transitions...
36.29/36.36	
36.29/36.36	LOG: CALL solverLinear in Graph for feasibility
36.29/36.36	
36.29/36.36	LOG: RETURN solveLinear in Graph for feasibility
36.29/36.36	Strengthening transition (result): 
36.29/36.36	<l1, l1, 50001 <= x_5^0 /\ 50001 + y_6^0 <= x_5^0, {x_5^0 -> 1 + x_5^0, rest remain the same}>
36.29/36.36	Quasi-ranking function: 50000 - x_5^0 - y_6^0
36.29/36.36	New Graphs: 
36.29/36.36	Transitions:
36.29/36.36	<l1, l1, 50001 <= x_5^0 /\ 50001 + y_6^0 <= x_5^0 /\ 50001 <= x_5^0 + y_6^0, {x_5^0 -> 1 + x_5^0, rest remain the same}>
36.29/36.36	Variables:
36.29/36.36	x_5^0, y_6^0
36.29/36.36	Checking conditional termination of SCC {l1}...
36.29/36.36	
36.29/36.36	LOG: CALL solveLinear
36.29/36.36	
36.29/36.36	LOG: RETURN solveLinear - Elapsed time: 0.000644s
36.29/36.36	
36.29/36.36	LOG: CALL solveLinear
36.29/36.36	
36.29/36.36	LOG: RETURN solveLinear - Elapsed time: 0.002431s
36.29/36.36	Trying to remove transition: <l1, l1, 50001 <= x_5^0 /\ 50001 + y_6^0 <= x_5^0 /\ 50001 <= x_5^0 + y_6^0, {x_5^0 -> 1 + x_5^0, rest remain the same}>
36.29/36.36	Solving with 1 template(s).
36.29/36.36	
36.29/36.36	LOG: CALL solveNonLinearGetFirstSolution
36.29/36.36	
36.29/36.36	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005862s
36.29/36.36	Time used: 0.005692
36.29/36.36	Solving with 1 template(s).
36.29/36.36	
36.29/36.36	LOG: CALL solveNonLinearGetFirstSolution
36.29/36.36	
36.29/36.36	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.003174s
36.29/36.36	Time used: 4.00266
36.29/36.36	Solving with 2 template(s).
36.29/36.36	
36.29/36.36	LOG: CALL solveNonLinearGetFirstSolution
36.29/36.36	
36.29/36.36	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.004938s
36.29/36.36	Time used: 4.00082
36.29/36.36	Solving with 3 template(s).
36.29/36.36	
36.29/36.36	LOG: CALL solveNonLinearGetFirstSolution
36.29/36.36	
36.29/36.36	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.004018s
36.29/36.36	Time used: 1.00088
36.29/36.36	Solving with 1 template(s).
36.29/36.36	
36.29/36.36	LOG: CALL solveNonLinearGetFirstSolution
36.29/36.36	
36.29/36.36	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010882s
36.29/36.36	Time used: 0.007915
36.29/36.36	
36.29/36.36	Proving non-termination of subgraph 1
36.29/36.36	Transitions:
36.29/36.36	<l1, l1, 1 + y_6^0 <= x_5^0, {x_5^0 -> 1 + x_5^0, rest remain the same}>
36.29/36.36	Variables:
36.29/36.36	x_5^0, y_6^0
36.29/36.36	
36.29/36.36	Checking conditional non-termination of SCC {l1}...
36.29/36.36	EXIT TRANSITIONS:
36.29/36.36	<l1, end, x_5^0 <= y_6^0, {all remain the same}>
36.29/36.36	
36.29/36.36	Solving with 1 template(s).
36.29/36.36	
36.29/36.36	LOG: CALL solveNonLinearGetFirstSolution
36.29/36.36	
36.29/36.36	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005791s
36.29/36.36	Time used: 0.005634
36.29/36.36	Improving Solution with cost 1 ...
36.29/36.36	
36.29/36.36	LOG: CALL solveNonLinearGetNextSolution
36.29/36.36	
36.29/36.36	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.005099s
36.29/36.36	Time used: 0.005094
36.29/36.36	
36.29/36.36	LOG: SAT solveNonLinear - Elapsed time: 0.010890s
36.29/36.36	Cost: 1; Total time: 0.010728
36.29/36.36	Failed at location 1: 1 + y_6^0 <= x_5^0
36.29/36.36	Before Improving: 
36.29/36.36	Quasi-invariant at l1: 1 + y_6^0 <= x_5^0
36.29/36.36	Optimizing invariants...
36.29/36.36	
36.29/36.36	LOG: CALL solveLinear
36.29/36.36	
36.29/36.36	LOG: RETURN solveLinear - Elapsed time: 0.001592s
36.29/36.36	Remaining time after improvement: 0.999009
36.29/36.36	Non-termination implied by a set of quasi-invariant(s):
36.29/36.36	Quasi-invariant at l1: 1 + y_6^0 <= x_5^0
36.29/36.36	
36.29/36.36	Strengthening and disabling EXIT transitions...
36.29/36.36	Closed exits from l1: 1
36.29/36.36	
36.29/36.36	Strengthening and disabling transitions...
36.29/36.36	
36.29/36.36	LOG: CALL solverLinear in Graph for feasibility
36.29/36.36	
36.29/36.36	LOG: RETURN solveLinear in Graph for feasibility
36.29/36.36	Strengthening transition (result): 
36.29/36.36	<l1, l1, 1 + y_6^0 <= x_5^0, {x_5^0 -> 1 + x_5^0, rest remain the same}>
36.29/36.36	
36.29/36.36	Calling reachability with...
36.29/36.36	Transition: <l1, end, true, {all remain the same}>
36.29/36.36	Conditions: 1 + y_6^0 <= x_5^0, 
36.29/36.36	OPEN EXITS: 
36.29/36.36	<l1, end, 1 + y_6^0 <= x_5^0, {all remain the same}>
36.29/36.36	
36.29/36.36	--- Reachability graph ---
36.29/36.36	> Graph without transitions.
36.29/36.36	
36.29/36.36	Calling reachability with...
36.29/36.36	Transition: <l0, l1, true, {all remain the same}>
36.29/36.36	Conditions: 1 + y_6^0 <= x_5^0, 
36.29/36.36	OPEN EXITS: 
36.29/36.36	<l0, l1, 1 + y_6^0 <= x_5^0, {all remain the same}>
36.29/36.36	
36.29/36.36	> Conditions are reachable!
36.29/36.36	
36.29/36.36	Program does NOT terminate
36.29/36.36	/export/starexec/sandbox2/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
36.29/36.36	/export/starexec/sandbox2/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
36.29/36.36	EOF