23.21/23.22	NO
23.21/23.22	
23.21/23.22	Solver Timeout: 4
23.21/23.22	Global Timeout: 300
23.21/23.22	No parsing errors!
23.21/23.22	Init Location: 0
23.21/23.22	Transitions:
23.21/23.22	<l0, l10, true>
23.21/23.22	<l1, l2, true, par{i^0 -> (1 + i^0)}>
23.21/23.22	<l3, l1, true>
23.21/23.22	<l3, l1, true>
23.21/23.22	<l3, l4, true>
23.21/23.22	<l2, l3, true>
23.21/23.22	<l5, l6, true>
23.21/23.22	<l7, l5, true>
23.21/23.22	<l7, l5, true>
23.21/23.22	<l7, l6, true>
23.21/23.22	<l8, l5, ((0 + i^0) <= (0 + k^0))>
23.21/23.22	<l8, l7, ((1 + k^0) <= (0 + i^0))>
23.21/23.22	<l4, l5, ((1 + k^0) <= 0)>
23.21/23.22	<l4, l8, (0 <= (0 + k^0))>
23.21/23.22	<l9, l2, (undef28 = undef28), par{i^0 -> 0, k^0 -> undef28}>
23.21/23.22	<l10, l9, true>
23.21/23.22	
23.21/23.22	Fresh variables:
23.21/23.22	undef28, 
23.21/23.22	
23.21/23.22	Undef variables:
23.21/23.22	undef28, 
23.21/23.22	
23.21/23.22	Abstraction variables:
23.21/23.22	
23.21/23.22	Exit nodes:
23.21/23.22	
23.21/23.22	Accepting locations:
23.21/23.22	
23.21/23.22	Asserts:
23.21/23.22	
23.21/23.22	Preprocessed LLVMGraph
23.21/23.22	Init Location: 0
23.21/23.22	Transitions:
23.21/23.22	<l0, l2, (i^0 = 0) /\ (k^0 = undef28) /\ (undef28 = undef28)>
23.21/23.22	<l2, l2, true, par{i^0 -> (1 + i^0)}>
23.21/23.22	<l2, l2, true, par{i^0 -> (1 + i^0)}>
23.21/23.22	<l2, l6, ((1 + k^0) <= 0)>
23.21/23.22	<l2, l6, (0 <= (0 + k^0)) /\ ((0 + i^0) <= (0 + k^0))>
23.21/23.22	<l2, l6, (0 <= (0 + k^0)) /\ ((1 + k^0) <= (0 + i^0))>
23.21/23.22	<l2, l6, (0 <= (0 + k^0)) /\ ((1 + k^0) <= (0 + i^0))>
23.21/23.22	<l2, l6, (0 <= (0 + k^0)) /\ ((1 + k^0) <= (0 + i^0))>
23.21/23.22	
23.21/23.22	Fresh variables:
23.21/23.22	undef28, 
23.21/23.22	
23.21/23.22	Undef variables:
23.21/23.22	undef28, 
23.21/23.22	
23.21/23.22	Abstraction variables:
23.21/23.22	
23.21/23.22	Exit nodes:
23.21/23.22	
23.21/23.22	Accepting locations:
23.21/23.22	
23.21/23.22	Asserts:
23.21/23.22	
23.21/23.22	*************************************************************
23.21/23.22	*******************************************************************************************
23.21/23.22	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
23.21/23.22	*******************************************************************************************
23.21/23.22	
23.21/23.22	Init Location: 0
23.21/23.22	Graph 0:
23.21/23.22	Transitions:
23.21/23.22	Variables:
23.21/23.22	
23.21/23.22	Graph 1:
23.21/23.22	Transitions:
23.21/23.22	<l2, l2, true, {i^0 -> 1 + i^0, rest remain the same}>
23.21/23.22	<l2, l2, true, {i^0 -> 1 + i^0, rest remain the same}>
23.21/23.22	Variables:
23.21/23.22	i^0
23.21/23.22	
23.21/23.22	Graph 2:
23.21/23.22	Transitions:
23.21/23.22	Variables:
23.21/23.22	
23.21/23.22	Precedence: 
23.21/23.22	Graph 0
23.21/23.22	
23.21/23.22	Graph 1
23.21/23.22	<l0, l2, i^0 = 0 /\ k^0 = undef28, {all remain the same}>
23.21/23.22	
23.21/23.22	Graph 2
23.21/23.22	<l2, l6, 1 + k^0 <= 0, {all remain the same}>
23.21/23.22	<l2, l6, i^0 <= k^0 /\ 0 <= k^0, {all remain the same}>
23.21/23.22	<l2, l6, 1 + k^0 <= i^0 /\ 0 <= k^0, {all remain the same}>
23.21/23.22	<l2, l6, 1 + k^0 <= i^0 /\ 0 <= k^0, {all remain the same}>
23.21/23.22	<l2, l6, 1 + k^0 <= i^0 /\ 0 <= k^0, {all remain the same}>
23.21/23.22	
23.21/23.22	Map Locations to Subgraph:
23.21/23.22	( 0 , 0 )
23.21/23.22	( 2 , 1 )
23.21/23.22	( 6 , 2 )
23.21/23.22	
23.21/23.22	*******************************************************************************************
23.21/23.22	********************************    CHECKING ASSERTIONS    ********************************
23.21/23.22	*******************************************************************************************
23.21/23.22	
23.21/23.22	Proving termination of subgraph 0
23.21/23.22	Proving termination of subgraph 1
23.21/23.22	Checking unfeasibility...
23.21/23.22	Time used: 0.002636
23.21/23.22	
23.21/23.22	Checking conditional termination of SCC {l2}...
23.21/23.22	
23.21/23.22	LOG: CALL solveLinear
23.21/23.22	
23.21/23.22	LOG: RETURN solveLinear - Elapsed time: 0.000582s
23.21/23.22	
23.21/23.22	LOG: CALL solveLinear
23.21/23.22	
23.21/23.22	LOG: RETURN solveLinear - Elapsed time: 0.001144s
23.21/23.22	Trying to remove transition: <l2, l2, true, {i^0 -> 1 + i^0, rest remain the same}>
23.21/23.22	Solving with 1 template(s).
23.21/23.22	
23.21/23.22	LOG: CALL solveNonLinearGetFirstSolution
23.21/23.22	
23.21/23.22	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004280s
23.21/23.22	Time used: 0.00417
23.21/23.22	Trying to remove transition: <l2, l2, true, {i^0 -> 1 + i^0, rest remain the same}>
23.21/23.22	Solving with 1 template(s).
23.21/23.22	
23.21/23.22	LOG: CALL solveNonLinearGetFirstSolution
23.21/23.22	
23.21/23.22	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004060s
23.21/23.22	Time used: 0.003802
23.21/23.22	Solving with 1 template(s).
23.21/23.22	
23.21/23.22	LOG: CALL solveNonLinearGetFirstSolution
23.21/23.22	
23.21/23.22	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.004328s
23.21/23.22	Time used: 4.00396
23.21/23.22	Solving with 2 template(s).
23.21/23.22	
23.21/23.22	LOG: CALL solveNonLinearGetFirstSolution
23.21/23.22	
23.21/23.22	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.008601s
23.21/23.22	Time used: 4.00123
23.21/23.22	Solving with 3 template(s).
23.21/23.22	
23.21/23.22	LOG: CALL solveNonLinearGetFirstSolution
23.21/23.22	
23.21/23.22	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.014230s
23.21/23.22	Time used: 1.00072
23.21/23.22	Solving with 1 template(s).
23.21/23.22	
23.21/23.22	LOG: CALL solveNonLinearGetFirstSolution
23.21/23.22	
23.21/23.22	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.017676s
23.21/23.22	Time used: 0.008976
23.21/23.22	Improving Solution with cost 1 ...
23.21/23.22	
23.21/23.22	LOG: CALL solveNonLinearGetNextSolution
23.21/23.22	
23.21/23.22	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000855s
23.21/23.22	Time used: 1.00088
23.21/23.22	
23.21/23.22	LOG: SAT solveNonLinear - Elapsed time: 1.018532s
23.21/23.22	Cost: 1; Total time: 1.00985
23.21/23.22	Quasi-ranking function: 50000 - i^0
23.21/23.22	New Graphs: 
23.21/23.22	Transitions:
23.21/23.22	<l2, l2, 50001 <= i^0, {i^0 -> 1 + i^0, rest remain the same}>
23.21/23.22	<l2, l2, 50001 <= i^0, {i^0 -> 1 + i^0, rest remain the same}>
23.21/23.22	Variables:
23.21/23.22	i^0
23.21/23.22	Checking conditional termination of SCC {l2}...
23.21/23.22	
23.21/23.22	LOG: CALL solveLinear
23.21/23.22	
23.21/23.22	LOG: RETURN solveLinear - Elapsed time: 0.000696s
23.21/23.22	
23.21/23.22	LOG: CALL solveLinear
23.21/23.22	
23.21/23.22	LOG: RETURN solveLinear - Elapsed time: 0.003386s
23.21/23.22	Trying to remove transition: <l2, l2, 50001 <= i^0, {i^0 -> 1 + i^0, rest remain the same}>
23.21/23.22	Solving with 1 template(s).
23.21/23.22	
23.21/23.22	LOG: CALL solveNonLinearGetFirstSolution
23.21/23.22	
23.21/23.22	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005785s
23.21/23.22	Time used: 0.005635
23.21/23.22	Trying to remove transition: <l2, l2, 50001 <= i^0, {i^0 -> 1 + i^0, rest remain the same}>
23.21/23.22	Solving with 1 template(s).
23.21/23.22	
23.21/23.22	LOG: CALL solveNonLinearGetFirstSolution
23.21/23.22	
23.21/23.22	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005252s
23.21/23.22	Time used: 0.005
23.21/23.22	Solving with 1 template(s).
23.21/23.22	
23.21/23.22	LOG: CALL solveNonLinearGetFirstSolution
23.21/23.22	
23.21/23.22	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001872s
23.21/23.22	Time used: 4.00175
23.21/23.22	Solving with 2 template(s).
23.21/23.22	
23.21/23.22	LOG: CALL solveNonLinearGetFirstSolution
23.21/23.22	
23.21/23.22	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.006963s
23.21/23.22	Time used: 4.00136
23.21/23.22	Solving with 3 template(s).
23.21/23.22	
23.21/23.22	LOG: CALL solveNonLinearGetFirstSolution
23.21/23.22	
23.21/23.22	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.027969s
23.21/23.22	Time used: 1.0145
23.21/23.22	Solving with 1 template(s).
23.21/23.22	
23.21/23.22	LOG: CALL solveNonLinearGetFirstSolution
23.21/23.22	
23.21/23.22	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.010671s
23.21/23.22	Time used: 4.00232
23.21/23.22	Termination failed. Trying to show unreachability...
23.21/23.22	Proving unreachability of entry: <l0, l2, i^0 = 0 /\ k^0 = undef28, {all remain the same}>
23.21/23.22	
23.21/23.22	LOG: CALL check - Post:1 <= 0 - Process 1
23.21/23.22	* Exit transition: <l0, l2, i^0 = 0 /\ k^0 = undef28, {all remain the same}>
23.21/23.22	* Postcondition  : 1 <= 0
23.21/23.22	
23.21/23.22	LOG: CALL solveLinear
23.21/23.22	
23.21/23.22	LOG: RETURN solveLinear - Elapsed time: 0.006325s
23.21/23.22	> Postcondition is not implied!
23.21/23.22	
23.21/23.22	LOG: RETURN check - Elapsed time: 0.006435s
23.21/23.22	Cannot prove unreachability
23.21/23.22	
23.21/23.22	Proving non-termination of subgraph 1
23.21/23.22	Transitions:
23.21/23.22	<l2, l2, true, {i^0 -> 1 + i^0, rest remain the same}>
23.21/23.22	<l2, l2, true, {i^0 -> 1 + i^0, rest remain the same}>
23.21/23.22	Variables:
23.21/23.22	i^0
23.21/23.22	
23.21/23.22	Checking conditional non-termination of SCC {l2}...
23.21/23.22	> No exit transition to close.
23.21/23.22	Calling reachability with...
23.21/23.22	Transition: <l2, end, true, {all remain the same}>
23.21/23.22	Conditions: 
23.21/23.22	OPEN EXITS: 
23.21/23.22	<l2, end, true, {all remain the same}>
23.21/23.22	
23.21/23.22	--- Reachability graph ---
23.21/23.22	> Graph without transitions.
23.21/23.22	
23.21/23.22	Calling reachability with...
23.21/23.22	Transition: <l0, l2, i^0 = 0 /\ k^0 = undef28, {all remain the same}>
23.21/23.22	Conditions: 
23.21/23.22	OPEN EXITS: 
23.21/23.22	<l0, l2, i^0 = 0 /\ k^0 = undef28, {all remain the same}>
23.21/23.22	
23.21/23.22	> Conditions are reachable!
23.21/23.22	
23.21/23.22	Program does NOT terminate
23.21/23.22	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
23.21/23.22	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
23.21/23.22	EOF