5.27/5.30	NO
5.27/5.30	
5.27/5.30	Solver Timeout: 4
5.27/5.30	Global Timeout: 300
5.27/5.30	No parsing errors!
5.27/5.30	Init Location: 0
5.27/5.30	Transitions:
5.27/5.30	<l0, l4, true>
5.27/5.30	<l1, l2, (undef2 = ((0 + __const_1000^0) + x^0)) /\ (1 <= (0 + undef2)), par{x^0 -> undef2}>
5.27/5.30	<l2, l1, true>
5.27/5.30	<l3, l1, true>
5.27/5.30	<l4, l3, true>
5.27/5.30	
5.27/5.30	Fresh variables:
5.27/5.30	undef2, 
5.27/5.30	
5.27/5.30	Undef variables:
5.27/5.30	undef2, 
5.27/5.30	
5.27/5.30	Abstraction variables:
5.27/5.30	
5.27/5.30	Exit nodes:
5.27/5.30	
5.27/5.30	Accepting locations:
5.27/5.30	
5.27/5.30	Asserts:
5.27/5.30	
5.27/5.30	Preprocessed LLVMGraph
5.27/5.30	Init Location: 0
5.27/5.30	Transitions:
5.27/5.30	<l0, l1, true>
5.27/5.30	<l1, l1, (undef2 = ((0 + __const_1000^0) + x^0)) /\ (1 <= (0 + undef2)), par{x^0 -> undef2}>
5.27/5.30	
5.27/5.30	Fresh variables:
5.27/5.30	undef2, 
5.27/5.30	
5.27/5.30	Undef variables:
5.27/5.30	undef2, 
5.27/5.30	
5.27/5.30	Abstraction variables:
5.27/5.30	
5.27/5.30	Exit nodes:
5.27/5.30	
5.27/5.30	Accepting locations:
5.27/5.30	
5.27/5.30	Asserts:
5.27/5.30	
5.27/5.30	*************************************************************
5.27/5.30	*******************************************************************************************
5.27/5.30	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
5.27/5.30	*******************************************************************************************
5.27/5.30	
5.27/5.30	Init Location: 0
5.27/5.30	Graph 0:
5.27/5.30	Transitions:
5.27/5.30	Variables:
5.27/5.30	
5.27/5.30	Graph 1:
5.27/5.30	Transitions:
5.27/5.30	<l1, l1, 1 <= undef2 /\ __const_1000^0 + x^0 = undef2, {x^0 -> undef2, rest remain the same}>
5.27/5.30	Variables:
5.27/5.30	__const_1000^0, x^0
5.27/5.30	
5.27/5.30	Precedence: 
5.27/5.30	Graph 0
5.27/5.30	
5.27/5.30	Graph 1
5.27/5.30	<l0, l1, true, {all remain the same}>
5.27/5.30	
5.27/5.30	Map Locations to Subgraph:
5.27/5.30	( 0 , 0 )
5.27/5.30	( 1 , 1 )
5.27/5.30	
5.27/5.30	*******************************************************************************************
5.27/5.30	********************************    CHECKING ASSERTIONS    ********************************
5.27/5.30	*******************************************************************************************
5.27/5.30	
5.27/5.30	Proving termination of subgraph 0
5.27/5.30	Proving termination of subgraph 1
5.27/5.30	Checking unfeasibility...
5.27/5.30	Time used: 0.001871
5.27/5.30	
5.27/5.30	Checking conditional termination of SCC {l1}...
5.27/5.30	
5.27/5.30	LOG: CALL solveLinear
5.27/5.30	
5.27/5.30	LOG: RETURN solveLinear - Elapsed time: 0.000665s
5.27/5.30	
5.27/5.30	LOG: CALL solveLinear
5.27/5.30	
5.27/5.30	LOG: RETURN solveLinear - Elapsed time: 0.002156s
5.27/5.30	Trying to remove transition: <l1, l1, 1 <= undef2 /\ __const_1000^0 + x^0 = undef2, {x^0 -> undef2, rest remain the same}>
5.27/5.30	Solving with 1 template(s).
5.27/5.30	
5.27/5.30	LOG: CALL solveNonLinearGetFirstSolution
5.27/5.31	
5.27/5.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004770s
5.27/5.31	Time used: 0.004625
5.27/5.31	Solving with 1 template(s).
5.27/5.31	
5.27/5.31	LOG: CALL solveNonLinearGetFirstSolution
5.27/5.31	
5.27/5.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006998s
5.27/5.31	Time used: 0.006649
5.27/5.31	Improving Solution with cost 1 ...
5.27/5.31	
5.27/5.31	LOG: CALL solveNonLinearGetNextSolution
5.27/5.31	
5.27/5.31	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.013832s
5.27/5.31	Time used: 0.013829
5.27/5.31	
5.27/5.31	LOG: SAT solveNonLinear - Elapsed time: 0.020830s
5.27/5.31	Cost: 1; Total time: 0.020478
5.27/5.31	Failed at location 1: 1 + __const_1000^0 + x^0 <= 0
5.27/5.31	Before Improving: 
5.27/5.31	Quasi-invariant at l1: 1 + __const_1000^0 + x^0 <= 0
5.27/5.31	Optimizing invariants...
5.27/5.31	
5.27/5.31	LOG: CALL solveLinear
5.27/5.31	
5.27/5.31	LOG: RETURN solveLinear - Elapsed time: 0.001877s
5.27/5.31	Remaining time after improvement: 0.999124
5.27/5.31	Termination implied by a set of quasi-invariant(s):
5.27/5.31	Quasi-invariant at l1: 1 + __const_1000^0 + x^0 <= 0
5.27/5.31	[ Invariant Graph ]
5.27/5.31	Strengthening and disabling transitions...
5.27/5.31	
5.27/5.31	LOG: CALL solverLinear in Graph for feasibility
5.27/5.31	
5.27/5.31	LOG: RETURN solveLinear in Graph for feasibility
5.27/5.31	It's unfeasible. Removing transition: 
5.27/5.31	<l1, l1, 1 <= undef2 /\ __const_1000^0 + x^0 = undef2, {x^0 -> undef2, rest remain the same}>
5.27/5.31	[ Termination Graph ]
5.27/5.31	Strengthening and disabling transitions...
5.27/5.31	
5.27/5.31	LOG: CALL solverLinear in Graph for feasibility
5.27/5.31	
5.27/5.31	LOG: RETURN solveLinear in Graph for feasibility
5.27/5.31	It's unfeasible. Removing transition: 
5.27/5.31	<l1, l1, 1 <= undef2 /\ __const_1000^0 + x^0 = undef2, {x^0 -> undef2, rest remain the same}>
5.27/5.31	New Graphs: 
5.27/5.31	Calling Safety with literal 1 + __const_1000^0 + x^0 <= 0 and entry <l0, l1, true, {all remain the same}>
5.27/5.31	
5.27/5.31	LOG: CALL check - Post:1 + __const_1000^0 + x^0 <= 0 - Process 1
5.27/5.31	* Exit transition: <l0, l1, true, {all remain the same}>
5.27/5.31	* Postcondition  : 1 + __const_1000^0 + x^0 <= 0
5.27/5.31	
5.27/5.31	LOG: CALL solveLinear
5.27/5.31	
5.27/5.31	LOG: RETURN solveLinear - Elapsed time: 0.000334s
5.27/5.31	> Postcondition is not implied!
5.27/5.31	
5.27/5.31	LOG: RETURN check - Elapsed time: 0.000404s
5.27/5.31	INVARIANTS: 
5.27/5.31	1: 
5.27/5.31	Quasi-INVARIANTS to narrow Graph: 
5.27/5.31	1: 1 + __const_1000^0 + x^0 <= 0 , 
5.27/5.31	Narrowing transition: 
5.27/5.31	<l1, l1, 1 <= undef2 /\ __const_1000^0 + x^0 = undef2, {x^0 -> undef2, rest remain the same}>
5.27/5.31	
5.27/5.31	LOG: Narrow transition size 1
5.27/5.31	invGraph after Narrowing: 
5.27/5.31	Transitions:
5.27/5.31	<l1, l1, 0 <= __const_1000^0 + x^0 /\ 1 <= undef2 /\ __const_1000^0 + x^0 = undef2, {x^0 -> undef2, rest remain the same}>
5.27/5.31	Variables:
5.27/5.31	__const_1000^0, x^0
5.27/5.31	Checking conditional termination of SCC {l1}...
5.27/5.31	
5.27/5.31	LOG: CALL solveLinear
5.27/5.31	
5.27/5.31	LOG: RETURN solveLinear - Elapsed time: 0.000714s
5.27/5.31	
5.27/5.31	LOG: CALL solveLinear
5.27/5.31	
5.27/5.31	LOG: RETURN solveLinear - Elapsed time: 0.002403s
5.27/5.31	Trying to remove transition: <l1, l1, 0 <= __const_1000^0 + x^0 /\ 1 <= undef2 /\ __const_1000^0 + x^0 = undef2, {x^0 -> undef2, rest remain the same}>
5.27/5.31	Solving with 1 template(s).
5.27/5.31	
5.27/5.31	LOG: CALL solveNonLinearGetFirstSolution
5.27/5.31	
5.27/5.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004180s
5.27/5.31	Time used: 0.004027
5.27/5.31	Solving with 1 template(s).
5.27/5.31	
5.27/5.31	LOG: CALL solveNonLinearGetFirstSolution
5.27/5.31	
5.27/5.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008346s
5.27/5.31	Time used: 0.007963
5.27/5.31	Improving Solution with cost 1 ...
5.27/5.31	
5.27/5.31	LOG: CALL solveNonLinearGetNextSolution
5.27/5.31	
5.27/5.31	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.012216s
5.27/5.31	Time used: 0.012213
5.27/5.31	
5.27/5.31	LOG: SAT solveNonLinear - Elapsed time: 0.020562s
5.27/5.31	Cost: 1; Total time: 0.020176
5.27/5.31	Failed at location 1: __const_1000^0 + x^0 <= 0
5.27/5.31	Before Improving: 
5.27/5.31	Quasi-invariant at l1: __const_1000^0 + x^0 <= 0
5.27/5.31	Optimizing invariants...
5.27/5.31	
5.27/5.31	LOG: CALL solveLinear
5.27/5.31	
5.27/5.31	LOG: RETURN solveLinear - Elapsed time: 0.001993s
5.27/5.31	Remaining time after improvement: 0.998987
5.27/5.31	Termination implied by a set of quasi-invariant(s):
5.27/5.31	Quasi-invariant at l1: __const_1000^0 + x^0 <= 0
5.27/5.31	[ Invariant Graph ]
5.27/5.31	Strengthening and disabling transitions...
5.27/5.31	
5.27/5.31	LOG: CALL solverLinear in Graph for feasibility
5.27/5.31	
5.27/5.31	LOG: RETURN solveLinear in Graph for feasibility
5.27/5.31	It's unfeasible. Removing transition: 
5.27/5.31	<l1, l1, 0 <= __const_1000^0 + x^0 /\ 1 <= undef2 /\ __const_1000^0 + x^0 = undef2, {x^0 -> undef2, rest remain the same}>
5.27/5.31	[ Termination Graph ]
5.27/5.31	Strengthening and disabling transitions...
5.27/5.31	> It's unfeasible. Removing transition: 
5.27/5.31	<l1, l1, 0 <= __const_1000^0 + x^0 /\ 1 <= undef2 /\ __const_1000^0 + x^0 = undef2, {x^0 -> undef2, rest remain the same}>
5.27/5.31	New Graphs: 
5.27/5.31	Calling Safety with literal __const_1000^0 + x^0 <= 0 and entry <l0, l1, 0 <= __const_1000^0 + x^0, {all remain the same}>
5.27/5.31	
5.27/5.31	LOG: CALL check - Post:__const_1000^0 + x^0 <= 0 - Process 2
5.27/5.31	* Exit transition: <l0, l1, 0 <= __const_1000^0 + x^0, {all remain the same}>
5.27/5.31	* Postcondition  : __const_1000^0 + x^0 <= 0
5.27/5.31	
5.27/5.31	LOG: CALL solveLinear
5.27/5.31	
5.27/5.31	LOG: RETURN solveLinear - Elapsed time: 0.000389s
5.27/5.31	> Postcondition is not implied!
5.27/5.31	
5.27/5.31	LOG: RETURN check - Elapsed time: 0.000465s
5.27/5.31	INVARIANTS: 
5.27/5.31	1: 
5.27/5.31	Quasi-INVARIANTS to narrow Graph: 
5.27/5.31	1: __const_1000^0 + x^0 <= 0 , 
5.27/5.31	Narrowing transition: 
5.27/5.31	<l1, l1, 0 <= __const_1000^0 + x^0 /\ 1 <= undef2 /\ __const_1000^0 + x^0 = undef2, {x^0 -> undef2, rest remain the same}>
5.27/5.31	
5.27/5.31	LOG: Narrow transition size 1
5.27/5.31	invGraph after Narrowing: 
5.27/5.31	Transitions:
5.27/5.31	<l1, l1, 1 <= __const_1000^0 + x^0 /\ 1 <= undef2 /\ __const_1000^0 + x^0 = undef2, {x^0 -> undef2, rest remain the same}>
5.27/5.31	Variables:
5.27/5.31	__const_1000^0, x^0
5.27/5.31	Checking conditional termination of SCC {l1}...
5.27/5.31	
5.27/5.31	LOG: CALL solveLinear
5.27/5.31	
5.27/5.31	LOG: RETURN solveLinear - Elapsed time: 0.000603s
5.27/5.31	
5.27/5.31	LOG: CALL solveLinear
5.27/5.31	
5.27/5.31	LOG: RETURN solveLinear - Elapsed time: 0.002195s
5.27/5.31	Trying to remove transition: <l1, l1, 1 <= __const_1000^0 + x^0 /\ 1 <= undef2 /\ __const_1000^0 + x^0 = undef2, {x^0 -> undef2, rest remain the same}>
5.27/5.31	Solving with 1 template(s).
5.27/5.31	
5.27/5.31	LOG: CALL solveNonLinearGetFirstSolution
5.27/5.31	
5.27/5.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004492s
5.27/5.31	Time used: 0.004335
5.27/5.31	Solving with 1 template(s).
5.27/5.31	
5.27/5.31	LOG: CALL solveNonLinearGetFirstSolution
5.27/5.31	
5.27/5.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008358s
5.27/5.31	Time used: 0.00795
5.27/5.31	Improving Solution with cost 1 ...
5.27/5.31	
5.27/5.31	LOG: CALL solveNonLinearGetNextSolution
5.27/5.31	
5.27/5.31	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.010443s
5.27/5.31	Time used: 0.010439
5.27/5.31	
5.27/5.31	LOG: SAT solveNonLinear - Elapsed time: 0.018801s
5.27/5.31	Cost: 1; Total time: 0.018389
5.27/5.31	Failed at location 1: 1 + __const_1000^0 <= 0
5.27/5.31	Before Improving: 
5.27/5.31	Quasi-invariant at l1: 1 + __const_1000^0 <= 0
5.27/5.31	Optimizing invariants...
5.27/5.31	
5.27/5.31	LOG: CALL solveLinear
5.27/5.31	
5.27/5.31	LOG: RETURN solveLinear - Elapsed time: 0.002062s
5.27/5.31	Remaining time after improvement: 0.998895
5.27/5.31	Termination implied by a set of quasi-invariant(s):
5.27/5.31	Quasi-invariant at l1: 1 + __const_1000^0 <= 0
5.27/5.31	[ Invariant Graph ]
5.27/5.31	Strengthening and disabling transitions...
5.27/5.31	
5.27/5.31	LOG: CALL solverLinear in Graph for feasibility
5.27/5.31	
5.27/5.31	LOG: RETURN solveLinear in Graph for feasibility
5.27/5.31	Strengthening transition (result): 
5.27/5.31	<l1, l1, 1 + __const_1000^0 <= 0 /\ 1 <= __const_1000^0 + x^0 /\ 1 <= undef2 /\ __const_1000^0 + x^0 = undef2, {x^0 -> undef2, rest remain the same}>
5.27/5.31	[ Termination Graph ]
5.27/5.31	Strengthening and disabling transitions...
5.27/5.31	
5.27/5.31	LOG: CALL solverLinear in Graph for feasibility
5.27/5.31	
5.27/5.31	LOG: RETURN solveLinear in Graph for feasibility
5.27/5.31	Strengthening transition (result): 
5.27/5.31	<l1, l1, 1 + __const_1000^0 <= 0 /\ 1 <= __const_1000^0 + x^0 /\ 1 <= undef2 /\ __const_1000^0 + x^0 = undef2, {x^0 -> undef2, rest remain the same}>
5.27/5.31	Ranking function: __const_1000^0 + x^0
5.27/5.31	New Graphs: 
5.27/5.31	Calling Safety with literal 1 + __const_1000^0 <= 0 and entry <l0, l1, 1 <= __const_1000^0 + x^0, {all remain the same}>
5.27/5.31	
5.27/5.31	LOG: CALL check - Post:1 + __const_1000^0 <= 0 - Process 3
5.27/5.31	* Exit transition: <l0, l1, 1 <= __const_1000^0 + x^0, {all remain the same}>
5.27/5.31	* Postcondition  : 1 + __const_1000^0 <= 0
5.27/5.31	
5.27/5.31	LOG: CALL solveLinear
5.27/5.31	
5.27/5.31	LOG: RETURN solveLinear - Elapsed time: 0.000336s
5.27/5.31	> Postcondition is not implied!
5.27/5.31	
5.27/5.31	LOG: RETURN check - Elapsed time: 0.000404s
5.27/5.31	INVARIANTS: 
5.27/5.31	1: 
5.27/5.31	Quasi-INVARIANTS to narrow Graph: 
5.27/5.31	1: 1 + __const_1000^0 <= 0 , 
5.27/5.31	Narrowing transition: 
5.27/5.31	<l1, l1, 1 <= __const_1000^0 + x^0 /\ 1 <= undef2 /\ __const_1000^0 + x^0 = undef2, {x^0 -> undef2, rest remain the same}>
5.27/5.31	
5.27/5.31	LOG: Narrow transition size 1
5.27/5.31	invGraph after Narrowing: 
5.27/5.31	Transitions:
5.27/5.31	<l1, l1, 0 <= __const_1000^0 /\ 1 <= __const_1000^0 + x^0 /\ 1 <= undef2 /\ __const_1000^0 + x^0 = undef2, {x^0 -> undef2, rest remain the same}>
5.27/5.31	Variables:
5.27/5.31	__const_1000^0, x^0
5.27/5.31	Checking conditional termination of SCC {l1}...
5.27/5.31	
5.27/5.31	LOG: CALL solveLinear
5.27/5.31	
5.27/5.31	LOG: RETURN solveLinear - Elapsed time: 0.000656s
5.27/5.31	
5.27/5.31	LOG: CALL solveLinear
5.27/5.31	
5.27/5.31	LOG: RETURN solveLinear - Elapsed time: 0.002350s
5.27/5.31	Trying to remove transition: <l1, l1, 0 <= __const_1000^0 /\ 1 <= __const_1000^0 + x^0 /\ 1 <= undef2 /\ __const_1000^0 + x^0 = undef2, {x^0 -> undef2, rest remain the same}>
5.27/5.31	Solving with 1 template(s).
5.27/5.31	
5.27/5.31	LOG: CALL solveNonLinearGetFirstSolution
5.27/5.31	
5.27/5.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004646s
5.27/5.31	Time used: 0.004487
5.27/5.31	Solving with 1 template(s).
5.27/5.31	
5.27/5.31	LOG: CALL solveNonLinearGetFirstSolution
5.27/5.31	
5.27/5.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008512s
5.27/5.31	Time used: 0.00821
5.27/5.31	Solving with 2 template(s).
5.27/5.31	
5.27/5.31	LOG: CALL solveNonLinearGetFirstSolution
5.27/5.31	
5.27/5.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001099s
5.27/5.31	Time used: 4.00041
5.27/5.31	Solving with 3 template(s).
5.27/5.31	
5.27/5.31	LOG: CALL solveNonLinearGetFirstSolution
5.27/5.31	
5.27/5.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.003972s
5.27/5.31	Time used: 1.00052
5.27/5.31	Solving with 1 template(s).
5.27/5.31	
5.27/5.31	LOG: CALL solveNonLinearGetFirstSolution
5.27/5.31	
5.27/5.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009310s
5.27/5.31	Time used: 0.006214
5.27/5.31	
5.27/5.31	Proving non-termination of subgraph 1
5.27/5.31	Transitions:
5.27/5.31	<l1, l1, 0 <= __const_1000^0 /\ 1 <= __const_1000^0 + x^0 /\ 1 <= undef2 /\ __const_1000^0 + x^0 = undef2, {x^0 -> undef2, rest remain the same}>
5.27/5.31	Variables:
5.27/5.31	__const_1000^0, x^0
5.27/5.31	
5.27/5.31	Checking that every undef value has an assignment...
5.27/5.31	
5.27/5.31	LOG: CALL solveLinear
5.27/5.31	
5.27/5.31	LOG: RETURN solveLinear - Elapsed time: 0.001123s
5.27/5.31	Checking conditional non-termination of SCC {l1}...
5.27/5.31	EXIT TRANSITIONS:
5.27/5.31	<l1, end, __const_1000^0 + x^0 <= 0 /\ 0 <= __const_1000^0, {all remain the same}>
5.27/5.31	<l1, end, 1 + __const_1000^0 <= 0, {all remain the same}>
5.27/5.31	
5.27/5.31	Solving with 1 template(s).
5.27/5.31	
5.27/5.31	LOG: CALL solveNonLinearGetFirstSolution
5.27/5.31	
5.27/5.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.018065s
5.27/5.31	Time used: 0.017811
5.27/5.31	Improving Solution with cost 2 ...
5.27/5.31	
5.27/5.31	LOG: CALL solveNonLinearGetNextSolution
5.27/5.31	
5.27/5.31	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.045991s
5.27/5.31	Time used: 0.045989
5.27/5.31	
5.27/5.31	LOG: SAT solveNonLinear - Elapsed time: 0.064056s
5.27/5.31	Cost: 2; Total time: 0.0638
5.27/5.31	Failed at location 1: 1 <= __const_1000^0
5.27/5.31	Before Improving: 
5.27/5.31	Quasi-invariant at l1: 1 <= __const_1000^0
5.27/5.31	Optimizing invariants...
5.27/5.31	
5.27/5.31	LOG: CALL solveLinear
5.27/5.31	
5.27/5.31	LOG: RETURN solveLinear - Elapsed time: 0.007903s
5.27/5.31	Remaining time after improvement: 0.998231
5.27/5.31	Minimizing number of undef constraints...
5.27/5.31	
5.27/5.31	LOG: CALL solveNonLinear
5.27/5.31	
5.27/5.31	LOG: RETURN solveNonLinear - Elapsed time: 0.003220s
5.27/5.31	Number of undef constraints reduced!
5.27/5.31	
5.27/5.31	Non-termination implied by a set of quasi-invariant(s):
5.27/5.31	Quasi-invariant at l1: 1 <= __const_1000^0
5.27/5.31	
5.27/5.31	Strengthening and disabling EXIT transitions...
5.27/5.31	Closed exits from l1: 1
5.27/5.31	Strengthening exit transition (result): 
5.27/5.31	<l1, end, __const_1000^0 + x^0 <= 0 /\ 1 <= __const_1000^0, {all remain the same}>
5.27/5.31	
5.27/5.31	Strengthening and disabling transitions...
5.27/5.31	
5.27/5.31	LOG: CALL solverLinear in Graph for feasibility
5.27/5.31	
5.27/5.31	LOG: RETURN solveLinear in Graph for feasibility
5.27/5.31	Strengthening transition (result): 
5.27/5.31	<l1, l1, 1 <= __const_1000^0 /\ 1 <= __const_1000^0 + x^0 /\ 1 <= undef2 /\ __const_1000^0 + x^0 = undef2, {x^0 -> undef2, rest remain the same}>
5.27/5.31	
5.27/5.31	Checking conditional non-termination of SCC {l1}...
5.27/5.31	EXIT TRANSITIONS:
5.27/5.31	<l1, end, __const_1000^0 + x^0 <= 0 /\ 1 <= __const_1000^0, {all remain the same}>
5.27/5.31	
5.27/5.31	Solving with 1 template(s).
5.27/5.31	
5.27/5.31	LOG: CALL solveNonLinearGetFirstSolution
5.27/5.31	
5.27/5.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.015020s
5.27/5.31	Time used: 0.014776
5.27/5.31	Improving Solution with cost 1 ...
5.27/5.31	
5.27/5.31	LOG: CALL solveNonLinearGetNextSolution
5.27/5.31	
5.27/5.31	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.021844s
5.27/5.31	Time used: 0.021839
5.27/5.31	
5.27/5.31	LOG: SAT solveNonLinear - Elapsed time: 0.036864s
5.27/5.31	Cost: 1; Total time: 0.036615
5.27/5.31	Failed at location 1: 1 <= x^0
5.27/5.31	Before Improving: 
5.27/5.31	Quasi-invariant at l1: 1 <= x^0
5.27/5.31	Optimizing invariants...
5.27/5.31	
5.27/5.31	LOG: CALL solveLinear
5.27/5.31	
5.27/5.31	LOG: RETURN solveLinear - Elapsed time: 0.007481s
5.27/5.31	Remaining time after improvement: 0.998187
5.27/5.31	Minimizing number of undef constraints...
5.27/5.31	
5.27/5.31	LOG: CALL solveNonLinear
5.27/5.31	
5.27/5.31	LOG: RETURN solveNonLinear - Elapsed time: 0.003007s
5.27/5.31	Number of undef constraints reduced!
5.27/5.31	
5.27/5.31	Non-termination implied by a set of quasi-invariant(s):
5.27/5.31	Quasi-invariant at l1: 1 <= x^0
5.27/5.31	
5.27/5.31	Strengthening and disabling EXIT transitions...
5.27/5.31	Closed exits from l1: 1
5.27/5.31	
5.27/5.31	Strengthening and disabling transitions...
5.27/5.31	
5.27/5.31	LOG: CALL solverLinear in Graph for feasibility
5.27/5.31	
5.27/5.31	LOG: RETURN solveLinear in Graph for feasibility
5.27/5.31	Strengthening transition (result): 
5.27/5.31	<l1, l1, 1 <= __const_1000^0 /\ 1 <= __const_1000^0 + x^0 /\ 1 <= x^0 /\ 1 <= undef2 /\ __const_1000^0 + x^0 = undef2, {x^0 -> undef2, rest remain the same}>
5.27/5.31	
5.27/5.31	Calling reachability with...
5.27/5.31	Transition: <l1, end, true, {all remain the same}>
5.27/5.31	Conditions: 1 <= __const_1000^0, 1 <= x^0, 
5.27/5.31	OPEN EXITS: 
5.27/5.31	<l1, end, 1 <= x^0, {all remain the same}> (condsUp: 1 <= __const_1000^0)
5.27/5.31	
5.27/5.31	--- Reachability graph ---
5.27/5.31	> Graph without transitions.
5.27/5.31	
5.27/5.31	Calling reachability with...
5.27/5.31	Transition: <l0, l1, true, {all remain the same}>
5.27/5.31	Conditions: 1 <= x^0, 1 <= __const_1000^0, 
5.27/5.31	OPEN EXITS: 
5.27/5.31	<l0, l1, 1 <= __const_1000^0 /\ 1 <= x^0, {all remain the same}>
5.27/5.31	
5.27/5.31	> Conditions are reachable!
5.27/5.31	
5.27/5.31	Program does NOT terminate
5.27/5.31	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
5.27/5.31	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
5.27/5.31	EOF