5.32/5.35	NO
5.32/5.35	
5.32/5.35	Solver Timeout: 4
5.32/5.35	Global Timeout: 300
5.32/5.35	No parsing errors!
5.32/5.35	Init Location: 0
5.32/5.35	Transitions:
5.32/5.35	<l0, l4, true>
5.32/5.35	<l1, l2, (undef3 = ((0 + __const_1000^0) + x^0)) /\ ((1 + __const_200^0) <= (0 + undef3)), par{x^0 -> undef3}>
5.32/5.35	<l2, l1, true>
5.32/5.35	<l3, l1, true>
5.32/5.35	<l4, l3, true>
5.32/5.35	
5.32/5.35	Fresh variables:
5.32/5.35	undef3, 
5.32/5.35	
5.32/5.35	Undef variables:
5.32/5.35	undef3, 
5.32/5.35	
5.32/5.35	Abstraction variables:
5.32/5.35	
5.32/5.35	Exit nodes:
5.32/5.35	
5.32/5.35	Accepting locations:
5.32/5.35	
5.32/5.35	Asserts:
5.32/5.35	
5.32/5.35	Preprocessed LLVMGraph
5.32/5.35	Init Location: 0
5.32/5.35	Transitions:
5.32/5.35	<l0, l1, true>
5.32/5.35	<l1, l1, (undef3 = ((0 + __const_1000^0) + x^0)) /\ ((1 + __const_200^0) <= (0 + undef3)), par{x^0 -> undef3}>
5.32/5.35	
5.32/5.35	Fresh variables:
5.32/5.35	undef3, 
5.32/5.35	
5.32/5.35	Undef variables:
5.32/5.35	undef3, 
5.32/5.35	
5.32/5.35	Abstraction variables:
5.32/5.35	
5.32/5.35	Exit nodes:
5.32/5.35	
5.32/5.35	Accepting locations:
5.32/5.35	
5.32/5.35	Asserts:
5.32/5.35	
5.32/5.35	*************************************************************
5.32/5.35	*******************************************************************************************
5.32/5.35	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
5.32/5.35	*******************************************************************************************
5.32/5.35	
5.32/5.35	Init Location: 0
5.32/5.35	Graph 0:
5.32/5.35	Transitions:
5.32/5.35	Variables:
5.32/5.35	
5.32/5.35	Graph 1:
5.32/5.35	Transitions:
5.32/5.35	<l1, l1, 1 + __const_200^0 <= undef3 /\ __const_1000^0 + x^0 = undef3, {x^0 -> undef3, rest remain the same}>
5.32/5.35	Variables:
5.32/5.35	__const_1000^0, __const_200^0, x^0
5.32/5.35	
5.32/5.35	Precedence: 
5.32/5.35	Graph 0
5.32/5.35	
5.32/5.35	Graph 1
5.32/5.35	<l0, l1, true, {all remain the same}>
5.32/5.35	
5.32/5.35	Map Locations to Subgraph:
5.32/5.35	( 0 , 0 )
5.32/5.35	( 1 , 1 )
5.32/5.35	
5.32/5.35	*******************************************************************************************
5.32/5.35	********************************    CHECKING ASSERTIONS    ********************************
5.32/5.35	*******************************************************************************************
5.32/5.35	
5.32/5.35	Proving termination of subgraph 0
5.32/5.35	Proving termination of subgraph 1
5.32/5.35	Checking unfeasibility...
5.32/5.35	Time used: 0.002298
5.32/5.35	
5.32/5.35	Checking conditional termination of SCC {l1}...
5.32/5.35	
5.32/5.35	LOG: CALL solveLinear
5.32/5.35	
5.32/5.35	LOG: RETURN solveLinear - Elapsed time: 0.000789s
5.32/5.35	
5.32/5.35	LOG: CALL solveLinear
5.32/5.35	
5.32/5.35	LOG: RETURN solveLinear - Elapsed time: 0.002436s
5.32/5.35	Trying to remove transition: <l1, l1, 1 + __const_200^0 <= undef3 /\ __const_1000^0 + x^0 = undef3, {x^0 -> undef3, rest remain the same}>
5.32/5.35	Solving with 1 template(s).
5.32/5.35	
5.32/5.35	LOG: CALL solveNonLinearGetFirstSolution
5.32/5.35	
5.32/5.35	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006812s
5.32/5.35	Time used: 0.006647
5.32/5.35	Solving with 1 template(s).
5.32/5.35	
5.32/5.35	LOG: CALL solveNonLinearGetFirstSolution
5.32/5.35	
5.32/5.35	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009068s
5.32/5.35	Time used: 0.008562
5.32/5.35	Improving Solution with cost 1 ...
5.32/5.35	
5.32/5.35	LOG: CALL solveNonLinearGetNextSolution
5.32/5.35	
5.32/5.35	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.015307s
5.32/5.35	Time used: 0.015302
5.32/5.35	
5.32/5.35	LOG: SAT solveNonLinear - Elapsed time: 0.024375s
5.32/5.35	Cost: 1; Total time: 0.023864
5.32/5.35	Failed at location 1: 1 + __const_1000^0 <= 0
5.32/5.35	Before Improving: 
5.32/5.35	Quasi-invariant at l1: 1 + __const_1000^0 <= 0
5.32/5.35	Optimizing invariants...
5.32/5.35	
5.32/5.35	LOG: CALL solveLinear
5.32/5.35	
5.32/5.35	LOG: RETURN solveLinear - Elapsed time: 0.002432s
5.32/5.35	Remaining time after improvement: 0.998836
5.32/5.35	Termination implied by a set of quasi-invariant(s):
5.32/5.35	Quasi-invariant at l1: 1 + __const_1000^0 <= 0
5.32/5.35	[ Invariant Graph ]
5.32/5.35	Strengthening and disabling transitions...
5.32/5.35	
5.32/5.35	LOG: CALL solverLinear in Graph for feasibility
5.32/5.35	
5.32/5.35	LOG: RETURN solveLinear in Graph for feasibility
5.32/5.35	Strengthening transition (result): 
5.32/5.35	<l1, l1, 1 + __const_1000^0 <= 0 /\ 1 + __const_200^0 <= undef3 /\ __const_1000^0 + x^0 = undef3, {x^0 -> undef3, rest remain the same}>
5.32/5.35	[ Termination Graph ]
5.32/5.35	Strengthening and disabling transitions...
5.32/5.35	
5.32/5.35	LOG: CALL solverLinear in Graph for feasibility
5.32/5.35	
5.32/5.35	LOG: RETURN solveLinear in Graph for feasibility
5.32/5.35	Strengthening transition (result): 
5.32/5.35	<l1, l1, 1 + __const_1000^0 <= 0 /\ 1 + __const_200^0 <= undef3 /\ __const_1000^0 + x^0 = undef3, {x^0 -> undef3, rest remain the same}>
5.32/5.35	Ranking function: __const_1000^0 - __const_200^0 + x^0
5.32/5.35	New Graphs: 
5.32/5.35	Calling Safety with literal 1 + __const_1000^0 <= 0 and entry <l0, l1, true, {all remain the same}>
5.32/5.35	
5.32/5.35	LOG: CALL check - Post:1 + __const_1000^0 <= 0 - Process 1
5.32/5.35	* Exit transition: <l0, l1, true, {all remain the same}>
5.32/5.35	* Postcondition  : 1 + __const_1000^0 <= 0
5.32/5.35	
5.32/5.35	LOG: CALL solveLinear
5.32/5.35	
5.32/5.35	LOG: RETURN solveLinear - Elapsed time: 0.000281s
5.32/5.35	> Postcondition is not implied!
5.32/5.35	
5.32/5.35	LOG: RETURN check - Elapsed time: 0.000359s
5.32/5.35	INVARIANTS: 
5.32/5.35	1: 
5.32/5.35	Quasi-INVARIANTS to narrow Graph: 
5.32/5.35	1: 1 + __const_1000^0 <= 0 , 
5.32/5.35	Narrowing transition: 
5.32/5.35	<l1, l1, 1 + __const_200^0 <= undef3 /\ __const_1000^0 + x^0 = undef3, {x^0 -> undef3, rest remain the same}>
5.32/5.35	
5.32/5.35	LOG: Narrow transition size 1
5.32/5.35	invGraph after Narrowing: 
5.32/5.35	Transitions:
5.32/5.35	<l1, l1, 0 <= __const_1000^0 /\ 1 + __const_200^0 <= undef3 /\ __const_1000^0 + x^0 = undef3, {x^0 -> undef3, rest remain the same}>
5.32/5.35	Variables:
5.32/5.35	__const_1000^0, __const_200^0, x^0
5.32/5.35	Checking conditional termination of SCC {l1}...
5.32/5.35	
5.32/5.35	LOG: CALL solveLinear
5.32/5.35	
5.32/5.35	LOG: RETURN solveLinear - Elapsed time: 0.000799s
5.32/5.35	
5.32/5.35	LOG: CALL solveLinear
5.32/5.35	
5.32/5.35	LOG: RETURN solveLinear - Elapsed time: 0.002578s
5.32/5.35	Trying to remove transition: <l1, l1, 0 <= __const_1000^0 /\ 1 + __const_200^0 <= undef3 /\ __const_1000^0 + x^0 = undef3, {x^0 -> undef3, rest remain the same}>
5.32/5.35	Solving with 1 template(s).
5.32/5.35	
5.32/5.35	LOG: CALL solveNonLinearGetFirstSolution
5.32/5.35	
5.32/5.35	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006794s
5.32/5.35	Time used: 0.006627
5.32/5.35	Solving with 1 template(s).
5.32/5.35	
5.32/5.35	LOG: CALL solveNonLinearGetFirstSolution
5.32/5.35	
5.32/5.35	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012363s
5.32/5.35	Time used: 0.011821
5.32/5.35	Improving Solution with cost 1 ...
5.32/5.35	
5.32/5.35	LOG: CALL solveNonLinearGetNextSolution
5.32/5.35	
5.32/5.35	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.013155s
5.32/5.35	Time used: 0.013149
5.32/5.35	
5.32/5.35	LOG: SAT solveNonLinear - Elapsed time: 0.025518s
5.32/5.35	Cost: 1; Total time: 0.02497
5.32/5.35	Failed at location 1: __const_1000^0 + x^0 <= __const_200^0
5.32/5.35	Before Improving: 
5.32/5.35	Quasi-invariant at l1: __const_1000^0 + x^0 <= __const_200^0
5.32/5.35	Optimizing invariants...
5.32/5.35	
5.32/5.35	LOG: CALL solveLinear
5.32/5.35	
5.32/5.35	LOG: RETURN solveLinear - Elapsed time: 0.002342s
5.32/5.35	Remaining time after improvement: 0.998863
5.32/5.35	Termination implied by a set of quasi-invariant(s):
5.32/5.35	Quasi-invariant at l1: __const_1000^0 + x^0 <= __const_200^0
5.32/5.35	[ Invariant Graph ]
5.32/5.35	Strengthening and disabling transitions...
5.32/5.35	
5.32/5.35	LOG: CALL solverLinear in Graph for feasibility
5.32/5.35	
5.32/5.35	LOG: RETURN solveLinear in Graph for feasibility
5.32/5.35	It's unfeasible. Removing transition: 
5.32/5.35	<l1, l1, 0 <= __const_1000^0 /\ 1 + __const_200^0 <= undef3 /\ __const_1000^0 + x^0 = undef3, {x^0 -> undef3, rest remain the same}>
5.32/5.35	[ Termination Graph ]
5.32/5.35	Strengthening and disabling transitions...
5.32/5.35	> It's unfeasible. Removing transition: 
5.32/5.35	<l1, l1, 0 <= __const_1000^0 /\ 1 + __const_200^0 <= undef3 /\ __const_1000^0 + x^0 = undef3, {x^0 -> undef3, rest remain the same}>
5.32/5.35	New Graphs: 
5.32/5.35	Calling Safety with literal __const_1000^0 + x^0 <= __const_200^0 and entry <l0, l1, 0 <= __const_1000^0, {all remain the same}>
5.32/5.35	
5.32/5.35	LOG: CALL check - Post:__const_1000^0 + x^0 <= __const_200^0 - Process 2
5.32/5.35	* Exit transition: <l0, l1, 0 <= __const_1000^0, {all remain the same}>
5.32/5.35	* Postcondition  : __const_1000^0 + x^0 <= __const_200^0
5.32/5.35	
5.32/5.35	LOG: CALL solveLinear
5.32/5.35	
5.32/5.35	LOG: RETURN solveLinear - Elapsed time: 0.000463s
5.32/5.35	> Postcondition is not implied!
5.32/5.35	
5.32/5.35	LOG: RETURN check - Elapsed time: 0.000548s
5.32/5.35	INVARIANTS: 
5.32/5.35	1: 
5.32/5.35	Quasi-INVARIANTS to narrow Graph: 
5.32/5.35	1: __const_1000^0 + x^0 <= __const_200^0 , 
5.32/5.35	Narrowing transition: 
5.32/5.35	<l1, l1, 0 <= __const_1000^0 /\ 1 + __const_200^0 <= undef3 /\ __const_1000^0 + x^0 = undef3, {x^0 -> undef3, rest remain the same}>
5.32/5.35	
5.32/5.35	LOG: Narrow transition size 1
5.32/5.35	invGraph after Narrowing: 
5.32/5.35	Transitions:
5.32/5.35	<l1, l1, 0 <= __const_1000^0 /\ 1 + __const_200^0 <= __const_1000^0 + x^0 /\ 1 + __const_200^0 <= undef3 /\ __const_1000^0 + x^0 = undef3, {x^0 -> undef3, rest remain the same}>
5.32/5.35	Variables:
5.32/5.35	__const_1000^0, __const_200^0, x^0
5.32/5.35	Checking conditional termination of SCC {l1}...
5.32/5.35	
5.32/5.35	LOG: CALL solveLinear
5.32/5.35	
5.32/5.35	LOG: RETURN solveLinear - Elapsed time: 0.000721s
5.32/5.35	
5.32/5.35	LOG: CALL solveLinear
5.32/5.35	
5.32/5.35	LOG: RETURN solveLinear - Elapsed time: 0.002776s
5.32/5.35	Trying to remove transition: <l1, l1, 0 <= __const_1000^0 /\ 1 + __const_200^0 <= __const_1000^0 + x^0 /\ 1 + __const_200^0 <= undef3 /\ __const_1000^0 + x^0 = undef3, {x^0 -> undef3, rest remain the same}>
5.32/5.35	Solving with 1 template(s).
5.32/5.35	
5.32/5.35	LOG: CALL solveNonLinearGetFirstSolution
5.32/5.35	
5.32/5.35	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005856s
5.32/5.35	Time used: 0.005677
5.32/5.35	Solving with 1 template(s).
5.32/5.35	
5.32/5.35	LOG: CALL solveNonLinearGetFirstSolution
5.32/5.35	
5.32/5.35	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011115s
5.32/5.35	Time used: 0.010679
5.32/5.35	Solving with 2 template(s).
5.32/5.35	
5.32/5.35	LOG: CALL solveNonLinearGetFirstSolution
5.32/5.35	
5.32/5.35	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001068s
5.32/5.35	Time used: 4.00043
5.32/5.35	Solving with 3 template(s).
5.32/5.35	
5.32/5.35	LOG: CALL solveNonLinearGetFirstSolution
5.32/5.35	
5.32/5.35	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.003033s
5.32/5.35	Time used: 1.00008
5.32/5.35	Solving with 1 template(s).
5.32/5.35	
5.32/5.35	LOG: CALL solveNonLinearGetFirstSolution
5.32/5.35	
5.32/5.35	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.015031s
5.32/5.35	Time used: 0.008009
5.32/5.35	
5.32/5.35	Proving non-termination of subgraph 1
5.32/5.35	Transitions:
5.32/5.35	<l1, l1, 0 <= __const_1000^0 /\ 1 + __const_200^0 <= __const_1000^0 + x^0 /\ 1 + __const_200^0 <= undef3 /\ __const_1000^0 + x^0 = undef3, {x^0 -> undef3, rest remain the same}>
5.32/5.35	Variables:
5.32/5.35	__const_1000^0, __const_200^0, x^0
5.32/5.35	
5.32/5.35	Checking that every undef value has an assignment...
5.32/5.35	
5.32/5.35	LOG: CALL solveLinear
5.32/5.35	
5.32/5.35	LOG: RETURN solveLinear - Elapsed time: 0.001295s
5.32/5.35	Checking conditional non-termination of SCC {l1}...
5.32/5.35	EXIT TRANSITIONS:
5.32/5.35	<l1, end, __const_1000^0 + x^0 <= __const_200^0 /\ 0 <= __const_1000^0, {all remain the same}>
5.32/5.35	<l1, end, 1 + __const_1000^0 <= 0, {all remain the same}>
5.32/5.35	
5.32/5.35	Solving with 1 template(s).
5.32/5.35	
5.32/5.35	LOG: CALL solveNonLinearGetFirstSolution
5.32/5.35	
5.32/5.35	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.031739s
5.32/5.35	Time used: 0.031424
5.32/5.35	Improving Solution with cost 2 ...
5.32/5.35	
5.32/5.35	LOG: CALL solveNonLinearGetNextSolution
5.32/5.35	
5.32/5.35	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.068173s
5.32/5.35	Time used: 0.068166
5.32/5.35	
5.32/5.35	LOG: SAT solveNonLinear - Elapsed time: 0.099912s
5.32/5.35	Cost: 2; Total time: 0.09959
5.32/5.35	Failed at location 1: 1 <= __const_1000^0
5.32/5.35	Before Improving: 
5.32/5.35	Quasi-invariant at l1: 1 <= __const_1000^0
5.32/5.35	Optimizing invariants...
5.32/5.35	
5.32/5.35	LOG: CALL solveLinear
5.32/5.35	
5.32/5.35	LOG: RETURN solveLinear - Elapsed time: 0.009606s
5.32/5.35	Remaining time after improvement: 0.998058
5.32/5.35	Minimizing number of undef constraints...
5.32/5.35	
5.32/5.35	LOG: CALL solveNonLinear
5.32/5.35	
5.32/5.35	LOG: RETURN solveNonLinear - Elapsed time: 0.003563s
5.32/5.35	Number of undef constraints reduced!
5.32/5.35	
5.32/5.35	Non-termination implied by a set of quasi-invariant(s):
5.32/5.35	Quasi-invariant at l1: 1 <= __const_1000^0
5.32/5.35	
5.32/5.35	Strengthening and disabling EXIT transitions...
5.32/5.35	Closed exits from l1: 1
5.32/5.35	Strengthening exit transition (result): 
5.32/5.35	<l1, end, __const_1000^0 + x^0 <= __const_200^0 /\ 1 <= __const_1000^0, {all remain the same}>
5.32/5.35	
5.32/5.35	Strengthening and disabling transitions...
5.32/5.35	
5.32/5.35	LOG: CALL solverLinear in Graph for feasibility
5.32/5.35	
5.32/5.35	LOG: RETURN solveLinear in Graph for feasibility
5.32/5.35	Strengthening transition (result): 
5.32/5.35	<l1, l1, 1 <= __const_1000^0 /\ 1 + __const_200^0 <= __const_1000^0 + x^0 /\ 1 + __const_200^0 <= undef3 /\ __const_1000^0 + x^0 = undef3, {x^0 -> undef3, rest remain the same}>
5.32/5.35	
5.32/5.35	Checking conditional non-termination of SCC {l1}...
5.32/5.35	EXIT TRANSITIONS:
5.32/5.35	<l1, end, __const_1000^0 + x^0 <= __const_200^0 /\ 1 <= __const_1000^0, {all remain the same}>
5.32/5.35	
5.32/5.35	Solving with 1 template(s).
5.32/5.35	
5.32/5.35	LOG: CALL solveNonLinearGetFirstSolution
5.32/5.35	
5.32/5.35	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.016599s
5.32/5.35	Time used: 0.016299
5.32/5.35	Improving Solution with cost 1 ...
5.32/5.35	
5.32/5.35	LOG: CALL solveNonLinearGetNextSolution
5.32/5.35	
5.32/5.35	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.027790s
5.32/5.35	Time used: 0.027784
5.32/5.35	
5.32/5.35	LOG: SAT solveNonLinear - Elapsed time: 0.044389s
5.32/5.35	Cost: 1; Total time: 0.044083
5.32/5.35	Failed at location 1: __const_1000^0 + __const_200^0 <= 1 + x^0
5.32/5.35	Before Improving: 
5.32/5.35	Quasi-invariant at l1: __const_1000^0 + __const_200^0 <= 1 + x^0
5.32/5.35	Optimizing invariants...
5.32/5.35	
5.32/5.35	LOG: CALL solveLinear
5.32/5.35	
5.32/5.35	LOG: RETURN solveLinear - Elapsed time: 0.009321s
5.32/5.35	Remaining time after improvement: 0.99803
5.32/5.35	Minimizing number of undef constraints...
5.32/5.35	
5.32/5.35	LOG: CALL solveNonLinear
5.32/5.35	
5.32/5.35	LOG: RETURN solveNonLinear - Elapsed time: 0.003375s
5.32/5.35	Number of undef constraints reduced!
5.32/5.35	
5.32/5.35	Non-termination implied by a set of quasi-invariant(s):
5.32/5.35	Quasi-invariant at l1: __const_1000^0 + __const_200^0 <= 1 + x^0
5.32/5.35	
5.32/5.35	Strengthening and disabling EXIT transitions...
5.32/5.35	Closed exits from l1: 1
5.32/5.35	
5.32/5.35	Strengthening and disabling transitions...
5.32/5.35	
5.32/5.35	LOG: CALL solverLinear in Graph for feasibility
5.32/5.35	
5.32/5.35	LOG: RETURN solveLinear in Graph for feasibility
5.32/5.35	Strengthening transition (result): 
5.32/5.35	<l1, l1, 1 <= __const_1000^0 /\ 1 + __const_200^0 <= __const_1000^0 + x^0 /\ 1 + __const_200^0 <= undef3 /\ __const_1000^0 + __const_200^0 <= 1 + x^0 /\ __const_1000^0 + x^0 = undef3, {x^0 -> undef3, rest remain the same}>
5.32/5.35	
5.32/5.35	Calling reachability with...
5.32/5.35	Transition: <l1, end, true, {all remain the same}>
5.32/5.35	Conditions: 1 <= __const_1000^0, __const_1000^0 + __const_200^0 <= 1 + x^0, 
5.32/5.35	OPEN EXITS: 
5.32/5.35	<l1, end, __const_1000^0 + __const_200^0 <= 1 + x^0, {all remain the same}> (condsUp: 1 <= __const_1000^0)
5.32/5.35	
5.32/5.35	--- Reachability graph ---
5.32/5.35	> Graph without transitions.
5.32/5.35	
5.32/5.35	Calling reachability with...
5.32/5.35	Transition: <l0, l1, true, {all remain the same}>
5.32/5.35	Conditions: __const_1000^0 + __const_200^0 <= 1 + x^0, 1 <= __const_1000^0, 
5.32/5.35	OPEN EXITS: 
5.32/5.35	<l0, l1, 1 <= __const_1000^0 /\ __const_1000^0 + __const_200^0 <= 1 + x^0, {all remain the same}>
5.32/5.35	
5.32/5.35	> Conditions are reachable!
5.32/5.35	
5.32/5.35	Program does NOT terminate
5.32/5.35	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
5.32/5.35	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
5.32/5.35	EOF