20.24/20.30	NO
20.24/20.30	
20.24/20.31	Solver Timeout: 4
20.24/20.31	Global Timeout: 300
20.24/20.31	No parsing errors!
20.24/20.31	Init Location: 0
20.24/20.31	Transitions:
20.24/20.31	<l0, l7, true>
20.24/20.31	<l1, l2, (((0 + (~(1) * x_5^0)) + y_6^0) <= 0) /\ (undef1 = undef1), par{Result_4^0 -> undef1}>
20.24/20.31	<l1, l3, (0 <= ((~(1) + (~(1) * x_5^0)) + y_6^0)) /\ (undef6 = undef6) /\ ((0 + undef6) <= 0) /\ (0 <= (0 + undef6)), par{tmp_7^0 -> undef6, y_6^0 -> (~(1) + y_6^0)}>
20.24/20.31	<l3, l1, true>
20.24/20.31	<l1, l4, (0 <= ((~(1) + (~(1) * x_5^0)) + y_6^0)) /\ (undef14 = undef14), par{tmp_7^0 -> undef14}>
20.24/20.31	<l4, l5, ((1 + tmp_7^0) <= 0)>
20.24/20.31	<l4, l5, (1 <= (0 + tmp_7^0))>
20.24/20.31	<l5, l1, true>
20.24/20.31	<l6, l1, true>
20.24/20.31	<l7, l6, true>
20.24/20.31	
20.24/20.31	Fresh variables:
20.24/20.31	undef1, undef6, undef14, 
20.24/20.31	
20.24/20.31	Undef variables:
20.24/20.31	undef1, undef6, undef14, 
20.24/20.31	
20.24/20.31	Abstraction variables:
20.24/20.31	
20.24/20.31	Exit nodes:
20.24/20.31	
20.24/20.31	Accepting locations:
20.24/20.31	
20.24/20.31	Asserts:
20.24/20.31	
20.24/20.31	Preprocessed LLVMGraph
20.24/20.31	Init Location: 0
20.24/20.31	Transitions:
20.24/20.31	<l0, l1, true>
20.24/20.31	<l1, l2, (((0 + (~(1) * x_5^0)) + y_6^0) <= 0) /\ (undef1 = undef1)>
20.24/20.31	<l1, l1, (0 <= ((~(1) + (~(1) * x_5^0)) + y_6^0)) /\ (undef6 = undef6) /\ ((0 + undef6) <= 0) /\ (0 <= (0 + undef6)), par{y_6^0 -> (~(1) + y_6^0)}>
20.24/20.31	<l1, l1, (0 <= ((~(1) + (~(1) * x_5^0)) + y_6^0)) /\ (undef14 = undef14) /\ ((1 + undef14) <= 0)>
20.24/20.31	<l1, l1, (0 <= ((~(1) + (~(1) * x_5^0)) + y_6^0)) /\ (undef14 = undef14) /\ (1 <= (0 + undef14))>
20.24/20.31	
20.24/20.31	Fresh variables:
20.24/20.31	undef1, undef6, undef14, 
20.24/20.31	
20.24/20.31	Undef variables:
20.24/20.31	undef1, undef6, undef14, 
20.24/20.31	
20.24/20.31	Abstraction variables:
20.24/20.31	
20.24/20.31	Exit nodes:
20.24/20.31	
20.24/20.31	Accepting locations:
20.24/20.31	
20.24/20.31	Asserts:
20.24/20.31	
20.24/20.31	*************************************************************
20.24/20.31	*******************************************************************************************
20.24/20.31	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
20.24/20.31	*******************************************************************************************
20.24/20.31	
20.24/20.31	Init Location: 0
20.24/20.31	Graph 0:
20.24/20.31	Transitions:
20.24/20.31	Variables:
20.24/20.31	
20.24/20.31	Graph 1:
20.24/20.31	Transitions:
20.24/20.31	<l1, l1, 1 + x_5^0 <= y_6^0 /\ undef6 = 0, {y_6^0 -> -1 + y_6^0, rest remain the same}>
20.24/20.31	<l1, l1, 1 + x_5^0 <= y_6^0 /\ 1 + undef14 <= 0, {all remain the same}>
20.24/20.31	<l1, l1, 1 + x_5^0 <= y_6^0 /\ 1 <= undef14, {all remain the same}>
20.24/20.31	Variables:
20.24/20.31	x_5^0, y_6^0
20.24/20.31	
20.24/20.31	Graph 2:
20.24/20.31	Transitions:
20.24/20.31	Variables:
20.24/20.31	
20.24/20.31	Precedence: 
20.24/20.31	Graph 0
20.24/20.31	
20.24/20.31	Graph 1
20.24/20.31	<l0, l1, true, {all remain the same}>
20.24/20.31	
20.24/20.31	Graph 2
20.24/20.31	<l1, l2, y_6^0 <= x_5^0, {all remain the same}>
20.24/20.31	
20.24/20.31	Map Locations to Subgraph:
20.24/20.31	( 0 , 0 )
20.24/20.31	( 1 , 1 )
20.24/20.31	( 2 , 2 )
20.24/20.31	
20.24/20.31	*******************************************************************************************
20.24/20.31	********************************    CHECKING ASSERTIONS    ********************************
20.24/20.31	*******************************************************************************************
20.24/20.31	
20.24/20.31	Proving termination of subgraph 0
20.24/20.31	Proving termination of subgraph 1
20.24/20.31	Checking unfeasibility...
20.24/20.31	Time used: 0.004963
20.24/20.31	
20.24/20.31	Checking conditional termination of SCC {l1}...
20.24/20.31	
20.24/20.31	LOG: CALL solveLinear
20.24/20.31	
20.24/20.31	LOG: RETURN solveLinear - Elapsed time: 0.000750s
20.24/20.31	Ranking function: -1 - x_5^0 + y_6^0
20.24/20.31	New Graphs: 
20.24/20.31	Transitions:
20.24/20.31	<l1, l1, 1 + x_5^0 <= y_6^0 /\ 1 + undef14 <= 0, {all remain the same}>
20.24/20.31	<l1, l1, 1 + x_5^0 <= y_6^0 /\ 1 <= undef14, {all remain the same}>
20.24/20.31	Variables:
20.24/20.31	x_5^0, y_6^0
20.24/20.31	> No variable changes in termination graph.
20.24/20.31	Checking conditional unfeasibility...
20.24/20.31	Calling Safety with literal y_6^0 <= x_5^0 and entry <l1, l1, true, {all remain the same}>
20.24/20.31	
20.24/20.31	LOG: CALL check - Post:y_6^0 <= x_5^0 - Process 1
20.24/20.31	* Exit transition: <l1, l1, true, {all remain the same}>
20.24/20.31	* Postcondition  : y_6^0 <= x_5^0
20.24/20.31	Quasi-invariants: 
20.24/20.31	Location 1: y_6^0 <= x_5^0 ; 
20.24/20.31	Postcondition: y_6^0 <= x_5^0
20.24/20.31	
20.24/20.31	LOG: CALL check - Post:y_6^0 <= x_5^0 - Process 2
20.24/20.31	* Exit transition: <l0, l1, true, {all remain the same}>
20.24/20.31	* Postcondition  : y_6^0 <= x_5^0
20.24/20.31	
20.24/20.31	LOG: CALL solveLinear
20.24/20.31	
20.24/20.31	LOG: RETURN solveLinear - Elapsed time: 0.000259s
20.24/20.31	> Postcondition is not implied!
20.24/20.31	
20.24/20.31	LOG: RETURN check - Elapsed time: 0.000327s
20.24/20.31	
20.24/20.31	LOG: NarrowEntry size 1
20.24/20.31	Narrowing transition: 
20.24/20.31	<l1, l1, 1 + x_5^0 <= y_6^0 /\ undef6 = 0, {y_6^0 -> -1 + y_6^0, rest remain the same}>
20.24/20.31	
20.24/20.31	LOG: Narrow transition size 1
20.24/20.31	Narrowing transition: 
20.24/20.31	<l1, l1, 1 + x_5^0 <= y_6^0 /\ 1 + undef14 <= 0, {all remain the same}>
20.24/20.31	
20.24/20.31	LOG: Narrow transition size 1
20.24/20.31	Narrowing transition: 
20.24/20.31	<l1, l1, 1 + x_5^0 <= y_6^0 /\ 1 <= undef14, {all remain the same}>
20.24/20.31	
20.24/20.31	LOG: Narrow transition size 1
20.24/20.31	ENTRIES:
20.24/20.31	<l0, l1, 1 + x_5^0 <= y_6^0, {all remain the same}>
20.24/20.31	END ENTRIES:
20.24/20.31	GRAPH:
20.24/20.31	<l1, l1, 1 + x_5^0 <= y_6^0 /\ undef6 = 0, {y_6^0 -> -1 + y_6^0, rest remain the same}>
20.24/20.31	<l1, l1, 1 + x_5^0 <= y_6^0 /\ 1 + undef14 <= 0, {all remain the same}>
20.24/20.31	<l1, l1, 1 + x_5^0 <= y_6^0 /\ 1 <= undef14, {all remain the same}>
20.24/20.31	END GRAPH:
20.24/20.31	EXIT: <l1, l1, true, {all remain the same}>
20.24/20.31	POST: y_6^0 <= x_5^0
20.24/20.31	
20.24/20.31	
20.24/20.31	LOG: Try proving POST
20.24/20.31	Solving with 1 template(s).
20.24/20.31	
20.24/20.31	LOG: CALL solveNonLinearGetFirstSolution
20.24/20.31	
20.24/20.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.015147s
20.24/20.31	Time used: 0.014895
20.24/20.31	Solving with 2 template(s).
20.24/20.31	
20.24/20.31	LOG: CALL solveNonLinearGetFirstSolution
20.24/20.31	
20.24/20.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001182s
20.24/20.31	Time used: 4.00049
20.24/20.31	Solving with 3 template(s).
20.24/20.31	
20.24/20.31	LOG: CALL solveNonLinearGetFirstSolution
20.24/20.31	
20.24/20.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.031635s
20.24/20.31	Time used: 1.02757
20.24/20.31	
20.24/20.31	LOG: Postcondition is not implied - no solution
20.24/20.31	> Postcondition is not implied!
20.24/20.31	
20.24/20.31	LOG: RETURN check - Elapsed time: 5.057041s
20.24/20.31	
20.24/20.31	Proving non-termination of subgraph 1
20.24/20.31	Transitions:
20.24/20.31	<l1, l1, 1 + x_5^0 <= y_6^0 /\ undef6 = 0, {y_6^0 -> -1 + y_6^0, rest remain the same}>
20.24/20.31	<l1, l1, 1 + x_5^0 <= y_6^0 /\ 1 + undef14 <= 0, {all remain the same}>
20.24/20.31	<l1, l1, 1 + x_5^0 <= y_6^0 /\ 1 <= undef14, {all remain the same}>
20.24/20.31	Variables:
20.24/20.31	x_5^0, y_6^0
20.24/20.31	
20.24/20.31	Checking conditional non-termination of SCC {l1}...
20.24/20.31	EXIT TRANSITIONS:
20.24/20.31	<l1, end, y_6^0 <= x_5^0, {all remain the same}>
20.24/20.31	
20.24/20.31	Solving with 1 template(s).
20.24/20.31	
20.24/20.31	LOG: CALL solveNonLinearGetFirstSolution
20.24/20.31	
20.24/20.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.003143s
20.24/20.31	Time used: 5.0026
20.24/20.31	Solving with 2 template(s).
20.24/20.31	
20.24/20.31	LOG: CALL solveNonLinearGetFirstSolution
20.24/20.31	
20.24/20.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.010229s
20.24/20.31	Time used: 5.00197
20.24/20.31	Solving with 3 template(s).
20.24/20.31	
20.24/20.31	LOG: CALL solveNonLinearGetFirstSolution
20.24/20.31	
20.24/20.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.015746s
20.24/20.31	Time used: 5.00461
20.24/20.31	> Checking if the negation of the conditions of every pending exit is quasi-invariant... NO
20.24/20.31	
20.24/20.31	Proving non-termination of subgraph 1
20.24/20.31	Transitions:
20.24/20.31	<l1, l1, 1 + x_5^0 <= y_6^0 /\ 1 + undef14 <= 0, {all remain the same}>
20.24/20.31	<l1, l1, 1 + x_5^0 <= y_6^0 /\ 1 <= undef14, {all remain the same}>
20.24/20.31	Variables:
20.24/20.31	x_5^0, y_6^0
20.24/20.31	
20.24/20.31	Checking conditional non-termination of SCC {l1}...
20.24/20.31	EXIT TRANSITIONS:
20.24/20.31	<l1, end, y_6^0 <= x_5^0, {all remain the same}>
20.24/20.31	
20.24/20.31	Solving with 1 template(s).
20.24/20.31	
20.24/20.31	LOG: CALL solveNonLinearGetFirstSolution
20.24/20.31	
20.24/20.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.019177s
20.24/20.31	Time used: 0.018942
20.24/20.31	Improving Solution with cost 1 ...
20.24/20.31	
20.24/20.31	LOG: CALL solveNonLinearGetNextSolution
20.24/20.31	
20.24/20.31	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.031330s
20.24/20.31	Time used: 0.031324
20.24/20.31	
20.24/20.31	LOG: SAT solveNonLinear - Elapsed time: 0.050507s
20.24/20.31	Cost: 1; Total time: 0.050266
20.24/20.31	Failed at location 1: 1 + x_5^0 <= y_6^0
20.24/20.31	Before Improving: 
20.24/20.31	Quasi-invariant at l1: 1 + x_5^0 <= y_6^0
20.24/20.31	Optimizing invariants...
20.24/20.31	
20.24/20.31	LOG: CALL solveLinear
20.24/20.31	
20.24/20.31	LOG: RETURN solveLinear - Elapsed time: 0.010867s
20.24/20.31	Remaining time after improvement: 0.998368
20.24/20.31	Minimizing number of undef constraints...
20.24/20.31	
20.24/20.31	LOG: CALL solveNonLinear
20.24/20.31	
20.24/20.31	LOG: RETURN solveNonLinear - Elapsed time: 0.003400s
20.24/20.31	Number of undef constraints reduced!
20.24/20.31	
20.24/20.31	Non-termination implied by a set of quasi-invariant(s):
20.24/20.31	Quasi-invariant at l1: 1 + x_5^0 <= y_6^0
20.24/20.31	
20.24/20.31	Strengthening and disabling EXIT transitions...
20.24/20.31	Closed exits from l1: 1
20.24/20.31	
20.24/20.31	Strengthening and disabling transitions...
20.24/20.31	
20.24/20.31	LOG: CALL solverLinear in Graph for feasibility
20.24/20.31	
20.24/20.31	LOG: RETURN solveLinear in Graph for feasibility
20.24/20.31	Strengthening transition (result): 
20.24/20.31	<l1, l1, 1 + x_5^0 <= y_6^0 /\ 1 + undef14 <= 0, {all remain the same}>
20.24/20.31	
20.24/20.31	LOG: CALL solverLinear in Graph for feasibility
20.24/20.31	
20.24/20.31	LOG: RETURN solveLinear in Graph for feasibility
20.24/20.31	Strengthening transition (result): 
20.24/20.31	<l1, l1, 1 + x_5^0 <= y_6^0 /\ 1 <= undef14, {all remain the same}>
20.24/20.31	
20.24/20.31	Calling reachability with...
20.24/20.31	Transition: <l1, end, true, {all remain the same}>
20.24/20.31	Conditions: 1 + x_5^0 <= y_6^0, 
20.24/20.31	OPEN EXITS: 
20.24/20.31	<l1, end, 1 + x_5^0 <= y_6^0, {all remain the same}>
20.24/20.31	
20.24/20.31	--- Reachability graph ---
20.24/20.31	> Graph without transitions.
20.24/20.31	
20.24/20.31	Calling reachability with...
20.24/20.31	Transition: <l0, l1, true, {all remain the same}>
20.24/20.31	Conditions: 1 + x_5^0 <= y_6^0, 
20.24/20.31	OPEN EXITS: 
20.24/20.31	<l0, l1, 1 + x_5^0 <= y_6^0, {all remain the same}>
20.24/20.31	
20.24/20.31	> Conditions are reachable!
20.24/20.31	
20.24/20.31	Program does NOT terminate
20.24/20.31	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
20.24/20.31	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
20.24/20.31	EOF