27.33/27.38	NO
27.33/27.38	
27.33/27.38	Solver Timeout: 4
27.33/27.38	Global Timeout: 300
27.33/27.38	No parsing errors!
27.33/27.38	Init Location: 0
27.33/27.38	Transitions:
27.33/27.38	<l0, l4, true>
27.33/27.38	<l1, l2, (arg1 > 0) /\ (arg2 > ~(1)), par{arg1 -> arg2, arg3 -> arg2, arg4 -> undef4}>
27.33/27.38	<l2, l2, (arg1 >= arg2) /\ (arg1 > 1) /\ (arg2 > 4) /\ (arg1 = arg3), par{arg1 -> (arg1 - 1), arg2 -> (arg2 - 1), arg3 -> (arg1 - 1), arg4 -> undef8}>
27.33/27.38	<l2, l3, (arg1 < arg2) /\ (arg2 > 1) /\ ((arg1 + 1) >= (2 * arg2)) /\ (arg1 > 0) /\ (arg1 = arg3), par{arg3 -> (arg1 + 1), arg4 -> (arg2 + 1)}>
27.33/27.38	<l2, l3, (arg1 < arg2) /\ (arg2 > 1) /\ ((arg1 + 1) < (2 * arg2)) /\ (arg1 > 0) /\ (arg1 = arg3), par{arg3 -> (arg1 + 1), arg4 -> (arg2 - 1)}>
27.33/27.38	<l3, l2, (arg1 > 0) /\ (arg2 > 1) /\ (arg3 > 1) /\ (arg4 > 0) /\ (arg2 > arg1) /\ (arg2 >= arg3) /\ (arg1 <= arg4), par{arg1 -> arg3, arg2 -> arg4, arg4 -> undef20}>
27.33/27.38	<l2, l2, (arg1 > 0) /\ (arg1 >= arg2) /\ (arg2 < 5) /\ (((arg1 - 1) - (arg2 + 1)) <= 2) /\ (arg2 > ~(1)) /\ (arg1 = arg3), par{arg1 -> (arg1 - 1), arg2 -> (arg2 + 2), arg3 -> (arg1 - 1), arg4 -> undef24}>
27.33/27.38	<l2, l2, (arg1 > 0) /\ (arg1 >= arg2) /\ (arg2 < 5) /\ (((arg1 - 1) - (arg2 + 1)) > 2) /\ (arg2 > ~(1)) /\ (arg1 = arg3), par{arg2 -> (arg2 + 1), arg3 -> arg1, arg4 -> undef28}>
27.33/27.38	<l4, l1, true, par{arg1 -> undef29, arg2 -> undef30, arg3 -> undef31, arg4 -> undef32}>
27.33/27.38	
27.33/27.38	Fresh variables:
27.33/27.38	undef4, undef8, undef20, undef24, undef28, undef29, undef30, undef31, undef32, 
27.33/27.38	
27.33/27.38	Undef variables:
27.33/27.38	undef4, undef8, undef20, undef24, undef28, undef29, undef30, undef31, undef32, 
27.33/27.38	
27.33/27.38	Abstraction variables:
27.33/27.38	
27.33/27.38	Exit nodes:
27.33/27.38	
27.33/27.38	Accepting locations:
27.33/27.38	
27.33/27.38	Asserts:
27.33/27.38	
27.33/27.38	Preprocessed LLVMGraph
27.33/27.38	Init Location: 0
27.33/27.38	Transitions:
27.33/27.38	<l0, l2, (arg1 = undef30) /\ (arg2 = undef30) /\ (arg3 = undef30) /\ (undef29 > 0) /\ (undef30 > ~(1))>
27.33/27.38	<l2, l2, (arg1 >= arg2) /\ (arg1 > 1) /\ (arg2 > 4) /\ (arg1 = arg3), par{arg1 -> (arg1 - 1), arg2 -> (arg2 - 1), arg3 -> (arg1 - 1)}>
27.33/27.38	<l2, l2, (arg1 < arg2) /\ (arg2 > 1) /\ ((arg1 + 1) < (2 * arg2)) /\ (arg1 > 0) /\ (arg1 = arg3) /\ (arg1 > 0) /\ (arg2 > 1) /\ ((arg1 + 1) > 1) /\ ((arg2 - 1) > 0) /\ (arg2 > arg1) /\ (arg2 >= (arg1 + 1)) /\ (arg1 <= (arg2 - 1)), par{arg1 -> (arg1 + 1), arg2 -> (arg2 - 1), arg3 -> (arg1 + 1)}>
27.33/27.38	<l2, l2, (arg1 > 0) /\ (arg1 >= arg2) /\ (arg2 < 5) /\ (((arg1 - 1) - (arg2 + 1)) <= 2) /\ (arg2 > ~(1)) /\ (arg1 = arg3), par{arg1 -> (arg1 - 1), arg2 -> (arg2 + 2), arg3 -> (arg1 - 1)}>
27.33/27.38	<l2, l2, (arg1 > 0) /\ (arg1 >= arg2) /\ (arg2 < 5) /\ (((arg1 - 1) - (arg2 + 1)) > 2) /\ (arg2 > ~(1)) /\ (arg1 = arg3), par{arg2 -> (arg2 + 1), arg3 -> arg1}>
27.33/27.38	
27.33/27.38	Fresh variables:
27.33/27.38	undef4, undef8, undef20, undef24, undef28, undef29, undef30, undef31, undef32, 
27.33/27.38	
27.33/27.38	Undef variables:
27.33/27.38	undef4, undef8, undef20, undef24, undef28, undef29, undef30, undef31, undef32, 
27.33/27.38	
27.33/27.38	Abstraction variables:
27.33/27.38	
27.33/27.38	Exit nodes:
27.33/27.38	
27.33/27.38	Accepting locations:
27.33/27.38	
27.33/27.38	Asserts:
27.33/27.38	
27.33/27.38	*************************************************************
27.33/27.38	*******************************************************************************************
27.33/27.38	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
27.33/27.38	*******************************************************************************************
27.33/27.38	
27.33/27.38	Init Location: 0
27.33/27.38	Graph 0:
27.33/27.38	Transitions:
27.33/27.38	Variables:
27.33/27.38	
27.33/27.38	Graph 1:
27.33/27.38	Transitions:
27.33/27.38	<l2, l2, arg2 <= arg1 /\ 2 <= arg1 /\ 5 <= arg2 /\ arg1 = arg3, {arg1 -> -1 + arg1, arg2 -> -1 + arg2, arg3 -> -1 + arg1, rest remain the same}>
27.33/27.38	<l2, l2, 1 + arg1 <= arg2 /\ 1 <= arg1 /\ 2 + arg1 <= 2*arg2 /\ 2 <= arg2 /\ arg1 = arg3, {arg1 -> 1 + arg1, arg2 -> -1 + arg2, arg3 -> 1 + arg1, rest remain the same}>
27.33/27.38	<l2, l2, arg2 <= arg1 /\ 0 <= arg2 /\ 1 <= arg1 /\ arg1 <= 4 + arg2 /\ arg2 <= 4 /\ arg1 = arg3, {arg1 -> -1 + arg1, arg2 -> 2 + arg2, arg3 -> -1 + arg1, rest remain the same}>
27.33/27.38	<l2, l2, 0 <= arg2 /\ 1 <= arg1 /\ 5 + arg2 <= arg1 /\ arg2 <= 4 /\ arg1 = arg3, {arg2 -> 1 + arg2, arg3 -> arg1, rest remain the same}>
27.33/27.38	Variables:
27.33/27.38	arg1, arg2, arg3
27.33/27.38	
27.33/27.38	Precedence: 
27.33/27.38	Graph 0
27.33/27.38	
27.33/27.38	Graph 1
27.33/27.38	<l0, l2, 0 <= undef30 /\ 1 <= undef29 /\ arg1 = undef30 /\ arg2 = undef30 /\ arg3 = undef30, {all remain the same}>
27.33/27.38	
27.33/27.38	Map Locations to Subgraph:
27.33/27.38	( 0 , 0 )
27.33/27.38	( 2 , 1 )
27.33/27.38	
27.33/27.38	*******************************************************************************************
27.33/27.38	********************************    CHECKING ASSERTIONS    ********************************
27.33/27.38	*******************************************************************************************
27.33/27.38	
27.33/27.38	Proving termination of subgraph 0
27.33/27.38	Proving termination of subgraph 1
27.33/27.38	Checking unfeasibility...
27.33/27.38	Time used: 0.023984
27.33/27.38	Some transition disabled by a set of invariant(s):
27.33/27.38	Invariant at l2: arg3 <= 1 + arg2
27.33/27.38	
27.33/27.38	Strengthening and disabling transitions...
27.33/27.38	> It's unfeasible. Removing transition: 
27.33/27.38	<l2, l2, 0 <= arg2 /\ 1 <= arg1 /\ 5 + arg2 <= arg1 /\ arg2 <= 4 /\ arg1 = arg3, {arg2 -> 1 + arg2, arg3 -> arg1, rest remain the same}>
27.33/27.38	
27.33/27.38	LOG: CALL solverLinear in Graph for feasibility
27.33/27.38	
27.33/27.38	LOG: RETURN solveLinear in Graph for feasibility
27.33/27.38	Strengthening transition (result): 
27.33/27.38	<l2, l2, arg2 <= arg1 /\ arg3 <= 1 + arg2 /\ 2 <= arg1 /\ 5 <= arg2 /\ arg1 = arg3, {arg1 -> -1 + arg1, arg2 -> -1 + arg2, arg3 -> -1 + arg1, rest remain the same}>
27.33/27.38	
27.33/27.38	LOG: CALL solverLinear in Graph for feasibility
27.33/27.38	
27.33/27.38	LOG: RETURN solveLinear in Graph for feasibility
27.33/27.38	Strengthening transition (result): 
27.33/27.38	<l2, l2, 1 + arg1 <= arg2 /\ 1 <= arg1 /\ arg3 <= 1 + arg2 /\ 2 + arg1 <= 2*arg2 /\ 2 <= arg2 /\ arg1 = arg3, {arg1 -> 1 + arg1, arg2 -> -1 + arg2, arg3 -> 1 + arg1, rest remain the same}>
27.33/27.38	
27.33/27.38	LOG: CALL solverLinear in Graph for feasibility
27.33/27.38	
27.33/27.38	LOG: RETURN solveLinear in Graph for feasibility
27.33/27.38	Strengthening transition (result): 
27.33/27.38	<l2, l2, arg2 <= arg1 /\ 0 <= arg2 /\ 1 <= arg1 /\ arg3 <= 1 + arg2 /\ arg1 <= 4 + arg2 /\ arg2 <= 4 /\ arg1 = arg3, {arg1 -> -1 + arg1, arg2 -> 2 + arg2, arg3 -> -1 + arg1, rest remain the same}>
27.33/27.38	Checking unfeasibility...
27.33/27.38	Time used: 0.108491
27.33/27.38	
27.33/27.38	Checking conditional termination of SCC {l2}...
27.33/27.38	
27.33/27.38	LOG: CALL solveLinear
27.33/27.38	
27.33/27.38	LOG: RETURN solveLinear - Elapsed time: 0.002805s
27.33/27.38	
27.33/27.38	LOG: CALL solveLinear
27.33/27.38	
27.33/27.38	LOG: RETURN solveLinear - Elapsed time: 0.398477s
27.33/27.38	Trying to remove transition: <l2, l2, arg2 <= arg1 /\ 0 <= arg2 /\ 1 <= arg1 /\ arg3 <= 1 + arg2 /\ arg1 <= 4 + arg2 /\ arg2 <= 4 /\ arg1 = arg3, {arg1 -> -1 + arg1, arg2 -> 2 + arg2, arg3 -> -1 + arg1, rest remain the same}>
27.33/27.38	Solving with 1 template(s).
27.33/27.38	
27.33/27.38	LOG: CALL solveNonLinearGetFirstSolution
27.33/27.38	
27.33/27.38	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001497s
27.33/27.38	Time used: 4.00021
27.33/27.38	Trying to remove transition: <l2, l2, 1 + arg1 <= arg2 /\ 1 <= arg1 /\ arg3 <= 1 + arg2 /\ 2 + arg1 <= 2*arg2 /\ 2 <= arg2 /\ arg1 = arg3, {arg1 -> 1 + arg1, arg2 -> -1 + arg2, arg3 -> 1 + arg1, rest remain the same}>
27.33/27.38	Solving with 1 template(s).
27.33/27.38	
27.33/27.38	LOG: CALL solveNonLinearGetFirstSolution
27.33/27.38	
27.33/27.38	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.138506s
27.33/27.38	Time used: 1.12363
27.33/27.38	Trying to remove transition: <l2, l2, arg2 <= arg1 /\ arg3 <= 1 + arg2 /\ 2 <= arg1 /\ 5 <= arg2 /\ arg1 = arg3, {arg1 -> -1 + arg1, arg2 -> -1 + arg2, arg3 -> -1 + arg1, rest remain the same}>
27.33/27.38	Solving with 1 template(s).
27.33/27.38	
27.33/27.38	LOG: CALL solveNonLinearGetFirstSolution
27.33/27.38	
27.33/27.38	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.003506s
27.33/27.38	Time used: 4.00018
27.33/27.38	Solving with 1 template(s).
27.33/27.38	
27.33/27.38	LOG: CALL solveNonLinearGetFirstSolution
27.33/27.38	
27.33/27.38	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.020726s
27.33/27.38	Time used: 4.00009
27.33/27.38	Solving with 2 template(s).
27.33/27.38	
27.33/27.38	LOG: CALL solveNonLinearGetFirstSolution
27.33/27.38	
27.33/27.38	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.016175s
27.33/27.38	Time used: 4.00024
27.33/27.38	Solving with 3 template(s).
27.33/27.38	
27.33/27.38	LOG: CALL solveNonLinearGetFirstSolution
27.33/27.38	
27.33/27.38	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.033623s
27.33/27.38	Time used: 1.00007
27.33/27.38	Solving with 1 template(s).
27.33/27.38	
27.33/27.38	LOG: CALL solveNonLinearGetFirstSolution
27.33/27.38	
27.33/27.38	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.032482s
27.33/27.38	Time used: 4.00012
27.33/27.38	Termination failed. Trying to show unreachability...
27.33/27.38	Proving unreachability of entry: <l0, l2, 0 <= undef30 /\ 1 <= undef29 /\ arg1 = undef30 /\ arg2 = undef30 /\ arg3 = undef30, {all remain the same}>
27.33/27.38	
27.33/27.38	LOG: CALL check - Post:1 <= 0 - Process 1
27.33/27.38	* Exit transition: <l0, l2, 0 <= undef30 /\ 1 <= undef29 /\ arg1 = undef30 /\ arg2 = undef30 /\ arg3 = undef30, {all remain the same}>
27.33/27.38	* Postcondition  : 1 <= 0
27.33/27.38	
27.33/27.38	LOG: CALL solveLinear
27.33/27.38	
27.33/27.38	LOG: RETURN solveLinear - Elapsed time: 0.017836s
27.33/27.38	> Postcondition is not implied!
27.33/27.38	
27.33/27.38	LOG: RETURN check - Elapsed time: 0.018014s
27.33/27.38	Cannot prove unreachability
27.33/27.38	
27.33/27.38	Proving non-termination of subgraph 1
27.33/27.38	Transitions:
27.33/27.38	<l2, l2, arg2 <= arg1 /\ arg3 <= 1 + arg2 /\ 2 <= arg1 /\ 5 <= arg2 /\ arg1 = arg3, {arg1 -> -1 + arg1, arg2 -> -1 + arg2, arg3 -> -1 + arg1, rest remain the same}>
27.33/27.38	<l2, l2, 1 + arg1 <= arg2 /\ 1 <= arg1 /\ arg3 <= 1 + arg2 /\ 2 + arg1 <= 2*arg2 /\ 2 <= arg2 /\ arg1 = arg3, {arg1 -> 1 + arg1, arg2 -> -1 + arg2, arg3 -> 1 + arg1, rest remain the same}>
27.33/27.38	<l2, l2, arg2 <= arg1 /\ 0 <= arg2 /\ 1 <= arg1 /\ arg3 <= 1 + arg2 /\ arg1 <= 4 + arg2 /\ arg2 <= 4 /\ arg1 = arg3, {arg1 -> -1 + arg1, arg2 -> 2 + arg2, arg3 -> -1 + arg1, rest remain the same}>
27.33/27.38	Variables:
27.33/27.38	arg1, arg2, arg3
27.33/27.38	
27.33/27.38	Checking conditional non-termination of SCC {l2}...
27.33/27.38	EXIT TRANSITIONS:
27.33/27.38	<l2, end, arg2 <= arg1 /\ 1 + arg3 <= arg1 /\ arg3 <= 1 + arg2 /\ 2 <= arg1 /\ 5 <= arg2, {all remain the same}>
27.33/27.38	<l2, end, arg2 <= arg1 /\ 1 + arg1 <= arg3 /\ arg3 <= 1 + arg2 /\ 2 <= arg1 /\ 5 <= arg2, {all remain the same}>
27.33/27.38	<l2, end, arg2 <= arg1 /\ 1 + arg3 <= arg1 /\ 2*arg2 <= 1 + arg1 /\ arg3 <= 1 + arg2 /\ 2 <= arg1 /\ 2 <= arg2 /\ arg2 <= 4, {all remain the same}>
27.33/27.38	<l2, end, arg2 <= arg1 /\ 1 + arg3 <= arg1 /\ 2*arg2 <= 1 + arg1 /\ arg2 <= 1 /\ arg3 <= 1 + arg2 /\ 2 <= arg1, {all remain the same}>
27.33/27.38	<l2, end, arg2 <= arg1 /\ 1 + arg3 <= arg1 /\ arg3 <= 1 + arg2 /\ 2 + arg1 <= 2*arg2 /\ 2 <= arg1 /\ 2 <= arg2 /\ arg1 <= 4 + arg2 /\ arg2 <= 4, {all remain the same}>
27.33/27.38	<l2, end, arg2 <= arg1 /\ 1 + arg1 <= arg3 /\ arg3 <= 1 + arg2 /\ 2 + arg1 <= 2*arg2 /\ 2 <= arg1 /\ 2 <= arg2 /\ arg1 <= 4 + arg2 /\ arg2 <= 4, {all remain the same}>
27.33/27.38	<l2, end, arg2 <= arg1 /\ 0 <= arg2 /\ 1 + arg3 <= arg1 /\ arg1 <= 1 /\ 2*arg2 <= 1 + arg1 /\ arg2 <= 1 /\ arg3 <= 1 + arg2 /\ arg1 <= 4 + arg2, {all remain the same}>
27.33/27.38	<l2, end, arg2 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 + arg2 <= 0 /\ arg1 <= 1 /\ 2*arg2 <= 1 + arg1 /\ arg3 <= 1 + arg2, {all remain the same}>
27.33/27.38	<l2, end, arg1 <= 0 /\ arg2 <= arg1 /\ 0 <= arg2 /\ 2*arg2 <= 1 + arg1 /\ arg2 <= 1 /\ arg3 <= 1 + arg2 /\ arg1 <= 4 + arg2 /\ arg1 = arg3, {all remain the same}>
27.33/27.38	<l2, end, arg1 <= 0 /\ arg2 <= arg1 /\ 1 + arg2 <= 0 /\ 2*arg2 <= 1 + arg1 /\ arg3 <= 1 + arg2 /\ arg1 = arg3, {all remain the same}>
27.33/27.38	<l2, end, arg2 <= arg1 /\ 0 <= arg2 /\ 1 + arg1 <= arg3 /\ arg1 <= 1 /\ 2*arg2 <= 1 + arg1 /\ arg2 <= 1 /\ arg3 <= 1 + arg2 /\ arg1 <= 4 + arg2, {all remain the same}>
27.33/27.38	<l2, end, arg2 <= arg1 /\ 1 + arg1 <= arg3 /\ 1 + arg2 <= 0 /\ arg1 <= 1 /\ 2*arg2 <= 1 + arg1 /\ arg3 <= 1 + arg2, {all remain the same}>
27.33/27.38	<l2, end, 1 + arg1 <= arg2 /\ 1 + arg3 <= arg1 /\ arg3 <= 1 + arg2 /\ 2 + arg1 <= 2*arg2 /\ 2 <= arg1 /\ 2 <= arg2, {all remain the same}>
27.33/27.38	<l2, end, 1 + arg1 <= arg2 /\ 1 + arg1 <= arg3 /\ arg3 <= 1 + arg2 /\ 2 + arg1 <= 2*arg2 /\ 2 <= arg1 /\ 2 <= arg2, {all remain the same}>
27.33/27.38	<l2, end, 1 + arg1 <= arg2 /\ 1 + arg3 <= arg1 /\ arg1 <= 1 /\ arg3 <= 1 + arg2 /\ 2 + arg1 <= 2*arg2 /\ 5 <= arg2, {all remain the same}>
27.33/27.38	<l2, end, arg1 <= 0 /\ 1 + arg1 <= arg2 /\ arg3 <= 1 + arg2 /\ 2 + arg1 <= 2*arg2 /\ 5 <= arg2 /\ arg1 = arg3, {all remain the same}>
27.33/27.38	<l2, end, 1 + arg1 <= arg2 /\ 1 + arg1 <= arg3 /\ arg1 <= 1 /\ arg3 <= 1 + arg2 /\ 2 + arg1 <= 2*arg2 /\ 5 <= arg2, {all remain the same}>
27.33/27.38	<l2, end, 1 + arg1 <= arg2 /\ 1 + arg3 <= arg1 /\ arg3 <= 1 + arg2 /\ 2 + arg1 <= 2*arg2 /\ 2 <= arg2 /\ arg2 <= 4 /\ arg1 = 1, {all remain the same}>
27.33/27.38	<l2, end, arg1 <= 0 /\ 1 + arg1 <= arg2 /\ 1 + arg3 <= arg1 /\ 2*arg2 <= 1 + arg1 /\ arg2 <= 1 /\ arg3 <= 1 + arg2, {all remain the same}>
27.33/27.38	<l2, end, arg1 <= 0 /\ 1 + arg1 <= arg2 /\ 1 + arg3 <= arg1 /\ arg3 <= 1 + arg2 /\ 2 + arg1 <= 2*arg2 /\ 2 <= arg2 /\ arg2 <= 4, {all remain the same}>
27.33/27.38	<l2, end, arg1 <= 0 /\ 1 + arg1 <= arg2 /\ 1 + arg3 <= arg1 /\ arg2 <= 1 /\ arg3 <= 1 + arg2 /\ 2 + arg1 <= 2*arg2, {all remain the same}>
27.33/27.38	<l2, end, arg1 <= 0 /\ 1 + arg1 <= arg2 /\ 2*arg2 <= 1 + arg1 /\ arg2 <= 1 /\ arg3 <= 1 + arg2 /\ arg1 = arg3, {all remain the same}>
27.33/27.38	<l2, end, arg1 <= 0 /\ 1 + arg1 <= arg2 /\ arg3 <= 1 + arg2 /\ 2 + arg1 <= 2*arg2 /\ 2 <= arg2 /\ arg2 <= 4 /\ arg1 = arg3, {all remain the same}>
27.33/27.38	<l2, end, arg1 <= 0 /\ 1 + arg1 <= arg2 /\ arg2 <= 1 /\ arg3 <= 1 + arg2 /\ 2 + arg1 <= 2*arg2 /\ arg1 = arg3, {all remain the same}>
27.33/27.38	<l2, end, 1 + arg1 <= arg2 /\ 1 + arg1 <= arg3 /\ arg3 <= 1 + arg2 /\ 2 + arg1 <= 2*arg2 /\ 2 <= arg2 /\ arg2 <= 4 /\ arg1 = 1, {all remain the same}>
27.33/27.38	<l2, end, arg1 <= 0 /\ 1 + arg1 <= arg2 /\ 1 + arg1 <= arg3 /\ 2*arg2 <= 1 + arg1 /\ arg2 <= 1 /\ arg3 <= 1 + arg2, {all remain the same}>
27.33/27.38	<l2, end, arg1 <= 0 /\ 1 + arg1 <= arg2 /\ 1 + arg1 <= arg3 /\ arg3 <= 1 + arg2 /\ 2 + arg1 <= 2*arg2 /\ 2 <= arg2 /\ arg2 <= 4, {all remain the same}>
27.33/27.38	<l2, end, arg1 <= 0 /\ 1 + arg1 <= arg2 /\ 1 + arg1 <= arg3 /\ arg2 <= 1 /\ arg3 <= 1 + arg2 /\ 2 + arg1 <= 2*arg2, {all remain the same}>
27.33/27.38	
27.33/27.38	Solving with 1 template(s).
27.33/27.38	
27.33/27.38	LOG: CALL solveNonLinearGetFirstSolution
27.33/27.38	
27.33/27.38	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.667760s
27.33/27.38	Time used: 0.665399
27.33/27.38	Improving Solution with cost 40 ...
27.33/27.38	
27.33/27.38	LOG: CALL solveNonLinearGetNextSolution
27.33/27.38	
27.33/27.38	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001545s
27.33/27.38	Time used: 1.0015
27.33/27.38	
27.33/27.38	LOG: SAT solveNonLinear - Elapsed time: 1.669306s
27.33/27.38	Cost: 40; Total time: 1.6669
27.33/27.38	Non-termination implied by a set of quasi-invariant(s):
27.33/27.38	Quasi-invariant at l2: arg1 <= arg3
27.33/27.38	
27.33/27.38	Strengthening and disabling EXIT transitions...
27.33/27.38	Closed exits from l2: 12
27.33/27.38	Strengthening exit transition (result): 
27.33/27.38	<l2, end, arg2 <= arg1 /\ 1 + arg1 <= arg3 /\ arg3 <= 1 + arg2 /\ 2 <= arg1 /\ 5 <= arg2, {all remain the same}>
27.33/27.38	Strengthening exit transition (result): 
27.33/27.38	<l2, end, arg2 <= arg1 /\ 1 + arg1 <= arg3 /\ arg3 <= 1 + arg2 /\ 2 + arg1 <= 2*arg2 /\ 2 <= arg1 /\ 2 <= arg2 /\ arg1 <= 4 + arg2 /\ arg2 <= 4, {all remain the same}>
27.33/27.38	Strengthening exit transition (result): 
27.33/27.38	<l2, end, arg1 <= 0 /\ arg2 <= arg1 /\ 0 <= arg2 /\ 2*arg2 <= 1 + arg1 /\ arg2 <= 1 /\ arg3 <= 1 + arg2 /\ arg1 <= 4 + arg2 /\ arg1 = arg3, {all remain the same}>
27.33/27.38	Strengthening exit transition (result): 
27.33/27.38	<l2, end, arg1 <= 0 /\ arg2 <= arg1 /\ 1 + arg2 <= 0 /\ 2*arg2 <= 1 + arg1 /\ arg3 <= 1 + arg2 /\ arg1 = arg3, {all remain the same}>
27.33/27.38	Strengthening exit transition (result): 
27.33/27.38	<l2, end, arg2 <= arg1 /\ 0 <= arg2 /\ 1 + arg1 <= arg3 /\ arg1 <= 1 /\ 2*arg2 <= 1 + arg1 /\ arg2 <= 1 /\ arg3 <= 1 + arg2 /\ arg1 <= 4 + arg2, {all remain the same}>
27.33/27.38	Strengthening exit transition (result): 
27.33/27.38	<l2, end, arg2 <= arg1 /\ 1 + arg1 <= arg3 /\ 1 + arg2 <= 0 /\ arg1 <= 1 /\ 2*arg2 <= 1 + arg1 /\ arg3 <= 1 + arg2, {all remain the same}>
27.33/27.38	Strengthening exit transition (result): 
27.33/27.38	<l2, end, 1 + arg1 <= arg2 /\ 1 + arg1 <= arg3 /\ arg3 <= 1 + arg2 /\ 2 + arg1 <= 2*arg2 /\ 2 <= arg1 /\ 2 <= arg2, {all remain the same}>
27.33/27.38	Strengthening exit transition (result): 
27.33/27.38	<l2, end, arg1 <= 0 /\ 1 + arg1 <= arg2 /\ arg3 <= 1 + arg2 /\ 2 + arg1 <= 2*arg2 /\ 5 <= arg2 /\ arg1 = arg3, {all remain the same}>
27.33/27.38	Strengthening exit transition (result): 
27.33/27.38	<l2, end, 1 + arg1 <= arg2 /\ 1 + arg1 <= arg3 /\ arg1 <= 1 /\ arg3 <= 1 + arg2 /\ 2 + arg1 <= 2*arg2 /\ 5 <= arg2, {all remain the same}>
27.33/27.38	Strengthening exit transition (result): 
27.33/27.38	<l2, end, arg1 <= 0 /\ 1 + arg1 <= arg2 /\ 2*arg2 <= 1 + arg1 /\ arg2 <= 1 /\ arg3 <= 1 + arg2 /\ arg1 = arg3, {all remain the same}>
27.33/27.38	Strengthening exit transition (result): 
27.33/27.38	<l2, end, arg1 <= 0 /\ 1 + arg1 <= arg2 /\ arg3 <= 1 + arg2 /\ 2 + arg1 <= 2*arg2 /\ 2 <= arg2 /\ arg2 <= 4 /\ arg1 = arg3, {all remain the same}>
27.33/27.38	Strengthening exit transition (result): 
27.33/27.38	<l2, end, arg1 <= 0 /\ 1 + arg1 <= arg2 /\ arg2 <= 1 /\ arg3 <= 1 + arg2 /\ 2 + arg1 <= 2*arg2 /\ arg1 = arg3, {all remain the same}>
27.33/27.38	Strengthening exit transition (result): 
27.33/27.38	<l2, end, 1 + arg1 <= arg2 /\ 1 + arg1 <= arg3 /\ arg3 <= 1 + arg2 /\ 2 + arg1 <= 2*arg2 /\ 2 <= arg2 /\ arg2 <= 4 /\ arg1 = 1, {all remain the same}>
27.33/27.38	Strengthening exit transition (result): 
27.33/27.38	<l2, end, arg1 <= 0 /\ 1 + arg1 <= arg2 /\ 1 + arg1 <= arg3 /\ 2*arg2 <= 1 + arg1 /\ arg2 <= 1 /\ arg3 <= 1 + arg2, {all remain the same}>
27.33/27.38	Strengthening exit transition (result): 
27.33/27.38	<l2, end, arg1 <= 0 /\ 1 + arg1 <= arg2 /\ 1 + arg1 <= arg3 /\ arg3 <= 1 + arg2 /\ 2 + arg1 <= 2*arg2 /\ 2 <= arg2 /\ arg2 <= 4, {all remain the same}>
27.33/27.38	Strengthening exit transition (result): 
27.33/27.38	<l2, end, arg1 <= 0 /\ 1 + arg1 <= arg2 /\ 1 + arg1 <= arg3 /\ arg2 <= 1 /\ arg3 <= 1 + arg2 /\ 2 + arg1 <= 2*arg2, {all remain the same}>
27.33/27.38	
27.33/27.38	Strengthening and disabling transitions...
27.33/27.38	
27.33/27.38	LOG: CALL solverLinear in Graph for feasibility
27.33/27.38	
27.33/27.38	LOG: RETURN solveLinear in Graph for feasibility
27.33/27.38	Strengthening transition (result): 
27.33/27.38	<l2, l2, arg2 <= arg1 /\ arg3 <= 1 + arg2 /\ 2 <= arg1 /\ 5 <= arg2 /\ arg1 = arg3, {arg1 -> -1 + arg1, arg2 -> -1 + arg2, arg3 -> -1 + arg1, rest remain the same}>
27.33/27.38	
27.33/27.38	LOG: CALL solverLinear in Graph for feasibility
27.33/27.38	
27.33/27.38	LOG: RETURN solveLinear in Graph for feasibility
27.33/27.38	Strengthening transition (result): 
27.33/27.38	<l2, l2, 1 + arg1 <= arg2 /\ 1 <= arg1 /\ arg3 <= 1 + arg2 /\ 2 + arg1 <= 2*arg2 /\ 2 <= arg2 /\ arg1 = arg3, {arg1 -> 1 + arg1, arg2 -> -1 + arg2, arg3 -> 1 + arg1, rest remain the same}>
27.33/27.38	
27.33/27.38	LOG: CALL solverLinear in Graph for feasibility
27.33/27.38	
27.33/27.38	LOG: RETURN solveLinear in Graph for feasibility
27.33/27.38	Strengthening transition (result): 
27.33/27.38	<l2, l2, arg2 <= arg1 /\ 0 <= arg2 /\ 1 <= arg1 /\ arg3 <= 1 + arg2 /\ arg1 <= 4 + arg2 /\ arg2 <= 4 /\ arg1 = arg3, {arg1 -> -1 + arg1, arg2 -> 2 + arg2, arg3 -> -1 + arg1, rest remain the same}>
27.33/27.38	
27.33/27.38	Checking conditional non-termination of SCC {l2}...
27.33/27.38	EXIT TRANSITIONS:
27.33/27.38	<l2, end, arg2 <= arg1 /\ 1 + arg1 <= arg3 /\ arg3 <= 1 + arg2 /\ 2 <= arg1 /\ 5 <= arg2, {all remain the same}>
27.33/27.38	<l2, end, arg2 <= arg1 /\ 1 + arg1 <= arg3 /\ arg3 <= 1 + arg2 /\ 2 + arg1 <= 2*arg2 /\ 2 <= arg1 /\ 2 <= arg2 /\ arg1 <= 4 + arg2 /\ arg2 <= 4, {all remain the same}>
27.33/27.38	<l2, end, arg1 <= 0 /\ arg2 <= arg1 /\ 0 <= arg2 /\ 2*arg2 <= 1 + arg1 /\ arg2 <= 1 /\ arg3 <= 1 + arg2 /\ arg1 <= 4 + arg2 /\ arg1 = arg3, {all remain the same}>
27.33/27.38	<l2, end, arg1 <= 0 /\ arg2 <= arg1 /\ 1 + arg2 <= 0 /\ 2*arg2 <= 1 + arg1 /\ arg3 <= 1 + arg2 /\ arg1 = arg3, {all remain the same}>
27.33/27.38	<l2, end, arg2 <= arg1 /\ 0 <= arg2 /\ 1 + arg1 <= arg3 /\ arg1 <= 1 /\ 2*arg2 <= 1 + arg1 /\ arg2 <= 1 /\ arg3 <= 1 + arg2 /\ arg1 <= 4 + arg2, {all remain the same}>
27.33/27.38	<l2, end, arg2 <= arg1 /\ 1 + arg1 <= arg3 /\ 1 + arg2 <= 0 /\ arg1 <= 1 /\ 2*arg2 <= 1 + arg1 /\ arg3 <= 1 + arg2, {all remain the same}>
27.33/27.38	<l2, end, 1 + arg1 <= arg2 /\ 1 + arg1 <= arg3 /\ arg3 <= 1 + arg2 /\ 2 + arg1 <= 2*arg2 /\ 2 <= arg1 /\ 2 <= arg2, {all remain the same}>
27.33/27.38	<l2, end, arg1 <= 0 /\ 1 + arg1 <= arg2 /\ arg3 <= 1 + arg2 /\ 2 + arg1 <= 2*arg2 /\ 5 <= arg2 /\ arg1 = arg3, {all remain the same}>
27.33/27.38	<l2, end, 1 + arg1 <= arg2 /\ 1 + arg1 <= arg3 /\ arg1 <= 1 /\ arg3 <= 1 + arg2 /\ 2 + arg1 <= 2*arg2 /\ 5 <= arg2, {all remain the same}>
27.33/27.38	<l2, end, arg1 <= 0 /\ 1 + arg1 <= arg2 /\ 2*arg2 <= 1 + arg1 /\ arg2 <= 1 /\ arg3 <= 1 + arg2 /\ arg1 = arg3, {all remain the same}>
27.33/27.38	<l2, end, arg1 <= 0 /\ 1 + arg1 <= arg2 /\ arg3 <= 1 + arg2 /\ 2 + arg1 <= 2*arg2 /\ 2 <= arg2 /\ arg2 <= 4 /\ arg1 = arg3, {all remain the same}>
27.33/27.38	<l2, end, arg1 <= 0 /\ 1 + arg1 <= arg2 /\ arg2 <= 1 /\ arg3 <= 1 + arg2 /\ 2 + arg1 <= 2*arg2 /\ arg1 = arg3, {all remain the same}>
27.33/27.38	<l2, end, 1 + arg1 <= arg2 /\ 1 + arg1 <= arg3 /\ arg3 <= 1 + arg2 /\ 2 + arg1 <= 2*arg2 /\ 2 <= arg2 /\ arg2 <= 4 /\ arg1 = 1, {all remain the same}>
27.33/27.38	<l2, end, arg1 <= 0 /\ 1 + arg1 <= arg2 /\ 1 + arg1 <= arg3 /\ 2*arg2 <= 1 + arg1 /\ arg2 <= 1 /\ arg3 <= 1 + arg2, {all remain the same}>
27.33/27.38	<l2, end, arg1 <= 0 /\ 1 + arg1 <= arg2 /\ 1 + arg1 <= arg3 /\ arg3 <= 1 + arg2 /\ 2 + arg1 <= 2*arg2 /\ 2 <= arg2 /\ arg2 <= 4, {all remain the same}>
27.33/27.38	<l2, end, arg1 <= 0 /\ 1 + arg1 <= arg2 /\ 1 + arg1 <= arg3 /\ arg2 <= 1 /\ arg3 <= 1 + arg2 /\ 2 + arg1 <= 2*arg2, {all remain the same}>
27.33/27.38	
27.33/27.38	Solving with 1 template(s).
27.33/27.38	
27.33/27.38	LOG: CALL solveNonLinearGetFirstSolution
27.33/27.38	
27.33/27.38	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.185888s
27.33/27.38	Time used: 0.185272
27.33/27.38	Improving Solution with cost 15 ...
27.33/27.38	
27.33/27.38	LOG: CALL solveNonLinearGetNextSolution
27.33/27.38	
27.33/27.38	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001333s
27.33/27.38	Time used: 1.00129
27.33/27.38	
27.33/27.38	LOG: SAT solveNonLinear - Elapsed time: 1.187221s
27.33/27.38	Cost: 15; Total time: 1.18656
27.33/27.38	Non-termination implied by a set of quasi-invariant(s):
27.33/27.38	Quasi-invariant at l2: arg3 <= arg1
27.33/27.38	
27.33/27.38	Strengthening and disabling EXIT transitions...
27.33/27.38	Closed exits from l2: 10
27.33/27.38	Strengthening exit transition (result): 
27.33/27.38	<l2, end, arg1 <= 0 /\ arg2 <= arg1 /\ 0 <= arg2 /\ 2*arg2 <= 1 + arg1 /\ arg2 <= 1 /\ arg3 <= 1 + arg2 /\ arg1 <= 4 + arg2 /\ arg1 = arg3, {all remain the same}>
27.33/27.38	Strengthening exit transition (result): 
27.33/27.38	<l2, end, arg1 <= 0 /\ arg2 <= arg1 /\ 1 + arg2 <= 0 /\ 2*arg2 <= 1 + arg1 /\ arg3 <= 1 + arg2 /\ arg1 = arg3, {all remain the same}>
27.33/27.38	Strengthening exit transition (result): 
27.33/27.38	<l2, end, arg1 <= 0 /\ 1 + arg1 <= arg2 /\ arg3 <= 1 + arg2 /\ 2 + arg1 <= 2*arg2 /\ 5 <= arg2 /\ arg1 = arg3, {all remain the same}>
27.33/27.38	Strengthening exit transition (result): 
27.33/27.38	<l2, end, arg1 <= 0 /\ 1 + arg1 <= arg2 /\ 2*arg2 <= 1 + arg1 /\ arg2 <= 1 /\ arg3 <= 1 + arg2 /\ arg1 = arg3, {all remain the same}>
27.33/27.38	Strengthening exit transition (result): 
27.33/27.38	<l2, end, arg1 <= 0 /\ 1 + arg1 <= arg2 /\ arg3 <= 1 + arg2 /\ 2 + arg1 <= 2*arg2 /\ 2 <= arg2 /\ arg2 <= 4 /\ arg1 = arg3, {all remain the same}>
27.33/27.38	Strengthening exit transition (result): 
27.33/27.38	<l2, end, arg1 <= 0 /\ 1 + arg1 <= arg2 /\ arg2 <= 1 /\ arg3 <= 1 + arg2 /\ 2 + arg1 <= 2*arg2 /\ arg1 = arg3, {all remain the same}>
27.33/27.38	
27.33/27.38	Strengthening and disabling transitions...
27.33/27.38	
27.33/27.38	LOG: CALL solverLinear in Graph for feasibility
27.33/27.38	
27.33/27.38	LOG: RETURN solveLinear in Graph for feasibility
27.33/27.38	Strengthening transition (result): 
27.33/27.38	<l2, l2, arg2 <= arg1 /\ arg3 <= 1 + arg2 /\ 2 <= arg1 /\ 5 <= arg2 /\ arg1 = arg3, {arg1 -> -1 + arg1, arg2 -> -1 + arg2, arg3 -> -1 + arg1, rest remain the same}>
27.33/27.38	
27.33/27.38	LOG: CALL solverLinear in Graph for feasibility
27.33/27.38	
27.33/27.38	LOG: RETURN solveLinear in Graph for feasibility
27.33/27.38	Strengthening transition (result): 
27.33/27.38	<l2, l2, 1 + arg1 <= arg2 /\ 1 <= arg1 /\ arg3 <= 1 + arg2 /\ 2 + arg1 <= 2*arg2 /\ 2 <= arg2 /\ arg1 = arg3, {arg1 -> 1 + arg1, arg2 -> -1 + arg2, arg3 -> 1 + arg1, rest remain the same}>
27.33/27.38	
27.33/27.38	LOG: CALL solverLinear in Graph for feasibility
27.33/27.38	
27.33/27.38	LOG: RETURN solveLinear in Graph for feasibility
27.33/27.38	Strengthening transition (result): 
27.33/27.38	<l2, l2, arg2 <= arg1 /\ 0 <= arg2 /\ 1 <= arg1 /\ arg3 <= 1 + arg2 /\ arg1 <= 4 + arg2 /\ arg2 <= 4 /\ arg1 = arg3, {arg1 -> -1 + arg1, arg2 -> 2 + arg2, arg3 -> -1 + arg1, rest remain the same}>
27.33/27.38	
27.33/27.38	Checking conditional non-termination of SCC {l2}...
27.33/27.38	EXIT TRANSITIONS:
27.33/27.38	<l2, end, arg1 <= 0 /\ arg2 <= arg1 /\ 0 <= arg2 /\ 2*arg2 <= 1 + arg1 /\ arg2 <= 1 /\ arg3 <= 1 + arg2 /\ arg1 <= 4 + arg2 /\ arg1 = arg3, {all remain the same}>
27.33/27.38	<l2, end, arg1 <= 0 /\ arg2 <= arg1 /\ 1 + arg2 <= 0 /\ 2*arg2 <= 1 + arg1 /\ arg3 <= 1 + arg2 /\ arg1 = arg3, {all remain the same}>
27.33/27.38	<l2, end, arg1 <= 0 /\ 1 + arg1 <= arg2 /\ arg3 <= 1 + arg2 /\ 2 + arg1 <= 2*arg2 /\ 5 <= arg2 /\ arg1 = arg3, {all remain the same}>
27.33/27.38	<l2, end, arg1 <= 0 /\ 1 + arg1 <= arg2 /\ 2*arg2 <= 1 + arg1 /\ arg2 <= 1 /\ arg3 <= 1 + arg2 /\ arg1 = arg3, {all remain the same}>
27.33/27.38	<l2, end, arg1 <= 0 /\ 1 + arg1 <= arg2 /\ arg3 <= 1 + arg2 /\ 2 + arg1 <= 2*arg2 /\ 2 <= arg2 /\ arg2 <= 4 /\ arg1 = arg3, {all remain the same}>
27.33/27.38	<l2, end, arg1 <= 0 /\ 1 + arg1 <= arg2 /\ arg2 <= 1 /\ arg3 <= 1 + arg2 /\ 2 + arg1 <= 2*arg2 /\ arg1 = arg3, {all remain the same}>
27.33/27.38	
27.33/27.38	Solving with 1 template(s).
27.33/27.38	
27.33/27.38	LOG: CALL solveNonLinearGetFirstSolution
27.33/27.38	
27.33/27.38	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.041807s
27.33/27.38	Time used: 0.041433
27.33/27.38	Improving Solution with cost 9 ...
27.33/27.38	
27.33/27.38	LOG: CALL solveNonLinearGetNextSolution
27.33/27.38	
27.33/27.38	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.369739s
27.33/27.38	Time used: 0.369713
27.33/27.38	Improving Solution with cost 4 ...
27.33/27.38	
27.33/27.38	LOG: CALL solveNonLinearGetNextSolution
27.33/27.38	
27.33/27.38	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.009239s
27.33/27.38	Time used: 1.00147
27.33/27.38	
27.33/27.38	LOG: SAT solveNonLinear - Elapsed time: 1.420785s
27.33/27.38	Cost: 4; Total time: 1.41261
27.33/27.38	Failed at location 2: 5 + arg1 <= arg2 + 2*arg3
27.33/27.38	Before Improving: 
27.33/27.38	Quasi-invariant at l2: 5 + arg1 <= arg2 + 2*arg3
27.33/27.38	Optimizing invariants...
27.33/27.38	
27.33/27.38	LOG: CALL solveLinear
27.33/27.38	
27.33/27.38	LOG: RETURN solveLinear - Elapsed time: 0.014049s
27.33/27.38	Remaining time after improvement: 0.996424
27.33/27.38	Non-termination implied by a set of quasi-invariant(s):
27.33/27.38	Quasi-invariant at l2: 5 + arg1 <= arg2 + 2*arg3
27.33/27.38	
27.33/27.38	Strengthening and disabling EXIT transitions...
27.33/27.38	Closed exits from l2: 5
27.33/27.38	Strengthening exit transition (result): 
27.33/27.38	<l2, end, arg1 <= 0 /\ 1 + arg1 <= arg2 /\ arg3 <= 1 + arg2 /\ 2 + arg1 <= 2*arg2 /\ 5 + arg1 <= arg2 + 2*arg3 /\ 5 <= arg2 /\ arg1 = arg3, {all remain the same}>
27.33/27.38	
27.33/27.38	Strengthening and disabling transitions...
27.33/27.38	
27.33/27.38	LOG: CALL solverLinear in Graph for feasibility
27.33/27.38	
27.33/27.38	LOG: RETURN solveLinear in Graph for feasibility
27.33/27.38	Strengthening transition (result): 
27.33/27.38	<l2, l2, arg2 <= arg1 /\ arg3 <= 1 + arg2 /\ 2 <= arg1 /\ 5 + arg1 <= arg2 + 2*arg3 /\ 5 <= arg2 /\ arg1 = arg3, {arg1 -> -1 + arg1, arg2 -> -1 + arg2, arg3 -> -1 + arg1, rest remain the same}>
27.33/27.38	
27.33/27.38	LOG: CALL solverLinear in Graph for feasibility
27.33/27.38	
27.33/27.38	LOG: RETURN solveLinear in Graph for feasibility
27.33/27.38	Strengthening transition (result): 
27.33/27.38	<l2, l2, 1 + arg1 <= arg2 /\ 1 <= arg1 /\ arg3 <= 1 + arg2 /\ 2 + arg1 <= 2*arg2 /\ 2 <= arg2 /\ 5 + arg1 <= arg2 + 2*arg3 /\ arg1 = arg3, {arg1 -> 1 + arg1, arg2 -> -1 + arg2, arg3 -> 1 + arg1, rest remain the same}>
27.33/27.38	
27.33/27.38	LOG: CALL solverLinear in Graph for feasibility
27.33/27.38	
27.33/27.38	LOG: RETURN solveLinear in Graph for feasibility
27.33/27.38	Strengthening transition (result): 
27.33/27.38	<l2, l2, arg2 <= arg1 /\ 0 <= arg2 /\ 1 <= arg1 /\ arg3 <= 1 + arg2 /\ 5 + arg1 <= arg2 + 2*arg3 /\ arg1 <= 4 + arg2 /\ arg2 <= 4 /\ arg1 = arg3, {arg1 -> -1 + arg1, arg2 -> 2 + arg2, arg3 -> -1 + arg1, rest remain the same}>
27.33/27.38	
27.33/27.38	Checking conditional non-termination of SCC {l2}...
27.33/27.38	EXIT TRANSITIONS:
27.33/27.38	<l2, end, arg1 <= 0 /\ 1 + arg1 <= arg2 /\ arg3 <= 1 + arg2 /\ 2 + arg1 <= 2*arg2 /\ 5 + arg1 <= arg2 + 2*arg3 /\ 5 <= arg2 /\ arg1 = arg3, {all remain the same}>
27.33/27.38	
27.33/27.38	Solving with 1 template(s).
27.33/27.38	
27.33/27.38	LOG: CALL solveNonLinearGetFirstSolution
27.33/27.38	
27.33/27.38	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.017123s
27.33/27.38	Time used: 0.017014
27.33/27.38	
27.33/27.38	LOG: SAT solveNonLinear - Elapsed time: 0.017123s
27.33/27.38	Cost: 0; Total time: 0.017014
27.33/27.38	Non-termination implied by a set of quasi-invariant(s):
27.33/27.38	Quasi-invariant at l2: arg2 <= 1 + arg1 + arg3
27.33/27.38	
27.33/27.38	Strengthening and disabling EXIT transitions...
27.33/27.38	Closed exits from l2: 1
27.33/27.38	
27.33/27.38	Strengthening and disabling transitions...
27.33/27.38	
27.33/27.38	LOG: CALL solverLinear in Graph for feasibility
27.33/27.38	
27.33/27.38	LOG: RETURN solveLinear in Graph for feasibility
27.33/27.38	Strengthening transition (result): 
27.33/27.38	<l2, l2, arg2 <= arg1 /\ arg2 <= 1 + arg1 + arg3 /\ arg3 <= 1 + arg2 /\ 2 <= arg1 /\ 5 + arg1 <= arg2 + 2*arg3 /\ 5 <= arg2 /\ arg1 = arg3, {arg1 -> -1 + arg1, arg2 -> -1 + arg2, arg3 -> -1 + arg1, rest remain the same}>
27.33/27.38	
27.33/27.38	LOG: CALL solverLinear in Graph for feasibility
27.33/27.38	
27.33/27.38	LOG: RETURN solveLinear in Graph for feasibility
27.33/27.38	Strengthening transition (result): 
27.33/27.38	<l2, l2, 1 + arg1 <= arg2 /\ 1 <= arg1 /\ arg2 <= 1 + arg1 + arg3 /\ arg3 <= 1 + arg2 /\ 2 + arg1 <= 2*arg2 /\ 2 <= arg2 /\ 5 + arg1 <= arg2 + 2*arg3 /\ arg1 = arg3, {arg1 -> 1 + arg1, arg2 -> -1 + arg2, arg3 -> 1 + arg1, rest remain the same}>
27.33/27.38	
27.33/27.38	LOG: CALL solverLinear in Graph for feasibility
27.33/27.38	
27.33/27.38	LOG: RETURN solveLinear in Graph for feasibility
27.33/27.38	Strengthening transition (result): 
27.33/27.38	<l2, l2, arg2 <= arg1 /\ 0 <= arg2 /\ 1 <= arg1 /\ arg2 <= 1 + arg1 + arg3 /\ arg3 <= 1 + arg2 /\ 5 + arg1 <= arg2 + 2*arg3 /\ arg1 <= 4 + arg2 /\ arg2 <= 4 /\ arg1 = arg3, {arg1 -> -1 + arg1, arg2 -> 2 + arg2, arg3 -> -1 + arg1, rest remain the same}>
27.33/27.38	
27.33/27.38	Calling reachability with...
27.33/27.38	Transition: <l2, end, true, {all remain the same}>
27.33/27.38	Conditions: arg1 <= arg3, arg3 <= arg1, 5 + arg1 <= arg2 + 2*arg3, arg2 <= 1 + arg1 + arg3, 
27.33/27.38	OPEN EXITS: 
27.33/27.38	<l2, end, arg2 <= 1 + arg1 + arg3 /\ 5 + arg1 <= arg2 + 2*arg3 /\ arg1 = arg3, {all remain the same}>
27.33/27.38	
27.33/27.38	--- Reachability graph ---
27.33/27.38	> Graph without transitions.
27.33/27.38	
27.33/27.38	Calling reachability with...
27.33/27.38	Transition: <l0, l2, 0 <= undef30 /\ 1 <= undef29 /\ arg1 = undef30 /\ arg2 = undef30 /\ arg3 = undef30, {all remain the same}>
27.33/27.38	Conditions: arg2 <= 1 + arg1 + arg3, 5 + arg1 <= arg2 + 2*arg3, arg1 = arg3, 
27.33/27.38	OPEN EXITS: 
27.33/27.38	<l0, l2, 0 <= undef30 /\ 1 <= undef29 /\ arg2 <= 1 + arg1 + arg3 /\ 5 + arg1 <= arg2 + 2*arg3 /\ arg1 = arg3 /\ arg1 = undef30 /\ arg2 = undef30 /\ arg3 = undef30, {all remain the same}>
27.33/27.38	
27.33/27.38	> Conditions are reachable!
27.33/27.38	
27.33/27.38	Program does NOT terminate
27.33/27.38	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
27.33/27.38	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
27.33/27.38	EOF