16.99/17.01	NO
16.99/17.01	
16.99/17.01	Solver Timeout: 4
16.99/17.01	Global Timeout: 300
16.99/17.01	No parsing errors!
16.99/17.01	Init Location: 0
16.99/17.01	Transitions:
16.99/17.01	<l0, l5, true>
16.99/17.01	<l1, l2, (1 <= (0 + e^0)) /\ ((0 + n^0) <= (0 + __const_100^0)), par{e^0 -> (1 + e^0), n^0 -> ((0 + __const_11^0) + n^0)}>
16.99/17.01	<l2, l1, true>
16.99/17.01	<l1, l3, (1 <= (0 + e^0)) /\ ((1 + __const_100^0) <= (0 + n^0)), par{e^0 -> (~(1) + e^0), n^0 -> ((0 + (~(1) * __const_10^0)) + n^0)}>
16.99/17.01	<l3, l1, true>
16.99/17.01	<l4, l1, (undef25 = undef25), par{e^0 -> 1, n^0 -> undef25}>
16.99/17.01	<l5, l4, true>
16.99/17.01	
16.99/17.01	Fresh variables:
16.99/17.01	undef25, 
16.99/17.01	
16.99/17.01	Undef variables:
16.99/17.01	undef25, 
16.99/17.01	
16.99/17.01	Abstraction variables:
16.99/17.01	
16.99/17.01	Exit nodes:
16.99/17.01	
16.99/17.01	Accepting locations:
16.99/17.01	
16.99/17.01	Asserts:
16.99/17.01	
16.99/17.01	Preprocessed LLVMGraph
16.99/17.01	Init Location: 0
16.99/17.01	Transitions:
16.99/17.01	<l0, l1, (e^0 = 1) /\ (n^0 = undef25) /\ (undef25 = undef25)>
16.99/17.01	<l1, l1, (1 <= (0 + e^0)) /\ ((0 + n^0) <= (0 + __const_100^0)), par{e^0 -> (1 + e^0), n^0 -> ((0 + __const_11^0) + n^0)}>
16.99/17.01	<l1, l1, (1 <= (0 + e^0)) /\ ((1 + __const_100^0) <= (0 + n^0)), par{e^0 -> (~(1) + e^0), n^0 -> ((0 + (~(1) * __const_10^0)) + n^0)}>
16.99/17.01	
16.99/17.01	Fresh variables:
16.99/17.01	undef25, 
16.99/17.01	
16.99/17.01	Undef variables:
16.99/17.01	undef25, 
16.99/17.01	
16.99/17.01	Abstraction variables:
16.99/17.01	
16.99/17.01	Exit nodes:
16.99/17.01	
16.99/17.01	Accepting locations:
16.99/17.01	
16.99/17.01	Asserts:
16.99/17.01	
16.99/17.01	*************************************************************
16.99/17.01	*******************************************************************************************
16.99/17.01	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
16.99/17.01	*******************************************************************************************
16.99/17.01	
16.99/17.01	Init Location: 0
16.99/17.01	Graph 0:
16.99/17.01	Transitions:
16.99/17.01	Variables:
16.99/17.01	
16.99/17.01	Graph 1:
16.99/17.01	Transitions:
16.99/17.01	<l1, l1, 1 <= e^0 /\ n^0 <= __const_100^0, {e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}>
16.99/17.01	<l1, l1, 1 + __const_100^0 <= n^0 /\ 1 <= e^0, {e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}>
16.99/17.01	Variables:
16.99/17.01	__const_100^0, __const_11^0, e^0, n^0, __const_10^0
16.99/17.01	
16.99/17.01	Precedence: 
16.99/17.01	Graph 0
16.99/17.01	
16.99/17.01	Graph 1
16.99/17.01	<l0, l1, n^0 = undef25 /\ e^0 = 1, {all remain the same}>
16.99/17.01	
16.99/17.01	Map Locations to Subgraph:
16.99/17.01	( 0 , 0 )
16.99/17.01	( 1 , 1 )
16.99/17.01	
16.99/17.01	*******************************************************************************************
16.99/17.01	********************************    CHECKING ASSERTIONS    ********************************
16.99/17.01	*******************************************************************************************
16.99/17.01	
16.99/17.01	Proving termination of subgraph 0
16.99/17.01	Proving termination of subgraph 1
16.99/17.01	Checking unfeasibility...
16.99/17.01	Time used: 0.007695
16.99/17.01	
16.99/17.01	Checking conditional termination of SCC {l1}...
16.99/17.01	
16.99/17.01	LOG: CALL solveLinear
16.99/17.01	
16.99/17.01	LOG: RETURN solveLinear - Elapsed time: 0.001716s
16.99/17.01	
16.99/17.01	LOG: CALL solveLinear
16.99/17.01	
16.99/17.01	LOG: RETURN solveLinear - Elapsed time: 0.006806s
16.99/17.01	Trying to remove transition: <l1, l1, 1 + __const_100^0 <= n^0 /\ 1 <= e^0, {e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}>
16.99/17.01	Solving with 1 template(s).
16.99/17.01	
16.99/17.01	LOG: CALL solveNonLinearGetFirstSolution
16.99/17.01	
16.99/17.01	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.017040s
16.99/17.01	Time used: 0.016761
16.99/17.01	Trying to remove transition: <l1, l1, 1 <= e^0 /\ n^0 <= __const_100^0, {e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}>
16.99/17.01	Solving with 1 template(s).
16.99/17.01	
16.99/17.01	LOG: CALL solveNonLinearGetFirstSolution
16.99/17.01	
16.99/17.01	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010441s
16.99/17.01	Time used: 0.00958
16.99/17.01	Solving with 1 template(s).
16.99/17.01	
16.99/17.01	LOG: CALL solveNonLinearGetFirstSolution
16.99/17.01	
16.99/17.01	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.068004s
16.99/17.01	Time used: 0.067206
16.99/17.01	Solving with 2 template(s).
16.99/17.01	
16.99/17.01	LOG: CALL solveNonLinearGetFirstSolution
16.99/17.01	
16.99/17.01	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.872056s
16.99/17.01	Time used: 0.869528
16.99/17.01	Improving Solution with cost 2 ...
16.99/17.01	
16.99/17.01	LOG: CALL solveNonLinearGetNextSolution
16.99/17.01	
16.99/17.01	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000722s
16.99/17.01	Time used: 1.00066
16.99/17.01	
16.99/17.01	LOG: SAT solveNonLinear - Elapsed time: 1.872778s
16.99/17.01	Cost: 2; Total time: 1.87018
16.99/17.01	Failed at location 1: 1 <= __const_11^0
16.99/17.01	Failed at location 1: __const_10^0 + __const_11^0 <= 1
16.99/17.01	Before Improving: 
16.99/17.01	Quasi-invariant at l1: 1 <= __const_11^0
16.99/17.01	Quasi-invariant at l1: __const_10^0 + __const_11^0 <= 1
16.99/17.01	Optimizing invariants...
16.99/17.01	
16.99/17.01	LOG: CALL solveLinear
16.99/17.01	
16.99/17.01	LOG: RETURN solveLinear - Elapsed time: 0.055258s
16.99/17.01	Remaining time after improvement: 0.997263
16.99/17.01	Termination implied by a set of quasi-invariant(s):
16.99/17.01	Quasi-invariant at l1: 1 <= __const_11^0
16.99/17.01	Quasi-invariant at l1: __const_10^0 + __const_11^0 <= 1
16.99/17.01	[ Invariant Graph ]
16.99/17.01	Strengthening and disabling transitions...
16.99/17.01	
16.99/17.01	LOG: CALL solverLinear in Graph for feasibility
16.99/17.01	
16.99/17.01	LOG: RETURN solveLinear in Graph for feasibility
16.99/17.01	Strengthening transition (result): 
16.99/17.01	<l1, l1, 1 <= __const_11^0 /\ 1 <= e^0 /\ n^0 <= __const_100^0 /\ __const_10^0 + __const_11^0 <= 1, {e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}>
16.99/17.01	
16.99/17.01	LOG: CALL solverLinear in Graph for feasibility
16.99/17.01	
16.99/17.01	LOG: RETURN solveLinear in Graph for feasibility
16.99/17.01	Strengthening transition (result): 
16.99/17.01	<l1, l1, 1 + __const_100^0 <= n^0 /\ 1 <= __const_11^0 /\ 1 <= e^0 /\ __const_10^0 + __const_11^0 <= 1, {e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}>
16.99/17.01	[ Termination Graph ]
16.99/17.01	Strengthening and disabling transitions...
16.99/17.01	
16.99/17.01	LOG: CALL solverLinear in Graph for feasibility
16.99/17.01	
16.99/17.01	LOG: RETURN solveLinear in Graph for feasibility
16.99/17.01	Strengthening transition (result): 
16.99/17.01	<l1, l1, 1 <= __const_11^0 /\ 1 <= e^0 /\ n^0 <= __const_100^0 /\ __const_10^0 + __const_11^0 <= 1, {e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}>
16.99/17.01	
16.99/17.01	LOG: CALL solverLinear in Graph for feasibility
16.99/17.01	
16.99/17.01	LOG: RETURN solveLinear in Graph for feasibility
16.99/17.01	Strengthening transition (result): 
16.99/17.01	<l1, l1, 1 + __const_100^0 <= n^0 /\ 1 <= __const_11^0 /\ 1 <= e^0 /\ __const_10^0 + __const_11^0 <= 1, {e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}>
16.99/17.01	Ranking function: 2 + 2*__const_100^0 - __const_10^0 - __const_11^0 - 2*n^0
16.99/17.01	New Graphs: 
16.99/17.01	Transitions:
16.99/17.01	<l1, l1, 1 + __const_100^0 <= n^0 /\ 1 <= __const_11^0 /\ 1 <= e^0 /\ __const_10^0 + __const_11^0 <= 1, {e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}>
16.99/17.01	Variables:
16.99/17.01	__const_100^0, __const_10^0, __const_11^0, e^0, n^0
16.99/17.01	Checking conditional termination of SCC {l1}...
16.99/17.01	
16.99/17.01	LOG: CALL solveLinear
16.99/17.01	
16.99/17.01	LOG: RETURN solveLinear - Elapsed time: 0.001177s
16.99/17.01	Ranking function: -1 + e^0
16.99/17.01	New Graphs: 
16.99/17.01	Calling Safety with literal 1 <= __const_11^0 and entry <l0, l1, n^0 = undef25 /\ e^0 = 1, {all remain the same}>
16.99/17.01	
16.99/17.01	LOG: CALL check - Post:1 <= __const_11^0 - Process 1
16.99/17.01	* Exit transition: <l0, l1, n^0 = undef25 /\ e^0 = 1, {all remain the same}>
16.99/17.01	* Postcondition  : 1 <= __const_11^0
16.99/17.01	
16.99/17.01	LOG: CALL solveLinear
16.99/17.01	
16.99/17.01	LOG: RETURN solveLinear - Elapsed time: 0.000610s
16.99/17.01	> Postcondition is not implied!
16.99/17.01	
16.99/17.01	LOG: RETURN check - Elapsed time: 0.000694s
16.99/17.01	Calling Safety with literal __const_10^0 + __const_11^0 <= 1 and entry <l0, l1, n^0 = undef25 /\ e^0 = 1, {all remain the same}>
16.99/17.01	
16.99/17.01	LOG: CALL check - Post:__const_10^0 + __const_11^0 <= 1 - Process 2
16.99/17.01	* Exit transition: <l0, l1, n^0 = undef25 /\ e^0 = 1, {all remain the same}>
16.99/17.01	* Postcondition  : __const_10^0 + __const_11^0 <= 1
16.99/17.01	
16.99/17.01	LOG: CALL solveLinear
16.99/17.01	
16.99/17.01	LOG: RETURN solveLinear - Elapsed time: 0.000609s
16.99/17.01	> Postcondition is not implied!
16.99/17.01	
16.99/17.01	LOG: RETURN check - Elapsed time: 0.000693s
16.99/17.01	INVARIANTS: 
16.99/17.01	1: 
16.99/17.01	Quasi-INVARIANTS to narrow Graph: 
16.99/17.01	1: 1 <= __const_11^0 , __const_10^0 + __const_11^0 <= 1 , 
16.99/17.01	Narrowing transition: 
16.99/17.01	<l1, l1, 1 <= e^0 /\ n^0 <= __const_100^0, {e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}>
16.99/17.01	
16.99/17.01	LOG: Narrow transition size 2
16.99/17.01	Narrowing transition: 
16.99/17.01	<l1, l1, 1 + __const_100^0 <= n^0 /\ 1 <= e^0, {e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}>
16.99/17.01	
16.99/17.01	LOG: Narrow transition size 2
16.99/17.01	invGraph after Narrowing: 
16.99/17.01	Transitions:
16.99/17.01	<l1, l1, 1 <= __const_11^0 /\ 1 <= e^0 /\ n^0 <= __const_100^0 /\ 2 <= __const_10^0 + __const_11^0, {e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}>
16.99/17.01	<l1, l1, 1 <= e^0 /\ n^0 <= __const_100^0 /\ __const_11^0 <= 0, {e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}>
16.99/17.01	<l1, l1, 1 + __const_100^0 <= n^0 /\ 1 <= __const_11^0 /\ 1 <= e^0 /\ 2 <= __const_10^0 + __const_11^0, {e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}>
16.99/17.01	<l1, l1, 1 + __const_100^0 <= n^0 /\ 1 <= e^0 /\ __const_11^0 <= 0, {e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}>
16.99/17.01	Variables:
16.99/17.01	__const_100^0, __const_11^0, e^0, n^0, __const_10^0
16.99/17.01	Checking conditional termination of SCC {l1}...
16.99/17.01	
16.99/17.01	LOG: CALL solveLinear
16.99/17.01	
16.99/17.01	LOG: RETURN solveLinear - Elapsed time: 0.002316s
16.99/17.01	
16.99/17.01	LOG: CALL solveLinear
16.99/17.01	
16.99/17.01	LOG: RETURN solveLinear - Elapsed time: 0.036137s
16.99/17.01	Trying to remove transition: <l1, l1, 1 + __const_100^0 <= n^0 /\ 1 <= e^0 /\ __const_11^0 <= 0, {e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}>
16.99/17.01	Solving with 1 template(s).
16.99/17.01	
16.99/17.01	LOG: CALL solveNonLinearGetFirstSolution
16.99/17.01	
16.99/17.01	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.038960s
16.99/17.01	Time used: 0.037875
16.99/17.01	Trying to remove transition: <l1, l1, 1 + __const_100^0 <= n^0 /\ 1 <= __const_11^0 /\ 1 <= e^0 /\ 2 <= __const_10^0 + __const_11^0, {e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}>
16.99/17.01	Solving with 1 template(s).
16.99/17.01	
16.99/17.01	LOG: CALL solveNonLinearGetFirstSolution
16.99/17.01	
16.99/17.01	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.040381s
16.99/17.01	Time used: 0.037144
16.99/17.01	Trying to remove transition: <l1, l1, 1 <= e^0 /\ n^0 <= __const_100^0 /\ __const_11^0 <= 0, {e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}>
16.99/17.01	Solving with 1 template(s).
16.99/17.01	
16.99/17.01	LOG: CALL solveNonLinearGetFirstSolution
16.99/17.01	
16.99/17.01	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.020843s
16.99/17.01	Time used: 0.01754
16.99/17.01	Trying to remove transition: <l1, l1, 1 <= __const_11^0 /\ 1 <= e^0 /\ n^0 <= __const_100^0 /\ 2 <= __const_10^0 + __const_11^0, {e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}>
16.99/17.01	Solving with 1 template(s).
16.99/17.01	
16.99/17.01	LOG: CALL solveNonLinearGetFirstSolution
16.99/17.01	
16.99/17.01	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.036550s
16.99/17.01	Time used: 0.034458
16.99/17.01	Solving with 1 template(s).
16.99/17.01	
16.99/17.01	LOG: CALL solveNonLinearGetFirstSolution
16.99/17.01	
16.99/17.01	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.076443s
16.99/17.01	Time used: 0.072863
16.99/17.01	Improving Solution with cost 1 ...
16.99/17.01	
16.99/17.01	LOG: CALL solveNonLinearGetNextSolution
16.99/17.01	
16.99/17.01	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.149187s
16.99/17.01	Time used: 0.149018
16.99/17.01	
16.99/17.01	LOG: SAT solveNonLinear - Elapsed time: 0.225631s
16.99/17.01	Cost: 1; Total time: 0.221881
16.99/17.01	Failed at location 1: 1 <= __const_11^0
16.99/17.01	Before Improving: 
16.99/17.01	Quasi-invariant at l1: 1 <= __const_11^0
16.99/17.01	Optimizing invariants...
16.99/17.01	
16.99/17.01	LOG: CALL solveLinear
16.99/17.01	
16.99/17.01	LOG: RETURN solveLinear - Elapsed time: 0.021983s
16.99/17.01	Remaining time after improvement: 0.995295
16.99/17.01	Termination implied by a set of quasi-invariant(s):
16.99/17.01	Quasi-invariant at l1: 1 <= __const_11^0
16.99/17.01	[ Invariant Graph ]
16.99/17.01	Strengthening and disabling transitions...
16.99/17.01	
16.99/17.01	LOG: CALL solverLinear in Graph for feasibility
16.99/17.01	
16.99/17.01	LOG: RETURN solveLinear in Graph for feasibility
16.99/17.01	Strengthening transition (result): 
16.99/17.01	<l1, l1, 1 <= __const_11^0 /\ 1 <= e^0 /\ n^0 <= __const_100^0 /\ 2 <= __const_10^0 + __const_11^0, {e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}>
16.99/17.01	
16.99/17.01	LOG: CALL solverLinear in Graph for feasibility
16.99/17.01	
16.99/17.01	LOG: RETURN solveLinear in Graph for feasibility
16.99/17.01	It's unfeasible. Removing transition: 
16.99/17.01	<l1, l1, 1 <= e^0 /\ n^0 <= __const_100^0 /\ __const_11^0 <= 0, {e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}>
16.99/17.01	
16.99/17.01	LOG: CALL solverLinear in Graph for feasibility
16.99/17.01	
16.99/17.01	LOG: RETURN solveLinear in Graph for feasibility
16.99/17.01	Strengthening transition (result): 
16.99/17.01	<l1, l1, 1 + __const_100^0 <= n^0 /\ 1 <= __const_11^0 /\ 1 <= e^0 /\ 2 <= __const_10^0 + __const_11^0, {e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}>
16.99/17.01	
16.99/17.01	LOG: CALL solverLinear in Graph for feasibility
16.99/17.01	
16.99/17.01	LOG: RETURN solveLinear in Graph for feasibility
16.99/17.01	It's unfeasible. Removing transition: 
16.99/17.01	<l1, l1, 1 + __const_100^0 <= n^0 /\ 1 <= e^0 /\ __const_11^0 <= 0, {e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}>
16.99/17.01	[ Termination Graph ]
16.99/17.01	Strengthening and disabling transitions...
16.99/17.01	> It's unfeasible. Removing transition: 
16.99/17.01	<l1, l1, 1 <= e^0 /\ n^0 <= __const_100^0 /\ __const_11^0 <= 0, {e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}>
16.99/17.01	
16.99/17.01	LOG: CALL solverLinear in Graph for feasibility
16.99/17.01	
16.99/17.01	LOG: RETURN solveLinear in Graph for feasibility
16.99/17.01	Strengthening transition (result): 
16.99/17.01	<l1, l1, 1 <= __const_11^0 /\ 1 <= e^0 /\ n^0 <= __const_100^0 /\ 2 <= __const_10^0 + __const_11^0, {e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}>
16.99/17.01	
16.99/17.01	LOG: CALL solverLinear in Graph for feasibility
16.99/17.01	
16.99/17.01	LOG: RETURN solveLinear in Graph for feasibility
16.99/17.01	Strengthening transition (result): 
16.99/17.01	<l1, l1, 1 + __const_100^0 <= n^0 /\ 1 <= __const_11^0 /\ 1 <= e^0 /\ 2 <= __const_10^0 + __const_11^0, {e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}>
16.99/17.01	
16.99/17.01	LOG: CALL solverLinear in Graph for feasibility
16.99/17.01	
16.99/17.01	LOG: RETURN solveLinear in Graph for feasibility
16.99/17.01	It's unfeasible. Removing transition: 
16.99/17.01	<l1, l1, 1 + __const_100^0 <= n^0 /\ 1 <= e^0 /\ __const_11^0 <= 0, {e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}>
16.99/17.01	New Graphs: 
16.99/17.01	Transitions:
16.99/17.01	<l1, l1, 1 <= __const_11^0 /\ 1 <= e^0 /\ n^0 <= __const_100^0 /\ 2 <= __const_10^0 + __const_11^0, {e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}>
16.99/17.01	<l1, l1, 1 + __const_100^0 <= n^0 /\ 1 <= __const_11^0 /\ 1 <= e^0 /\ 2 <= __const_10^0 + __const_11^0, {e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}>
16.99/17.01	Variables:
16.99/17.01	__const_100^0, __const_10^0, __const_11^0, e^0, n^0
16.99/17.01	Checking conditional termination of SCC {l1}...
16.99/17.01	
16.99/17.01	LOG: CALL solveLinear
16.99/17.01	
16.99/17.01	LOG: RETURN solveLinear - Elapsed time: 0.001546s
16.99/17.01	
16.99/17.01	LOG: CALL solveLinear
16.99/17.01	
16.99/17.01	LOG: RETURN solveLinear - Elapsed time: 0.016182s
16.99/17.01	Trying to remove transition: <l1, l1, 1 + __const_100^0 <= n^0 /\ 1 <= __const_11^0 /\ 1 <= e^0 /\ 2 <= __const_10^0 + __const_11^0, {e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}>
16.99/17.01	Solving with 1 template(s).
16.99/17.01	
16.99/17.01	LOG: CALL solveNonLinearGetFirstSolution
16.99/17.01	
16.99/17.01	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.025176s
16.99/17.01	Time used: 0.024612
16.99/17.01	Trying to remove transition: <l1, l1, 1 <= __const_11^0 /\ 1 <= e^0 /\ n^0 <= __const_100^0 /\ 2 <= __const_10^0 + __const_11^0, {e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}>
16.99/17.01	Solving with 1 template(s).
16.99/17.01	
16.99/17.01	LOG: CALL solveNonLinearGetFirstSolution
16.99/17.01	
16.99/17.01	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.024674s
16.99/17.01	Time used: 0.02328
16.99/17.01	Solving with 1 template(s).
16.99/17.01	
16.99/17.01	LOG: CALL solveNonLinearGetFirstSolution
16.99/17.01	
16.99/17.01	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002183s
16.99/17.01	Time used: 4.00039
16.99/17.01	Solving with 2 template(s).
16.99/17.01	
16.99/17.01	LOG: CALL solveNonLinearGetFirstSolution
16.99/17.01	
16.99/17.01	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.010497s
16.99/17.01	Time used: 4.00033
16.99/17.01	Solving with 3 template(s).
16.99/17.01	
16.99/17.01	LOG: CALL solveNonLinearGetFirstSolution
16.99/17.01	
16.99/17.01	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.020772s
16.99/17.01	Time used: 1.00029
16.99/17.01	Solving with 1 template(s).
16.99/17.01	
16.99/17.01	LOG: CALL solveNonLinearGetFirstSolution
16.99/17.01	
16.99/17.01	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.052285s
16.99/17.01	Time used: 0.033835
16.99/17.01	
16.99/17.01	Proving non-termination of subgraph 1
16.99/17.01	Transitions:
16.99/17.01	<l1, l1, 1 <= __const_11^0 /\ 1 <= e^0 /\ n^0 <= __const_100^0 /\ 2 <= __const_10^0 + __const_11^0, {e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}>
16.99/17.01	<l1, l1, 1 <= e^0 /\ n^0 <= __const_100^0 /\ __const_11^0 <= 0, {e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}>
16.99/17.01	<l1, l1, 1 + __const_100^0 <= n^0 /\ 1 <= __const_11^0 /\ 1 <= e^0 /\ 2 <= __const_10^0 + __const_11^0, {e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}>
16.99/17.01	<l1, l1, 1 + __const_100^0 <= n^0 /\ 1 <= e^0 /\ __const_11^0 <= 0, {e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}>
16.99/17.01	Variables:
16.99/17.01	__const_100^0, __const_11^0, e^0, n^0, __const_10^0
16.99/17.01	
16.99/17.01	Checking conditional non-termination of SCC {l1}...
16.99/17.01	EXIT TRANSITIONS:
16.99/17.01	<l1, end, 1 <= __const_11^0 /\ 1 <= e^0 /\ __const_10^0 + __const_11^0 <= 1, {all remain the same}>
16.99/17.01	<l1, end, 1 <= __const_11^0 /\ e^0 <= 0, {all remain the same}>
16.99/17.01	<l1, end, __const_11^0 <= 0 /\ e^0 <= 0, {all remain the same}>
16.99/17.01	
16.99/17.01	Solving with 1 template(s).
16.99/17.01	
16.99/17.01	LOG: CALL solveNonLinearGetFirstSolution
16.99/17.01	
16.99/17.01	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.049596s
16.99/17.01	Time used: 0.04924
16.99/17.01	Improving Solution with cost 3 ...
16.99/17.01	
16.99/17.01	LOG: CALL solveNonLinearGetNextSolution
16.99/17.01	
16.99/17.01	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.038352s
16.99/17.01	Time used: 0.038343
16.99/17.01	
16.99/17.01	LOG: SAT solveNonLinear - Elapsed time: 0.087948s
16.99/17.01	Cost: 3; Total time: 0.087583
16.99/17.01	Failed at location 1: 1 + __const_11^0 <= 0
16.99/17.01	Before Improving: 
16.99/17.01	Quasi-invariant at l1: 1 + __const_11^0 <= 0
16.99/17.01	Optimizing invariants...
16.99/17.01	
16.99/17.01	LOG: CALL solveLinear
16.99/17.01	
16.99/17.01	LOG: RETURN solveLinear - Elapsed time: 0.007983s
16.99/17.01	Remaining time after improvement: 0.997711
16.99/17.01	Non-termination implied by a set of quasi-invariant(s):
16.99/17.01	Quasi-invariant at l1: 1 + __const_11^0 <= 0
16.99/17.01	
16.99/17.01	Strengthening and disabling EXIT transitions...
16.99/17.01	Closed exits from l1: 2
16.99/17.01	Strengthening exit transition (result): 
16.99/17.01	<l1, end, 1 + __const_11^0 <= 0 /\ e^0 <= 0, {all remain the same}>
16.99/17.01	
16.99/17.01	Strengthening and disabling transitions...
16.99/17.01	
16.99/17.01	LOG: CALL solverLinear in Graph for feasibility
16.99/17.01	
16.99/17.01	LOG: RETURN solveLinear in Graph for feasibility
16.99/17.01	It's unfeasible. Removing transition: 
16.99/17.01	<l1, l1, 1 <= __const_11^0 /\ 1 <= e^0 /\ n^0 <= __const_100^0 /\ 2 <= __const_10^0 + __const_11^0, {e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}>
16.99/17.01	
16.99/17.01	LOG: CALL solverLinear in Graph for feasibility
16.99/17.01	
16.99/17.01	LOG: RETURN solveLinear in Graph for feasibility
16.99/17.01	Strengthening transition (result): 
16.99/17.01	<l1, l1, 1 + __const_11^0 <= 0 /\ 1 <= e^0 /\ n^0 <= __const_100^0, {e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}>
16.99/17.01	
16.99/17.01	LOG: CALL solverLinear in Graph for feasibility
16.99/17.01	
16.99/17.01	LOG: RETURN solveLinear in Graph for feasibility
16.99/17.01	It's unfeasible. Removing transition: 
16.99/17.01	<l1, l1, 1 + __const_100^0 <= n^0 /\ 1 <= __const_11^0 /\ 1 <= e^0 /\ 2 <= __const_10^0 + __const_11^0, {e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}>
16.99/17.01	
16.99/17.01	LOG: CALL solverLinear in Graph for feasibility
16.99/17.01	
16.99/17.01	LOG: RETURN solveLinear in Graph for feasibility
16.99/17.01	Strengthening transition (result): 
16.99/17.01	<l1, l1, 1 + __const_100^0 <= n^0 /\ 1 + __const_11^0 <= 0 /\ 1 <= e^0, {e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}>
16.99/17.01	
16.99/17.01	Checking conditional non-termination of SCC {l1}...
16.99/17.01	EXIT TRANSITIONS:
16.99/17.01	<l1, end, 1 + __const_11^0 <= 0 /\ e^0 <= 0, {all remain the same}>
16.99/17.01	
16.99/17.01	Solving with 1 template(s).
16.99/17.01	
16.99/17.01	LOG: CALL solveNonLinearGetFirstSolution
16.99/17.01	
16.99/17.01	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.003276s
16.99/17.01	Time used: 5.00244
16.99/17.01	Solving with 2 template(s).
16.99/17.01	
16.99/17.01	LOG: CALL solveNonLinearGetFirstSolution
16.99/17.01	
16.99/17.01	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.074830s
16.99/17.01	Time used: 0.06943
16.99/17.01	Improving Solution with cost 1 ...
16.99/17.01	
16.99/17.01	LOG: CALL solveNonLinearGetNextSolution
16.99/17.01	
16.99/17.01	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.059621s
16.99/17.01	Time used: 0.059612
16.99/17.01	
16.99/17.01	LOG: SAT solveNonLinear - Elapsed time: 0.134451s
16.99/17.01	Cost: 1; Total time: 0.129042
16.99/17.01	Failed at location 1: e^0 + n^0 <= __const_100^0
16.99/17.01	Before Improving: 
16.99/17.01	Quasi-invariant at l1: e^0 + n^0 <= __const_100^0
16.99/17.01	Quasi-invariant at l1: 1 <= e^0
16.99/17.01	Optimizing invariants...
16.99/17.01	
16.99/17.01	LOG: CALL solveLinear
16.99/17.01	
16.99/17.01	LOG: RETURN solveLinear - Elapsed time: 0.011293s
16.99/17.01	Remaining time after improvement: 0.997732
16.99/17.01	Non-termination implied by a set of quasi-invariant(s):
16.99/17.01	Quasi-invariant at l1: e^0 + n^0 <= __const_100^0
16.99/17.01	Quasi-invariant at l1: 1 <= e^0
16.99/17.01	
16.99/17.01	Strengthening and disabling EXIT transitions...
16.99/17.01	Closed exits from l1: 1
16.99/17.01	
16.99/17.01	Strengthening and disabling transitions...
16.99/17.01	
16.99/17.01	LOG: CALL solverLinear in Graph for feasibility
16.99/17.01	
16.99/17.01	LOG: RETURN solveLinear in Graph for feasibility
16.99/17.01	Strengthening transition (result): 
16.99/17.01	<l1, l1, 1 + __const_11^0 <= 0 /\ 1 <= e^0 /\ e^0 + n^0 <= __const_100^0 /\ n^0 <= __const_100^0, {e^0 -> 1 + e^0, n^0 -> __const_11^0 + n^0, rest remain the same}>
16.99/17.01	
16.99/17.01	LOG: CALL solverLinear in Graph for feasibility
16.99/17.01	
16.99/17.01	LOG: RETURN solveLinear in Graph for feasibility
16.99/17.01	It's unfeasible. Removing transition: 
16.99/17.01	<l1, l1, 1 + __const_100^0 <= n^0 /\ 1 + __const_11^0 <= 0 /\ 1 <= e^0, {e^0 -> -1 + e^0, n^0 -> -__const_10^0 + n^0, rest remain the same}>
16.99/17.01	
16.99/17.01	Calling reachability with...
16.99/17.01	Transition: <l1, end, true, {all remain the same}>
16.99/17.01	Conditions: 1 + __const_11^0 <= 0, e^0 + n^0 <= __const_100^0, 1 <= e^0, 
16.99/17.01	OPEN EXITS: 
16.99/17.01	<l1, end, 1 <= e^0 /\ e^0 + n^0 <= __const_100^0, {all remain the same}> (condsUp: 1 + __const_11^0 <= 0)
16.99/17.01	
16.99/17.01	--- Reachability graph ---
16.99/17.01	> Graph without transitions.
16.99/17.01	
16.99/17.01	Calling reachability with...
16.99/17.01	Transition: <l0, l1, n^0 = undef25 /\ e^0 = 1, {all remain the same}>
16.99/17.01	Conditions: 1 <= e^0, e^0 + n^0 <= __const_100^0, 1 + __const_11^0 <= 0, 
16.99/17.01	OPEN EXITS: 
16.99/17.01	<l0, l1, 1 + __const_11^0 <= 0 /\ e^0 + n^0 <= __const_100^0 /\ n^0 = undef25 /\ e^0 = 1, {all remain the same}>
16.99/17.01	
16.99/17.01	> Conditions are reachable!
16.99/17.01	
16.99/17.01	Program does NOT terminate
16.99/17.01	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
16.99/17.01	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
16.99/17.01	EOF