23.15/23.23	NO
23.15/23.23	
23.15/23.23	Solver Timeout: 4
23.15/23.23	Global Timeout: 300
23.15/23.23	No parsing errors!
23.15/23.23	Init Location: 0
23.15/23.23	Transitions:
23.15/23.23	<l0, l9, true>
23.15/23.23	<l1, l2, true, par{x^0 -> 1}>
23.15/23.23	<l2, l1, true>
23.15/23.23	<l3, l1, ((0 + y^0) <= 0), par{p^0 -> 0}>
23.15/23.23	<l3, l4, (1 <= (0 + y^0)), par{y^0 -> (~(1) + y^0)}>
23.15/23.23	<l4, l3, true>
23.15/23.23	<l5, l1, (2 <= 0)>
23.15/23.23	<l5, l6, true, par{p^0 -> (1 + p^0)}>
23.15/23.23	<l6, l5, true>
23.15/23.23	<l7, l3, ((0 + x^0) <= 0)>
23.15/23.23	<l7, l5, (1 <= (0 + x^0))>
23.15/23.23	<l8, l7, true, par{p^0 -> 0}>
23.15/23.23	<l9, l8, true>
23.15/23.23	
23.15/23.23	Fresh variables:
23.15/23.23	
23.15/23.23	Undef variables:
23.15/23.23	
23.15/23.23	Abstraction variables:
23.15/23.23	
23.15/23.23	Exit nodes:
23.15/23.23	
23.15/23.23	Accepting locations:
23.15/23.23	
23.15/23.23	Asserts:
23.15/23.23	
23.15/23.23	Preprocessed LLVMGraph
23.15/23.23	Init Location: 0
23.15/23.23	Transitions:
23.15/23.23	<l0, l3, (p^0 = 0) /\ ((0 + x^0) <= 0)>
23.15/23.23	<l0, l5, (p^0 = 0) /\ (1 <= (0 + x^0))>
23.15/23.23	<l1, l1, true, par{x^0 -> 1}>
23.15/23.23	<l3, l1, ((0 + y^0) <= 0), par{p^0 -> 0}>
23.15/23.23	<l3, l3, (1 <= (0 + y^0)), par{y^0 -> (~(1) + y^0)}>
23.15/23.23	<l5, l5, true, par{p^0 -> (1 + p^0)}>
23.15/23.23	
23.15/23.23	Fresh variables:
23.15/23.23	
23.15/23.23	Undef variables:
23.15/23.23	
23.15/23.23	Abstraction variables:
23.15/23.23	
23.15/23.23	Exit nodes:
23.15/23.23	
23.15/23.23	Accepting locations:
23.15/23.23	
23.15/23.23	Asserts:
23.15/23.23	
23.15/23.23	*************************************************************
23.15/23.23	*******************************************************************************************
23.15/23.23	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
23.15/23.23	*******************************************************************************************
23.15/23.23	
23.15/23.23	Init Location: 0
23.15/23.23	Graph 0:
23.15/23.23	Transitions:
23.15/23.23	Variables:
23.15/23.23	
23.15/23.23	Graph 1:
23.15/23.23	Transitions:
23.15/23.23	<l5, l5, true, {p^0 -> 1 + p^0, rest remain the same}>
23.15/23.23	Variables:
23.15/23.23	p^0
23.15/23.23	
23.15/23.23	Graph 2:
23.15/23.23	Transitions:
23.15/23.23	<l3, l3, 1 <= y^0, {y^0 -> -1 + y^0, rest remain the same}>
23.15/23.23	Variables:
23.15/23.23	y^0
23.15/23.23	
23.15/23.23	Graph 3:
23.15/23.23	Transitions:
23.15/23.23	<l1, l1, true, {x^0 -> 1, rest remain the same}>
23.15/23.23	Variables:
23.15/23.23	
23.15/23.23	Precedence: 
23.15/23.23	Graph 0
23.15/23.23	
23.15/23.23	Graph 1
23.15/23.23	<l0, l5, 1 <= x^0 /\ p^0 = 0, {all remain the same}>
23.15/23.23	
23.15/23.23	Graph 2
23.15/23.23	<l0, l3, x^0 <= 0 /\ p^0 = 0, {all remain the same}>
23.15/23.23	
23.15/23.23	Graph 3
23.15/23.23	<l3, l1, y^0 <= 0, {p^0 -> 0, rest remain the same}>
23.15/23.23	
23.15/23.23	Map Locations to Subgraph:
23.15/23.23	( 0 , 0 )
23.15/23.23	( 1 , 3 )
23.15/23.23	( 3 , 2 )
23.15/23.23	( 5 , 1 )
23.15/23.23	
23.15/23.23	*******************************************************************************************
23.15/23.23	********************************    CHECKING ASSERTIONS    ********************************
23.15/23.23	*******************************************************************************************
23.15/23.23	
23.15/23.23	Proving termination of subgraph 0
23.15/23.23	Proving termination of subgraph 1
23.15/23.23	Checking unfeasibility...
23.15/23.23	Time used: 0.001645
23.15/23.23	
23.15/23.23	Checking conditional termination of SCC {l5}...
23.15/23.23	
23.15/23.23	LOG: CALL solveLinear
23.15/23.23	
23.15/23.23	LOG: RETURN solveLinear - Elapsed time: 0.000468s
23.15/23.23	
23.15/23.23	LOG: CALL solveLinear
23.15/23.23	
23.15/23.23	LOG: RETURN solveLinear - Elapsed time: 0.000865s
23.15/23.23	Trying to remove transition: <l5, l5, true, {p^0 -> 1 + p^0, rest remain the same}>
23.15/23.23	Solving with 1 template(s).
23.15/23.23	
23.15/23.23	LOG: CALL solveNonLinearGetFirstSolution
23.15/23.23	
23.15/23.23	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003129s
23.15/23.23	Time used: 0.003021
23.15/23.23	Solving with 1 template(s).
23.15/23.23	
23.15/23.23	LOG: CALL solveNonLinearGetFirstSolution
23.15/23.23	
23.15/23.23	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002635s
23.15/23.23	Time used: 4.00234
23.15/23.23	Solving with 2 template(s).
23.15/23.23	
23.15/23.23	LOG: CALL solveNonLinearGetFirstSolution
23.15/23.23	
23.15/23.23	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.007372s
23.15/23.23	Time used: 4.00107
23.15/23.23	Solving with 3 template(s).
23.15/23.23	
23.15/23.23	LOG: CALL solveNonLinearGetFirstSolution
23.15/23.23	
23.15/23.23	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.015762s
23.15/23.23	Time used: 1.01145
23.15/23.23	Solving with 1 template(s).
23.15/23.23	
23.15/23.23	LOG: CALL solveNonLinearGetFirstSolution
23.15/23.23	
23.15/23.23	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009591s
23.15/23.23	Time used: 0.005097
23.15/23.23	Improving Solution with cost 1 ...
23.15/23.23	
23.15/23.23	LOG: CALL solveNonLinearGetNextSolution
23.15/23.23	
23.15/23.23	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.002035s
23.15/23.23	Time used: 1.00207
23.15/23.23	
23.15/23.23	LOG: SAT solveNonLinear - Elapsed time: 1.011627s
23.15/23.23	Cost: 1; Total time: 1.00716
23.15/23.23	Termination implied by a set of invariant(s):
23.15/23.23	Invariant at l5: 0 <= 1 + p^0
23.15/23.23	[ Invariant Graph ]
23.15/23.23	Strengthening and disabling transitions...
23.15/23.23	
23.15/23.23	LOG: CALL solverLinear in Graph for feasibility
23.15/23.23	
23.15/23.23	LOG: RETURN solveLinear in Graph for feasibility
23.15/23.23	Strengthening transition (result): 
23.15/23.23	<l5, l5, 0 <= 1 + p^0, {p^0 -> 1 + p^0, rest remain the same}>
23.15/23.23	[ Termination Graph ]
23.15/23.23	Strengthening and disabling transitions...
23.15/23.23	
23.15/23.23	LOG: CALL solverLinear in Graph for feasibility
23.15/23.23	
23.15/23.23	LOG: RETURN solveLinear in Graph for feasibility
23.15/23.23	Strengthening transition (result): 
23.15/23.23	<l5, l5, 0 <= 1 + p^0, {p^0 -> 1 + p^0, rest remain the same}>
23.15/23.23	Quasi-ranking function: 50000 - p^0
23.15/23.23	New Graphs: 
23.15/23.23	Transitions:
23.15/23.23	<l5, l5, 50001 <= p^0, {p^0 -> 1 + p^0, rest remain the same}>
23.15/23.23	Variables:
23.15/23.23	p^0
23.15/23.23	Checking conditional termination of SCC {l5}...
23.15/23.23	
23.15/23.23	LOG: CALL solveLinear
23.15/23.23	
23.15/23.23	LOG: RETURN solveLinear - Elapsed time: 0.000429s
23.15/23.23	
23.15/23.23	LOG: CALL solveLinear
23.15/23.23	
23.15/23.23	LOG: RETURN solveLinear - Elapsed time: 0.001321s
23.15/23.23	Trying to remove transition: <l5, l5, 50001 <= p^0, {p^0 -> 1 + p^0, rest remain the same}>
23.15/23.23	Solving with 1 template(s).
23.15/23.23	
23.15/23.23	LOG: CALL solveNonLinearGetFirstSolution
23.15/23.23	
23.15/23.23	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004403s
23.15/23.23	Time used: 0.004269
23.15/23.23	Solving with 1 template(s).
23.15/23.23	
23.15/23.23	LOG: CALL solveNonLinearGetFirstSolution
23.15/23.23	
23.15/23.23	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.029601s
23.15/23.23	Time used: 4.02929
23.15/23.23	Solving with 2 template(s).
23.15/23.23	
23.15/23.23	LOG: CALL solveNonLinearGetFirstSolution
23.15/23.23	
23.15/23.23	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.008605s
23.15/23.23	Time used: 4.0034
23.15/23.23	Solving with 3 template(s).
23.15/23.23	
23.15/23.23	LOG: CALL solveNonLinearGetFirstSolution
23.15/23.23	
23.15/23.23	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.006185s
23.15/23.23	Time used: 1.0009
23.15/23.23	Solving with 1 template(s).
23.15/23.23	
23.15/23.23	LOG: CALL solveNonLinearGetFirstSolution
23.15/23.23	
23.15/23.23	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.007040s
23.15/23.23	Time used: 4.00169
23.15/23.23	Termination failed. Trying to show unreachability...
23.15/23.23	Proving unreachability of entry: <l0, l5, 1 <= x^0 /\ p^0 = 0, {all remain the same}>
23.15/23.23	
23.15/23.23	LOG: CALL check - Post:1 <= 0 - Process 1
23.15/23.23	* Exit transition: <l0, l5, 1 <= x^0 /\ p^0 = 0, {all remain the same}>
23.15/23.23	* Postcondition  : 1 <= 0
23.15/23.23	
23.15/23.23	LOG: CALL solveLinear
23.15/23.23	
23.15/23.23	LOG: RETURN solveLinear - Elapsed time: 0.005821s
23.15/23.23	> Postcondition is not implied!
23.15/23.23	
23.15/23.23	LOG: RETURN check - Elapsed time: 0.005935s
23.15/23.23	Cannot prove unreachability
23.15/23.23	
23.15/23.23	Proving non-termination of subgraph 1
23.15/23.23	Transitions:
23.15/23.23	<l5, l5, true, {p^0 -> 1 + p^0, rest remain the same}>
23.15/23.23	Variables:
23.15/23.23	p^0
23.15/23.23	
23.15/23.23	Checking conditional non-termination of SCC {l5}...
23.15/23.23	> No exit transition to close.
23.15/23.23	Calling reachability with...
23.15/23.23	Transition: <l5, end, true, {all remain the same}>
23.15/23.23	Conditions: 
23.15/23.23	OPEN EXITS: 
23.15/23.23	<l5, end, true, {all remain the same}>
23.15/23.23	
23.15/23.23	--- Reachability graph ---
23.15/23.23	> Graph without transitions.
23.15/23.23	
23.15/23.23	Calling reachability with...
23.15/23.23	Transition: <l0, l5, 1 <= x^0 /\ p^0 = 0, {all remain the same}>
23.15/23.23	Conditions: 
23.15/23.23	OPEN EXITS: 
23.15/23.23	<l0, l5, 1 <= x^0 /\ p^0 = 0, {all remain the same}>
23.15/23.23	
23.15/23.23	> Conditions are reachable!
23.15/23.23	
23.15/23.23	Program does NOT terminate
23.15/23.23	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
23.15/23.23	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
23.15/23.23	EOF