30.50/30.57	YES
30.50/30.57	
30.50/30.57	Solver Timeout: 4
30.50/30.57	Global Timeout: 300
30.50/30.57	No parsing errors!
30.50/30.57	Init Location: 0
30.50/30.57	Transitions:
30.50/30.57	<l0, l3, true>
30.50/30.57	<l1, l2, (arg1 > 0) /\ (0 = arg2), par{arg1 -> 0, arg2 -> 0, arg3 -> 0, arg4 -> 0, arg5 -> 0}>
30.50/30.57	<l1, l2, (arg1 > 0) /\ (undef6 > ~(1)) /\ (1 = arg2), par{arg1 -> undef6, arg2 -> 0, arg3 -> 0, arg4 -> 1, arg5 -> 1}>
30.50/30.57	<l1, l2, (undef13 > ~(1)) /\ (undef11 > ~(1)) /\ (arg1 > 0) /\ (2 = arg2), par{arg1 -> undef11, arg2 -> 0, arg3 -> undef13, arg4 -> 2, arg5 -> 2}>
30.50/30.57	<l1, l2, (undef16 > ~(1)) /\ (arg2 > 2) /\ (undef21 > ~(1)) /\ (undef17 > ~(1)) /\ (arg1 > 0), par{arg1 -> undef16, arg2 -> undef17, arg3 -> (undef21 - undef17), arg4 -> arg2, arg5 -> 3}>
30.50/30.57	<l2, l2, ((arg1 + 1) > arg1) /\ (arg1 > ~(1)) /\ (arg3 > 0) /\ (arg5 >= arg4) /\ (arg4 > ~(1)) /\ (arg1 = arg2), par{arg1 -> (arg1 + 1), arg2 -> (arg1 + 1), arg3 -> (10 - (arg1 + 1))}>
30.50/30.57	<l2, l2, (arg3 > 0) /\ (((arg1 + 1) + undef32) >= 1) /\ (arg4 > ~(1)) /\ (arg5 > ~(1)) /\ (arg5 < arg4) /\ (arg1 > ~(1)) /\ (undef32 > ~(1)) /\ (arg1 = arg2), par{arg1 -> ((arg1 + 1) + undef32), arg2 -> ((arg1 + 1) + undef32), arg3 -> (10 - ((arg1 + 1) + undef32)), arg5 -> (arg5 + 1)}>
30.50/30.57	<l3, l1, true, par{arg1 -> undef33, arg2 -> undef34, arg3 -> undef35, arg4 -> undef36, arg5 -> undef37}>
30.50/30.57	
30.50/30.57	Fresh variables:
30.50/30.57	undef6, undef11, undef13, undef16, undef17, undef21, undef32, undef33, undef34, undef35, undef36, undef37, 
30.50/30.57	
30.50/30.57	Undef variables:
30.50/30.57	undef6, undef11, undef13, undef16, undef17, undef21, undef32, undef33, undef34, undef35, undef36, undef37, 
30.50/30.57	
30.50/30.57	Abstraction variables:
30.50/30.57	
30.50/30.57	Exit nodes:
30.50/30.57	
30.50/30.57	Accepting locations:
30.50/30.57	
30.50/30.57	Asserts:
30.50/30.57	
30.50/30.57	Preprocessed LLVMGraph
30.50/30.57	Init Location: 0
30.50/30.57	Transitions:
30.50/30.57	<l0, l2, (undef33 > 0) /\ (0 = undef34), par{arg1 -> 0, arg2 -> 0, arg3 -> 0, arg4 -> 0, arg5 -> 0}>
30.50/30.57	<l0, l2, (undef33 > 0) /\ (undef6 > ~(1)) /\ (1 = undef34), par{arg1 -> undef6, arg2 -> 0, arg3 -> 0, arg4 -> 1, arg5 -> 1}>
30.50/30.57	<l0, l2, (undef13 > ~(1)) /\ (undef11 > ~(1)) /\ (undef33 > 0) /\ (2 = undef34), par{arg1 -> undef11, arg2 -> 0, arg3 -> undef13, arg4 -> 2, arg5 -> 2}>
30.50/30.57	<l0, l2, (undef16 > ~(1)) /\ (undef34 > 2) /\ (undef21 > ~(1)) /\ (undef17 > ~(1)) /\ (undef33 > 0), par{arg1 -> undef16, arg2 -> undef17, arg3 -> (undef21 - undef17), arg4 -> undef34, arg5 -> 3}>
30.50/30.57	<l2, l2, ((arg1 + 1) > arg1) /\ (arg1 > ~(1)) /\ (arg3 > 0) /\ (arg5 >= arg4) /\ (arg4 > ~(1)) /\ (arg1 = arg2), par{arg1 -> (arg1 + 1), arg2 -> (arg1 + 1), arg3 -> (10 - (arg1 + 1))}>
30.50/30.57	<l2, l2, (arg3 > 0) /\ (((arg1 + 1) + undef32) >= 1) /\ (arg4 > ~(1)) /\ (arg5 > ~(1)) /\ (arg5 < arg4) /\ (arg1 > ~(1)) /\ (undef32 > ~(1)) /\ (arg1 = arg2), par{arg1 -> ((arg1 + 1) + undef32), arg2 -> ((arg1 + 1) + undef32), arg3 -> (10 - ((arg1 + 1) + undef32)), arg5 -> (arg5 + 1)}>
30.50/30.57	
30.50/30.57	Fresh variables:
30.50/30.57	undef6, undef11, undef13, undef16, undef17, undef21, undef32, undef33, undef34, undef35, undef36, undef37, 
30.50/30.57	
30.50/30.57	Undef variables:
30.50/30.57	undef6, undef11, undef13, undef16, undef17, undef21, undef32, undef33, undef34, undef35, undef36, undef37, 
30.50/30.57	
30.50/30.57	Abstraction variables:
30.50/30.57	
30.50/30.57	Exit nodes:
30.50/30.57	
30.50/30.57	Accepting locations:
30.50/30.57	
30.50/30.57	Asserts:
30.50/30.57	
30.50/30.57	*************************************************************
30.50/30.57	*******************************************************************************************
30.50/30.57	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
30.50/30.57	*******************************************************************************************
30.50/30.57	
30.50/30.57	Init Location: 0
30.50/30.57	Graph 0:
30.50/30.57	Transitions:
30.50/30.57	Variables:
30.50/30.57	
30.50/30.57	Graph 1:
30.50/30.57	Transitions:
30.50/30.57	<l2, l2, 0 <= arg1 /\ arg4 <= arg5 /\ 0 <= arg4 /\ 1 <= arg3 /\ arg1 = arg2, {arg1 -> 1 + arg1, arg2 -> 1 + arg1, arg3 -> 9 - arg1, rest remain the same}>
30.50/30.57	<l2, l2, 0 <= arg1 /\ 0 <= arg1 + undef32 /\ 0 <= arg4 /\ 0 <= arg5 /\ 0 <= undef32 /\ 1 <= arg3 /\ 1 + arg5 <= arg4 /\ arg1 = arg2, {arg1 -> 1 + arg1 + undef32, arg2 -> 1 + arg1 + undef32, arg3 -> 9 - arg1 - undef32, arg5 -> 1 + arg5, rest remain the same}>
30.50/30.57	Variables:
30.50/30.57	arg1, arg2, arg3, arg4, arg5
30.50/30.57	
30.50/30.57	Precedence: 
30.50/30.57	Graph 0
30.50/30.57	
30.50/30.57	Graph 1
30.50/30.57	<l0, l2, 1 <= undef33 /\ undef34 = 0, {arg1 -> 0, arg2 -> 0, arg3 -> 0, arg4 -> 0, arg5 -> 0, rest remain the same}>
30.50/30.57	<l0, l2, 0 <= undef6 /\ 1 <= undef33 /\ undef34 = 1, {arg1 -> undef6, arg2 -> 0, arg3 -> 0, arg4 -> 1, arg5 -> 1, rest remain the same}>
30.50/30.57	<l0, l2, 0 <= undef11 /\ 0 <= undef13 /\ 1 <= undef33 /\ undef34 = 2, {arg1 -> undef11, arg2 -> 0, arg3 -> undef13, arg4 -> 2, arg5 -> 2, rest remain the same}>
30.50/30.57	<l0, l2, 0 <= undef16 /\ 0 <= undef17 /\ 0 <= undef21 /\ 1 <= undef33 /\ 3 <= undef34, {arg1 -> undef16, arg2 -> undef17, arg3 -> -undef17 + undef21, arg4 -> undef34, arg5 -> 3, rest remain the same}>
30.50/30.57	
30.50/30.57	Map Locations to Subgraph:
30.50/30.57	( 0 , 0 )
30.50/30.57	( 2 , 1 )
30.50/30.57	
30.50/30.57	*******************************************************************************************
30.50/30.57	********************************    CHECKING ASSERTIONS    ********************************
30.50/30.57	*******************************************************************************************
30.50/30.57	
30.50/30.57	Proving termination of subgraph 0
30.50/30.57	Proving termination of subgraph 1
30.50/30.57	Checking unfeasibility...
30.50/30.57	Time used: 0.013536
30.50/30.57	
30.50/30.57	Checking conditional termination of SCC {l2}...
30.50/30.57	
30.50/30.57	LOG: CALL solveLinear
30.50/30.57	
30.50/30.57	LOG: RETURN solveLinear - Elapsed time: 0.002594s
30.50/30.57	Ranking function: arg4 - arg5
30.50/30.57	New Graphs: 
30.50/30.57	Transitions:
30.50/30.57	<l2, l2, 0 <= arg1 /\ arg4 <= arg5 /\ 0 <= arg4 /\ 1 <= arg3 /\ arg1 = arg2, {arg1 -> 1 + arg1, arg2 -> 1 + arg1, arg3 -> 9 - arg1, rest remain the same}>
30.50/30.57	Variables:
30.50/30.57	arg1, arg2, arg3, arg4, arg5
30.50/30.57	Checking conditional termination of SCC {l2}...
30.50/30.57	
30.50/30.57	LOG: CALL solveLinear
30.50/30.57	
30.50/30.57	LOG: RETURN solveLinear - Elapsed time: 0.000831s
30.50/30.57	
30.50/30.57	LOG: CALL solveLinear
30.50/30.57	
30.50/30.57	LOG: RETURN solveLinear - Elapsed time: 0.003291s
30.50/30.57	Trying to remove transition: <l2, l2, 0 <= arg1 /\ arg4 <= arg5 /\ 0 <= arg4 /\ 1 <= arg3 /\ arg1 = arg2, {arg1 -> 1 + arg1, arg2 -> 1 + arg1, arg3 -> 9 - arg1, rest remain the same}>
30.50/30.57	Solving with 1 template(s).
30.50/30.57	
30.50/30.57	LOG: CALL solveNonLinearGetFirstSolution
30.50/30.57	
30.50/30.57	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.985203s
30.50/30.57	Time used: 1.98471
30.50/30.57	Solving with 1 template(s).
30.50/30.57	
30.50/30.57	LOG: CALL solveNonLinearGetFirstSolution
30.50/30.57	
30.50/30.57	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.040508s
30.50/30.57	Time used: 0.032094
30.50/30.57	Improving Solution with cost 2 ...
30.50/30.57	
30.50/30.57	LOG: CALL solveNonLinearGetNextSolution
30.50/30.57	
30.50/30.57	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.568602s
30.50/30.57	Time used: 0.568557
30.50/30.57	
30.50/30.57	LOG: SAT solveNonLinear - Elapsed time: 0.609109s
30.50/30.57	Cost: 2; Total time: 0.600651
30.50/30.57	Failed at location 2: arg2 + arg3 <= 0
30.50/30.57	Failed at location 2: arg2 + arg3 <= 0
30.50/30.57	Before Improving: 
30.50/30.57	Quasi-invariant at l2: arg2 + arg3 <= 0
30.50/30.57	Optimizing invariants...
30.50/30.57	
30.50/30.57	LOG: CALL solveLinear
30.50/30.57	
30.50/30.57	LOG: RETURN solveLinear - Elapsed time: 0.018633s
30.50/30.57	Remaining time after improvement: 0.997054
30.50/30.57	Termination implied by a set of quasi-invariant(s):
30.50/30.57	Quasi-invariant at l2: arg2 + arg3 <= 0
30.50/30.57	[ Invariant Graph ]
30.50/30.57	Strengthening and disabling transitions...
30.50/30.57	
30.50/30.57	LOG: CALL solverLinear in Graph for feasibility
30.50/30.57	
30.50/30.57	LOG: RETURN solveLinear in Graph for feasibility
30.50/30.57	It's unfeasible. Removing transition: 
30.50/30.57	<l2, l2, 0 <= arg1 /\ arg4 <= arg5 /\ 0 <= arg4 /\ 1 <= arg3 /\ arg1 = arg2, {arg1 -> 1 + arg1, arg2 -> 1 + arg1, arg3 -> 9 - arg1, rest remain the same}>
30.50/30.57	
30.50/30.57	LOG: CALL solverLinear in Graph for feasibility
30.50/30.57	
30.50/30.57	LOG: RETURN solveLinear in Graph for feasibility
30.50/30.57	It's unfeasible. Removing transition: 
30.50/30.57	<l2, l2, 0 <= arg1 /\ 0 <= arg1 + undef32 /\ 0 <= arg4 /\ 0 <= arg5 /\ 0 <= undef32 /\ 1 <= arg3 /\ 1 + arg5 <= arg4 /\ arg1 = arg2, {arg1 -> 1 + arg1 + undef32, arg2 -> 1 + arg1 + undef32, arg3 -> 9 - arg1 - undef32, arg5 -> 1 + arg5, rest remain the same}>
30.50/30.57	[ Termination Graph ]
30.50/30.57	Strengthening and disabling transitions...
30.50/30.57	
30.50/30.57	LOG: CALL solverLinear in Graph for feasibility
30.50/30.57	
30.50/30.57	LOG: RETURN solveLinear in Graph for feasibility
30.50/30.57	It's unfeasible. Removing transition: 
30.50/30.57	<l2, l2, 0 <= arg1 /\ arg4 <= arg5 /\ 0 <= arg4 /\ 1 <= arg3 /\ arg1 = arg2, {arg1 -> 1 + arg1, arg2 -> 1 + arg1, arg3 -> 9 - arg1, rest remain the same}>
30.50/30.57	New Graphs: 
30.50/30.57	Calling Safety with literal arg2 + arg3 <= 0 and entry <l0, l2, 0 <= undef11 /\ 0 <= undef13 /\ 1 <= undef33 /\ undef34 = 2, {arg1 -> undef11, arg2 -> 0, arg3 -> undef13, arg4 -> 2, arg5 -> 2, rest remain the same}>
30.50/30.57	
30.50/30.57	LOG: CALL check - Post:arg2 + arg3 <= 0 - Process 1
30.50/30.57	* Exit transition: <l0, l2, 0 <= undef11 /\ 0 <= undef13 /\ 1 <= undef33 /\ undef34 = 2, {arg1 -> undef11, arg2 -> 0, arg3 -> undef13, arg4 -> 2, arg5 -> 2, rest remain the same}>
30.50/30.57	* Postcondition  : arg2 + arg3 <= 0
30.50/30.57	
30.50/30.57	LOG: CALL solveLinear
30.50/30.57	
30.50/30.57	LOG: RETURN solveLinear - Elapsed time: 0.000738s
30.50/30.57	> Postcondition is not implied!
30.50/30.57	
30.50/30.57	LOG: RETURN check - Elapsed time: 0.000874s
30.50/30.57	Calling Safety with literal arg2 + arg3 <= 0 and entry <l0, l2, 0 <= undef16 /\ 0 <= undef17 /\ 0 <= undef21 /\ 1 <= undef33 /\ 3 <= undef34, {arg1 -> undef16, arg2 -> undef17, arg3 -> -undef17 + undef21, arg4 -> undef34, arg5 -> 3, rest remain the same}>
30.50/30.57	
30.50/30.57	LOG: CALL check - Post:arg2 + arg3 <= 0 - Process 2
30.50/30.57	* Exit transition: <l0, l2, 0 <= undef16 /\ 0 <= undef17 /\ 0 <= undef21 /\ 1 <= undef33 /\ 3 <= undef34, {arg1 -> undef16, arg2 -> undef17, arg3 -> -undef17 + undef21, arg4 -> undef34, arg5 -> 3, rest remain the same}>
30.50/30.57	* Postcondition  : arg2 + arg3 <= 0
30.50/30.57	
30.50/30.57	LOG: CALL solveLinear
30.50/30.57	
30.50/30.57	LOG: RETURN solveLinear - Elapsed time: 0.000669s
30.50/30.57	> Postcondition is not implied!
30.50/30.57	
30.50/30.57	LOG: RETURN check - Elapsed time: 0.000792s
30.50/30.57	INVARIANTS: 
30.50/30.57	2: 
30.50/30.57	Quasi-INVARIANTS to narrow Graph: 
30.50/30.57	2: arg2 + arg3 <= 0 , 
30.50/30.57	Narrowing transition: 
30.50/30.57	<l2, l2, 0 <= arg1 /\ arg4 <= arg5 /\ 0 <= arg4 /\ 1 <= arg3 /\ arg1 = arg2, {arg1 -> 1 + arg1, arg2 -> 1 + arg1, arg3 -> 9 - arg1, rest remain the same}>
30.50/30.57	
30.50/30.57	LOG: Narrow transition size 1
30.50/30.57	Narrowing transition: 
30.50/30.57	<l2, l2, 0 <= arg1 /\ 0 <= arg1 + undef32 /\ 0 <= arg4 /\ 0 <= arg5 /\ 0 <= undef32 /\ 1 <= arg3 /\ 1 + arg5 <= arg4 /\ arg1 = arg2, {arg1 -> 1 + arg1 + undef32, arg2 -> 1 + arg1 + undef32, arg3 -> 9 - arg1 - undef32, arg5 -> 1 + arg5, rest remain the same}>
30.50/30.57	
30.50/30.57	LOG: Narrow transition size 1
30.50/30.57	invGraph after Narrowing: 
30.50/30.57	Transitions:
30.50/30.57	<l2, l2, 0 <= arg1 /\ arg4 <= arg5 /\ 0 <= arg4 /\ 1 <= arg2 + arg3 /\ 1 <= arg3 /\ arg1 = arg2, {arg1 -> 1 + arg1, arg2 -> 1 + arg1, arg3 -> 9 - arg1, rest remain the same}>
30.50/30.57	<l2, l2, 0 <= arg1 /\ 0 <= arg1 + undef32 /\ 0 <= arg4 /\ 0 <= arg5 /\ 0 <= undef32 /\ 1 <= arg2 + arg3 /\ 1 <= arg3 /\ 1 + arg5 <= arg4 /\ arg1 = arg2, {arg1 -> 1 + arg1 + undef32, arg2 -> 1 + arg1 + undef32, arg3 -> 9 - arg1 - undef32, arg5 -> 1 + arg5, rest remain the same}>
30.50/30.57	Variables:
30.50/30.57	arg1, arg2, arg3, arg4, arg5
30.50/30.57	Checking conditional termination of SCC {l2}...
30.50/30.57	
30.50/30.57	LOG: CALL solveLinear
30.50/30.57	
30.50/30.57	LOG: RETURN solveLinear - Elapsed time: 0.002503s
30.50/30.57	Ranking function: -3 + 3*arg4 - 3*arg5
30.50/30.57	New Graphs: 
30.50/30.57	Transitions:
30.50/30.57	<l2, l2, 0 <= arg1 /\ arg4 <= arg5 /\ 0 <= arg4 /\ 1 <= arg2 + arg3 /\ 1 <= arg3 /\ arg1 = arg2, {arg1 -> 1 + arg1, arg2 -> 1 + arg1, arg3 -> 9 - arg1, rest remain the same}>
30.50/30.57	Variables:
30.50/30.57	arg1, arg2, arg3, arg4, arg5
30.50/30.57	Checking conditional termination of SCC {l2}...
30.50/30.57	
30.50/30.57	LOG: CALL solveLinear
30.50/30.57	
30.50/30.57	LOG: RETURN solveLinear - Elapsed time: 0.000945s
30.50/30.57	
30.50/30.57	LOG: CALL solveLinear
30.50/30.57	
30.50/30.57	LOG: RETURN solveLinear - Elapsed time: 0.003864s
30.50/30.57	Trying to remove transition: <l2, l2, 0 <= arg1 /\ arg4 <= arg5 /\ 0 <= arg4 /\ 1 <= arg2 + arg3 /\ 1 <= arg3 /\ arg1 = arg2, {arg1 -> 1 + arg1, arg2 -> 1 + arg1, arg3 -> 9 - arg1, rest remain the same}>
30.50/30.57	Solving with 1 template(s).
30.50/30.57	
30.50/30.57	LOG: CALL solveNonLinearGetFirstSolution
30.50/30.57	
30.50/30.57	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 2.178046s
30.50/30.57	Time used: 2.17758
30.50/30.57	Solving with 1 template(s).
30.50/30.57	
30.50/30.57	LOG: CALL solveNonLinearGetFirstSolution
30.50/30.57	
30.50/30.57	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.035437s
30.50/30.57	Time used: 0.031348
30.50/30.57	Improving Solution with cost 2 ...
30.50/30.57	
30.50/30.57	LOG: CALL solveNonLinearGetNextSolution
30.50/30.57	
30.50/30.57	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000608s
30.50/30.57	Time used: 1.00041
30.50/30.57	
30.50/30.57	LOG: SAT solveNonLinear - Elapsed time: 1.036044s
30.50/30.57	Cost: 2; Total time: 1.03176
30.50/30.57	Failed at location 2: arg1 + arg3 + arg5 <= 0
30.50/30.57	Failed at location 2: arg1 + arg3 + arg5 <= 0
30.50/30.57	Before Improving: 
30.50/30.57	Quasi-invariant at l2: arg1 + arg3 + arg5 <= 0
30.50/30.57	Optimizing invariants...
30.50/30.57	
30.50/30.57	LOG: CALL solveLinear
30.50/30.57	
30.50/30.57	LOG: RETURN solveLinear - Elapsed time: 0.019393s
30.50/30.57	Remaining time after improvement: 0.997068
30.50/30.57	Termination implied by a set of quasi-invariant(s):
30.50/30.57	Quasi-invariant at l2: arg1 + arg3 + arg5 <= 0
30.50/30.57	[ Invariant Graph ]
30.50/30.57	Strengthening and disabling transitions...
30.50/30.57	
30.50/30.57	LOG: CALL solverLinear in Graph for feasibility
30.50/30.57	
30.50/30.57	LOG: RETURN solveLinear in Graph for feasibility
30.50/30.57	It's unfeasible. Removing transition: 
30.50/30.57	<l2, l2, 0 <= arg1 /\ arg4 <= arg5 /\ 0 <= arg4 /\ 1 <= arg2 + arg3 /\ 1 <= arg3 /\ arg1 = arg2, {arg1 -> 1 + arg1, arg2 -> 1 + arg1, arg3 -> 9 - arg1, rest remain the same}>
30.50/30.57	
30.50/30.57	LOG: CALL solverLinear in Graph for feasibility
30.50/30.57	
30.50/30.57	LOG: RETURN solveLinear in Graph for feasibility
30.50/30.57	It's unfeasible. Removing transition: 
30.50/30.57	<l2, l2, 0 <= arg1 /\ 0 <= arg1 + undef32 /\ 0 <= arg4 /\ 0 <= arg5 /\ 0 <= undef32 /\ 1 <= arg2 + arg3 /\ 1 <= arg3 /\ 1 + arg5 <= arg4 /\ arg1 = arg2, {arg1 -> 1 + arg1 + undef32, arg2 -> 1 + arg1 + undef32, arg3 -> 9 - arg1 - undef32, arg5 -> 1 + arg5, rest remain the same}>
30.50/30.57	[ Termination Graph ]
30.50/30.57	Strengthening and disabling transitions...
30.50/30.57	> It's unfeasible. Removing transition: 
30.50/30.57	<l2, l2, 0 <= arg1 /\ arg4 <= arg5 /\ 0 <= arg4 /\ 1 <= arg2 + arg3 /\ 1 <= arg3 /\ arg1 = arg2, {arg1 -> 1 + arg1, arg2 -> 1 + arg1, arg3 -> 9 - arg1, rest remain the same}>
30.50/30.57	New Graphs: 
30.50/30.57	Calling Safety with literal arg1 + arg3 + arg5 <= 0 and entry <l0, l2, 0 <= undef11 /\ 1 <= undef13 /\ 1 <= undef33 /\ undef34 = 2, {arg1 -> undef11, arg2 -> 0, arg3 -> undef13, arg4 -> 2, arg5 -> 2, rest remain the same}>
30.50/30.57	
30.50/30.57	LOG: CALL check - Post:arg1 + arg3 + arg5 <= 0 - Process 3
30.50/30.57	* Exit transition: <l0, l2, 0 <= undef11 /\ 1 <= undef13 /\ 1 <= undef33 /\ undef34 = 2, {arg1 -> undef11, arg2 -> 0, arg3 -> undef13, arg4 -> 2, arg5 -> 2, rest remain the same}>
30.50/30.57	* Postcondition  : arg1 + arg3 + arg5 <= 0
30.50/30.57	
30.50/30.57	LOG: CALL solveLinear
30.50/30.57	
30.50/30.57	LOG: RETURN solveLinear - Elapsed time: 0.000893s
30.50/30.57	> Postcondition is not implied!
30.50/30.57	
30.50/30.57	LOG: RETURN check - Elapsed time: 0.001013s
30.50/30.57	Calling Safety with literal arg1 + arg3 + arg5 <= 0 and entry <l0, l2, 0 <= undef16 /\ 0 <= undef17 /\ 1 <= undef21 /\ 1 <= undef33 /\ 3 <= undef34, {arg1 -> undef16, arg2 -> undef17, arg3 -> -undef17 + undef21, arg4 -> undef34, arg5 -> 3, rest remain the same}>
30.50/30.57	
30.50/30.57	LOG: CALL check - Post:arg1 + arg3 + arg5 <= 0 - Process 4
30.50/30.57	* Exit transition: <l0, l2, 0 <= undef16 /\ 0 <= undef17 /\ 1 <= undef21 /\ 1 <= undef33 /\ 3 <= undef34, {arg1 -> undef16, arg2 -> undef17, arg3 -> -undef17 + undef21, arg4 -> undef34, arg5 -> 3, rest remain the same}>
30.50/30.57	* Postcondition  : arg1 + arg3 + arg5 <= 0
30.50/30.57	
30.50/30.57	LOG: CALL solveLinear
30.50/30.57	
30.50/30.57	LOG: RETURN solveLinear - Elapsed time: 0.000803s
30.50/30.57	> Postcondition is not implied!
30.50/30.57	
30.50/30.57	LOG: RETURN check - Elapsed time: 0.000936s
30.50/30.57	INVARIANTS: 
30.50/30.57	2: 
30.50/30.57	Quasi-INVARIANTS to narrow Graph: 
30.50/30.57	2: arg1 + arg3 + arg5 <= 0 , 
30.50/30.57	Narrowing transition: 
30.50/30.57	<l2, l2, 0 <= arg1 /\ arg4 <= arg5 /\ 0 <= arg4 /\ 1 <= arg2 + arg3 /\ 1 <= arg3 /\ arg1 = arg2, {arg1 -> 1 + arg1, arg2 -> 1 + arg1, arg3 -> 9 - arg1, rest remain the same}>
30.50/30.57	
30.50/30.57	LOG: Narrow transition size 1
30.50/30.57	Narrowing transition: 
30.50/30.57	<l2, l2, 0 <= arg1 /\ 0 <= arg1 + undef32 /\ 0 <= arg4 /\ 0 <= arg5 /\ 0 <= undef32 /\ 1 <= arg2 + arg3 /\ 1 <= arg3 /\ 1 + arg5 <= arg4 /\ arg1 = arg2, {arg1 -> 1 + arg1 + undef32, arg2 -> 1 + arg1 + undef32, arg3 -> 9 - arg1 - undef32, arg5 -> 1 + arg5, rest remain the same}>
30.50/30.57	
30.50/30.57	LOG: Narrow transition size 1
30.50/30.57	invGraph after Narrowing: 
30.50/30.57	Transitions:
30.50/30.57	<l2, l2, 0 <= arg1 /\ arg4 <= arg5 /\ 0 <= arg4 /\ 1 <= arg1 + arg3 + arg5 /\ 1 <= arg2 + arg3 /\ 1 <= arg3 /\ arg1 = arg2, {arg1 -> 1 + arg1, arg2 -> 1 + arg1, arg3 -> 9 - arg1, rest remain the same}>
30.50/30.57	<l2, l2, 0 <= arg1 /\ 0 <= arg1 + undef32 /\ 0 <= arg4 /\ 0 <= arg5 /\ 0 <= undef32 /\ 1 <= arg1 + arg3 + arg5 /\ 1 <= arg2 + arg3 /\ 1 <= arg3 /\ 1 + arg5 <= arg4 /\ arg1 = arg2, {arg1 -> 1 + arg1 + undef32, arg2 -> 1 + arg1 + undef32, arg3 -> 9 - arg1 - undef32, arg5 -> 1 + arg5, rest remain the same}>
30.50/30.57	Variables:
30.50/30.57	arg1, arg2, arg3, arg4, arg5
30.50/30.57	Checking conditional termination of SCC {l2}...
30.50/30.57	
30.50/30.57	LOG: CALL solveLinear
30.50/30.57	
30.50/30.57	LOG: RETURN solveLinear - Elapsed time: 0.002871s
30.50/30.57	Ranking function: arg4 - arg5
30.50/30.57	New Graphs: 
30.50/30.57	Transitions:
30.50/30.57	<l2, l2, 0 <= arg1 /\ arg4 <= arg5 /\ 0 <= arg4 /\ 1 <= arg1 + arg3 + arg5 /\ 1 <= arg2 + arg3 /\ 1 <= arg3 /\ arg1 = arg2, {arg1 -> 1 + arg1, arg2 -> 1 + arg1, arg3 -> 9 - arg1, rest remain the same}>
30.50/30.57	Variables:
30.50/30.57	arg1, arg2, arg3, arg4, arg5
30.50/30.57	Checking conditional termination of SCC {l2}...
30.50/30.57	
30.50/30.57	LOG: CALL solveLinear
30.50/30.57	
30.50/30.57	LOG: RETURN solveLinear - Elapsed time: 0.001026s
30.50/30.57	
30.50/30.57	LOG: CALL solveLinear
30.50/30.57	
30.50/30.57	LOG: RETURN solveLinear - Elapsed time: 0.004725s
30.50/30.57	Trying to remove transition: <l2, l2, 0 <= arg1 /\ arg4 <= arg5 /\ 0 <= arg4 /\ 1 <= arg1 + arg3 + arg5 /\ 1 <= arg2 + arg3 /\ 1 <= arg3 /\ arg1 = arg2, {arg1 -> 1 + arg1, arg2 -> 1 + arg1, arg3 -> 9 - arg1, rest remain the same}>
30.50/30.57	Solving with 1 template(s).
30.50/30.57	
30.50/30.57	LOG: CALL solveNonLinearGetFirstSolution
30.50/30.57	
30.50/30.57	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 2.236503s
30.50/30.57	Time used: 2.23598
30.50/30.57	Solving with 1 template(s).
30.50/30.57	
30.50/30.57	LOG: CALL solveNonLinearGetFirstSolution
30.50/30.57	
30.50/30.57	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.069350s
30.50/30.57	Time used: 0.065085
30.50/30.57	Improving Solution with cost 2 ...
30.50/30.57	
30.50/30.57	LOG: CALL solveNonLinearGetNextSolution
30.50/30.57	
30.50/30.57	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.529560s
30.50/30.57	Time used: 0.529529
30.50/30.57	
30.50/30.57	LOG: SAT solveNonLinear - Elapsed time: 0.598910s
30.50/30.57	Cost: 2; Total time: 0.594614
30.50/30.57	Failed at location 2: 1 + arg2 <= arg1
30.50/30.57	Failed at location 2: 1 + arg2 <= arg1
30.50/30.57	Before Improving: 
30.50/30.57	Quasi-invariant at l2: 1 + arg2 <= arg1
30.50/30.57	Optimizing invariants...
30.50/30.57	
30.50/30.57	LOG: CALL solveLinear
30.50/30.57	
30.50/30.57	LOG: RETURN solveLinear - Elapsed time: 0.019846s
30.50/30.57	Remaining time after improvement: 0.99678
30.50/30.57	Termination implied by a set of quasi-invariant(s):
30.50/30.57	Quasi-invariant at l2: 1 + arg2 <= arg1
30.50/30.57	[ Invariant Graph ]
30.50/30.57	Strengthening and disabling transitions...
30.50/30.57	
30.50/30.57	LOG: CALL solverLinear in Graph for feasibility
30.50/30.57	
30.50/30.57	LOG: RETURN solveLinear in Graph for feasibility
30.50/30.57	It's unfeasible. Removing transition: 
30.50/30.57	<l2, l2, 0 <= arg1 /\ arg4 <= arg5 /\ 0 <= arg4 /\ 1 <= arg1 + arg3 + arg5 /\ 1 <= arg2 + arg3 /\ 1 <= arg3 /\ arg1 = arg2, {arg1 -> 1 + arg1, arg2 -> 1 + arg1, arg3 -> 9 - arg1, rest remain the same}>
30.50/30.57	
30.50/30.57	LOG: CALL solverLinear in Graph for feasibility
30.50/30.57	
30.50/30.57	LOG: RETURN solveLinear in Graph for feasibility
30.50/30.57	It's unfeasible. Removing transition: 
30.50/30.57	<l2, l2, 0 <= arg1 /\ 0 <= arg1 + undef32 /\ 0 <= arg4 /\ 0 <= arg5 /\ 0 <= undef32 /\ 1 <= arg1 + arg3 + arg5 /\ 1 <= arg2 + arg3 /\ 1 <= arg3 /\ 1 + arg5 <= arg4 /\ arg1 = arg2, {arg1 -> 1 + arg1 + undef32, arg2 -> 1 + arg1 + undef32, arg3 -> 9 - arg1 - undef32, arg5 -> 1 + arg5, rest remain the same}>
30.50/30.57	[ Termination Graph ]
30.50/30.57	Strengthening and disabling transitions...
30.50/30.57	
30.50/30.57	LOG: CALL solverLinear in Graph for feasibility
30.50/30.57	
30.50/30.57	LOG: RETURN solveLinear in Graph for feasibility
30.50/30.57	It's unfeasible. Removing transition: 
30.50/30.57	<l2, l2, 0 <= arg1 /\ arg4 <= arg5 /\ 0 <= arg4 /\ 1 <= arg1 + arg3 + arg5 /\ 1 <= arg2 + arg3 /\ 1 <= arg3 /\ arg1 = arg2, {arg1 -> 1 + arg1, arg2 -> 1 + arg1, arg3 -> 9 - arg1, rest remain the same}>
30.50/30.57	New Graphs: 
30.50/30.57	Calling Safety with literal 1 + arg2 <= arg1 and entry <l0, l2, 0 <= undef11 /\ 1 <= undef13 /\ 1 <= undef33 /\ 0 <= 1 + undef11 + undef13 /\ undef34 = 2, {arg1 -> undef11, arg2 -> 0, arg3 -> undef13, arg4 -> 2, arg5 -> 2, rest remain the same}>
30.50/30.57	
30.50/30.57	LOG: CALL check - Post:1 + arg2 <= arg1 - Process 5
30.50/30.57	* Exit transition: <l0, l2, 0 <= undef11 /\ 1 <= undef13 /\ 1 <= undef33 /\ 0 <= 1 + undef11 + undef13 /\ undef34 = 2, {arg1 -> undef11, arg2 -> 0, arg3 -> undef13, arg4 -> 2, arg5 -> 2, rest remain the same}>
30.50/30.57	* Postcondition  : 1 + arg2 <= arg1
30.50/30.57	
30.50/30.57	LOG: CALL solveLinear
30.50/30.57	
30.50/30.57	LOG: RETURN solveLinear - Elapsed time: 0.000915s
30.50/30.57	> Postcondition is not implied!
30.50/30.57	
30.50/30.57	LOG: RETURN check - Elapsed time: 0.001040s
30.50/30.57	Calling Safety with literal 1 + arg2 <= arg1 and entry <l0, l2, 0 <= undef16 /\ 0 <= undef17 /\ 1 <= undef21 /\ 1 <= undef33 /\ 3 <= undef34 /\ undef17 <= 2 + undef16 + undef21, {arg1 -> undef16, arg2 -> undef17, arg3 -> -undef17 + undef21, arg4 -> undef34, arg5 -> 3, rest remain the same}>
30.50/30.57	
30.50/30.57	LOG: CALL check - Post:1 + arg2 <= arg1 - Process 6
30.50/30.57	* Exit transition: <l0, l2, 0 <= undef16 /\ 0 <= undef17 /\ 1 <= undef21 /\ 1 <= undef33 /\ 3 <= undef34 /\ undef17 <= 2 + undef16 + undef21, {arg1 -> undef16, arg2 -> undef17, arg3 -> -undef17 + undef21, arg4 -> undef34, arg5 -> 3, rest remain the same}>
30.50/30.57	* Postcondition  : 1 + arg2 <= arg1
30.50/30.57	
30.50/30.57	LOG: CALL solveLinear
30.50/30.57	
30.50/30.57	LOG: RETURN solveLinear - Elapsed time: 0.000880s
30.50/30.57	> Postcondition is not implied!
30.50/30.57	
30.50/30.57	LOG: RETURN check - Elapsed time: 0.001021s
30.50/30.57	INVARIANTS: 
30.50/30.57	2: 
30.50/30.57	Quasi-INVARIANTS to narrow Graph: 
30.50/30.57	2: 1 + arg2 <= arg1 , 
30.50/30.57	Narrowing transition: 
30.50/30.57	<l2, l2, 0 <= arg1 /\ arg4 <= arg5 /\ 0 <= arg4 /\ 1 <= arg1 + arg3 + arg5 /\ 1 <= arg2 + arg3 /\ 1 <= arg3 /\ arg1 = arg2, {arg1 -> 1 + arg1, arg2 -> 1 + arg1, arg3 -> 9 - arg1, rest remain the same}>
30.50/30.57	
30.50/30.57	LOG: Narrow transition size 1
30.50/30.57	Narrowing transition: 
30.50/30.57	<l2, l2, 0 <= arg1 /\ 0 <= arg1 + undef32 /\ 0 <= arg4 /\ 0 <= arg5 /\ 0 <= undef32 /\ 1 <= arg1 + arg3 + arg5 /\ 1 <= arg2 + arg3 /\ 1 <= arg3 /\ 1 + arg5 <= arg4 /\ arg1 = arg2, {arg1 -> 1 + arg1 + undef32, arg2 -> 1 + arg1 + undef32, arg3 -> 9 - arg1 - undef32, arg5 -> 1 + arg5, rest remain the same}>
30.50/30.57	
30.50/30.57	LOG: Narrow transition size 1
30.50/30.57	invGraph after Narrowing: 
30.50/30.57	Transitions:
30.50/30.57	<l2, l2, 0 <= arg1 /\ arg4 <= arg5 /\ 0 <= arg4 /\ 1 <= arg1 + arg3 + arg5 /\ 1 <= arg2 + arg3 /\ 1 <= arg3 /\ arg1 = arg2, {arg1 -> 1 + arg1, arg2 -> 1 + arg1, arg3 -> 9 - arg1, rest remain the same}>
30.50/30.57	<l2, l2, 0 <= arg1 /\ 0 <= arg1 + undef32 /\ 0 <= arg4 /\ 0 <= arg5 /\ 0 <= undef32 /\ 1 <= arg1 + arg3 + arg5 /\ 1 <= arg2 + arg3 /\ 1 <= arg3 /\ 1 + arg5 <= arg4 /\ arg1 = arg2, {arg1 -> 1 + arg1 + undef32, arg2 -> 1 + arg1 + undef32, arg3 -> 9 - arg1 - undef32, arg5 -> 1 + arg5, rest remain the same}>
30.50/30.57	Variables:
30.50/30.57	arg1, arg2, arg3, arg4, arg5
30.50/30.57	Checking conditional termination of SCC {l2}...
30.50/30.57	
30.50/30.57	LOG: CALL solveLinear
30.50/30.57	
30.50/30.57	LOG: RETURN solveLinear - Elapsed time: 0.003014s
30.50/30.57	Ranking function: arg4 - arg5
30.50/30.57	New Graphs: 
30.50/30.57	Transitions:
30.50/30.57	<l2, l2, 0 <= arg1 /\ arg4 <= arg5 /\ 0 <= arg4 /\ 1 <= arg1 + arg3 + arg5 /\ 1 <= arg2 + arg3 /\ 1 <= arg3 /\ arg1 = arg2, {arg1 -> 1 + arg1, arg2 -> 1 + arg1, arg3 -> 9 - arg1, rest remain the same}>
30.50/30.57	Variables:
30.50/30.57	arg1, arg2, arg3, arg4, arg5
30.50/30.57	Checking conditional termination of SCC {l2}...
30.50/30.57	
30.50/30.57	LOG: CALL solveLinear
30.50/30.57	
30.50/30.57	LOG: RETURN solveLinear - Elapsed time: 0.001049s
30.50/30.57	
30.50/30.57	LOG: CALL solveLinear
30.50/30.57	
30.50/30.57	LOG: RETURN solveLinear - Elapsed time: 0.004774s
30.50/30.57	Trying to remove transition: <l2, l2, 0 <= arg1 /\ arg4 <= arg5 /\ 0 <= arg4 /\ 1 <= arg1 + arg3 + arg5 /\ 1 <= arg2 + arg3 /\ 1 <= arg3 /\ arg1 = arg2, {arg1 -> 1 + arg1, arg2 -> 1 + arg1, arg3 -> 9 - arg1, rest remain the same}>
30.50/30.57	Solving with 1 template(s).
30.50/30.57	
30.50/30.57	LOG: CALL solveNonLinearGetFirstSolution
30.50/30.57	
30.50/30.57	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 2.253354s
30.50/30.57	Time used: 2.25285
30.50/30.57	Solving with 1 template(s).
30.50/30.57	
30.50/30.57	LOG: CALL solveNonLinearGetFirstSolution
30.50/30.57	
30.50/30.57	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.064017s
30.50/30.57	Time used: 0.059632
30.50/30.57	Improving Solution with cost 2 ...
30.50/30.57	
30.50/30.57	LOG: CALL solveNonLinearGetNextSolution
30.50/30.57	
30.50/30.57	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000764s
30.50/30.57	Time used: 1.0007
30.50/30.57	
30.50/30.57	LOG: SAT solveNonLinear - Elapsed time: 1.064781s
30.50/30.57	Cost: 2; Total time: 1.06033
30.50/30.57	Failed at location 2: 1 + arg1 <= arg2
30.50/30.57	Failed at location 2: 1 + arg1 <= arg2
30.50/30.57	Before Improving: 
30.50/30.57	Quasi-invariant at l2: 1 + arg1 <= arg2
30.50/30.57	Optimizing invariants...
30.50/30.57	
30.50/30.57	LOG: CALL solveLinear
30.50/30.57	
30.50/30.57	LOG: RETURN solveLinear - Elapsed time: 0.020063s
30.50/30.57	Remaining time after improvement: 0.996687
30.50/30.57	Termination implied by a set of quasi-invariant(s):
30.50/30.57	Quasi-invariant at l2: 1 + arg1 <= arg2
30.50/30.57	[ Invariant Graph ]
30.50/30.57	Strengthening and disabling transitions...
30.50/30.57	
30.50/30.57	LOG: CALL solverLinear in Graph for feasibility
30.50/30.57	
30.50/30.57	LOG: RETURN solveLinear in Graph for feasibility
30.50/30.57	It's unfeasible. Removing transition: 
30.50/30.57	<l2, l2, 0 <= arg1 /\ arg4 <= arg5 /\ 0 <= arg4 /\ 1 <= arg1 + arg3 + arg5 /\ 1 <= arg2 + arg3 /\ 1 <= arg3 /\ arg1 = arg2, {arg1 -> 1 + arg1, arg2 -> 1 + arg1, arg3 -> 9 - arg1, rest remain the same}>
30.50/30.57	
30.50/30.57	LOG: CALL solverLinear in Graph for feasibility
30.50/30.57	
30.50/30.57	LOG: RETURN solveLinear in Graph for feasibility
30.50/30.57	It's unfeasible. Removing transition: 
30.50/30.57	<l2, l2, 0 <= arg1 /\ 0 <= arg1 + undef32 /\ 0 <= arg4 /\ 0 <= arg5 /\ 0 <= undef32 /\ 1 <= arg1 + arg3 + arg5 /\ 1 <= arg2 + arg3 /\ 1 <= arg3 /\ 1 + arg5 <= arg4 /\ arg1 = arg2, {arg1 -> 1 + arg1 + undef32, arg2 -> 1 + arg1 + undef32, arg3 -> 9 - arg1 - undef32, arg5 -> 1 + arg5, rest remain the same}>
30.50/30.57	[ Termination Graph ]
30.50/30.57	Strengthening and disabling transitions...
30.50/30.57	> It's unfeasible. Removing transition: 
30.50/30.57	<l2, l2, 0 <= arg1 /\ arg4 <= arg5 /\ 0 <= arg4 /\ 1 <= arg1 + arg3 + arg5 /\ 1 <= arg2 + arg3 /\ 1 <= arg3 /\ arg1 = arg2, {arg1 -> 1 + arg1, arg2 -> 1 + arg1, arg3 -> 9 - arg1, rest remain the same}>
30.50/30.57	New Graphs: 
30.50/30.57	Calling Safety with literal 1 + arg1 <= arg2 and entry <l0, l2, 1 <= undef13 /\ 1 <= undef33 /\ 0 <= 1 + undef11 + undef13 /\ undef11 = 0 /\ undef34 = 2, {arg1 -> undef11, arg2 -> 0, arg3 -> undef13, arg4 -> 2, arg5 -> 2, rest remain the same}>
30.50/30.57	
30.50/30.57	LOG: CALL check - Post:1 + arg1 <= arg2 - Process 7
30.50/30.57	* Exit transition: <l0, l2, 1 <= undef13 /\ 1 <= undef33 /\ 0 <= 1 + undef11 + undef13 /\ undef11 = 0 /\ undef34 = 2, {arg1 -> undef11, arg2 -> 0, arg3 -> undef13, arg4 -> 2, arg5 -> 2, rest remain the same}>
30.50/30.57	* Postcondition  : 1 + arg1 <= arg2
30.50/30.57	
30.50/30.57	LOG: CALL solveLinear
30.50/30.57	
30.50/30.57	LOG: RETURN solveLinear - Elapsed time: 0.001008s
30.50/30.57	> Postcondition is not implied!
30.50/30.57	
30.50/30.57	LOG: RETURN check - Elapsed time: 0.001141s
30.50/30.57	Calling Safety with literal 1 + arg1 <= arg2 and entry <l0, l2, undef16 <= undef17 /\ 0 <= undef16 /\ 0 <= undef17 /\ 1 <= undef21 /\ 1 <= undef33 /\ 3 <= undef34 /\ undef17 <= 2 + undef16 + undef21, {arg1 -> undef16, arg2 -> undef17, arg3 -> -undef17 + undef21, arg4 -> undef34, arg5 -> 3, rest remain the same}>
30.50/30.57	
30.50/30.57	LOG: CALL check - Post:1 + arg1 <= arg2 - Process 8
30.50/30.57	* Exit transition: <l0, l2, undef16 <= undef17 /\ 0 <= undef16 /\ 0 <= undef17 /\ 1 <= undef21 /\ 1 <= undef33 /\ 3 <= undef34 /\ undef17 <= 2 + undef16 + undef21, {arg1 -> undef16, arg2 -> undef17, arg3 -> -undef17 + undef21, arg4 -> undef34, arg5 -> 3, rest remain the same}>
30.50/30.57	* Postcondition  : 1 + arg1 <= arg2
30.50/30.57	
30.50/30.57	LOG: CALL solveLinear
30.50/30.57	
30.50/30.57	LOG: RETURN solveLinear - Elapsed time: 0.000981s
30.50/30.57	> Postcondition is not implied!
30.50/30.57	
30.50/30.57	LOG: RETURN check - Elapsed time: 0.001130s
30.50/30.57	INVARIANTS: 
30.50/30.57	2: 
30.50/30.57	Quasi-INVARIANTS to narrow Graph: 
30.50/30.57	2: 1 + arg1 <= arg2 , 
30.50/30.57	Narrowing transition: 
30.50/30.57	<l2, l2, 0 <= arg1 /\ arg4 <= arg5 /\ 0 <= arg4 /\ 1 <= arg1 + arg3 + arg5 /\ 1 <= arg2 + arg3 /\ 1 <= arg3 /\ arg1 = arg2, {arg1 -> 1 + arg1, arg2 -> 1 + arg1, arg3 -> 9 - arg1, rest remain the same}>
30.50/30.57	
30.50/30.57	LOG: Narrow transition size 1
30.50/30.57	Narrowing transition: 
30.50/30.57	<l2, l2, 0 <= arg1 /\ 0 <= arg1 + undef32 /\ 0 <= arg4 /\ 0 <= arg5 /\ 0 <= undef32 /\ 1 <= arg1 + arg3 + arg5 /\ 1 <= arg2 + arg3 /\ 1 <= arg3 /\ 1 + arg5 <= arg4 /\ arg1 = arg2, {arg1 -> 1 + arg1 + undef32, arg2 -> 1 + arg1 + undef32, arg3 -> 9 - arg1 - undef32, arg5 -> 1 + arg5, rest remain the same}>
30.50/30.57	
30.50/30.57	LOG: Narrow transition size 1
30.50/30.57	invGraph after Narrowing: 
30.50/30.57	Transitions:
30.50/30.57	<l2, l2, 0 <= arg1 /\ arg4 <= arg5 /\ 0 <= arg4 /\ 1 <= arg1 + arg3 + arg5 /\ 1 <= arg2 + arg3 /\ 1 <= arg3 /\ arg1 = arg2, {arg1 -> 1 + arg1, arg2 -> 1 + arg1, arg3 -> 9 - arg1, rest remain the same}>
30.50/30.57	<l2, l2, 0 <= arg1 /\ 0 <= arg1 + undef32 /\ 0 <= arg4 /\ 0 <= arg5 /\ 0 <= undef32 /\ 1 <= arg1 + arg3 + arg5 /\ 1 <= arg2 + arg3 /\ 1 <= arg3 /\ 1 + arg5 <= arg4 /\ arg1 = arg2, {arg1 -> 1 + arg1 + undef32, arg2 -> 1 + arg1 + undef32, arg3 -> 9 - arg1 - undef32, arg5 -> 1 + arg5, rest remain the same}>
30.50/30.57	Variables:
30.50/30.57	arg1, arg2, arg3, arg4, arg5
30.50/30.57	Checking conditional termination of SCC {l2}...
30.50/30.57	
30.50/30.57	LOG: CALL solveLinear
30.50/30.57	
30.50/30.57	LOG: RETURN solveLinear - Elapsed time: 0.003036s
30.50/30.57	Ranking function: arg4 - arg5
30.50/30.57	New Graphs: 
30.50/30.57	Transitions:
30.50/30.57	<l2, l2, 0 <= arg1 /\ arg4 <= arg5 /\ 0 <= arg4 /\ 1 <= arg1 + arg3 + arg5 /\ 1 <= arg2 + arg3 /\ 1 <= arg3 /\ arg1 = arg2, {arg1 -> 1 + arg1, arg2 -> 1 + arg1, arg3 -> 9 - arg1, rest remain the same}>
30.50/30.57	Variables:
30.50/30.57	arg1, arg2, arg3, arg4, arg5
30.50/30.57	Checking conditional termination of SCC {l2}...
30.50/30.57	
30.50/30.57	LOG: CALL solveLinear
30.50/30.57	
30.50/30.57	LOG: RETURN solveLinear - Elapsed time: 0.001068s
30.50/30.57	
30.50/30.57	LOG: CALL solveLinear
30.50/30.57	
30.50/30.57	LOG: RETURN solveLinear - Elapsed time: 0.004752s
30.50/30.57	Trying to remove transition: <l2, l2, 0 <= arg1 /\ arg4 <= arg5 /\ 0 <= arg4 /\ 1 <= arg1 + arg3 + arg5 /\ 1 <= arg2 + arg3 /\ 1 <= arg3 /\ arg1 = arg2, {arg1 -> 1 + arg1, arg2 -> 1 + arg1, arg3 -> 9 - arg1, rest remain the same}>
30.50/30.57	Solving with 1 template(s).
30.50/30.57	
30.50/30.57	LOG: CALL solveNonLinearGetFirstSolution
30.50/30.57	
30.50/30.57	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 2.245498s
30.50/30.57	Time used: 2.24499
30.50/30.57	Solving with 1 template(s).
30.50/30.57	
30.50/30.57	LOG: CALL solveNonLinearGetFirstSolution
30.50/30.57	
30.50/30.57	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.076786s
30.50/30.57	Time used: 0.071767
30.50/30.57	Improving Solution with cost 2 ...
30.50/30.57	
30.50/30.57	LOG: CALL solveNonLinearGetNextSolution
30.50/30.57	
30.50/30.57	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.908861s
30.50/30.57	Time used: 0.908639
30.50/30.57	
30.50/30.57	LOG: SAT solveNonLinear - Elapsed time: 0.985646s
30.50/30.57	Cost: 2; Total time: 0.980406
30.50/30.57	Failed at location 2: 1 + arg3 <= 0
30.50/30.57	Failed at location 2: 1 + arg3 <= 0
30.50/30.57	Before Improving: 
30.50/30.57	Quasi-invariant at l2: 1 + arg3 <= 0
30.50/30.57	Optimizing invariants...
30.50/30.57	
30.50/30.57	LOG: CALL solveLinear
30.50/30.57	
30.50/30.57	LOG: RETURN solveLinear - Elapsed time: 0.020070s
30.50/30.57	Remaining time after improvement: 0.996807
30.50/30.57	Termination implied by a set of quasi-invariant(s):
30.50/30.57	Quasi-invariant at l2: 1 + arg3 <= 0
30.50/30.57	[ Invariant Graph ]
30.50/30.57	Strengthening and disabling transitions...
30.50/30.57	
30.50/30.57	LOG: CALL solverLinear in Graph for feasibility
30.50/30.57	
30.50/30.57	LOG: RETURN solveLinear in Graph for feasibility
30.50/30.57	It's unfeasible. Removing transition: 
30.50/30.57	<l2, l2, 0 <= arg1 /\ arg4 <= arg5 /\ 0 <= arg4 /\ 1 <= arg1 + arg3 + arg5 /\ 1 <= arg2 + arg3 /\ 1 <= arg3 /\ arg1 = arg2, {arg1 -> 1 + arg1, arg2 -> 1 + arg1, arg3 -> 9 - arg1, rest remain the same}>
30.50/30.57	
30.50/30.57	LOG: CALL solverLinear in Graph for feasibility
30.50/30.57	
30.50/30.57	LOG: RETURN solveLinear in Graph for feasibility
30.50/30.57	It's unfeasible. Removing transition: 
30.50/30.57	<l2, l2, 0 <= arg1 /\ 0 <= arg1 + undef32 /\ 0 <= arg4 /\ 0 <= arg5 /\ 0 <= undef32 /\ 1 <= arg1 + arg3 + arg5 /\ 1 <= arg2 + arg3 /\ 1 <= arg3 /\ 1 + arg5 <= arg4 /\ arg1 = arg2, {arg1 -> 1 + arg1 + undef32, arg2 -> 1 + arg1 + undef32, arg3 -> 9 - arg1 - undef32, arg5 -> 1 + arg5, rest remain the same}>
30.50/30.57	[ Termination Graph ]
30.50/30.57	Strengthening and disabling transitions...
30.50/30.57	
30.50/30.57	LOG: CALL solverLinear in Graph for feasibility
30.50/30.57	
30.50/30.57	LOG: RETURN solveLinear in Graph for feasibility
30.50/30.57	It's unfeasible. Removing transition: 
30.50/30.57	<l2, l2, 0 <= arg1 /\ arg4 <= arg5 /\ 0 <= arg4 /\ 1 <= arg1 + arg3 + arg5 /\ 1 <= arg2 + arg3 /\ 1 <= arg3 /\ arg1 = arg2, {arg1 -> 1 + arg1, arg2 -> 1 + arg1, arg3 -> 9 - arg1, rest remain the same}>
30.50/30.57	New Graphs: 
30.50/30.57	Calling Safety with literal 1 + arg3 <= 0 and entry <l0, l2, 1 <= undef13 /\ 1 <= undef33 /\ 0 <= 1 + undef11 + undef13 /\ undef11 = 0 /\ undef34 = 2, {arg1 -> undef11, arg2 -> 0, arg3 -> undef13, arg4 -> 2, arg5 -> 2, rest remain the same}>
30.50/30.57	
30.50/30.57	LOG: CALL check - Post:1 + arg3 <= 0 - Process 9
30.50/30.57	* Exit transition: <l0, l2, 1 <= undef13 /\ 1 <= undef33 /\ 0 <= 1 + undef11 + undef13 /\ undef11 = 0 /\ undef34 = 2, {arg1 -> undef11, arg2 -> 0, arg3 -> undef13, arg4 -> 2, arg5 -> 2, rest remain the same}>
30.50/30.57	* Postcondition  : 1 + arg3 <= 0
30.50/30.57	
30.50/30.57	LOG: CALL solveLinear
30.50/30.57	
30.50/30.57	LOG: RETURN solveLinear - Elapsed time: 0.001019s
30.50/30.57	> Postcondition is not implied!
30.50/30.57	
30.50/30.57	LOG: RETURN check - Elapsed time: 0.001140s
30.50/30.57	Calling Safety with literal 1 + arg3 <= 0 and entry <l0, l2, 0 <= undef16 /\ 0 <= undef17 /\ 1 <= undef21 /\ 1 <= undef33 /\ 3 <= undef34 /\ undef17 <= 2 + undef16 + undef21 /\ undef16 = undef17, {arg1 -> undef16, arg2 -> undef17, arg3 -> -undef17 + undef21, arg4 -> undef34, arg5 -> 3, rest remain the same}>
30.50/30.57	
30.50/30.57	LOG: CALL check - Post:1 + arg3 <= 0 - Process 10
30.50/30.57	* Exit transition: <l0, l2, 0 <= undef16 /\ 0 <= undef17 /\ 1 <= undef21 /\ 1 <= undef33 /\ 3 <= undef34 /\ undef17 <= 2 + undef16 + undef21 /\ undef16 = undef17, {arg1 -> undef16, arg2 -> undef17, arg3 -> -undef17 + undef21, arg4 -> undef34, arg5 -> 3, rest remain the same}>
30.50/30.57	* Postcondition  : 1 + arg3 <= 0
30.50/30.57	
30.50/30.57	LOG: CALL solveLinear
30.50/30.57	
30.50/30.57	LOG: RETURN solveLinear - Elapsed time: 0.001268s
30.50/30.57	> Postcondition is not implied!
30.50/30.57	
30.50/30.57	LOG: RETURN check - Elapsed time: 0.001416s
30.50/30.57	INVARIANTS: 
30.50/30.57	2: 
30.50/30.57	Quasi-INVARIANTS to narrow Graph: 
30.50/30.57	2: 1 + arg3 <= 0 , 
30.50/30.57	Narrowing transition: 
30.50/30.57	<l2, l2, 0 <= arg1 /\ arg4 <= arg5 /\ 0 <= arg4 /\ 1 <= arg1 + arg3 + arg5 /\ 1 <= arg2 + arg3 /\ 1 <= arg3 /\ arg1 = arg2, {arg1 -> 1 + arg1, arg2 -> 1 + arg1, arg3 -> 9 - arg1, rest remain the same}>
30.50/30.57	
30.50/30.57	LOG: Narrow transition size 1
30.50/30.57	Narrowing transition: 
30.50/30.57	<l2, l2, 0 <= arg1 /\ 0 <= arg1 + undef32 /\ 0 <= arg4 /\ 0 <= arg5 /\ 0 <= undef32 /\ 1 <= arg1 + arg3 + arg5 /\ 1 <= arg2 + arg3 /\ 1 <= arg3 /\ 1 + arg5 <= arg4 /\ arg1 = arg2, {arg1 -> 1 + arg1 + undef32, arg2 -> 1 + arg1 + undef32, arg3 -> 9 - arg1 - undef32, arg5 -> 1 + arg5, rest remain the same}>
30.50/30.57	
30.50/30.57	LOG: Narrow transition size 1
30.50/30.57	invGraph after Narrowing: 
30.50/30.57	Transitions:
30.50/30.57	<l2, l2, 0 <= arg1 /\ arg4 <= arg5 /\ 0 <= arg4 /\ 1 <= arg1 + arg3 + arg5 /\ 1 <= arg2 + arg3 /\ 1 <= arg3 /\ arg1 = arg2, {arg1 -> 1 + arg1, arg2 -> 1 + arg1, arg3 -> 9 - arg1, rest remain the same}>
30.50/30.57	<l2, l2, 0 <= arg1 /\ 0 <= arg1 + undef32 /\ 0 <= arg4 /\ 0 <= arg5 /\ 0 <= undef32 /\ 1 <= arg1 + arg3 + arg5 /\ 1 <= arg2 + arg3 /\ 1 <= arg3 /\ 1 + arg5 <= arg4 /\ arg1 = arg2, {arg1 -> 1 + arg1 + undef32, arg2 -> 1 + arg1 + undef32, arg3 -> 9 - arg1 - undef32, arg5 -> 1 + arg5, rest remain the same}>
30.50/30.57	Variables:
30.50/30.57	arg1, arg2, arg3, arg4, arg5
30.50/30.57	Checking conditional termination of SCC {l2}...
30.50/30.57	
30.50/30.57	LOG: CALL solveLinear
30.50/30.57	
30.50/30.57	LOG: RETURN solveLinear - Elapsed time: 0.003104s
30.50/30.57	Ranking function: arg4 - arg5
30.50/30.57	New Graphs: 
30.50/30.57	Transitions:
30.50/30.57	<l2, l2, 0 <= arg1 /\ arg4 <= arg5 /\ 0 <= arg4 /\ 1 <= arg1 + arg3 + arg5 /\ 1 <= arg2 + arg3 /\ 1 <= arg3 /\ arg1 = arg2, {arg1 -> 1 + arg1, arg2 -> 1 + arg1, arg3 -> 9 - arg1, rest remain the same}>
30.50/30.57	Variables:
30.50/30.57	arg1, arg2, arg3, arg4, arg5
30.50/30.57	Checking conditional termination of SCC {l2}...
30.50/30.57	
30.50/30.57	LOG: CALL solveLinear
30.50/30.57	
30.50/30.57	LOG: RETURN solveLinear - Elapsed time: 0.001120s
30.50/30.57	
30.50/30.57	LOG: CALL solveLinear
30.50/30.57	
30.50/30.57	LOG: RETURN solveLinear - Elapsed time: 0.005024s
30.50/30.57	Trying to remove transition: <l2, l2, 0 <= arg1 /\ arg4 <= arg5 /\ 0 <= arg4 /\ 1 <= arg1 + arg3 + arg5 /\ 1 <= arg2 + arg3 /\ 1 <= arg3 /\ arg1 = arg2, {arg1 -> 1 + arg1, arg2 -> 1 + arg1, arg3 -> 9 - arg1, rest remain the same}>
30.50/30.57	Solving with 1 template(s).
30.50/30.57	
30.50/30.57	LOG: CALL solveNonLinearGetFirstSolution
30.50/30.57	
30.50/30.57	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 2.264679s
30.50/30.57	Time used: 2.26416
30.50/30.57	Solving with 1 template(s).
30.50/30.57	
30.50/30.57	LOG: CALL solveNonLinearGetFirstSolution
30.50/30.57	
30.50/30.57	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.068257s
30.50/30.57	Time used: 0.063512
30.50/30.57	Improving Solution with cost 2 ...
30.50/30.57	
30.50/30.57	LOG: CALL solveNonLinearGetNextSolution
30.50/30.57	
30.50/30.57	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000831s
30.50/30.57	Time used: 1.00076
30.50/30.57	
30.50/30.57	LOG: SAT solveNonLinear - Elapsed time: 1.069088s
30.50/30.57	Cost: 2; Total time: 1.06427
30.50/30.57	Failed at location 2: arg1 + arg3 <= arg2
30.50/30.57	Failed at location 2: arg1 + arg3 <= arg2
30.50/30.57	Before Improving: 
30.50/30.57	Quasi-invariant at l2: arg1 + arg3 <= arg2
30.50/30.57	Optimizing invariants...
30.50/30.57	
30.50/30.57	LOG: CALL solveLinear
30.50/30.57	
30.50/30.57	LOG: RETURN solveLinear - Elapsed time: 0.020550s
30.50/30.57	Remaining time after improvement: 0.996625
30.50/30.57	Termination implied by a set of quasi-invariant(s):
30.50/30.57	Quasi-invariant at l2: arg1 + arg3 <= arg2
30.50/30.57	[ Invariant Graph ]
30.50/30.57	Strengthening and disabling transitions...
30.50/30.57	
30.50/30.57	LOG: CALL solverLinear in Graph for feasibility
30.50/30.57	
30.50/30.57	LOG: RETURN solveLinear in Graph for feasibility
30.50/30.57	It's unfeasible. Removing transition: 
30.50/30.57	<l2, l2, 0 <= arg1 /\ arg4 <= arg5 /\ 0 <= arg4 /\ 1 <= arg1 + arg3 + arg5 /\ 1 <= arg2 + arg3 /\ 1 <= arg3 /\ arg1 = arg2, {arg1 -> 1 + arg1, arg2 -> 1 + arg1, arg3 -> 9 - arg1, rest remain the same}>
30.50/30.57	
30.50/30.57	LOG: CALL solverLinear in Graph for feasibility
30.50/30.57	
30.50/30.57	LOG: RETURN solveLinear in Graph for feasibility
30.50/30.57	It's unfeasible. Removing transition: 
30.50/30.57	<l2, l2, 0 <= arg1 /\ 0 <= arg1 + undef32 /\ 0 <= arg4 /\ 0 <= arg5 /\ 0 <= undef32 /\ 1 <= arg1 + arg3 + arg5 /\ 1 <= arg2 + arg3 /\ 1 <= arg3 /\ 1 + arg5 <= arg4 /\ arg1 = arg2, {arg1 -> 1 + arg1 + undef32, arg2 -> 1 + arg1 + undef32, arg3 -> 9 - arg1 - undef32, arg5 -> 1 + arg5, rest remain the same}>
30.50/30.57	[ Termination Graph ]
30.50/30.57	Strengthening and disabling transitions...
30.50/30.57	> It's unfeasible. Removing transition: 
30.50/30.57	<l2, l2, 0 <= arg1 /\ arg4 <= arg5 /\ 0 <= arg4 /\ 1 <= arg1 + arg3 + arg5 /\ 1 <= arg2 + arg3 /\ 1 <= arg3 /\ arg1 = arg2, {arg1 -> 1 + arg1, arg2 -> 1 + arg1, arg3 -> 9 - arg1, rest remain the same}>
30.50/30.57	New Graphs: 
30.50/30.57	Calling Safety with literal arg1 + arg3 <= arg2 and entry <l0, l2, 1 <= undef13 /\ 1 <= undef33 /\ 0 <= 1 + undef11 + undef13 /\ undef11 = 0 /\ undef34 = 2, {arg1 -> undef11, arg2 -> 0, arg3 -> undef13, arg4 -> 2, arg5 -> 2, rest remain the same}>
30.50/30.57	
30.50/30.57	LOG: CALL check - Post:arg1 + arg3 <= arg2 - Process 11
30.50/30.57	* Exit transition: <l0, l2, 1 <= undef13 /\ 1 <= undef33 /\ 0 <= 1 + undef11 + undef13 /\ undef11 = 0 /\ undef34 = 2, {arg1 -> undef11, arg2 -> 0, arg3 -> undef13, arg4 -> 2, arg5 -> 2, rest remain the same}>
30.50/30.57	* Postcondition  : arg1 + arg3 <= arg2
30.50/30.57	
30.50/30.57	LOG: CALL solveLinear
30.50/30.57	
30.50/30.57	LOG: RETURN solveLinear - Elapsed time: 0.001096s
30.50/30.57	> Postcondition is not implied!
30.50/30.57	
30.50/30.57	LOG: RETURN check - Elapsed time: 0.001229s
30.50/30.57	Calling Safety with literal arg1 + arg3 <= arg2 and entry <l0, l2, 0 <= undef16 /\ undef17 <= undef21 /\ 0 <= undef17 /\ 1 <= undef21 /\ 1 <= undef33 /\ 3 <= undef34 /\ undef17 <= 2 + undef16 + undef21 /\ undef16 = undef17, {arg1 -> undef16, arg2 -> undef17, arg3 -> -undef17 + undef21, arg4 -> undef34, arg5 -> 3, rest remain the same}>
30.50/30.57	
30.50/30.57	LOG: CALL check - Post:arg1 + arg3 <= arg2 - Process 12
30.50/30.57	* Exit transition: <l0, l2, 0 <= undef16 /\ undef17 <= undef21 /\ 0 <= undef17 /\ 1 <= undef21 /\ 1 <= undef33 /\ 3 <= undef34 /\ undef17 <= 2 + undef16 + undef21 /\ undef16 = undef17, {arg1 -> undef16, arg2 -> undef17, arg3 -> -undef17 + undef21, arg4 -> undef34, arg5 -> 3, rest remain the same}>
30.50/30.57	* Postcondition  : arg1 + arg3 <= arg2
30.50/30.57	
30.50/30.57	LOG: CALL solveLinear
30.50/30.57	
30.50/30.57	LOG: RETURN solveLinear - Elapsed time: 0.001058s
30.50/30.57	> Postcondition is not implied!
30.50/30.57	
30.50/30.57	LOG: RETURN check - Elapsed time: 0.001236s
30.50/30.57	INVARIANTS: 
30.50/30.57	2: 
30.50/30.57	Quasi-INVARIANTS to narrow Graph: 
30.50/30.57	2: arg1 + arg3 <= arg2 , 
30.50/30.57	Narrowing transition: 
30.50/30.57	<l2, l2, 0 <= arg1 /\ arg4 <= arg5 /\ 0 <= arg4 /\ 1 <= arg1 + arg3 + arg5 /\ 1 <= arg2 + arg3 /\ 1 <= arg3 /\ arg1 = arg2, {arg1 -> 1 + arg1, arg2 -> 1 + arg1, arg3 -> 9 - arg1, rest remain the same}>
30.50/30.57	
30.50/30.57	LOG: Narrow transition size 1
30.50/30.57	Narrowing transition: 
30.50/30.57	<l2, l2, 0 <= arg1 /\ 0 <= arg1 + undef32 /\ 0 <= arg4 /\ 0 <= arg5 /\ 0 <= undef32 /\ 1 <= arg1 + arg3 + arg5 /\ 1 <= arg2 + arg3 /\ 1 <= arg3 /\ 1 + arg5 <= arg4 /\ arg1 = arg2, {arg1 -> 1 + arg1 + undef32, arg2 -> 1 + arg1 + undef32, arg3 -> 9 - arg1 - undef32, arg5 -> 1 + arg5, rest remain the same}>
30.50/30.57	
30.50/30.57	LOG: Narrow transition size 1
30.50/30.57	invGraph after Narrowing: 
30.50/30.57	Transitions:
30.50/30.57	<l2, l2, 0 <= arg1 /\ arg4 <= arg5 /\ 0 <= arg4 /\ 1 + arg2 <= arg1 + arg3 /\ 1 <= arg1 + arg3 + arg5 /\ 1 <= arg2 + arg3 /\ 1 <= arg3 /\ arg1 = arg2, {arg1 -> 1 + arg1, arg2 -> 1 + arg1, arg3 -> 9 - arg1, rest remain the same}>
30.50/30.57	<l2, l2, 0 <= arg1 /\ 0 <= arg1 + undef32 /\ 0 <= arg4 /\ 0 <= arg5 /\ 0 <= undef32 /\ 1 + arg2 <= arg1 + arg3 /\ 1 <= arg1 + arg3 + arg5 /\ 1 <= arg2 + arg3 /\ 1 <= arg3 /\ 1 + arg5 <= arg4 /\ arg1 = arg2, {arg1 -> 1 + arg1 + undef32, arg2 -> 1 + arg1 + undef32, arg3 -> 9 - arg1 - undef32, arg5 -> 1 + arg5, rest remain the same}>
30.50/30.57	Variables:
30.50/30.57	arg1, arg2, arg3, arg4, arg5
30.50/30.57	Checking conditional termination of SCC {l2}...
30.50/30.57	
30.50/30.57	LOG: CALL solveLinear
30.50/30.57	
30.50/30.57	LOG: RETURN solveLinear - Elapsed time: 0.003385s
30.50/30.57	Ranking function: -2 + 3*arg4 - 3*arg5
30.50/30.57	New Graphs: 
30.50/30.57	Transitions:
30.50/30.57	<l2, l2, 0 <= arg1 /\ arg4 <= arg5 /\ 0 <= arg4 /\ 1 + arg2 <= arg1 + arg3 /\ 1 <= arg1 + arg3 + arg5 /\ 1 <= arg2 + arg3 /\ 1 <= arg3 /\ arg1 = arg2, {arg1 -> 1 + arg1, arg2 -> 1 + arg1, arg3 -> 9 - arg1, rest remain the same}>
30.50/30.57	Variables:
30.50/30.57	arg1, arg2, arg3, arg4, arg5
30.50/30.57	Checking conditional termination of SCC {l2}...
30.50/30.57	
30.50/30.57	LOG: CALL solveLinear
30.50/30.57	
30.50/30.57	LOG: RETURN solveLinear - Elapsed time: 0.001186s
30.50/30.57	
30.50/30.57	LOG: CALL solveLinear
30.50/30.57	
30.50/30.57	LOG: RETURN solveLinear - Elapsed time: 0.004703s
30.50/30.57	Trying to remove transition: <l2, l2, 0 <= arg1 /\ arg4 <= arg5 /\ 0 <= arg4 /\ 1 + arg2 <= arg1 + arg3 /\ 1 <= arg1 + arg3 + arg5 /\ 1 <= arg2 + arg3 /\ 1 <= arg3 /\ arg1 = arg2, {arg1 -> 1 + arg1, arg2 -> 1 + arg1, arg3 -> 9 - arg1, rest remain the same}>
30.50/30.57	Solving with 1 template(s).
30.50/30.57	
30.50/30.57	LOG: CALL solveNonLinearGetFirstSolution
30.50/30.57	
30.50/30.57	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 2.206260s
30.50/30.57	Time used: 2.20576
30.50/30.57	Solving with 1 template(s).
30.50/30.57	
30.50/30.57	LOG: CALL solveNonLinearGetFirstSolution
30.50/30.57	
30.50/30.57	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005890s
30.50/30.57	Time used: 4.00075
30.50/30.57	Solving with 2 template(s).
30.50/30.57	
30.50/30.57	LOG: CALL solveNonLinearGetFirstSolution
30.50/30.57	
30.50/30.57	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.008270s
30.50/30.57	Time used: 4.00021
30.50/30.57	Solving with 3 template(s).
30.50/30.57	
30.50/30.57	LOG: CALL solveNonLinearGetFirstSolution
30.50/30.57	
30.50/30.57	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.009768s
30.50/30.57	Time used: 1.00004
30.50/30.57	Solving with 1 template(s).
30.50/30.57	
30.50/30.57	LOG: CALL solveNonLinearGetFirstSolution
30.50/30.57	
30.50/30.57	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.053850s
30.50/30.57	Time used: 0.031071
30.50/30.57	Improving Solution with cost 1 ...
30.50/30.57	
30.50/30.57	LOG: CALL solveNonLinearGetNextSolution
30.50/30.57	
30.50/30.57	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.336735s
30.50/30.57	Time used: 0.336701
30.50/30.57	
30.50/30.57	LOG: SAT solveNonLinear - Elapsed time: 0.390585s
30.50/30.57	Cost: 1; Total time: 0.367772
30.50/30.57	Termination implied by a set of invariant(s):
30.50/30.57	Invariant at l2: 0 <= 1 + arg2 + arg4
30.50/30.57	[ Invariant Graph ]
30.50/30.57	Strengthening and disabling transitions...
30.50/30.57	
30.50/30.57	LOG: CALL solverLinear in Graph for feasibility
30.50/30.57	
30.50/30.57	LOG: RETURN solveLinear in Graph for feasibility
30.50/30.57	Strengthening transition (result): 
30.50/30.57	<l2, l2, 0 <= arg1 /\ arg4 <= arg5 /\ 0 <= arg4 /\ 1 + arg2 <= arg1 + arg3 /\ 1 <= arg1 + arg3 + arg5 /\ 1 <= arg2 + arg3 /\ 1 <= arg3 /\ 0 <= 1 + arg2 + arg4 /\ arg1 = arg2, {arg1 -> 1 + arg1, arg2 -> 1 + arg1, arg3 -> 9 - arg1, rest remain the same}>
30.50/30.58	
30.50/30.58	LOG: CALL solverLinear in Graph for feasibility
30.50/30.58	
30.50/30.58	LOG: RETURN solveLinear in Graph for feasibility
30.50/30.58	Strengthening transition (result): 
30.50/30.58	<l2, l2, 0 <= arg1 /\ 0 <= arg1 + undef32 /\ 0 <= arg4 /\ 0 <= arg5 /\ 0 <= undef32 /\ 1 + arg2 <= arg1 + arg3 /\ 1 <= arg1 + arg3 + arg5 /\ 1 <= arg2 + arg3 /\ 1 <= arg3 /\ 1 + arg5 <= arg4 /\ 0 <= 1 + arg2 + arg4 /\ arg1 = arg2, {arg1 -> 1 + arg1 + undef32, arg2 -> 1 + arg1 + undef32, arg3 -> 9 - arg1 - undef32, arg5 -> 1 + arg5, rest remain the same}>
30.50/30.58	[ Termination Graph ]
30.50/30.58	Strengthening and disabling transitions...
30.50/30.58	
30.50/30.58	LOG: CALL solverLinear in Graph for feasibility
30.50/30.58	
30.50/30.58	LOG: RETURN solveLinear in Graph for feasibility
30.50/30.58	Strengthening transition (result): 
30.50/30.58	<l2, l2, 0 <= arg1 /\ arg4 <= arg5 /\ 0 <= arg4 /\ 1 + arg2 <= arg1 + arg3 /\ 1 <= arg1 + arg3 + arg5 /\ 1 <= arg2 + arg3 /\ 1 <= arg3 /\ 0 <= 1 + arg2 + arg4 /\ arg1 = arg2, {arg1 -> 1 + arg1, arg2 -> 1 + arg1, arg3 -> 9 - arg1, rest remain the same}>
30.50/30.58	Quasi-ranking function: 50000 - arg2
30.50/30.58	New Graphs: 
30.50/30.58	Transitions:
30.50/30.58	<l2, l2, 0 <= arg1 /\ arg4 <= arg5 /\ 0 <= arg4 /\ 1 + arg2 <= arg1 + arg3 /\ 1 <= arg1 + arg3 + arg5 /\ 1 <= arg2 + arg3 /\ 1 <= arg3 /\ 0 <= 1 + arg2 + arg4 /\ 50001 <= arg2 /\ arg1 = arg2, {arg1 -> 1 + arg1, arg2 -> 1 + arg1, arg3 -> 9 - arg1, rest remain the same}>
30.50/30.58	Variables:
30.50/30.58	arg1, arg2, arg3, arg4, arg5
30.50/30.58	Checking conditional termination of SCC {l2}...
30.50/30.58	
30.50/30.58	LOG: CALL solveLinear
30.50/30.58	
30.50/30.58	LOG: RETURN solveLinear - Elapsed time: 0.002230s
30.50/30.58	Ranking function: (~(1) / 49993) + (1 / 49993)*arg3
30.50/30.58	New Graphs: 
30.50/30.58	INVARIANTS: 
30.50/30.58	2: 0 <= 1 + arg2 + arg4 , 
30.50/30.58	Quasi-INVARIANTS to narrow Graph: 
30.50/30.58	2: 
30.50/30.58	Program Terminates
30.50/30.58	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
30.50/30.58	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
30.50/30.58	EOF