32.36/32.45	NO
32.36/32.45	
32.36/32.45	Solver Timeout: 4
32.36/32.45	Global Timeout: 300
32.36/32.45	No parsing errors!
32.36/32.45	Init Location: 0
32.36/32.45	Transitions:
32.36/32.45	<l0, l7, true>
32.36/32.45	<l1, l2, true>
32.36/32.45	<l3, l4, ((1 + i_5^0) <= 0) /\ (undef12 = 0) /\ (undef10 = (0 + undef12)), par{Result_4^0 -> (0 + undef10), __cil_tmp4_8^0 -> undef10, __retres3_7^0 -> undef12}>
32.36/32.45	<l3, l5, (0 <= (0 + i_5^0)), par{i_5^0 -> ((0 + (~(1) * d_6^0)) + i_5^0)}>
32.36/32.45	<l5, l3, true>
32.36/32.45	<l2, l4, ((0 + (~(1) * d_6^0)) <= 0) /\ (undef33 = 0) /\ (undef31 = (0 + undef33)), par{Result_4^0 -> (0 + undef31), __cil_tmp4_8^0 -> undef31, __retres3_7^0 -> undef33}>
32.36/32.45	<l2, l3, (0 <= (~(1) + (~(1) * d_6^0)))>
32.36/32.45	<l4, l6, (undef46 = 0) /\ (undef44 = (0 + undef46)), par{Result_4^0 -> (0 + undef44), __cil_tmp2_10^0 -> undef44, __retres1_9^0 -> undef46}>
32.36/32.45	<l7, l1, true>
32.36/32.45	
32.36/32.45	Fresh variables:
32.36/32.45	undef10, undef12, undef31, undef33, undef44, undef46, 
32.36/32.45	
32.36/32.45	Undef variables:
32.36/32.45	undef10, undef12, undef31, undef33, undef44, undef46, 
32.36/32.45	
32.36/32.45	Abstraction variables:
32.36/32.45	
32.36/32.45	Exit nodes:
32.36/32.45	
32.36/32.45	Accepting locations:
32.36/32.45	
32.36/32.45	Asserts:
32.36/32.45	
32.36/32.45	Preprocessed LLVMGraph
32.36/32.45	Init Location: 0
32.36/32.45	Transitions:
32.36/32.45	<l0, l6, ((0 + (~(1) * d_6^0)) <= 0) /\ (undef33 = 0) /\ (undef31 = (0 + undef33)) /\ (undef46 = 0) /\ (undef44 = (0 + undef46))>
32.36/32.45	<l0, l3, (0 <= (~(1) + (~(1) * d_6^0)))>
32.36/32.45	<l3, l6, ((1 + i_5^0) <= 0) /\ (undef12 = 0) /\ (undef10 = (0 + undef12)) /\ (undef46 = 0) /\ (undef44 = (0 + undef46))>
32.36/32.45	<l3, l3, (0 <= (0 + i_5^0)), par{i_5^0 -> ((0 + (~(1) * d_6^0)) + i_5^0)}>
32.36/32.45	
32.36/32.45	Fresh variables:
32.36/32.45	undef10, undef12, undef31, undef33, undef44, undef46, 
32.36/32.45	
32.36/32.45	Undef variables:
32.36/32.45	undef10, undef12, undef31, undef33, undef44, undef46, 
32.36/32.45	
32.36/32.45	Abstraction variables:
32.36/32.45	
32.36/32.45	Exit nodes:
32.36/32.45	
32.36/32.45	Accepting locations:
32.36/32.45	
32.36/32.45	Asserts:
32.36/32.45	
32.36/32.45	*************************************************************
32.36/32.45	*******************************************************************************************
32.36/32.45	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
32.36/32.45	*******************************************************************************************
32.36/32.45	
32.36/32.45	Init Location: 0
32.36/32.45	Graph 0:
32.36/32.45	Transitions:
32.36/32.45	Variables:
32.36/32.45	
32.36/32.45	Graph 1:
32.36/32.45	Transitions:
32.36/32.45	<l3, l3, 0 <= i_5^0, {i_5^0 -> -d_6^0 + i_5^0, rest remain the same}>
32.36/32.45	Variables:
32.36/32.45	d_6^0, i_5^0
32.36/32.45	
32.36/32.45	Graph 2:
32.36/32.45	Transitions:
32.36/32.45	Variables:
32.36/32.45	
32.36/32.45	Precedence: 
32.36/32.45	Graph 0
32.36/32.45	
32.36/32.45	Graph 1
32.36/32.45	<l0, l3, 1 + d_6^0 <= 0, {all remain the same}>
32.36/32.45	
32.36/32.45	Graph 2
32.36/32.45	<l0, l6, 0 <= d_6^0 /\ undef31 = undef33 /\ undef33 = 0 /\ undef44 = undef46 /\ undef46 = 0, {all remain the same}>
32.36/32.45	<l3, l6, 1 + i_5^0 <= 0 /\ undef10 = undef12 /\ undef12 = 0 /\ undef44 = undef46 /\ undef46 = 0, {all remain the same}>
32.36/32.45	
32.36/32.45	Map Locations to Subgraph:
32.36/32.45	( 0 , 0 )
32.36/32.45	( 3 , 1 )
32.36/32.45	( 6 , 2 )
32.36/32.45	
32.36/32.45	*******************************************************************************************
32.36/32.45	********************************    CHECKING ASSERTIONS    ********************************
32.36/32.45	*******************************************************************************************
32.36/32.45	
32.36/32.45	Proving termination of subgraph 0
32.36/32.45	Proving termination of subgraph 1
32.36/32.45	Checking unfeasibility...
32.36/32.45	Time used: 0.002297
32.36/32.45	
32.36/32.45	Checking conditional termination of SCC {l3}...
32.36/32.45	
32.36/32.45	LOG: CALL solveLinear
32.36/32.45	
32.36/32.45	LOG: RETURN solveLinear - Elapsed time: 0.000846s
32.36/32.45	
32.36/32.45	LOG: CALL solveLinear
32.36/32.45	
32.36/32.45	LOG: RETURN solveLinear - Elapsed time: 0.001385s
32.36/32.45	Trying to remove transition: <l3, l3, 0 <= i_5^0, {i_5^0 -> -d_6^0 + i_5^0, rest remain the same}>
32.36/32.45	Solving with 1 template(s).
32.36/32.45	
32.36/32.45	LOG: CALL solveNonLinearGetFirstSolution
32.36/32.45	
32.36/32.45	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004208s
32.36/32.45	Time used: 0.004087
32.36/32.45	Solving with 1 template(s).
32.36/32.45	
32.36/32.45	LOG: CALL solveNonLinearGetFirstSolution
32.36/32.45	
32.36/32.45	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006024s
32.36/32.45	Time used: 0.005716
32.36/32.45	Improving Solution with cost 1 ...
32.36/32.45	
32.36/32.45	LOG: CALL solveNonLinearGetNextSolution
32.36/32.45	
32.36/32.45	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.016234s
32.36/32.45	Time used: 0.016229
32.36/32.45	
32.36/32.45	LOG: SAT solveNonLinear - Elapsed time: 0.022258s
32.36/32.45	Cost: 1; Total time: 0.021945
32.36/32.45	Failed at location 3: 1 + i_5^0 <= 0
32.36/32.45	Before Improving: 
32.36/32.45	Quasi-invariant at l3: 1 + i_5^0 <= 0
32.36/32.45	Optimizing invariants...
32.36/32.45	
32.36/32.45	LOG: CALL solveLinear
32.36/32.45	
32.36/32.45	LOG: RETURN solveLinear - Elapsed time: 0.002457s
32.36/32.45	Remaining time after improvement: 0.998482
32.36/32.45	Termination implied by a set of quasi-invariant(s):
32.36/32.45	Quasi-invariant at l3: 1 + i_5^0 <= 0
32.36/32.45	[ Invariant Graph ]
32.36/32.45	Strengthening and disabling transitions...
32.36/32.45	
32.36/32.45	LOG: CALL solverLinear in Graph for feasibility
32.36/32.45	
32.36/32.45	LOG: RETURN solveLinear in Graph for feasibility
32.36/32.45	It's unfeasible. Removing transition: 
32.36/32.45	<l3, l3, 0 <= i_5^0, {i_5^0 -> -d_6^0 + i_5^0, rest remain the same}>
32.36/32.45	[ Termination Graph ]
32.36/32.45	Strengthening and disabling transitions...
32.36/32.45	> It's unfeasible. Removing transition: 
32.36/32.45	<l3, l3, 0 <= i_5^0, {i_5^0 -> -d_6^0 + i_5^0, rest remain the same}>
32.36/32.45	New Graphs: 
32.36/32.45	Calling Safety with literal 1 + i_5^0 <= 0 and entry <l0, l3, 1 + d_6^0 <= 0, {all remain the same}>
32.36/32.45	
32.36/32.45	LOG: CALL check - Post:1 + i_5^0 <= 0 - Process 1
32.36/32.45	* Exit transition: <l0, l3, 1 + d_6^0 <= 0, {all remain the same}>
32.36/32.45	* Postcondition  : 1 + i_5^0 <= 0
32.36/32.45	
32.36/32.45	LOG: CALL solveLinear
32.36/32.45	
32.36/32.45	LOG: RETURN solveLinear - Elapsed time: 0.000356s
32.36/32.45	> Postcondition is not implied!
32.36/32.45	
32.36/32.45	LOG: RETURN check - Elapsed time: 0.000428s
32.36/32.45	INVARIANTS: 
32.36/32.45	3: 
32.36/32.45	Quasi-INVARIANTS to narrow Graph: 
32.36/32.45	3: 1 + i_5^0 <= 0 , 
32.36/32.45	Narrowing transition: 
32.36/32.45	<l3, l3, 0 <= i_5^0, {i_5^0 -> -d_6^0 + i_5^0, rest remain the same}>
32.36/32.45	
32.36/32.45	LOG: Narrow transition size 1
32.36/32.45	invGraph after Narrowing: 
32.36/32.45	Transitions:
32.36/32.45	<l3, l3, 0 <= i_5^0, {i_5^0 -> -d_6^0 + i_5^0, rest remain the same}>
32.36/32.45	Variables:
32.36/32.45	d_6^0, i_5^0
32.36/32.45	Checking conditional termination of SCC {l3}...
32.36/32.45	
32.36/32.45	LOG: CALL solveLinear
32.36/32.45	
32.36/32.45	LOG: RETURN solveLinear - Elapsed time: 0.000776s
32.36/32.45	
32.36/32.45	LOG: CALL solveLinear
32.36/32.45	
32.36/32.45	LOG: RETURN solveLinear - Elapsed time: 0.001409s
32.36/32.45	Trying to remove transition: <l3, l3, 0 <= i_5^0, {i_5^0 -> -d_6^0 + i_5^0, rest remain the same}>
32.36/32.45	Solving with 1 template(s).
32.36/32.45	
32.36/32.45	LOG: CALL solveNonLinearGetFirstSolution
32.36/32.45	
32.36/32.45	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003663s
32.36/32.45	Time used: 0.003542
32.36/32.45	Solving with 1 template(s).
32.36/32.45	
32.36/32.45	LOG: CALL solveNonLinearGetFirstSolution
32.36/32.45	
32.36/32.45	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006484s
32.36/32.45	Time used: 0.006206
32.36/32.45	Solving with 2 template(s).
32.36/32.45	
32.36/32.45	LOG: CALL solveNonLinearGetFirstSolution
32.36/32.45	
32.36/32.45	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001735s
32.36/32.45	Time used: 4.00139
32.36/32.45	Solving with 3 template(s).
32.36/32.45	
32.36/32.45	LOG: CALL solveNonLinearGetFirstSolution
32.36/32.45	
32.36/32.45	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.004302s
32.36/32.45	Time used: 1.00047
32.36/32.45	Solving with 1 template(s).
32.36/32.45	
32.36/32.45	LOG: CALL solveNonLinearGetFirstSolution
32.36/32.45	
32.36/32.45	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010278s
32.36/32.45	Time used: 0.006857
32.36/32.45	Improving Solution with cost 1 ...
32.36/32.45	
32.36/32.45	LOG: CALL solveNonLinearGetNextSolution
32.36/32.45	
32.36/32.45	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.012656s
32.36/32.45	Time used: 0.012652
32.36/32.45	
32.36/32.45	LOG: SAT solveNonLinear - Elapsed time: 0.022933s
32.36/32.45	Cost: 1; Total time: 0.019509
32.36/32.45	Termination implied by a set of invariant(s):
32.36/32.45	Invariant at l3: 1 + d_6^0 <= 0
32.36/32.45	[ Invariant Graph ]
32.36/32.45	Strengthening and disabling transitions...
32.36/32.45	
32.36/32.45	LOG: CALL solverLinear in Graph for feasibility
32.36/32.45	
32.36/32.45	LOG: RETURN solveLinear in Graph for feasibility
32.36/32.45	Strengthening transition (result): 
32.36/32.45	<l3, l3, 1 + d_6^0 <= 0 /\ 0 <= i_5^0, {i_5^0 -> -d_6^0 + i_5^0, rest remain the same}>
32.36/32.45	[ Termination Graph ]
32.36/32.45	Strengthening and disabling transitions...
32.36/32.45	
32.36/32.45	LOG: CALL solverLinear in Graph for feasibility
32.36/32.45	
32.36/32.45	LOG: RETURN solveLinear in Graph for feasibility
32.36/32.45	Strengthening transition (result): 
32.36/32.45	<l3, l3, 1 + d_6^0 <= 0 /\ 0 <= i_5^0, {i_5^0 -> -d_6^0 + i_5^0, rest remain the same}>
32.36/32.45	Quasi-ranking function: 50000 - i_5^0
32.36/32.45	New Graphs: 
32.36/32.45	Transitions:
32.36/32.45	<l3, l3, 1 + d_6^0 <= 0 /\ 50001 <= i_5^0, {i_5^0 -> -d_6^0 + i_5^0, rest remain the same}>
32.36/32.45	Variables:
32.36/32.45	d_6^0, i_5^0
32.36/32.45	Checking conditional termination of SCC {l3}...
32.36/32.45	
32.36/32.45	LOG: CALL solveLinear
32.36/32.45	
32.36/32.45	LOG: RETURN solveLinear - Elapsed time: 0.000533s
32.36/32.45	
32.36/32.45	LOG: CALL solveLinear
32.36/32.45	
32.36/32.45	LOG: RETURN solveLinear - Elapsed time: 0.001974s
32.36/32.45	Trying to remove transition: <l3, l3, 1 + d_6^0 <= 0 /\ 50001 <= i_5^0, {i_5^0 -> -d_6^0 + i_5^0, rest remain the same}>
32.36/32.45	Solving with 1 template(s).
32.36/32.45	
32.36/32.45	LOG: CALL solveNonLinearGetFirstSolution
32.36/32.45	
32.36/32.45	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006512s
32.36/32.45	Time used: 0.006362
32.36/32.45	Solving with 1 template(s).
32.36/32.45	
32.36/32.45	LOG: CALL solveNonLinearGetFirstSolution
32.36/32.45	
32.36/32.45	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.003953s
32.36/32.45	Time used: 4.00366
32.36/32.45	Solving with 2 template(s).
32.36/32.45	
32.36/32.45	LOG: CALL solveNonLinearGetFirstSolution
32.36/32.45	
32.36/32.45	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.007550s
32.36/32.45	Time used: 4.00088
32.36/32.45	Solving with 3 template(s).
32.36/32.45	
32.36/32.45	LOG: CALL solveNonLinearGetFirstSolution
32.36/32.45	
32.36/32.45	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.027134s
32.36/32.45	Time used: 1.00065
32.36/32.45	Solving with 1 template(s).
32.36/32.45	
32.36/32.45	LOG: CALL solveNonLinearGetFirstSolution
32.36/32.45	
32.36/32.45	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011557s
32.36/32.45	Time used: 0.008456
32.36/32.45	Improving Solution with cost 1 ...
32.36/32.45	
32.36/32.45	LOG: CALL solveNonLinearGetNextSolution
32.36/32.45	
32.36/32.45	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.011939s
32.36/32.45	Time used: 0.011934
32.36/32.45	
32.36/32.45	LOG: SAT solveNonLinear - Elapsed time: 0.023496s
32.36/32.45	Cost: 1; Total time: 0.02039
32.36/32.45	Termination implied by a set of invariant(s):
32.36/32.45	Invariant at l3: 0 <= 1 + i_5^0
32.36/32.45	[ Invariant Graph ]
32.36/32.45	Strengthening and disabling transitions...
32.36/32.45	
32.36/32.45	LOG: CALL solverLinear in Graph for feasibility
32.36/32.45	
32.36/32.45	LOG: RETURN solveLinear in Graph for feasibility
32.36/32.45	Strengthening transition (result): 
32.36/32.45	<l3, l3, 1 + d_6^0 <= 0 /\ 0 <= i_5^0, {i_5^0 -> -d_6^0 + i_5^0, rest remain the same}>
32.36/32.45	[ Termination Graph ]
32.36/32.45	Strengthening and disabling transitions...
32.36/32.45	
32.36/32.45	LOG: CALL solverLinear in Graph for feasibility
32.36/32.45	
32.36/32.45	LOG: RETURN solveLinear in Graph for feasibility
32.36/32.45	Strengthening transition (result): 
32.36/32.45	<l3, l3, 1 + d_6^0 <= 0 /\ 50001 <= i_5^0, {i_5^0 -> -d_6^0 + i_5^0, rest remain the same}>
32.36/32.45	Quasi-ranking function: 50000 - d_6^0 - i_5^0
32.36/32.45	New Graphs: 
32.36/32.45	Transitions:
32.36/32.45	<l3, l3, 1 + d_6^0 <= 0 /\ 50001 <= d_6^0 + i_5^0 /\ 50001 <= i_5^0, {i_5^0 -> -d_6^0 + i_5^0, rest remain the same}>
32.36/32.45	Variables:
32.36/32.45	d_6^0, i_5^0
32.36/32.45	Checking conditional termination of SCC {l3}...
32.36/32.45	
32.36/32.45	LOG: CALL solveLinear
32.36/32.45	
32.36/32.45	LOG: RETURN solveLinear - Elapsed time: 0.000618s
32.36/32.45	
32.36/32.45	LOG: CALL solveLinear
32.36/32.45	
32.36/32.45	LOG: RETURN solveLinear - Elapsed time: 0.002502s
32.36/32.45	Trying to remove transition: <l3, l3, 1 + d_6^0 <= 0 /\ 50001 <= d_6^0 + i_5^0 /\ 50001 <= i_5^0, {i_5^0 -> -d_6^0 + i_5^0, rest remain the same}>
32.36/32.45	Solving with 1 template(s).
32.36/32.45	
32.36/32.45	LOG: CALL solveNonLinearGetFirstSolution
32.36/32.45	
32.36/32.45	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008001s
32.36/32.45	Time used: 0.007846
32.36/32.45	Solving with 1 template(s).
32.36/32.45	
32.36/32.45	LOG: CALL solveNonLinearGetFirstSolution
32.36/32.45	
32.36/32.45	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.004152s
32.36/32.45	Time used: 4.00384
32.36/32.45	Solving with 2 template(s).
32.36/32.45	
32.36/32.45	LOG: CALL solveNonLinearGetFirstSolution
32.36/32.45	
32.36/32.45	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.007928s
32.36/32.45	Time used: 4.00212
32.36/32.45	Solving with 3 template(s).
32.36/32.45	
32.36/32.45	LOG: CALL solveNonLinearGetFirstSolution
32.36/32.45	
32.36/32.45	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.027746s
32.36/32.45	Time used: 1.00093
32.36/32.45	Solving with 1 template(s).
32.36/32.45	
32.36/32.45	LOG: CALL solveNonLinearGetFirstSolution
32.36/32.45	
32.36/32.45	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013079s
32.36/32.45	Time used: 0.009337
32.36/32.45	Improving Solution with cost 1 ...
32.36/32.45	
32.36/32.45	LOG: CALL solveNonLinearGetNextSolution
32.36/32.45	
32.36/32.45	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.010697s
32.36/32.45	Time used: 0.010692
32.36/32.45	
32.36/32.45	LOG: SAT solveNonLinear - Elapsed time: 0.023776s
32.36/32.45	Cost: 1; Total time: 0.020029
32.36/32.45	Quasi-ranking function: 50000 + d_6^0 - i_5^0
32.36/32.45	New Graphs: 
32.36/32.45	Transitions:
32.36/32.45	<l3, l3, 1 + d_6^0 <= 0 /\ 50001 + d_6^0 <= i_5^0 /\ 50001 <= d_6^0 + i_5^0 /\ 50001 <= i_5^0, {i_5^0 -> -d_6^0 + i_5^0, rest remain the same}>
32.36/32.45	Variables:
32.36/32.45	d_6^0, i_5^0
32.36/32.45	Checking conditional termination of SCC {l3}...
32.36/32.45	
32.36/32.45	LOG: CALL solveLinear
32.36/32.45	
32.36/32.45	LOG: RETURN solveLinear - Elapsed time: 0.000747s
32.36/32.45	
32.36/32.45	LOG: CALL solveLinear
32.36/32.45	
32.36/32.45	LOG: RETURN solveLinear - Elapsed time: 0.002909s
32.36/32.45	Trying to remove transition: <l3, l3, 1 + d_6^0 <= 0 /\ 50001 + d_6^0 <= i_5^0 /\ 50001 <= d_6^0 + i_5^0 /\ 50001 <= i_5^0, {i_5^0 -> -d_6^0 + i_5^0, rest remain the same}>
32.36/32.45	Solving with 1 template(s).
32.36/32.45	
32.36/32.45	LOG: CALL solveNonLinearGetFirstSolution
32.36/32.45	
32.36/32.45	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006876s
32.36/32.45	Time used: 0.006714
32.36/32.45	Solving with 1 template(s).
32.36/32.45	
32.36/32.45	LOG: CALL solveNonLinearGetFirstSolution
32.36/32.45	
32.36/32.45	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005490s
32.36/32.45	Time used: 4.00194
32.36/32.45	Solving with 2 template(s).
32.36/32.45	
32.36/32.45	LOG: CALL solveNonLinearGetFirstSolution
32.36/32.45	
32.36/32.45	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.006095s
32.36/32.45	Time used: 4.00131
32.36/32.45	Solving with 3 template(s).
32.36/32.45	
32.36/32.45	LOG: CALL solveNonLinearGetFirstSolution
32.36/32.45	
32.36/32.45	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.029909s
32.36/32.45	Time used: 1.00112
32.36/32.45	Solving with 1 template(s).
32.36/32.45	
32.36/32.45	LOG: CALL solveNonLinearGetFirstSolution
32.36/32.45	
32.36/32.45	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011979s
32.36/32.45	Time used: 0.008511
32.36/32.45	
32.36/32.45	Proving non-termination of subgraph 1
32.36/32.45	Transitions:
32.36/32.45	<l3, l3, 0 <= i_5^0, {i_5^0 -> -d_6^0 + i_5^0, rest remain the same}>
32.36/32.45	Variables:
32.36/32.45	d_6^0, i_5^0
32.36/32.45	
32.36/32.45	Checking conditional non-termination of SCC {l3}...
32.36/32.45	EXIT TRANSITIONS:
32.36/32.45	<l3, end, 1 + i_5^0 <= 0, {all remain the same}>
32.36/32.45	
32.36/32.45	Solving with 1 template(s).
32.36/32.45	
32.36/32.45	LOG: CALL solveNonLinearGetFirstSolution
32.36/32.45	
32.36/32.45	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005396s
32.36/32.45	Time used: 0.005294
32.36/32.45	Solving with 2 template(s).
32.36/32.45	
32.36/32.45	LOG: CALL solveNonLinearGetFirstSolution
32.36/32.45	
32.36/32.45	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.016580s
32.36/32.45	Time used: 0.016281
32.36/32.45	Improving Solution with cost 1 ...
32.36/32.45	
32.36/32.45	LOG: CALL solveNonLinearGetNextSolution
32.36/32.45	
32.36/32.45	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.015363s
32.36/32.45	Time used: 0.015356
32.36/32.45	
32.36/32.45	LOG: SAT solveNonLinear - Elapsed time: 0.031943s
32.36/32.45	Cost: 1; Total time: 0.031637
32.36/32.45	Failed at location 3: 1 <= i_5^0
32.36/32.45	Before Improving: 
32.36/32.45	Quasi-invariant at l3: 1 <= i_5^0
32.36/32.45	Quasi-invariant at l3: d_6^0 <= 0
32.36/32.45	Optimizing invariants...
32.36/32.45	
32.36/32.45	LOG: CALL solveLinear
32.36/32.45	
32.36/32.45	LOG: RETURN solveLinear - Elapsed time: 0.003917s
32.36/32.45	Remaining time after improvement: 0.998325
32.36/32.45	Non-termination implied by a set of quasi-invariant(s):
32.36/32.45	Quasi-invariant at l3: 1 <= i_5^0
32.36/32.45	Quasi-invariant at l3: d_6^0 <= 0
32.36/32.45	
32.36/32.45	Strengthening and disabling EXIT transitions...
32.36/32.45	Closed exits from l3: 1
32.36/32.45	
32.36/32.45	Strengthening and disabling transitions...
32.36/32.45	
32.36/32.45	LOG: CALL solverLinear in Graph for feasibility
32.36/32.45	
32.36/32.45	LOG: RETURN solveLinear in Graph for feasibility
32.36/32.45	Strengthening transition (result): 
32.36/32.45	<l3, l3, 1 <= i_5^0 /\ d_6^0 <= 0, {i_5^0 -> -d_6^0 + i_5^0, rest remain the same}>
32.36/32.45	
32.36/32.45	Calling reachability with...
32.36/32.45	Transition: <l3, end, true, {all remain the same}>
32.36/32.45	Conditions: 1 <= i_5^0, d_6^0 <= 0, 
32.36/32.45	OPEN EXITS: 
32.36/32.45	<l3, end, 1 <= i_5^0, {all remain the same}> (condsUp: d_6^0 <= 0)
32.36/32.45	
32.36/32.45	--- Reachability graph ---
32.36/32.45	> Graph without transitions.
32.36/32.45	
32.36/32.45	Calling reachability with...
32.36/32.45	Transition: <l0, l3, 1 + d_6^0 <= 0, {all remain the same}>
32.36/32.45	Conditions: 1 <= i_5^0, d_6^0 <= 0, 
32.36/32.45	OPEN EXITS: 
32.36/32.45	<l0, l3, 1 + d_6^0 <= 0 /\ 1 <= i_5^0, {all remain the same}>
32.36/32.45	
32.36/32.45	> Conditions are reachable!
32.36/32.45	
32.36/32.45	Program does NOT terminate
32.36/32.45	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
32.36/32.45	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
32.36/32.45	EOF