15.20/15.26	NO
15.20/15.26	
15.25/15.26	Solver Timeout: 4
15.25/15.26	Global Timeout: 300
15.25/15.26	No parsing errors!
15.25/15.26	Init Location: 0
15.25/15.26	Transitions:
15.25/15.26	<l0, l14, true>
15.25/15.26	<l1, l2, true>
15.25/15.26	<l2, l3, (((0 + (~(1) * x_5^0)) + y_6^0) <= 0) /\ (((0 + (~(1) * x_5^0)) + y_6^0) <= 0)>
15.25/15.26	<l3, l4, ((1 + x_5^0) <= (0 + y_6^0))>
15.25/15.26	<l3, l4, ((1 + y_6^0) <= (0 + x_5^0))>
15.25/15.26	<l4, l5, (undef17 = undef17), par{Result_4^0 -> undef17}>
15.25/15.26	<l2, l6, (((0 + (~(1) * x_5^0)) + y_6^0) <= 0) /\ (((0 + (~(1) * x_5^0)) + y_6^0) <= 0) /\ ((0 + x_5^0) <= (0 + y_6^0)) /\ ((0 + y_6^0) <= (0 + x_5^0)) /\ (undef22 = undef22) /\ ((0 + undef22) <= 0) /\ (0 <= (0 + undef22)), par{tmp_7^0 -> undef22}>
15.25/15.26	<l6, l2, true>
15.25/15.26	<l2, l7, (((0 + (~(1) * x_5^0)) + y_6^0) <= 0) /\ (((0 + (~(1) * x_5^0)) + y_6^0) <= 0) /\ ((0 + x_5^0) <= (0 + y_6^0)) /\ ((0 + y_6^0) <= (0 + x_5^0)) /\ (undef30 = undef30), par{tmp_7^0 -> undef30}>
15.25/15.26	<l7, l8, ((1 + tmp_7^0) <= 0)>
15.25/15.26	<l7, l8, (1 <= (0 + tmp_7^0))>
15.25/15.26	<l8, l9, true, par{x_5^0 -> (1 + x_5^0)}>
15.25/15.26	<l9, l2, true>
15.25/15.26	<l2, l10, (0 <= ((~(1) + (~(1) * x_5^0)) + y_6^0)) /\ (undef50 = undef50) /\ ((0 + undef50) <= 0) /\ (0 <= (0 + undef50)), par{tmp_7^0 -> undef50}>
15.25/15.26	<l10, l2, true>
15.25/15.26	<l2, l11, (0 <= ((~(1) + (~(1) * x_5^0)) + y_6^0)) /\ (undef58 = undef58), par{tmp_7^0 -> undef58}>
15.25/15.26	<l11, l12, ((1 + tmp_7^0) <= 0)>
15.25/15.26	<l11, l12, (1 <= (0 + tmp_7^0))>
15.25/15.26	<l12, l13, true, par{x_5^0 -> (1 + x_5^0)}>
15.25/15.26	<l13, l2, true>
15.25/15.26	<l14, l1, true>
15.25/15.26	
15.25/15.26	Fresh variables:
15.25/15.26	undef17, undef22, undef30, undef50, undef58, 
15.25/15.26	
15.25/15.26	Undef variables:
15.25/15.26	undef17, undef22, undef30, undef50, undef58, 
15.25/15.26	
15.25/15.26	Abstraction variables:
15.25/15.26	
15.25/15.26	Exit nodes:
15.25/15.26	
15.25/15.26	Accepting locations:
15.25/15.26	
15.25/15.26	Asserts:
15.25/15.26	
15.25/15.26	Preprocessed LLVMGraph
15.25/15.26	Init Location: 0
15.25/15.26	Transitions:
15.25/15.26	<l0, l2, true>
15.25/15.26	<l2, l5, (((0 + (~(1) * x_5^0)) + y_6^0) <= 0) /\ (((0 + (~(1) * x_5^0)) + y_6^0) <= 0) /\ ((1 + y_6^0) <= (0 + x_5^0)) /\ (undef17 = undef17)>
15.25/15.26	<l2, l2, (((0 + (~(1) * x_5^0)) + y_6^0) <= 0) /\ (((0 + (~(1) * x_5^0)) + y_6^0) <= 0) /\ ((0 + x_5^0) <= (0 + y_6^0)) /\ ((0 + y_6^0) <= (0 + x_5^0)) /\ (undef22 = undef22) /\ ((0 + undef22) <= 0) /\ (0 <= (0 + undef22))>
15.25/15.26	<l2, l2, (((0 + (~(1) * x_5^0)) + y_6^0) <= 0) /\ (((0 + (~(1) * x_5^0)) + y_6^0) <= 0) /\ ((0 + x_5^0) <= (0 + y_6^0)) /\ ((0 + y_6^0) <= (0 + x_5^0)) /\ (undef30 = undef30) /\ ((1 + undef30) <= 0), par{x_5^0 -> (1 + x_5^0)}>
15.25/15.26	<l2, l2, (((0 + (~(1) * x_5^0)) + y_6^0) <= 0) /\ (((0 + (~(1) * x_5^0)) + y_6^0) <= 0) /\ ((0 + x_5^0) <= (0 + y_6^0)) /\ ((0 + y_6^0) <= (0 + x_5^0)) /\ (undef30 = undef30) /\ (1 <= (0 + undef30)), par{x_5^0 -> (1 + x_5^0)}>
15.25/15.26	<l2, l2, (0 <= ((~(1) + (~(1) * x_5^0)) + y_6^0)) /\ (undef50 = undef50) /\ ((0 + undef50) <= 0) /\ (0 <= (0 + undef50))>
15.25/15.26	<l2, l2, (0 <= ((~(1) + (~(1) * x_5^0)) + y_6^0)) /\ (undef58 = undef58) /\ ((1 + undef58) <= 0), par{x_5^0 -> (1 + x_5^0)}>
15.25/15.26	<l2, l2, (0 <= ((~(1) + (~(1) * x_5^0)) + y_6^0)) /\ (undef58 = undef58) /\ (1 <= (0 + undef58)), par{x_5^0 -> (1 + x_5^0)}>
15.25/15.26	
15.25/15.26	Fresh variables:
15.25/15.26	undef17, undef22, undef30, undef50, undef58, 
15.25/15.26	
15.25/15.26	Undef variables:
15.25/15.26	undef17, undef22, undef30, undef50, undef58, 
15.25/15.26	
15.25/15.26	Abstraction variables:
15.25/15.26	
15.25/15.26	Exit nodes:
15.25/15.26	
15.25/15.26	Accepting locations:
15.25/15.26	
15.25/15.26	Asserts:
15.25/15.26	
15.25/15.26	*************************************************************
15.25/15.26	*******************************************************************************************
15.25/15.26	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
15.25/15.26	*******************************************************************************************
15.25/15.26	
15.25/15.26	Init Location: 0
15.25/15.26	Graph 0:
15.25/15.26	Transitions:
15.25/15.26	Variables:
15.25/15.26	
15.25/15.26	Graph 1:
15.25/15.26	Transitions:
15.25/15.26	<l2, l2, x_5^0 = y_6^0 /\ undef22 = 0, {all remain the same}>
15.25/15.26	<l2, l2, 1 + undef30 <= 0 /\ x_5^0 = y_6^0, {x_5^0 -> 1 + x_5^0, rest remain the same}>
15.25/15.26	<l2, l2, 1 <= undef30 /\ x_5^0 = y_6^0, {x_5^0 -> 1 + x_5^0, rest remain the same}>
15.25/15.26	<l2, l2, 1 + x_5^0 <= y_6^0 /\ undef50 = 0, {all remain the same}>
15.25/15.26	<l2, l2, 1 + x_5^0 <= y_6^0 /\ 1 + undef58 <= 0, {x_5^0 -> 1 + x_5^0, rest remain the same}>
15.25/15.26	<l2, l2, 1 + x_5^0 <= y_6^0 /\ 1 <= undef58, {x_5^0 -> 1 + x_5^0, rest remain the same}>
15.25/15.26	Variables:
15.25/15.26	x_5^0, y_6^0
15.25/15.26	
15.25/15.26	Graph 2:
15.25/15.26	Transitions:
15.25/15.26	Variables:
15.25/15.26	
15.25/15.26	Precedence: 
15.25/15.26	Graph 0
15.25/15.26	
15.25/15.26	Graph 1
15.25/15.26	<l0, l2, true, {all remain the same}>
15.25/15.26	
15.25/15.26	Graph 2
15.25/15.26	<l2, l5, 1 + y_6^0 <= x_5^0, {all remain the same}>
15.25/15.26	
15.25/15.26	Map Locations to Subgraph:
15.25/15.26	( 0 , 0 )
15.25/15.26	( 2 , 1 )
15.25/15.26	( 5 , 2 )
15.25/15.26	
15.25/15.26	*******************************************************************************************
15.25/15.26	********************************    CHECKING ASSERTIONS    ********************************
15.25/15.26	*******************************************************************************************
15.25/15.26	
15.25/15.26	Proving termination of subgraph 0
15.25/15.26	Proving termination of subgraph 1
15.25/15.26	Checking unfeasibility...
15.25/15.26	Time used: 0.012953
15.25/15.26	
15.25/15.26	Checking conditional termination of SCC {l2}...
15.25/15.26	
15.25/15.26	LOG: CALL solveLinear
15.25/15.26	
15.25/15.26	LOG: RETURN solveLinear - Elapsed time: 0.002786s
15.25/15.26	Ranking function: -x_5^0 + y_6^0
15.25/15.26	New Graphs: 
15.25/15.26	Transitions:
15.25/15.26	<l2, l2, x_5^0 = y_6^0 /\ undef22 = 0, {all remain the same}>
15.25/15.26	<l2, l2, 1 + x_5^0 <= y_6^0 /\ undef50 = 0, {all remain the same}>
15.25/15.26	Variables:
15.25/15.26	x_5^0, y_6^0
15.25/15.26	> No variable changes in termination graph.
15.25/15.26	Checking conditional unfeasibility...
15.25/15.26	Termination failed. Trying to show unreachability...
15.25/15.26	Proving unreachability of entry: <l0, l2, true, {all remain the same}>
15.25/15.26	
15.25/15.26	LOG: CALL check - Post:1 <= 0 - Process 1
15.25/15.26	* Exit transition: <l0, l2, true, {all remain the same}>
15.25/15.26	* Postcondition  : 1 <= 0
15.25/15.26	
15.25/15.26	LOG: CALL solveLinear
15.25/15.26	
15.25/15.26	LOG: RETURN solveLinear - Elapsed time: 0.000257s
15.25/15.26	> Postcondition is not implied!
15.25/15.26	
15.25/15.26	LOG: RETURN check - Elapsed time: 0.000313s
15.25/15.26	Cannot prove unreachability
15.25/15.26	
15.25/15.26	Proving non-termination of subgraph 1
15.25/15.26	Transitions:
15.25/15.26	<l2, l2, x_5^0 = y_6^0 /\ undef22 = 0, {all remain the same}>
15.25/15.26	<l2, l2, 1 + undef30 <= 0 /\ x_5^0 = y_6^0, {x_5^0 -> 1 + x_5^0, rest remain the same}>
15.25/15.26	<l2, l2, 1 <= undef30 /\ x_5^0 = y_6^0, {x_5^0 -> 1 + x_5^0, rest remain the same}>
15.25/15.26	<l2, l2, 1 + x_5^0 <= y_6^0 /\ undef50 = 0, {all remain the same}>
15.25/15.26	<l2, l2, 1 + x_5^0 <= y_6^0 /\ 1 + undef58 <= 0, {x_5^0 -> 1 + x_5^0, rest remain the same}>
15.25/15.26	<l2, l2, 1 + x_5^0 <= y_6^0 /\ 1 <= undef58, {x_5^0 -> 1 + x_5^0, rest remain the same}>
15.25/15.26	Variables:
15.25/15.26	x_5^0, y_6^0
15.25/15.26	
15.25/15.26	Checking conditional non-termination of SCC {l2}...
15.25/15.26	EXIT TRANSITIONS:
15.25/15.26	<l2, end, 1 + y_6^0 <= x_5^0, {all remain the same}>
15.25/15.26	
15.25/15.26	Solving with 1 template(s).
15.25/15.26	
15.25/15.26	LOG: CALL solveNonLinearGetFirstSolution
15.25/15.26	
15.25/15.26	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.004135s
15.25/15.26	Time used: 5.00305
15.25/15.26	Solving with 2 template(s).
15.25/15.26	
15.25/15.26	LOG: CALL solveNonLinearGetFirstSolution
15.25/15.26	
15.25/15.26	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.046906s
15.25/15.26	Time used: 5.04191
15.25/15.26	Solving with 3 template(s).
15.25/15.26	
15.25/15.26	LOG: CALL solveNonLinearGetFirstSolution
15.25/15.26	
15.25/15.26	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.020695s
15.25/15.26	Time used: 5.00134
15.25/15.26	> Checking if the negation of the conditions of every pending exit is quasi-invariant... NO
15.25/15.26	
15.25/15.26	Proving non-termination of subgraph 1
15.25/15.26	Transitions:
15.25/15.26	<l2, l2, x_5^0 = y_6^0 /\ undef22 = 0, {all remain the same}>
15.25/15.26	<l2, l2, 1 + x_5^0 <= y_6^0 /\ undef50 = 0, {all remain the same}>
15.25/15.26	Variables:
15.25/15.26	x_5^0, y_6^0
15.25/15.26	
15.25/15.26	Checking conditional non-termination of SCC {l2}...
15.25/15.26	EXIT TRANSITIONS:
15.25/15.26	<l2, end, 1 + y_6^0 <= x_5^0, {all remain the same}>
15.25/15.26	
15.25/15.26	Solving with 1 template(s).
15.25/15.26	
15.25/15.26	LOG: CALL solveNonLinearGetFirstSolution
15.25/15.26	
15.25/15.26	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.017245s
15.25/15.26	Time used: 0.017034
15.25/15.26	Improving Solution with cost 1 ...
15.25/15.26	
15.25/15.26	LOG: CALL solveNonLinearGetNextSolution
15.25/15.26	
15.25/15.26	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.030782s
15.25/15.26	Time used: 0.030772
15.25/15.26	
15.25/15.26	LOG: SAT solveNonLinear - Elapsed time: 0.048027s
15.25/15.26	Cost: 1; Total time: 0.047806
15.25/15.26	Failed at location 2: x_5^0 <= y_6^0
15.25/15.26	Before Improving: 
15.25/15.26	Quasi-invariant at l2: x_5^0 <= y_6^0
15.25/15.26	Optimizing invariants...
15.25/15.26	
15.25/15.26	LOG: CALL solveLinear
15.25/15.26	
15.25/15.26	LOG: RETURN solveLinear - Elapsed time: 0.011156s
15.25/15.26	Remaining time after improvement: 0.997388
15.25/15.26	Minimizing number of undef constraints...
15.25/15.26	
15.25/15.26	LOG: CALL solveNonLinear
15.25/15.26	
15.25/15.26	LOG: RETURN solveNonLinear - Elapsed time: 0.003284s
15.25/15.26	Number of undef constraints reduced!
15.25/15.26	
15.25/15.26	Non-termination implied by a set of quasi-invariant(s):
15.25/15.26	Quasi-invariant at l2: x_5^0 <= y_6^0
15.25/15.26	
15.25/15.26	Strengthening and disabling EXIT transitions...
15.25/15.26	Closed exits from l2: 1
15.25/15.26	
15.25/15.26	Strengthening and disabling transitions...
15.25/15.26	
15.25/15.26	LOG: CALL solverLinear in Graph for feasibility
15.25/15.26	
15.25/15.26	LOG: RETURN solveLinear in Graph for feasibility
15.25/15.26	Strengthening transition (result): 
15.25/15.26	<l2, l2, x_5^0 = y_6^0 /\ undef22 = 0, {all remain the same}>
15.25/15.26	
15.25/15.26	LOG: CALL solverLinear in Graph for feasibility
15.25/15.26	
15.25/15.26	LOG: RETURN solveLinear in Graph for feasibility
15.25/15.26	Strengthening transition (result): 
15.25/15.26	<l2, l2, 1 + x_5^0 <= y_6^0 /\ undef50 = 0, {all remain the same}>
15.25/15.26	
15.25/15.26	Calling reachability with...
15.25/15.26	Transition: <l2, end, true, {all remain the same}>
15.25/15.26	Conditions: x_5^0 <= y_6^0, 
15.25/15.26	OPEN EXITS: 
15.25/15.26	<l2, end, x_5^0 <= y_6^0, {all remain the same}>
15.25/15.26	
15.25/15.26	--- Reachability graph ---
15.25/15.26	> Graph without transitions.
15.25/15.26	
15.25/15.26	Calling reachability with...
15.25/15.26	Transition: <l0, l2, true, {all remain the same}>
15.25/15.26	Conditions: x_5^0 <= y_6^0, 
15.25/15.26	OPEN EXITS: 
15.25/15.26	<l0, l2, x_5^0 <= y_6^0, {all remain the same}>
15.25/15.26	
15.25/15.26	> Conditions are reachable!
15.25/15.26	
15.25/15.26	Program does NOT terminate
15.25/15.26	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
15.25/15.26	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
15.25/15.26	EOF