29.26/29.32	NO
29.26/29.32	
29.26/29.33	Solver Timeout: 4
29.26/29.33	Global Timeout: 300
29.26/29.33	No parsing errors!
29.26/29.33	Init Location: 0
29.26/29.33	Transitions:
29.26/29.33	<l0, l4, true>
29.26/29.33	<l1, l2, (undef1 = (1000 + x^0)) /\ (201 <= (0 + undef1)), par{x^0 -> undef1}>
29.26/29.33	<l2, l1, true>
29.26/29.33	<l3, l1, true>
29.26/29.33	<l4, l3, true>
29.26/29.33	
29.26/29.33	Fresh variables:
29.26/29.33	undef1, 
29.26/29.33	
29.26/29.33	Undef variables:
29.26/29.33	undef1, 
29.26/29.33	
29.26/29.33	Abstraction variables:
29.26/29.33	
29.26/29.33	Exit nodes:
29.26/29.33	
29.26/29.33	Accepting locations:
29.26/29.33	
29.26/29.33	Asserts:
29.26/29.33	
29.26/29.33	Preprocessed LLVMGraph
29.26/29.33	Init Location: 0
29.26/29.33	Transitions:
29.26/29.33	<l0, l1, true>
29.26/29.33	<l1, l1, (undef1 = (1000 + x^0)) /\ (201 <= (0 + undef1)), par{x^0 -> undef1}>
29.26/29.33	
29.26/29.33	Fresh variables:
29.26/29.33	undef1, 
29.26/29.33	
29.26/29.33	Undef variables:
29.26/29.33	undef1, 
29.26/29.33	
29.26/29.33	Abstraction variables:
29.26/29.33	
29.26/29.33	Exit nodes:
29.26/29.33	
29.26/29.33	Accepting locations:
29.26/29.33	
29.26/29.33	Asserts:
29.26/29.33	
29.26/29.33	*************************************************************
29.26/29.33	*******************************************************************************************
29.26/29.33	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
29.26/29.33	*******************************************************************************************
29.26/29.33	
29.26/29.33	Init Location: 0
29.26/29.33	Graph 0:
29.26/29.33	Transitions:
29.26/29.33	Variables:
29.26/29.33	
29.26/29.33	Graph 1:
29.26/29.33	Transitions:
29.26/29.33	<l1, l1, 201 <= undef1 /\ 1000 + x^0 = undef1, {x^0 -> undef1, rest remain the same}>
29.26/29.33	Variables:
29.26/29.33	x^0
29.26/29.33	
29.26/29.33	Precedence: 
29.26/29.33	Graph 0
29.26/29.33	
29.26/29.33	Graph 1
29.26/29.33	<l0, l1, true, {all remain the same}>
29.26/29.33	
29.26/29.33	Map Locations to Subgraph:
29.26/29.33	( 0 , 0 )
29.26/29.33	( 1 , 1 )
29.26/29.33	
29.26/29.33	*******************************************************************************************
29.26/29.33	********************************    CHECKING ASSERTIONS    ********************************
29.26/29.33	*******************************************************************************************
29.26/29.33	
29.26/29.33	Proving termination of subgraph 0
29.26/29.33	Proving termination of subgraph 1
29.26/29.33	Checking unfeasibility...
29.26/29.33	Time used: 0.001482
29.26/29.33	
29.26/29.33	Checking conditional termination of SCC {l1}...
29.26/29.33	
29.26/29.33	LOG: CALL solveLinear
29.26/29.33	
29.26/29.33	LOG: RETURN solveLinear - Elapsed time: 0.000536s
29.26/29.33	
29.26/29.33	LOG: CALL solveLinear
29.26/29.33	
29.26/29.33	LOG: RETURN solveLinear - Elapsed time: 0.001910s
29.26/29.33	Trying to remove transition: <l1, l1, 201 <= undef1 /\ 1000 + x^0 = undef1, {x^0 -> undef1, rest remain the same}>
29.26/29.33	Solving with 1 template(s).
29.26/29.33	
29.26/29.33	LOG: CALL solveNonLinearGetFirstSolution
29.26/29.33	
29.26/29.33	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003615s
29.26/29.33	Time used: 0.00346
29.26/29.33	Solving with 1 template(s).
29.26/29.33	
29.26/29.33	LOG: CALL solveNonLinearGetFirstSolution
29.26/29.33	
29.26/29.33	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001577s
29.26/29.33	Time used: 4.00108
29.26/29.33	Solving with 2 template(s).
29.26/29.33	
29.26/29.33	LOG: CALL solveNonLinearGetFirstSolution
29.26/29.33	
29.26/29.33	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.006470s
29.26/29.33	Time used: 4.0008
29.26/29.33	Solving with 3 template(s).
29.26/29.33	
29.26/29.33	LOG: CALL solveNonLinearGetFirstSolution
29.26/29.33	
29.26/29.33	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.008160s
29.26/29.33	Time used: 1.00058
29.26/29.33	Solving with 1 template(s).
29.26/29.33	
29.26/29.33	LOG: CALL solveNonLinearGetFirstSolution
29.26/29.33	
29.26/29.33	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006825s
29.26/29.33	Time used: 0.004098
29.26/29.33	Improving Solution with cost 1 ...
29.26/29.33	
29.26/29.33	LOG: CALL solveNonLinearGetNextSolution
29.26/29.33	
29.26/29.33	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.007909s
29.26/29.33	Time used: 0.007904
29.26/29.33	
29.26/29.33	LOG: SAT solveNonLinear - Elapsed time: 0.014734s
29.26/29.33	Cost: 1; Total time: 0.012002
29.26/29.33	Quasi-ranking function: 50000 - x^0
29.26/29.33	New Graphs: 
29.26/29.33	Transitions:
29.26/29.33	<l1, l1, 201 <= undef1 /\ 50001 <= x^0 /\ 1000 + x^0 = undef1, {x^0 -> undef1, rest remain the same}>
29.26/29.33	Variables:
29.26/29.33	x^0
29.26/29.33	Checking conditional termination of SCC {l1}...
29.26/29.33	
29.26/29.33	LOG: CALL solveLinear
29.26/29.33	
29.26/29.33	LOG: RETURN solveLinear - Elapsed time: 0.000586s
29.26/29.33	
29.26/29.33	LOG: CALL solveLinear
29.26/29.33	
29.26/29.33	LOG: RETURN solveLinear - Elapsed time: 0.002240s
29.26/29.33	Trying to remove transition: <l1, l1, 201 <= undef1 /\ 50001 <= x^0 /\ 1000 + x^0 = undef1, {x^0 -> undef1, rest remain the same}>
29.26/29.33	Solving with 1 template(s).
29.26/29.33	
29.26/29.33	LOG: CALL solveNonLinearGetFirstSolution
29.26/29.33	
29.26/29.33	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004038s
29.26/29.33	Time used: 0.00388
29.26/29.33	Solving with 1 template(s).
29.26/29.33	
29.26/29.33	LOG: CALL solveNonLinearGetFirstSolution
29.26/29.33	
29.26/29.33	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.752429s
29.26/29.33	Time used: 1.75202
29.26/29.33	Improving Solution with cost 1 ...
29.26/29.33	
29.26/29.33	LOG: CALL solveNonLinearGetNextSolution
29.26/29.33	
29.26/29.33	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.269226s
29.26/29.33	Time used: 0.269225
29.26/29.33	
29.26/29.33	LOG: SAT solveNonLinear - Elapsed time: 2.021655s
29.26/29.33	Cost: 1; Total time: 2.02125
29.26/29.33	Failed at location 1: 831 + x^0 <= 0
29.26/29.33	Before Improving: 
29.26/29.33	Quasi-invariant at l1: 831 + x^0 <= 0
29.26/29.33	Optimizing invariants...
29.26/29.33	
29.26/29.33	LOG: CALL solveLinear
29.26/29.33	
29.26/29.33	LOG: RETURN solveLinear - Elapsed time: 0.009307s
29.26/29.33	Remaining time after improvement: 0.997607
29.26/29.33	Termination implied by a set of quasi-invariant(s):
29.26/29.33	Quasi-invariant at l1: 831 + x^0 <= 0
29.26/29.33	[ Invariant Graph ]
29.26/29.33	Strengthening and disabling transitions...
29.26/29.33	
29.26/29.33	LOG: CALL solverLinear in Graph for feasibility
29.26/29.33	
29.26/29.33	LOG: RETURN solveLinear in Graph for feasibility
29.26/29.33	It's unfeasible. Removing transition: 
29.26/29.33	<l1, l1, 201 <= undef1 /\ 1000 + x^0 = undef1, {x^0 -> undef1, rest remain the same}>
29.26/29.33	[ Termination Graph ]
29.26/29.33	Strengthening and disabling transitions...
29.26/29.33	> It's unfeasible. Removing transition: 
29.26/29.33	<l1, l1, 201 <= undef1 /\ 50001 <= x^0 /\ 1000 + x^0 = undef1, {x^0 -> undef1, rest remain the same}>
29.26/29.33	New Graphs: 
29.26/29.33	Calling Safety with literal 831 + x^0 <= 0 and entry <l0, l1, true, {all remain the same}>
29.26/29.33	
29.26/29.33	LOG: CALL check - Post:831 + x^0 <= 0 - Process 1
29.26/29.33	* Exit transition: <l0, l1, true, {all remain the same}>
29.26/29.33	* Postcondition  : 831 + x^0 <= 0
29.26/29.33	
29.26/29.33	LOG: CALL solveLinear
29.26/29.33	
29.26/29.33	LOG: RETURN solveLinear - Elapsed time: 0.001947s
29.26/29.33	> Postcondition is not implied!
29.26/29.33	
29.26/29.33	LOG: RETURN check - Elapsed time: 0.002017s
29.26/29.33	INVARIANTS: 
29.26/29.33	1: 
29.26/29.33	Quasi-INVARIANTS to narrow Graph: 
29.26/29.33	1: 831 + x^0 <= 0 , 
29.26/29.33	Narrowing transition: 
29.26/29.33	<l1, l1, 201 <= undef1 /\ 1000 + x^0 = undef1, {x^0 -> undef1, rest remain the same}>
29.26/29.33	
29.26/29.33	LOG: Narrow transition size 1
29.26/29.33	invGraph after Narrowing: 
29.26/29.33	Transitions:
29.26/29.33	<l1, l1, 201 <= undef1 /\ 0 <= 830 + x^0 /\ 1000 + x^0 = undef1, {x^0 -> undef1, rest remain the same}>
29.26/29.33	Variables:
29.26/29.33	x^0
29.26/29.33	Checking conditional termination of SCC {l1}...
29.26/29.33	
29.26/29.33	LOG: CALL solveLinear
29.26/29.33	
29.26/29.33	LOG: RETURN solveLinear - Elapsed time: 0.000612s
29.26/29.33	
29.26/29.33	LOG: CALL solveLinear
29.26/29.33	
29.26/29.33	LOG: RETURN solveLinear - Elapsed time: 0.002413s
29.26/29.33	Trying to remove transition: <l1, l1, 201 <= undef1 /\ 0 <= 830 + x^0 /\ 1000 + x^0 = undef1, {x^0 -> undef1, rest remain the same}>
29.26/29.33	Solving with 1 template(s).
29.26/29.33	
29.26/29.33	LOG: CALL solveNonLinearGetFirstSolution
29.26/29.33	
29.26/29.33	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003972s
29.26/29.33	Time used: 0.00381
29.26/29.33	Solving with 1 template(s).
29.26/29.33	
29.26/29.33	LOG: CALL solveNonLinearGetFirstSolution
29.26/29.33	
29.26/29.33	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002246s
29.26/29.33	Time used: 4.0018
29.26/29.33	Solving with 2 template(s).
29.26/29.33	
29.26/29.33	LOG: CALL solveNonLinearGetFirstSolution
29.26/29.33	
29.26/29.33	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.008181s
29.26/29.33	Time used: 4.00124
29.26/29.33	Solving with 3 template(s).
29.26/29.33	
29.26/29.33	LOG: CALL solveNonLinearGetFirstSolution
29.26/29.33	
29.26/29.33	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.029069s
29.26/29.33	Time used: 1.01683
29.26/29.33	Solving with 1 template(s).
29.26/29.33	
29.26/29.33	LOG: CALL solveNonLinearGetFirstSolution
29.26/29.33	
29.26/29.33	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.020173s
29.26/29.33	Time used: 0.006209
29.26/29.33	Improving Solution with cost 1 ...
29.26/29.33	
29.26/29.33	LOG: CALL solveNonLinearGetNextSolution
29.26/29.33	
29.26/29.33	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.010563s
29.26/29.33	Time used: 0.010559
29.26/29.33	
29.26/29.33	LOG: SAT solveNonLinear - Elapsed time: 0.030736s
29.26/29.33	Cost: 1; Total time: 0.016768
29.26/29.33	Quasi-ranking function: 50000 - x^0
29.26/29.33	New Graphs: 
29.26/29.33	Transitions:
29.26/29.33	<l1, l1, 201 <= undef1 /\ 50001 <= x^0 /\ 1000 + x^0 = undef1, {x^0 -> undef1, rest remain the same}>
29.26/29.33	Variables:
29.26/29.33	x^0
29.26/29.33	Checking conditional termination of SCC {l1}...
29.26/29.33	
29.26/29.33	LOG: CALL solveLinear
29.26/29.33	
29.26/29.33	LOG: RETURN solveLinear - Elapsed time: 0.000614s
29.26/29.33	
29.26/29.33	LOG: CALL solveLinear
29.26/29.33	
29.26/29.33	LOG: RETURN solveLinear - Elapsed time: 0.002397s
29.26/29.33	Trying to remove transition: <l1, l1, 201 <= undef1 /\ 50001 <= x^0 /\ 1000 + x^0 = undef1, {x^0 -> undef1, rest remain the same}>
29.26/29.33	Solving with 1 template(s).
29.26/29.33	
29.26/29.33	LOG: CALL solveNonLinearGetFirstSolution
29.26/29.33	
29.26/29.33	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004529s
29.26/29.33	Time used: 0.004369
29.26/29.33	Solving with 1 template(s).
29.26/29.33	
29.26/29.33	LOG: CALL solveNonLinearGetFirstSolution
29.26/29.33	
29.26/29.33	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.003428s
29.26/29.33	Time used: 4.00303
29.26/29.33	Solving with 2 template(s).
29.26/29.33	
29.26/29.33	LOG: CALL solveNonLinearGetFirstSolution
29.26/29.33	
29.26/29.33	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.010465s
29.26/29.33	Time used: 4.00207
29.26/29.33	Solving with 3 template(s).
29.26/29.33	
29.26/29.33	LOG: CALL solveNonLinearGetFirstSolution
29.26/29.33	
29.26/29.33	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.014160s
29.26/29.33	Time used: 1.0011
29.26/29.33	Solving with 1 template(s).
29.26/29.33	
29.26/29.33	LOG: CALL solveNonLinearGetFirstSolution
29.26/29.33	
29.26/29.33	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007772s
29.26/29.33	Time used: 0.004791
29.26/29.33	
29.26/29.33	Proving non-termination of subgraph 1
29.26/29.33	Transitions:
29.26/29.33	<l1, l1, 201 <= undef1 /\ 0 <= 830 + x^0 /\ 1000 + x^0 = undef1, {x^0 -> undef1, rest remain the same}>
29.26/29.33	Variables:
29.26/29.33	x^0
29.26/29.33	
29.26/29.33	Checking that every undef value has an assignment...
29.26/29.33	
29.26/29.33	LOG: CALL solveLinear
29.26/29.33	
29.26/29.33	LOG: RETURN solveLinear - Elapsed time: 0.000680s
29.26/29.33	Checking conditional non-termination of SCC {l1}...
29.26/29.33	> No assignment for some undef value.
29.26/29.33	> Checking if the negation of the conditions of every pending exit is quasi-invariant... YES
29.26/29.33	Calling reachability with...
29.26/29.33	Transition: <l1, end, true, {all remain the same}>
29.26/29.33	Conditions: 0 <= 830 + x^0, 
29.26/29.33	OPEN EXITS: 
29.26/29.33	<l1, end, 0 <= 830 + x^0, {all remain the same}>
29.26/29.33	
29.26/29.33	--- Reachability graph ---
29.26/29.33	> Graph without transitions.
29.26/29.33	
29.26/29.33	Calling reachability with...
29.26/29.33	Transition: <l0, l1, true, {all remain the same}>
29.26/29.33	Conditions: 0 <= 830 + x^0, 
29.26/29.33	OPEN EXITS: 
29.26/29.33	<l0, l1, 0 <= 830 + x^0, {all remain the same}>
29.26/29.33	
29.26/29.33	> Conditions are reachable!
29.26/29.33	
29.26/29.33	Program does NOT terminate
29.26/29.33	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
29.26/29.33	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
29.26/29.33	EOF