3.08/3.11	NO
3.08/3.11	
3.08/3.11	Solver Timeout: 4
3.08/3.11	Global Timeout: 300
3.08/3.11	No parsing errors!
3.08/3.11	Init Location: 0
3.08/3.11	Transitions:
3.08/3.11	<l0, l6, true>
3.08/3.11	<l1, l2, ((0 + nd^0) <= 0), par{p^0 -> 2}>
3.08/3.11	<l1, l2, (1 <= (0 + nd^0)), par{p^0 -> 1}>
3.08/3.11	<l2, l1, (undef7 = undef7), par{nd^0 -> undef7}>
3.08/3.11	<l3, l4, ((0 + nd^0) <= 0), par{x^0 -> (~(2) + x^0)}>
3.08/3.11	<l3, l4, (1 <= (0 + nd^0)), par{x^0 -> (~(1) + x^0)}>
3.08/3.11	<l4, l2, ((0 + x^0) <= 0)>
3.08/3.11	<l4, l3, (1 <= (0 + x^0)) /\ (undef19 = undef19), par{nd^0 -> undef19}>
3.08/3.11	<l5, l4, true, par{p^0 -> 0}>
3.08/3.11	<l6, l5, true>
3.08/3.11	
3.08/3.11	Fresh variables:
3.08/3.11	undef7, undef19, 
3.08/3.11	
3.08/3.11	Undef variables:
3.08/3.11	undef7, undef19, 
3.08/3.11	
3.08/3.11	Abstraction variables:
3.08/3.11	
3.08/3.11	Exit nodes:
3.08/3.11	
3.08/3.11	Accepting locations:
3.08/3.11	
3.08/3.11	Asserts:
3.08/3.11	
3.08/3.11	Preprocessed LLVMGraph
3.08/3.11	Init Location: 0
3.08/3.11	Transitions:
3.08/3.11	<l0, l4, true>
3.08/3.11	<l2, l2, (undef7 = undef7) /\ ((0 + undef7) <= 0)>
3.08/3.11	<l2, l2, (undef7 = undef7) /\ (1 <= (0 + undef7))>
3.08/3.11	<l4, l2, ((0 + x^0) <= 0)>
3.08/3.11	<l4, l4, (1 <= (0 + x^0)) /\ (undef19 = undef19) /\ ((0 + undef19) <= 0), par{x^0 -> (~(2) + x^0)}>
3.08/3.11	<l4, l4, (1 <= (0 + x^0)) /\ (undef19 = undef19) /\ (1 <= (0 + undef19)), par{x^0 -> (~(1) + x^0)}>
3.08/3.11	
3.08/3.11	Fresh variables:
3.08/3.11	undef7, undef19, 
3.08/3.11	
3.08/3.11	Undef variables:
3.08/3.11	undef7, undef19, 
3.08/3.11	
3.08/3.11	Abstraction variables:
3.08/3.11	
3.08/3.11	Exit nodes:
3.08/3.11	
3.08/3.11	Accepting locations:
3.08/3.11	
3.08/3.11	Asserts:
3.08/3.11	
3.08/3.11	*************************************************************
3.08/3.11	*******************************************************************************************
3.08/3.11	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
3.08/3.11	*******************************************************************************************
3.08/3.11	
3.08/3.11	Init Location: 0
3.08/3.11	Graph 0:
3.08/3.11	Transitions:
3.08/3.11	Variables:
3.08/3.11	
3.08/3.11	Graph 1:
3.08/3.11	Transitions:
3.08/3.11	<l4, l4, undef19 <= 0 /\ 1 <= x^0, {x^0 -> -2 + x^0, rest remain the same}>
3.08/3.11	<l4, l4, 1 <= x^0 /\ 1 <= undef19, {x^0 -> -1 + x^0, rest remain the same}>
3.08/3.11	Variables:
3.08/3.11	x^0
3.08/3.11	
3.08/3.11	Graph 2:
3.08/3.11	Transitions:
3.08/3.11	<l2, l2, undef7 <= 0, {all remain the same}>
3.08/3.11	<l2, l2, 1 <= undef7, {all remain the same}>
3.08/3.11	Variables:
3.08/3.11	
3.08/3.11	Precedence: 
3.08/3.11	Graph 0
3.08/3.11	
3.08/3.11	Graph 1
3.08/3.11	<l0, l4, true, {all remain the same}>
3.08/3.11	
3.08/3.11	Graph 2
3.08/3.11	<l4, l2, x^0 <= 0, {all remain the same}>
3.08/3.11	
3.08/3.11	Map Locations to Subgraph:
3.08/3.11	( 0 , 0 )
3.08/3.11	( 2 , 2 )
3.08/3.11	( 4 , 1 )
3.08/3.11	
3.08/3.11	*******************************************************************************************
3.08/3.11	********************************    CHECKING ASSERTIONS    ********************************
3.08/3.11	*******************************************************************************************
3.08/3.11	
3.08/3.11	Proving termination of subgraph 0
3.08/3.11	Proving termination of subgraph 1
3.08/3.11	Checking unfeasibility...
3.08/3.11	Time used: 0.002592
3.08/3.11	
3.08/3.11	Checking conditional termination of SCC {l4}...
3.08/3.11	
3.08/3.11	LOG: CALL solveLinear
3.08/3.11	
3.08/3.11	LOG: RETURN solveLinear - Elapsed time: 0.001001s
3.08/3.11	Ranking function: -1 + x^0
3.08/3.11	New Graphs: 
3.08/3.11	Proving termination of subgraph 2
3.08/3.11	Checking unfeasibility...
3.08/3.11	Time used: 0.001399
3.08/3.11	
3.08/3.11	> No variable changes in termination graph.
3.08/3.11	Checking conditional unfeasibility...
3.08/3.11	Termination failed. Trying to show unreachability...
3.08/3.11	Proving unreachability of entry: <l4, l2, x^0 <= 0, {all remain the same}>
3.08/3.11	
3.08/3.11	LOG: CALL check - Post:1 <= 0 - Process 1
3.08/3.11	* Exit transition: <l4, l2, x^0 <= 0, {all remain the same}>
3.08/3.11	* Postcondition  : 1 <= 0
3.08/3.11	Postcodition moved up: 1 <= 0
3.08/3.11	
3.08/3.11	LOG: Try proving POST
3.08/3.11	Postcondition: 1 <= 0
3.08/3.11	
3.08/3.11	LOG: CALL check - Post:1 <= 0 - Process 2
3.08/3.11	* Exit transition: <l0, l4, true, {all remain the same}>
3.08/3.11	* Postcondition  : 1 <= 0
3.08/3.11	
3.08/3.11	LOG: CALL solveLinear
3.08/3.11	
3.08/3.11	LOG: RETURN solveLinear - Elapsed time: 0.000179s
3.08/3.11	> Postcondition is not implied!
3.08/3.11	
3.08/3.11	LOG: RETURN check - Elapsed time: 0.000232s
3.08/3.11	
3.08/3.11	LOG: NarrowEntry size 1
3.08/3.11	Narrowing transition: 
3.08/3.11	<l4, l4, undef19 <= 0 /\ 1 <= x^0, {x^0 -> -2 + x^0, rest remain the same}>
3.08/3.11	
3.08/3.11	LOG: Narrow transition size 1
3.08/3.11	Narrowing transition: 
3.08/3.11	<l4, l4, 1 <= x^0 /\ 1 <= undef19, {x^0 -> -1 + x^0, rest remain the same}>
3.08/3.11	
3.08/3.11	LOG: Narrow transition size 1
3.08/3.11	ENTRIES:
3.08/3.11	<l0, l4, 0 <= 0, {all remain the same}>
3.08/3.11	END ENTRIES:
3.08/3.11	GRAPH:
3.08/3.11	<l4, l4, 0 <= 0 /\ undef19 <= 0 /\ 1 <= x^0, {x^0 -> -2 + x^0, rest remain the same}>
3.08/3.11	<l4, l4, 0 <= 0 /\ 1 <= x^0 /\ 1 <= undef19, {x^0 -> -1 + x^0, rest remain the same}>
3.08/3.11	END GRAPH:
3.08/3.11	EXIT: <l4, l2, x^0 <= 0, {all remain the same}>
3.08/3.11	POST: 1 <= 0
3.08/3.11	
3.08/3.11	
3.08/3.11	LOG: Try proving POST
3.08/3.11	Solving with 1 template(s).
3.08/3.11	
3.08/3.11	LOG: CALL solveNonLinearGetFirstSolution
3.08/3.11	
3.08/3.11	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006734s
3.08/3.11	Time used: 0.006577
3.08/3.11	Improving Solution with cost 51 ...
3.08/3.11	
3.08/3.11	LOG: CALL solveNonLinearGetNextSolution
3.08/3.11	
3.08/3.11	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001745s
3.08/3.11	Time used: 1.00171
3.08/3.11	
3.08/3.11	LOG: SAT solveNonLinear - Elapsed time: 1.008478s
3.08/3.11	Cost: 51; Total time: 1.00828
3.08/3.11	Failed at location 4: x^0 <= 0
3.08/3.11	Before Improving: 
3.08/3.11	Quasi-invariant at l4: x^0 <= 0
3.08/3.11	Optimizing invariants...
3.08/3.11	
3.08/3.11	LOG: CALL solveLinear
3.08/3.11	
3.08/3.11	LOG: RETURN solveLinear - Elapsed time: 0.003223s
3.08/3.11	Remaining time after improvement: 0.999069
3.08/3.11	Some transition disabled by a set of quasi-invariant(s):
3.08/3.11	Quasi-invariant at l4: x^0 <= 0
3.08/3.11	
3.08/3.11	LOG: NEXT CALL check - disable
3.08/3.11	
3.08/3.11	LOG: CALL check - Post:x^0 <= 0 - Process 3
3.08/3.11	* Exit transition: <l0, l4, 0 <= 0, {all remain the same}>
3.08/3.11	* Postcondition  : x^0 <= 0
3.08/3.11	
3.08/3.11	LOG: CALL solveLinear
3.08/3.11	
3.08/3.11	LOG: RETURN solveLinear - Elapsed time: 0.000354s
3.08/3.11	> Postcondition is not implied!
3.08/3.11	
3.08/3.11	LOG: RETURN check - Elapsed time: 0.000421s
3.08/3.11	Solving with 2 template(s).
3.08/3.11	
3.08/3.11	LOG: CALL solveNonLinearGetFirstSolution
3.08/3.11	
3.08/3.11	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.021267s
3.08/3.11	Time used: 0.021085
3.08/3.11	Improving Solution with cost 51 ...
3.08/3.11	
3.08/3.11	LOG: CALL solveNonLinearGetNextSolution
3.08/3.11	
3.08/3.11	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000940s
3.08/3.11	Time used: 1.00079
3.08/3.11	
3.08/3.11	LOG: SAT solveNonLinear - Elapsed time: 1.022207s
3.08/3.11	Cost: 51; Total time: 1.02188
3.08/3.11	Failed at location 4: x^0 <= 0
3.08/3.11	Before Improving: 
3.08/3.11	Quasi-invariant at l4: x^0 <= 0
3.08/3.11	Optimizing invariants...
3.08/3.11	
3.08/3.11	LOG: CALL solveLinear
3.08/3.11	
3.08/3.11	LOG: RETURN solveLinear - Elapsed time: 0.010658s
3.08/3.11	Remaining time after improvement: 0.998695
3.08/3.11	Some transition disabled by a set of quasi-invariant(s):
3.08/3.11	Quasi-invariant at l4: x^0 <= 0
3.08/3.11	
3.08/3.11	LOG: NEXT CALL check - disable
3.08/3.11	
3.08/3.11	LOG: CALL check - Post:x^0 <= 0 - Process 4
3.08/3.11	* Exit transition: <l0, l4, 0 <= 0, {all remain the same}>
3.08/3.11	* Postcondition  : x^0 <= 0
3.08/3.11	
3.08/3.11	LOG: CALL solveLinear
3.08/3.11	
3.08/3.11	LOG: RETURN solveLinear - Elapsed time: 0.000468s
3.08/3.11	> Postcondition is not implied!
3.08/3.11	
3.08/3.11	LOG: RETURN check - Elapsed time: 0.000542s
3.08/3.12	Solving with 3 template(s).
3.08/3.12	
3.08/3.12	LOG: CALL solveNonLinearGetFirstSolution
3.08/3.12	
3.08/3.12	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.059586s
3.08/3.12	Time used: 0.059343
3.08/3.12	Improving Solution with cost 51 ...
3.08/3.12	
3.08/3.12	LOG: CALL solveNonLinearGetNextSolution
3.08/3.12	
3.08/3.12	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.941269s
3.08/3.12	Time used: 0.941249
3.08/3.12	
3.08/3.12	LOG: SAT solveNonLinear - Elapsed time: 1.000855s
3.08/3.12	Cost: 51; Total time: 1.00059
3.08/3.12	Failed at location 4: x^0 <= 0
3.08/3.12	Before Improving: 
3.08/3.12	Quasi-invariant at l4: x^0 <= 0
3.08/3.12	Optimizing invariants...
3.08/3.12	
3.08/3.12	LOG: CALL solveLinear
3.08/3.12	
3.08/3.12	LOG: RETURN solveLinear - Elapsed time: 0.014420s
3.08/3.12	Remaining time after improvement: 0.998439
3.08/3.12	Some transition disabled by a set of quasi-invariant(s):
3.08/3.12	Quasi-invariant at l4: x^0 <= 0
3.08/3.12	
3.08/3.12	LOG: NEXT CALL check - disable
3.08/3.12	
3.08/3.12	LOG: CALL check - Post:x^0 <= 0 - Process 5
3.08/3.12	* Exit transition: <l0, l4, 0 <= 0, {all remain the same}>
3.08/3.12	* Postcondition  : x^0 <= 0
3.08/3.12	
3.08/3.12	LOG: CALL solveLinear
3.08/3.12	
3.08/3.12	LOG: RETURN solveLinear - Elapsed time: 0.000635s
3.08/3.12	> Postcondition is not implied!
3.08/3.12	
3.08/3.12	LOG: RETURN check - Elapsed time: 0.000707s
3.08/3.12	
3.08/3.12	LOG: Postcondition is not implied - no solution
3.08/3.12	> Postcondition is not implied!
3.08/3.12	
3.08/3.12	LOG: RETURN check - Elapsed time: 3.070668s
3.08/3.12	Cannot prove unreachability
3.08/3.12	
3.08/3.12	Proving non-termination of subgraph 2
3.08/3.12	Transitions:
3.08/3.12	<l2, l2, undef7 <= 0, {all remain the same}>
3.08/3.12	<l2, l2, 1 <= undef7, {all remain the same}>
3.08/3.12	Variables:
3.08/3.12	
3.08/3.12	Checking conditional non-termination of SCC {l2}...
3.08/3.12	> No exit transition to close.
3.08/3.12	Calling reachability with...
3.08/3.12	Transition: <l2, end, true, {all remain the same}>
3.08/3.12	Conditions: 
3.08/3.12	OPEN EXITS: 
3.08/3.12	<l2, end, true, {all remain the same}>
3.08/3.12	
3.08/3.12	--- Reachability graph ---
3.08/3.12	> Graph without transitions.
3.08/3.12	
3.08/3.12	Calling reachability with...
3.08/3.12	Transition: <l4, l2, x^0 <= 0, {all remain the same}>
3.08/3.12	Conditions: 
3.08/3.12	OPEN EXITS: 
3.08/3.12	<l4, l2, x^0 <= 0, {all remain the same}>
3.08/3.12	
3.08/3.12	--- Reachability graph ---
3.08/3.12	> Graph without transitions.
3.08/3.12	
3.08/3.12	Calling reachability with...
3.08/3.12	Transition: <l0, l4, true, {all remain the same}>
3.08/3.12	Conditions: x^0 <= 0, 
3.08/3.12	OPEN EXITS: 
3.08/3.12	<l0, l4, x^0 <= 0, {all remain the same}>
3.08/3.12	
3.08/3.12	> Conditions are reachable!
3.08/3.12	
3.08/3.12	Program does NOT terminate
3.08/3.12	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
3.08/3.12	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
3.08/3.12	EOF