20.25/20.32	NO
20.25/20.32	
20.25/20.33	Solver Timeout: 4
20.25/20.33	Global Timeout: 300
20.25/20.33	No parsing errors!
20.25/20.33	Init Location: 0
20.25/20.33	Transitions:
20.25/20.33	<l0, l8, true>
20.25/20.33	<l1, l2, (((0 + (~(1) * x_5^0)) + y_6^0) <= 0) /\ (undef1 = undef1), par{Result_4^0 -> undef1}>
20.25/20.33	<l1, l3, (0 <= ((~(1) + (~(1) * x_5^0)) + y_6^0)) /\ (undef6 = undef6) /\ ((0 + undef6) <= 0) /\ (0 <= (0 + undef6)), par{tmp_7^0 -> undef6}>
20.25/20.33	<l3, l1, true>
20.25/20.33	<l1, l4, (0 <= ((~(1) + (~(1) * x_5^0)) + y_6^0)) /\ (undef14 = undef14), par{tmp_7^0 -> undef14}>
20.25/20.33	<l4, l5, ((1 + tmp_7^0) <= 0)>
20.25/20.33	<l4, l5, (1 <= (0 + tmp_7^0))>
20.25/20.33	<l5, l6, true, par{x_5^0 -> (1 + x_5^0)}>
20.25/20.33	<l6, l1, true>
20.25/20.33	<l7, l1, true>
20.25/20.33	<l8, l7, true>
20.25/20.33	
20.25/20.33	Fresh variables:
20.25/20.33	undef1, undef6, undef14, 
20.25/20.33	
20.25/20.33	Undef variables:
20.25/20.33	undef1, undef6, undef14, 
20.25/20.33	
20.25/20.33	Abstraction variables:
20.25/20.33	
20.25/20.33	Exit nodes:
20.25/20.33	
20.25/20.33	Accepting locations:
20.25/20.33	
20.25/20.33	Asserts:
20.25/20.33	
20.25/20.33	Preprocessed LLVMGraph
20.25/20.33	Init Location: 0
20.25/20.33	Transitions:
20.25/20.33	<l0, l1, true>
20.25/20.33	<l1, l2, (((0 + (~(1) * x_5^0)) + y_6^0) <= 0) /\ (undef1 = undef1)>
20.25/20.33	<l1, l1, (0 <= ((~(1) + (~(1) * x_5^0)) + y_6^0)) /\ (undef6 = undef6) /\ ((0 + undef6) <= 0) /\ (0 <= (0 + undef6))>
20.25/20.33	<l1, l1, (0 <= ((~(1) + (~(1) * x_5^0)) + y_6^0)) /\ (undef14 = undef14) /\ ((1 + undef14) <= 0), par{x_5^0 -> (1 + x_5^0)}>
20.25/20.33	<l1, l1, (0 <= ((~(1) + (~(1) * x_5^0)) + y_6^0)) /\ (undef14 = undef14) /\ (1 <= (0 + undef14)), par{x_5^0 -> (1 + x_5^0)}>
20.25/20.33	
20.25/20.33	Fresh variables:
20.25/20.33	undef1, undef6, undef14, 
20.25/20.33	
20.25/20.33	Undef variables:
20.25/20.33	undef1, undef6, undef14, 
20.25/20.33	
20.25/20.33	Abstraction variables:
20.25/20.33	
20.25/20.33	Exit nodes:
20.25/20.33	
20.25/20.33	Accepting locations:
20.25/20.33	
20.25/20.33	Asserts:
20.25/20.33	
20.25/20.33	*************************************************************
20.25/20.33	*******************************************************************************************
20.25/20.33	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
20.25/20.33	*******************************************************************************************
20.25/20.33	
20.25/20.33	Init Location: 0
20.25/20.33	Graph 0:
20.25/20.33	Transitions:
20.25/20.33	Variables:
20.25/20.33	
20.25/20.33	Graph 1:
20.25/20.33	Transitions:
20.25/20.33	<l1, l1, 1 + x_5^0 <= y_6^0 /\ undef6 = 0, {all remain the same}>
20.25/20.33	<l1, l1, 1 + x_5^0 <= y_6^0 /\ 1 + undef14 <= 0, {x_5^0 -> 1 + x_5^0, rest remain the same}>
20.25/20.33	<l1, l1, 1 + x_5^0 <= y_6^0 /\ 1 <= undef14, {x_5^0 -> 1 + x_5^0, rest remain the same}>
20.25/20.33	Variables:
20.25/20.33	x_5^0, y_6^0
20.25/20.33	
20.25/20.33	Graph 2:
20.25/20.33	Transitions:
20.25/20.33	Variables:
20.25/20.33	
20.25/20.33	Precedence: 
20.25/20.33	Graph 0
20.25/20.33	
20.25/20.33	Graph 1
20.25/20.33	<l0, l1, true, {all remain the same}>
20.25/20.33	
20.25/20.33	Graph 2
20.25/20.33	<l1, l2, y_6^0 <= x_5^0, {all remain the same}>
20.25/20.33	
20.25/20.33	Map Locations to Subgraph:
20.25/20.33	( 0 , 0 )
20.25/20.33	( 1 , 1 )
20.25/20.33	( 2 , 2 )
20.25/20.33	
20.25/20.33	*******************************************************************************************
20.25/20.33	********************************    CHECKING ASSERTIONS    ********************************
20.25/20.33	*******************************************************************************************
20.25/20.33	
20.25/20.33	Proving termination of subgraph 0
20.25/20.33	Proving termination of subgraph 1
20.25/20.33	Checking unfeasibility...
20.25/20.33	Time used: 0.004889
20.25/20.33	
20.25/20.33	Checking conditional termination of SCC {l1}...
20.25/20.33	
20.25/20.33	LOG: CALL solveLinear
20.25/20.33	
20.25/20.33	LOG: RETURN solveLinear - Elapsed time: 0.001167s
20.25/20.33	Ranking function: -1 - x_5^0 + y_6^0
20.25/20.33	New Graphs: 
20.25/20.33	Transitions:
20.25/20.33	<l1, l1, 1 + x_5^0 <= y_6^0 /\ undef6 = 0, {all remain the same}>
20.25/20.33	Variables:
20.25/20.33	x_5^0, y_6^0
20.25/20.33	> No variable changes in termination graph.
20.25/20.33	Checking conditional unfeasibility...
20.25/20.33	Calling Safety with literal y_6^0 <= x_5^0 and entry <l1, l1, true, {all remain the same}>
20.25/20.33	
20.25/20.33	LOG: CALL check - Post:y_6^0 <= x_5^0 - Process 1
20.25/20.33	* Exit transition: <l1, l1, true, {all remain the same}>
20.25/20.33	* Postcondition  : y_6^0 <= x_5^0
20.25/20.33	Quasi-invariants: 
20.25/20.33	Location 1: y_6^0 <= x_5^0 ; 
20.25/20.33	Postcondition: y_6^0 <= x_5^0
20.25/20.33	
20.25/20.33	LOG: CALL check - Post:y_6^0 <= x_5^0 - Process 2
20.25/20.33	* Exit transition: <l0, l1, true, {all remain the same}>
20.25/20.33	* Postcondition  : y_6^0 <= x_5^0
20.25/20.33	
20.25/20.33	LOG: CALL solveLinear
20.25/20.33	
20.25/20.33	LOG: RETURN solveLinear - Elapsed time: 0.000261s
20.25/20.33	> Postcondition is not implied!
20.25/20.33	
20.25/20.33	LOG: RETURN check - Elapsed time: 0.000328s
20.25/20.33	
20.25/20.33	LOG: NarrowEntry size 1
20.25/20.33	Narrowing transition: 
20.25/20.33	<l1, l1, 1 + x_5^0 <= y_6^0 /\ undef6 = 0, {all remain the same}>
20.25/20.33	
20.25/20.33	LOG: Narrow transition size 1
20.25/20.33	Narrowing transition: 
20.25/20.33	<l1, l1, 1 + x_5^0 <= y_6^0 /\ 1 + undef14 <= 0, {x_5^0 -> 1 + x_5^0, rest remain the same}>
20.25/20.33	
20.25/20.33	LOG: Narrow transition size 1
20.25/20.33	Narrowing transition: 
20.25/20.33	<l1, l1, 1 + x_5^0 <= y_6^0 /\ 1 <= undef14, {x_5^0 -> 1 + x_5^0, rest remain the same}>
20.25/20.33	
20.25/20.33	LOG: Narrow transition size 1
20.25/20.33	ENTRIES:
20.25/20.33	<l0, l1, 1 + x_5^0 <= y_6^0, {all remain the same}>
20.25/20.33	END ENTRIES:
20.25/20.33	GRAPH:
20.25/20.33	<l1, l1, 1 + x_5^0 <= y_6^0 /\ undef6 = 0, {all remain the same}>
20.25/20.33	<l1, l1, 1 + x_5^0 <= y_6^0 /\ 1 + undef14 <= 0, {x_5^0 -> 1 + x_5^0, rest remain the same}>
20.25/20.33	<l1, l1, 1 + x_5^0 <= y_6^0 /\ 1 <= undef14, {x_5^0 -> 1 + x_5^0, rest remain the same}>
20.25/20.33	END GRAPH:
20.25/20.33	EXIT: <l1, l1, true, {all remain the same}>
20.25/20.33	POST: y_6^0 <= x_5^0
20.25/20.33	
20.25/20.33	
20.25/20.33	LOG: Try proving POST
20.25/20.33	Solving with 1 template(s).
20.25/20.33	
20.25/20.33	LOG: CALL solveNonLinearGetFirstSolution
20.25/20.33	
20.25/20.33	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.014154s
20.25/20.33	Time used: 0.01405
20.25/20.33	Solving with 2 template(s).
20.25/20.33	
20.25/20.33	LOG: CALL solveNonLinearGetFirstSolution
20.25/20.33	
20.25/20.33	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001668s
20.25/20.33	Time used: 4.00046
20.25/20.33	Solving with 3 template(s).
20.25/20.33	
20.25/20.33	LOG: CALL solveNonLinearGetFirstSolution
20.25/20.33	
20.25/20.33	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.004221s
20.25/20.33	Time used: 1.00036
20.25/20.33	
20.25/20.33	LOG: Postcondition is not implied - no solution
20.25/20.33	> Postcondition is not implied!
20.25/20.33	
20.25/20.33	LOG: RETURN check - Elapsed time: 5.029126s
20.25/20.33	
20.25/20.33	Proving non-termination of subgraph 1
20.25/20.33	Transitions:
20.25/20.33	<l1, l1, 1 + x_5^0 <= y_6^0 /\ undef6 = 0, {all remain the same}>
20.25/20.33	<l1, l1, 1 + x_5^0 <= y_6^0 /\ 1 + undef14 <= 0, {x_5^0 -> 1 + x_5^0, rest remain the same}>
20.25/20.33	<l1, l1, 1 + x_5^0 <= y_6^0 /\ 1 <= undef14, {x_5^0 -> 1 + x_5^0, rest remain the same}>
20.25/20.33	Variables:
20.25/20.33	x_5^0, y_6^0
20.25/20.33	
20.25/20.33	Checking conditional non-termination of SCC {l1}...
20.25/20.33	EXIT TRANSITIONS:
20.25/20.33	<l1, end, y_6^0 <= x_5^0, {all remain the same}>
20.25/20.33	
20.25/20.33	Solving with 1 template(s).
20.25/20.33	
20.25/20.33	LOG: CALL solveNonLinearGetFirstSolution
20.25/20.33	
20.25/20.33	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.002764s
20.25/20.33	Time used: 5.00184
20.25/20.33	Solving with 2 template(s).
20.25/20.33	
20.25/20.33	LOG: CALL solveNonLinearGetFirstSolution
20.25/20.33	
20.25/20.33	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.099827s
20.25/20.33	Time used: 5.00091
20.25/20.33	Solving with 3 template(s).
20.25/20.33	
20.25/20.33	LOG: CALL solveNonLinearGetFirstSolution
20.25/20.33	
20.25/20.33	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.011518s
20.25/20.33	Time used: 5.00175
20.25/20.33	> Checking if the negation of the conditions of every pending exit is quasi-invariant... NO
20.25/20.33	
20.25/20.33	Proving non-termination of subgraph 1
20.25/20.33	Transitions:
20.25/20.33	<l1, l1, 1 + x_5^0 <= y_6^0 /\ undef6 = 0, {all remain the same}>
20.25/20.33	Variables:
20.25/20.33	x_5^0, y_6^0
20.25/20.33	
20.25/20.33	Checking conditional non-termination of SCC {l1}...
20.25/20.33	EXIT TRANSITIONS:
20.25/20.33	<l1, end, y_6^0 <= x_5^0, {all remain the same}>
20.25/20.33	
20.25/20.33	Solving with 1 template(s).
20.25/20.33	
20.25/20.33	LOG: CALL solveNonLinearGetFirstSolution
20.25/20.33	
20.25/20.33	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010495s
20.25/20.33	Time used: 0.010313
20.25/20.33	Improving Solution with cost 1 ...
20.25/20.33	
20.25/20.33	LOG: CALL solveNonLinearGetNextSolution
20.25/20.33	
20.25/20.33	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.015505s
20.25/20.33	Time used: 0.015498
20.25/20.33	
20.25/20.33	LOG: SAT solveNonLinear - Elapsed time: 0.026001s
20.25/20.33	Cost: 1; Total time: 0.025811
20.25/20.33	Failed at location 1: 1 + x_5^0 <= y_6^0
20.25/20.33	Before Improving: 
20.25/20.33	Quasi-invariant at l1: 1 + x_5^0 <= y_6^0
20.25/20.33	Optimizing invariants...
20.25/20.33	
20.25/20.33	LOG: CALL solveLinear
20.25/20.33	
20.25/20.33	LOG: RETURN solveLinear - Elapsed time: 0.005124s
20.25/20.33	Remaining time after improvement: 0.998819
20.25/20.33	Minimizing number of undef constraints...
20.25/20.33	
20.25/20.33	LOG: CALL solveNonLinear
20.25/20.33	
20.25/20.33	LOG: RETURN solveNonLinear - Elapsed time: 0.002141s
20.25/20.33	Number of undef constraints reduced!
20.25/20.33	
20.25/20.33	Non-termination implied by a set of quasi-invariant(s):
20.25/20.33	Quasi-invariant at l1: 1 + x_5^0 <= y_6^0
20.25/20.33	
20.25/20.33	Strengthening and disabling EXIT transitions...
20.25/20.33	Closed exits from l1: 1
20.25/20.33	
20.25/20.33	Strengthening and disabling transitions...
20.25/20.33	
20.25/20.33	LOG: CALL solverLinear in Graph for feasibility
20.25/20.33	
20.25/20.33	LOG: RETURN solveLinear in Graph for feasibility
20.25/20.33	Strengthening transition (result): 
20.25/20.33	<l1, l1, 1 + x_5^0 <= y_6^0 /\ undef6 = 0, {all remain the same}>
20.25/20.33	
20.25/20.33	Calling reachability with...
20.25/20.33	Transition: <l1, end, true, {all remain the same}>
20.25/20.33	Conditions: 1 + x_5^0 <= y_6^0, 
20.25/20.33	OPEN EXITS: 
20.25/20.33	<l1, end, 1 + x_5^0 <= y_6^0, {all remain the same}>
20.25/20.33	
20.25/20.33	--- Reachability graph ---
20.25/20.33	> Graph without transitions.
20.25/20.33	
20.25/20.33	Calling reachability with...
20.25/20.33	Transition: <l0, l1, true, {all remain the same}>
20.25/20.33	Conditions: 1 + x_5^0 <= y_6^0, 
20.25/20.33	OPEN EXITS: 
20.25/20.33	<l0, l1, 1 + x_5^0 <= y_6^0, {all remain the same}>
20.25/20.33	
20.25/20.33	> Conditions are reachable!
20.25/20.33	
20.25/20.33	Program does NOT terminate
20.25/20.33	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
20.25/20.33	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
20.25/20.33	EOF