20.29/20.33	NO
20.29/20.33	
20.29/20.33	Solver Timeout: 4
20.29/20.33	Global Timeout: 300
20.29/20.33	No parsing errors!
20.29/20.33	Init Location: 0
20.29/20.33	Transitions:
20.29/20.33	<l0, l8, true>
20.29/20.33	<l1, l2, true>
20.29/20.33	<l2, l3, (0 <= (~(1) + (~(1) * x_5^0))) /\ (undef5 = undef5), par{Result_4^0 -> undef5}>
20.29/20.33	<l2, l4, ((0 + (~(1) * x_5^0)) <= 0) /\ (undef11 = undef11) /\ ((0 + undef11) <= 0) /\ (0 <= (0 + undef11)), par{tmp_6^0 -> undef11}>
20.29/20.33	<l4, l2, true>
20.29/20.33	<l2, l5, ((0 + (~(1) * x_5^0)) <= 0) /\ (undef19 = undef19), par{tmp_6^0 -> undef19}>
20.29/20.33	<l5, l6, (undef22 = __disjvr_0^0) /\ (__disjvr_0^0 = undef22), par{__disjvr_0^0 -> undef22}>
20.29/20.33	<l6, l7, true, par{x_5^0 -> (~(1) + x_5^0)}>
20.29/20.33	<l7, l2, true>
20.29/20.33	<l8, l1, true>
20.29/20.33	
20.29/20.33	Fresh variables:
20.29/20.33	undef5, undef11, undef19, undef22, 
20.29/20.33	
20.29/20.33	Undef variables:
20.29/20.33	undef5, undef11, undef19, undef22, 
20.29/20.33	
20.29/20.33	Abstraction variables:
20.29/20.33	
20.29/20.33	Exit nodes:
20.29/20.33	
20.29/20.33	Accepting locations:
20.29/20.33	
20.29/20.33	Asserts:
20.29/20.33	
20.29/20.33	Preprocessed LLVMGraph
20.29/20.33	Init Location: 0
20.29/20.33	Transitions:
20.29/20.33	<l0, l2, true>
20.29/20.33	<l2, l3, (0 <= (~(1) + (~(1) * x_5^0))) /\ (undef5 = undef5)>
20.29/20.33	<l2, l2, ((0 + (~(1) * x_5^0)) <= 0) /\ (undef11 = undef11) /\ ((0 + undef11) <= 0) /\ (0 <= (0 + undef11))>
20.29/20.33	<l2, l2, ((0 + (~(1) * x_5^0)) <= 0) /\ (undef19 = undef19) /\ (undef22 = __disjvr_0^0) /\ (__disjvr_0^0 = undef22), par{__disjvr_0^0 -> undef22, x_5^0 -> (~(1) + x_5^0)}>
20.29/20.33	
20.29/20.33	Fresh variables:
20.29/20.33	undef5, undef11, undef19, undef22, 
20.29/20.33	
20.29/20.33	Undef variables:
20.29/20.33	undef5, undef11, undef19, undef22, 
20.29/20.33	
20.29/20.33	Abstraction variables:
20.29/20.33	
20.29/20.33	Exit nodes:
20.29/20.33	
20.29/20.33	Accepting locations:
20.29/20.33	
20.29/20.33	Asserts:
20.29/20.33	
20.29/20.33	*************************************************************
20.29/20.33	*******************************************************************************************
20.29/20.33	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
20.29/20.33	*******************************************************************************************
20.29/20.33	
20.29/20.33	Init Location: 0
20.29/20.33	Graph 0:
20.29/20.33	Transitions:
20.29/20.33	Variables:
20.29/20.33	
20.29/20.33	Graph 1:
20.29/20.33	Transitions:
20.29/20.33	<l2, l2, 0 <= x_5^0 /\ undef11 = 0, {all remain the same}>
20.29/20.33	<l2, l2, 0 <= x_5^0 /\ __disjvr_0^0 = undef22, {__disjvr_0^0 -> undef22, x_5^0 -> -1 + x_5^0, rest remain the same}>
20.29/20.33	Variables:
20.29/20.33	x_5^0, __disjvr_0^0
20.29/20.33	
20.29/20.33	Graph 2:
20.29/20.33	Transitions:
20.29/20.33	Variables:
20.29/20.33	
20.29/20.33	Precedence: 
20.29/20.33	Graph 0
20.29/20.33	
20.29/20.33	Graph 1
20.29/20.33	<l0, l2, true, {all remain the same}>
20.29/20.33	
20.29/20.33	Graph 2
20.29/20.33	<l2, l3, 1 + x_5^0 <= 0, {all remain the same}>
20.29/20.33	
20.29/20.33	Map Locations to Subgraph:
20.29/20.33	( 0 , 0 )
20.29/20.33	( 2 , 1 )
20.29/20.33	( 3 , 2 )
20.29/20.33	
20.29/20.33	*******************************************************************************************
20.29/20.33	********************************    CHECKING ASSERTIONS    ********************************
20.29/20.33	*******************************************************************************************
20.29/20.33	
20.29/20.33	Proving termination of subgraph 0
20.29/20.33	Proving termination of subgraph 1
20.29/20.33	Checking unfeasibility...
20.29/20.33	Time used: 0.003523
20.29/20.33	
20.29/20.33	Checking conditional termination of SCC {l2}...
20.29/20.33	
20.29/20.33	LOG: CALL solveLinear
20.29/20.33	
20.29/20.33	LOG: RETURN solveLinear - Elapsed time: 0.000756s
20.29/20.33	Ranking function: x_5^0
20.29/20.33	New Graphs: 
20.29/20.33	Transitions:
20.29/20.33	<l2, l2, 0 <= x_5^0 /\ undef11 = 0, {all remain the same}>
20.29/20.33	Variables:
20.29/20.33	x_5^0
20.29/20.33	> No variable changes in termination graph.
20.29/20.33	Checking conditional unfeasibility...
20.29/20.33	Calling Safety with literal 1 + x_5^0 <= 0 and entry <l2, l2, true, {all remain the same}>
20.29/20.33	
20.29/20.33	LOG: CALL check - Post:1 + x_5^0 <= 0 - Process 1
20.29/20.33	* Exit transition: <l2, l2, true, {all remain the same}>
20.29/20.33	* Postcondition  : 1 + x_5^0 <= 0
20.29/20.33	Quasi-invariants: 
20.29/20.33	Location 2: 1 + x_5^0 <= 0 ; 
20.29/20.33	Postcondition: 1 + x_5^0 <= 0
20.29/20.33	
20.29/20.33	LOG: CALL check - Post:1 + x_5^0 <= 0 - Process 2
20.29/20.33	* Exit transition: <l0, l2, true, {all remain the same}>
20.29/20.33	* Postcondition  : 1 + x_5^0 <= 0
20.29/20.33	
20.29/20.33	LOG: CALL solveLinear
20.29/20.33	
20.29/20.33	LOG: RETURN solveLinear - Elapsed time: 0.000218s
20.29/20.33	> Postcondition is not implied!
20.29/20.33	
20.29/20.33	LOG: RETURN check - Elapsed time: 0.000278s
20.29/20.33	
20.29/20.33	LOG: NarrowEntry size 1
20.29/20.33	Narrowing transition: 
20.29/20.33	<l2, l2, 0 <= x_5^0 /\ undef11 = 0, {all remain the same}>
20.29/20.33	
20.29/20.33	LOG: Narrow transition size 1
20.29/20.33	Narrowing transition: 
20.29/20.33	<l2, l2, 0 <= x_5^0 /\ __disjvr_0^0 = undef22, {__disjvr_0^0 -> undef22, x_5^0 -> -1 + x_5^0, rest remain the same}>
20.29/20.33	
20.29/20.33	LOG: Narrow transition size 1
20.29/20.33	ENTRIES:
20.29/20.33	<l0, l2, 0 <= x_5^0, {all remain the same}>
20.29/20.33	END ENTRIES:
20.29/20.33	GRAPH:
20.29/20.33	<l2, l2, 0 <= x_5^0 /\ undef11 = 0, {all remain the same}>
20.29/20.33	<l2, l2, 0 <= x_5^0 /\ __disjvr_0^0 = undef22, {__disjvr_0^0 -> undef22, x_5^0 -> -1 + x_5^0, rest remain the same}>
20.29/20.33	END GRAPH:
20.29/20.33	EXIT: <l2, l2, true, {all remain the same}>
20.29/20.33	POST: 1 + x_5^0 <= 0
20.29/20.33	
20.29/20.33	
20.29/20.33	LOG: Try proving POST
20.29/20.33	Solving with 1 template(s).
20.29/20.33	
20.29/20.33	LOG: CALL solveNonLinearGetFirstSolution
20.29/20.33	
20.29/20.33	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007777s
20.29/20.33	Time used: 0.007674
20.29/20.33	Solving with 2 template(s).
20.29/20.33	
20.29/20.33	LOG: CALL solveNonLinearGetFirstSolution
20.29/20.33	
20.29/20.33	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001608s
20.29/20.33	Time used: 4.00044
20.29/20.33	Solving with 3 template(s).
20.29/20.33	
20.29/20.33	LOG: CALL solveNonLinearGetFirstSolution
20.29/20.33	
20.29/20.33	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.024515s
20.29/20.33	Time used: 1.02019
20.29/20.33	
20.29/20.33	LOG: Postcondition is not implied - no solution
20.29/20.33	> Postcondition is not implied!
20.29/20.33	
20.29/20.33	LOG: RETURN check - Elapsed time: 5.040717s
20.29/20.33	
20.29/20.33	Proving non-termination of subgraph 1
20.29/20.33	Transitions:
20.29/20.33	<l2, l2, 0 <= x_5^0 /\ undef11 = 0, {all remain the same}>
20.29/20.33	<l2, l2, 0 <= x_5^0 /\ __disjvr_0^0 = undef22, {__disjvr_0^0 -> undef22, x_5^0 -> -1 + x_5^0, rest remain the same}>
20.29/20.33	Variables:
20.29/20.33	x_5^0, __disjvr_0^0
20.29/20.33	
20.29/20.33	Checking that every undef value has an assignment...
20.29/20.33	
20.29/20.33	LOG: CALL solveLinear
20.29/20.33	
20.29/20.33	LOG: RETURN solveLinear - Elapsed time: 0.001163s
20.29/20.33	Checking conditional non-termination of SCC {l2}...
20.29/20.33	EXIT TRANSITIONS:
20.29/20.33	<l2, end, 1 + x_5^0 <= 0, {all remain the same}>
20.29/20.33	
20.29/20.33	Solving with 1 template(s).
20.29/20.33	
20.29/20.33	LOG: CALL solveNonLinearGetFirstSolution
20.29/20.33	
20.29/20.33	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.002382s
20.29/20.33	Time used: 5.00142
20.29/20.33	Solving with 2 template(s).
20.29/20.33	
20.29/20.33	LOG: CALL solveNonLinearGetFirstSolution
20.29/20.33	
20.29/20.33	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.010274s
20.29/20.33	Time used: 5.00198
20.29/20.33	Solving with 3 template(s).
20.29/20.33	
20.29/20.33	LOG: CALL solveNonLinearGetFirstSolution
20.29/20.33	
20.29/20.33	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.060608s
20.29/20.33	Time used: 5.00129
20.29/20.33	> Checking if the negation of the conditions of every pending exit is quasi-invariant... NO
20.29/20.33	
20.29/20.33	Proving non-termination of subgraph 1
20.29/20.33	Transitions:
20.29/20.33	<l2, l2, 0 <= x_5^0 /\ undef11 = 0, {all remain the same}>
20.29/20.33	Variables:
20.29/20.33	x_5^0
20.29/20.33	
20.29/20.33	Checking conditional non-termination of SCC {l2}...
20.29/20.33	EXIT TRANSITIONS:
20.29/20.33	<l2, end, 1 + x_5^0 <= 0, {all remain the same}>
20.29/20.33	
20.29/20.33	Solving with 1 template(s).
20.29/20.33	
20.29/20.33	LOG: CALL solveNonLinearGetFirstSolution
20.29/20.33	
20.29/20.33	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006718s
20.29/20.33	Time used: 0.006558
20.29/20.33	Improving Solution with cost 1 ...
20.29/20.33	
20.29/20.33	LOG: CALL solveNonLinearGetNextSolution
20.29/20.33	
20.29/20.33	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.012477s
20.29/20.33	Time used: 0.012471
20.29/20.33	
20.29/20.33	LOG: SAT solveNonLinear - Elapsed time: 0.019196s
20.29/20.33	Cost: 1; Total time: 0.019029
20.29/20.33	Failed at location 2: 1 <= x_5^0
20.29/20.33	Before Improving: 
20.29/20.33	Quasi-invariant at l2: 1 <= x_5^0
20.29/20.33	Optimizing invariants...
20.29/20.33	
20.29/20.33	LOG: CALL solveLinear
20.29/20.33	
20.29/20.33	LOG: RETURN solveLinear - Elapsed time: 0.003724s
20.29/20.33	Remaining time after improvement: 0.998606
20.29/20.33	Minimizing number of undef constraints...
20.29/20.33	
20.29/20.33	LOG: CALL solveNonLinear
20.29/20.33	
20.29/20.33	LOG: RETURN solveNonLinear - Elapsed time: 0.001850s
20.29/20.33	Number of undef constraints reduced!
20.29/20.33	
20.29/20.33	Non-termination implied by a set of quasi-invariant(s):
20.29/20.33	Quasi-invariant at l2: 1 <= x_5^0
20.29/20.33	
20.29/20.33	Strengthening and disabling EXIT transitions...
20.29/20.33	Closed exits from l2: 1
20.29/20.33	
20.29/20.33	Strengthening and disabling transitions...
20.29/20.33	
20.29/20.33	LOG: CALL solverLinear in Graph for feasibility
20.29/20.33	
20.29/20.33	LOG: RETURN solveLinear in Graph for feasibility
20.29/20.33	Strengthening transition (result): 
20.29/20.33	<l2, l2, 1 <= x_5^0 /\ undef11 = 0, {all remain the same}>
20.29/20.33	
20.29/20.33	Calling reachability with...
20.29/20.33	Transition: <l2, end, true, {all remain the same}>
20.29/20.33	Conditions: 1 <= x_5^0, 
20.29/20.33	OPEN EXITS: 
20.29/20.33	<l2, end, 1 <= x_5^0, {all remain the same}>
20.29/20.33	
20.29/20.33	--- Reachability graph ---
20.29/20.33	> Graph without transitions.
20.29/20.33	
20.29/20.33	Calling reachability with...
20.29/20.33	Transition: <l0, l2, true, {all remain the same}>
20.29/20.33	Conditions: 1 <= x_5^0, 
20.29/20.33	OPEN EXITS: 
20.29/20.33	<l0, l2, 1 <= x_5^0, {all remain the same}>
20.29/20.33	
20.29/20.33	> Conditions are reachable!
20.29/20.33	
20.29/20.33	Program does NOT terminate
20.29/20.33	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
20.29/20.33	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
20.29/20.33	EOF