54.63/54.80	NO
54.63/54.80	
54.63/54.81	Solver Timeout: 4
54.63/54.81	Global Timeout: 300
54.63/54.81	No parsing errors!
54.63/54.81	Init Location: 0
54.63/54.81	Transitions:
54.63/54.81	<l0, l3, true>
54.63/54.81	<l1, l2, true, par{arg1 -> 0, arg2 -> 0}>
54.63/54.81	<l2, l2, (arg2 > ~(1)) /\ (arg1 > ~(1)) /\ (arg2 >= arg1) /\ ((arg2 - arg1) >= 1), par{arg1 -> (arg1 + 1)}>
54.63/54.81	<l2, l2, (arg1 > ~(1)) /\ ((arg2 - arg1) = 0) /\ (arg2 > ~(1)) /\ (arg2 >= arg1), par{arg1 -> (arg1 + 1), arg2 -> (arg2 + 2)}>
54.63/54.81	<l3, l1, true, par{arg1 -> undef7, arg2 -> undef8}>
54.63/54.81	
54.63/54.81	Fresh variables:
54.63/54.81	undef7, undef8, 
54.63/54.81	
54.63/54.81	Undef variables:
54.63/54.81	undef7, undef8, 
54.63/54.81	
54.63/54.81	Abstraction variables:
54.63/54.81	
54.63/54.81	Exit nodes:
54.63/54.81	
54.63/54.81	Accepting locations:
54.63/54.81	
54.63/54.81	Asserts:
54.63/54.81	
54.63/54.81	Preprocessed LLVMGraph
54.63/54.81	Init Location: 0
54.63/54.81	Transitions:
54.63/54.81	<l0, l2, (arg1 = 0) /\ (arg2 = 0)>
54.63/54.81	<l2, l2, (arg2 > ~(1)) /\ (arg1 > ~(1)) /\ (arg2 >= arg1) /\ ((arg2 - arg1) >= 1), par{arg1 -> (arg1 + 1)}>
54.63/54.81	<l2, l2, (arg1 > ~(1)) /\ ((arg2 - arg1) = 0) /\ (arg2 > ~(1)) /\ (arg2 >= arg1), par{arg1 -> (arg1 + 1), arg2 -> (arg2 + 2)}>
54.63/54.81	
54.63/54.81	Fresh variables:
54.63/54.81	undef7, undef8, 
54.63/54.81	
54.63/54.81	Undef variables:
54.63/54.81	undef7, undef8, 
54.63/54.81	
54.63/54.81	Abstraction variables:
54.63/54.81	
54.63/54.81	Exit nodes:
54.63/54.81	
54.63/54.81	Accepting locations:
54.63/54.81	
54.63/54.81	Asserts:
54.63/54.81	
54.63/54.81	*************************************************************
54.63/54.81	*******************************************************************************************
54.63/54.81	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
54.63/54.81	*******************************************************************************************
54.63/54.81	
54.63/54.81	Init Location: 0
54.63/54.81	Graph 0:
54.63/54.81	Transitions:
54.63/54.81	Variables:
54.63/54.81	
54.63/54.81	Graph 1:
54.63/54.81	Transitions:
54.63/54.81	<l2, l2, 0 <= arg1 /\ 0 <= arg2 /\ 1 + arg1 <= arg2, {arg1 -> 1 + arg1, rest remain the same}>
54.63/54.81	<l2, l2, 0 <= arg1 /\ 0 <= arg2 /\ arg1 = arg2, {arg1 -> 1 + arg1, arg2 -> 2 + arg2, rest remain the same}>
54.63/54.81	Variables:
54.63/54.81	arg1, arg2
54.63/54.81	
54.63/54.81	Precedence: 
54.63/54.81	Graph 0
54.63/54.81	
54.63/54.81	Graph 1
54.63/54.81	<l0, l2, arg1 = 0 /\ arg2 = 0, {all remain the same}>
54.63/54.81	
54.63/54.81	Map Locations to Subgraph:
54.63/54.81	( 0 , 0 )
54.63/54.81	( 2 , 1 )
54.63/54.81	
54.63/54.81	*******************************************************************************************
54.63/54.81	********************************    CHECKING ASSERTIONS    ********************************
54.63/54.81	*******************************************************************************************
54.63/54.81	
54.63/54.81	Proving termination of subgraph 0
54.63/54.81	Proving termination of subgraph 1
54.63/54.81	Checking unfeasibility...
54.63/54.81	Time used: 0.012229
54.63/54.81	
54.63/54.81	Checking conditional termination of SCC {l2}...
54.63/54.81	
54.63/54.81	LOG: CALL solveLinear
54.63/54.81	
54.63/54.81	LOG: RETURN solveLinear - Elapsed time: 0.001201s
54.63/54.81	
54.63/54.81	LOG: CALL solveLinear
54.63/54.81	
54.63/54.81	LOG: RETURN solveLinear - Elapsed time: 0.007859s
54.63/54.81	Trying to remove transition: <l2, l2, 0 <= arg1 /\ 0 <= arg2 /\ arg1 = arg2, {arg1 -> 1 + arg1, arg2 -> 2 + arg2, rest remain the same}>
54.63/54.81	Solving with 1 template(s).
54.63/54.81	
54.63/54.81	LOG: CALL solveNonLinearGetFirstSolution
54.63/54.81	
54.63/54.81	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.053304s
54.63/54.81	Time used: 0.053049
54.63/54.81	Trying to remove transition: <l2, l2, 0 <= arg1 /\ 0 <= arg2 /\ 1 + arg1 <= arg2, {arg1 -> 1 + arg1, rest remain the same}>
54.63/54.81	Solving with 1 template(s).
54.63/54.81	
54.63/54.81	LOG: CALL solveNonLinearGetFirstSolution
54.63/54.81	
54.63/54.81	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.049591s
54.63/54.81	Time used: 0.048917
54.63/54.81	Solving with 1 template(s).
54.63/54.81	
54.63/54.81	LOG: CALL solveNonLinearGetFirstSolution
54.63/54.81	
54.63/54.81	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001831s
54.63/54.81	Time used: 4.00053
54.63/54.81	Solving with 2 template(s).
54.63/54.81	
54.63/54.81	LOG: CALL solveNonLinearGetFirstSolution
54.63/54.81	
54.63/54.81	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.022399s
54.63/54.81	Time used: 4.00068
54.63/54.81	Solving with 3 template(s).
54.63/54.81	
54.63/54.81	LOG: CALL solveNonLinearGetFirstSolution
54.63/54.81	
54.63/54.81	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.013704s
54.63/54.81	Time used: 1.00077
54.63/54.81	Solving with 1 template(s).
54.63/54.81	
54.63/54.81	LOG: CALL solveNonLinearGetFirstSolution
54.63/54.81	
54.63/54.81	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.037290s
54.63/54.81	Time used: 0.026509
54.63/54.81	Improving Solution with cost 1 ...
54.63/54.81	
54.63/54.81	LOG: CALL solveNonLinearGetNextSolution
54.63/54.81	
54.63/54.81	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000689s
54.63/54.81	Time used: 1.0006
54.63/54.81	
54.63/54.81	LOG: SAT solveNonLinear - Elapsed time: 1.037979s
54.63/54.81	Cost: 1; Total time: 1.02711
54.63/54.81	Quasi-ranking function: 50000 - 2*arg1 + arg2
54.63/54.81	New Graphs: 
54.63/54.81	Transitions:
54.63/54.81	<l2, l2, 0 <= arg1 /\ 0 <= arg2 /\ 1 + arg1 <= arg2 /\ 50001 + arg2 <= 2*arg1, {arg1 -> 1 + arg1, rest remain the same}>
54.63/54.81	<l2, l2, 0 <= arg1 /\ 0 <= arg2 /\ arg1 = arg2, {arg1 -> 1 + arg1, arg2 -> 2 + arg2, rest remain the same}>
54.63/54.81	Variables:
54.63/54.81	arg1, arg2
54.63/54.81	Checking conditional termination of SCC {l2}...
54.63/54.81	
54.63/54.81	LOG: CALL solveLinear
54.63/54.81	
54.63/54.81	LOG: RETURN solveLinear - Elapsed time: 0.001104s
54.63/54.81	
54.63/54.81	LOG: CALL solveLinear
54.63/54.81	
54.63/54.81	LOG: RETURN solveLinear - Elapsed time: 0.012261s
54.63/54.81	Trying to remove transition: <l2, l2, 0 <= arg1 /\ 0 <= arg2 /\ arg1 = arg2, {arg1 -> 1 + arg1, arg2 -> 2 + arg2, rest remain the same}>
54.63/54.81	Solving with 1 template(s).
54.63/54.81	
54.63/54.81	LOG: CALL solveNonLinearGetFirstSolution
54.63/54.81	
54.63/54.81	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.072804s
54.63/54.81	Time used: 0.072588
54.63/54.81	Trying to remove transition: <l2, l2, 0 <= arg1 /\ 0 <= arg2 /\ 1 + arg1 <= arg2 /\ 50001 + arg2 <= 2*arg1, {arg1 -> 1 + arg1, rest remain the same}>
54.63/54.81	Solving with 1 template(s).
54.63/54.81	
54.63/54.81	LOG: CALL solveNonLinearGetFirstSolution
54.63/54.81	
54.63/54.81	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.103103s
54.63/54.81	Time used: 0.102383
54.63/54.81	Solving with 1 template(s).
54.63/54.81	
54.63/54.81	LOG: CALL solveNonLinearGetFirstSolution
54.63/54.81	
54.63/54.81	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002408s
54.63/54.81	Time used: 4.00095
54.63/54.81	Solving with 2 template(s).
54.63/54.81	
54.63/54.81	LOG: CALL solveNonLinearGetFirstSolution
54.63/54.81	
54.63/54.81	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.020380s
54.63/54.81	Time used: 4.00066
54.63/54.81	Solving with 3 template(s).
54.63/54.81	
54.63/54.81	LOG: CALL solveNonLinearGetFirstSolution
54.63/54.81	
54.63/54.81	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.012192s
54.63/54.81	Time used: 1.00068
54.63/54.81	Solving with 1 template(s).
54.63/54.81	
54.63/54.81	LOG: CALL solveNonLinearGetFirstSolution
54.63/54.81	
54.63/54.81	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.035599s
54.63/54.81	Time used: 0.024561
54.63/54.81	Improving Solution with cost 1 ...
54.63/54.81	
54.63/54.81	LOG: CALL solveNonLinearGetNextSolution
54.63/54.81	
54.63/54.81	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000866s
54.63/54.81	Time used: 1.00079
54.63/54.81	
54.63/54.81	LOG: SAT solveNonLinear - Elapsed time: 1.036464s
54.63/54.81	Cost: 1; Total time: 1.02535
54.63/54.81	Termination implied by a set of invariant(s):
54.63/54.81	Invariant at l2: arg1 <= arg2
54.63/54.81	[ Invariant Graph ]
54.63/54.81	Strengthening and disabling transitions...
54.63/54.81	
54.63/54.81	LOG: CALL solverLinear in Graph for feasibility
54.63/54.81	
54.63/54.81	LOG: RETURN solveLinear in Graph for feasibility
54.63/54.81	Strengthening transition (result): 
54.63/54.81	<l2, l2, 0 <= arg1 /\ 0 <= arg2 /\ 1 + arg1 <= arg2, {arg1 -> 1 + arg1, rest remain the same}>
54.63/54.81	
54.63/54.81	LOG: CALL solverLinear in Graph for feasibility
54.63/54.81	
54.63/54.81	LOG: RETURN solveLinear in Graph for feasibility
54.63/54.81	Strengthening transition (result): 
54.63/54.81	<l2, l2, 0 <= arg1 /\ 0 <= arg2 /\ arg1 = arg2, {arg1 -> 1 + arg1, arg2 -> 2 + arg2, rest remain the same}>
54.63/54.81	[ Termination Graph ]
54.63/54.81	Strengthening and disabling transitions...
54.63/54.81	
54.63/54.81	LOG: CALL solverLinear in Graph for feasibility
54.63/54.81	
54.63/54.81	LOG: RETURN solveLinear in Graph for feasibility
54.63/54.81	Strengthening transition (result): 
54.63/54.81	<l2, l2, 0 <= arg1 /\ 0 <= arg2 /\ 1 + arg1 <= arg2 /\ 50001 + arg2 <= 2*arg1, {arg1 -> 1 + arg1, rest remain the same}>
54.63/54.81	
54.63/54.81	LOG: CALL solverLinear in Graph for feasibility
54.63/54.81	
54.63/54.81	LOG: RETURN solveLinear in Graph for feasibility
54.63/54.81	Strengthening transition (result): 
54.63/54.81	<l2, l2, 0 <= arg1 /\ 0 <= arg2 /\ arg1 = arg2, {arg1 -> 1 + arg1, arg2 -> 2 + arg2, rest remain the same}>
54.63/54.81	Quasi-ranking function: 50000 - arg1
54.63/54.81	New Graphs: 
54.63/54.81	Transitions:
54.63/54.81	<l2, l2, 0 <= arg2 /\ 1 + arg1 <= arg2 /\ 50001 <= arg1 /\ 50001 + arg2 <= 2*arg1, {arg1 -> 1 + arg1, rest remain the same}>
54.63/54.81	<l2, l2, 0 <= arg2 /\ 50001 <= arg1 /\ arg1 = arg2, {arg1 -> 1 + arg1, arg2 -> 2 + arg2, rest remain the same}>
54.63/54.81	Variables:
54.63/54.81	arg1, arg2
54.63/54.81	Checking conditional termination of SCC {l2}...
54.63/54.81	
54.63/54.81	LOG: CALL solveLinear
54.63/54.81	
54.63/54.81	LOG: RETURN solveLinear - Elapsed time: 0.001200s
54.63/54.81	
54.63/54.81	LOG: CALL solveLinear
54.63/54.81	
54.63/54.81	LOG: RETURN solveLinear - Elapsed time: 0.029791s
54.63/54.81	Trying to remove transition: <l2, l2, 0 <= arg2 /\ 50001 <= arg1 /\ arg1 = arg2, {arg1 -> 1 + arg1, arg2 -> 2 + arg2, rest remain the same}>
54.63/54.81	Solving with 1 template(s).
54.63/54.81	
54.63/54.81	LOG: CALL solveNonLinearGetFirstSolution
54.63/54.81	
54.63/54.81	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.090986s
54.63/54.81	Time used: 0.090678
54.63/54.81	Trying to remove transition: <l2, l2, 0 <= arg2 /\ 1 + arg1 <= arg2 /\ 50001 <= arg1 /\ 50001 + arg2 <= 2*arg1, {arg1 -> 1 + arg1, rest remain the same}>
54.63/54.81	Solving with 1 template(s).
54.63/54.81	
54.63/54.81	LOG: CALL solveNonLinearGetFirstSolution
54.63/54.81	
54.63/54.81	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.132942s
54.63/54.81	Time used: 0.132201
54.63/54.81	Solving with 1 template(s).
54.63/54.81	
54.63/54.81	LOG: CALL solveNonLinearGetFirstSolution
54.63/54.81	
54.63/54.81	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002468s
54.63/54.81	Time used: 4.00125
54.63/54.81	Solving with 2 template(s).
54.63/54.81	
54.63/54.81	LOG: CALL solveNonLinearGetFirstSolution
54.63/54.81	
54.63/54.81	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.018772s
54.63/54.81	Time used: 4.00091
54.63/54.81	Solving with 3 template(s).
54.63/54.81	
54.63/54.81	LOG: CALL solveNonLinearGetFirstSolution
54.63/54.81	
54.63/54.81	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.011245s
54.63/54.81	Time used: 1.00065
54.63/54.81	Solving with 1 template(s).
54.63/54.81	
54.63/54.81	LOG: CALL solveNonLinearGetFirstSolution
54.63/54.81	
54.63/54.81	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.042972s
54.63/54.81	Time used: 0.031857
54.63/54.81	Improving Solution with cost 1 ...
54.63/54.81	
54.63/54.81	LOG: CALL solveNonLinearGetNextSolution
54.63/54.81	
54.63/54.81	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000877s
54.63/54.81	Time used: 1.0008
54.63/54.81	
54.63/54.81	LOG: SAT solveNonLinear - Elapsed time: 1.043848s
54.63/54.81	Cost: 1; Total time: 1.03265
54.63/54.81	Quasi-ranking function: 50000 - arg2
54.63/54.81	New Graphs: 
54.63/54.81	Transitions:
54.63/54.81	<l2, l2, 0 <= arg2 /\ 1 + arg1 <= arg2 /\ 50001 <= arg1 /\ 50001 + arg2 <= 2*arg1, {arg1 -> 1 + arg1, rest remain the same}>
54.63/54.81	<l2, l2, 50001 <= arg1 /\ 50001 <= arg2 /\ arg1 = arg2, {arg1 -> 1 + arg1, arg2 -> 2 + arg2, rest remain the same}>
54.63/54.81	Variables:
54.63/54.81	arg1, arg2
54.63/54.81	Checking conditional termination of SCC {l2}...
54.63/54.81	
54.63/54.81	LOG: CALL solveLinear
54.63/54.81	
54.63/54.81	LOG: RETURN solveLinear - Elapsed time: 0.001224s
54.63/54.81	
54.63/54.81	LOG: CALL solveLinear
54.63/54.81	
54.63/54.81	LOG: RETURN solveLinear - Elapsed time: 0.018457s
54.63/54.81	Trying to remove transition: <l2, l2, 50001 <= arg1 /\ 50001 <= arg2 /\ arg1 = arg2, {arg1 -> 1 + arg1, arg2 -> 2 + arg2, rest remain the same}>
54.63/54.81	Solving with 1 template(s).
54.63/54.81	
54.63/54.81	LOG: CALL solveNonLinearGetFirstSolution
54.63/54.81	
54.63/54.81	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.092992s
54.63/54.81	Time used: 0.092763
54.63/54.81	Trying to remove transition: <l2, l2, 0 <= arg2 /\ 1 + arg1 <= arg2 /\ 50001 <= arg1 /\ 50001 + arg2 <= 2*arg1, {arg1 -> 1 + arg1, rest remain the same}>
54.63/54.81	Solving with 1 template(s).
54.63/54.81	
54.63/54.81	LOG: CALL solveNonLinearGetFirstSolution
54.63/54.81	
54.63/54.81	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.133289s
54.63/54.81	Time used: 0.132582
54.63/54.81	Solving with 1 template(s).
54.63/54.81	
54.63/54.81	LOG: CALL solveNonLinearGetFirstSolution
54.63/54.81	
54.63/54.81	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002492s
54.63/54.81	Time used: 4.00131
54.63/54.81	Solving with 2 template(s).
54.63/54.81	
54.63/54.81	LOG: CALL solveNonLinearGetFirstSolution
54.63/54.81	
54.63/54.81	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.023172s
54.63/54.81	Time used: 4.00302
54.63/54.81	Solving with 3 template(s).
54.63/54.81	
54.63/54.81	LOG: CALL solveNonLinearGetFirstSolution
54.63/54.81	
54.63/54.81	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.007499s
54.63/54.81	Time used: 1.00099
54.63/54.81	Solving with 1 template(s).
54.63/54.81	
54.63/54.81	LOG: CALL solveNonLinearGetFirstSolution
54.63/54.81	
54.63/54.81	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.044017s
54.63/54.81	Time used: 0.0326
54.63/54.81	Improving Solution with cost 1 ...
54.63/54.81	
54.63/54.81	LOG: CALL solveNonLinearGetNextSolution
54.63/54.81	
54.63/54.81	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001005s
54.63/54.81	Time used: 1.0009
54.63/54.81	
54.63/54.81	LOG: SAT solveNonLinear - Elapsed time: 1.045022s
54.63/54.81	Cost: 1; Total time: 1.0335
54.63/54.81	Quasi-ranking function: 50000 - arg1 - arg2
54.63/54.81	New Graphs: 
54.63/54.81	Transitions:
54.63/54.81	<l2, l2, 0 <= arg2 /\ 1 + arg1 <= arg2 /\ 50001 <= arg1 /\ 50001 <= arg1 + arg2 /\ 50001 + arg2 <= 2*arg1, {arg1 -> 1 + arg1, rest remain the same}>
54.63/54.81	<l2, l2, 50001 <= arg1 /\ 50001 <= arg1 + arg2 /\ 50001 <= arg2 /\ arg1 = arg2, {arg1 -> 1 + arg1, arg2 -> 2 + arg2, rest remain the same}>
54.63/54.81	Variables:
54.63/54.81	arg1, arg2
54.63/54.81	Checking conditional termination of SCC {l2}...
54.63/54.81	
54.63/54.81	LOG: CALL solveLinear
54.63/54.81	
54.63/54.81	LOG: RETURN solveLinear - Elapsed time: 0.001388s
54.63/54.81	
54.63/54.81	LOG: CALL solveLinear
54.63/54.81	
54.63/54.81	LOG: RETURN solveLinear - Elapsed time: 0.027661s
54.63/54.81	Trying to remove transition: <l2, l2, 50001 <= arg1 /\ 50001 <= arg1 + arg2 /\ 50001 <= arg2 /\ arg1 = arg2, {arg1 -> 1 + arg1, arg2 -> 2 + arg2, rest remain the same}>
54.63/54.81	Solving with 1 template(s).
54.63/54.81	
54.63/54.81	LOG: CALL solveNonLinearGetFirstSolution
54.63/54.81	
54.63/54.81	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.093786s
54.63/54.81	Time used: 0.093543
54.63/54.81	Trying to remove transition: <l2, l2, 0 <= arg2 /\ 1 + arg1 <= arg2 /\ 50001 <= arg1 /\ 50001 <= arg1 + arg2 /\ 50001 + arg2 <= 2*arg1, {arg1 -> 1 + arg1, rest remain the same}>
54.63/54.81	Solving with 1 template(s).
54.63/54.81	
54.63/54.81	LOG: CALL solveNonLinearGetFirstSolution
54.63/54.81	
54.63/54.81	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.158630s
54.63/54.81	Time used: 0.157871
54.63/54.81	Solving with 1 template(s).
54.63/54.81	
54.63/54.81	LOG: CALL solveNonLinearGetFirstSolution
54.63/54.81	
54.63/54.81	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002631s
54.63/54.81	Time used: 4.00143
54.63/54.81	Solving with 2 template(s).
54.63/54.81	
54.63/54.81	LOG: CALL solveNonLinearGetFirstSolution
54.63/54.81	
54.63/54.81	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.015999s
54.63/54.81	Time used: 4.00103
54.63/54.81	Solving with 3 template(s).
54.63/54.81	
54.63/54.81	LOG: CALL solveNonLinearGetFirstSolution
54.63/54.81	
54.63/54.81	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.010355s
54.63/54.81	Time used: 1.00059
54.63/54.81	Solving with 1 template(s).
54.63/54.81	
54.63/54.81	LOG: CALL solveNonLinearGetFirstSolution
54.63/54.81	
54.63/54.81	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.013156s
54.63/54.81	Time used: 4.00149
54.63/54.81	Termination failed. Trying to show unreachability...
54.63/54.81	Proving unreachability of entry: <l0, l2, arg1 = 0 /\ arg2 = 0, {all remain the same}>
54.63/54.81	
54.63/54.81	LOG: CALL check - Post:1 <= 0 - Process 1
54.63/54.81	* Exit transition: <l0, l2, arg1 = 0 /\ arg2 = 0, {all remain the same}>
54.63/54.81	* Postcondition  : 1 <= 0
54.63/54.81	
54.63/54.81	LOG: CALL solveLinear
54.63/54.81	
54.63/54.81	LOG: RETURN solveLinear - Elapsed time: 0.010792s
54.63/54.81	> Postcondition is not implied!
54.63/54.81	
54.63/54.81	LOG: RETURN check - Elapsed time: 0.010914s
54.63/54.81	Cannot prove unreachability
54.63/54.81	
54.63/54.81	Proving non-termination of subgraph 1
54.63/54.81	Transitions:
54.63/54.81	<l2, l2, 0 <= arg1 /\ 0 <= arg2 /\ 1 + arg1 <= arg2, {arg1 -> 1 + arg1, rest remain the same}>
54.63/54.81	<l2, l2, 0 <= arg1 /\ 0 <= arg2 /\ arg1 = arg2, {arg1 -> 1 + arg1, arg2 -> 2 + arg2, rest remain the same}>
54.63/54.81	Variables:
54.63/54.81	arg1, arg2
54.63/54.81	
54.63/54.81	Checking conditional non-termination of SCC {l2}...
54.63/54.81	EXIT TRANSITIONS:
54.63/54.81	<l2, end, 0 <= arg1 /\ 1 + arg2 <= arg1, {all remain the same}>
54.63/54.81	<l2, end, 0 <= arg2 /\ 1 + arg1 <= 0 /\ 1 + arg1 <= arg2, {all remain the same}>
54.63/54.81	<l2, end, arg2 <= arg1 /\ 1 + arg1 <= 0 /\ 1 + arg2 <= 0, {all remain the same}>
54.63/54.81	<l2, end, 1 + arg1 <= 0 /\ 1 + arg1 <= arg2 /\ 1 + arg2 <= 0, {all remain the same}>
54.63/54.81	
54.63/54.81	Solving with 1 template(s).
54.63/54.81	
54.63/54.81	LOG: CALL solveNonLinearGetFirstSolution
54.63/54.81	
54.63/54.81	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.016051s
54.63/54.81	Time used: 0.015812
54.63/54.81	Improving Solution with cost 2 ...
54.63/54.81	
54.63/54.81	LOG: CALL solveNonLinearGetNextSolution
54.63/54.81	
54.63/54.81	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.022063s
54.63/54.81	Time used: 0.022056
54.63/54.81	
54.63/54.81	LOG: SAT solveNonLinear - Elapsed time: 0.038114s
54.63/54.81	Cost: 2; Total time: 0.037868
54.63/54.81	Non-termination implied by a set of quasi-invariant(s):
54.63/54.81	Quasi-invariant at l2: 0 <= arg1
54.63/54.81	
54.63/54.81	Strengthening and disabling EXIT transitions...
54.63/54.81	Closed exits from l2: 3
54.63/54.81	Strengthening exit transition (result): 
54.63/54.81	<l2, end, 0 <= arg1 /\ 1 + arg2 <= arg1, {all remain the same}>
54.63/54.81	
54.63/54.81	Strengthening and disabling transitions...
54.63/54.81	
54.63/54.81	LOG: CALL solverLinear in Graph for feasibility
54.63/54.81	
54.63/54.81	LOG: RETURN solveLinear in Graph for feasibility
54.63/54.81	Strengthening transition (result): 
54.63/54.81	<l2, l2, 0 <= arg1 /\ 0 <= arg2 /\ 1 + arg1 <= arg2, {arg1 -> 1 + arg1, rest remain the same}>
54.63/54.81	
54.63/54.81	LOG: CALL solverLinear in Graph for feasibility
54.63/54.81	
54.63/54.81	LOG: RETURN solveLinear in Graph for feasibility
54.63/54.81	Strengthening transition (result): 
54.63/54.81	<l2, l2, 0 <= arg1 /\ 0 <= arg2 /\ arg1 = arg2, {arg1 -> 1 + arg1, arg2 -> 2 + arg2, rest remain the same}>
54.63/54.81	
54.63/54.81	Checking conditional non-termination of SCC {l2}...
54.63/54.81	EXIT TRANSITIONS:
54.63/54.81	<l2, end, 0 <= arg1 /\ 1 + arg2 <= arg1, {all remain the same}>
54.63/54.81	
54.63/54.81	Solving with 1 template(s).
54.63/54.81	
54.63/54.81	LOG: CALL solveNonLinearGetFirstSolution
54.63/54.81	
54.63/54.81	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011075s
54.63/54.81	Time used: 0.010972
54.63/54.81	
54.63/54.81	LOG: SAT solveNonLinear - Elapsed time: 0.011075s
54.63/54.81	Cost: 0; Total time: 0.010972
54.63/54.81	Non-termination implied by a set of quasi-invariant(s):
54.63/54.81	Quasi-invariant at l2: arg1 <= arg2
54.63/54.81	
54.63/54.81	Strengthening and disabling EXIT transitions...
54.63/54.81	Closed exits from l2: 1
54.63/54.81	
54.63/54.81	Strengthening and disabling transitions...
54.63/54.81	
54.63/54.81	LOG: CALL solverLinear in Graph for feasibility
54.63/54.81	
54.63/54.81	LOG: RETURN solveLinear in Graph for feasibility
54.63/54.81	Strengthening transition (result): 
54.63/54.81	<l2, l2, 0 <= arg1 /\ 0 <= arg2 /\ 1 + arg1 <= arg2, {arg1 -> 1 + arg1, rest remain the same}>
54.63/54.81	
54.63/54.81	LOG: CALL solverLinear in Graph for feasibility
54.63/54.81	
54.63/54.81	LOG: RETURN solveLinear in Graph for feasibility
54.63/54.81	Strengthening transition (result): 
54.63/54.81	<l2, l2, 0 <= arg1 /\ 0 <= arg2 /\ arg1 = arg2, {arg1 -> 1 + arg1, arg2 -> 2 + arg2, rest remain the same}>
54.63/54.81	
54.63/54.81	Calling reachability with...
54.63/54.81	Transition: <l2, end, true, {all remain the same}>
54.63/54.81	Conditions: 0 <= arg1, arg1 <= arg2, 
54.63/54.81	OPEN EXITS: 
54.63/54.81	<l2, end, arg1 <= arg2 /\ 0 <= arg1, {all remain the same}>
54.63/54.81	
54.63/54.81	--- Reachability graph ---
54.63/54.81	> Graph without transitions.
54.63/54.81	
54.63/54.81	Calling reachability with...
54.63/54.81	Transition: <l0, l2, arg1 = 0 /\ arg2 = 0, {all remain the same}>
54.63/54.81	Conditions: arg1 <= arg2, 0 <= arg1, 
54.63/54.81	OPEN EXITS: 
54.63/54.81	<l0, l2, arg1 <= arg2 /\ arg1 = 0 /\ arg2 = 0, {all remain the same}>
54.63/54.81	
54.63/54.81	> Conditions are reachable!
54.63/54.81	
54.63/54.81	Program does NOT terminate
54.63/54.81	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
54.63/54.81	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
54.63/54.81	EOF