54.88/55.01	NO
54.88/55.01	
54.88/55.01	Solver Timeout: 4
54.88/55.01	Global Timeout: 300
54.88/55.01	No parsing errors!
54.88/55.01	Init Location: 0
54.88/55.01	Transitions:
54.88/55.01	<l0, l3, true>
54.88/55.01	<l1, l2, (undef2 > ~(1)) /\ (arg2 > 1) /\ (undef1 > ~(1)) /\ (arg1 > 0), par{arg1 -> undef1, arg2 -> undef2}>
54.88/55.01	<l2, l2, (arg2 > arg1) /\ (arg1 > ~(1)), par{arg1 -> (arg1 + 4)}>
54.88/55.01	<l2, l2, (arg2 <= arg1) /\ (arg1 > ~(1)) /\ (arg2 > ~(1)), par{arg1 -> (arg1 + 2), arg2 -> (arg2 + 1)}>
54.88/55.01	<l3, l1, true, par{arg1 -> undef7, arg2 -> undef8}>
54.88/55.01	
54.88/55.01	Fresh variables:
54.88/55.01	undef1, undef2, undef7, undef8, 
54.88/55.01	
54.88/55.01	Undef variables:
54.88/55.01	undef1, undef2, undef7, undef8, 
54.88/55.01	
54.88/55.01	Abstraction variables:
54.88/55.01	
54.88/55.01	Exit nodes:
54.88/55.01	
54.88/55.01	Accepting locations:
54.88/55.01	
54.88/55.01	Asserts:
54.88/55.01	
54.88/55.01	Preprocessed LLVMGraph
54.88/55.01	Init Location: 0
54.88/55.01	Transitions:
54.88/55.01	<l0, l2, (arg1 = undef1) /\ (arg2 = undef2) /\ (undef2 > ~(1)) /\ (undef8 > 1) /\ (undef1 > ~(1)) /\ (undef7 > 0)>
54.88/55.01	<l2, l2, (arg2 > arg1) /\ (arg1 > ~(1)), par{arg1 -> (arg1 + 4)}>
54.88/55.01	<l2, l2, (arg2 <= arg1) /\ (arg1 > ~(1)) /\ (arg2 > ~(1)), par{arg1 -> (arg1 + 2), arg2 -> (arg2 + 1)}>
54.88/55.01	
54.88/55.01	Fresh variables:
54.88/55.01	undef1, undef2, undef7, undef8, 
54.88/55.01	
54.88/55.01	Undef variables:
54.88/55.01	undef1, undef2, undef7, undef8, 
54.88/55.01	
54.88/55.01	Abstraction variables:
54.88/55.01	
54.88/55.01	Exit nodes:
54.88/55.01	
54.88/55.01	Accepting locations:
54.88/55.01	
54.88/55.01	Asserts:
54.88/55.01	
54.88/55.01	*************************************************************
54.88/55.01	*******************************************************************************************
54.88/55.01	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
54.88/55.01	*******************************************************************************************
54.88/55.01	
54.88/55.01	Init Location: 0
54.88/55.01	Graph 0:
54.88/55.01	Transitions:
54.88/55.01	Variables:
54.88/55.01	
54.88/55.01	Graph 1:
54.88/55.01	Transitions:
54.88/55.01	<l2, l2, 1 + arg1 <= arg2 /\ 0 <= arg1, {arg1 -> 4 + arg1, rest remain the same}>
54.88/55.01	<l2, l2, 0 <= arg1 /\ arg2 <= arg1 /\ 0 <= arg2, {arg1 -> 2 + arg1, arg2 -> 1 + arg2, rest remain the same}>
54.88/55.01	Variables:
54.88/55.01	arg1, arg2
54.88/55.01	
54.88/55.01	Precedence: 
54.88/55.01	Graph 0
54.88/55.01	
54.88/55.01	Graph 1
54.88/55.01	<l0, l2, 1 <= undef7 /\ 0 <= undef1 /\ 0 <= undef2 /\ 2 <= undef8 /\ arg1 = undef1 /\ arg2 = undef2, {all remain the same}>
54.88/55.01	
54.88/55.01	Map Locations to Subgraph:
54.88/55.01	( 0 , 0 )
54.88/55.01	( 2 , 1 )
54.88/55.01	
54.88/55.01	*******************************************************************************************
54.88/55.01	********************************    CHECKING ASSERTIONS    ********************************
54.88/55.01	*******************************************************************************************
54.88/55.01	
54.88/55.01	Proving termination of subgraph 0
54.88/55.01	Proving termination of subgraph 1
54.88/55.01	Checking unfeasibility...
54.88/55.01	Time used: 0.004829
54.88/55.01	
54.88/55.01	Checking conditional termination of SCC {l2}...
54.88/55.01	
54.88/55.01	LOG: CALL solveLinear
54.88/55.01	
54.88/55.01	LOG: RETURN solveLinear - Elapsed time: 0.001202s
54.88/55.01	Ranking function: -arg1 + arg2
54.88/55.01	New Graphs: 
54.88/55.01	Transitions:
54.88/55.01	<l2, l2, 0 <= arg1 /\ arg2 <= arg1 /\ 0 <= arg2, {arg1 -> 2 + arg1, arg2 -> 1 + arg2, rest remain the same}>
54.88/55.01	Variables:
54.88/55.01	arg1, arg2
54.88/55.01	Checking conditional termination of SCC {l2}...
54.88/55.01	
54.88/55.01	LOG: CALL solveLinear
54.88/55.01	
54.88/55.01	LOG: RETURN solveLinear - Elapsed time: 0.000542s
54.88/55.01	
54.88/55.01	LOG: CALL solveLinear
54.88/55.01	
54.88/55.01	LOG: RETURN solveLinear - Elapsed time: 0.001865s
54.88/55.01	Trying to remove transition: <l2, l2, 0 <= arg1 /\ arg2 <= arg1 /\ 0 <= arg2, {arg1 -> 2 + arg1, arg2 -> 1 + arg2, rest remain the same}>
54.88/55.01	Solving with 1 template(s).
54.88/55.01	
54.88/55.01	LOG: CALL solveNonLinearGetFirstSolution
54.88/55.01	
54.88/55.01	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.015965s
54.88/55.01	Time used: 0.015789
54.88/55.01	Solving with 1 template(s).
54.88/55.01	
54.88/55.01	LOG: CALL solveNonLinearGetFirstSolution
54.88/55.01	
54.88/55.01	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001952s
54.88/55.01	Time used: 4.00122
54.88/55.01	Solving with 2 template(s).
54.88/55.01	
54.88/55.01	LOG: CALL solveNonLinearGetFirstSolution
54.88/55.01	
54.88/55.01	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.007555s
54.88/55.01	Time used: 4.00087
54.88/55.01	Solving with 3 template(s).
54.88/55.01	
54.88/55.01	LOG: CALL solveNonLinearGetFirstSolution
54.88/55.01	
54.88/55.01	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.006675s
54.88/55.01	Time used: 1.00049
54.88/55.01	Solving with 1 template(s).
54.88/55.01	
54.88/55.01	LOG: CALL solveNonLinearGetFirstSolution
54.88/55.01	
54.88/55.01	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.018711s
54.88/55.01	Time used: 0.010934
54.88/55.01	Improving Solution with cost 1 ...
54.88/55.01	
54.88/55.01	LOG: CALL solveNonLinearGetNextSolution
54.88/55.01	
54.88/55.01	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.017628s
54.88/55.01	Time used: 0.017605
54.88/55.01	
54.88/55.01	LOG: SAT solveNonLinear - Elapsed time: 0.036339s
54.88/55.01	Cost: 1; Total time: 0.028539
54.88/55.01	Termination implied by a set of invariant(s):
54.88/55.01	Invariant at l2: 0 <= arg1 + arg2
54.88/55.02	[ Invariant Graph ]
54.88/55.02	Strengthening and disabling transitions...
54.88/55.02	
54.88/55.02	LOG: CALL solverLinear in Graph for feasibility
54.88/55.02	
54.88/55.02	LOG: RETURN solveLinear in Graph for feasibility
54.88/55.02	Strengthening transition (result): 
54.88/55.02	<l2, l2, 1 + arg1 <= arg2 /\ 0 <= arg1 /\ 0 <= arg1 + arg2, {arg1 -> 4 + arg1, rest remain the same}>
54.88/55.02	
54.88/55.02	LOG: CALL solverLinear in Graph for feasibility
54.88/55.02	
54.88/55.02	LOG: RETURN solveLinear in Graph for feasibility
54.88/55.02	Strengthening transition (result): 
54.88/55.02	<l2, l2, 0 <= arg1 /\ arg2 <= arg1 /\ 0 <= arg1 + arg2 /\ 0 <= arg2, {arg1 -> 2 + arg1, arg2 -> 1 + arg2, rest remain the same}>
54.88/55.02	[ Termination Graph ]
54.88/55.02	Strengthening and disabling transitions...
54.88/55.02	
54.88/55.02	LOG: CALL solverLinear in Graph for feasibility
54.88/55.02	
54.88/55.02	LOG: RETURN solveLinear in Graph for feasibility
54.88/55.02	Strengthening transition (result): 
54.88/55.02	<l2, l2, 0 <= arg1 /\ arg2 <= arg1 /\ 0 <= arg1 + arg2 /\ 0 <= arg2, {arg1 -> 2 + arg1, arg2 -> 1 + arg2, rest remain the same}>
54.88/55.02	Quasi-ranking function: 50000 - arg1
54.88/55.02	New Graphs: 
54.88/55.02	Transitions:
54.88/55.02	<l2, l2, arg2 <= arg1 /\ 0 <= arg1 + arg2 /\ 0 <= arg2 /\ 50001 <= arg1, {arg1 -> 2 + arg1, arg2 -> 1 + arg2, rest remain the same}>
54.88/55.02	Variables:
54.88/55.02	arg1, arg2
54.88/55.02	Checking conditional termination of SCC {l2}...
54.88/55.02	
54.88/55.02	LOG: CALL solveLinear
54.88/55.02	
54.88/55.02	LOG: RETURN solveLinear - Elapsed time: 0.000703s
54.88/55.02	
54.88/55.02	LOG: CALL solveLinear
54.88/55.02	
54.88/55.02	LOG: RETURN solveLinear - Elapsed time: 0.002803s
54.88/55.02	Trying to remove transition: <l2, l2, arg2 <= arg1 /\ 0 <= arg1 + arg2 /\ 0 <= arg2 /\ 50001 <= arg1, {arg1 -> 2 + arg1, arg2 -> 1 + arg2, rest remain the same}>
54.88/55.02	Solving with 1 template(s).
54.88/55.02	
54.88/55.02	LOG: CALL solveNonLinearGetFirstSolution
54.88/55.02	
54.88/55.02	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.024518s
54.88/55.02	Time used: 0.024353
54.88/55.02	Solving with 1 template(s).
54.88/55.02	
54.88/55.02	LOG: CALL solveNonLinearGetFirstSolution
54.88/55.02	
54.88/55.02	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.003272s
54.88/55.02	Time used: 4.00238
54.88/55.02	Solving with 2 template(s).
54.88/55.02	
54.88/55.02	LOG: CALL solveNonLinearGetFirstSolution
54.88/55.02	
54.88/55.02	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.006881s
54.88/55.02	Time used: 4.00099
54.88/55.02	Solving with 3 template(s).
54.88/55.02	
54.88/55.02	LOG: CALL solveNonLinearGetFirstSolution
54.88/55.02	
54.88/55.02	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.006531s
54.88/55.02	Time used: 1.00058
54.88/55.02	Solving with 1 template(s).
54.88/55.02	
54.88/55.02	LOG: CALL solveNonLinearGetFirstSolution
54.88/55.02	
54.88/55.02	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.020992s
54.88/55.02	Time used: 0.012776
54.88/55.02	Improving Solution with cost 1 ...
54.88/55.02	
54.88/55.02	LOG: CALL solveNonLinearGetNextSolution
54.88/55.02	
54.88/55.02	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.036818s
54.88/55.02	Time used: 0.036809
54.88/55.02	
54.88/55.02	LOG: SAT solveNonLinear - Elapsed time: 0.057809s
54.88/55.02	Cost: 1; Total time: 0.049585
54.88/55.02	Termination implied by a set of invariant(s):
54.88/55.02	Invariant at l2: 0 <= 1 + arg1
54.88/55.02	[ Invariant Graph ]
54.88/55.02	Strengthening and disabling transitions...
54.88/55.02	
54.88/55.02	LOG: CALL solverLinear in Graph for feasibility
54.88/55.02	
54.88/55.02	LOG: RETURN solveLinear in Graph for feasibility
54.88/55.02	Strengthening transition (result): 
54.88/55.02	<l2, l2, 1 + arg1 <= arg2 /\ 0 <= arg1 /\ 0 <= arg1 + arg2, {arg1 -> 4 + arg1, rest remain the same}>
54.88/55.02	
54.88/55.02	LOG: CALL solverLinear in Graph for feasibility
54.88/55.02	
54.88/55.02	LOG: RETURN solveLinear in Graph for feasibility
54.88/55.02	Strengthening transition (result): 
54.88/55.02	<l2, l2, 0 <= arg1 /\ arg2 <= arg1 /\ 0 <= arg1 + arg2 /\ 0 <= arg2, {arg1 -> 2 + arg1, arg2 -> 1 + arg2, rest remain the same}>
54.88/55.02	[ Termination Graph ]
54.88/55.02	Strengthening and disabling transitions...
54.88/55.02	
54.88/55.02	LOG: CALL solverLinear in Graph for feasibility
54.88/55.02	
54.88/55.02	LOG: RETURN solveLinear in Graph for feasibility
54.88/55.02	Strengthening transition (result): 
54.88/55.02	<l2, l2, arg2 <= arg1 /\ 0 <= arg1 + arg2 /\ 0 <= arg2 /\ 50001 <= arg1, {arg1 -> 2 + arg1, arg2 -> 1 + arg2, rest remain the same}>
54.88/55.02	Quasi-ranking function: 50000 - arg2
54.88/55.02	New Graphs: 
54.88/55.02	Transitions:
54.88/55.02	<l2, l2, arg2 <= arg1 /\ 0 <= arg1 + arg2 /\ 50001 <= arg1 /\ 50001 <= arg2, {arg1 -> 2 + arg1, arg2 -> 1 + arg2, rest remain the same}>
54.88/55.02	Variables:
54.88/55.02	arg1, arg2
54.88/55.02	Checking conditional termination of SCC {l2}...
54.88/55.02	
54.88/55.02	LOG: CALL solveLinear
54.88/55.02	
54.88/55.02	LOG: RETURN solveLinear - Elapsed time: 0.000727s
54.88/55.02	
54.88/55.02	LOG: CALL solveLinear
54.88/55.02	
54.88/55.02	LOG: RETURN solveLinear - Elapsed time: 0.003570s
54.88/55.02	Trying to remove transition: <l2, l2, arg2 <= arg1 /\ 0 <= arg1 + arg2 /\ 50001 <= arg1 /\ 50001 <= arg2, {arg1 -> 2 + arg1, arg2 -> 1 + arg2, rest remain the same}>
54.88/55.02	Solving with 1 template(s).
54.88/55.02	
54.88/55.02	LOG: CALL solveNonLinearGetFirstSolution
54.88/55.02	
54.88/55.02	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.026021s
54.88/55.02	Time used: 0.025856
54.88/55.02	Solving with 1 template(s).
54.88/55.02	
54.88/55.02	LOG: CALL solveNonLinearGetFirstSolution
54.88/55.02	
54.88/55.02	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002235s
54.88/55.02	Time used: 4.00142
54.88/55.02	Solving with 2 template(s).
54.88/55.02	
54.88/55.02	LOG: CALL solveNonLinearGetFirstSolution
54.88/55.02	
54.88/55.02	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.008200s
54.88/55.02	Time used: 4.00109
54.88/55.02	Solving with 3 template(s).
54.88/55.02	
54.88/55.02	LOG: CALL solveNonLinearGetFirstSolution
54.88/55.02	
54.88/55.02	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.007725s
54.88/55.02	Time used: 1.00078
54.88/55.02	Solving with 1 template(s).
54.88/55.02	
54.88/55.02	LOG: CALL solveNonLinearGetFirstSolution
54.88/55.02	
54.88/55.02	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.023274s
54.88/55.02	Time used: 0.015491
54.88/55.02	Improving Solution with cost 1 ...
54.88/55.02	
54.88/55.02	LOG: CALL solveNonLinearGetNextSolution
54.88/55.02	
54.88/55.02	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.029045s
54.88/55.02	Time used: 0.029038
54.88/55.02	
54.88/55.02	LOG: SAT solveNonLinear - Elapsed time: 0.052319s
54.88/55.02	Cost: 1; Total time: 0.044529
54.88/55.02	Termination implied by a set of invariant(s):
54.88/55.02	Invariant at l2: 0 <= 1 + arg2
54.88/55.02	[ Invariant Graph ]
54.88/55.02	Strengthening and disabling transitions...
54.88/55.02	
54.88/55.02	LOG: CALL solverLinear in Graph for feasibility
54.88/55.02	
54.88/55.02	LOG: RETURN solveLinear in Graph for feasibility
54.88/55.02	Strengthening transition (result): 
54.88/55.02	<l2, l2, 1 + arg1 <= arg2 /\ 0 <= 1 + arg2 /\ 0 <= arg1 /\ 0 <= arg1 + arg2, {arg1 -> 4 + arg1, rest remain the same}>
54.88/55.02	
54.88/55.02	LOG: CALL solverLinear in Graph for feasibility
54.88/55.02	
54.88/55.02	LOG: RETURN solveLinear in Graph for feasibility
54.88/55.02	Strengthening transition (result): 
54.88/55.02	<l2, l2, 0 <= arg1 /\ arg2 <= arg1 /\ 0 <= arg1 + arg2 /\ 0 <= arg2, {arg1 -> 2 + arg1, arg2 -> 1 + arg2, rest remain the same}>
54.88/55.02	[ Termination Graph ]
54.88/55.02	Strengthening and disabling transitions...
54.88/55.02	
54.88/55.02	LOG: CALL solverLinear in Graph for feasibility
54.88/55.02	
54.88/55.02	LOG: RETURN solveLinear in Graph for feasibility
54.88/55.02	Strengthening transition (result): 
54.88/55.02	<l2, l2, arg2 <= arg1 /\ 0 <= arg1 + arg2 /\ 50001 <= arg1 /\ 50001 <= arg2, {arg1 -> 2 + arg1, arg2 -> 1 + arg2, rest remain the same}>
54.88/55.02	Quasi-ranking function: 50000 + arg1 - 3*arg2
54.88/55.02	New Graphs: 
54.88/55.02	Transitions:
54.88/55.02	<l2, l2, arg2 <= arg1 /\ 0 <= arg1 + arg2 /\ 50001 + arg1 <= 3*arg2 /\ 50001 <= arg1 /\ 50001 <= arg2, {arg1 -> 2 + arg1, arg2 -> 1 + arg2, rest remain the same}>
54.88/55.02	Variables:
54.88/55.02	arg1, arg2
54.88/55.02	Checking conditional termination of SCC {l2}...
54.88/55.02	
54.88/55.02	LOG: CALL solveLinear
54.88/55.02	
54.88/55.02	LOG: RETURN solveLinear - Elapsed time: 0.000860s
54.88/55.02	
54.88/55.02	LOG: CALL solveLinear
54.88/55.02	
54.88/55.02	LOG: RETURN solveLinear - Elapsed time: 0.003962s
54.88/55.02	Trying to remove transition: <l2, l2, arg2 <= arg1 /\ 0 <= arg1 + arg2 /\ 50001 + arg1 <= 3*arg2 /\ 50001 <= arg1 /\ 50001 <= arg2, {arg1 -> 2 + arg1, arg2 -> 1 + arg2, rest remain the same}>
54.88/55.02	Solving with 1 template(s).
54.88/55.02	
54.88/55.02	LOG: CALL solveNonLinearGetFirstSolution
54.88/55.02	
54.88/55.02	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.044552s
54.88/55.02	Time used: 0.044376
54.88/55.02	Solving with 1 template(s).
54.88/55.02	
54.88/55.02	LOG: CALL solveNonLinearGetFirstSolution
54.88/55.02	
54.88/55.02	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.003206s
54.88/55.02	Time used: 4.00234
54.88/55.02	Solving with 2 template(s).
54.88/55.02	
54.88/55.02	LOG: CALL solveNonLinearGetFirstSolution
54.88/55.02	
54.88/55.02	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.007249s
54.88/55.02	Time used: 4.00118
54.88/55.02	Solving with 3 template(s).
54.88/55.02	
54.88/55.02	LOG: CALL solveNonLinearGetFirstSolution
54.88/55.02	
54.88/55.02	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.007615s
54.88/55.02	Time used: 1.00092
54.88/55.02	Solving with 1 template(s).
54.88/55.02	
54.88/55.02	LOG: CALL solveNonLinearGetFirstSolution
54.88/55.02	
54.88/55.02	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.024932s
54.88/55.02	Time used: 0.016998
54.88/55.02	Improving Solution with cost 1 ...
54.88/55.02	
54.88/55.02	LOG: CALL solveNonLinearGetNextSolution
54.88/55.02	
54.88/55.02	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.035032s
54.88/55.02	Time used: 0.035023
54.88/55.02	
54.88/55.02	LOG: SAT solveNonLinear - Elapsed time: 0.059964s
54.88/55.02	Cost: 1; Total time: 0.052021
54.88/55.02	Termination implied by a set of invariant(s):
54.88/55.02	Invariant at l2: 0 <= 1 + arg2
54.88/55.02	[ Invariant Graph ]
54.88/55.02	Strengthening and disabling transitions...
54.88/55.02	
54.88/55.02	LOG: CALL solverLinear in Graph for feasibility
54.88/55.02	
54.88/55.02	LOG: RETURN solveLinear in Graph for feasibility
54.88/55.02	Strengthening transition (result): 
54.88/55.02	<l2, l2, 1 + arg1 <= arg2 /\ 0 <= 1 + arg2 /\ 0 <= arg1 /\ 0 <= arg1 + arg2, {arg1 -> 4 + arg1, rest remain the same}>
54.88/55.02	
54.88/55.02	LOG: CALL solverLinear in Graph for feasibility
54.88/55.02	
54.88/55.02	LOG: RETURN solveLinear in Graph for feasibility
54.88/55.02	Strengthening transition (result): 
54.88/55.02	<l2, l2, 0 <= arg1 /\ arg2 <= arg1 /\ 0 <= arg1 + arg2 /\ 0 <= arg2, {arg1 -> 2 + arg1, arg2 -> 1 + arg2, rest remain the same}>
54.88/55.02	[ Termination Graph ]
54.88/55.02	Strengthening and disabling transitions...
54.88/55.02	
54.88/55.02	LOG: CALL solverLinear in Graph for feasibility
54.88/55.02	
54.88/55.02	LOG: RETURN solveLinear in Graph for feasibility
54.88/55.02	Strengthening transition (result): 
54.88/55.02	<l2, l2, arg2 <= arg1 /\ 0 <= arg1 + arg2 /\ 50001 + arg1 <= 3*arg2 /\ 50001 <= arg1 /\ 50001 <= arg2, {arg1 -> 2 + arg1, arg2 -> 1 + arg2, rest remain the same}>
54.88/55.02	Quasi-ranking function: 50000 - arg1 + arg2
54.88/55.02	New Graphs: 
54.88/55.02	Transitions:
54.88/55.02	<l2, l2, 0 <= arg1 + arg2 /\ 50001 + arg1 <= 3*arg2 /\ 50001 <= arg1 /\ 50001 + arg2 <= arg1 /\ 50001 <= arg2, {arg1 -> 2 + arg1, arg2 -> 1 + arg2, rest remain the same}>
54.88/55.02	Variables:
54.88/55.02	arg1, arg2
54.88/55.02	Checking conditional termination of SCC {l2}...
54.88/55.02	
54.88/55.02	LOG: CALL solveLinear
54.88/55.02	
54.88/55.02	LOG: RETURN solveLinear - Elapsed time: 0.000895s
54.88/55.02	
54.88/55.02	LOG: CALL solveLinear
54.88/55.02	
54.88/55.02	LOG: RETURN solveLinear - Elapsed time: 0.003710s
54.88/55.02	Trying to remove transition: <l2, l2, 0 <= arg1 + arg2 /\ 50001 + arg1 <= 3*arg2 /\ 50001 <= arg1 /\ 50001 + arg2 <= arg1 /\ 50001 <= arg2, {arg1 -> 2 + arg1, arg2 -> 1 + arg2, rest remain the same}>
54.88/55.02	Solving with 1 template(s).
54.88/55.02	
54.88/55.02	LOG: CALL solveNonLinearGetFirstSolution
54.88/55.02	
54.88/55.02	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.044597s
54.88/55.02	Time used: 0.04442
54.88/55.02	Solving with 1 template(s).
54.88/55.02	
54.88/55.02	LOG: CALL solveNonLinearGetFirstSolution
54.88/55.02	
54.88/55.02	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.006305s
54.88/55.02	Time used: 4.003
54.88/55.02	Solving with 2 template(s).
54.88/55.02	
54.88/55.02	LOG: CALL solveNonLinearGetFirstSolution
54.88/55.02	
54.88/55.02	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.009108s
54.88/55.02	Time used: 4.00138
54.88/55.02	Solving with 3 template(s).
54.88/55.02	
54.88/55.02	LOG: CALL solveNonLinearGetFirstSolution
54.88/55.02	
54.88/55.02	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.007995s
54.88/55.02	Time used: 1.00116
54.88/55.02	Solving with 1 template(s).
54.88/55.02	
54.88/55.02	LOG: CALL solveNonLinearGetFirstSolution
54.88/55.02	
54.88/55.02	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.024165s
54.88/55.02	Time used: 0.016251
54.88/55.02	Improving Solution with cost 1 ...
54.88/55.02	
54.88/55.02	LOG: CALL solveNonLinearGetNextSolution
54.88/55.02	
54.88/55.02	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.043327s
54.88/55.02	Time used: 0.043319
54.88/55.02	
54.88/55.02	LOG: SAT solveNonLinear - Elapsed time: 0.067492s
54.88/55.02	Cost: 1; Total time: 0.05957
54.88/55.02	Termination implied by a set of invariant(s):
54.88/55.02	Invariant at l2: 0 <= 1 + arg1 + arg2
54.88/55.02	[ Invariant Graph ]
54.88/55.02	Strengthening and disabling transitions...
54.88/55.02	
54.88/55.02	LOG: CALL solverLinear in Graph for feasibility
54.88/55.02	
54.88/55.02	LOG: RETURN solveLinear in Graph for feasibility
54.88/55.02	Strengthening transition (result): 
54.88/55.02	<l2, l2, 1 + arg1 <= arg2 /\ 0 <= 1 + arg2 /\ 0 <= arg1 /\ 0 <= arg1 + arg2, {arg1 -> 4 + arg1, rest remain the same}>
54.88/55.02	
54.88/55.02	LOG: CALL solverLinear in Graph for feasibility
54.88/55.02	
54.88/55.02	LOG: RETURN solveLinear in Graph for feasibility
54.88/55.02	Strengthening transition (result): 
54.88/55.02	<l2, l2, 0 <= arg1 /\ arg2 <= arg1 /\ 0 <= arg1 + arg2 /\ 0 <= arg2, {arg1 -> 2 + arg1, arg2 -> 1 + arg2, rest remain the same}>
54.88/55.02	[ Termination Graph ]
54.88/55.02	Strengthening and disabling transitions...
54.88/55.02	
54.88/55.02	LOG: CALL solverLinear in Graph for feasibility
54.88/55.02	
54.88/55.02	LOG: RETURN solveLinear in Graph for feasibility
54.88/55.02	Strengthening transition (result): 
54.88/55.02	<l2, l2, 0 <= arg1 + arg2 /\ 50001 + arg1 <= 3*arg2 /\ 50001 <= arg1 /\ 50001 + arg2 <= arg1 /\ 50001 <= arg2, {arg1 -> 2 + arg1, arg2 -> 1 + arg2, rest remain the same}>
54.88/55.02	Quasi-ranking function: 50000 - arg1 - arg2
54.88/55.02	New Graphs: 
54.88/55.02	Transitions:
54.88/55.02	<l2, l2, 50001 + arg1 <= 3*arg2 /\ 50001 <= arg1 /\ 50001 + arg2 <= arg1 /\ 50001 <= arg1 + arg2 /\ 50001 <= arg2, {arg1 -> 2 + arg1, arg2 -> 1 + arg2, rest remain the same}>
54.88/55.02	Variables:
54.88/55.02	arg1, arg2
54.88/55.02	Checking conditional termination of SCC {l2}...
54.88/55.02	
54.88/55.02	LOG: CALL solveLinear
54.88/55.02	
54.88/55.02	LOG: RETURN solveLinear - Elapsed time: 0.000900s
54.88/55.02	
54.88/55.02	LOG: CALL solveLinear
54.88/55.02	
54.88/55.02	LOG: RETURN solveLinear - Elapsed time: 0.003805s
54.88/55.02	Trying to remove transition: <l2, l2, 50001 + arg1 <= 3*arg2 /\ 50001 <= arg1 /\ 50001 + arg2 <= arg1 /\ 50001 <= arg1 + arg2 /\ 50001 <= arg2, {arg1 -> 2 + arg1, arg2 -> 1 + arg2, rest remain the same}>
54.88/55.02	Solving with 1 template(s).
54.88/55.02	
54.88/55.02	LOG: CALL solveNonLinearGetFirstSolution
54.88/55.02	
54.88/55.02	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.048329s
54.88/55.02	Time used: 0.048152
54.88/55.02	Solving with 1 template(s).
54.88/55.02	
54.88/55.02	LOG: CALL solveNonLinearGetFirstSolution
54.88/55.02	
54.88/55.02	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.011399s
54.88/55.02	Time used: 4.00296
54.88/55.02	Solving with 2 template(s).
54.88/55.02	
54.88/55.02	LOG: CALL solveNonLinearGetFirstSolution
54.88/55.02	
54.88/55.02	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.007614s
54.88/55.02	Time used: 4.00158
54.88/55.02	Solving with 3 template(s).
54.88/55.02	
54.88/55.02	LOG: CALL solveNonLinearGetFirstSolution
54.88/55.02	
54.88/55.02	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.007963s
54.88/55.02	Time used: 1.00113
54.88/55.02	Solving with 1 template(s).
54.88/55.02	
54.88/55.02	LOG: CALL solveNonLinearGetFirstSolution
54.88/55.02	
54.88/55.02	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.022644s
54.88/55.02	Time used: 0.01489
54.88/55.02	Termination failed. Trying to show unreachability...
54.88/55.02	Proving unreachability of entry: <l0, l2, 1 <= undef7 /\ 0 <= undef1 /\ 0 <= undef2 /\ 2 <= undef8 /\ arg1 = undef1 /\ arg2 = undef2, {all remain the same}>
54.88/55.02	
54.88/55.02	LOG: CALL check - Post:1 <= 0 - Process 1
54.88/55.02	* Exit transition: <l0, l2, 1 <= undef7 /\ 0 <= undef1 /\ 0 <= undef2 /\ 2 <= undef8 /\ arg1 = undef1 /\ arg2 = undef2, {all remain the same}>
54.88/55.02	* Postcondition  : 1 <= 0
54.88/55.02	
54.88/55.02	LOG: CALL solveLinear
54.88/55.02	
54.88/55.02	LOG: RETURN solveLinear - Elapsed time: 0.002093s
54.88/55.02	> Postcondition is not implied!
54.88/55.02	
54.88/55.02	LOG: RETURN check - Elapsed time: 0.002214s
54.88/55.02	Cannot prove unreachability
54.88/55.02	
54.88/55.02	Proving non-termination of subgraph 1
54.88/55.02	Transitions:
54.88/55.02	<l2, l2, 1 + arg1 <= arg2 /\ 0 <= arg1, {arg1 -> 4 + arg1, rest remain the same}>
54.88/55.02	<l2, l2, 0 <= arg1 /\ arg2 <= arg1 /\ 0 <= arg2, {arg1 -> 2 + arg1, arg2 -> 1 + arg2, rest remain the same}>
54.88/55.02	Variables:
54.88/55.02	arg1, arg2
54.88/55.02	
54.88/55.02	Checking conditional non-termination of SCC {l2}...
54.88/55.02	EXIT TRANSITIONS:
54.88/55.02	<l2, end, 1 + arg2 <= 0 /\ arg2 <= arg1, {all remain the same}>
54.88/55.02	<l2, end, 1 + arg1 <= 0 /\ 1 + arg1 <= arg2, {all remain the same}>
54.88/55.02	
54.88/55.02	Solving with 1 template(s).
54.88/55.02	
54.88/55.02	LOG: CALL solveNonLinearGetFirstSolution
54.88/55.02	
54.88/55.02	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012344s
54.88/55.02	Time used: 0.012117
54.88/55.02	Improving Solution with cost 1 ...
54.88/55.02	
54.88/55.02	LOG: CALL solveNonLinearGetNextSolution
54.88/55.02	
54.88/55.02	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.016259s
54.88/55.02	Time used: 0.016251
54.88/55.02	
54.88/55.02	LOG: SAT solveNonLinear - Elapsed time: 0.028603s
54.88/55.02	Cost: 1; Total time: 0.028368
54.88/55.02	Non-termination implied by a set of quasi-invariant(s):
54.88/55.02	Quasi-invariant at l2: 0 <= arg1
54.88/55.02	
54.88/55.02	Strengthening and disabling EXIT transitions...
54.88/55.02	Closed exits from l2: 1
54.88/55.02	Strengthening exit transition (result): 
54.88/55.02	<l2, end, 1 + arg2 <= 0 /\ 0 <= arg1 /\ arg2 <= arg1, {all remain the same}>
54.88/55.02	
54.88/55.02	Strengthening and disabling transitions...
54.88/55.02	
54.88/55.02	LOG: CALL solverLinear in Graph for feasibility
54.88/55.02	
54.88/55.02	LOG: RETURN solveLinear in Graph for feasibility
54.88/55.02	Strengthening transition (result): 
54.88/55.02	<l2, l2, 1 + arg1 <= arg2 /\ 0 <= arg1, {arg1 -> 4 + arg1, rest remain the same}>
54.88/55.02	
54.88/55.02	LOG: CALL solverLinear in Graph for feasibility
54.88/55.02	
54.88/55.02	LOG: RETURN solveLinear in Graph for feasibility
54.88/55.02	Strengthening transition (result): 
54.88/55.02	<l2, l2, 0 <= arg1 /\ arg2 <= arg1 /\ 0 <= arg2, {arg1 -> 2 + arg1, arg2 -> 1 + arg2, rest remain the same}>
54.88/55.02	
54.88/55.02	Checking conditional non-termination of SCC {l2}...
54.88/55.02	EXIT TRANSITIONS:
54.88/55.02	<l2, end, 1 + arg2 <= 0 /\ 0 <= arg1 /\ arg2 <= arg1, {all remain the same}>
54.88/55.02	
54.88/55.02	Solving with 1 template(s).
54.88/55.02	
54.88/55.02	LOG: CALL solveNonLinearGetFirstSolution
54.88/55.02	
54.88/55.02	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009719s
54.88/55.02	Time used: 0.009616
54.88/55.02	
54.88/55.02	LOG: SAT solveNonLinear - Elapsed time: 0.009719s
54.88/55.02	Cost: 0; Total time: 0.009616
54.88/55.02	Non-termination implied by a set of quasi-invariant(s):
54.88/55.02	Quasi-invariant at l2: 0 <= arg2
54.88/55.02	
54.88/55.02	Strengthening and disabling EXIT transitions...
54.88/55.02	Closed exits from l2: 1
54.88/55.02	
54.88/55.02	Strengthening and disabling transitions...
54.88/55.02	
54.88/55.02	LOG: CALL solverLinear in Graph for feasibility
54.88/55.02	
54.88/55.02	LOG: RETURN solveLinear in Graph for feasibility
54.88/55.02	Strengthening transition (result): 
54.88/55.02	<l2, l2, 1 + arg1 <= arg2 /\ 0 <= arg1 /\ 0 <= arg2, {arg1 -> 4 + arg1, rest remain the same}>
54.88/55.02	
54.88/55.02	LOG: CALL solverLinear in Graph for feasibility
54.88/55.02	
54.88/55.02	LOG: RETURN solveLinear in Graph for feasibility
54.88/55.02	Strengthening transition (result): 
54.88/55.02	<l2, l2, 0 <= arg1 /\ arg2 <= arg1 /\ 0 <= arg2, {arg1 -> 2 + arg1, arg2 -> 1 + arg2, rest remain the same}>
54.88/55.02	
54.88/55.02	Calling reachability with...
54.88/55.02	Transition: <l2, end, true, {all remain the same}>
54.88/55.02	Conditions: 0 <= arg1, 0 <= arg2, 
54.88/55.02	OPEN EXITS: 
54.88/55.02	<l2, end, 0 <= arg1 /\ 0 <= arg2, {all remain the same}>
54.88/55.02	
54.88/55.02	--- Reachability graph ---
54.88/55.02	> Graph without transitions.
54.88/55.02	
54.88/55.02	Calling reachability with...
54.88/55.02	Transition: <l0, l2, 1 <= undef7 /\ 0 <= undef1 /\ 0 <= undef2 /\ 2 <= undef8 /\ arg1 = undef1 /\ arg2 = undef2, {all remain the same}>
54.88/55.02	Conditions: 0 <= arg1, 0 <= arg2, 
54.88/55.02	OPEN EXITS: 
54.88/55.02	<l0, l2, 1 <= undef7 /\ 0 <= arg1 /\ 0 <= arg2 /\ 0 <= undef1 /\ 0 <= undef2 /\ 2 <= undef8 /\ arg1 = undef1 /\ arg2 = undef2, {all remain the same}>
54.88/55.02	
54.88/55.02	> Conditions are reachable!
54.88/55.02	
54.88/55.02	Program does NOT terminate
54.88/55.02	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
54.88/55.02	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
54.88/55.02	EOF