44.46/44.60	NO
44.46/44.60	
44.46/44.60	Solver Timeout: 4
44.46/44.60	Global Timeout: 300
44.46/44.60	No parsing errors!
44.46/44.60	Init Location: 0
44.46/44.60	Transitions:
44.46/44.60	<l0, l6, true>
44.46/44.60	<l1, l2, (undef3 = 0) /\ (0 <= (0 + undef3)) /\ ((0 + undef3) <= 0), par{i_13^0 -> undef3}>
44.46/44.60	<l3, l2, ((1 + i_13^0) <= (0 + __const_10^0)) /\ (undef13 = (~(1) + i_13^0)) /\ (undef9 = undef9) /\ (~(1) <= (0 + undef9)) /\ ((0 + undef9) <= ~(1)) /\ (undef8 = undef8) /\ ((0 + undef8) <= (0 + undef9)) /\ ((0 + undef9) <= (0 + undef8)), par{a_19^0 -> undef8, i_13^0 -> undef9}>
44.46/44.60	<l2, l4, ((0 + __const_10^0) <= (0 + i_13^0)), par{rt_11^0 -> (0 + st_14^0)}>
44.46/44.60	<l2, l5, (undef23 = undef23) /\ ((1 + i_13^0) <= (0 + __const_10^0)) /\ (undef22 = (~(1) + i_13^0)) /\ ((0 + undef22) <= (~(1) + undef23)) /\ ((~(1) + undef23) <= (0 + undef22)) /\ ((1 + undef23) <= (0 + __const_10^0)), par{i_13^0 -> undef22, i_20^0 -> undef23}>
44.46/44.60	<l5, l2, true>
44.46/44.60	<l6, l1, true>
44.46/44.60	
44.46/44.60	Fresh variables:
44.46/44.60	undef3, undef8, undef9, undef13, undef22, undef23, 
44.46/44.60	
44.46/44.60	Undef variables:
44.46/44.60	undef3, undef8, undef9, undef13, undef22, undef23, 
44.46/44.60	
44.46/44.60	Abstraction variables:
44.46/44.60	
44.46/44.60	Exit nodes:
44.46/44.60	
44.46/44.60	Accepting locations:
44.46/44.60	
44.46/44.60	Asserts:
44.46/44.60	
44.46/44.60	Preprocessed LLVMGraph
44.46/44.60	Init Location: 0
44.46/44.60	Transitions:
44.46/44.60	<l0, l2, (i_13^0 = undef3) /\ (undef3 = 0) /\ (0 <= (0 + undef3)) /\ ((0 + undef3) <= 0)>
44.46/44.60	<l2, l4, ((0 + __const_10^0) <= (0 + i_13^0))>
44.46/44.60	<l2, l2, (undef23 = undef23) /\ ((1 + i_13^0) <= (0 + __const_10^0)) /\ (undef22 = (~(1) + i_13^0)) /\ ((0 + undef22) <= (~(1) + undef23)) /\ ((~(1) + undef23) <= (0 + undef22)) /\ ((1 + undef23) <= (0 + __const_10^0)), par{i_13^0 -> undef22}>
44.46/44.60	
44.46/44.60	Fresh variables:
44.46/44.60	undef3, undef8, undef9, undef13, undef22, undef23, 
44.46/44.60	
44.46/44.60	Undef variables:
44.46/44.60	undef3, undef8, undef9, undef13, undef22, undef23, 
44.46/44.60	
44.46/44.60	Abstraction variables:
44.46/44.60	
44.46/44.60	Exit nodes:
44.46/44.60	
44.46/44.60	Accepting locations:
44.46/44.60	
44.46/44.60	Asserts:
44.46/44.60	
44.46/44.60	*************************************************************
44.46/44.60	*******************************************************************************************
44.46/44.60	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
44.46/44.60	*******************************************************************************************
44.46/44.60	
44.46/44.60	Init Location: 0
44.47/44.60	Graph 0:
44.47/44.60	Transitions:
44.47/44.60	Variables:
44.47/44.60	
44.47/44.60	Graph 1:
44.47/44.60	Transitions:
44.47/44.60	<l2, l2, 1 + i_13^0 <= __const_10^0 /\ 1 + undef23 <= __const_10^0 /\ 1 + undef22 = undef23 /\ i_13^0 = 1 + undef22, {i_13^0 -> undef22, rest remain the same}>
44.47/44.60	Variables:
44.47/44.60	__const_10^0, i_13^0
44.47/44.60	
44.47/44.60	Graph 2:
44.47/44.60	Transitions:
44.47/44.60	Variables:
44.47/44.60	
44.47/44.60	Precedence: 
44.47/44.60	Graph 0
44.47/44.60	
44.47/44.60	Graph 1
44.47/44.60	<l0, l2, i_13^0 = undef3 /\ undef3 = 0, {all remain the same}>
44.47/44.60	
44.47/44.60	Graph 2
44.47/44.60	<l2, l4, __const_10^0 <= i_13^0, {all remain the same}>
44.47/44.60	
44.47/44.60	Map Locations to Subgraph:
44.47/44.60	( 0 , 0 )
44.47/44.60	( 2 , 1 )
44.47/44.60	( 4 , 2 )
44.47/44.60	
44.47/44.60	*******************************************************************************************
44.47/44.60	********************************    CHECKING ASSERTIONS    ********************************
44.47/44.60	*******************************************************************************************
44.47/44.60	
44.47/44.60	Proving termination of subgraph 0
44.47/44.60	Proving termination of subgraph 1
44.47/44.60	Checking unfeasibility...
44.47/44.60	Time used: 0.002247
44.47/44.60	
44.47/44.60	Checking conditional termination of SCC {l2}...
44.47/44.60	
44.47/44.60	LOG: CALL solveLinear
44.47/44.60	
44.47/44.60	LOG: RETURN solveLinear - Elapsed time: 0.000764s
44.47/44.60	
44.47/44.60	LOG: CALL solveLinear
44.47/44.60	
44.47/44.60	LOG: RETURN solveLinear - Elapsed time: 0.003173s
44.47/44.60	Trying to remove transition: <l2, l2, 1 + i_13^0 <= __const_10^0 /\ 1 + undef23 <= __const_10^0 /\ 1 + undef22 = undef23 /\ i_13^0 = 1 + undef22, {i_13^0 -> undef22, rest remain the same}>
44.47/44.60	Solving with 1 template(s).
44.47/44.60	
44.47/44.60	LOG: CALL solveNonLinearGetFirstSolution
44.47/44.60	
44.47/44.60	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006427s
44.47/44.60	Time used: 0.006218
44.47/44.60	Solving with 1 template(s).
44.47/44.60	
44.47/44.60	LOG: CALL solveNonLinearGetFirstSolution
44.47/44.60	
44.47/44.60	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008726s
44.47/44.60	Time used: 0.008257
44.47/44.60	Improving Solution with cost 1 ...
44.47/44.60	
44.47/44.60	LOG: CALL solveNonLinearGetNextSolution
44.47/44.60	
44.47/44.60	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000597s
44.47/44.60	Time used: 1.00035
44.47/44.60	
44.47/44.60	LOG: SAT solveNonLinear - Elapsed time: 1.009322s
44.47/44.60	Cost: 1; Total time: 1.00861
44.47/44.60	Failed at location 2: __const_10^0 <= i_13^0
44.47/44.60	Before Improving: 
44.47/44.60	Quasi-invariant at l2: __const_10^0 <= i_13^0
44.47/44.60	Optimizing invariants...
44.47/44.60	
44.47/44.60	LOG: CALL solveLinear
44.47/44.60	
44.47/44.60	LOG: RETURN solveLinear - Elapsed time: 0.005875s
44.47/44.60	Remaining time after improvement: 0.998399
44.47/44.60	Termination implied by a set of quasi-invariant(s):
44.47/44.60	Quasi-invariant at l2: __const_10^0 <= i_13^0
44.47/44.60	[ Invariant Graph ]
44.47/44.60	Strengthening and disabling transitions...
44.47/44.60	
44.47/44.60	LOG: CALL solverLinear in Graph for feasibility
44.47/44.60	
44.47/44.60	LOG: RETURN solveLinear in Graph for feasibility
44.47/44.60	It's unfeasible. Removing transition: 
44.47/44.60	<l2, l2, 1 + i_13^0 <= __const_10^0 /\ 1 + undef23 <= __const_10^0 /\ 1 + undef22 = undef23 /\ i_13^0 = 1 + undef22, {i_13^0 -> undef22, rest remain the same}>
44.47/44.60	[ Termination Graph ]
44.47/44.60	Strengthening and disabling transitions...
44.47/44.60	
44.47/44.60	LOG: CALL solverLinear in Graph for feasibility
44.47/44.60	
44.47/44.60	LOG: RETURN solveLinear in Graph for feasibility
44.47/44.60	It's unfeasible. Removing transition: 
44.47/44.60	<l2, l2, 1 + i_13^0 <= __const_10^0 /\ 1 + undef23 <= __const_10^0 /\ 1 + undef22 = undef23 /\ i_13^0 = 1 + undef22, {i_13^0 -> undef22, rest remain the same}>
44.47/44.60	New Graphs: 
44.47/44.60	Calling Safety with literal __const_10^0 <= i_13^0 and entry <l0, l2, i_13^0 = undef3 /\ undef3 = 0, {all remain the same}>
44.47/44.60	
44.47/44.60	LOG: CALL check - Post:__const_10^0 <= i_13^0 - Process 1
44.47/44.60	* Exit transition: <l0, l2, i_13^0 = undef3 /\ undef3 = 0, {all remain the same}>
44.47/44.60	* Postcondition  : __const_10^0 <= i_13^0
44.47/44.60	
44.47/44.60	LOG: CALL solveLinear
44.47/44.60	
44.47/44.60	LOG: RETURN solveLinear - Elapsed time: 0.000524s
44.47/44.60	> Postcondition is not implied!
44.47/44.60	
44.47/44.60	LOG: RETURN check - Elapsed time: 0.000623s
44.47/44.60	INVARIANTS: 
44.47/44.60	2: 
44.47/44.60	Quasi-INVARIANTS to narrow Graph: 
44.47/44.60	2: __const_10^0 <= i_13^0 , 
44.47/44.60	Narrowing transition: 
44.47/44.60	<l2, l2, 1 + i_13^0 <= __const_10^0 /\ 1 + undef23 <= __const_10^0 /\ 1 + undef22 = undef23 /\ i_13^0 = 1 + undef22, {i_13^0 -> undef22, rest remain the same}>
44.47/44.60	
44.47/44.60	LOG: Narrow transition size 1
44.47/44.60	invGraph after Narrowing: 
44.47/44.60	Transitions:
44.47/44.60	<l2, l2, 1 + i_13^0 <= __const_10^0 /\ 1 + undef23 <= __const_10^0 /\ 1 + undef22 = undef23 /\ i_13^0 = 1 + undef22, {i_13^0 -> undef22, rest remain the same}>
44.47/44.60	Variables:
44.47/44.60	__const_10^0, i_13^0
44.47/44.60	Checking conditional termination of SCC {l2}...
44.47/44.60	
44.47/44.60	LOG: CALL solveLinear
44.47/44.60	
44.47/44.60	LOG: RETURN solveLinear - Elapsed time: 0.000706s
44.47/44.60	
44.47/44.60	LOG: CALL solveLinear
44.47/44.60	
44.47/44.60	LOG: RETURN solveLinear - Elapsed time: 0.002949s
44.47/44.60	Trying to remove transition: <l2, l2, 1 + i_13^0 <= __const_10^0 /\ 1 + undef23 <= __const_10^0 /\ 1 + undef22 = undef23 /\ i_13^0 = 1 + undef22, {i_13^0 -> undef22, rest remain the same}>
44.47/44.60	Solving with 1 template(s).
44.47/44.60	
44.47/44.60	LOG: CALL solveNonLinearGetFirstSolution
44.47/44.60	
44.47/44.60	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005923s
44.47/44.60	Time used: 0.005732
44.47/44.60	Solving with 1 template(s).
44.47/44.60	
44.47/44.60	LOG: CALL solveNonLinearGetFirstSolution
44.47/44.60	
44.47/44.60	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.003164s
44.47/44.60	Time used: 4.00213
44.47/44.60	Solving with 2 template(s).
44.47/44.60	
44.47/44.60	LOG: CALL solveNonLinearGetFirstSolution
44.47/44.60	
44.47/44.60	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.007812s
44.47/44.60	Time used: 4.00094
44.47/44.60	Solving with 3 template(s).
44.47/44.60	
44.47/44.60	LOG: CALL solveNonLinearGetFirstSolution
44.47/44.60	
44.47/44.60	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.006239s
44.47/44.60	Time used: 1.00059
44.47/44.60	Solving with 1 template(s).
44.47/44.60	
44.47/44.60	LOG: CALL solveNonLinearGetFirstSolution
44.47/44.60	
44.47/44.60	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013140s
44.47/44.60	Time used: 0.008871
44.47/44.60	Improving Solution with cost 1 ...
44.47/44.60	
44.47/44.60	LOG: CALL solveNonLinearGetNextSolution
44.47/44.60	
44.47/44.60	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.002045s
44.47/44.60	Time used: 1.00181
44.47/44.60	
44.47/44.60	LOG: SAT solveNonLinear - Elapsed time: 1.015186s
44.47/44.60	Cost: 1; Total time: 1.01068
44.47/44.60	Termination implied by a set of invariant(s):
44.47/44.60	Invariant at l2: i_13^0 <= 1 + __const_10^0
44.47/44.60	[ Invariant Graph ]
44.47/44.60	Strengthening and disabling transitions...
44.47/44.60	
44.47/44.60	LOG: CALL solverLinear in Graph for feasibility
44.47/44.60	
44.47/44.60	LOG: RETURN solveLinear in Graph for feasibility
44.47/44.60	Strengthening transition (result): 
44.47/44.60	<l2, l2, 1 + i_13^0 <= __const_10^0 /\ 1 + undef23 <= __const_10^0 /\ 1 + undef22 = undef23 /\ i_13^0 = 1 + undef22, {i_13^0 -> undef22, rest remain the same}>
44.47/44.60	[ Termination Graph ]
44.47/44.60	Strengthening and disabling transitions...
44.47/44.60	
44.47/44.60	LOG: CALL solverLinear in Graph for feasibility
44.47/44.60	
44.47/44.60	LOG: RETURN solveLinear in Graph for feasibility
44.47/44.60	Strengthening transition (result): 
44.47/44.60	<l2, l2, 1 + i_13^0 <= __const_10^0 /\ 1 + undef23 <= __const_10^0 /\ 1 + undef22 = undef23 /\ i_13^0 = 1 + undef22, {i_13^0 -> undef22, rest remain the same}>
44.47/44.60	Quasi-ranking function: 50000 - 2*__const_10^0 + i_13^0
44.47/44.60	New Graphs: 
44.47/44.60	Transitions:
44.47/44.60	<l2, l2, 1 + i_13^0 <= __const_10^0 /\ 1 + undef23 <= __const_10^0 /\ 50001 + i_13^0 <= 2*__const_10^0 /\ 1 + undef22 = undef23 /\ i_13^0 = 1 + undef22, {i_13^0 -> undef22, rest remain the same}>
44.47/44.60	Variables:
44.47/44.60	__const_10^0, i_13^0
44.47/44.60	Checking conditional termination of SCC {l2}...
44.47/44.60	
44.47/44.60	LOG: CALL solveLinear
44.47/44.60	
44.47/44.60	LOG: RETURN solveLinear - Elapsed time: 0.000855s
44.47/44.60	
44.47/44.60	LOG: CALL solveLinear
44.47/44.60	
44.47/44.60	LOG: RETURN solveLinear - Elapsed time: 0.003872s
44.47/44.60	Trying to remove transition: <l2, l2, 1 + i_13^0 <= __const_10^0 /\ 1 + undef23 <= __const_10^0 /\ 50001 + i_13^0 <= 2*__const_10^0 /\ 1 + undef22 = undef23 /\ i_13^0 = 1 + undef22, {i_13^0 -> undef22, rest remain the same}>
44.47/44.60	Solving with 1 template(s).
44.47/44.60	
44.47/44.60	LOG: CALL solveNonLinearGetFirstSolution
44.47/44.60	
44.47/44.60	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007580s
44.47/44.60	Time used: 0.007382
44.47/44.60	Solving with 1 template(s).
44.47/44.60	
44.47/44.60	LOG: CALL solveNonLinearGetFirstSolution
44.47/44.60	
44.47/44.60	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002379s
44.47/44.60	Time used: 4.00116
44.47/44.60	Solving with 2 template(s).
44.47/44.60	
44.47/44.60	LOG: CALL solveNonLinearGetFirstSolution
44.47/44.60	
44.47/44.60	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.006755s
44.47/44.60	Time used: 4.00114
44.47/44.60	Solving with 3 template(s).
44.47/44.60	
44.47/44.60	LOG: CALL solveNonLinearGetFirstSolution
44.47/44.60	
44.47/44.60	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.006806s
44.47/44.60	Time used: 1.00069
44.47/44.60	Solving with 1 template(s).
44.47/44.60	
44.47/44.60	LOG: CALL solveNonLinearGetFirstSolution
44.47/44.60	
44.47/44.60	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.014064s
44.47/44.60	Time used: 0.010379
44.47/44.60	Improving Solution with cost 1 ...
44.47/44.60	
44.47/44.60	LOG: CALL solveNonLinearGetNextSolution
44.47/44.60	
44.47/44.60	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001274s
44.47/44.60	Time used: 1.00101
44.47/44.60	
44.47/44.60	LOG: SAT solveNonLinear - Elapsed time: 1.015337s
44.47/44.60	Cost: 1; Total time: 1.01139
44.47/44.60	Termination implied by a set of invariant(s):
44.47/44.60	Invariant at l2: i_13^0 <= 0
44.47/44.60	[ Invariant Graph ]
44.47/44.60	Strengthening and disabling transitions...
44.47/44.60	
44.47/44.60	LOG: CALL solverLinear in Graph for feasibility
44.47/44.60	
44.47/44.60	LOG: RETURN solveLinear in Graph for feasibility
44.47/44.60	Strengthening transition (result): 
44.47/44.60	<l2, l2, i_13^0 <= 0 /\ 1 + i_13^0 <= __const_10^0 /\ 1 + undef23 <= __const_10^0 /\ 1 + undef22 = undef23 /\ i_13^0 = 1 + undef22, {i_13^0 -> undef22, rest remain the same}>
44.47/44.60	[ Termination Graph ]
44.47/44.60	Strengthening and disabling transitions...
44.47/44.60	
44.47/44.60	LOG: CALL solverLinear in Graph for feasibility
44.47/44.60	
44.47/44.60	LOG: RETURN solveLinear in Graph for feasibility
44.47/44.60	Strengthening transition (result): 
44.47/44.60	<l2, l2, i_13^0 <= 0 /\ 1 + i_13^0 <= __const_10^0 /\ 1 + undef23 <= __const_10^0 /\ 50001 + i_13^0 <= 2*__const_10^0 /\ 1 + undef22 = undef23 /\ i_13^0 = 1 + undef22, {i_13^0 -> undef22, rest remain the same}>
44.47/44.60	Quasi-ranking function: 50000 + i_13^0
44.47/44.60	New Graphs: 
44.47/44.60	Transitions:
44.47/44.60	<l2, l2, 1 + i_13^0 <= __const_10^0 /\ 1 + undef23 <= __const_10^0 /\ 50001 + i_13^0 <= 2*__const_10^0 /\ 50001 + i_13^0 <= 0 /\ 1 + undef22 = undef23 /\ i_13^0 = 1 + undef22, {i_13^0 -> undef22, rest remain the same}>
44.47/44.60	Variables:
44.47/44.60	__const_10^0, i_13^0
44.47/44.60	Checking conditional termination of SCC {l2}...
44.47/44.60	
44.47/44.60	LOG: CALL solveLinear
44.47/44.60	
44.47/44.60	LOG: RETURN solveLinear - Elapsed time: 0.000965s
44.47/44.60	
44.47/44.60	LOG: CALL solveLinear
44.47/44.60	
44.47/44.60	LOG: RETURN solveLinear - Elapsed time: 0.003943s
44.47/44.60	Trying to remove transition: <l2, l2, 1 + i_13^0 <= __const_10^0 /\ 1 + undef23 <= __const_10^0 /\ 50001 + i_13^0 <= 2*__const_10^0 /\ 50001 + i_13^0 <= 0 /\ 1 + undef22 = undef23 /\ i_13^0 = 1 + undef22, {i_13^0 -> undef22, rest remain the same}>
44.47/44.60	Solving with 1 template(s).
44.47/44.60	
44.47/44.60	LOG: CALL solveNonLinearGetFirstSolution
44.47/44.60	
44.47/44.60	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006979s
44.47/44.60	Time used: 0.006771
44.47/44.60	Solving with 1 template(s).
44.47/44.60	
44.47/44.60	LOG: CALL solveNonLinearGetFirstSolution
44.47/44.60	
44.47/44.60	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005082s
44.47/44.60	Time used: 4.00145
44.47/44.60	Solving with 2 template(s).
44.47/44.60	
44.47/44.60	LOG: CALL solveNonLinearGetFirstSolution
44.47/44.60	
44.47/44.60	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.023113s
44.47/44.60	Time used: 4.01727
44.47/44.60	Solving with 3 template(s).
44.47/44.60	
44.47/44.60	LOG: CALL solveNonLinearGetFirstSolution
44.47/44.60	
44.47/44.60	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.007111s
44.47/44.60	Time used: 1.00103
44.47/44.60	Solving with 1 template(s).
44.47/44.60	
44.47/44.60	LOG: CALL solveNonLinearGetFirstSolution
44.47/44.60	
44.47/44.60	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.015528s
44.47/44.60	Time used: 0.011308
44.47/44.60	Improving Solution with cost 1 ...
44.47/44.60	
44.47/44.60	LOG: CALL solveNonLinearGetNextSolution
44.47/44.60	
44.47/44.60	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001520s
44.47/44.60	Time used: 1.00126
44.47/44.60	
44.47/44.60	LOG: SAT solveNonLinear - Elapsed time: 1.017047s
44.47/44.60	Cost: 1; Total time: 1.01257
44.47/44.60	Termination implied by a set of invariant(s):
44.47/44.60	Invariant at l2: i_13^0 <= 0
44.47/44.60	[ Invariant Graph ]
44.47/44.60	Strengthening and disabling transitions...
44.47/44.60	
44.47/44.60	LOG: CALL solverLinear in Graph for feasibility
44.47/44.60	
44.47/44.60	LOG: RETURN solveLinear in Graph for feasibility
44.47/44.60	Strengthening transition (result): 
44.47/44.60	<l2, l2, i_13^0 <= 0 /\ 1 + i_13^0 <= __const_10^0 /\ 1 + undef23 <= __const_10^0 /\ 1 + undef22 = undef23 /\ i_13^0 = 1 + undef22, {i_13^0 -> undef22, rest remain the same}>
44.47/44.60	[ Termination Graph ]
44.47/44.60	Strengthening and disabling transitions...
44.47/44.60	
44.47/44.60	LOG: CALL solverLinear in Graph for feasibility
44.47/44.60	
44.47/44.60	LOG: RETURN solveLinear in Graph for feasibility
44.47/44.60	Strengthening transition (result): 
44.47/44.60	<l2, l2, 1 + i_13^0 <= __const_10^0 /\ 1 + undef23 <= __const_10^0 /\ 50001 + i_13^0 <= 2*__const_10^0 /\ 50001 + i_13^0 <= 0 /\ 1 + undef22 = undef23 /\ i_13^0 = 1 + undef22, {i_13^0 -> undef22, rest remain the same}>
44.47/44.60	Quasi-ranking function: 50000 + __const_10^0 + i_13^0
44.47/44.60	New Graphs: 
44.47/44.60	Transitions:
44.47/44.60	<l2, l2, 1 + i_13^0 <= __const_10^0 /\ 1 + undef23 <= __const_10^0 /\ 50001 + __const_10^0 + i_13^0 <= 0 /\ 50001 + i_13^0 <= 2*__const_10^0 /\ 50001 + i_13^0 <= 0 /\ 1 + undef22 = undef23 /\ i_13^0 = 1 + undef22, {i_13^0 -> undef22, rest remain the same}>
44.47/44.60	Variables:
44.47/44.60	__const_10^0, i_13^0
44.47/44.60	Checking conditional termination of SCC {l2}...
44.47/44.60	
44.47/44.60	LOG: CALL solveLinear
44.47/44.60	
44.47/44.60	LOG: RETURN solveLinear - Elapsed time: 0.001056s
44.47/44.60	
44.47/44.60	LOG: CALL solveLinear
44.47/44.60	
44.47/44.60	LOG: RETURN solveLinear - Elapsed time: 0.005206s
44.47/44.60	Trying to remove transition: <l2, l2, 1 + i_13^0 <= __const_10^0 /\ 1 + undef23 <= __const_10^0 /\ 50001 + __const_10^0 + i_13^0 <= 0 /\ 50001 + i_13^0 <= 2*__const_10^0 /\ 50001 + i_13^0 <= 0 /\ 1 + undef22 = undef23 /\ i_13^0 = 1 + undef22, {i_13^0 -> undef22, rest remain the same}>
44.47/44.60	Solving with 1 template(s).
44.47/44.60	
44.47/44.60	LOG: CALL solveNonLinearGetFirstSolution
44.47/44.60	
44.47/44.60	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008126s
44.47/44.60	Time used: 0.007913
44.47/44.60	Solving with 1 template(s).
44.47/44.60	
44.47/44.60	LOG: CALL solveNonLinearGetFirstSolution
44.47/44.60	
44.47/44.60	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.012121s
44.47/44.60	Time used: 4.00144
44.47/44.60	Solving with 2 template(s).
44.47/44.60	
44.47/44.60	LOG: CALL solveNonLinearGetFirstSolution
44.47/44.60	
44.47/44.60	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.049433s
44.47/44.60	Time used: 4.0214
44.47/44.60	Solving with 3 template(s).
44.47/44.60	
44.47/44.60	LOG: CALL solveNonLinearGetFirstSolution
44.47/44.60	
44.47/44.60	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.006581s
44.47/44.60	Time used: 1.00103
44.47/44.60	Solving with 1 template(s).
44.47/44.60	
44.47/44.60	LOG: CALL solveNonLinearGetFirstSolution
44.47/44.60	
44.47/44.60	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.017537s
44.47/44.60	Time used: 4.00331
44.47/44.60	
44.47/44.60	Proving non-termination of subgraph 1
44.47/44.60	Transitions:
44.47/44.60	<l2, l2, 1 + i_13^0 <= __const_10^0 /\ 1 + undef23 <= __const_10^0 /\ 1 + undef22 = undef23 /\ i_13^0 = 1 + undef22, {i_13^0 -> undef22, rest remain the same}>
44.47/44.60	Variables:
44.47/44.60	__const_10^0, i_13^0
44.47/44.60	
44.47/44.60	Checking that every undef value has an assignment...
44.47/44.60	
44.47/44.60	LOG: CALL solveLinear
44.47/44.60	
44.47/44.60	LOG: RETURN solveLinear - Elapsed time: 0.001681s
44.47/44.60	Checking conditional non-termination of SCC {l2}...
44.47/44.60	EXIT TRANSITIONS:
44.47/44.60	<l2, end, __const_10^0 <= i_13^0, {all remain the same}>
44.47/44.60	
44.47/44.60	Solving with 1 template(s).
44.47/44.60	
44.47/44.60	LOG: CALL solveNonLinearGetFirstSolution
44.47/44.60	
44.47/44.60	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.025224s
44.47/44.60	Time used: 0.024877
44.47/44.60	Improving Solution with cost 1 ...
44.47/44.60	
44.47/44.60	LOG: CALL solveNonLinearGetNextSolution
44.47/44.60	
44.47/44.60	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.030184s
44.47/44.60	Time used: 0.03017
44.47/44.60	
44.47/44.60	LOG: SAT solveNonLinear - Elapsed time: 0.055408s
44.47/44.60	Cost: 1; Total time: 0.055047
44.47/44.60	Failed at location 2: 1 + i_13^0 <= __const_10^0
44.47/44.60	Before Improving: 
44.47/44.60	Quasi-invariant at l2: 1 + i_13^0 <= __const_10^0
44.47/44.61	Optimizing invariants...
44.47/44.61	
44.47/44.61	LOG: CALL solveLinear
44.47/44.61	
44.47/44.61	LOG: RETURN solveLinear - Elapsed time: 0.011440s
44.47/44.61	Remaining time after improvement: 0.997203
44.47/44.61	Minimizing number of undef constraints...
44.47/44.61	
44.47/44.61	LOG: CALL solveNonLinear
44.47/44.61	
44.47/44.61	LOG: RETURN solveNonLinear - Elapsed time: 0.004060s
44.47/44.61	Number of undef constraints reduced!
44.47/44.61	
44.47/44.61	Non-termination implied by a set of quasi-invariant(s):
44.47/44.61	Quasi-invariant at l2: 1 + i_13^0 <= __const_10^0
44.47/44.61	
44.47/44.61	Strengthening and disabling EXIT transitions...
44.47/44.61	Closed exits from l2: 1
44.47/44.61	
44.47/44.61	Strengthening and disabling transitions...
44.47/44.61	
44.47/44.61	LOG: CALL solverLinear in Graph for feasibility
44.47/44.61	
44.47/44.61	LOG: RETURN solveLinear in Graph for feasibility
44.47/44.61	Strengthening transition (result): 
44.47/44.61	<l2, l2, 1 + i_13^0 <= __const_10^0 /\ 1 + undef23 <= __const_10^0 /\ 1 + undef22 = undef23 /\ i_13^0 = 1 + undef22, {i_13^0 -> undef22, rest remain the same}>
44.47/44.61	
44.47/44.61	Calling reachability with...
44.47/44.61	Transition: <l2, end, true, {all remain the same}>
44.47/44.61	Conditions: 1 + i_13^0 <= __const_10^0, 
44.47/44.61	OPEN EXITS: 
44.47/44.61	<l2, end, 1 + i_13^0 <= __const_10^0, {all remain the same}>
44.47/44.61	
44.47/44.61	--- Reachability graph ---
44.47/44.61	> Graph without transitions.
44.47/44.61	
44.47/44.61	Calling reachability with...
44.47/44.61	Transition: <l0, l2, i_13^0 = undef3 /\ undef3 = 0, {all remain the same}>
44.47/44.61	Conditions: 1 + i_13^0 <= __const_10^0, 
44.47/44.61	OPEN EXITS: 
44.47/44.61	<l0, l2, 1 + i_13^0 <= __const_10^0 /\ i_13^0 = undef3 /\ undef3 = 0, {all remain the same}>
44.47/44.61	
44.47/44.61	> Conditions are reachable!
44.47/44.61	
44.47/44.61	Program does NOT terminate
44.47/44.61	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
44.47/44.61	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
44.47/44.61	EOF