27.25/27.32	NO
27.25/27.32	
27.25/27.33	Solver Timeout: 4
27.25/27.33	Global Timeout: 300
27.25/27.33	No parsing errors!
27.25/27.33	Init Location: 0
27.25/27.33	Transitions:
27.25/27.33	<l0, l6, true>
27.25/27.33	<l1, l2, (arg1 > 0) /\ (arg2 > ~(1)), par{arg1 -> 20, arg2 -> 0, arg3 -> arg2, arg4 -> undef4}>
27.25/27.33	<l2, l3, (arg3 > 0) /\ (arg3 < arg1) /\ (arg1 > ~(1)) /\ (arg2 < 0), par{arg3 -> (arg3 + 1), arg4 -> (arg1 - 2)}>
27.25/27.33	<l2, l3, (arg3 > 0) /\ (arg3 < arg1) /\ (arg1 > ~(1)) /\ (arg2 > 0), par{arg3 -> (arg3 + 1), arg4 -> (arg1 - 2)}>
27.25/27.33	<l2, l4, (arg1 > ~(1)) /\ (arg3 > 0) /\ (arg3 < arg1) /\ (0 = arg2), par{arg2 -> (arg3 - 1), arg3 -> (arg1 - 2), arg4 -> undef16}>
27.25/27.33	<l2, l5, (arg1 > 0) /\ (arg1 = arg3), par{arg2 -> (arg1 - 1), arg3 -> (arg1 - 2), arg4 -> undef20}>
27.25/27.33	<l3, l2, (arg4 > arg3), par{arg4 -> undef24}>
27.25/27.33	<l3, l2, (arg4 < arg3), par{arg4 -> undef28}>
27.25/27.33	<l4, l2, (arg3 > arg2), par{arg2 -> 0, arg3 -> arg2, arg4 -> undef32}>
27.25/27.33	<l4, l2, (arg3 < arg2), par{arg2 -> 0, arg3 -> arg2, arg4 -> undef36}>
27.25/27.33	<l5, l2, (arg3 > arg2), par{arg2 -> 0, arg3 -> arg2, arg4 -> undef40}>
27.25/27.33	<l5, l2, (arg3 < arg2), par{arg2 -> 0, arg3 -> arg2, arg4 -> undef44}>
27.25/27.33	<l2, l2, (arg1 > 0) /\ (arg1 < 3) /\ (0 = arg3), par{arg2 -> 1, arg3 -> 1, arg4 -> undef48}>
27.25/27.33	<l2, l2, (arg1 > 3) /\ (0 = arg3), par{arg2 -> 1, arg3 -> 1, arg4 -> undef52}>
27.25/27.33	<l3, l2, (arg3 = arg4), par{arg1 -> (arg1 - 1), arg4 -> undef56}>
27.25/27.33	<l2, l2, (0 = arg1) /\ (0 = arg3), par{arg1 -> 0, arg2 -> 0, arg3 -> ~(1), arg4 -> undef60}>
27.25/27.33	<l4, l2, (arg2 = arg3), par{arg1 -> (arg1 - 1), arg2 -> 0, arg3 -> arg2, arg4 -> undef64}>
27.25/27.33	<l5, l2, (arg2 = arg3), par{arg1 -> (arg1 - 1), arg2 -> 0, arg3 -> arg2, arg4 -> undef68}>
27.25/27.33	<l2, l2, (3 = arg1) /\ (0 = arg3), par{arg1 -> 2, arg2 -> 1, arg3 -> 1, arg4 -> undef72}>
27.25/27.33	<l6, l1, true, par{arg1 -> undef73, arg2 -> undef74, arg3 -> undef75, arg4 -> undef76}>
27.25/27.33	
27.25/27.33	Fresh variables:
27.25/27.33	undef4, undef16, undef20, undef24, undef28, undef32, undef36, undef40, undef44, undef48, undef52, undef56, undef60, undef64, undef68, undef72, undef73, undef74, undef75, undef76, 
27.25/27.33	
27.25/27.33	Undef variables:
27.25/27.33	undef4, undef16, undef20, undef24, undef28, undef32, undef36, undef40, undef44, undef48, undef52, undef56, undef60, undef64, undef68, undef72, undef73, undef74, undef75, undef76, 
27.25/27.33	
27.25/27.33	Abstraction variables:
27.25/27.33	
27.25/27.33	Exit nodes:
27.25/27.33	
27.25/27.33	Accepting locations:
27.25/27.33	
27.25/27.33	Asserts:
27.25/27.33	
27.25/27.33	Preprocessed LLVMGraph
27.25/27.33	Init Location: 0
27.25/27.33	Transitions:
27.25/27.33	<l0, l2, (arg1 = 20) /\ (arg2 = 0) /\ (arg3 = undef74) /\ (undef73 > 0) /\ (undef74 > ~(1))>
27.25/27.33	<l2, l2, (arg3 > 0) /\ (arg3 < arg1) /\ (arg1 > ~(1)) /\ (arg2 < 0) /\ ((arg1 - 2) > (arg3 + 1)), par{arg3 -> (arg3 + 1)}>
27.25/27.33	<l2, l2, (arg3 > 0) /\ (arg3 < arg1) /\ (arg1 > ~(1)) /\ (arg2 < 0) /\ ((arg1 - 2) < (arg3 + 1)), par{arg3 -> (arg3 + 1)}>
27.25/27.33	<l2, l2, (arg3 > 0) /\ (arg3 < arg1) /\ (arg1 > ~(1)) /\ (arg2 < 0) /\ ((arg3 + 1) = (arg1 - 2)), par{arg1 -> (arg1 - 1), arg3 -> (arg3 + 1)}>
27.25/27.33	<l2, l2, (arg3 > 0) /\ (arg3 < arg1) /\ (arg1 > ~(1)) /\ (arg2 > 0) /\ ((arg1 - 2) > (arg3 + 1)), par{arg3 -> (arg3 + 1)}>
27.25/27.33	<l2, l2, (arg3 > 0) /\ (arg3 < arg1) /\ (arg1 > ~(1)) /\ (arg2 > 0) /\ ((arg1 - 2) < (arg3 + 1)), par{arg3 -> (arg3 + 1)}>
27.25/27.33	<l2, l2, (arg3 > 0) /\ (arg3 < arg1) /\ (arg1 > ~(1)) /\ (arg2 > 0) /\ ((arg3 + 1) = (arg1 - 2)), par{arg1 -> (arg1 - 1), arg3 -> (arg3 + 1)}>
27.25/27.33	<l2, l2, (arg1 > ~(1)) /\ (arg3 > 0) /\ (arg3 < arg1) /\ (0 = arg2) /\ ((arg1 - 2) > (arg3 - 1)), par{arg2 -> 0, arg3 -> (arg3 - 1)}>
27.25/27.33	<l2, l2, (arg1 > ~(1)) /\ (arg3 > 0) /\ (arg3 < arg1) /\ (0 = arg2) /\ ((arg3 - 1) = (arg1 - 2)), par{arg1 -> (arg1 - 1), arg2 -> 0, arg3 -> (arg3 - 1)}>
27.25/27.33	<l2, l2, (arg1 > 0) /\ (arg1 = arg3) /\ ((arg1 - 2) < (arg1 - 1)), par{arg2 -> 0, arg3 -> (arg1 - 1)}>
27.25/27.33	<l2, l2, (arg1 > 0) /\ (arg1 < 3) /\ (0 = arg3), par{arg2 -> 1, arg3 -> 1}>
27.25/27.33	<l2, l2, (arg1 > 3) /\ (0 = arg3), par{arg2 -> 1, arg3 -> 1}>
27.25/27.33	<l2, l2, (0 = arg1) /\ (0 = arg3), par{arg1 -> 0, arg2 -> 0, arg3 -> ~(1)}>
27.25/27.33	<l2, l2, (3 = arg1) /\ (0 = arg3), par{arg1 -> 2, arg2 -> 1, arg3 -> 1}>
27.25/27.33	
27.25/27.33	Fresh variables:
27.25/27.33	undef4, undef16, undef20, undef24, undef28, undef32, undef36, undef40, undef44, undef48, undef52, undef56, undef60, undef64, undef68, undef72, undef73, undef74, undef75, undef76, 
27.25/27.33	
27.25/27.33	Undef variables:
27.25/27.33	undef4, undef16, undef20, undef24, undef28, undef32, undef36, undef40, undef44, undef48, undef52, undef56, undef60, undef64, undef68, undef72, undef73, undef74, undef75, undef76, 
27.25/27.33	
27.25/27.33	Abstraction variables:
27.25/27.33	
27.25/27.33	Exit nodes:
27.25/27.33	
27.25/27.33	Accepting locations:
27.25/27.33	
27.25/27.33	Asserts:
27.25/27.33	
27.25/27.33	*************************************************************
27.25/27.33	*******************************************************************************************
27.25/27.33	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
27.25/27.33	*******************************************************************************************
27.25/27.33	
27.25/27.33	Init Location: 0
27.25/27.33	Graph 0:
27.25/27.33	Transitions:
27.25/27.33	Variables:
27.25/27.33	
27.25/27.33	Graph 1:
27.25/27.33	Transitions:
27.25/27.33	<l2, l2, 0 <= arg1 /\ 1 + arg2 <= 0 /\ 1 <= arg3 /\ 4 + arg3 <= arg1, {arg3 -> 1 + arg3, rest remain the same}>
27.25/27.33	<l2, l2, 0 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 + arg2 <= 0 /\ 1 <= arg3 /\ arg1 <= 2 + arg3, {arg3 -> 1 + arg3, rest remain the same}>
27.25/27.33	<l2, l2, 0 <= arg1 /\ 1 + arg2 <= 0 /\ 1 <= arg3 /\ arg1 = 3 + arg3, {arg1 -> -1 + arg1, arg3 -> 1 + arg3, rest remain the same}>
27.25/27.33	<l2, l2, 0 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ 4 + arg3 <= arg1, {arg3 -> 1 + arg3, rest remain the same}>
27.25/27.33	<l2, l2, 0 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg1 <= 2 + arg3, {arg3 -> 1 + arg3, rest remain the same}>
27.25/27.33	<l2, l2, 0 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg1 = 3 + arg3, {arg1 -> -1 + arg1, arg3 -> 1 + arg3, rest remain the same}>
27.25/27.33	<l2, l2, 0 <= arg1 /\ 1 <= arg3 /\ 2 + arg3 <= arg1 /\ arg2 = 0, {arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
27.25/27.33	<l2, l2, 0 <= arg1 /\ 1 <= arg3 /\ arg2 = 0 /\ arg1 = 1 + arg3, {arg1 -> -1 + arg1, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
27.25/27.33	<l2, l2, 1 <= arg1 /\ arg1 = arg3, {arg2 -> 0, arg3 -> -1 + arg1, rest remain the same}>
27.25/27.33	<l2, l2, 1 <= arg1 /\ arg1 <= 2 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
27.25/27.33	<l2, l2, 4 <= arg1 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
27.25/27.33	<l2, l2, arg1 = 0 /\ arg3 = 0, {arg1 -> 0, arg2 -> 0, arg3 -> -1, rest remain the same}>
27.25/27.33	<l2, l2, arg3 = 0 /\ arg1 = 3, {arg1 -> 2, arg2 -> 1, arg3 -> 1, rest remain the same}>
27.25/27.33	Variables:
27.25/27.33	arg1, arg2, arg3
27.25/27.33	
27.25/27.33	Precedence: 
27.25/27.33	Graph 0
27.25/27.33	
27.25/27.33	Graph 1
27.25/27.33	<l0, l2, 0 <= undef74 /\ 1 <= undef73 /\ arg2 = 0 /\ arg3 = undef74 /\ arg1 = 20, {all remain the same}>
27.25/27.33	
27.25/27.33	Map Locations to Subgraph:
27.25/27.33	( 0 , 0 )
27.25/27.33	( 2 , 1 )
27.25/27.33	
27.25/27.33	*******************************************************************************************
27.25/27.33	********************************    CHECKING ASSERTIONS    ********************************
27.25/27.33	*******************************************************************************************
27.25/27.33	
27.25/27.33	Proving termination of subgraph 0
27.25/27.33	Proving termination of subgraph 1
27.25/27.33	Checking unfeasibility...
27.25/27.33	Time used: 0.109792
27.25/27.33	Some transition disabled by a set of invariant(s):
27.25/27.33	Invariant at l2: 1 <= arg1
27.25/27.33	
27.25/27.33	Strengthening and disabling transitions...
27.25/27.33	> It's unfeasible. Removing transition: 
27.25/27.33	<l2, l2, arg1 = 0 /\ arg3 = 0, {arg1 -> 0, arg2 -> 0, arg3 -> -1, rest remain the same}>
27.25/27.33	
27.25/27.33	LOG: CALL solverLinear in Graph for feasibility
27.25/27.33	
27.25/27.33	LOG: RETURN solveLinear in Graph for feasibility
27.25/27.33	Strengthening transition (result): 
27.25/27.33	<l2, l2, 1 <= arg1 /\ 1 + arg2 <= 0 /\ 1 <= arg3 /\ 4 + arg3 <= arg1, {arg3 -> 1 + arg3, rest remain the same}>
27.25/27.33	
27.25/27.33	LOG: CALL solverLinear in Graph for feasibility
27.25/27.33	
27.25/27.33	LOG: RETURN solveLinear in Graph for feasibility
27.25/27.33	Strengthening transition (result): 
27.25/27.33	<l2, l2, 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 + arg2 <= 0 /\ 1 <= arg3 /\ arg1 <= 2 + arg3, {arg3 -> 1 + arg3, rest remain the same}>
27.25/27.33	
27.25/27.33	LOG: CALL solverLinear in Graph for feasibility
27.25/27.33	
27.25/27.33	LOG: RETURN solveLinear in Graph for feasibility
27.25/27.33	Strengthening transition (result): 
27.25/27.33	<l2, l2, 1 <= arg1 /\ 1 + arg2 <= 0 /\ 1 <= arg3 /\ arg1 = 3 + arg3, {arg1 -> -1 + arg1, arg3 -> 1 + arg3, rest remain the same}>
27.25/27.33	
27.25/27.33	LOG: CALL solverLinear in Graph for feasibility
27.25/27.33	
27.25/27.33	LOG: RETURN solveLinear in Graph for feasibility
27.25/27.33	Strengthening transition (result): 
27.25/27.33	<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ 4 + arg3 <= arg1, {arg3 -> 1 + arg3, rest remain the same}>
27.25/27.33	
27.25/27.33	LOG: CALL solverLinear in Graph for feasibility
27.25/27.33	
27.25/27.33	LOG: RETURN solveLinear in Graph for feasibility
27.25/27.33	Strengthening transition (result): 
27.25/27.33	<l2, l2, 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg1 <= 2 + arg3, {arg3 -> 1 + arg3, rest remain the same}>
27.25/27.33	
27.25/27.33	LOG: CALL solverLinear in Graph for feasibility
27.25/27.33	
27.25/27.33	LOG: RETURN solveLinear in Graph for feasibility
27.25/27.33	Strengthening transition (result): 
27.25/27.33	<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg1 = 3 + arg3, {arg1 -> -1 + arg1, arg3 -> 1 + arg3, rest remain the same}>
27.25/27.33	
27.25/27.33	LOG: CALL solverLinear in Graph for feasibility
27.25/27.33	
27.25/27.33	LOG: RETURN solveLinear in Graph for feasibility
27.25/27.33	Strengthening transition (result): 
27.25/27.33	<l2, l2, 1 <= arg1 /\ 1 <= arg3 /\ 2 + arg3 <= arg1 /\ arg2 = 0, {arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
27.25/27.33	
27.25/27.33	LOG: CALL solverLinear in Graph for feasibility
27.25/27.33	
27.25/27.33	LOG: RETURN solveLinear in Graph for feasibility
27.25/27.33	Strengthening transition (result): 
27.25/27.33	<l2, l2, 1 <= arg1 /\ 1 <= arg3 /\ arg2 = 0 /\ arg1 = 1 + arg3, {arg1 -> -1 + arg1, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
27.25/27.33	
27.25/27.33	LOG: CALL solverLinear in Graph for feasibility
27.25/27.33	
27.25/27.33	LOG: RETURN solveLinear in Graph for feasibility
27.25/27.33	Strengthening transition (result): 
27.25/27.33	<l2, l2, 1 <= arg1 /\ arg1 = arg3, {arg2 -> 0, arg3 -> -1 + arg1, rest remain the same}>
27.25/27.33	
27.25/27.33	LOG: CALL solverLinear in Graph for feasibility
27.25/27.33	
27.25/27.33	LOG: RETURN solveLinear in Graph for feasibility
27.25/27.33	Strengthening transition (result): 
27.25/27.33	<l2, l2, 1 <= arg1 /\ arg1 <= 2 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
27.25/27.33	
27.25/27.33	LOG: CALL solverLinear in Graph for feasibility
27.25/27.33	
27.25/27.33	LOG: RETURN solveLinear in Graph for feasibility
27.25/27.33	Strengthening transition (result): 
27.25/27.33	<l2, l2, 4 <= arg1 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
27.25/27.33	
27.25/27.33	LOG: CALL solverLinear in Graph for feasibility
27.25/27.33	
27.25/27.33	LOG: RETURN solveLinear in Graph for feasibility
27.25/27.33	Strengthening transition (result): 
27.25/27.33	<l2, l2, arg3 = 0 /\ arg1 = 3, {arg1 -> 2, arg2 -> 1, arg3 -> 1, rest remain the same}>
27.25/27.33	Checking unfeasibility...
27.25/27.33	Time used: 0.073328
27.25/27.33	Some transition disabled by a set of invariant(s):
27.25/27.33	Invariant at l2: 0 <= arg2
27.25/27.33	
27.25/27.33	Strengthening and disabling transitions...
27.25/27.33	> It's unfeasible. Removing transition: 
27.25/27.33	<l2, l2, 1 <= arg1 /\ 1 + arg2 <= 0 /\ 1 <= arg3 /\ 4 + arg3 <= arg1, {arg3 -> 1 + arg3, rest remain the same}>
27.25/27.33	
27.25/27.33	LOG: CALL solverLinear in Graph for feasibility
27.25/27.33	
27.25/27.33	LOG: RETURN solveLinear in Graph for feasibility
27.25/27.33	It's unfeasible. Removing transition: 
27.25/27.33	<l2, l2, 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 + arg2 <= 0 /\ 1 <= arg3 /\ arg1 <= 2 + arg3, {arg3 -> 1 + arg3, rest remain the same}>
27.25/27.33	
27.25/27.33	LOG: CALL solverLinear in Graph for feasibility
27.25/27.33	
27.25/27.33	LOG: RETURN solveLinear in Graph for feasibility
27.25/27.33	It's unfeasible. Removing transition: 
27.25/27.33	<l2, l2, 1 <= arg1 /\ 1 + arg2 <= 0 /\ 1 <= arg3 /\ arg1 = 3 + arg3, {arg1 -> -1 + arg1, arg3 -> 1 + arg3, rest remain the same}>
27.25/27.33	
27.25/27.33	LOG: CALL solverLinear in Graph for feasibility
27.25/27.33	
27.25/27.33	LOG: RETURN solveLinear in Graph for feasibility
27.25/27.33	Strengthening transition (result): 
27.25/27.33	<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ 4 + arg3 <= arg1, {arg3 -> 1 + arg3, rest remain the same}>
27.25/27.33	
27.25/27.33	LOG: CALL solverLinear in Graph for feasibility
27.25/27.33	
27.25/27.33	LOG: RETURN solveLinear in Graph for feasibility
27.25/27.33	Strengthening transition (result): 
27.25/27.33	<l2, l2, 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg1 <= 2 + arg3, {arg3 -> 1 + arg3, rest remain the same}>
27.25/27.33	
27.25/27.33	LOG: CALL solverLinear in Graph for feasibility
27.25/27.33	
27.25/27.33	LOG: RETURN solveLinear in Graph for feasibility
27.25/27.33	Strengthening transition (result): 
27.25/27.33	<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg1 = 3 + arg3, {arg1 -> -1 + arg1, arg3 -> 1 + arg3, rest remain the same}>
27.25/27.33	
27.25/27.33	LOG: CALL solverLinear in Graph for feasibility
27.25/27.33	
27.25/27.33	LOG: RETURN solveLinear in Graph for feasibility
27.25/27.33	Strengthening transition (result): 
27.25/27.33	<l2, l2, 1 <= arg1 /\ 1 <= arg3 /\ 2 + arg3 <= arg1 /\ arg2 = 0, {arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
27.25/27.33	
27.25/27.33	LOG: CALL solverLinear in Graph for feasibility
27.25/27.33	
27.25/27.33	LOG: RETURN solveLinear in Graph for feasibility
27.25/27.33	Strengthening transition (result): 
27.25/27.33	<l2, l2, 1 <= arg1 /\ 1 <= arg3 /\ arg2 = 0 /\ arg1 = 1 + arg3, {arg1 -> -1 + arg1, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
27.25/27.33	
27.25/27.33	LOG: CALL solverLinear in Graph for feasibility
27.25/27.33	
27.25/27.33	LOG: RETURN solveLinear in Graph for feasibility
27.25/27.33	Strengthening transition (result): 
27.25/27.33	<l2, l2, 0 <= arg2 /\ 1 <= arg1 /\ arg1 = arg3, {arg2 -> 0, arg3 -> -1 + arg1, rest remain the same}>
27.25/27.33	
27.25/27.33	LOG: CALL solverLinear in Graph for feasibility
27.25/27.33	
27.25/27.33	LOG: RETURN solveLinear in Graph for feasibility
27.25/27.33	Strengthening transition (result): 
27.25/27.33	<l2, l2, 0 <= arg2 /\ 1 <= arg1 /\ arg1 <= 2 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
27.25/27.33	
27.25/27.33	LOG: CALL solverLinear in Graph for feasibility
27.25/27.33	
27.25/27.33	LOG: RETURN solveLinear in Graph for feasibility
27.25/27.33	Strengthening transition (result): 
27.25/27.33	<l2, l2, 0 <= arg2 /\ 4 <= arg1 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
27.25/27.33	
27.25/27.33	LOG: CALL solverLinear in Graph for feasibility
27.25/27.33	
27.25/27.33	LOG: RETURN solveLinear in Graph for feasibility
27.25/27.33	Strengthening transition (result): 
27.25/27.33	<l2, l2, 0 <= arg2 /\ arg3 = 0 /\ arg1 = 3, {arg1 -> 2, arg2 -> 1, arg3 -> 1, rest remain the same}>
27.25/27.33	Checking unfeasibility...
27.25/27.33	Time used: 4.00103
27.25/27.33	
27.25/27.33	Checking conditional termination of SCC {l2}...
27.25/27.33	
27.25/27.33	LOG: CALL solveLinear
27.25/27.33	
27.25/27.33	LOG: RETURN solveLinear - Elapsed time: 0.032374s
27.25/27.33	Ranking function: -16 + 4*arg1
27.25/27.33	New Graphs: 
27.25/27.33	Transitions:
27.25/27.33	<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ 4 + arg3 <= arg1, {arg3 -> 1 + arg3, rest remain the same}>
27.25/27.33	<l2, l2, 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg1 <= 2 + arg3, {arg3 -> 1 + arg3, rest remain the same}>
27.25/27.33	<l2, l2, 1 <= arg1 /\ 1 <= arg3 /\ 2 + arg3 <= arg1 /\ arg2 = 0, {arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
27.25/27.33	<l2, l2, 1 <= arg1 /\ 1 <= arg3 /\ arg2 = 0 /\ arg1 = 1 + arg3, {arg1 -> -1 + arg1, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
27.25/27.33	<l2, l2, 0 <= arg2 /\ 1 <= arg1 /\ arg1 = arg3, {arg2 -> 0, arg3 -> -1 + arg1, rest remain the same}>
27.25/27.33	<l2, l2, 0 <= arg2 /\ 1 <= arg1 /\ arg1 <= 2 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
27.25/27.33	<l2, l2, 0 <= arg2 /\ 4 <= arg1 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
27.25/27.33	<l2, l2, 0 <= arg2 /\ arg3 = 0 /\ arg1 = 3, {arg1 -> 2, arg2 -> 1, arg3 -> 1, rest remain the same}>
27.25/27.33	Variables:
27.25/27.33	arg1, arg2, arg3
27.25/27.33	Checking conditional termination of SCC {l2}...
27.25/27.33	
27.25/27.33	LOG: CALL solveLinear
27.25/27.33	
27.25/27.33	LOG: RETURN solveLinear - Elapsed time: 0.005185s
27.25/27.33	Ranking function: -6 + 3*arg1
27.25/27.33	New Graphs: 
27.25/27.33	Transitions:
27.25/27.33	<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ 4 + arg3 <= arg1, {arg3 -> 1 + arg3, rest remain the same}>
27.25/27.33	<l2, l2, 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg1 <= 2 + arg3, {arg3 -> 1 + arg3, rest remain the same}>
27.25/27.33	<l2, l2, 1 <= arg1 /\ 1 <= arg3 /\ 2 + arg3 <= arg1 /\ arg2 = 0, {arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
27.25/27.33	<l2, l2, 0 <= arg2 /\ 1 <= arg1 /\ arg1 = arg3, {arg2 -> 0, arg3 -> -1 + arg1, rest remain the same}>
27.25/27.33	<l2, l2, 0 <= arg2 /\ 1 <= arg1 /\ arg1 <= 2 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
27.25/27.33	<l2, l2, 0 <= arg2 /\ 4 <= arg1 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
27.25/27.33	Variables:
27.25/27.33	arg1, arg2, arg3
27.25/27.33	Checking conditional termination of SCC {l2}...
27.25/27.33	
27.25/27.33	LOG: CALL solveLinear
27.25/27.33	
27.25/27.33	LOG: RETURN solveLinear - Elapsed time: 0.003076s
27.25/27.33	
27.25/27.33	LOG: CALL solveLinear
27.25/27.33	
27.25/27.33	LOG: RETURN solveLinear - Elapsed time: 0.202011s
27.25/27.33	Trying to remove transition: <l2, l2, 0 <= arg2 /\ 4 <= arg1 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
27.25/27.33	Solving with 1 template(s).
27.25/27.33	
27.25/27.33	LOG: CALL solveNonLinearGetFirstSolution
27.25/27.33	
27.25/27.33	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.034459s
27.25/27.33	Time used: 0.032516
27.25/27.33	Trying to remove transition: <l2, l2, 0 <= arg2 /\ 1 <= arg1 /\ arg1 <= 2 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
27.25/27.33	Solving with 1 template(s).
27.25/27.33	
27.25/27.33	LOG: CALL solveNonLinearGetFirstSolution
27.25/27.33	
27.25/27.33	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.037235s
27.25/27.33	Time used: 0.033973
27.25/27.33	Trying to remove transition: <l2, l2, 0 <= arg2 /\ 1 <= arg1 /\ arg1 = arg3, {arg2 -> 0, arg3 -> -1 + arg1, rest remain the same}>
27.25/27.33	Solving with 1 template(s).
27.25/27.33	
27.25/27.33	LOG: CALL solveNonLinearGetFirstSolution
27.25/27.33	
27.25/27.33	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.042270s
27.25/27.33	Time used: 0.038911
27.25/27.33	Trying to remove transition: <l2, l2, 1 <= arg1 /\ 1 <= arg3 /\ 2 + arg3 <= arg1 /\ arg2 = 0, {arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
27.25/27.33	Solving with 1 template(s).
27.25/27.33	
27.25/27.33	LOG: CALL solveNonLinearGetFirstSolution
27.25/27.33	
27.25/27.33	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.036213s
27.25/27.33	Time used: 0.032824
27.25/27.33	Trying to remove transition: <l2, l2, 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg1 <= 2 + arg3, {arg3 -> 1 + arg3, rest remain the same}>
27.25/27.33	Solving with 1 template(s).
27.25/27.33	
27.25/27.33	LOG: CALL solveNonLinearGetFirstSolution
27.25/27.33	
27.25/27.33	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.047210s
27.25/27.33	Time used: 0.043804
27.25/27.33	Trying to remove transition: <l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ 4 + arg3 <= arg1, {arg3 -> 1 + arg3, rest remain the same}>
27.25/27.33	Solving with 1 template(s).
27.25/27.33	
27.25/27.33	LOG: CALL solveNonLinearGetFirstSolution
27.25/27.33	
27.25/27.33	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.046419s
27.25/27.33	Time used: 0.040566
27.25/27.33	Solving with 1 template(s).
27.25/27.33	
27.25/27.33	LOG: CALL solveNonLinearGetFirstSolution
27.25/27.33	
27.25/27.33	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.210556s
27.25/27.33	Time used: 0.20654
27.25/27.33	Improving Solution with cost 1 ...
27.25/27.33	
27.25/27.33	LOG: CALL solveNonLinearGetNextSolution
27.25/27.33	
27.25/27.33	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001288s
27.25/27.33	Time used: 1.00126
27.25/27.33	
27.25/27.33	LOG: SAT solveNonLinear - Elapsed time: 1.211844s
27.25/27.33	Cost: 1; Total time: 1.2078
27.25/27.33	Failed at location 2: 1 + arg1 <= arg3
27.25/27.33	Before Improving: 
27.25/27.33	Quasi-invariant at l2: 1 + arg1 <= arg3
27.25/27.33	Optimizing invariants...
27.25/27.33	
27.25/27.33	LOG: CALL solveLinear
27.25/27.33	
27.25/27.33	LOG: RETURN solveLinear - Elapsed time: 0.011464s
27.25/27.33	Remaining time after improvement: 0.99248
27.25/27.33	Termination implied by a set of quasi-invariant(s):
27.25/27.33	Quasi-invariant at l2: 1 + arg1 <= arg3
27.25/27.33	[ Invariant Graph ]
27.25/27.33	Strengthening and disabling transitions...
27.25/27.33	
27.25/27.33	LOG: CALL solverLinear in Graph for feasibility
27.25/27.33	
27.25/27.33	LOG: RETURN solveLinear in Graph for feasibility
27.25/27.33	It's unfeasible. Removing transition: 
27.25/27.33	<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ 4 + arg3 <= arg1, {arg3 -> 1 + arg3, rest remain the same}>
27.25/27.33	
27.25/27.33	LOG: CALL solverLinear in Graph for feasibility
27.25/27.33	
27.25/27.33	LOG: RETURN solveLinear in Graph for feasibility
27.25/27.33	It's unfeasible. Removing transition: 
27.25/27.33	<l2, l2, 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg1 <= 2 + arg3, {arg3 -> 1 + arg3, rest remain the same}>
27.25/27.33	
27.25/27.33	LOG: CALL solverLinear in Graph for feasibility
27.25/27.33	
27.25/27.33	LOG: RETURN solveLinear in Graph for feasibility
27.25/27.33	It's unfeasible. Removing transition: 
27.25/27.33	<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg1 = 3 + arg3, {arg1 -> -1 + arg1, arg3 -> 1 + arg3, rest remain the same}>
27.25/27.33	
27.25/27.33	LOG: CALL solverLinear in Graph for feasibility
27.25/27.33	
27.25/27.33	LOG: RETURN solveLinear in Graph for feasibility
27.25/27.33	It's unfeasible. Removing transition: 
27.25/27.33	<l2, l2, 1 <= arg1 /\ 1 <= arg3 /\ 2 + arg3 <= arg1 /\ arg2 = 0, {arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
27.25/27.33	
27.25/27.33	LOG: CALL solverLinear in Graph for feasibility
27.25/27.33	
27.25/27.33	LOG: RETURN solveLinear in Graph for feasibility
27.25/27.33	It's unfeasible. Removing transition: 
27.25/27.33	<l2, l2, 1 <= arg1 /\ 1 <= arg3 /\ arg2 = 0 /\ arg1 = 1 + arg3, {arg1 -> -1 + arg1, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
27.25/27.33	
27.25/27.33	LOG: CALL solverLinear in Graph for feasibility
27.25/27.33	
27.25/27.33	LOG: RETURN solveLinear in Graph for feasibility
27.25/27.33	It's unfeasible. Removing transition: 
27.25/27.33	<l2, l2, 0 <= arg2 /\ 1 <= arg1 /\ arg1 = arg3, {arg2 -> 0, arg3 -> -1 + arg1, rest remain the same}>
27.25/27.33	
27.25/27.33	LOG: CALL solverLinear in Graph for feasibility
27.25/27.33	
27.25/27.33	LOG: RETURN solveLinear in Graph for feasibility
27.25/27.33	It's unfeasible. Removing transition: 
27.25/27.33	<l2, l2, 0 <= arg2 /\ 1 <= arg1 /\ arg1 <= 2 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
27.25/27.33	
27.25/27.33	LOG: CALL solverLinear in Graph for feasibility
27.25/27.33	
27.25/27.33	LOG: RETURN solveLinear in Graph for feasibility
27.25/27.33	It's unfeasible. Removing transition: 
27.25/27.33	<l2, l2, 0 <= arg2 /\ 4 <= arg1 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
27.25/27.33	
27.25/27.33	LOG: CALL solverLinear in Graph for feasibility
27.25/27.33	
27.25/27.33	LOG: RETURN solveLinear in Graph for feasibility
27.25/27.33	It's unfeasible. Removing transition: 
27.25/27.33	<l2, l2, 0 <= arg2 /\ arg3 = 0 /\ arg1 = 3, {arg1 -> 2, arg2 -> 1, arg3 -> 1, rest remain the same}>
27.25/27.33	[ Termination Graph ]
27.25/27.33	Strengthening and disabling transitions...
27.25/27.33	> It's unfeasible. Removing transition: 
27.25/27.33	<l2, l2, 0 <= arg2 /\ 4 <= arg1 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
27.25/27.33	
27.25/27.33	LOG: CALL solverLinear in Graph for feasibility
27.25/27.33	
27.25/27.33	LOG: RETURN solveLinear in Graph for feasibility
27.25/27.33	It's unfeasible. Removing transition: 
27.25/27.33	<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ 4 + arg3 <= arg1, {arg3 -> 1 + arg3, rest remain the same}>
27.25/27.33	
27.25/27.33	LOG: CALL solverLinear in Graph for feasibility
27.25/27.33	
27.25/27.33	LOG: RETURN solveLinear in Graph for feasibility
27.25/27.33	It's unfeasible. Removing transition: 
27.25/27.33	<l2, l2, 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg1 <= 2 + arg3, {arg3 -> 1 + arg3, rest remain the same}>
27.25/27.33	
27.25/27.33	LOG: CALL solverLinear in Graph for feasibility
27.25/27.33	
27.25/27.33	LOG: RETURN solveLinear in Graph for feasibility
27.25/27.33	It's unfeasible. Removing transition: 
27.25/27.33	<l2, l2, 1 <= arg1 /\ 1 <= arg3 /\ 2 + arg3 <= arg1 /\ arg2 = 0, {arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
27.25/27.33	
27.25/27.33	LOG: CALL solverLinear in Graph for feasibility
27.25/27.33	
27.25/27.33	LOG: RETURN solveLinear in Graph for feasibility
27.25/27.33	It's unfeasible. Removing transition: 
27.25/27.33	<l2, l2, 0 <= arg2 /\ 1 <= arg1 /\ arg1 = arg3, {arg2 -> 0, arg3 -> -1 + arg1, rest remain the same}>
27.25/27.33	
27.25/27.33	LOG: CALL solverLinear in Graph for feasibility
27.25/27.33	
27.25/27.33	LOG: RETURN solveLinear in Graph for feasibility
27.25/27.33	It's unfeasible. Removing transition: 
27.25/27.33	<l2, l2, 0 <= arg2 /\ 1 <= arg1 /\ arg1 <= 2 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
27.25/27.33	New Graphs: 
27.25/27.33	Calling Safety with literal 1 + arg1 <= arg3 and entry <l0, l2, 0 <= undef74 /\ 1 <= undef73 /\ arg2 = 0 /\ arg3 = undef74 /\ arg1 = 20, {all remain the same}>
27.25/27.33	
27.25/27.33	LOG: CALL check - Post:1 + arg1 <= arg3 - Process 1
27.25/27.33	* Exit transition: <l0, l2, 0 <= undef74 /\ 1 <= undef73 /\ arg2 = 0 /\ arg3 = undef74 /\ arg1 = 20, {all remain the same}>
27.25/27.33	* Postcondition  : 1 + arg1 <= arg3
27.25/27.33	
27.25/27.33	LOG: CALL solveLinear
27.25/27.33	
27.25/27.33	LOG: RETURN solveLinear - Elapsed time: 0.001654s
27.25/27.33	> Postcondition is not implied!
27.25/27.33	
27.25/27.33	LOG: RETURN check - Elapsed time: 0.001776s
27.25/27.33	INVARIANTS: 
27.25/27.33	2: 
27.25/27.33	Quasi-INVARIANTS to narrow Graph: 
27.25/27.33	2: 1 + arg1 <= arg3 , 
27.25/27.33	Narrowing transition: 
27.25/27.33	<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ 4 + arg3 <= arg1, {arg3 -> 1 + arg3, rest remain the same}>
27.25/27.33	
27.25/27.33	LOG: Narrow transition size 1
27.25/27.33	Narrowing transition: 
27.25/27.33	<l2, l2, 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg1 <= 2 + arg3, {arg3 -> 1 + arg3, rest remain the same}>
27.25/27.33	
27.25/27.33	LOG: Narrow transition size 1
27.25/27.33	Narrowing transition: 
27.25/27.33	<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg1 = 3 + arg3, {arg1 -> -1 + arg1, arg3 -> 1 + arg3, rest remain the same}>
27.25/27.33	
27.25/27.33	LOG: Narrow transition size 1
27.25/27.33	Narrowing transition: 
27.25/27.33	<l2, l2, 1 <= arg1 /\ 1 <= arg3 /\ 2 + arg3 <= arg1 /\ arg2 = 0, {arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
27.25/27.33	
27.25/27.33	LOG: Narrow transition size 1
27.25/27.33	Narrowing transition: 
27.25/27.33	<l2, l2, 1 <= arg1 /\ 1 <= arg3 /\ arg2 = 0 /\ arg1 = 1 + arg3, {arg1 -> -1 + arg1, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
27.25/27.33	
27.25/27.33	LOG: Narrow transition size 1
27.25/27.33	Narrowing transition: 
27.25/27.33	<l2, l2, 0 <= arg2 /\ 1 <= arg1 /\ arg1 = arg3, {arg2 -> 0, arg3 -> -1 + arg1, rest remain the same}>
27.25/27.33	
27.25/27.33	LOG: Narrow transition size 1
27.25/27.33	Narrowing transition: 
27.25/27.33	<l2, l2, 0 <= arg2 /\ 1 <= arg1 /\ arg1 <= 2 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
27.25/27.33	
27.25/27.33	LOG: Narrow transition size 1
27.25/27.33	Narrowing transition: 
27.25/27.33	<l2, l2, 0 <= arg2 /\ 4 <= arg1 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
27.25/27.33	
27.25/27.33	LOG: Narrow transition size 1
27.25/27.33	Narrowing transition: 
27.25/27.33	<l2, l2, 0 <= arg2 /\ arg3 = 0 /\ arg1 = 3, {arg1 -> 2, arg2 -> 1, arg3 -> 1, rest remain the same}>
27.25/27.33	
27.25/27.33	LOG: Narrow transition size 1
27.25/27.33	invGraph after Narrowing: 
27.25/27.33	Transitions:
27.25/27.33	<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ 4 + arg3 <= arg1, {arg3 -> 1 + arg3, rest remain the same}>
27.25/27.33	<l2, l2, 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg1 <= 2 + arg3, {arg3 -> 1 + arg3, rest remain the same}>
27.25/27.33	<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg1 = 3 + arg3, {arg1 -> -1 + arg1, arg3 -> 1 + arg3, rest remain the same}>
27.25/27.33	<l2, l2, 1 <= arg1 /\ 1 <= arg3 /\ 2 + arg3 <= arg1 /\ arg2 = 0, {arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
27.25/27.33	<l2, l2, 1 <= arg1 /\ 1 <= arg3 /\ arg2 = 0 /\ arg1 = 1 + arg3, {arg1 -> -1 + arg1, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
27.25/27.33	<l2, l2, 0 <= arg2 /\ 1 <= arg1 /\ arg1 = arg3, {arg2 -> 0, arg3 -> -1 + arg1, rest remain the same}>
27.25/27.33	<l2, l2, arg3 <= arg1 /\ 0 <= arg2 /\ 1 <= arg1 /\ arg1 <= 2 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
27.25/27.33	<l2, l2, arg3 <= arg1 /\ 0 <= arg2 /\ 4 <= arg1 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
27.25/27.33	<l2, l2, arg3 <= arg1 /\ 0 <= arg2 /\ arg3 = 0 /\ arg1 = 3, {arg1 -> 2, arg2 -> 1, arg3 -> 1, rest remain the same}>
27.25/27.33	Variables:
27.25/27.33	arg1, arg2, arg3
27.25/27.33	Checking conditional termination of SCC {l2}...
27.25/27.33	
27.25/27.33	LOG: CALL solveLinear
27.25/27.33	
27.25/27.33	LOG: RETURN solveLinear - Elapsed time: 0.007116s
27.25/27.33	Ranking function: -28 + 7*arg1
27.25/27.33	New Graphs: 
27.25/27.33	Transitions:
27.25/27.33	<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ 4 + arg3 <= arg1, {arg3 -> 1 + arg3, rest remain the same}>
27.25/27.33	<l2, l2, 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg1 <= 2 + arg3, {arg3 -> 1 + arg3, rest remain the same}>
27.25/27.33	<l2, l2, 1 <= arg1 /\ 1 <= arg3 /\ 2 + arg3 <= arg1 /\ arg2 = 0, {arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
27.25/27.33	<l2, l2, 1 <= arg1 /\ 1 <= arg3 /\ arg2 = 0 /\ arg1 = 1 + arg3, {arg1 -> -1 + arg1, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
27.25/27.33	<l2, l2, 0 <= arg2 /\ 1 <= arg1 /\ arg1 = arg3, {arg2 -> 0, arg3 -> -1 + arg1, rest remain the same}>
27.25/27.33	<l2, l2, arg3 <= arg1 /\ 0 <= arg2 /\ 1 <= arg1 /\ arg1 <= 2 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
27.25/27.33	<l2, l2, arg3 <= arg1 /\ 0 <= arg2 /\ 4 <= arg1 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
27.25/27.33	<l2, l2, arg3 <= arg1 /\ 0 <= arg2 /\ arg3 = 0 /\ arg1 = 3, {arg1 -> 2, arg2 -> 1, arg3 -> 1, rest remain the same}>
27.25/27.33	Variables:
27.25/27.33	arg1, arg2, arg3
27.25/27.33	Checking conditional termination of SCC {l2}...
27.25/27.33	
27.25/27.33	LOG: CALL solveLinear
27.25/27.33	
27.25/27.33	LOG: RETURN solveLinear - Elapsed time: 0.005988s
27.25/27.33	Ranking function: -6 + 3*arg1
27.25/27.33	New Graphs: 
27.25/27.33	Transitions:
27.25/27.33	<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ 4 + arg3 <= arg1, {arg3 -> 1 + arg3, rest remain the same}>
27.25/27.33	<l2, l2, 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg1 <= 2 + arg3, {arg3 -> 1 + arg3, rest remain the same}>
27.25/27.33	<l2, l2, 1 <= arg1 /\ 1 <= arg3 /\ 2 + arg3 <= arg1 /\ arg2 = 0, {arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
27.25/27.33	<l2, l2, 0 <= arg2 /\ 1 <= arg1 /\ arg1 = arg3, {arg2 -> 0, arg3 -> -1 + arg1, rest remain the same}>
27.25/27.33	<l2, l2, arg3 <= arg1 /\ 0 <= arg2 /\ 1 <= arg1 /\ arg1 <= 2 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
27.25/27.33	<l2, l2, arg3 <= arg1 /\ 0 <= arg2 /\ 4 <= arg1 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
27.25/27.33	Variables:
27.25/27.33	arg1, arg2, arg3
27.25/27.33	Checking conditional termination of SCC {l2}...
27.25/27.33	
27.25/27.33	LOG: CALL solveLinear
27.25/27.33	
27.25/27.33	LOG: RETURN solveLinear - Elapsed time: 0.003420s
27.25/27.33	
27.25/27.33	LOG: CALL solveLinear
27.25/27.33	
27.25/27.33	LOG: RETURN solveLinear - Elapsed time: 0.206683s
27.25/27.33	Trying to remove transition: <l2, l2, arg3 <= arg1 /\ 0 <= arg2 /\ 4 <= arg1 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
27.25/27.33	Solving with 1 template(s).
27.25/27.33	
27.25/27.33	LOG: CALL solveNonLinearGetFirstSolution
27.25/27.33	
27.25/27.33	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.040614s
27.25/27.33	Time used: 0.038142
27.25/27.33	Trying to remove transition: <l2, l2, arg3 <= arg1 /\ 0 <= arg2 /\ 1 <= arg1 /\ arg1 <= 2 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
27.25/27.33	Solving with 1 template(s).
27.25/27.33	
27.25/27.33	LOG: CALL solveNonLinearGetFirstSolution
27.25/27.33	
27.25/27.33	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.039707s
27.25/27.33	Time used: 0.036039
27.25/27.33	Trying to remove transition: <l2, l2, 0 <= arg2 /\ 1 <= arg1 /\ arg1 = arg3, {arg2 -> 0, arg3 -> -1 + arg1, rest remain the same}>
27.25/27.33	Solving with 1 template(s).
27.25/27.33	
27.25/27.33	LOG: CALL solveNonLinearGetFirstSolution
27.25/27.33	
27.25/27.33	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.042737s
27.25/27.33	Time used: 0.038867
27.25/27.33	Trying to remove transition: <l2, l2, 1 <= arg1 /\ 1 <= arg3 /\ 2 + arg3 <= arg1 /\ arg2 = 0, {arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
27.25/27.33	Solving with 1 template(s).
27.25/27.33	
27.25/27.33	LOG: CALL solveNonLinearGetFirstSolution
27.25/27.33	
27.25/27.33	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.038601s
27.25/27.33	Time used: 0.034801
27.25/27.33	Trying to remove transition: <l2, l2, 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg1 <= 2 + arg3, {arg3 -> 1 + arg3, rest remain the same}>
27.25/27.33	Solving with 1 template(s).
27.25/27.33	
27.25/27.33	LOG: CALL solveNonLinearGetFirstSolution
27.25/27.33	
27.25/27.33	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.049110s
27.25/27.33	Time used: 0.045013
27.25/27.33	Trying to remove transition: <l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ 4 + arg3 <= arg1, {arg3 -> 1 + arg3, rest remain the same}>
27.25/27.33	Solving with 1 template(s).
27.25/27.33	
27.25/27.33	LOG: CALL solveNonLinearGetFirstSolution
27.25/27.33	
27.25/27.33	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.044554s
27.25/27.33	Time used: 0.040512
27.25/27.33	Solving with 1 template(s).
27.25/27.33	
27.25/27.33	LOG: CALL solveNonLinearGetFirstSolution
27.25/27.33	
27.25/27.33	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.227500s
27.25/27.33	Time used: 0.223236
27.25/27.33	Improving Solution with cost 1 ...
27.25/27.33	
27.25/27.33	LOG: CALL solveNonLinearGetNextSolution
27.25/27.33	
27.25/27.33	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.003169s
27.25/27.33	Time used: 1.00097
27.25/27.33	
27.25/27.33	LOG: SAT solveNonLinear - Elapsed time: 1.230669s
27.25/27.33	Cost: 1; Total time: 1.2242
27.25/27.33	Failed at location 2: arg1 <= 1 + arg3
27.25/27.33	Before Improving: 
27.25/27.33	Quasi-invariant at l2: arg1 <= 1 + arg3
27.25/27.33	Optimizing invariants...
27.25/27.33	
27.25/27.33	LOG: CALL solveLinear
27.25/27.33	
27.25/27.33	LOG: RETURN solveLinear - Elapsed time: 0.012441s
27.25/27.33	Remaining time after improvement: 0.991948
27.25/27.33	Termination implied by a set of quasi-invariant(s):
27.25/27.33	Quasi-invariant at l2: arg1 <= 1 + arg3
27.25/27.33	[ Invariant Graph ]
27.25/27.33	Strengthening and disabling transitions...
27.25/27.33	
27.25/27.33	LOG: CALL solverLinear in Graph for feasibility
27.25/27.33	
27.25/27.33	LOG: RETURN solveLinear in Graph for feasibility
27.25/27.33	It's unfeasible. Removing transition: 
27.25/27.33	<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ 4 + arg3 <= arg1, {arg3 -> 1 + arg3, rest remain the same}>
27.25/27.33	
27.25/27.33	LOG: CALL solverLinear in Graph for feasibility
27.25/27.33	
27.25/27.33	LOG: RETURN solveLinear in Graph for feasibility
27.25/27.33	Strengthening transition (result): 
27.25/27.33	<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg1 = 1 + arg3, {arg3 -> 1 + arg3, rest remain the same}>
27.25/27.33	
27.25/27.33	LOG: CALL solverLinear in Graph for feasibility
27.25/27.33	
27.25/27.33	LOG: RETURN solveLinear in Graph for feasibility
27.25/27.33	It's unfeasible. Removing transition: 
27.25/27.33	<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg1 = 3 + arg3, {arg1 -> -1 + arg1, arg3 -> 1 + arg3, rest remain the same}>
27.25/27.33	
27.25/27.33	LOG: CALL solverLinear in Graph for feasibility
27.25/27.33	
27.25/27.33	LOG: RETURN solveLinear in Graph for feasibility
27.25/27.33	It's unfeasible. Removing transition: 
27.25/27.33	<l2, l2, 1 <= arg1 /\ 1 <= arg3 /\ 2 + arg3 <= arg1 /\ arg2 = 0, {arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
27.25/27.33	
27.25/27.33	LOG: CALL solverLinear in Graph for feasibility
27.25/27.33	
27.25/27.33	LOG: RETURN solveLinear in Graph for feasibility
27.25/27.33	Strengthening transition (result): 
27.25/27.33	<l2, l2, 1 <= arg1 /\ 1 <= arg3 /\ arg2 = 0 /\ arg1 = 1 + arg3, {arg1 -> -1 + arg1, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
27.25/27.33	
27.25/27.33	LOG: CALL solverLinear in Graph for feasibility
27.25/27.33	
27.25/27.33	LOG: RETURN solveLinear in Graph for feasibility
27.25/27.33	Strengthening transition (result): 
27.25/27.33	<l2, l2, 0 <= arg2 /\ 1 <= arg1 /\ arg1 = arg3, {arg2 -> 0, arg3 -> -1 + arg1, rest remain the same}>
27.25/27.33	
27.25/27.33	LOG: CALL solverLinear in Graph for feasibility
27.25/27.33	
27.25/27.33	LOG: RETURN solveLinear in Graph for feasibility
27.25/27.33	Strengthening transition (result): 
27.25/27.33	<l2, l2, arg3 <= arg1 /\ 0 <= arg2 /\ 1 <= arg1 /\ arg1 <= 1 + arg3 /\ arg1 <= 2 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
27.25/27.33	
27.25/27.33	LOG: CALL solverLinear in Graph for feasibility
27.25/27.33	
27.25/27.33	LOG: RETURN solveLinear in Graph for feasibility
27.25/27.33	It's unfeasible. Removing transition: 
27.25/27.33	<l2, l2, arg3 <= arg1 /\ 0 <= arg2 /\ 4 <= arg1 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
27.25/27.33	
27.25/27.33	LOG: CALL solverLinear in Graph for feasibility
27.25/27.33	
27.25/27.33	LOG: RETURN solveLinear in Graph for feasibility
27.25/27.33	It's unfeasible. Removing transition: 
27.25/27.33	<l2, l2, arg3 <= arg1 /\ 0 <= arg2 /\ arg3 = 0 /\ arg1 = 3, {arg1 -> 2, arg2 -> 1, arg3 -> 1, rest remain the same}>
27.25/27.33	[ Termination Graph ]
27.25/27.33	Strengthening and disabling transitions...
27.25/27.33	> It's unfeasible. Removing transition: 
27.25/27.33	<l2, l2, arg3 <= arg1 /\ 0 <= arg2 /\ 4 <= arg1 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
27.25/27.33	
27.25/27.33	LOG: CALL solverLinear in Graph for feasibility
27.25/27.33	
27.25/27.33	LOG: RETURN solveLinear in Graph for feasibility
27.25/27.33	It's unfeasible. Removing transition: 
27.25/27.33	<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ 4 + arg3 <= arg1, {arg3 -> 1 + arg3, rest remain the same}>
27.25/27.33	
27.25/27.33	LOG: CALL solverLinear in Graph for feasibility
27.25/27.33	
27.25/27.33	LOG: RETURN solveLinear in Graph for feasibility
27.25/27.33	Strengthening transition (result): 
27.25/27.33	<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg1 = 1 + arg3, {arg3 -> 1 + arg3, rest remain the same}>
27.25/27.33	
27.25/27.33	LOG: CALL solverLinear in Graph for feasibility
27.25/27.33	
27.25/27.33	LOG: RETURN solveLinear in Graph for feasibility
27.25/27.33	It's unfeasible. Removing transition: 
27.25/27.33	<l2, l2, 1 <= arg1 /\ 1 <= arg3 /\ 2 + arg3 <= arg1 /\ arg2 = 0, {arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
27.25/27.33	
27.25/27.33	LOG: CALL solverLinear in Graph for feasibility
27.25/27.33	
27.25/27.33	LOG: RETURN solveLinear in Graph for feasibility
27.25/27.33	Strengthening transition (result): 
27.25/27.33	<l2, l2, 0 <= arg2 /\ 1 <= arg1 /\ arg1 = arg3, {arg2 -> 0, arg3 -> -1 + arg1, rest remain the same}>
27.25/27.33	
27.25/27.33	LOG: CALL solverLinear in Graph for feasibility
27.25/27.33	
27.25/27.33	LOG: RETURN solveLinear in Graph for feasibility
27.25/27.33	Strengthening transition (result): 
27.25/27.33	<l2, l2, arg3 <= arg1 /\ 0 <= arg2 /\ 1 <= arg1 /\ arg1 <= 1 + arg3 /\ arg1 <= 2 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
27.25/27.33	New Graphs: 
27.25/27.33	Transitions:
27.25/27.33	<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg1 = 1 + arg3, {arg3 -> 1 + arg3, rest remain the same}>
27.25/27.33	<l2, l2, 0 <= arg2 /\ 1 <= arg1 /\ arg1 = arg3, {arg2 -> 0, arg3 -> -1 + arg1, rest remain the same}>
27.25/27.33	<l2, l2, arg3 <= arg1 /\ 0 <= arg2 /\ 1 <= arg1 /\ arg1 <= 1 + arg3 /\ arg1 <= 2 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
27.25/27.33	Variables:
27.25/27.33	arg1, arg2, arg3
27.25/27.33	Checking conditional termination of SCC {l2}...
27.25/27.33	
27.25/27.33	LOG: CALL solveLinear
27.25/27.33	
27.25/27.33	LOG: RETURN solveLinear - Elapsed time: 0.001979s
27.25/27.33	
27.25/27.33	LOG: CALL solveLinear
27.25/27.33	
27.25/27.33	LOG: RETURN solveLinear - Elapsed time: 0.022186s
27.25/27.33	Trying to remove transition: <l2, l2, arg3 <= arg1 /\ 0 <= arg2 /\ 1 <= arg1 /\ arg1 <= 1 + arg3 /\ arg1 <= 2 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
27.25/27.33	Solving with 1 template(s).
27.25/27.33	
27.25/27.33	LOG: CALL solveNonLinearGetFirstSolution
27.25/27.33	
27.25/27.33	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.000690s
27.25/27.33	Time used: 4.00009
27.25/27.33	Trying to remove transition: <l2, l2, 0 <= arg2 /\ 1 <= arg1 /\ arg1 = arg3, {arg2 -> 0, arg3 -> -1 + arg1, rest remain the same}>
27.25/27.33	Solving with 1 template(s).
27.25/27.33	
27.25/27.33	LOG: CALL solveNonLinearGetFirstSolution
27.25/27.33	
27.25/27.33	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.043025s
27.25/27.33	Time used: 0.026046
27.25/27.33	Trying to remove transition: <l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg1 = 1 + arg3, {arg3 -> 1 + arg3, rest remain the same}>
27.25/27.33	Solving with 1 template(s).
27.25/27.33	
27.25/27.33	LOG: CALL solveNonLinearGetFirstSolution
27.25/27.33	
27.25/27.33	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.026200s
27.25/27.33	Time used: 0.024857
27.25/27.33	
27.25/27.33	LOG: SAT solveNonLinear - Elapsed time: 0.026200s
27.25/27.33	Cost: 0; Total time: 0.024857
27.25/27.33	Termination implied by a set of quasi-invariant(s):
27.25/27.33	Quasi-invariant at l2: 1 + arg3 <= arg1 + arg2
27.25/27.33	Ranking function: 2*arg1 + 2*arg2 - 2*arg3
27.25/27.33	Ranking function and negation of Quasi-Invariant applied
27.25/27.33	New Graphs: 
27.25/27.33	Transitions:
27.25/27.33	<l2, l2, 0 <= arg2 /\ 1 <= arg1 /\ arg1 = arg3, {arg2 -> 0, arg3 -> -1 + arg1, rest remain the same}>
27.25/27.33	<l2, l2, arg3 <= arg1 /\ 0 <= arg2 /\ 1 <= arg1 /\ arg1 <= 1 + arg3 /\ arg1 <= 2 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
27.25/27.33	Variables:
27.25/27.33	arg1, arg2, arg3
27.25/27.33	Checking conditional termination of SCC {l2}...
27.25/27.33	
27.25/27.33	LOG: CALL solveLinear
27.25/27.33	
27.25/27.33	LOG: RETURN solveLinear - Elapsed time: 0.001617s
27.25/27.33	
27.25/27.33	LOG: CALL solveLinear
27.25/27.33	
27.25/27.33	LOG: RETURN solveLinear - Elapsed time: 0.012796s
27.25/27.33	Trying to remove transition: <l2, l2, arg3 <= arg1 /\ 0 <= arg2 /\ 1 <= arg1 /\ arg1 <= 1 + arg3 /\ arg1 <= 2 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
27.25/27.33	Solving with 1 template(s).
27.25/27.33	
27.25/27.33	LOG: CALL solveNonLinearGetFirstSolution
27.25/27.33	
27.25/27.33	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.000436s
27.25/27.33	Time used: 4.00017
27.25/27.33	Trying to remove transition: <l2, l2, 0 <= arg2 /\ 1 <= arg1 /\ arg1 = arg3, {arg2 -> 0, arg3 -> -1 + arg1, rest remain the same}>
27.25/27.33	Solving with 1 template(s).
27.25/27.33	
27.25/27.33	LOG: CALL solveNonLinearGetFirstSolution
27.25/27.33	
27.25/27.33	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.052106s
27.25/27.33	Time used: 0.036995
27.25/27.33	Solving with 1 template(s).
27.25/27.33	
27.25/27.33	LOG: CALL solveNonLinearGetFirstSolution
27.25/27.33	
27.25/27.33	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.007384s
27.25/27.33	Time used: 4.00019
27.25/27.33	Solving with 2 template(s).
27.25/27.33	
27.25/27.33	LOG: CALL solveNonLinearGetFirstSolution
27.25/27.33	
27.25/27.33	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.016286s
27.25/27.33	Time used: 4.00006
27.25/27.33	Solving with 3 template(s).
27.25/27.33	
27.25/27.33	LOG: CALL solveNonLinearGetFirstSolution
27.25/27.33	
27.25/27.33	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.017767s
27.25/27.33	Time used: 1.00002
27.25/27.33	Solving with 1 template(s).
27.25/27.33	
27.25/27.33	LOG: CALL solveNonLinearGetFirstSolution
27.25/27.33	
27.25/27.33	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.484931s
27.25/27.33	Time used: 1.4653
27.25/27.33	
27.25/27.33	Proving non-termination of subgraph 1
27.25/27.33	Transitions:
27.25/27.33	<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ 4 + arg3 <= arg1, {arg3 -> 1 + arg3, rest remain the same}>
27.25/27.33	<l2, l2, 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg1 <= 2 + arg3, {arg3 -> 1 + arg3, rest remain the same}>
27.25/27.33	<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg1 = 3 + arg3, {arg1 -> -1 + arg1, arg3 -> 1 + arg3, rest remain the same}>
27.25/27.33	<l2, l2, 1 <= arg1 /\ 1 <= arg3 /\ 2 + arg3 <= arg1 /\ arg2 = 0, {arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
27.25/27.33	<l2, l2, 1 <= arg1 /\ 1 <= arg3 /\ arg2 = 0 /\ arg1 = 1 + arg3, {arg1 -> -1 + arg1, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
27.25/27.33	<l2, l2, 0 <= arg2 /\ 1 <= arg1 /\ arg1 = arg3, {arg2 -> 0, arg3 -> -1 + arg1, rest remain the same}>
27.25/27.33	<l2, l2, arg3 <= arg1 /\ 0 <= arg2 /\ 1 <= arg1 /\ arg1 <= 2 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
27.25/27.33	<l2, l2, arg3 <= arg1 /\ 0 <= arg2 /\ 4 <= arg1 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
27.25/27.33	<l2, l2, arg3 <= arg1 /\ 0 <= arg2 /\ arg3 = 0 /\ arg1 = 3, {arg1 -> 2, arg2 -> 1, arg3 -> 1, rest remain the same}>
27.25/27.33	Variables:
27.25/27.33	arg1, arg2, arg3
27.25/27.33	
27.25/27.33	Checking conditional non-termination of SCC {l2}...
27.25/27.33	EXIT TRANSITIONS:
27.25/27.33	<l2, end, 1 + arg1 <= arg3 /\ 1 <= arg2 /\ 1 <= arg3 /\ 3 <= arg1, {all remain the same}>
27.25/27.33	<l2, end, 1 + arg1 <= arg3 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg1 <= 2, {all remain the same}>
27.25/27.33	<l2, end, 1 <= arg2 /\ 1 + arg3 <= 0 /\ 3 <= arg1 /\ 4 + arg3 <= arg1, {all remain the same}>
27.25/27.33	<l2, end, 1 <= arg1 /\ 1 <= arg2 /\ 1 + arg3 <= 0 /\ arg1 <= 2 /\ 4 + arg3 <= arg1, {all remain the same}>
27.25/27.33	<l2, end, 1 <= arg1 /\ 1 <= arg2 /\ 1 + arg3 <= 0 /\ arg1 <= 2 /\ arg1 = 3 + arg3, {all remain the same}>
27.25/27.33	<l2, end, 1 <= arg1 /\ 1 <= arg2 /\ 1 + arg3 <= 0 /\ arg1 <= 2 /\ arg1 = 2 + arg3, {all remain the same}>
27.25/27.33	<l2, end, 1 + arg1 <= arg3 /\ 1 <= arg3 /\ 3 <= arg1 /\ arg2 = 0, {all remain the same}>
27.25/27.33	<l2, end, 1 + arg1 <= arg3 /\ 1 <= arg1 /\ 1 <= arg3 /\ arg1 <= 2 /\ arg2 = 0, {all remain the same}>
27.25/27.33	<l2, end, 1 + arg3 <= 0 /\ 3 <= arg1 /\ 4 + arg3 <= arg1 /\ arg2 = 0, {all remain the same}>
27.25/27.33	<l2, end, 1 <= arg1 /\ 1 + arg3 <= 0 /\ arg1 <= 2 /\ 4 + arg3 <= arg1 /\ arg2 = 0, {all remain the same}>
27.25/27.33	<l2, end, 1 <= arg1 /\ 1 + arg3 <= 0 /\ arg1 <= 2 /\ arg2 = 0 /\ arg1 = 3 + arg3, {all remain the same}>
27.25/27.33	<l2, end, 1 <= arg1 /\ 1 + arg3 <= 0 /\ arg1 <= 2 /\ arg2 = 0 /\ arg1 = 2 + arg3, {all remain the same}>
27.25/27.33	
27.25/27.33	Solving with 1 template(s).
27.25/27.33	
27.25/27.33	LOG: CALL solveNonLinearGetFirstSolution
27.25/27.33	
27.25/27.33	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.120267s
27.25/27.33	Time used: 0.119622
27.25/27.33	Improving Solution with cost 6 ...
27.25/27.33	
27.25/27.33	LOG: CALL solveNonLinearGetNextSolution
27.25/27.33	
27.25/27.33	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.278982s
27.25/27.33	Time used: 0.278979
27.25/27.33	
27.25/27.33	LOG: SAT solveNonLinear - Elapsed time: 0.399249s
27.25/27.33	Cost: 6; Total time: 0.398601
27.25/27.33	Non-termination implied by a set of quasi-invariant(s):
27.25/27.33	Quasi-invariant at l2: 0 <= arg3
27.25/27.33	
27.25/27.33	Strengthening and disabling EXIT transitions...
27.25/27.33	Closed exits from l2: 8
27.25/27.33	Strengthening exit transition (result): 
27.25/27.33	<l2, end, 1 + arg1 <= arg3 /\ 1 <= arg2 /\ 1 <= arg3 /\ 3 <= arg1, {all remain the same}>
27.25/27.33	Strengthening exit transition (result): 
27.25/27.33	<l2, end, 1 + arg1 <= arg3 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg1 <= 2, {all remain the same}>
27.25/27.33	Strengthening exit transition (result): 
27.25/27.33	<l2, end, 1 + arg1 <= arg3 /\ 1 <= arg3 /\ 3 <= arg1 /\ arg2 = 0, {all remain the same}>
27.25/27.33	Strengthening exit transition (result): 
27.25/27.33	<l2, end, 1 + arg1 <= arg3 /\ 1 <= arg1 /\ 1 <= arg3 /\ arg1 <= 2 /\ arg2 = 0, {all remain the same}>
27.25/27.33	
27.25/27.33	Strengthening and disabling transitions...
27.25/27.33	
27.25/27.33	LOG: CALL solverLinear in Graph for feasibility
27.25/27.33	
27.25/27.33	LOG: RETURN solveLinear in Graph for feasibility
27.25/27.33	Strengthening transition (result): 
27.25/27.33	<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ 4 + arg3 <= arg1, {arg3 -> 1 + arg3, rest remain the same}>
27.25/27.33	
27.25/27.33	LOG: CALL solverLinear in Graph for feasibility
27.25/27.33	
27.25/27.33	LOG: RETURN solveLinear in Graph for feasibility
27.25/27.33	Strengthening transition (result): 
27.25/27.33	<l2, l2, 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg1 <= 2 + arg3, {arg3 -> 1 + arg3, rest remain the same}>
27.25/27.33	
27.25/27.33	LOG: CALL solverLinear in Graph for feasibility
27.25/27.33	
27.25/27.33	LOG: RETURN solveLinear in Graph for feasibility
27.25/27.33	Strengthening transition (result): 
27.25/27.33	<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg1 = 3 + arg3, {arg1 -> -1 + arg1, arg3 -> 1 + arg3, rest remain the same}>
27.25/27.33	
27.25/27.33	LOG: CALL solverLinear in Graph for feasibility
27.25/27.33	
27.25/27.33	LOG: RETURN solveLinear in Graph for feasibility
27.25/27.33	Strengthening transition (result): 
27.25/27.33	<l2, l2, 1 <= arg1 /\ 1 <= arg3 /\ 2 + arg3 <= arg1 /\ arg2 = 0, {arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
27.25/27.33	
27.25/27.33	LOG: CALL solverLinear in Graph for feasibility
27.25/27.33	
27.25/27.33	LOG: RETURN solveLinear in Graph for feasibility
27.25/27.33	Strengthening transition (result): 
27.25/27.33	<l2, l2, 1 <= arg1 /\ 1 <= arg3 /\ arg2 = 0 /\ arg1 = 1 + arg3, {arg1 -> -1 + arg1, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
27.25/27.33	
27.25/27.33	LOG: CALL solverLinear in Graph for feasibility
27.25/27.33	
27.25/27.33	LOG: RETURN solveLinear in Graph for feasibility
27.25/27.33	Strengthening transition (result): 
27.25/27.33	<l2, l2, 0 <= arg2 /\ 0 <= arg3 /\ 1 <= arg1 /\ arg1 = arg3, {arg2 -> 0, arg3 -> -1 + arg1, rest remain the same}>
27.25/27.33	
27.25/27.33	LOG: CALL solverLinear in Graph for feasibility
27.25/27.33	
27.25/27.33	LOG: RETURN solveLinear in Graph for feasibility
27.25/27.33	Strengthening transition (result): 
27.25/27.33	<l2, l2, arg3 <= arg1 /\ 0 <= arg2 /\ 1 <= arg1 /\ arg1 <= 2 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
27.25/27.33	
27.25/27.33	LOG: CALL solverLinear in Graph for feasibility
27.25/27.33	
27.25/27.33	LOG: RETURN solveLinear in Graph for feasibility
27.25/27.33	Strengthening transition (result): 
27.25/27.33	<l2, l2, arg3 <= arg1 /\ 0 <= arg2 /\ 4 <= arg1 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
27.25/27.33	
27.25/27.33	LOG: CALL solverLinear in Graph for feasibility
27.25/27.33	
27.25/27.33	LOG: RETURN solveLinear in Graph for feasibility
27.25/27.33	Strengthening transition (result): 
27.25/27.33	<l2, l2, arg3 <= arg1 /\ 0 <= arg2 /\ arg3 = 0 /\ arg1 = 3, {arg1 -> 2, arg2 -> 1, arg3 -> 1, rest remain the same}>
27.25/27.33	
27.25/27.33	Checking conditional non-termination of SCC {l2}...
27.25/27.33	EXIT TRANSITIONS:
27.25/27.33	<l2, end, 1 + arg1 <= arg3 /\ 1 <= arg2 /\ 1 <= arg3 /\ 3 <= arg1, {all remain the same}>
27.25/27.33	<l2, end, 1 + arg1 <= arg3 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg1 <= 2, {all remain the same}>
27.25/27.33	<l2, end, 1 + arg1 <= arg3 /\ 1 <= arg3 /\ 3 <= arg1 /\ arg2 = 0, {all remain the same}>
27.25/27.33	<l2, end, 1 + arg1 <= arg3 /\ 1 <= arg1 /\ 1 <= arg3 /\ arg1 <= 2 /\ arg2 = 0, {all remain the same}>
27.25/27.33	
27.25/27.33	Solving with 1 template(s).
27.25/27.33	
27.25/27.33	LOG: CALL solveNonLinearGetFirstSolution
27.25/27.33	
27.25/27.33	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.067440s
27.25/27.33	Time used: 0.066919
27.25/27.33	Improving Solution with cost 1 ...
27.25/27.33	
27.25/27.33	LOG: CALL solveNonLinearGetNextSolution
27.25/27.33	
27.25/27.33	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.062114s
27.25/27.33	Time used: 0.062107
27.25/27.33	
27.25/27.33	LOG: SAT solveNonLinear - Elapsed time: 0.129553s
27.25/27.33	Cost: 1; Total time: 0.129026
27.25/27.33	Failed at location 2: arg3 <= arg1
27.25/27.33	Before Improving: 
27.25/27.33	Quasi-invariant at l2: arg3 <= arg1
27.25/27.33	Optimizing invariants...
27.25/27.33	
27.25/27.33	LOG: CALL solveLinear
27.25/27.33	
27.25/27.33	LOG: RETURN solveLinear - Elapsed time: 0.018603s
27.25/27.33	Remaining time after improvement: 0.995199
27.25/27.33	Non-termination implied by a set of quasi-invariant(s):
27.25/27.33	Quasi-invariant at l2: arg3 <= arg1
27.25/27.33	
27.25/27.33	Strengthening and disabling EXIT transitions...
27.25/27.33	Closed exits from l2: 4
27.25/27.33	
27.25/27.33	Strengthening and disabling transitions...
27.25/27.33	
27.25/27.33	LOG: CALL solverLinear in Graph for feasibility
27.25/27.33	
27.25/27.33	LOG: RETURN solveLinear in Graph for feasibility
27.25/27.33	Strengthening transition (result): 
27.25/27.33	<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ 4 + arg3 <= arg1, {arg3 -> 1 + arg3, rest remain the same}>
27.25/27.33	
27.25/27.33	LOG: CALL solverLinear in Graph for feasibility
27.25/27.33	
27.25/27.33	LOG: RETURN solveLinear in Graph for feasibility
27.25/27.33	Strengthening transition (result): 
27.25/27.33	<l2, l2, 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg1 <= 2 + arg3, {arg3 -> 1 + arg3, rest remain the same}>
27.25/27.33	
27.25/27.33	LOG: CALL solverLinear in Graph for feasibility
27.25/27.33	
27.25/27.33	LOG: RETURN solveLinear in Graph for feasibility
27.25/27.33	Strengthening transition (result): 
27.25/27.33	<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg1 = 3 + arg3, {arg1 -> -1 + arg1, arg3 -> 1 + arg3, rest remain the same}>
27.25/27.33	
27.25/27.33	LOG: CALL solverLinear in Graph for feasibility
27.25/27.33	
27.25/27.33	LOG: RETURN solveLinear in Graph for feasibility
27.25/27.33	Strengthening transition (result): 
27.25/27.33	<l2, l2, 1 <= arg1 /\ 1 <= arg3 /\ 2 + arg3 <= arg1 /\ arg2 = 0, {arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
27.25/27.33	
27.25/27.33	LOG: CALL solverLinear in Graph for feasibility
27.25/27.33	
27.25/27.33	LOG: RETURN solveLinear in Graph for feasibility
27.25/27.33	Strengthening transition (result): 
27.25/27.33	<l2, l2, 1 <= arg1 /\ 1 <= arg3 /\ arg2 = 0 /\ arg1 = 1 + arg3, {arg1 -> -1 + arg1, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
27.25/27.33	
27.25/27.33	LOG: CALL solverLinear in Graph for feasibility
27.25/27.33	
27.25/27.33	LOG: RETURN solveLinear in Graph for feasibility
27.25/27.33	Strengthening transition (result): 
27.25/27.33	<l2, l2, 0 <= arg2 /\ 0 <= arg3 /\ 1 <= arg1 /\ arg1 = arg3, {arg2 -> 0, arg3 -> -1 + arg1, rest remain the same}>
27.25/27.33	
27.25/27.33	LOG: CALL solverLinear in Graph for feasibility
27.25/27.33	
27.25/27.33	LOG: RETURN solveLinear in Graph for feasibility
27.25/27.33	Strengthening transition (result): 
27.25/27.33	<l2, l2, arg3 <= arg1 /\ 0 <= arg2 /\ 1 <= arg1 /\ arg1 <= 2 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
27.25/27.33	
27.25/27.33	LOG: CALL solverLinear in Graph for feasibility
27.25/27.33	
27.25/27.33	LOG: RETURN solveLinear in Graph for feasibility
27.25/27.33	Strengthening transition (result): 
27.25/27.33	<l2, l2, arg3 <= arg1 /\ 0 <= arg2 /\ 4 <= arg1 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
27.25/27.33	
27.25/27.33	LOG: CALL solverLinear in Graph for feasibility
27.25/27.33	
27.25/27.33	LOG: RETURN solveLinear in Graph for feasibility
27.25/27.33	Strengthening transition (result): 
27.25/27.33	<l2, l2, arg3 <= arg1 /\ 0 <= arg2 /\ arg3 = 0 /\ arg1 = 3, {arg1 -> 2, arg2 -> 1, arg3 -> 1, rest remain the same}>
27.25/27.33	
27.25/27.33	Calling reachability with...
27.25/27.33	Transition: <l2, end, true, {all remain the same}>
27.25/27.33	Conditions: 0 <= arg3, arg3 <= arg1, 
27.25/27.33	OPEN EXITS: 
27.25/27.33	<l2, end, arg3 <= arg1 /\ 0 <= arg3, {all remain the same}>
27.25/27.33	
27.25/27.33	--- Reachability graph ---
27.25/27.33	> Graph without transitions.
27.25/27.33	
27.25/27.33	Calling reachability with...
27.25/27.33	Transition: <l0, l2, 0 <= undef74 /\ 1 <= undef73 /\ arg2 = 0 /\ arg3 = undef74 /\ arg1 = 20, {all remain the same}>
27.25/27.33	Conditions: arg3 <= arg1, 0 <= arg3, 
27.25/27.33	OPEN EXITS: 
27.25/27.33	<l0, l2, arg3 <= arg1 /\ 0 <= arg3 /\ 0 <= undef74 /\ 1 <= undef73 /\ arg2 = 0 /\ arg3 = undef74 /\ arg1 = 20, {all remain the same}>
27.25/27.33	
27.25/27.33	> Conditions are reachable!
27.25/27.33	
27.25/27.33	Program does NOT terminate
27.25/27.33	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
27.25/27.33	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
27.25/27.33	EOF