44.63/44.73	NO
44.63/44.73	
44.63/44.73	Solver Timeout: 4
44.63/44.73	Global Timeout: 300
44.63/44.73	No parsing errors!
44.63/44.73	Init Location: 0
44.63/44.73	Transitions:
44.63/44.73	<l0, l6, true>
44.63/44.73	<l1, l2, ((arg2 + 15) > arg2) /\ (arg2 > ~(1)) /\ (arg1 > 0), par{arg1 -> 20, arg2 -> 0, arg3 -> (arg2 + 15), arg4 -> undef4, arg5 -> undef5}>
44.63/44.73	<l2, l3, (arg3 > 0) /\ (arg3 < arg1) /\ (arg1 > ~(1)) /\ (arg2 < 0), par{arg1 -> arg3, arg2 -> arg1, arg3 -> arg2, arg4 -> (arg3 + 1), arg5 -> (arg1 - 2)}>
44.63/44.73	<l2, l3, (arg3 > 0) /\ (arg3 < arg1) /\ (arg1 > ~(1)) /\ (arg2 > 0), par{arg1 -> arg3, arg2 -> arg1, arg3 -> arg2, arg4 -> (arg3 + 1), arg5 -> (arg1 - 2)}>
44.63/44.73	<l2, l4, (arg1 > ~(1)) /\ (arg3 > 0) /\ (arg3 < arg1) /\ (0 = arg2), par{arg1 -> arg3, arg2 -> arg1, arg3 -> (arg3 - 1), arg4 -> (arg1 - 2), arg5 -> undef20}>
44.63/44.73	<l2, l5, (arg1 > 0) /\ (arg1 = arg3), par{arg2 -> (arg1 - 1), arg3 -> (arg1 - 2), arg4 -> undef24, arg5 -> undef25}>
44.63/44.73	<l3, l2, (arg1 > 0) /\ (arg4 > 1) /\ (arg1 < arg2) /\ (arg5 > arg4), par{arg1 -> arg2, arg2 -> arg3, arg3 -> arg4, arg4 -> undef29, arg5 -> undef30}>
44.63/44.73	<l3, l2, (arg1 > 0) /\ (arg4 > 1) /\ (arg1 > arg2) /\ (arg5 > arg4), par{arg1 -> arg2, arg2 -> arg3, arg3 -> arg4, arg4 -> undef34, arg5 -> undef35}>
44.63/44.73	<l3, l2, (arg1 > 0) /\ (arg4 > 1) /\ (arg1 < arg2) /\ (arg5 < arg4), par{arg1 -> arg2, arg2 -> arg3, arg3 -> arg4, arg4 -> undef39, arg5 -> undef40}>
44.63/44.73	<l3, l2, (arg1 > 0) /\ (arg4 > 1) /\ (arg1 > arg2) /\ (arg5 < arg4), par{arg1 -> arg2, arg2 -> arg3, arg3 -> arg4, arg4 -> undef44, arg5 -> undef45}>
44.63/44.73	<l4, l2, (arg1 > 0) /\ (arg2 > arg1) /\ (arg4 > arg3), par{arg1 -> arg2, arg2 -> 0, arg4 -> undef49, arg5 -> undef50}>
44.63/44.73	<l4, l2, (arg1 > 0) /\ (arg2 < arg1) /\ (arg4 > arg3), par{arg1 -> arg2, arg2 -> 0, arg4 -> undef54, arg5 -> undef55}>
44.63/44.73	<l4, l2, (arg1 > 0) /\ (arg2 > arg1) /\ (arg4 < arg3), par{arg1 -> arg2, arg2 -> 0, arg4 -> undef59, arg5 -> undef60}>
44.63/44.73	<l4, l2, (arg1 > 0) /\ (arg2 < arg1) /\ (arg4 < arg3), par{arg1 -> arg2, arg2 -> 0, arg4 -> undef64, arg5 -> undef65}>
44.63/44.73	<l3, l2, (arg1 > 0) /\ (arg4 <= (arg2 - 1)) /\ (arg4 = arg5), par{arg1 -> (arg2 - 1), arg2 -> arg3, arg3 -> arg4, arg4 -> undef69, arg5 -> undef70}>
44.63/44.73	<l4, l2, (arg1 > 0) /\ (arg3 <= (arg2 - 1)) /\ (arg3 = arg4), par{arg1 -> (arg2 - 1), arg2 -> 0, arg4 -> undef74, arg5 -> undef75}>
44.63/44.73	<l5, l2, (arg3 > arg2), par{arg2 -> 0, arg3 -> arg2, arg4 -> undef79, arg5 -> undef80}>
44.63/44.73	<l5, l2, (arg3 < arg2), par{arg2 -> 0, arg3 -> arg2, arg4 -> undef84, arg5 -> undef85}>
44.63/44.73	<l2, l2, (arg1 > 0) /\ (arg1 < 3) /\ (0 = arg3), par{arg2 -> 1, arg3 -> 1, arg4 -> undef89, arg5 -> undef90}>
44.63/44.73	<l2, l2, (arg1 > 3) /\ (0 = arg3), par{arg2 -> 1, arg3 -> 1, arg4 -> undef94, arg5 -> undef95}>
44.63/44.73	<l5, l2, (arg2 < arg1) /\ (arg2 <= (arg1 - 1)) /\ (arg2 = arg3), par{arg1 -> (arg1 - 1), arg2 -> 0, arg3 -> arg2, arg4 -> undef99, arg5 -> undef100}>
44.63/44.73	<l2, l2, (3 = arg1) /\ (0 = arg3), par{arg1 -> 2, arg2 -> 1, arg3 -> 1, arg4 -> undef104, arg5 -> undef105}>
44.63/44.73	<l2, l2, (0 = arg1) /\ (0 = arg3), par{arg1 -> 0, arg2 -> 0, arg3 -> ~(1), arg4 -> undef109, arg5 -> undef110}>
44.63/44.73	<l6, l1, true, par{arg1 -> undef111, arg2 -> undef112, arg3 -> undef113, arg4 -> undef114, arg5 -> undef115}>
44.63/44.73	
44.63/44.73	Fresh variables:
44.63/44.73	undef4, undef5, undef20, undef24, undef25, undef29, undef30, undef34, undef35, undef39, undef40, undef44, undef45, undef49, undef50, undef54, undef55, undef59, undef60, undef64, undef65, undef69, undef70, undef74, undef75, undef79, undef80, undef84, undef85, undef89, undef90, undef94, undef95, undef99, undef100, undef104, undef105, undef109, undef110, undef111, undef112, undef113, undef114, undef115, 
44.63/44.73	
44.63/44.73	Undef variables:
44.63/44.73	undef4, undef5, undef20, undef24, undef25, undef29, undef30, undef34, undef35, undef39, undef40, undef44, undef45, undef49, undef50, undef54, undef55, undef59, undef60, undef64, undef65, undef69, undef70, undef74, undef75, undef79, undef80, undef84, undef85, undef89, undef90, undef94, undef95, undef99, undef100, undef104, undef105, undef109, undef110, undef111, undef112, undef113, undef114, undef115, 
44.63/44.73	
44.63/44.73	Abstraction variables:
44.63/44.73	
44.63/44.73	Exit nodes:
44.63/44.73	
44.63/44.73	Accepting locations:
44.63/44.73	
44.63/44.73	Asserts:
44.63/44.73	
44.63/44.73	Preprocessed LLVMGraph
44.63/44.73	Init Location: 0
44.63/44.73	Transitions:
44.63/44.73	<l0, l2, (arg1 = 20) /\ (arg2 = 0) /\ (arg3 = (undef112 + 15)) /\ ((undef112 + 15) > undef112) /\ (undef112 > ~(1)) /\ (undef111 > 0)>
44.63/44.73	<l2, l2, (arg3 > 0) /\ (arg3 < arg1) /\ (arg1 > ~(1)) /\ (arg2 < 0) /\ (arg3 > 0) /\ ((arg3 + 1) > 1) /\ (arg3 < arg1) /\ ((arg1 - 2) > (arg3 + 1)), par{arg1 -> arg1, arg2 -> arg2, arg3 -> (arg3 + 1)}>
44.63/44.73	<l2, l2, (arg3 > 0) /\ (arg3 < arg1) /\ (arg1 > ~(1)) /\ (arg2 < 0) /\ (arg3 > 0) /\ ((arg3 + 1) > 1) /\ (arg3 < arg1) /\ ((arg1 - 2) < (arg3 + 1)), par{arg1 -> arg1, arg2 -> arg2, arg3 -> (arg3 + 1)}>
44.63/44.73	<l2, l2, (arg3 > 0) /\ (arg3 < arg1) /\ (arg1 > ~(1)) /\ (arg2 < 0) /\ (arg3 > 0) /\ ((arg3 + 1) <= (arg1 - 1)) /\ ((arg3 + 1) = (arg1 - 2)), par{arg1 -> (arg1 - 1), arg2 -> arg2, arg3 -> (arg3 + 1)}>
44.63/44.73	<l2, l2, (arg3 > 0) /\ (arg3 < arg1) /\ (arg1 > ~(1)) /\ (arg2 > 0) /\ (arg3 > 0) /\ ((arg3 + 1) > 1) /\ (arg3 < arg1) /\ ((arg1 - 2) > (arg3 + 1)), par{arg1 -> arg1, arg2 -> arg2, arg3 -> (arg3 + 1)}>
44.63/44.73	<l2, l2, (arg3 > 0) /\ (arg3 < arg1) /\ (arg1 > ~(1)) /\ (arg2 > 0) /\ (arg3 > 0) /\ ((arg3 + 1) > 1) /\ (arg3 < arg1) /\ ((arg1 - 2) < (arg3 + 1)), par{arg1 -> arg1, arg2 -> arg2, arg3 -> (arg3 + 1)}>
44.63/44.73	<l2, l2, (arg3 > 0) /\ (arg3 < arg1) /\ (arg1 > ~(1)) /\ (arg2 > 0) /\ (arg3 > 0) /\ ((arg3 + 1) <= (arg1 - 1)) /\ ((arg3 + 1) = (arg1 - 2)), par{arg1 -> (arg1 - 1), arg2 -> arg2, arg3 -> (arg3 + 1)}>
44.63/44.73	<l2, l2, (arg1 > ~(1)) /\ (arg3 > 0) /\ (arg3 < arg1) /\ (0 = arg2) /\ (arg3 > 0) /\ (arg1 > arg3) /\ ((arg1 - 2) > (arg3 - 1)), par{arg1 -> arg1, arg2 -> 0, arg3 -> (arg3 - 1)}>
44.63/44.73	<l2, l2, (arg1 > ~(1)) /\ (arg3 > 0) /\ (arg3 < arg1) /\ (0 = arg2) /\ (arg3 > 0) /\ ((arg3 - 1) <= (arg1 - 1)) /\ ((arg3 - 1) = (arg1 - 2)), par{arg1 -> (arg1 - 1), arg2 -> 0, arg3 -> (arg3 - 1)}>
44.63/44.73	<l2, l2, (arg1 > 0) /\ (arg1 = arg3) /\ ((arg1 - 2) < (arg1 - 1)), par{arg2 -> 0, arg3 -> (arg1 - 1)}>
44.63/44.73	<l2, l2, (arg1 > 0) /\ (arg1 < 3) /\ (0 = arg3), par{arg2 -> 1, arg3 -> 1}>
44.63/44.73	<l2, l2, (arg1 > 3) /\ (0 = arg3), par{arg2 -> 1, arg3 -> 1}>
44.63/44.73	<l2, l2, (3 = arg1) /\ (0 = arg3), par{arg1 -> 2, arg2 -> 1, arg3 -> 1}>
44.63/44.73	<l2, l2, (0 = arg1) /\ (0 = arg3), par{arg1 -> 0, arg2 -> 0, arg3 -> ~(1)}>
44.63/44.73	
44.63/44.73	Fresh variables:
44.63/44.73	undef4, undef5, undef20, undef24, undef25, undef29, undef30, undef34, undef35, undef39, undef40, undef44, undef45, undef49, undef50, undef54, undef55, undef59, undef60, undef64, undef65, undef69, undef70, undef74, undef75, undef79, undef80, undef84, undef85, undef89, undef90, undef94, undef95, undef99, undef100, undef104, undef105, undef109, undef110, undef111, undef112, undef113, undef114, undef115, 
44.63/44.73	
44.63/44.73	Undef variables:
44.63/44.73	undef4, undef5, undef20, undef24, undef25, undef29, undef30, undef34, undef35, undef39, undef40, undef44, undef45, undef49, undef50, undef54, undef55, undef59, undef60, undef64, undef65, undef69, undef70, undef74, undef75, undef79, undef80, undef84, undef85, undef89, undef90, undef94, undef95, undef99, undef100, undef104, undef105, undef109, undef110, undef111, undef112, undef113, undef114, undef115, 
44.63/44.73	
44.63/44.73	Abstraction variables:
44.63/44.73	
44.63/44.73	Exit nodes:
44.63/44.73	
44.63/44.73	Accepting locations:
44.63/44.73	
44.63/44.73	Asserts:
44.63/44.73	
44.63/44.73	*************************************************************
44.63/44.73	*******************************************************************************************
44.63/44.73	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
44.63/44.73	*******************************************************************************************
44.63/44.73	
44.63/44.73	Init Location: 0
44.63/44.73	Graph 0:
44.63/44.73	Transitions:
44.63/44.73	Variables:
44.63/44.73	
44.63/44.73	Graph 1:
44.63/44.73	Transitions:
44.63/44.73	<l2, l2, 1 + arg2 <= 0 /\ 1 <= arg3 /\ 0 <= arg1 /\ 4 + arg3 <= arg1, {arg3 -> 1 + arg3, rest remain the same}>
44.63/44.73	<l2, l2, 1 + arg3 <= arg1 /\ 1 + arg2 <= 0 /\ 1 <= arg3 /\ 0 <= arg1 /\ arg1 <= 2 + arg3, {arg3 -> 1 + arg3, rest remain the same}>
44.63/44.73	<l2, l2, 1 + arg2 <= 0 /\ 1 <= arg3 /\ 0 <= arg1 /\ arg1 = 3 + arg3, {arg1 -> -1 + arg1, arg3 -> 1 + arg3, rest remain the same}>
44.63/44.73	<l2, l2, 1 <= arg2 /\ 1 <= arg3 /\ 0 <= arg1 /\ 4 + arg3 <= arg1, {arg3 -> 1 + arg3, rest remain the same}>
44.63/44.73	<l2, l2, 1 + arg3 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ 0 <= arg1 /\ arg1 <= 2 + arg3, {arg3 -> 1 + arg3, rest remain the same}>
44.63/44.73	<l2, l2, 1 <= arg2 /\ 1 <= arg3 /\ 0 <= arg1 /\ arg1 = 3 + arg3, {arg1 -> -1 + arg1, arg3 -> 1 + arg3, rest remain the same}>
44.63/44.73	<l2, l2, 1 <= arg3 /\ 0 <= arg1 /\ 2 + arg3 <= arg1 /\ arg2 = 0, {arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
44.63/44.73	<l2, l2, 1 <= arg3 /\ 0 <= arg1 /\ arg1 = 1 + arg3 /\ arg2 = 0, {arg1 -> -1 + arg1, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
44.63/44.73	<l2, l2, 1 <= arg1 /\ arg1 = arg3, {arg2 -> 0, arg3 -> -1 + arg1, rest remain the same}>
44.63/44.73	<l2, l2, 1 <= arg1 /\ arg1 <= 2 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
44.63/44.73	<l2, l2, 4 <= arg1 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
44.63/44.73	<l2, l2, arg3 = 0 /\ arg1 = 3, {arg1 -> 2, arg2 -> 1, arg3 -> 1, rest remain the same}>
44.63/44.73	<l2, l2, arg1 = 0 /\ arg3 = 0, {arg1 -> 0, arg2 -> 0, arg3 -> -1, rest remain the same}>
44.63/44.73	Variables:
44.63/44.73	arg1, arg2, arg3
44.63/44.73	
44.63/44.73	Precedence: 
44.63/44.73	Graph 0
44.63/44.73	
44.63/44.73	Graph 1
44.63/44.73	<l0, l2, 1 <= undef111 /\ 0 <= undef112 /\ arg2 = 0 /\ arg1 = 20 /\ arg3 = 15 + undef112, {all remain the same}>
44.63/44.73	
44.63/44.73	Map Locations to Subgraph:
44.63/44.73	( 0 , 0 )
44.63/44.73	( 2 , 1 )
44.63/44.73	
44.63/44.73	*******************************************************************************************
44.63/44.73	********************************    CHECKING ASSERTIONS    ********************************
44.63/44.73	*******************************************************************************************
44.63/44.73	
44.63/44.73	Proving termination of subgraph 0
44.63/44.73	Proving termination of subgraph 1
44.63/44.73	Checking unfeasibility...
44.63/44.73	Time used: 0.103539
44.63/44.73	Some transition disabled by a set of invariant(s):
44.63/44.73	Invariant at l2: 1 <= arg1
44.63/44.73	
44.63/44.73	Strengthening and disabling transitions...
44.63/44.73	> It's unfeasible. Removing transition: 
44.63/44.73	<l2, l2, arg1 = 0 /\ arg3 = 0, {arg1 -> 0, arg2 -> 0, arg3 -> -1, rest remain the same}>
44.63/44.73	
44.63/44.73	LOG: CALL solverLinear in Graph for feasibility
44.63/44.73	
44.63/44.73	LOG: RETURN solveLinear in Graph for feasibility
44.63/44.73	Strengthening transition (result): 
44.63/44.73	<l2, l2, 1 <= arg1 /\ 1 + arg2 <= 0 /\ 1 <= arg3 /\ 4 + arg3 <= arg1, {arg3 -> 1 + arg3, rest remain the same}>
44.63/44.73	
44.63/44.73	LOG: CALL solverLinear in Graph for feasibility
44.63/44.73	
44.63/44.73	LOG: RETURN solveLinear in Graph for feasibility
44.63/44.73	Strengthening transition (result): 
44.63/44.73	<l2, l2, 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 + arg2 <= 0 /\ 1 <= arg3 /\ arg1 <= 2 + arg3, {arg3 -> 1 + arg3, rest remain the same}>
44.63/44.73	
44.63/44.73	LOG: CALL solverLinear in Graph for feasibility
44.63/44.73	
44.63/44.73	LOG: RETURN solveLinear in Graph for feasibility
44.63/44.73	Strengthening transition (result): 
44.63/44.73	<l2, l2, 1 <= arg1 /\ 1 + arg2 <= 0 /\ 1 <= arg3 /\ arg1 = 3 + arg3, {arg1 -> -1 + arg1, arg3 -> 1 + arg3, rest remain the same}>
44.63/44.73	
44.63/44.73	LOG: CALL solverLinear in Graph for feasibility
44.63/44.73	
44.63/44.73	LOG: RETURN solveLinear in Graph for feasibility
44.63/44.73	Strengthening transition (result): 
44.63/44.73	<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ 4 + arg3 <= arg1, {arg3 -> 1 + arg3, rest remain the same}>
44.63/44.73	
44.63/44.73	LOG: CALL solverLinear in Graph for feasibility
44.63/44.73	
44.63/44.73	LOG: RETURN solveLinear in Graph for feasibility
44.63/44.73	Strengthening transition (result): 
44.63/44.73	<l2, l2, 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg1 <= 2 + arg3, {arg3 -> 1 + arg3, rest remain the same}>
44.63/44.73	
44.63/44.73	LOG: CALL solverLinear in Graph for feasibility
44.63/44.73	
44.63/44.73	LOG: RETURN solveLinear in Graph for feasibility
44.63/44.73	Strengthening transition (result): 
44.63/44.73	<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg1 = 3 + arg3, {arg1 -> -1 + arg1, arg3 -> 1 + arg3, rest remain the same}>
44.63/44.73	
44.63/44.73	LOG: CALL solverLinear in Graph for feasibility
44.63/44.73	
44.63/44.73	LOG: RETURN solveLinear in Graph for feasibility
44.63/44.73	Strengthening transition (result): 
44.63/44.73	<l2, l2, 1 <= arg1 /\ 1 <= arg3 /\ 2 + arg3 <= arg1 /\ arg2 = 0, {arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
44.63/44.73	
44.63/44.73	LOG: CALL solverLinear in Graph for feasibility
44.63/44.73	
44.63/44.73	LOG: RETURN solveLinear in Graph for feasibility
44.63/44.73	Strengthening transition (result): 
44.63/44.73	<l2, l2, 1 <= arg1 /\ 1 <= arg3 /\ arg1 = 1 + arg3 /\ arg2 = 0, {arg1 -> -1 + arg1, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
44.63/44.73	
44.63/44.73	LOG: CALL solverLinear in Graph for feasibility
44.63/44.73	
44.63/44.73	LOG: RETURN solveLinear in Graph for feasibility
44.63/44.73	Strengthening transition (result): 
44.63/44.73	<l2, l2, 1 <= arg1 /\ arg1 = arg3, {arg2 -> 0, arg3 -> -1 + arg1, rest remain the same}>
44.63/44.73	
44.63/44.73	LOG: CALL solverLinear in Graph for feasibility
44.63/44.73	
44.63/44.73	LOG: RETURN solveLinear in Graph for feasibility
44.63/44.73	Strengthening transition (result): 
44.63/44.73	<l2, l2, 1 <= arg1 /\ arg1 <= 2 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
44.63/44.73	
44.63/44.73	LOG: CALL solverLinear in Graph for feasibility
44.63/44.73	
44.63/44.73	LOG: RETURN solveLinear in Graph for feasibility
44.63/44.73	Strengthening transition (result): 
44.63/44.73	<l2, l2, 4 <= arg1 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
44.63/44.73	
44.63/44.73	LOG: CALL solverLinear in Graph for feasibility
44.63/44.73	
44.63/44.73	LOG: RETURN solveLinear in Graph for feasibility
44.63/44.73	Strengthening transition (result): 
44.63/44.73	<l2, l2, arg3 = 0 /\ arg1 = 3, {arg1 -> 2, arg2 -> 1, arg3 -> 1, rest remain the same}>
44.63/44.73	Checking unfeasibility...
44.63/44.73	Time used: 0.086439
44.63/44.73	Some transition disabled by a set of invariant(s):
44.63/44.73	Invariant at l2: 0 <= arg2
44.63/44.73	
44.63/44.73	Strengthening and disabling transitions...
44.63/44.73	> It's unfeasible. Removing transition: 
44.63/44.73	<l2, l2, 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 + arg2 <= 0 /\ 1 <= arg3 /\ arg1 <= 2 + arg3, {arg3 -> 1 + arg3, rest remain the same}>
44.63/44.73	
44.63/44.73	LOG: CALL solverLinear in Graph for feasibility
44.63/44.73	
44.63/44.73	LOG: RETURN solveLinear in Graph for feasibility
44.63/44.73	It's unfeasible. Removing transition: 
44.63/44.73	<l2, l2, 1 <= arg1 /\ 1 + arg2 <= 0 /\ 1 <= arg3 /\ 4 + arg3 <= arg1, {arg3 -> 1 + arg3, rest remain the same}>
44.63/44.73	
44.63/44.73	LOG: CALL solverLinear in Graph for feasibility
44.63/44.73	
44.63/44.73	LOG: RETURN solveLinear in Graph for feasibility
44.63/44.73	It's unfeasible. Removing transition: 
44.63/44.73	<l2, l2, 1 <= arg1 /\ 1 + arg2 <= 0 /\ 1 <= arg3 /\ arg1 = 3 + arg3, {arg1 -> -1 + arg1, arg3 -> 1 + arg3, rest remain the same}>
44.63/44.73	
44.63/44.73	LOG: CALL solverLinear in Graph for feasibility
44.63/44.73	
44.63/44.73	LOG: RETURN solveLinear in Graph for feasibility
44.63/44.73	Strengthening transition (result): 
44.63/44.73	<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ 4 + arg3 <= arg1, {arg3 -> 1 + arg3, rest remain the same}>
44.63/44.73	
44.63/44.73	LOG: CALL solverLinear in Graph for feasibility
44.63/44.73	
44.63/44.73	LOG: RETURN solveLinear in Graph for feasibility
44.63/44.73	Strengthening transition (result): 
44.63/44.73	<l2, l2, 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg1 <= 2 + arg3, {arg3 -> 1 + arg3, rest remain the same}>
44.63/44.73	
44.63/44.73	LOG: CALL solverLinear in Graph for feasibility
44.63/44.73	
44.63/44.73	LOG: RETURN solveLinear in Graph for feasibility
44.63/44.73	Strengthening transition (result): 
44.63/44.73	<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg1 = 3 + arg3, {arg1 -> -1 + arg1, arg3 -> 1 + arg3, rest remain the same}>
44.63/44.73	
44.63/44.73	LOG: CALL solverLinear in Graph for feasibility
44.63/44.73	
44.63/44.73	LOG: RETURN solveLinear in Graph for feasibility
44.63/44.73	Strengthening transition (result): 
44.63/44.73	<l2, l2, 1 <= arg1 /\ 1 <= arg3 /\ 2 + arg3 <= arg1 /\ arg2 = 0, {arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
44.63/44.73	
44.63/44.73	LOG: CALL solverLinear in Graph for feasibility
44.63/44.73	
44.63/44.73	LOG: RETURN solveLinear in Graph for feasibility
44.63/44.73	Strengthening transition (result): 
44.63/44.73	<l2, l2, 1 <= arg1 /\ 1 <= arg3 /\ arg1 = 1 + arg3 /\ arg2 = 0, {arg1 -> -1 + arg1, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
44.63/44.73	
44.63/44.73	LOG: CALL solverLinear in Graph for feasibility
44.63/44.73	
44.63/44.73	LOG: RETURN solveLinear in Graph for feasibility
44.63/44.73	Strengthening transition (result): 
44.63/44.73	<l2, l2, 1 <= arg1 /\ 0 <= arg2 /\ arg1 = arg3, {arg2 -> 0, arg3 -> -1 + arg1, rest remain the same}>
44.63/44.73	
44.63/44.73	LOG: CALL solverLinear in Graph for feasibility
44.63/44.73	
44.63/44.73	LOG: RETURN solveLinear in Graph for feasibility
44.63/44.73	Strengthening transition (result): 
44.63/44.73	<l2, l2, 1 <= arg1 /\ 0 <= arg2 /\ arg1 <= 2 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
44.63/44.73	
44.63/44.73	LOG: CALL solverLinear in Graph for feasibility
44.63/44.73	
44.63/44.73	LOG: RETURN solveLinear in Graph for feasibility
44.63/44.73	Strengthening transition (result): 
44.63/44.73	<l2, l2, 0 <= arg2 /\ 4 <= arg1 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
44.63/44.73	
44.63/44.73	LOG: CALL solverLinear in Graph for feasibility
44.63/44.73	
44.63/44.73	LOG: RETURN solveLinear in Graph for feasibility
44.63/44.73	Strengthening transition (result): 
44.63/44.73	<l2, l2, 0 <= arg2 /\ arg3 = 0 /\ arg1 = 3, {arg1 -> 2, arg2 -> 1, arg3 -> 1, rest remain the same}>
44.63/44.73	Checking unfeasibility...
44.63/44.73	Time used: 4.00081
44.63/44.73	
44.63/44.73	Checking conditional termination of SCC {l2}...
44.63/44.73	
44.63/44.73	LOG: CALL solveLinear
44.63/44.73	
44.63/44.73	LOG: RETURN solveLinear - Elapsed time: 0.019566s
44.63/44.73	Ranking function: -16 + 4*arg1
44.63/44.73	New Graphs: 
44.63/44.73	Transitions:
44.63/44.73	<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ 4 + arg3 <= arg1, {arg3 -> 1 + arg3, rest remain the same}>
44.63/44.73	<l2, l2, 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg1 <= 2 + arg3, {arg3 -> 1 + arg3, rest remain the same}>
44.63/44.73	<l2, l2, 1 <= arg1 /\ 1 <= arg3 /\ 2 + arg3 <= arg1 /\ arg2 = 0, {arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
44.63/44.73	<l2, l2, 1 <= arg1 /\ 1 <= arg3 /\ arg1 = 1 + arg3 /\ arg2 = 0, {arg1 -> -1 + arg1, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
44.63/44.73	<l2, l2, 1 <= arg1 /\ 0 <= arg2 /\ arg1 = arg3, {arg2 -> 0, arg3 -> -1 + arg1, rest remain the same}>
44.63/44.73	<l2, l2, 1 <= arg1 /\ 0 <= arg2 /\ arg1 <= 2 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
44.63/44.73	<l2, l2, 0 <= arg2 /\ 4 <= arg1 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
44.63/44.73	<l2, l2, 0 <= arg2 /\ arg3 = 0 /\ arg1 = 3, {arg1 -> 2, arg2 -> 1, arg3 -> 1, rest remain the same}>
44.63/44.73	Variables:
44.63/44.73	arg1, arg2, arg3
44.63/44.73	Checking conditional termination of SCC {l2}...
44.63/44.73	
44.63/44.73	LOG: CALL solveLinear
44.63/44.73	
44.63/44.73	LOG: RETURN solveLinear - Elapsed time: 0.005230s
44.63/44.73	Ranking function: -6 + 3*arg1
44.63/44.73	New Graphs: 
44.63/44.73	Transitions:
44.63/44.73	<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ 4 + arg3 <= arg1, {arg3 -> 1 + arg3, rest remain the same}>
44.63/44.73	<l2, l2, 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg1 <= 2 + arg3, {arg3 -> 1 + arg3, rest remain the same}>
44.63/44.73	<l2, l2, 1 <= arg1 /\ 1 <= arg3 /\ 2 + arg3 <= arg1 /\ arg2 = 0, {arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
44.63/44.73	<l2, l2, 1 <= arg1 /\ 0 <= arg2 /\ arg1 = arg3, {arg2 -> 0, arg3 -> -1 + arg1, rest remain the same}>
44.63/44.73	<l2, l2, 1 <= arg1 /\ 0 <= arg2 /\ arg1 <= 2 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
44.63/44.73	<l2, l2, 0 <= arg2 /\ 4 <= arg1 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
44.63/44.73	Variables:
44.63/44.73	arg1, arg2, arg3
44.63/44.73	Checking conditional termination of SCC {l2}...
44.63/44.73	
44.63/44.73	LOG: CALL solveLinear
44.63/44.73	
44.63/44.73	LOG: RETURN solveLinear - Elapsed time: 0.003105s
44.63/44.73	
44.63/44.73	LOG: CALL solveLinear
44.63/44.73	
44.63/44.73	LOG: RETURN solveLinear - Elapsed time: 0.201929s
44.63/44.73	Trying to remove transition: <l2, l2, 0 <= arg2 /\ 4 <= arg1 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
44.63/44.73	Solving with 1 template(s).
44.63/44.73	
44.63/44.73	LOG: CALL solveNonLinearGetFirstSolution
44.63/44.73	
44.63/44.73	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.034875s
44.63/44.73	Time used: 0.032778
44.63/44.73	Trying to remove transition: <l2, l2, 1 <= arg1 /\ 0 <= arg2 /\ arg1 <= 2 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
44.63/44.73	Solving with 1 template(s).
44.63/44.73	
44.63/44.73	LOG: CALL solveNonLinearGetFirstSolution
44.63/44.73	
44.63/44.73	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.037534s
44.63/44.73	Time used: 0.034218
44.63/44.73	Trying to remove transition: <l2, l2, 1 <= arg1 /\ 0 <= arg2 /\ arg1 = arg3, {arg2 -> 0, arg3 -> -1 + arg1, rest remain the same}>
44.63/44.73	Solving with 1 template(s).
44.63/44.73	
44.63/44.73	LOG: CALL solveNonLinearGetFirstSolution
44.63/44.73	
44.63/44.73	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.041787s
44.63/44.73	Time used: 0.038442
44.63/44.73	Trying to remove transition: <l2, l2, 1 <= arg1 /\ 1 <= arg3 /\ 2 + arg3 <= arg1 /\ arg2 = 0, {arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
44.63/44.73	Solving with 1 template(s).
44.63/44.73	
44.63/44.73	LOG: CALL solveNonLinearGetFirstSolution
44.63/44.73	
44.63/44.73	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.036277s
44.63/44.73	Time used: 0.03293
44.63/44.73	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}>
44.63/44.73	Solving with 1 template(s).
44.63/44.73	
44.63/44.73	LOG: CALL solveNonLinearGetFirstSolution
44.63/44.73	
44.63/44.73	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.045463s
44.63/44.73	Time used: 0.042086
44.63/44.73	Trying to remove transition: <l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ 4 + arg3 <= arg1, {arg3 -> 1 + arg3, rest remain the same}>
44.63/44.73	Solving with 1 template(s).
44.63/44.73	
44.63/44.73	LOG: CALL solveNonLinearGetFirstSolution
44.63/44.73	
44.63/44.73	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.046504s
44.63/44.73	Time used: 0.040654
44.63/44.73	Solving with 1 template(s).
44.63/44.73	
44.63/44.73	LOG: CALL solveNonLinearGetFirstSolution
44.63/44.73	
44.63/44.73	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.264597s
44.63/44.73	Time used: 0.260721
44.63/44.73	Improving Solution with cost 1 ...
44.63/44.73	
44.63/44.73	LOG: CALL solveNonLinearGetNextSolution
44.63/44.73	
44.63/44.73	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001504s
44.63/44.73	Time used: 1.00128
44.63/44.73	
44.63/44.73	LOG: SAT solveNonLinear - Elapsed time: 1.266101s
44.63/44.73	Cost: 1; Total time: 1.26201
44.63/44.73	Failed at location 2: arg1 <= 1 + arg3
44.63/44.73	Before Improving: 
44.63/44.73	Quasi-invariant at l2: arg1 <= 1 + arg3
44.63/44.73	Optimizing invariants...
44.63/44.73	
44.63/44.73	LOG: CALL solveLinear
44.63/44.73	
44.63/44.73	LOG: RETURN solveLinear - Elapsed time: 0.012568s
44.63/44.73	Remaining time after improvement: 0.992396
44.63/44.73	Termination implied by a set of quasi-invariant(s):
44.63/44.73	Quasi-invariant at l2: arg1 <= 1 + arg3
44.63/44.73	[ Invariant Graph ]
44.63/44.73	Strengthening and disabling transitions...
44.63/44.73	
44.63/44.73	LOG: CALL solverLinear in Graph for feasibility
44.63/44.73	
44.63/44.73	LOG: RETURN solveLinear in Graph for feasibility
44.63/44.73	It's unfeasible. Removing transition: 
44.63/44.73	<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ 4 + arg3 <= arg1, {arg3 -> 1 + arg3, rest remain the same}>
44.63/44.73	
44.63/44.73	LOG: CALL solverLinear in Graph for feasibility
44.63/44.73	
44.63/44.73	LOG: RETURN solveLinear in Graph for feasibility
44.63/44.73	Strengthening transition (result): 
44.63/44.73	<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg1 = 1 + arg3, {arg3 -> 1 + arg3, rest remain the same}>
44.63/44.73	
44.63/44.73	LOG: CALL solverLinear in Graph for feasibility
44.63/44.73	
44.63/44.73	LOG: RETURN solveLinear in Graph for feasibility
44.63/44.73	It's unfeasible. Removing transition: 
44.63/44.73	<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg1 = 3 + arg3, {arg1 -> -1 + arg1, arg3 -> 1 + arg3, rest remain the same}>
44.63/44.73	
44.63/44.73	LOG: CALL solverLinear in Graph for feasibility
44.63/44.73	
44.63/44.73	LOG: RETURN solveLinear in Graph for feasibility
44.63/44.73	It's unfeasible. Removing transition: 
44.63/44.73	<l2, l2, 1 <= arg1 /\ 1 <= arg3 /\ 2 + arg3 <= arg1 /\ arg2 = 0, {arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
44.63/44.73	
44.63/44.73	LOG: CALL solverLinear in Graph for feasibility
44.63/44.73	
44.63/44.73	LOG: RETURN solveLinear in Graph for feasibility
44.63/44.73	Strengthening transition (result): 
44.63/44.73	<l2, l2, 1 <= arg1 /\ 1 <= arg3 /\ arg1 = 1 + arg3 /\ arg2 = 0, {arg1 -> -1 + arg1, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
44.63/44.73	
44.63/44.73	LOG: CALL solverLinear in Graph for feasibility
44.63/44.73	
44.63/44.73	LOG: RETURN solveLinear in Graph for feasibility
44.63/44.73	Strengthening transition (result): 
44.63/44.73	<l2, l2, 1 <= arg1 /\ 0 <= arg2 /\ arg1 = arg3, {arg2 -> 0, arg3 -> -1 + arg1, rest remain the same}>
44.63/44.73	
44.63/44.73	LOG: CALL solverLinear in Graph for feasibility
44.63/44.73	
44.63/44.73	LOG: RETURN solveLinear in Graph for feasibility
44.63/44.73	Strengthening transition (result): 
44.63/44.73	<l2, l2, 1 <= arg1 /\ arg1 <= 1 + arg3 /\ 0 <= arg2 /\ arg1 <= 2 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
44.63/44.73	
44.63/44.73	LOG: CALL solverLinear in Graph for feasibility
44.63/44.73	
44.63/44.73	LOG: RETURN solveLinear in Graph for feasibility
44.63/44.73	It's unfeasible. Removing transition: 
44.63/44.73	<l2, l2, 0 <= arg2 /\ 4 <= arg1 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
44.63/44.73	
44.63/44.73	LOG: CALL solverLinear in Graph for feasibility
44.63/44.73	
44.63/44.73	LOG: RETURN solveLinear in Graph for feasibility
44.63/44.73	It's unfeasible. Removing transition: 
44.63/44.73	<l2, l2, 0 <= arg2 /\ arg3 = 0 /\ arg1 = 3, {arg1 -> 2, arg2 -> 1, arg3 -> 1, rest remain the same}>
44.63/44.73	[ Termination Graph ]
44.63/44.73	Strengthening and disabling transitions...
44.63/44.73	
44.63/44.73	LOG: CALL solverLinear in Graph for feasibility
44.63/44.73	
44.63/44.73	LOG: RETURN solveLinear in Graph for feasibility
44.63/44.73	It's unfeasible. Removing transition: 
44.63/44.73	<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ 4 + arg3 <= arg1, {arg3 -> 1 + arg3, rest remain the same}>
44.63/44.73	
44.63/44.73	LOG: CALL solverLinear in Graph for feasibility
44.63/44.73	
44.63/44.73	LOG: RETURN solveLinear in Graph for feasibility
44.63/44.73	Strengthening transition (result): 
44.63/44.73	<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg1 = 1 + arg3, {arg3 -> 1 + arg3, rest remain the same}>
44.63/44.73	
44.63/44.73	LOG: CALL solverLinear in Graph for feasibility
44.63/44.73	
44.63/44.73	LOG: RETURN solveLinear in Graph for feasibility
44.63/44.73	It's unfeasible. Removing transition: 
44.63/44.73	<l2, l2, 1 <= arg1 /\ 1 <= arg3 /\ 2 + arg3 <= arg1 /\ arg2 = 0, {arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
44.63/44.73	
44.63/44.73	LOG: CALL solverLinear in Graph for feasibility
44.63/44.73	
44.63/44.73	LOG: RETURN solveLinear in Graph for feasibility
44.63/44.73	Strengthening transition (result): 
44.63/44.73	<l2, l2, 1 <= arg1 /\ 0 <= arg2 /\ arg1 = arg3, {arg2 -> 0, arg3 -> -1 + arg1, rest remain the same}>
44.63/44.73	
44.63/44.73	LOG: CALL solverLinear in Graph for feasibility
44.63/44.73	
44.63/44.73	LOG: RETURN solveLinear in Graph for feasibility
44.63/44.73	Strengthening transition (result): 
44.63/44.73	<l2, l2, 1 <= arg1 /\ arg1 <= 1 + arg3 /\ 0 <= arg2 /\ arg1 <= 2 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
44.63/44.73	
44.63/44.73	LOG: CALL solverLinear in Graph for feasibility
44.63/44.73	
44.63/44.73	LOG: RETURN solveLinear in Graph for feasibility
44.63/44.73	It's unfeasible. Removing transition: 
44.63/44.73	<l2, l2, 0 <= arg2 /\ 4 <= arg1 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
44.63/44.73	New Graphs: 
44.63/44.73	Transitions:
44.63/44.73	<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg1 = 1 + arg3, {arg3 -> 1 + arg3, rest remain the same}>
44.63/44.73	<l2, l2, 1 <= arg1 /\ 0 <= arg2 /\ arg1 = arg3, {arg2 -> 0, arg3 -> -1 + arg1, rest remain the same}>
44.63/44.73	<l2, l2, 1 <= arg1 /\ arg1 <= 1 + arg3 /\ 0 <= arg2 /\ arg1 <= 2 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
44.63/44.73	Variables:
44.63/44.73	arg1, arg2, arg3
44.63/44.73	Checking conditional termination of SCC {l2}...
44.63/44.73	
44.63/44.73	LOG: CALL solveLinear
44.63/44.73	
44.63/44.73	LOG: RETURN solveLinear - Elapsed time: 0.001826s
44.63/44.73	
44.63/44.73	LOG: CALL solveLinear
44.63/44.73	
44.63/44.73	LOG: RETURN solveLinear - Elapsed time: 0.022017s
44.63/44.73	Trying to remove transition: <l2, l2, 1 <= arg1 /\ arg1 <= 1 + arg3 /\ 0 <= arg2 /\ arg1 <= 2 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
44.63/44.73	Solving with 1 template(s).
44.63/44.73	
44.63/44.73	LOG: CALL solveNonLinearGetFirstSolution
44.63/44.73	
44.63/44.73	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001755s
44.63/44.73	Time used: 4.00006
44.63/44.73	Trying to remove transition: <l2, l2, 1 <= arg1 /\ 0 <= arg2 /\ arg1 = arg3, {arg2 -> 0, arg3 -> -1 + arg1, rest remain the same}>
44.63/44.73	Solving with 1 template(s).
44.63/44.73	
44.63/44.73	LOG: CALL solveNonLinearGetFirstSolution
44.63/44.73	
44.63/44.73	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.043133s
44.63/44.74	Time used: 0.023261
44.63/44.74	Trying to remove transition: <l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg1 = 1 + arg3, {arg3 -> 1 + arg3, rest remain the same}>
44.63/44.74	Solving with 1 template(s).
44.63/44.74	
44.63/44.74	LOG: CALL solveNonLinearGetFirstSolution
44.63/44.74	
44.63/44.74	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.023219s
44.63/44.74	Time used: 0.022077
44.63/44.74	
44.63/44.74	LOG: SAT solveNonLinear - Elapsed time: 0.023219s
44.63/44.74	Cost: 0; Total time: 0.022077
44.63/44.74	Termination implied by a set of quasi-invariant(s):
44.63/44.74	Quasi-invariant at l2: 1 + arg3 <= arg1 + arg2
44.63/44.74	Ranking function: 2*arg1 + 2*arg2 - 2*arg3
44.63/44.74	Ranking function and negation of Quasi-Invariant applied
44.63/44.74	New Graphs: 
44.63/44.74	Transitions:
44.63/44.74	<l2, l2, 1 <= arg1 /\ 0 <= arg2 /\ arg1 = arg3, {arg2 -> 0, arg3 -> -1 + arg1, rest remain the same}>
44.63/44.74	<l2, l2, 1 <= arg1 /\ arg1 <= 1 + arg3 /\ 0 <= arg2 /\ arg1 <= 2 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
44.63/44.74	Variables:
44.63/44.74	arg1, arg2, arg3
44.63/44.74	Checking conditional termination of SCC {l2}...
44.63/44.74	
44.63/44.74	LOG: CALL solveLinear
44.63/44.74	
44.63/44.74	LOG: RETURN solveLinear - Elapsed time: 0.001376s
44.63/44.74	
44.63/44.74	LOG: CALL solveLinear
44.63/44.74	
44.63/44.74	LOG: RETURN solveLinear - Elapsed time: 0.011457s
44.63/44.74	Trying to remove transition: <l2, l2, 1 <= arg1 /\ arg1 <= 1 + arg3 /\ 0 <= arg2 /\ arg1 <= 2 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
44.63/44.74	Solving with 1 template(s).
44.63/44.74	
44.63/44.74	LOG: CALL solveNonLinearGetFirstSolution
44.63/44.74	
44.63/44.74	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001111s
44.63/44.74	Time used: 4.00003
44.63/44.74	Trying to remove transition: <l2, l2, 1 <= arg1 /\ 0 <= arg2 /\ arg1 = arg3, {arg2 -> 0, arg3 -> -1 + arg1, rest remain the same}>
44.63/44.74	Solving with 1 template(s).
44.63/44.74	
44.63/44.74	LOG: CALL solveNonLinearGetFirstSolution
44.63/44.74	
44.63/44.74	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.050526s
44.63/44.74	Time used: 0.035531
44.63/44.74	Solving with 1 template(s).
44.63/44.74	
44.63/44.74	LOG: CALL solveNonLinearGetFirstSolution
44.63/44.74	
44.63/44.74	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.085684s
44.63/44.74	Time used: 0.08454
44.63/44.74	Improving Solution with cost 1 ...
44.63/44.74	
44.63/44.74	LOG: CALL solveNonLinearGetNextSolution
44.63/44.74	
44.63/44.74	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001182s
44.63/44.74	Time used: 1.00091
44.63/44.74	
44.63/44.74	LOG: SAT solveNonLinear - Elapsed time: 1.086867s
44.63/44.74	Cost: 1; Total time: 1.08545
44.63/44.74	Failed at location 2: 1 + arg1 + arg2 <= arg3
44.63/44.74	Before Improving: 
44.63/44.74	Quasi-invariant at l2: 1 + arg1 + arg2 <= arg3
44.63/44.74	Optimizing invariants...
44.63/44.74	
44.63/44.74	LOG: CALL solveLinear
44.63/44.74	
44.63/44.74	LOG: RETURN solveLinear - Elapsed time: 0.011703s
44.63/44.74	Remaining time after improvement: 0.996719
44.63/44.74	Termination implied by a set of quasi-invariant(s):
44.63/44.74	Quasi-invariant at l2: 1 + arg1 + arg2 <= arg3
44.63/44.74	[ Invariant Graph ]
44.63/44.74	Strengthening and disabling transitions...
44.63/44.74	
44.63/44.74	LOG: CALL solverLinear in Graph for feasibility
44.63/44.74	
44.63/44.74	LOG: RETURN solveLinear in Graph for feasibility
44.63/44.74	It's unfeasible. Removing transition: 
44.63/44.74	<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg1 = 1 + arg3, {arg3 -> 1 + arg3, rest remain the same}>
44.63/44.74	
44.63/44.74	LOG: CALL solverLinear in Graph for feasibility
44.63/44.74	
44.63/44.74	LOG: RETURN solveLinear in Graph for feasibility
44.63/44.74	It's unfeasible. Removing transition: 
44.63/44.74	<l2, l2, 1 <= arg1 /\ 1 <= arg3 /\ arg1 = 1 + arg3 /\ arg2 = 0, {arg1 -> -1 + arg1, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
44.63/44.74	
44.63/44.74	LOG: CALL solverLinear in Graph for feasibility
44.63/44.74	
44.63/44.74	LOG: RETURN solveLinear in Graph for feasibility
44.63/44.74	It's unfeasible. Removing transition: 
44.63/44.74	<l2, l2, 1 <= arg1 /\ 0 <= arg2 /\ arg1 = arg3, {arg2 -> 0, arg3 -> -1 + arg1, rest remain the same}>
44.63/44.74	
44.63/44.74	LOG: CALL solverLinear in Graph for feasibility
44.63/44.74	
44.63/44.74	LOG: RETURN solveLinear in Graph for feasibility
44.63/44.74	It's unfeasible. Removing transition: 
44.63/44.74	<l2, l2, 1 <= arg1 /\ arg1 <= 1 + arg3 /\ 0 <= arg2 /\ arg1 <= 2 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
44.63/44.74	[ Termination Graph ]
44.63/44.74	Strengthening and disabling transitions...
44.63/44.74	> It's unfeasible. Removing transition: 
44.63/44.74	<l2, l2, 1 <= arg1 /\ arg1 <= 1 + arg3 /\ 0 <= arg2 /\ arg1 <= 2 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
44.63/44.74	
44.63/44.74	LOG: CALL solverLinear in Graph for feasibility
44.63/44.74	
44.63/44.74	LOG: RETURN solveLinear in Graph for feasibility
44.63/44.74	It's unfeasible. Removing transition: 
44.63/44.74	<l2, l2, 1 <= arg1 /\ 0 <= arg2 /\ arg1 = arg3, {arg2 -> 0, arg3 -> -1 + arg1, rest remain the same}>
44.63/44.74	New Graphs: 
44.63/44.74	Calling Safety with literal arg1 <= 1 + arg3 and entry <l0, l2, 1 <= undef111 /\ 0 <= undef112 /\ arg2 = 0 /\ arg1 = 20 /\ arg3 = 15 + undef112, {all remain the same}>
44.63/44.74	
44.63/44.74	LOG: CALL check - Post:arg1 <= 1 + arg3 - Process 1
44.63/44.74	* Exit transition: <l0, l2, 1 <= undef111 /\ 0 <= undef112 /\ arg2 = 0 /\ arg1 = 20 /\ arg3 = 15 + undef112, {all remain the same}>
44.63/44.74	* Postcondition  : arg1 <= 1 + arg3
44.63/44.74	
44.63/44.74	LOG: CALL solveLinear
44.63/44.74	
44.63/44.74	LOG: RETURN solveLinear - Elapsed time: 0.001701s
44.63/44.74	> Postcondition is not implied!
44.63/44.74	
44.63/44.74	LOG: RETURN check - Elapsed time: 0.001822s
44.63/44.74	INVARIANTS: 
44.63/44.74	2: 
44.63/44.74	Quasi-INVARIANTS to narrow Graph: 
44.63/44.74	2: arg1 <= 1 + arg3 , 
44.63/44.74	Calling Safety with literal 1 + arg1 + arg2 <= arg3 and entry <l0, l2, 1 <= undef111 /\ 0 <= undef112 /\ arg2 = 0 /\ arg1 = 20 /\ arg3 = 15 + undef112, {all remain the same}>
44.63/44.74	
44.63/44.74	LOG: CALL check - Post:1 + arg1 + arg2 <= arg3 - Process 2
44.63/44.74	* Exit transition: <l0, l2, 1 <= undef111 /\ 0 <= undef112 /\ arg2 = 0 /\ arg1 = 20 /\ arg3 = 15 + undef112, {all remain the same}>
44.63/44.74	* Postcondition  : 1 + arg1 + arg2 <= arg3
44.63/44.74	
44.63/44.74	LOG: CALL solveLinear
44.63/44.74	
44.63/44.74	LOG: RETURN solveLinear - Elapsed time: 0.001492s
44.63/44.74	> Postcondition is not implied!
44.63/44.74	
44.63/44.74	LOG: RETURN check - Elapsed time: 0.001612s
44.63/44.74	INVARIANTS: 
44.63/44.74	2: 
44.63/44.74	Quasi-INVARIANTS to narrow Graph: 
44.63/44.74	2: 1 + arg1 + arg2 <= arg3 , 
44.63/44.74	Narrowing transition: 
44.63/44.74	<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ 4 + arg3 <= arg1, {arg3 -> 1 + arg3, rest remain the same}>
44.63/44.74	
44.63/44.74	LOG: Narrow transition size 2
44.63/44.74	Narrowing transition: 
44.63/44.74	<l2, l2, 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg1 <= 2 + arg3, {arg3 -> 1 + arg3, rest remain the same}>
44.63/44.74	
44.63/44.74	LOG: Narrow transition size 2
44.63/44.74	Narrowing transition: 
44.63/44.74	<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg1 = 3 + arg3, {arg1 -> -1 + arg1, arg3 -> 1 + arg3, rest remain the same}>
44.63/44.74	
44.63/44.74	LOG: Narrow transition size 2
44.63/44.74	Narrowing transition: 
44.63/44.74	<l2, l2, 1 <= arg1 /\ 1 <= arg3 /\ 2 + arg3 <= arg1 /\ arg2 = 0, {arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
44.63/44.74	
44.63/44.74	LOG: Narrow transition size 2
44.63/44.74	Narrowing transition: 
44.63/44.74	<l2, l2, 1 <= arg1 /\ 1 <= arg3 /\ arg1 = 1 + arg3 /\ arg2 = 0, {arg1 -> -1 + arg1, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
44.63/44.74	
44.63/44.74	LOG: Narrow transition size 2
44.63/44.74	Narrowing transition: 
44.63/44.74	<l2, l2, 1 <= arg1 /\ 0 <= arg2 /\ arg1 = arg3, {arg2 -> 0, arg3 -> -1 + arg1, rest remain the same}>
44.63/44.74	
44.63/44.74	LOG: Narrow transition size 2
44.63/44.74	Narrowing transition: 
44.63/44.74	<l2, l2, 1 <= arg1 /\ 0 <= arg2 /\ arg1 <= 2 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
44.63/44.74	
44.63/44.74	LOG: Narrow transition size 2
44.63/44.74	Narrowing transition: 
44.63/44.74	<l2, l2, 0 <= arg2 /\ 4 <= arg1 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
44.63/44.74	
44.63/44.74	LOG: Narrow transition size 2
44.63/44.74	Narrowing transition: 
44.63/44.74	<l2, l2, 0 <= arg2 /\ arg3 = 0 /\ arg1 = 3, {arg1 -> 2, arg2 -> 1, arg3 -> 1, rest remain the same}>
44.63/44.74	
44.63/44.74	LOG: Narrow transition size 2
44.63/44.74	invGraph after Narrowing: 
44.63/44.74	Transitions:
44.63/44.74	<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg3 <= arg1 + arg2 /\ 4 + arg3 <= arg1, {arg3 -> 1 + arg3, rest remain the same}>
44.63/44.74	<l2, l2, 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg3 <= arg1 + arg2 /\ arg1 <= 2 + arg3, {arg3 -> 1 + arg3, rest remain the same}>
44.63/44.74	<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg3 <= arg1 + arg2 /\ arg1 = 3 + arg3, {arg1 -> -1 + arg1, arg3 -> 1 + arg3, rest remain the same}>
44.63/44.74	<l2, l2, 1 <= arg1 /\ 1 <= arg3 /\ arg3 <= arg1 + arg2 /\ 2 + arg3 <= arg1 /\ arg2 = 0, {arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
44.63/44.74	<l2, l2, 1 <= arg1 /\ 1 <= arg3 /\ arg3 <= arg1 + arg2 /\ arg1 = 1 + arg3 /\ arg2 = 0, {arg1 -> -1 + arg1, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
44.63/44.74	<l2, l2, 1 <= arg1 /\ arg3 <= arg1 + arg2 /\ 0 <= arg2 /\ arg1 = arg3, {arg2 -> 0, arg3 -> -1 + arg1, rest remain the same}>
44.63/44.74	<l2, l2, 1 <= arg1 /\ arg3 <= arg1 + arg2 /\ 0 <= arg2 /\ arg1 <= 2 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
44.63/44.74	<l2, l2, arg3 <= arg1 + arg2 /\ 0 <= arg2 /\ 4 <= arg1 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
44.63/44.74	<l2, l2, arg3 <= arg1 + arg2 /\ 0 <= arg2 /\ arg3 = 0 /\ arg1 = 3, {arg1 -> 2, arg2 -> 1, arg3 -> 1, rest remain the same}>
44.63/44.74	Variables:
44.63/44.74	arg1, arg2, arg3
44.63/44.74	Checking conditional termination of SCC {l2}...
44.63/44.74	
44.63/44.74	LOG: CALL solveLinear
44.63/44.74	
44.63/44.74	LOG: RETURN solveLinear - Elapsed time: 0.009329s
44.63/44.74	Ranking function: -6 + 3*arg1
44.63/44.74	New Graphs: 
44.63/44.74	Transitions:
44.63/44.74	<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg3 <= arg1 + arg2 /\ 4 + arg3 <= arg1, {arg3 -> 1 + arg3, rest remain the same}>
44.63/44.74	<l2, l2, 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg3 <= arg1 + arg2 /\ arg1 <= 2 + arg3, {arg3 -> 1 + arg3, rest remain the same}>
44.63/44.74	<l2, l2, 1 <= arg1 /\ 1 <= arg3 /\ arg3 <= arg1 + arg2 /\ 2 + arg3 <= arg1 /\ arg2 = 0, {arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
44.63/44.74	<l2, l2, 1 <= arg1 /\ arg3 <= arg1 + arg2 /\ 0 <= arg2 /\ arg1 = arg3, {arg2 -> 0, arg3 -> -1 + arg1, rest remain the same}>
44.63/44.74	<l2, l2, 1 <= arg1 /\ arg3 <= arg1 + arg2 /\ 0 <= arg2 /\ arg1 <= 2 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
44.63/44.74	<l2, l2, arg3 <= arg1 + arg2 /\ 0 <= arg2 /\ 4 <= arg1 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
44.63/44.74	Variables:
44.63/44.74	arg1, arg2, arg3
44.63/44.74	Checking conditional termination of SCC {l2}...
44.63/44.74	
44.63/44.74	LOG: CALL solveLinear
44.63/44.74	
44.63/44.74	LOG: RETURN solveLinear - Elapsed time: 0.004018s
44.63/44.74	
44.63/44.74	LOG: CALL solveLinear
44.63/44.74	
44.63/44.74	LOG: RETURN solveLinear - Elapsed time: 0.229328s
44.63/44.74	Trying to remove transition: <l2, l2, arg3 <= arg1 + arg2 /\ 0 <= arg2 /\ 4 <= arg1 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
44.63/44.74	Solving with 1 template(s).
44.63/44.74	
44.63/44.74	LOG: CALL solveNonLinearGetFirstSolution
44.63/44.74	
44.63/44.74	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.042684s
44.63/44.74	Time used: 0.040409
44.63/44.74	Trying to remove transition: <l2, l2, 1 <= arg1 /\ arg3 <= arg1 + arg2 /\ 0 <= arg2 /\ arg1 <= 2 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
44.63/44.74	Solving with 1 template(s).
44.63/44.74	
44.63/44.74	LOG: CALL solveNonLinearGetFirstSolution
44.63/44.74	
44.63/44.74	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.038702s
44.63/44.74	Time used: 0.035661
44.63/44.74	Trying to remove transition: <l2, l2, 1 <= arg1 /\ arg3 <= arg1 + arg2 /\ 0 <= arg2 /\ arg1 = arg3, {arg2 -> 0, arg3 -> -1 + arg1, rest remain the same}>
44.63/44.74	Solving with 1 template(s).
44.63/44.74	
44.63/44.74	LOG: CALL solveNonLinearGetFirstSolution
44.63/44.74	
44.63/44.74	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.046234s
44.63/44.74	Time used: 0.042845
44.63/44.74	Trying to remove transition: <l2, l2, 1 <= arg1 /\ 1 <= arg3 /\ arg3 <= arg1 + arg2 /\ 2 + arg3 <= arg1 /\ arg2 = 0, {arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
44.63/44.74	Solving with 1 template(s).
44.63/44.74	
44.63/44.74	LOG: CALL solveNonLinearGetFirstSolution
44.63/44.74	
44.63/44.74	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.042470s
44.63/44.74	Time used: 0.039027
44.63/44.74	Trying to remove transition: <l2, l2, 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg3 <= arg1 + arg2 /\ arg1 <= 2 + arg3, {arg3 -> 1 + arg3, rest remain the same}>
44.63/44.74	Solving with 1 template(s).
44.63/44.74	
44.63/44.74	LOG: CALL solveNonLinearGetFirstSolution
44.63/44.74	
44.63/44.74	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.048722s
44.63/44.74	Time used: 0.045185
44.63/44.74	Trying to remove transition: <l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg3 <= arg1 + arg2 /\ 4 + arg3 <= arg1, {arg3 -> 1 + arg3, rest remain the same}>
44.63/44.74	Solving with 1 template(s).
44.63/44.74	
44.63/44.74	LOG: CALL solveNonLinearGetFirstSolution
44.63/44.74	
44.63/44.74	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.045899s
44.63/44.74	Time used: 0.042318
44.63/44.74	Solving with 1 template(s).
44.63/44.74	
44.63/44.74	LOG: CALL solveNonLinearGetFirstSolution
44.63/44.74	
44.63/44.74	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.004389s
44.63/44.74	Time used: 4.00006
44.63/44.74	Solving with 2 template(s).
44.63/44.74	
44.63/44.74	LOG: CALL solveNonLinearGetFirstSolution
44.63/44.74	
44.63/44.74	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.337143s
44.63/44.74	Time used: 1.29932
44.63/44.74	Improving Solution with cost 1 ...
44.63/44.74	
44.63/44.74	LOG: CALL solveNonLinearGetNextSolution
44.63/44.74	
44.63/44.74	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.003658s
44.63/44.74	Time used: 1.00352
44.63/44.74	
44.63/44.74	LOG: SAT solveNonLinear - Elapsed time: 2.340802s
44.63/44.74	Cost: 1; Total time: 2.30284
44.63/44.74	Failed at location 2: arg1 + arg2 <= 1 + arg3
44.63/44.74	Before Improving: 
44.63/44.74	Quasi-invariant at l2: arg1 + arg2 <= 1 + arg3
44.63/44.74	Quasi-invariant at l2: 0 <= 1 + arg2
44.63/44.74	Optimizing invariants...
44.63/44.74	
44.63/44.74	LOG: CALL solveLinear
44.63/44.74	
44.63/44.74	LOG: RETURN solveLinear - Elapsed time: 0.023128s
44.63/44.74	Remaining time after improvement: 0.986777
44.63/44.74	Termination implied by a set of quasi-invariant(s):
44.63/44.74	Quasi-invariant at l2: arg1 + arg2 <= 1 + arg3
44.63/44.74	Quasi-invariant at l2: 0 <= 1 + arg2
44.63/44.74	[ Invariant Graph ]
44.63/44.74	Strengthening and disabling transitions...
44.63/44.74	
44.63/44.74	LOG: CALL solverLinear in Graph for feasibility
44.63/44.74	
44.63/44.74	LOG: RETURN solveLinear in Graph for feasibility
44.63/44.74	It's unfeasible. Removing transition: 
44.63/44.74	<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg3 <= arg1 + arg2 /\ 4 + arg3 <= arg1, {arg3 -> 1 + arg3, rest remain the same}>
44.63/44.74	
44.63/44.74	LOG: CALL solverLinear in Graph for feasibility
44.63/44.74	
44.63/44.74	LOG: RETURN solveLinear in Graph for feasibility
44.63/44.74	It's unfeasible. Removing transition: 
44.63/44.74	<l2, l2, 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg3 <= arg1 + arg2 /\ arg1 <= 2 + arg3, {arg3 -> 1 + arg3, rest remain the same}>
44.63/44.74	
44.63/44.74	LOG: CALL solverLinear in Graph for feasibility
44.63/44.74	
44.63/44.74	LOG: RETURN solveLinear in Graph for feasibility
44.63/44.74	It's unfeasible. Removing transition: 
44.63/44.74	<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg3 <= arg1 + arg2 /\ arg1 = 3 + arg3, {arg1 -> -1 + arg1, arg3 -> 1 + arg3, rest remain the same}>
44.63/44.74	
44.63/44.74	LOG: CALL solverLinear in Graph for feasibility
44.63/44.74	
44.63/44.74	LOG: RETURN solveLinear in Graph for feasibility
44.63/44.74	It's unfeasible. Removing transition: 
44.63/44.74	<l2, l2, 1 <= arg1 /\ 1 <= arg3 /\ arg3 <= arg1 + arg2 /\ 2 + arg3 <= arg1 /\ arg2 = 0, {arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
44.63/44.74	
44.63/44.74	LOG: CALL solverLinear in Graph for feasibility
44.63/44.74	
44.63/44.74	LOG: RETURN solveLinear in Graph for feasibility
44.63/44.74	Strengthening transition (result): 
44.63/44.74	<l2, l2, 1 <= arg1 /\ 1 <= arg3 /\ arg1 + arg2 <= 1 + arg3 /\ arg3 <= arg1 + arg2 /\ arg1 = 1 + arg3 /\ arg2 = 0, {arg1 -> -1 + arg1, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
44.63/44.74	
44.63/44.74	LOG: CALL solverLinear in Graph for feasibility
44.63/44.74	
44.63/44.74	LOG: RETURN solveLinear in Graph for feasibility
44.63/44.74	Strengthening transition (result): 
44.63/44.74	<l2, l2, 1 <= arg1 /\ arg1 + arg2 <= 1 + arg3 /\ arg3 <= arg1 + arg2 /\ 0 <= arg2 /\ arg1 = arg3, {arg2 -> 0, arg3 -> -1 + arg1, rest remain the same}>
44.63/44.74	
44.63/44.74	LOG: CALL solverLinear in Graph for feasibility
44.63/44.74	
44.63/44.74	LOG: RETURN solveLinear in Graph for feasibility
44.63/44.74	Strengthening transition (result): 
44.63/44.74	<l2, l2, 1 <= arg1 /\ arg1 + arg2 <= 1 + arg3 /\ arg3 <= arg1 + arg2 /\ 0 <= arg2 /\ arg1 <= 2 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
44.63/44.74	
44.63/44.74	LOG: CALL solverLinear in Graph for feasibility
44.63/44.74	
44.63/44.74	LOG: RETURN solveLinear in Graph for feasibility
44.63/44.74	It's unfeasible. Removing transition: 
44.63/44.74	<l2, l2, arg3 <= arg1 + arg2 /\ 0 <= arg2 /\ 4 <= arg1 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
44.63/44.74	
44.63/44.74	LOG: CALL solverLinear in Graph for feasibility
44.63/44.74	
44.63/44.74	LOG: RETURN solveLinear in Graph for feasibility
44.63/44.74	It's unfeasible. Removing transition: 
44.63/44.74	<l2, l2, arg3 <= arg1 + arg2 /\ 0 <= arg2 /\ arg3 = 0 /\ arg1 = 3, {arg1 -> 2, arg2 -> 1, arg3 -> 1, rest remain the same}>
44.63/44.74	[ Termination Graph ]
44.63/44.74	Strengthening and disabling transitions...
44.63/44.74	> It's unfeasible. Removing transition: 
44.63/44.74	<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg3 <= arg1 + arg2 /\ 4 + arg3 <= arg1, {arg3 -> 1 + arg3, rest remain the same}>
44.63/44.74	
44.63/44.74	LOG: CALL solverLinear in Graph for feasibility
44.63/44.74	
44.63/44.74	LOG: RETURN solveLinear in Graph for feasibility
44.63/44.74	It's unfeasible. Removing transition: 
44.63/44.74	<l2, l2, 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg3 <= arg1 + arg2 /\ arg1 <= 2 + arg3, {arg3 -> 1 + arg3, rest remain the same}>
44.63/44.74	
44.63/44.74	LOG: CALL solverLinear in Graph for feasibility
44.63/44.74	
44.63/44.74	LOG: RETURN solveLinear in Graph for feasibility
44.63/44.74	It's unfeasible. Removing transition: 
44.63/44.74	<l2, l2, 1 <= arg1 /\ 1 <= arg3 /\ arg3 <= arg1 + arg2 /\ 2 + arg3 <= arg1 /\ arg2 = 0, {arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
44.63/44.74	
44.63/44.74	LOG: CALL solverLinear in Graph for feasibility
44.63/44.74	
44.63/44.74	LOG: RETURN solveLinear in Graph for feasibility
44.63/44.74	Strengthening transition (result): 
44.63/44.74	<l2, l2, 1 <= arg1 /\ arg1 + arg2 <= 1 + arg3 /\ arg3 <= arg1 + arg2 /\ 0 <= arg2 /\ arg1 = arg3, {arg2 -> 0, arg3 -> -1 + arg1, rest remain the same}>
44.63/44.74	
44.63/44.74	LOG: CALL solverLinear in Graph for feasibility
44.63/44.74	
44.63/44.74	LOG: RETURN solveLinear in Graph for feasibility
44.63/44.74	Strengthening transition (result): 
44.63/44.74	<l2, l2, 1 <= arg1 /\ arg1 + arg2 <= 1 + arg3 /\ arg3 <= arg1 + arg2 /\ 0 <= arg2 /\ arg1 <= 2 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
44.63/44.74	
44.63/44.74	LOG: CALL solverLinear in Graph for feasibility
44.63/44.74	
44.63/44.74	LOG: RETURN solveLinear in Graph for feasibility
44.63/44.74	It's unfeasible. Removing transition: 
44.63/44.74	<l2, l2, arg3 <= arg1 + arg2 /\ 0 <= arg2 /\ 4 <= arg1 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
44.63/44.74	New Graphs: 
44.63/44.74	Transitions:
44.63/44.74	<l2, l2, 1 <= arg1 /\ arg1 + arg2 <= 1 + arg3 /\ arg3 <= arg1 + arg2 /\ 0 <= arg2 /\ arg1 = arg3, {arg2 -> 0, arg3 -> -1 + arg1, rest remain the same}>
44.63/44.74	<l2, l2, 1 <= arg1 /\ arg1 + arg2 <= 1 + arg3 /\ arg3 <= arg1 + arg2 /\ 0 <= arg2 /\ arg1 <= 2 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
44.63/44.74	Variables:
44.63/44.74	arg1, arg2, arg3
44.63/44.74	Checking conditional termination of SCC {l2}...
44.63/44.74	
44.63/44.74	LOG: CALL solveLinear
44.63/44.74	
44.63/44.74	LOG: RETURN solveLinear - Elapsed time: 0.001908s
44.63/44.74	
44.63/44.74	LOG: CALL solveLinear
44.63/44.74	
44.63/44.74	LOG: RETURN solveLinear - Elapsed time: 0.011005s
44.63/44.74	Trying to remove transition: <l2, l2, 1 <= arg1 /\ arg1 + arg2 <= 1 + arg3 /\ arg3 <= arg1 + arg2 /\ 0 <= arg2 /\ arg1 <= 2 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
44.63/44.74	Solving with 1 template(s).
44.63/44.74	
44.63/44.74	LOG: CALL solveNonLinearGetFirstSolution
44.63/44.74	
44.63/44.74	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001403s
44.63/44.74	Time used: 4.00013
44.63/44.74	Trying to remove transition: <l2, l2, 1 <= arg1 /\ arg1 + arg2 <= 1 + arg3 /\ arg3 <= arg1 + arg2 /\ 0 <= arg2 /\ arg1 = arg3, {arg2 -> 0, arg3 -> -1 + arg1, rest remain the same}>
44.63/44.74	Solving with 1 template(s).
44.63/44.74	
44.63/44.74	LOG: CALL solveNonLinearGetFirstSolution
44.63/44.74	
44.63/44.74	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.019018s
44.63/44.74	Time used: 4.00019
44.63/44.74	Solving with 1 template(s).
44.63/44.74	
44.63/44.74	LOG: CALL solveNonLinearGetFirstSolution
44.63/44.74	
44.63/44.74	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.018864s
44.63/44.74	Time used: 4.00003
44.63/44.74	Solving with 2 template(s).
44.63/44.74	
44.63/44.74	LOG: CALL solveNonLinearGetFirstSolution
44.63/44.74	
44.63/44.74	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.021306s
44.63/44.74	Time used: 4.00005
44.63/44.74	Solving with 3 template(s).
44.63/44.74	
44.63/44.74	LOG: CALL solveNonLinearGetFirstSolution
44.63/44.74	
44.63/44.74	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.022142s
44.63/44.74	Time used: 1.00021
44.63/44.74	Solving with 1 template(s).
44.63/44.74	
44.63/44.74	LOG: CALL solveNonLinearGetFirstSolution
44.63/44.74	
44.63/44.74	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.018172s
44.63/44.74	Time used: 4.00001
44.63/44.74	
44.63/44.74	Proving non-termination of subgraph 1
44.63/44.74	Transitions:
44.63/44.74	<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg3 <= arg1 + arg2 /\ 4 + arg3 <= arg1, {arg3 -> 1 + arg3, rest remain the same}>
44.63/44.74	<l2, l2, 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg3 <= arg1 + arg2 /\ arg1 <= 2 + arg3, {arg3 -> 1 + arg3, rest remain the same}>
44.63/44.74	<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg3 <= arg1 + arg2 /\ arg1 = 3 + arg3, {arg1 -> -1 + arg1, arg3 -> 1 + arg3, rest remain the same}>
44.63/44.74	<l2, l2, 1 <= arg1 /\ 1 <= arg3 /\ arg3 <= arg1 + arg2 /\ 2 + arg3 <= arg1 /\ arg2 = 0, {arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
44.63/44.74	<l2, l2, 1 <= arg1 /\ 1 <= arg3 /\ arg3 <= arg1 + arg2 /\ arg1 = 1 + arg3 /\ arg2 = 0, {arg1 -> -1 + arg1, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
44.63/44.74	<l2, l2, 1 <= arg1 /\ arg3 <= arg1 + arg2 /\ 0 <= arg2 /\ arg1 = arg3, {arg2 -> 0, arg3 -> -1 + arg1, rest remain the same}>
44.63/44.74	<l2, l2, 1 <= arg1 /\ arg3 <= arg1 + arg2 /\ 0 <= arg2 /\ arg1 <= 2 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
44.63/44.74	<l2, l2, arg3 <= arg1 + arg2 /\ 0 <= arg2 /\ 4 <= arg1 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
44.63/44.74	<l2, l2, arg3 <= arg1 + arg2 /\ 0 <= arg2 /\ arg3 = 0 /\ arg1 = 3, {arg1 -> 2, arg2 -> 1, arg3 -> 1, rest remain the same}>
44.63/44.74	Variables:
44.63/44.74	arg1, arg2, arg3
44.63/44.74	
44.63/44.74	Checking conditional non-termination of SCC {l2}...
44.63/44.74	EXIT TRANSITIONS:
44.63/44.74	<l2, end, 1 + arg1 <= arg3 /\ 1 <= arg2 /\ 1 <= arg3 /\ 3 <= arg1, {all remain the same}>
44.63/44.74	<l2, end, 1 + arg1 <= arg3 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg1 <= 2, {all remain the same}>
44.63/44.74	<l2, end, 1 <= arg1 /\ 1 <= arg2 /\ 1 + arg3 <= 0 /\ arg3 <= arg1 + arg2 /\ arg1 <= 2 /\ arg1 = 2 + arg3, {all remain the same}>
44.63/44.74	<l2, end, 1 <= arg1 /\ 1 <= arg2 /\ 1 + arg3 <= 0 /\ arg3 <= arg1 + arg2 /\ arg1 <= 2 /\ arg1 = 3 + arg3, {all remain the same}>
44.63/44.74	<l2, end, 1 <= arg2 /\ 1 + arg3 <= 0 /\ arg3 <= arg1 + arg2 /\ 3 <= arg1 /\ 4 + arg3 <= arg1, {all remain the same}>
44.63/44.74	<l2, end, 1 <= arg1 /\ 1 <= arg2 /\ 1 + arg3 <= 0 /\ arg3 <= arg1 + arg2 /\ arg1 <= 2 /\ 4 + arg3 <= arg1, {all remain the same}>
44.63/44.74	<l2, end, 1 + arg1 + arg2 <= arg3 /\ 1 + arg1 <= arg3 /\ 1 <= arg3 /\ 3 <= arg1 /\ arg2 = 0, {all remain the same}>
44.63/44.74	<l2, end, 1 + arg1 + arg2 <= arg3 /\ 1 + arg1 <= arg3 /\ 1 <= arg1 /\ 1 <= arg3 /\ arg1 <= 2 /\ arg2 = 0, {all remain the same}>
44.63/44.74	<l2, end, 1 <= arg1 /\ 1 + arg3 <= 0 /\ arg3 <= arg1 + arg2 /\ arg1 <= 2 /\ arg2 = 0 /\ arg1 = 2 + arg3, {all remain the same}>
44.63/44.74	<l2, end, 1 <= arg1 /\ 1 + arg3 <= 0 /\ arg3 <= arg1 + arg2 /\ arg1 <= 2 /\ arg2 = 0 /\ arg1 = 3 + arg3, {all remain the same}>
44.63/44.74	<l2, end, 1 + arg3 <= 0 /\ arg3 <= arg1 + arg2 /\ 3 <= arg1 /\ 4 + arg3 <= arg1 /\ arg2 = 0, {all remain the same}>
44.63/44.74	<l2, end, 1 <= arg1 /\ 1 + arg3 <= 0 /\ arg3 <= arg1 + arg2 /\ arg1 <= 2 /\ 4 + arg3 <= arg1 /\ arg2 = 0, {all remain the same}>
44.63/44.74	
44.63/44.74	Solving with 1 template(s).
44.63/44.74	
44.63/44.74	LOG: CALL solveNonLinearGetFirstSolution
44.63/44.74	
44.63/44.74	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.262230s
44.63/44.74	Time used: 0.261491
44.63/44.74	Improving Solution with cost 8 ...
44.63/44.74	
44.63/44.74	LOG: CALL solveNonLinearGetNextSolution
44.63/44.74	
44.63/44.74	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.492438s
44.63/44.74	Time used: 0.492371
44.63/44.74	
44.63/44.74	LOG: SAT solveNonLinear - Elapsed time: 0.754668s
44.63/44.74	Cost: 8; Total time: 0.753862
44.63/44.74	Non-termination implied by a set of quasi-invariant(s):
44.63/44.74	Quasi-invariant at l2: arg2 <= arg3
44.63/44.74	
44.63/44.74	Strengthening and disabling EXIT transitions...
44.63/44.74	Closed exits from l2: 8
44.63/44.74	Strengthening exit transition (result): 
44.63/44.74	<l2, end, 1 + arg1 <= arg3 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg2 <= arg3 /\ 3 <= arg1, {all remain the same}>
44.63/44.74	Strengthening exit transition (result): 
44.63/44.74	<l2, end, 1 + arg1 <= arg3 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg2 <= arg3 /\ arg1 <= 2, {all remain the same}>
44.63/44.74	Strengthening exit transition (result): 
44.63/44.74	<l2, end, 1 + arg1 + arg2 <= arg3 /\ 1 + arg1 <= arg3 /\ 1 <= arg3 /\ arg2 <= arg3 /\ 3 <= arg1 /\ arg2 = 0, {all remain the same}>
44.63/44.74	Strengthening exit transition (result): 
44.63/44.74	<l2, end, 1 + arg1 + arg2 <= arg3 /\ 1 + arg1 <= arg3 /\ 1 <= arg1 /\ 1 <= arg3 /\ arg2 <= arg3 /\ arg1 <= 2 /\ arg2 = 0, {all remain the same}>
44.63/44.74	
44.63/44.74	Strengthening and disabling transitions...
44.63/44.74	
44.63/44.74	LOG: CALL solverLinear in Graph for feasibility
44.63/44.74	
44.63/44.74	LOG: RETURN solveLinear in Graph for feasibility
44.63/44.74	Strengthening transition (result): 
44.63/44.74	<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg3 <= arg1 + arg2 /\ arg2 <= arg3 /\ 4 + arg3 <= arg1, {arg3 -> 1 + arg3, rest remain the same}>
44.63/44.74	
44.63/44.74	LOG: CALL solverLinear in Graph for feasibility
44.63/44.74	
44.63/44.74	LOG: RETURN solveLinear in Graph for feasibility
44.63/44.74	Strengthening transition (result): 
44.63/44.74	<l2, l2, 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg3 <= arg1 + arg2 /\ arg2 <= arg3 /\ arg1 <= 2 + arg3, {arg3 -> 1 + arg3, rest remain the same}>
44.63/44.74	
44.63/44.74	LOG: CALL solverLinear in Graph for feasibility
44.63/44.74	
44.63/44.74	LOG: RETURN solveLinear in Graph for feasibility
44.63/44.74	Strengthening transition (result): 
44.63/44.74	<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg3 <= arg1 + arg2 /\ arg2 <= arg3 /\ arg1 = 3 + arg3, {arg1 -> -1 + arg1, arg3 -> 1 + arg3, rest remain the same}>
44.63/44.74	
44.63/44.74	LOG: CALL solverLinear in Graph for feasibility
44.63/44.74	
44.63/44.74	LOG: RETURN solveLinear in Graph for feasibility
44.63/44.74	Strengthening transition (result): 
44.63/44.74	<l2, l2, 1 <= arg1 /\ 1 <= arg3 /\ arg3 <= arg1 + arg2 /\ arg2 <= arg3 /\ 2 + arg3 <= arg1 /\ arg2 = 0, {arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
44.63/44.74	
44.63/44.74	LOG: CALL solverLinear in Graph for feasibility
44.63/44.74	
44.63/44.74	LOG: RETURN solveLinear in Graph for feasibility
44.63/44.74	Strengthening transition (result): 
44.63/44.74	<l2, l2, 1 <= arg1 /\ 1 <= arg3 /\ arg3 <= arg1 + arg2 /\ arg2 <= arg3 /\ arg1 = 1 + arg3 /\ arg2 = 0, {arg1 -> -1 + arg1, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
44.63/44.74	
44.63/44.74	LOG: CALL solverLinear in Graph for feasibility
44.63/44.74	
44.63/44.74	LOG: RETURN solveLinear in Graph for feasibility
44.63/44.74	Strengthening transition (result): 
44.63/44.74	<l2, l2, 1 <= arg1 /\ arg3 <= arg1 + arg2 /\ arg2 <= arg3 /\ 0 <= arg2 /\ arg1 = arg3, {arg2 -> 0, arg3 -> -1 + arg1, rest remain the same}>
44.63/44.74	
44.63/44.74	LOG: CALL solverLinear in Graph for feasibility
44.63/44.74	
44.63/44.74	LOG: RETURN solveLinear in Graph for feasibility
44.63/44.74	Strengthening transition (result): 
44.63/44.74	<l2, l2, 1 <= arg1 /\ arg3 <= arg1 + arg2 /\ arg2 <= arg3 /\ 0 <= arg2 /\ arg1 <= 2 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
44.63/44.74	
44.63/44.74	LOG: CALL solverLinear in Graph for feasibility
44.63/44.74	
44.63/44.74	LOG: RETURN solveLinear in Graph for feasibility
44.63/44.74	Strengthening transition (result): 
44.63/44.74	<l2, l2, arg3 <= arg1 + arg2 /\ arg2 <= arg3 /\ 0 <= arg2 /\ 4 <= arg1 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
44.63/44.74	
44.63/44.74	LOG: CALL solverLinear in Graph for feasibility
44.63/44.74	
44.63/44.74	LOG: RETURN solveLinear in Graph for feasibility
44.63/44.74	Strengthening transition (result): 
44.63/44.74	<l2, l2, arg3 <= arg1 + arg2 /\ arg2 <= arg3 /\ 0 <= arg2 /\ arg3 = 0 /\ arg1 = 3, {arg1 -> 2, arg2 -> 1, arg3 -> 1, rest remain the same}>
44.63/44.74	
44.63/44.74	Checking conditional non-termination of SCC {l2}...
44.63/44.74	EXIT TRANSITIONS:
44.63/44.74	<l2, end, 1 + arg1 <= arg3 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg2 <= arg3 /\ 3 <= arg1, {all remain the same}>
44.63/44.74	<l2, end, 1 + arg1 <= arg3 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg2 <= arg3 /\ arg1 <= 2, {all remain the same}>
44.63/44.74	<l2, end, 1 + arg1 + arg2 <= arg3 /\ 1 + arg1 <= arg3 /\ 1 <= arg3 /\ arg2 <= arg3 /\ 3 <= arg1 /\ arg2 = 0, {all remain the same}>
44.63/44.74	<l2, end, 1 + arg1 + arg2 <= arg3 /\ 1 + arg1 <= arg3 /\ 1 <= arg1 /\ 1 <= arg3 /\ arg2 <= arg3 /\ arg1 <= 2 /\ arg2 = 0, {all remain the same}>
44.63/44.74	
44.63/44.74	Solving with 1 template(s).
44.63/44.74	
44.63/44.74	LOG: CALL solveNonLinearGetFirstSolution
44.63/44.74	
44.63/44.74	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.087613s
44.63/44.74	Time used: 0.087006
44.63/44.74	Improving Solution with cost 1 ...
44.63/44.74	
44.63/44.74	LOG: CALL solveNonLinearGetNextSolution
44.63/44.74	
44.63/44.74	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.063383s
44.63/44.74	Time used: 0.063369
44.63/44.74	
44.63/44.74	LOG: SAT solveNonLinear - Elapsed time: 0.150996s
44.63/44.74	Cost: 1; Total time: 0.150375
44.63/44.74	Failed at location 2: arg3 <= arg1
44.63/44.74	Before Improving: 
44.63/44.74	Quasi-invariant at l2: arg3 <= arg1
44.63/44.74	Optimizing invariants...
44.63/44.74	
44.63/44.74	LOG: CALL solveLinear
44.63/44.74	
44.63/44.74	LOG: RETURN solveLinear - Elapsed time: 0.020920s
44.63/44.74	Remaining time after improvement: 0.993198
44.63/44.74	Non-termination implied by a set of quasi-invariant(s):
44.63/44.74	Quasi-invariant at l2: arg3 <= arg1
44.63/44.74	
44.63/44.74	Strengthening and disabling EXIT transitions...
44.63/44.74	Closed exits from l2: 4
44.63/44.74	
44.63/44.74	Strengthening and disabling transitions...
44.63/44.74	
44.63/44.74	LOG: CALL solverLinear in Graph for feasibility
44.63/44.74	
44.63/44.74	LOG: RETURN solveLinear in Graph for feasibility
44.63/44.74	Strengthening transition (result): 
44.63/44.74	<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg3 <= arg1 + arg2 /\ arg2 <= arg3 /\ 4 + arg3 <= arg1, {arg3 -> 1 + arg3, rest remain the same}>
44.63/44.74	
44.63/44.74	LOG: CALL solverLinear in Graph for feasibility
44.63/44.74	
44.63/44.74	LOG: RETURN solveLinear in Graph for feasibility
44.63/44.74	Strengthening transition (result): 
44.63/44.74	<l2, l2, 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg3 <= arg1 + arg2 /\ arg2 <= arg3 /\ arg1 <= 2 + arg3, {arg3 -> 1 + arg3, rest remain the same}>
44.63/44.74	
44.63/44.74	LOG: CALL solverLinear in Graph for feasibility
44.63/44.74	
44.63/44.74	LOG: RETURN solveLinear in Graph for feasibility
44.63/44.74	Strengthening transition (result): 
44.63/44.74	<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg3 <= arg1 + arg2 /\ arg2 <= arg3 /\ arg1 = 3 + arg3, {arg1 -> -1 + arg1, arg3 -> 1 + arg3, rest remain the same}>
44.63/44.74	
44.63/44.74	LOG: CALL solverLinear in Graph for feasibility
44.63/44.74	
44.63/44.74	LOG: RETURN solveLinear in Graph for feasibility
44.63/44.74	Strengthening transition (result): 
44.63/44.74	<l2, l2, 1 <= arg1 /\ 1 <= arg3 /\ arg3 <= arg1 + arg2 /\ arg2 <= arg3 /\ 2 + arg3 <= arg1 /\ arg2 = 0, {arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
44.63/44.74	
44.63/44.74	LOG: CALL solverLinear in Graph for feasibility
44.63/44.74	
44.63/44.74	LOG: RETURN solveLinear in Graph for feasibility
44.63/44.74	Strengthening transition (result): 
44.63/44.74	<l2, l2, 1 <= arg1 /\ 1 <= arg3 /\ arg3 <= arg1 + arg2 /\ arg2 <= arg3 /\ arg1 = 1 + arg3 /\ arg2 = 0, {arg1 -> -1 + arg1, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
44.63/44.74	
44.63/44.74	LOG: CALL solverLinear in Graph for feasibility
44.63/44.74	
44.63/44.74	LOG: RETURN solveLinear in Graph for feasibility
44.63/44.74	Strengthening transition (result): 
44.63/44.74	<l2, l2, 1 <= arg1 /\ arg3 <= arg1 + arg2 /\ arg2 <= arg3 /\ 0 <= arg2 /\ arg1 = arg3, {arg2 -> 0, arg3 -> -1 + arg1, rest remain the same}>
44.63/44.74	
44.63/44.74	LOG: CALL solverLinear in Graph for feasibility
44.63/44.74	
44.63/44.74	LOG: RETURN solveLinear in Graph for feasibility
44.63/44.74	Strengthening transition (result): 
44.63/44.74	<l2, l2, 1 <= arg1 /\ arg3 <= arg1 + arg2 /\ arg3 <= arg1 /\ arg2 <= arg3 /\ 0 <= arg2 /\ arg1 <= 2 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
44.63/44.74	
44.63/44.74	LOG: CALL solverLinear in Graph for feasibility
44.63/44.74	
44.63/44.74	LOG: RETURN solveLinear in Graph for feasibility
44.63/44.74	Strengthening transition (result): 
44.63/44.74	<l2, l2, arg3 <= arg1 + arg2 /\ arg3 <= arg1 /\ arg2 <= arg3 /\ 0 <= arg2 /\ 4 <= arg1 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
44.63/44.74	
44.63/44.74	LOG: CALL solverLinear in Graph for feasibility
44.63/44.74	
44.63/44.74	LOG: RETURN solveLinear in Graph for feasibility
44.63/44.74	Strengthening transition (result): 
44.63/44.74	<l2, l2, arg3 <= arg1 + arg2 /\ arg3 <= arg1 /\ arg2 <= arg3 /\ 0 <= arg2 /\ arg3 = 0 /\ arg1 = 3, {arg1 -> 2, arg2 -> 1, arg3 -> 1, rest remain the same}>
44.63/44.74	
44.63/44.74	Calling reachability with...
44.63/44.74	Transition: <l2, end, true, {all remain the same}>
44.63/44.74	Conditions: arg2 <= arg3, arg3 <= arg1, 
44.63/44.74	OPEN EXITS: 
44.63/44.74	<l2, end, arg3 <= arg1 /\ arg2 <= arg3, {all remain the same}>
44.63/44.74	
44.63/44.74	--- Reachability graph ---
44.63/44.74	> Graph without transitions.
44.63/44.74	
44.63/44.74	Calling reachability with...
44.63/44.74	Transition: <l0, l2, 1 <= undef111 /\ 0 <= undef112 /\ arg2 = 0 /\ arg1 = 20 /\ arg3 = 15 + undef112, {all remain the same}>
44.63/44.74	Conditions: arg3 <= arg1, arg2 <= arg3, 
44.63/44.74	OPEN EXITS: 
44.63/44.74	<l0, l2, 1 <= undef111 /\ arg3 <= arg1 /\ arg2 <= arg3 /\ 0 <= undef112 /\ arg2 = 0 /\ arg1 = 20 /\ arg3 = 15 + undef112, {all remain the same}>
44.63/44.74	
44.63/44.74	> Conditions are reachable!
44.63/44.74	
44.63/44.74	Program does NOT terminate
44.63/44.74	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
44.63/44.74	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
44.63/44.74	EOF