63.59/63.74	NO
63.59/63.74	
63.59/63.74	Solver Timeout: 4
63.59/63.74	Global Timeout: 300
63.59/63.74	No parsing errors!
63.59/63.74	Init Location: 0
63.59/63.74	Transitions:
63.59/63.74	<l0, l3, true>
63.59/63.74	<l1, l2, true, par{arg1 -> 0, arg2 -> 100}>
63.59/63.74	<l2, l2, (arg2 > arg1), par{arg1 -> (arg1 + 1), arg2 -> (arg2 + 1)}>
63.59/63.74	<l3, l1, true, par{arg1 -> undef5, arg2 -> undef6}>
63.59/63.74	
63.59/63.74	Fresh variables:
63.59/63.74	undef5, undef6, 
63.59/63.74	
63.59/63.74	Undef variables:
63.59/63.74	undef5, undef6, 
63.59/63.74	
63.59/63.74	Abstraction variables:
63.59/63.74	
63.59/63.74	Exit nodes:
63.59/63.74	
63.59/63.74	Accepting locations:
63.59/63.74	
63.59/63.74	Asserts:
63.59/63.74	
63.59/63.74	Preprocessed LLVMGraph
63.59/63.74	Init Location: 0
63.59/63.74	Transitions:
63.59/63.74	<l0, l2, (arg1 = 0) /\ (arg2 = 100)>
63.59/63.74	<l2, l2, (arg2 > arg1), par{arg1 -> (arg1 + 1), arg2 -> (arg2 + 1)}>
63.59/63.74	
63.59/63.74	Fresh variables:
63.59/63.74	undef5, undef6, 
63.59/63.74	
63.59/63.74	Undef variables:
63.59/63.74	undef5, undef6, 
63.59/63.74	
63.59/63.74	Abstraction variables:
63.59/63.74	
63.59/63.74	Exit nodes:
63.59/63.74	
63.59/63.74	Accepting locations:
63.59/63.74	
63.59/63.74	Asserts:
63.59/63.74	
63.59/63.74	*************************************************************
63.59/63.74	*******************************************************************************************
63.59/63.74	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
63.59/63.74	*******************************************************************************************
63.59/63.74	
63.59/63.74	Init Location: 0
63.59/63.74	Graph 0:
63.59/63.74	Transitions:
63.59/63.74	Variables:
63.59/63.74	
63.59/63.74	Graph 1:
63.59/63.74	Transitions:
63.59/63.74	<l2, l2, 1 + arg1 <= arg2, {arg1 -> 1 + arg1, arg2 -> 1 + arg2, rest remain the same}>
63.59/63.74	Variables:
63.59/63.74	arg1, arg2
63.59/63.74	
63.59/63.74	Precedence: 
63.59/63.74	Graph 0
63.59/63.74	
63.59/63.74	Graph 1
63.59/63.74	<l0, l2, arg1 = 0 /\ arg2 = 100, {all remain the same}>
63.59/63.74	
63.59/63.74	Map Locations to Subgraph:
63.59/63.74	( 0 , 0 )
63.59/63.74	( 2 , 1 )
63.59/63.74	
63.59/63.74	*******************************************************************************************
63.59/63.74	********************************    CHECKING ASSERTIONS    ********************************
63.59/63.74	*******************************************************************************************
63.59/63.74	
63.59/63.74	Proving termination of subgraph 0
63.59/63.74	Proving termination of subgraph 1
63.59/63.74	Checking unfeasibility...
63.59/63.74	Time used: 0.002288
63.59/63.74	
63.59/63.74	Checking conditional termination of SCC {l2}...
63.59/63.74	
63.59/63.74	LOG: CALL solveLinear
63.59/63.74	
63.59/63.74	LOG: RETURN solveLinear - Elapsed time: 0.000497s
63.59/63.74	
63.59/63.74	LOG: CALL solveLinear
63.59/63.74	
63.59/63.74	LOG: RETURN solveLinear - Elapsed time: 0.001526s
63.59/63.74	Trying to remove transition: <l2, l2, 1 + arg1 <= arg2, {arg1 -> 1 + arg1, arg2 -> 1 + arg2, rest remain the same}>
63.59/63.74	Solving with 1 template(s).
63.59/63.74	
63.59/63.74	LOG: CALL solveNonLinearGetFirstSolution
63.59/63.74	
63.59/63.74	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006498s
63.59/63.74	Time used: 0.006351
63.59/63.74	Solving with 1 template(s).
63.59/63.74	
63.59/63.74	LOG: CALL solveNonLinearGetFirstSolution
63.59/63.74	
63.59/63.74	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.000793s
63.59/63.74	Time used: 4.00047
63.59/63.74	Solving with 2 template(s).
63.59/63.74	
63.59/63.74	LOG: CALL solveNonLinearGetFirstSolution
63.59/63.74	
63.59/63.74	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.009762s
63.59/63.74	Time used: 4.00052
63.59/63.74	Solving with 3 template(s).
63.59/63.74	
63.59/63.74	LOG: CALL solveNonLinearGetFirstSolution
63.59/63.74	
63.59/63.74	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.011846s
63.59/63.74	Time used: 1.00047
63.59/63.74	Solving with 1 template(s).
63.59/63.74	
63.59/63.74	LOG: CALL solveNonLinearGetFirstSolution
63.59/63.74	
63.59/63.74	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.022794s
63.59/63.74	Time used: 0.007164
63.59/63.74	Improving Solution with cost 1 ...
63.59/63.74	
63.59/63.74	LOG: CALL solveNonLinearGetNextSolution
63.59/63.74	
63.59/63.74	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.015878s
63.59/63.74	Time used: 1.01592
63.59/63.74	
63.59/63.74	LOG: SAT solveNonLinear - Elapsed time: 1.038671s
63.59/63.74	Cost: 1; Total time: 1.02308
63.59/63.74	Termination implied by a set of invariant(s):
63.59/63.74	Invariant at l2: 0 <= 1 + arg1
63.59/63.74	[ Invariant Graph ]
63.59/63.74	Strengthening and disabling transitions...
63.59/63.74	
63.59/63.74	LOG: CALL solverLinear in Graph for feasibility
63.59/63.74	
63.59/63.74	LOG: RETURN solveLinear in Graph for feasibility
63.59/63.74	Strengthening transition (result): 
63.59/63.74	<l2, l2, 1 + arg1 <= arg2 /\ 0 <= 1 + arg1, {arg1 -> 1 + arg1, arg2 -> 1 + arg2, rest remain the same}>
63.59/63.74	[ Termination Graph ]
63.59/63.74	Strengthening and disabling transitions...
63.59/63.74	
63.59/63.74	LOG: CALL solverLinear in Graph for feasibility
63.59/63.74	
63.59/63.74	LOG: RETURN solveLinear in Graph for feasibility
63.59/63.74	Strengthening transition (result): 
63.59/63.74	<l2, l2, 1 + arg1 <= arg2 /\ 0 <= 1 + arg1, {arg1 -> 1 + arg1, arg2 -> 1 + arg2, rest remain the same}>
63.59/63.74	Quasi-ranking function: 50000 - 2*arg1 + arg2
63.59/63.74	New Graphs: 
63.59/63.74	Transitions:
63.59/63.74	<l2, l2, 1 + arg1 <= arg2 /\ 0 <= 1 + arg1 /\ 50001 + arg2 <= 2*arg1, {arg1 -> 1 + arg1, arg2 -> 1 + arg2, rest remain the same}>
63.59/63.74	Variables:
63.59/63.74	arg1, arg2
63.59/63.74	Checking conditional termination of SCC {l2}...
63.59/63.74	
63.59/63.74	LOG: CALL solveLinear
63.59/63.74	
63.59/63.74	LOG: RETURN solveLinear - Elapsed time: 0.000657s
63.59/63.74	
63.59/63.74	LOG: CALL solveLinear
63.59/63.74	
63.59/63.74	LOG: RETURN solveLinear - Elapsed time: 0.002991s
63.59/63.74	Trying to remove transition: <l2, l2, 1 + arg1 <= arg2 /\ 0 <= 1 + arg1 /\ 50001 + arg2 <= 2*arg1, {arg1 -> 1 + arg1, arg2 -> 1 + arg2, rest remain the same}>
63.59/63.74	Solving with 1 template(s).
63.59/63.74	
63.59/63.74	LOG: CALL solveNonLinearGetFirstSolution
63.59/63.74	
63.59/63.74	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007144s
63.59/63.74	Time used: 0.006984
63.59/63.74	Solving with 1 template(s).
63.59/63.74	
63.59/63.74	LOG: CALL solveNonLinearGetFirstSolution
63.59/63.74	
63.59/63.74	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.000937s
63.59/63.74	Time used: 4.0009
63.59/63.74	Solving with 2 template(s).
63.59/63.74	
63.59/63.74	LOG: CALL solveNonLinearGetFirstSolution
63.59/63.74	
63.59/63.74	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.010531s
63.59/63.74	Time used: 4.00085
63.59/63.74	Solving with 3 template(s).
63.59/63.74	
63.59/63.74	LOG: CALL solveNonLinearGetFirstSolution
63.59/63.74	
63.59/63.74	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.011778s
63.59/63.74	Time used: 1.00058
63.59/63.74	Solving with 1 template(s).
63.59/63.74	
63.59/63.74	LOG: CALL solveNonLinearGetFirstSolution
63.59/63.74	
63.59/63.74	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.024516s
63.59/63.74	Time used: 0.00914
63.59/63.74	Improving Solution with cost 1 ...
63.59/63.74	
63.59/63.74	LOG: CALL solveNonLinearGetNextSolution
63.59/63.74	
63.59/63.74	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.017774s
63.59/63.74	Time used: 1.01766
63.59/63.74	
63.59/63.74	LOG: SAT solveNonLinear - Elapsed time: 1.042290s
63.59/63.74	Cost: 1; Total time: 1.0268
63.59/63.74	Quasi-ranking function: 50000 - arg2
63.59/63.74	New Graphs: 
63.59/63.74	Transitions:
63.59/63.74	<l2, l2, 1 + arg1 <= arg2 /\ 0 <= 1 + arg1 /\ 50001 + arg2 <= 2*arg1 /\ 50001 <= arg2, {arg1 -> 1 + arg1, arg2 -> 1 + arg2, rest remain the same}>
63.59/63.74	Variables:
63.59/63.74	arg1, arg2
63.59/63.74	Checking conditional termination of SCC {l2}...
63.59/63.74	
63.59/63.74	LOG: CALL solveLinear
63.59/63.74	
63.59/63.74	LOG: RETURN solveLinear - Elapsed time: 0.000779s
63.59/63.74	
63.59/63.74	LOG: CALL solveLinear
63.59/63.74	
63.59/63.74	LOG: RETURN solveLinear - Elapsed time: 0.003262s
63.59/63.74	Trying to remove transition: <l2, l2, 1 + arg1 <= arg2 /\ 0 <= 1 + arg1 /\ 50001 + arg2 <= 2*arg1 /\ 50001 <= arg2, {arg1 -> 1 + arg1, arg2 -> 1 + arg2, rest remain the same}>
63.59/63.74	Solving with 1 template(s).
63.59/63.74	
63.59/63.74	LOG: CALL solveNonLinearGetFirstSolution
63.59/63.74	
63.59/63.74	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008127s
63.59/63.74	Time used: 0.007966
63.59/63.74	Solving with 1 template(s).
63.59/63.74	
63.59/63.74	LOG: CALL solveNonLinearGetFirstSolution
63.59/63.74	
63.59/63.74	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001598s
63.59/63.74	Time used: 4.00123
63.59/63.74	Solving with 2 template(s).
63.59/63.74	
63.59/63.74	LOG: CALL solveNonLinearGetFirstSolution
63.59/63.74	
63.59/63.74	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.011769s
63.59/63.74	Time used: 4.00204
63.59/63.74	Solving with 3 template(s).
63.59/63.74	
63.59/63.74	LOG: CALL solveNonLinearGetFirstSolution
63.59/63.74	
63.59/63.74	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.011756s
63.59/63.74	Time used: 1.00061
63.59/63.74	Solving with 1 template(s).
63.59/63.74	
63.59/63.74	LOG: CALL solveNonLinearGetFirstSolution
63.59/63.74	
63.59/63.74	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.024370s
63.59/63.74	Time used: 0.008879
63.59/63.74	Improving Solution with cost 1 ...
63.59/63.74	
63.59/63.74	LOG: CALL solveNonLinearGetNextSolution
63.59/63.74	
63.59/63.74	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001931s
63.59/63.74	Time used: 1.00141
63.59/63.74	
63.59/63.74	LOG: SAT solveNonLinear - Elapsed time: 1.026301s
63.59/63.74	Cost: 1; Total time: 1.01029
63.59/63.74	Quasi-ranking function: 50000 - arg1
63.59/63.74	New Graphs: 
63.59/63.74	Transitions:
63.59/63.74	<l2, l2, 1 + arg1 <= arg2 /\ 50001 <= arg1 /\ 50001 + arg2 <= 2*arg1 /\ 50001 <= arg2, {arg1 -> 1 + arg1, arg2 -> 1 + arg2, rest remain the same}>
63.59/63.74	Variables:
63.59/63.74	arg1, arg2
63.59/63.74	Checking conditional termination of SCC {l2}...
63.59/63.74	
63.59/63.74	LOG: CALL solveLinear
63.59/63.74	
63.59/63.74	LOG: RETURN solveLinear - Elapsed time: 0.000781s
63.59/63.74	
63.59/63.74	LOG: CALL solveLinear
63.59/63.74	
63.59/63.74	LOG: RETURN solveLinear - Elapsed time: 0.002983s
63.59/63.74	Trying to remove transition: <l2, l2, 1 + arg1 <= arg2 /\ 50001 <= arg1 /\ 50001 + arg2 <= 2*arg1 /\ 50001 <= arg2, {arg1 -> 1 + arg1, arg2 -> 1 + arg2, rest remain the same}>
63.59/63.74	Solving with 1 template(s).
63.59/63.74	
63.59/63.74	LOG: CALL solveNonLinearGetFirstSolution
63.59/63.74	
63.59/63.74	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007490s
63.59/63.74	Time used: 0.007329
63.59/63.74	Solving with 1 template(s).
63.59/63.74	
63.59/63.74	LOG: CALL solveNonLinearGetFirstSolution
63.59/63.74	
63.59/63.74	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001178s
63.59/63.74	Time used: 4.00117
63.59/63.74	Solving with 2 template(s).
63.59/63.74	
63.59/63.74	LOG: CALL solveNonLinearGetFirstSolution
63.59/63.74	
63.59/63.74	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.012068s
63.59/63.74	Time used: 4.00174
63.59/63.74	Solving with 3 template(s).
63.59/63.74	
63.59/63.74	LOG: CALL solveNonLinearGetFirstSolution
63.59/63.74	
63.59/63.74	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.012249s
63.59/63.74	Time used: 1.00101
63.59/63.74	Solving with 1 template(s).
63.59/63.74	
63.59/63.74	LOG: CALL solveNonLinearGetFirstSolution
63.59/63.74	
63.59/63.74	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.027135s
63.59/63.74	Time used: 0.011762
63.59/63.74	Improving Solution with cost 1 ...
63.59/63.74	
63.59/63.74	LOG: CALL solveNonLinearGetNextSolution
63.59/63.74	
63.59/63.74	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.002096s
63.59/63.74	Time used: 1.00143
63.59/63.74	
63.59/63.74	LOG: SAT solveNonLinear - Elapsed time: 1.029231s
63.59/63.74	Cost: 1; Total time: 1.01319
63.59/63.74	Termination implied by a set of invariant(s):
63.59/63.74	Invariant at l2: 0 <= arg1
63.59/63.74	[ Invariant Graph ]
63.59/63.74	Strengthening and disabling transitions...
63.59/63.74	
63.59/63.74	LOG: CALL solverLinear in Graph for feasibility
63.59/63.74	
63.59/63.74	LOG: RETURN solveLinear in Graph for feasibility
63.59/63.74	Strengthening transition (result): 
63.59/63.74	<l2, l2, 0 <= arg1 /\ 1 + arg1 <= arg2, {arg1 -> 1 + arg1, arg2 -> 1 + arg2, rest remain the same}>
63.59/63.74	[ Termination Graph ]
63.59/63.74	Strengthening and disabling transitions...
63.59/63.74	
63.59/63.74	LOG: CALL solverLinear in Graph for feasibility
63.59/63.74	
63.59/63.74	LOG: RETURN solveLinear in Graph for feasibility
63.59/63.74	Strengthening transition (result): 
63.59/63.74	<l2, l2, 1 + arg1 <= arg2 /\ 50001 <= arg1 /\ 50001 + arg2 <= 2*arg1 /\ 50001 <= arg2, {arg1 -> 1 + arg1, arg2 -> 1 + arg2, rest remain the same}>
63.59/63.74	Quasi-ranking function: 50000 + arg1 - 2*arg2
63.59/63.74	New Graphs: 
63.59/63.74	Transitions:
63.59/63.74	<l2, l2, 1 + arg1 <= arg2 /\ 50001 + arg1 <= 2*arg2 /\ 50001 <= arg1 /\ 50001 + arg2 <= 2*arg1 /\ 50001 <= arg2, {arg1 -> 1 + arg1, arg2 -> 1 + arg2, rest remain the same}>
63.59/63.74	Variables:
63.59/63.74	arg1, arg2
63.59/63.74	Checking conditional termination of SCC {l2}...
63.59/63.74	
63.59/63.74	LOG: CALL solveLinear
63.59/63.74	
63.59/63.74	LOG: RETURN solveLinear - Elapsed time: 0.000884s
63.59/63.74	
63.59/63.74	LOG: CALL solveLinear
63.59/63.74	
63.59/63.74	LOG: RETURN solveLinear - Elapsed time: 0.003697s
63.59/63.74	Trying to remove transition: <l2, l2, 1 + arg1 <= arg2 /\ 50001 + arg1 <= 2*arg2 /\ 50001 <= arg1 /\ 50001 + arg2 <= 2*arg1 /\ 50001 <= arg2, {arg1 -> 1 + arg1, arg2 -> 1 + arg2, rest remain the same}>
63.59/63.74	Solving with 1 template(s).
63.59/63.74	
63.59/63.74	LOG: CALL solveNonLinearGetFirstSolution
63.59/63.74	
63.59/63.74	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009712s
63.59/63.74	Time used: 0.009538
63.59/63.74	Solving with 1 template(s).
63.59/63.74	
63.59/63.74	LOG: CALL solveNonLinearGetFirstSolution
63.59/63.74	
63.59/63.74	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001640s
63.59/63.74	Time used: 4.00131
63.59/63.74	Solving with 2 template(s).
63.59/63.74	
63.59/63.74	LOG: CALL solveNonLinearGetFirstSolution
63.59/63.74	
63.59/63.74	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.011786s
63.59/63.74	Time used: 4.00159
63.59/63.74	Solving with 3 template(s).
63.59/63.74	
63.59/63.74	LOG: CALL solveNonLinearGetFirstSolution
63.59/63.74	
63.59/63.74	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.012566s
63.59/63.74	Time used: 1.00114
63.59/63.74	Solving with 1 template(s).
63.59/63.74	
63.59/63.74	LOG: CALL solveNonLinearGetFirstSolution
63.59/63.74	
63.59/63.74	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.028398s
63.59/63.74	Time used: 0.011522
63.59/63.74	Improving Solution with cost 1 ...
63.59/63.74	
63.59/63.74	LOG: CALL solveNonLinearGetNextSolution
63.59/63.74	
63.59/63.74	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.021938s
63.59/63.74	Time used: 1.02195
63.59/63.74	
63.59/63.74	LOG: SAT solveNonLinear - Elapsed time: 1.050336s
63.59/63.74	Cost: 1; Total time: 1.03347
63.59/63.74	Termination implied by a set of invariant(s):
63.59/63.74	Invariant at l2: 1 <= arg2
63.59/63.74	[ Invariant Graph ]
63.59/63.74	Strengthening and disabling transitions...
63.59/63.74	
63.59/63.74	LOG: CALL solverLinear in Graph for feasibility
63.59/63.74	
63.59/63.74	LOG: RETURN solveLinear in Graph for feasibility
63.59/63.74	Strengthening transition (result): 
63.59/63.74	<l2, l2, 0 <= arg1 /\ 1 + arg1 <= arg2 /\ 1 <= arg2, {arg1 -> 1 + arg1, arg2 -> 1 + arg2, rest remain the same}>
63.59/63.74	[ Termination Graph ]
63.59/63.74	Strengthening and disabling transitions...
63.59/63.74	
63.59/63.74	LOG: CALL solverLinear in Graph for feasibility
63.59/63.74	
63.59/63.74	LOG: RETURN solveLinear in Graph for feasibility
63.59/63.74	Strengthening transition (result): 
63.59/63.74	<l2, l2, 1 + arg1 <= arg2 /\ 50001 + arg1 <= 2*arg2 /\ 50001 <= arg1 /\ 50001 + arg2 <= 2*arg1 /\ 50001 <= arg2, {arg1 -> 1 + arg1, arg2 -> 1 + arg2, rest remain the same}>
63.59/63.74	Quasi-ranking function: 50000 - arg1 - arg2
63.59/63.74	New Graphs: 
63.59/63.74	Transitions:
63.59/63.74	<l2, l2, 1 + arg1 <= arg2 /\ 50001 + arg1 <= 2*arg2 /\ 50001 <= arg1 /\ 50001 <= arg1 + arg2 /\ 50001 + arg2 <= 2*arg1 /\ 50001 <= arg2, {arg1 -> 1 + arg1, arg2 -> 1 + arg2, rest remain the same}>
63.59/63.74	Variables:
63.59/63.74	arg1, arg2
63.59/63.74	Checking conditional termination of SCC {l2}...
63.59/63.74	
63.59/63.74	LOG: CALL solveLinear
63.59/63.74	
63.59/63.74	LOG: RETURN solveLinear - Elapsed time: 0.000986s
63.59/63.74	
63.59/63.74	LOG: CALL solveLinear
63.59/63.74	
63.59/63.74	LOG: RETURN solveLinear - Elapsed time: 0.004584s
63.59/63.74	Trying to remove transition: <l2, l2, 1 + arg1 <= arg2 /\ 50001 + arg1 <= 2*arg2 /\ 50001 <= arg1 /\ 50001 <= arg1 + arg2 /\ 50001 + arg2 <= 2*arg1 /\ 50001 <= arg2, {arg1 -> 1 + arg1, arg2 -> 1 + arg2, rest remain the same}>
63.59/63.74	Solving with 1 template(s).
63.59/63.74	
63.59/63.74	LOG: CALL solveNonLinearGetFirstSolution
63.59/63.74	
63.59/63.74	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010084s
63.59/63.74	Time used: 0.009911
63.59/63.74	Solving with 1 template(s).
63.59/63.74	
63.59/63.74	LOG: CALL solveNonLinearGetFirstSolution
63.59/63.74	
63.59/63.74	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001803s
63.59/63.74	Time used: 4.0014
63.59/63.74	Solving with 2 template(s).
63.59/63.74	
63.59/63.74	LOG: CALL solveNonLinearGetFirstSolution
63.59/63.74	
63.59/63.74	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.012182s
63.59/63.74	Time used: 4.00177
63.59/63.74	Solving with 3 template(s).
63.59/63.74	
63.59/63.74	LOG: CALL solveNonLinearGetFirstSolution
63.59/63.74	
63.59/63.74	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.013145s
63.59/63.74	Time used: 1.00139
63.59/63.74	Solving with 1 template(s).
63.59/63.74	
63.59/63.74	LOG: CALL solveNonLinearGetFirstSolution
63.59/63.74	
63.59/63.74	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.017858s
63.59/63.74	Time used: 4.00191
63.59/63.74	Termination failed. Trying to show unreachability...
63.59/63.74	Proving unreachability of entry: <l0, l2, arg1 = 0 /\ arg2 = 100, {all remain the same}>
63.59/63.74	
63.59/63.74	LOG: CALL check - Post:1 <= 0 - Process 1
63.59/63.74	* Exit transition: <l0, l2, arg1 = 0 /\ arg2 = 100, {all remain the same}>
63.59/63.74	* Postcondition  : 1 <= 0
63.59/63.74	
63.59/63.74	LOG: CALL solveLinear
63.59/63.74	
63.59/63.74	LOG: RETURN solveLinear - Elapsed time: 0.011475s
63.59/63.74	> Postcondition is not implied!
63.59/63.74	
63.59/63.74	LOG: RETURN check - Elapsed time: 0.011594s
63.59/63.74	Cannot prove unreachability
63.59/63.74	
63.59/63.74	Proving non-termination of subgraph 1
63.59/63.74	Transitions:
63.59/63.74	<l2, l2, 1 + arg1 <= arg2, {arg1 -> 1 + arg1, arg2 -> 1 + arg2, rest remain the same}>
63.59/63.74	Variables:
63.59/63.74	arg1, arg2
63.59/63.74	
63.59/63.74	Checking conditional non-termination of SCC {l2}...
63.59/63.74	EXIT TRANSITIONS:
63.59/63.74	<l2, end, arg2 <= arg1, {all remain the same}>
63.59/63.74	
63.59/63.74	Solving with 1 template(s).
63.59/63.74	
63.59/63.74	LOG: CALL solveNonLinearGetFirstSolution
63.59/63.74	
63.59/63.74	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006287s
63.59/63.74	Time used: 0.006185
63.59/63.74	
63.59/63.74	LOG: SAT solveNonLinear - Elapsed time: 0.006287s
63.59/63.74	Cost: 0; Total time: 0.006185
63.59/63.74	Non-termination implied by a set of quasi-invariant(s):
63.59/63.74	Quasi-invariant at l2: 1 + arg1 <= arg2
63.59/63.74	
63.59/63.74	Strengthening and disabling EXIT transitions...
63.59/63.74	Closed exits from l2: 1
63.59/63.74	
63.59/63.74	Strengthening and disabling transitions...
63.59/63.74	
63.59/63.74	LOG: CALL solverLinear in Graph for feasibility
63.59/63.74	
63.59/63.74	LOG: RETURN solveLinear in Graph for feasibility
63.59/63.74	Strengthening transition (result): 
63.59/63.74	<l2, l2, 1 + arg1 <= arg2, {arg1 -> 1 + arg1, arg2 -> 1 + arg2, rest remain the same}>
63.59/63.74	
63.59/63.74	Calling reachability with...
63.59/63.74	Transition: <l2, end, true, {all remain the same}>
63.59/63.74	Conditions: 1 + arg1 <= arg2, 
63.59/63.74	OPEN EXITS: 
63.59/63.74	<l2, end, 1 + arg1 <= arg2, {all remain the same}>
63.59/63.74	
63.59/63.74	--- Reachability graph ---
63.59/63.74	> Graph without transitions.
63.59/63.74	
63.59/63.74	Calling reachability with...
63.59/63.74	Transition: <l0, l2, arg1 = 0 /\ arg2 = 100, {all remain the same}>
63.59/63.74	Conditions: 1 + arg1 <= arg2, 
63.59/63.74	OPEN EXITS: 
63.59/63.74	<l0, l2, 1 + arg1 <= arg2 /\ arg1 = 0 /\ arg2 = 100, {all remain the same}>
63.59/63.74	
63.59/63.74	> Conditions are reachable!
63.59/63.74	
63.59/63.74	Program does NOT terminate
63.59/63.74	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
63.59/63.74	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
63.59/63.74	EOF