1.44/1.50	YES
1.44/1.50	
1.44/1.50	Solver Timeout: 4
1.44/1.50	Global Timeout: 300
1.44/1.50	No parsing errors!
1.44/1.50	Init Location: 0
1.44/1.50	Transitions:
1.44/1.50	<l0, l28, true>
1.44/1.50	<l1, l2, true>
1.44/1.50	<l3, l4, true>
1.44/1.50	<l5, l3, true>
1.44/1.50	<l5, l3, true>
1.44/1.50	<l6, l7, true>
1.44/1.50	<l8, l9, ((1 + n^0) <= (0 + i^0)), par{j^0 -> (1 + j^0)}>
1.44/1.50	<l8, l10, ((0 + i^0) <= (0 + n^0)), par{i^0 -> (1 + i^0)}>
1.44/1.50	<l11, l12, true>
1.44/1.50	<l13, l10, ((1 + n^0) <= (0 + i^0)) /\ (undef155 = undef155), par{tau^0 -> undef155}>
1.44/1.50	<l13, l14, ((0 + i^0) <= (0 + n^0)) /\ (undef172 = undef172), par{i^0 -> (1 + i^0), sum^0 -> undef172}>
1.44/1.50	<l15, l16, ((1 + n^0) <= (0 + j^0))>
1.44/1.50	<l15, l14, ((0 + j^0) <= (0 + n^0))>
1.44/1.50	<l17, l18, true>
1.44/1.50	<l19, l9, true>
1.44/1.50	<l20, l19, (undef269 = undef269) /\ (undef270 = undef270), par{sigma^0 -> (0 + (~(1) * undef270)), tmp___4^0 -> undef269, tmp___5^0 -> undef270}>
1.44/1.50	<l20, l19, (undef285 = undef285) /\ (undef286 = undef286), par{sigma^0 -> (0 + undef286), tmp___2^0 -> undef285, tmp___3^0 -> undef286}>
1.44/1.50	<l21, l22, (undef302 = undef302), par{tmp___1^0 -> undef302}>
1.44/1.50	<l9, l15, true>
1.44/1.50	<l22, l17, true, par{i^0 -> (1 + i^0), sum^0 -> ((0 + sum^0) + tmp___1^0)}>
1.44/1.50	<l23, l21, (1 <= (0 + sqrarg^0))>
1.44/1.50	<l23, l21, ((1 + sqrarg^0) <= 0)>
1.44/1.50	<l23, l22, ((0 + sqrarg^0) <= 0) /\ (0 <= (0 + sqrarg^0)), par{tmp___1^0 -> 0}>
1.44/1.50	<l18, l20, ((1 + n^0) <= (0 + i^0))>
1.44/1.50	<l18, l23, ((0 + i^0) <= (0 + n^0)) /\ (undef423 = undef423), par{sqrarg^0 -> undef423}>
1.44/1.50	<l14, l13, true>
1.44/1.50	<l12, l17, ((1 + n^0) <= (0 + i^0))>
1.44/1.50	<l12, l11, ((0 + i^0) <= (0 + n^0)), par{i^0 -> (1 + i^0)}>
1.44/1.50	<l16, l1, true, par{k^0 -> (1 + k^0)}>
1.44/1.50	<l24, l11, (1 <= (0 + scale^0))>
1.44/1.50	<l24, l11, ((1 + scale^0) <= 0)>
1.44/1.50	<l24, l16, ((0 + scale^0) <= 0) /\ (0 <= (0 + scale^0)), par{tmp___0^0 -> 0}>
1.44/1.50	<l25, l6, true, par{i^0 -> (1 + i^0)}>
1.44/1.50	<l10, l8, true>
1.44/1.50	<l26, l25, ((0 + maxarg1^0) <= (0 + maxarg2^0)), par{scale^0 -> (0 + maxarg2^0)}>
1.44/1.50	<l26, l25, ((1 + maxarg2^0) <= (0 + maxarg1^0)), par{scale^0 -> (0 + maxarg1^0)}>
1.44/1.50	<l7, l24, ((1 + n^0) <= (0 + i^0))>
1.44/1.50	<l7, l26, ((0 + i^0) <= (0 + n^0)) /\ (undef660 = undef660), par{maxarg1^0 -> (0 + scale^0), maxarg2^0 -> (0 + undef660), tmp^0 -> undef660}>
1.44/1.50	<l2, l5, ((0 + n^0) <= (0 + k^0))>
1.44/1.50	<l2, l6, ((1 + k^0) <= (0 + n^0)), par{scale^0 -> 0}>
1.44/1.50	<l27, l1, (2 <= (0 + n^0))>
1.44/1.50	<l28, l27, true>
1.44/1.50	
1.44/1.50	Fresh variables:
1.44/1.50	undef155, undef172, undef269, undef270, undef285, undef286, undef302, undef423, undef660, 
1.44/1.50	
1.44/1.50	Undef variables:
1.44/1.50	undef155, undef172, undef269, undef270, undef285, undef286, undef302, undef423, undef660, 
1.44/1.50	
1.44/1.50	Abstraction variables:
1.44/1.50	
1.44/1.50	Exit nodes:
1.44/1.50	
1.44/1.50	Accepting locations:
1.44/1.50	
1.44/1.50	Asserts:
1.44/1.50	
1.44/1.50	Preprocessed LLVMGraph
1.44/1.50	Init Location: 0
1.44/1.50	Transitions:
1.44/1.50	<l0, l4, (2 <= (0 + n^0)) /\ ((0 + n^0) <= (0 + k^0))>
1.44/1.50	<l0, l4, (2 <= (0 + n^0)) /\ ((0 + n^0) <= (0 + k^0))>
1.44/1.50	<l0, l6, (2 <= (0 + n^0)) /\ ((1 + k^0) <= (0 + n^0)), par{scale^0 -> 0}>
1.44/1.50	<l6, l11, ((1 + n^0) <= (0 + i^0)) /\ (1 <= (0 + scale^0))>
1.44/1.50	<l6, l11, ((1 + n^0) <= (0 + i^0)) /\ ((1 + scale^0) <= 0)>
1.44/1.50	<l6, l4, ((1 + n^0) <= (0 + i^0)) /\ ((0 + scale^0) <= 0) /\ (0 <= (0 + scale^0)) /\ ((0 + n^0) <= (0 + (1 + k^0))), par{k^0 -> (1 + k^0)}>
1.44/1.50	<l6, l4, ((1 + n^0) <= (0 + i^0)) /\ ((0 + scale^0) <= 0) /\ (0 <= (0 + scale^0)) /\ ((0 + n^0) <= (0 + (1 + k^0))), par{k^0 -> (1 + k^0)}>
1.44/1.50	<l6, l6, ((1 + n^0) <= (0 + i^0)) /\ ((0 + scale^0) <= 0) /\ (0 <= (0 + scale^0)) /\ ((1 + (1 + k^0)) <= (0 + n^0)), par{k^0 -> (1 + k^0), scale^0 -> 0}>
1.44/1.50	<l6, l6, ((0 + i^0) <= (0 + n^0)) /\ (undef660 = undef660) /\ ((0 + (0 + scale^0)) <= (0 + (0 + undef660))), par{i^0 -> (1 + i^0), scale^0 -> (0 + (0 + undef660))}>
1.44/1.50	<l6, l6, ((0 + i^0) <= (0 + n^0)) /\ (undef660 = undef660) /\ ((1 + (0 + undef660)) <= (0 + (0 + scale^0))), par{i^0 -> (1 + i^0), scale^0 -> (0 + (0 + scale^0))}>
1.44/1.50	<l10, l4, ((1 + n^0) <= (0 + i^0)) /\ ((1 + n^0) <= (0 + (1 + j^0))) /\ ((0 + n^0) <= (0 + (1 + k^0))), par{j^0 -> (1 + j^0), k^0 -> (1 + k^0)}>
1.44/1.50	<l10, l4, ((1 + n^0) <= (0 + i^0)) /\ ((1 + n^0) <= (0 + (1 + j^0))) /\ ((0 + n^0) <= (0 + (1 + k^0))), par{j^0 -> (1 + j^0), k^0 -> (1 + k^0)}>
1.44/1.50	<l10, l6, ((1 + n^0) <= (0 + i^0)) /\ ((1 + n^0) <= (0 + (1 + j^0))) /\ ((1 + (1 + k^0)) <= (0 + n^0)), par{j^0 -> (1 + j^0), k^0 -> (1 + k^0), scale^0 -> 0}>
1.44/1.50	<l10, l14, ((1 + n^0) <= (0 + i^0)) /\ ((0 + (1 + j^0)) <= (0 + n^0)), par{j^0 -> (1 + j^0)}>
1.44/1.50	<l10, l10, ((0 + i^0) <= (0 + n^0)), par{i^0 -> (1 + i^0)}>
1.44/1.50	<l11, l17, ((1 + n^0) <= (0 + i^0))>
1.44/1.50	<l11, l11, ((0 + i^0) <= (0 + n^0)), par{i^0 -> (1 + i^0)}>
1.44/1.50	<l14, l10, ((1 + n^0) <= (0 + i^0)) /\ (undef155 = undef155)>
1.44/1.50	<l14, l14, ((0 + i^0) <= (0 + n^0)) /\ (undef172 = undef172), par{i^0 -> (1 + i^0), sum^0 -> undef172}>
1.44/1.50	<l17, l4, ((1 + n^0) <= (0 + i^0)) /\ (undef269 = undef269) /\ (undef270 = undef270) /\ ((1 + n^0) <= (0 + j^0)) /\ ((0 + n^0) <= (0 + (1 + k^0))), par{k^0 -> (1 + k^0)}>
1.44/1.50	<l17, l4, ((1 + n^0) <= (0 + i^0)) /\ (undef269 = undef269) /\ (undef270 = undef270) /\ ((1 + n^0) <= (0 + j^0)) /\ ((0 + n^0) <= (0 + (1 + k^0))), par{k^0 -> (1 + k^0)}>
1.44/1.50	<l17, l6, ((1 + n^0) <= (0 + i^0)) /\ (undef269 = undef269) /\ (undef270 = undef270) /\ ((1 + n^0) <= (0 + j^0)) /\ ((1 + (1 + k^0)) <= (0 + n^0)), par{k^0 -> (1 + k^0), scale^0 -> 0}>
1.44/1.50	<l17, l14, ((1 + n^0) <= (0 + i^0)) /\ (undef269 = undef269) /\ (undef270 = undef270) /\ ((0 + j^0) <= (0 + n^0))>
1.44/1.50	<l17, l4, ((1 + n^0) <= (0 + i^0)) /\ (undef285 = undef285) /\ (undef286 = undef286) /\ ((1 + n^0) <= (0 + j^0)) /\ ((0 + n^0) <= (0 + (1 + k^0))), par{k^0 -> (1 + k^0)}>
1.44/1.50	<l17, l4, ((1 + n^0) <= (0 + i^0)) /\ (undef285 = undef285) /\ (undef286 = undef286) /\ ((1 + n^0) <= (0 + j^0)) /\ ((0 + n^0) <= (0 + (1 + k^0))), par{k^0 -> (1 + k^0)}>
1.44/1.50	<l17, l6, ((1 + n^0) <= (0 + i^0)) /\ (undef285 = undef285) /\ (undef286 = undef286) /\ ((1 + n^0) <= (0 + j^0)) /\ ((1 + (1 + k^0)) <= (0 + n^0)), par{k^0 -> (1 + k^0), scale^0 -> 0}>
1.44/1.50	<l17, l14, ((1 + n^0) <= (0 + i^0)) /\ (undef285 = undef285) /\ (undef286 = undef286) /\ ((0 + j^0) <= (0 + n^0))>
1.44/1.50	<l17, l17, ((0 + i^0) <= (0 + n^0)) /\ (undef423 = undef423) /\ (1 <= (0 + undef423)) /\ (undef302 = undef302), par{i^0 -> (1 + i^0), sum^0 -> ((0 + sum^0) + undef302)}>
1.44/1.50	<l17, l17, ((0 + i^0) <= (0 + n^0)) /\ (undef423 = undef423) /\ ((1 + undef423) <= 0) /\ (undef302 = undef302), par{i^0 -> (1 + i^0), sum^0 -> ((0 + sum^0) + undef302)}>
1.44/1.50	<l17, l17, ((0 + i^0) <= (0 + n^0)) /\ (undef423 = undef423) /\ ((0 + undef423) <= 0) /\ (0 <= (0 + undef423)), par{i^0 -> (1 + i^0), sum^0 -> ((0 + sum^0) + 0)}>
1.44/1.50	
1.44/1.50	Fresh variables:
1.44/1.50	undef155, undef172, undef269, undef270, undef285, undef286, undef302, undef423, undef660, 
1.44/1.50	
1.44/1.50	Undef variables:
1.44/1.50	undef155, undef172, undef269, undef270, undef285, undef286, undef302, undef423, undef660, 
1.44/1.50	
1.44/1.50	Abstraction variables:
1.44/1.50	
1.44/1.50	Exit nodes:
1.44/1.50	
1.44/1.50	Accepting locations:
1.44/1.50	
1.44/1.50	Asserts:
1.44/1.50	
1.44/1.50	*************************************************************
1.44/1.50	*******************************************************************************************
1.44/1.50	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
1.44/1.50	*******************************************************************************************
1.44/1.50	
1.44/1.50	Init Location: 0
1.44/1.50	Graph 0:
1.44/1.50	Transitions:
1.44/1.50	Variables:
1.44/1.50	
1.44/1.50	Graph 1:
1.44/1.50	Transitions:
1.44/1.50	<l6, l11, 1 + n^0 <= i^0 /\ 1 <= scale^0, {all remain the same}>
1.44/1.50	<l6, l11, 1 + n^0 <= i^0 /\ 1 + scale^0 <= 0, {all remain the same}>
1.44/1.50	<l6, l6, 1 + n^0 <= i^0 /\ 2 + k^0 <= n^0 /\ scale^0 = 0, {k^0 -> 1 + k^0, scale^0 -> 0, rest remain the same}>
1.44/1.50	<l6, l6, i^0 <= n^0 /\ scale^0 <= undef660, {i^0 -> 1 + i^0, scale^0 -> undef660, rest remain the same}>
1.44/1.50	<l6, l6, 1 + undef660 <= scale^0 /\ i^0 <= n^0, {i^0 -> 1 + i^0, rest remain the same}>
1.44/1.50	<l10, l6, 1 + n^0 <= i^0 /\ n^0 <= j^0 /\ 2 + k^0 <= n^0, {j^0 -> 1 + j^0, k^0 -> 1 + k^0, scale^0 -> 0, rest remain the same}>
1.44/1.50	<l10, l14, 1 + n^0 <= i^0 /\ 1 + j^0 <= n^0, {j^0 -> 1 + j^0, rest remain the same}>
1.44/1.50	<l10, l10, i^0 <= n^0, {i^0 -> 1 + i^0, rest remain the same}>
1.44/1.50	<l11, l17, 1 + n^0 <= i^0, {all remain the same}>
1.44/1.50	<l11, l11, i^0 <= n^0, {i^0 -> 1 + i^0, rest remain the same}>
1.44/1.50	<l14, l10, 1 + n^0 <= i^0, {all remain the same}>
1.44/1.50	<l14, l14, i^0 <= n^0, {i^0 -> 1 + i^0, sum^0 -> undef172, rest remain the same}>
1.44/1.50	<l17, l6, 1 + n^0 <= i^0 /\ 1 + n^0 <= j^0 /\ 2 + k^0 <= n^0, {k^0 -> 1 + k^0, scale^0 -> 0, rest remain the same}>
1.44/1.50	<l17, l14, 1 + n^0 <= i^0 /\ j^0 <= n^0, {all remain the same}>
1.44/1.50	<l17, l6, 1 + n^0 <= i^0 /\ 1 + n^0 <= j^0 /\ 2 + k^0 <= n^0, {k^0 -> 1 + k^0, scale^0 -> 0, rest remain the same}>
1.44/1.50	<l17, l14, 1 + n^0 <= i^0 /\ j^0 <= n^0, {all remain the same}>
1.44/1.50	<l17, l17, 1 <= undef423 /\ i^0 <= n^0, {i^0 -> 1 + i^0, sum^0 -> sum^0 + undef302, rest remain the same}>
1.44/1.50	<l17, l17, 1 + undef423 <= 0 /\ i^0 <= n^0, {i^0 -> 1 + i^0, sum^0 -> sum^0 + undef302, rest remain the same}>
1.44/1.50	<l17, l17, i^0 <= n^0 /\ undef423 = 0, {i^0 -> 1 + i^0, rest remain the same}>
1.44/1.50	Variables:
1.44/1.50	i^0, n^0, scale^0, k^0, j^0, sum^0
1.44/1.50	
1.44/1.50	Graph 2:
1.44/1.50	Transitions:
1.44/1.50	Variables:
1.44/1.50	
1.44/1.50	Precedence: 
1.44/1.50	Graph 0
1.44/1.50	
1.44/1.50	Graph 1
1.44/1.50	<l0, l6, 1 + k^0 <= n^0 /\ 2 <= n^0, {scale^0 -> 0, rest remain the same}>
1.44/1.50	
1.44/1.50	Graph 2
1.44/1.50	<l0, l4, n^0 <= k^0 /\ 2 <= n^0, {all remain the same}>
1.44/1.50	<l0, l4, n^0 <= k^0 /\ 2 <= n^0, {all remain the same}>
1.44/1.50	<l6, l4, 1 + n^0 <= i^0 /\ n^0 <= 1 + k^0 /\ scale^0 = 0, {k^0 -> 1 + k^0, rest remain the same}>
1.44/1.50	<l6, l4, 1 + n^0 <= i^0 /\ n^0 <= 1 + k^0 /\ scale^0 = 0, {k^0 -> 1 + k^0, rest remain the same}>
1.44/1.50	<l10, l4, 1 + n^0 <= i^0 /\ n^0 <= j^0 /\ n^0 <= 1 + k^0, {j^0 -> 1 + j^0, k^0 -> 1 + k^0, rest remain the same}>
1.44/1.50	<l10, l4, 1 + n^0 <= i^0 /\ n^0 <= j^0 /\ n^0 <= 1 + k^0, {j^0 -> 1 + j^0, k^0 -> 1 + k^0, rest remain the same}>
1.44/1.50	<l17, l4, 1 + n^0 <= i^0 /\ 1 + n^0 <= j^0 /\ n^0 <= 1 + k^0, {k^0 -> 1 + k^0, rest remain the same}>
1.44/1.50	<l17, l4, 1 + n^0 <= i^0 /\ 1 + n^0 <= j^0 /\ n^0 <= 1 + k^0, {k^0 -> 1 + k^0, rest remain the same}>
1.44/1.50	<l17, l4, 1 + n^0 <= i^0 /\ 1 + n^0 <= j^0 /\ n^0 <= 1 + k^0, {k^0 -> 1 + k^0, rest remain the same}>
1.44/1.50	<l17, l4, 1 + n^0 <= i^0 /\ 1 + n^0 <= j^0 /\ n^0 <= 1 + k^0, {k^0 -> 1 + k^0, rest remain the same}>
1.44/1.50	
1.44/1.50	Map Locations to Subgraph:
1.44/1.50	( 0 , 0 )
1.44/1.50	( 4 , 2 )
1.44/1.50	( 6 , 1 )
1.44/1.50	( 10 , 1 )
1.44/1.50	( 11 , 1 )
1.44/1.50	( 14 , 1 )
1.44/1.50	( 17 , 1 )
1.44/1.50	
1.44/1.50	*******************************************************************************************
1.44/1.50	********************************    CHECKING ASSERTIONS    ********************************
1.44/1.50	*******************************************************************************************
1.44/1.50	
1.44/1.50	Proving termination of subgraph 0
1.44/1.50	Proving termination of subgraph 1
1.44/1.50	Checking unfeasibility...
1.44/1.50	Time used: 0.219622
1.44/1.50	Some transition disabled by a set of invariant(s):
1.44/1.50	Invariant at l6: 0 <= scale^0
1.44/1.50	Invariant at l10: j^0 <= 1 + i^0
1.44/1.50	Invariant at l11: 1 + n^0 <= i^0 + scale^0
1.44/1.50	Invariant at l14: j^0 <= 1 + i^0
1.44/1.50	
1.44/1.50	Strengthening and disabling transitions...
1.44/1.50	> It's unfeasible. Removing transition: 
1.44/1.50	<l6, l11, 1 + n^0 <= i^0 /\ 1 + scale^0 <= 0, {all remain the same}>
1.44/1.50	
1.44/1.50	LOG: CALL solverLinear in Graph for feasibility
1.44/1.50	
1.44/1.50	LOG: RETURN solveLinear in Graph for feasibility
1.44/1.50	Strengthening transition (result): 
1.44/1.50	<l6, l11, 1 + n^0 <= i^0 /\ 1 <= scale^0, {all remain the same}>
1.44/1.50	
1.44/1.50	LOG: CALL solverLinear in Graph for feasibility
1.44/1.50	
1.44/1.50	LOG: RETURN solveLinear in Graph for feasibility
1.44/1.50	Strengthening transition (result): 
1.44/1.50	<l6, l6, 1 + n^0 <= i^0 /\ 2 + k^0 <= n^0 /\ scale^0 = 0, {k^0 -> 1 + k^0, scale^0 -> 0, rest remain the same}>
1.44/1.50	
1.44/1.50	LOG: CALL solverLinear in Graph for feasibility
1.44/1.50	
1.44/1.50	LOG: RETURN solveLinear in Graph for feasibility
1.44/1.50	Strengthening transition (result): 
1.44/1.50	<l6, l6, i^0 <= n^0 /\ scale^0 <= undef660 /\ 0 <= scale^0, {i^0 -> 1 + i^0, scale^0 -> undef660, rest remain the same}>
1.44/1.50	
1.44/1.50	LOG: CALL solverLinear in Graph for feasibility
1.44/1.50	
1.44/1.50	LOG: RETURN solveLinear in Graph for feasibility
1.44/1.50	Strengthening transition (result): 
1.44/1.50	<l6, l6, 1 + undef660 <= scale^0 /\ i^0 <= n^0 /\ 0 <= scale^0, {i^0 -> 1 + i^0, rest remain the same}>
1.44/1.50	
1.44/1.50	LOG: CALL solverLinear in Graph for feasibility
1.44/1.50	
1.44/1.50	LOG: RETURN solveLinear in Graph for feasibility
1.44/1.50	Strengthening transition (result): 
1.44/1.50	<l10, l6, 1 + n^0 <= i^0 /\ n^0 <= j^0 /\ j^0 <= 1 + i^0 /\ 2 + k^0 <= n^0, {j^0 -> 1 + j^0, k^0 -> 1 + k^0, scale^0 -> 0, rest remain the same}>
1.44/1.50	
1.44/1.50	LOG: CALL solverLinear in Graph for feasibility
1.44/1.50	
1.44/1.50	LOG: RETURN solveLinear in Graph for feasibility
1.44/1.50	Strengthening transition (result): 
1.44/1.50	<l10, l14, 1 + n^0 <= i^0 /\ 1 + j^0 <= n^0 /\ j^0 <= 1 + i^0, {j^0 -> 1 + j^0, rest remain the same}>
1.44/1.50	
1.44/1.50	LOG: CALL solverLinear in Graph for feasibility
1.44/1.50	
1.44/1.50	LOG: RETURN solveLinear in Graph for feasibility
1.44/1.50	Strengthening transition (result): 
1.44/1.50	<l10, l10, i^0 <= n^0 /\ j^0 <= 1 + i^0, {i^0 -> 1 + i^0, rest remain the same}>
1.44/1.50	
1.44/1.50	LOG: CALL solverLinear in Graph for feasibility
1.44/1.50	
1.44/1.50	LOG: RETURN solveLinear in Graph for feasibility
1.44/1.50	Strengthening transition (result): 
1.44/1.50	<l11, l17, 1 + n^0 <= i^0 /\ 1 + n^0 <= i^0 + scale^0, {all remain the same}>
1.44/1.50	
1.44/1.50	LOG: CALL solverLinear in Graph for feasibility
1.44/1.50	
1.44/1.50	LOG: RETURN solveLinear in Graph for feasibility
1.44/1.50	Strengthening transition (result): 
1.44/1.50	<l11, l11, 1 + n^0 <= i^0 + scale^0 /\ i^0 <= n^0, {i^0 -> 1 + i^0, rest remain the same}>
1.44/1.50	
1.44/1.50	LOG: CALL solverLinear in Graph for feasibility
1.44/1.50	
1.44/1.50	LOG: RETURN solveLinear in Graph for feasibility
1.44/1.50	Strengthening transition (result): 
1.44/1.50	<l14, l10, 1 + n^0 <= i^0 /\ j^0 <= 1 + i^0, {all remain the same}>
1.44/1.50	
1.44/1.50	LOG: CALL solverLinear in Graph for feasibility
1.44/1.50	
1.44/1.50	LOG: RETURN solveLinear in Graph for feasibility
1.44/1.50	Strengthening transition (result): 
1.44/1.50	<l14, l14, i^0 <= n^0 /\ j^0 <= 1 + i^0, {i^0 -> 1 + i^0, sum^0 -> undef172, rest remain the same}>
1.44/1.50	
1.44/1.50	LOG: CALL solverLinear in Graph for feasibility
1.44/1.50	
1.44/1.50	LOG: RETURN solveLinear in Graph for feasibility
1.44/1.50	
1.44/1.50	LOG: CALL solverLinear in Graph for feasibility
1.44/1.50	
1.44/1.50	LOG: RETURN solveLinear in Graph for feasibility
1.44/1.50	
1.44/1.50	LOG: CALL solverLinear in Graph for feasibility
1.44/1.50	
1.44/1.50	LOG: RETURN solveLinear in Graph for feasibility
1.44/1.50	
1.44/1.50	LOG: CALL solverLinear in Graph for feasibility
1.44/1.50	
1.44/1.50	LOG: RETURN solveLinear in Graph for feasibility
1.44/1.50	Checking unfeasibility...
1.44/1.50	Time used: 0.12317
1.44/1.50	Some transition disabled by a set of invariant(s):
1.44/1.50	Invariant at l6: 1 + k^0 <= n^0
1.44/1.50	Invariant at l10: 1 + n^0 <= i^0
1.44/1.50	Invariant at l11: 1 + k^0 <= n^0
1.44/1.50	Invariant at l17: 1 + k^0 <= n^0
1.44/1.50	
1.44/1.50	Strengthening and disabling transitions...
1.44/1.50	> It's unfeasible. Removing transition: 
1.44/1.50	<l10, l10, i^0 <= n^0 /\ j^0 <= 1 + i^0, {i^0 -> 1 + i^0, rest remain the same}>
1.44/1.50	
1.44/1.50	LOG: CALL solverLinear in Graph for feasibility
1.44/1.50	
1.44/1.50	LOG: RETURN solveLinear in Graph for feasibility
1.44/1.50	Strengthening transition (result): 
1.44/1.50	<l6, l11, 1 + n^0 <= i^0 /\ 1 + k^0 <= n^0 /\ 1 <= scale^0, {all remain the same}>
1.44/1.50	
1.44/1.50	LOG: CALL solverLinear in Graph for feasibility
1.44/1.50	
1.44/1.50	LOG: RETURN solveLinear in Graph for feasibility
1.44/1.50	Strengthening transition (result): 
1.44/1.50	<l6, l6, 1 + n^0 <= i^0 /\ 2 + k^0 <= n^0 /\ scale^0 = 0, {k^0 -> 1 + k^0, scale^0 -> 0, rest remain the same}>
1.44/1.50	
1.44/1.50	LOG: CALL solverLinear in Graph for feasibility
1.44/1.50	
1.44/1.50	LOG: RETURN solveLinear in Graph for feasibility
1.44/1.50	Strengthening transition (result): 
1.44/1.50	<l6, l6, 1 + k^0 <= n^0 /\ i^0 <= n^0 /\ scale^0 <= undef660 /\ 0 <= scale^0, {i^0 -> 1 + i^0, scale^0 -> undef660, rest remain the same}>
1.44/1.50	
1.44/1.50	LOG: CALL solverLinear in Graph for feasibility
1.44/1.50	
1.44/1.50	LOG: RETURN solveLinear in Graph for feasibility
1.44/1.50	Strengthening transition (result): 
1.44/1.50	<l6, l6, 1 + k^0 <= n^0 /\ 1 + undef660 <= scale^0 /\ i^0 <= n^0 /\ 0 <= scale^0, {i^0 -> 1 + i^0, rest remain the same}>
1.44/1.50	
1.44/1.50	LOG: CALL solverLinear in Graph for feasibility
1.44/1.50	
1.44/1.50	LOG: RETURN solveLinear in Graph for feasibility
1.44/1.50	Strengthening transition (result): 
1.44/1.50	<l10, l6, 1 + n^0 <= i^0 /\ n^0 <= j^0 /\ j^0 <= 1 + i^0 /\ 2 + k^0 <= n^0, {j^0 -> 1 + j^0, k^0 -> 1 + k^0, scale^0 -> 0, rest remain the same}>
1.44/1.50	
1.44/1.50	LOG: CALL solverLinear in Graph for feasibility
1.44/1.50	
1.44/1.50	LOG: RETURN solveLinear in Graph for feasibility
1.44/1.50	Strengthening transition (result): 
1.44/1.50	<l10, l14, 1 + n^0 <= i^0 /\ 1 + j^0 <= n^0 /\ j^0 <= 1 + i^0, {j^0 -> 1 + j^0, rest remain the same}>
1.44/1.50	
1.44/1.50	LOG: CALL solverLinear in Graph for feasibility
1.44/1.50	
1.44/1.50	LOG: RETURN solveLinear in Graph for feasibility
1.44/1.50	Strengthening transition (result): 
1.44/1.50	<l11, l17, 1 + n^0 <= i^0 /\ 1 + n^0 <= i^0 + scale^0 /\ 1 + k^0 <= n^0, {all remain the same}>
1.44/1.50	
1.44/1.50	LOG: CALL solverLinear in Graph for feasibility
1.44/1.50	
1.44/1.50	LOG: RETURN solveLinear in Graph for feasibility
1.44/1.50	Strengthening transition (result): 
1.44/1.50	<l11, l11, 1 + n^0 <= i^0 + scale^0 /\ 1 + k^0 <= n^0 /\ i^0 <= n^0, {i^0 -> 1 + i^0, rest remain the same}>
1.44/1.50	
1.44/1.50	LOG: CALL solverLinear in Graph for feasibility
1.44/1.50	
1.44/1.50	LOG: RETURN solveLinear in Graph for feasibility
1.44/1.50	
1.44/1.50	LOG: CALL solverLinear in Graph for feasibility
1.44/1.50	
1.44/1.50	LOG: RETURN solveLinear in Graph for feasibility
1.44/1.50	Strengthening transition (result): 
1.44/1.50	<l17, l6, 1 + n^0 <= i^0 /\ 1 + n^0 <= j^0 /\ 2 + k^0 <= n^0, {k^0 -> 1 + k^0, scale^0 -> 0, rest remain the same}>
1.44/1.50	
1.44/1.50	LOG: CALL solverLinear in Graph for feasibility
1.44/1.50	
1.44/1.50	LOG: RETURN solveLinear in Graph for feasibility
1.44/1.50	Strengthening transition (result): 
1.44/1.50	<l17, l14, 1 + n^0 <= i^0 /\ 1 + k^0 <= n^0 /\ j^0 <= n^0, {all remain the same}>
1.44/1.50	
1.44/1.50	LOG: CALL solverLinear in Graph for feasibility
1.44/1.50	
1.44/1.50	LOG: RETURN solveLinear in Graph for feasibility
1.44/1.50	Strengthening transition (result): 
1.44/1.50	<l17, l6, 1 + n^0 <= i^0 /\ 1 + n^0 <= j^0 /\ 2 + k^0 <= n^0, {k^0 -> 1 + k^0, scale^0 -> 0, rest remain the same}>
1.44/1.50	
1.44/1.50	LOG: CALL solverLinear in Graph for feasibility
1.44/1.50	
1.44/1.50	LOG: RETURN solveLinear in Graph for feasibility
1.44/1.50	Strengthening transition (result): 
1.44/1.50	<l17, l14, 1 + n^0 <= i^0 /\ 1 + k^0 <= n^0 /\ j^0 <= n^0, {all remain the same}>
1.44/1.50	
1.44/1.50	LOG: CALL solverLinear in Graph for feasibility
1.44/1.50	
1.44/1.50	LOG: RETURN solveLinear in Graph for feasibility
1.44/1.50	Strengthening transition (result): 
1.44/1.50	<l17, l17, 1 + k^0 <= n^0 /\ 1 <= undef423 /\ i^0 <= n^0, {i^0 -> 1 + i^0, sum^0 -> sum^0 + undef302, rest remain the same}>
1.44/1.50	
1.44/1.50	LOG: CALL solverLinear in Graph for feasibility
1.44/1.50	
1.44/1.50	LOG: RETURN solveLinear in Graph for feasibility
1.44/1.50	Strengthening transition (result): 
1.44/1.50	<l17, l17, 1 + k^0 <= n^0 /\ 1 + undef423 <= 0 /\ i^0 <= n^0, {i^0 -> 1 + i^0, sum^0 -> sum^0 + undef302, rest remain the same}>
1.44/1.50	
1.44/1.50	LOG: CALL solverLinear in Graph for feasibility
1.44/1.50	
1.44/1.50	LOG: RETURN solveLinear in Graph for feasibility
1.44/1.50	Strengthening transition (result): 
1.44/1.50	<l17, l17, 1 + k^0 <= n^0 /\ i^0 <= n^0 /\ undef423 = 0, {i^0 -> 1 + i^0, rest remain the same}>
1.44/1.50	Checking unfeasibility...
1.44/1.50	Time used: 0.177135
1.44/1.50	Some transition disabled by a set of invariant(s):
1.44/1.50	Invariant at l6: 1 + k^0 <= n^0
1.44/1.50	Invariant at l10: 1 + n^0 <= i^0
1.44/1.50	Invariant at l11: 1 + k^0 <= n^0
1.44/1.50	Invariant at l14: 1 + n^0 <= i^0
1.44/1.50	
1.44/1.50	Strengthening and disabling transitions...
1.44/1.50	> It's unfeasible. Removing transition: 
1.44/1.50	<l14, l14, i^0 <= n^0 /\ j^0 <= 1 + i^0, {i^0 -> 1 + i^0, sum^0 -> undef172, rest remain the same}>
1.44/1.50	
1.44/1.50	LOG: CALL solverLinear in Graph for feasibility
1.44/1.50	
1.44/1.50	LOG: RETURN solveLinear in Graph for feasibility
1.44/1.50	Strengthening transition (result): 
1.44/1.50	<l6, l11, 1 + n^0 <= i^0 /\ 1 + k^0 <= n^0 /\ 1 <= scale^0, {all remain the same}>
1.44/1.50	
1.44/1.50	LOG: CALL solverLinear in Graph for feasibility
1.44/1.50	
1.44/1.50	LOG: RETURN solveLinear in Graph for feasibility
1.44/1.50	Strengthening transition (result): 
1.44/1.50	<l6, l6, 1 + n^0 <= i^0 /\ 2 + k^0 <= n^0 /\ scale^0 = 0, {k^0 -> 1 + k^0, scale^0 -> 0, rest remain the same}>
1.44/1.50	
1.44/1.50	LOG: CALL solverLinear in Graph for feasibility
1.44/1.50	
1.44/1.50	LOG: RETURN solveLinear in Graph for feasibility
1.44/1.50	Strengthening transition (result): 
1.44/1.50	<l6, l6, 1 + k^0 <= n^0 /\ i^0 <= n^0 /\ scale^0 <= undef660 /\ 0 <= scale^0, {i^0 -> 1 + i^0, scale^0 -> undef660, rest remain the same}>
1.44/1.50	
1.44/1.50	LOG: CALL solverLinear in Graph for feasibility
1.44/1.50	
1.44/1.50	LOG: RETURN solveLinear in Graph for feasibility
1.44/1.50	Strengthening transition (result): 
1.44/1.50	<l6, l6, 1 + k^0 <= n^0 /\ 1 + undef660 <= scale^0 /\ i^0 <= n^0 /\ 0 <= scale^0, {i^0 -> 1 + i^0, rest remain the same}>
1.44/1.50	
1.44/1.50	LOG: CALL solverLinear in Graph for feasibility
1.44/1.50	
1.44/1.50	LOG: RETURN solveLinear in Graph for feasibility
1.44/1.50	Strengthening transition (result): 
1.44/1.50	<l10, l6, 1 + n^0 <= i^0 /\ n^0 <= j^0 /\ j^0 <= 1 + i^0 /\ 2 + k^0 <= n^0, {j^0 -> 1 + j^0, k^0 -> 1 + k^0, scale^0 -> 0, rest remain the same}>
1.44/1.50	
1.44/1.50	LOG: CALL solverLinear in Graph for feasibility
1.44/1.50	
1.44/1.50	LOG: RETURN solveLinear in Graph for feasibility
1.44/1.50	Strengthening transition (result): 
1.44/1.50	<l10, l14, 1 + n^0 <= i^0 /\ 1 + j^0 <= n^0 /\ j^0 <= 1 + i^0, {j^0 -> 1 + j^0, rest remain the same}>
1.44/1.50	
1.44/1.50	LOG: CALL solverLinear in Graph for feasibility
1.44/1.50	
1.44/1.50	LOG: RETURN solveLinear in Graph for feasibility
1.44/1.50	Strengthening transition (result): 
1.44/1.50	<l11, l17, 1 + n^0 <= i^0 /\ 1 + n^0 <= i^0 + scale^0 /\ 1 + k^0 <= n^0, {all remain the same}>
1.44/1.50	
1.44/1.50	LOG: CALL solverLinear in Graph for feasibility
1.44/1.50	
1.44/1.50	LOG: RETURN solveLinear in Graph for feasibility
1.44/1.50	Strengthening transition (result): 
1.44/1.50	<l11, l11, 1 + n^0 <= i^0 + scale^0 /\ 1 + k^0 <= n^0 /\ i^0 <= n^0, {i^0 -> 1 + i^0, rest remain the same}>
1.44/1.50	
1.44/1.50	LOG: CALL solverLinear in Graph for feasibility
1.44/1.50	
1.44/1.50	LOG: RETURN solveLinear in Graph for feasibility
1.44/1.50	Strengthening transition (result): 
1.44/1.50	<l14, l10, 1 + n^0 <= i^0 /\ j^0 <= 1 + i^0, {all remain the same}>
1.44/1.50	
1.44/1.50	LOG: CALL solverLinear in Graph for feasibility
1.44/1.50	
1.44/1.50	LOG: RETURN solveLinear in Graph for feasibility
1.44/1.50	
1.44/1.50	LOG: CALL solverLinear in Graph for feasibility
1.44/1.50	
1.44/1.50	LOG: RETURN solveLinear in Graph for feasibility
1.44/1.50	
1.44/1.50	LOG: CALL solverLinear in Graph for feasibility
1.44/1.50	
1.44/1.50	LOG: RETURN solveLinear in Graph for feasibility
1.44/1.50	
1.44/1.50	LOG: CALL solverLinear in Graph for feasibility
1.44/1.50	
1.44/1.50	LOG: RETURN solveLinear in Graph for feasibility
1.44/1.50	Checking unfeasibility...
1.44/1.50	Time used: 0.177756
1.44/1.50	Some transition disabled by a set of invariant(s):
1.44/1.50	Invariant at l6: k^0 <= n^0 + scale^0
1.44/1.50	Invariant at l10: k^0 <= 1 + n^0
1.44/1.50	Invariant at l11: 1 + n^0 <= i^0
1.44/1.50	Invariant at l14: k^0 <= 1 + n^0
1.44/1.50	Invariant at l17: k^0 <= i^0
1.44/1.50	
1.44/1.50	Strengthening and disabling transitions...
1.44/1.50	> It's unfeasible. Removing transition: 
1.44/1.50	<l11, l11, 1 + n^0 <= i^0 + scale^0 /\ 1 + k^0 <= n^0 /\ i^0 <= n^0, {i^0 -> 1 + i^0, rest remain the same}>
1.44/1.50	
1.44/1.50	LOG: CALL solverLinear in Graph for feasibility
1.44/1.50	
1.44/1.50	LOG: RETURN solveLinear in Graph for feasibility
1.44/1.50	Strengthening transition (result): 
1.44/1.50	<l6, l11, 1 + n^0 <= i^0 /\ 1 + k^0 <= n^0 /\ 1 <= scale^0 /\ k^0 <= n^0 + scale^0, {all remain the same}>
1.44/1.50	
1.44/1.50	LOG: CALL solverLinear in Graph for feasibility
1.44/1.50	
1.44/1.50	LOG: RETURN solveLinear in Graph for feasibility
1.44/1.50	Strengthening transition (result): 
1.44/1.50	<l6, l6, 1 + n^0 <= i^0 /\ k^0 <= n^0 + scale^0 /\ 2 + k^0 <= n^0 /\ scale^0 = 0, {k^0 -> 1 + k^0, scale^0 -> 0, rest remain the same}>
1.44/1.50	
1.44/1.50	LOG: CALL solverLinear in Graph for feasibility
1.44/1.50	
1.44/1.50	LOG: RETURN solveLinear in Graph for feasibility
1.44/1.50	Strengthening transition (result): 
1.44/1.50	<l6, l6, 1 + k^0 <= n^0 /\ i^0 <= n^0 /\ k^0 <= n^0 + scale^0 /\ scale^0 <= undef660 /\ 0 <= scale^0, {i^0 -> 1 + i^0, scale^0 -> undef660, rest remain the same}>
1.44/1.50	
1.44/1.50	LOG: CALL solverLinear in Graph for feasibility
1.44/1.50	
1.44/1.50	LOG: RETURN solveLinear in Graph for feasibility
1.44/1.50	Strengthening transition (result): 
1.44/1.50	<l6, l6, 1 + k^0 <= n^0 /\ 1 + undef660 <= scale^0 /\ i^0 <= n^0 /\ k^0 <= n^0 + scale^0 /\ 0 <= scale^0, {i^0 -> 1 + i^0, rest remain the same}>
1.44/1.50	
1.44/1.50	LOG: CALL solverLinear in Graph for feasibility
1.44/1.50	
1.44/1.50	LOG: RETURN solveLinear in Graph for feasibility
1.44/1.50	Strengthening transition (result): 
1.44/1.50	<l10, l6, 1 + n^0 <= i^0 /\ n^0 <= j^0 /\ j^0 <= 1 + i^0 /\ 2 + k^0 <= n^0, {j^0 -> 1 + j^0, k^0 -> 1 + k^0, scale^0 -> 0, rest remain the same}>
1.44/1.50	
1.44/1.50	LOG: CALL solverLinear in Graph for feasibility
1.44/1.50	
1.44/1.50	LOG: RETURN solveLinear in Graph for feasibility
1.44/1.50	Strengthening transition (result): 
1.44/1.50	<l10, l14, 1 + n^0 <= i^0 /\ 1 + j^0 <= n^0 /\ j^0 <= 1 + i^0 /\ k^0 <= 1 + n^0, {j^0 -> 1 + j^0, rest remain the same}>
1.44/1.50	
1.44/1.50	LOG: CALL solverLinear in Graph for feasibility
1.44/1.50	
1.44/1.50	LOG: RETURN solveLinear in Graph for feasibility
1.44/1.50	Strengthening transition (result): 
1.44/1.50	<l11, l17, 1 + n^0 <= i^0 /\ 1 + n^0 <= i^0 + scale^0 /\ 1 + k^0 <= n^0, {all remain the same}>
1.44/1.50	
1.44/1.50	LOG: CALL solverLinear in Graph for feasibility
1.44/1.50	
1.44/1.50	LOG: RETURN solveLinear in Graph for feasibility
1.44/1.50	Strengthening transition (result): 
1.44/1.50	<l14, l10, 1 + n^0 <= i^0 /\ j^0 <= 1 + i^0 /\ k^0 <= 1 + n^0, {all remain the same}>
1.44/1.50	
1.44/1.50	LOG: CALL solverLinear in Graph for feasibility
1.44/1.50	
1.44/1.50	LOG: RETURN solveLinear in Graph for feasibility
1.44/1.50	Strengthening transition (result): 
1.44/1.50	<l17, l6, 1 + n^0 <= i^0 /\ 1 + n^0 <= j^0 /\ k^0 <= i^0 /\ 2 + k^0 <= n^0, {k^0 -> 1 + k^0, scale^0 -> 0, rest remain the same}>
1.44/1.50	
1.44/1.50	LOG: CALL solverLinear in Graph for feasibility
1.44/1.50	
1.44/1.50	LOG: RETURN solveLinear in Graph for feasibility
1.44/1.50	Strengthening transition (result): 
1.44/1.50	<l17, l14, 1 + n^0 <= i^0 /\ 1 + k^0 <= n^0 /\ k^0 <= i^0 /\ j^0 <= n^0, {all remain the same}>
1.44/1.50	
1.44/1.50	LOG: CALL solverLinear in Graph for feasibility
1.44/1.50	
1.44/1.50	LOG: RETURN solveLinear in Graph for feasibility
1.44/1.50	Strengthening transition (result): 
1.44/1.50	<l17, l6, 1 + n^0 <= i^0 /\ 1 + n^0 <= j^0 /\ k^0 <= i^0 /\ 2 + k^0 <= n^0, {k^0 -> 1 + k^0, scale^0 -> 0, rest remain the same}>
1.44/1.50	
1.44/1.50	LOG: CALL solverLinear in Graph for feasibility
1.44/1.50	
1.44/1.50	LOG: RETURN solveLinear in Graph for feasibility
1.44/1.50	Strengthening transition (result): 
1.44/1.50	<l17, l14, 1 + n^0 <= i^0 /\ 1 + k^0 <= n^0 /\ k^0 <= i^0 /\ j^0 <= n^0, {all remain the same}>
1.44/1.50	
1.44/1.50	LOG: CALL solverLinear in Graph for feasibility
1.44/1.50	
1.44/1.50	LOG: RETURN solveLinear in Graph for feasibility
1.44/1.50	Strengthening transition (result): 
1.44/1.50	<l17, l17, 1 + k^0 <= n^0 /\ 1 <= undef423 /\ i^0 <= n^0 /\ k^0 <= i^0, {i^0 -> 1 + i^0, sum^0 -> sum^0 + undef302, rest remain the same}>
1.44/1.51	
1.44/1.51	LOG: CALL solverLinear in Graph for feasibility
1.44/1.51	
1.44/1.51	LOG: RETURN solveLinear in Graph for feasibility
1.44/1.51	Strengthening transition (result): 
1.44/1.51	<l17, l17, 1 + k^0 <= n^0 /\ 1 + undef423 <= 0 /\ i^0 <= n^0 /\ k^0 <= i^0, {i^0 -> 1 + i^0, sum^0 -> sum^0 + undef302, rest remain the same}>
1.44/1.51	
1.44/1.51	LOG: CALL solverLinear in Graph for feasibility
1.44/1.51	
1.44/1.51	LOG: RETURN solveLinear in Graph for feasibility
1.44/1.51	Strengthening transition (result): 
1.44/1.51	<l17, l17, 1 + k^0 <= n^0 /\ i^0 <= n^0 /\ k^0 <= i^0 /\ undef423 = 0, {i^0 -> 1 + i^0, rest remain the same}>
1.44/1.51	Checking unfeasibility...
1.44/1.51	Time used: 0.166183
1.44/1.51	Some transition disabled by a set of invariant(s):
1.44/1.51	Invariant at l6: 1 + k^0 <= n^0 + scale^0
1.44/1.51	Invariant at l10: k^0 <= 1 + i^0
1.44/1.51	Invariant at l11: k^0 <= i^0
1.44/1.51	Invariant at l17: 1 + n^0 <= i^0
1.44/1.51	
1.44/1.51	Strengthening and disabling transitions...
1.44/1.51	> It's unfeasible. Removing transition: 
1.44/1.51	<l17, l17, 1 + k^0 <= n^0 /\ i^0 <= n^0 /\ k^0 <= i^0 /\ undef423 = 0, {i^0 -> 1 + i^0, rest remain the same}>
1.44/1.51	
1.44/1.51	LOG: CALL solverLinear in Graph for feasibility
1.44/1.51	
1.44/1.51	LOG: RETURN solveLinear in Graph for feasibility
1.44/1.51	Strengthening transition (result): 
1.44/1.51	<l6, l11, 1 + n^0 <= i^0 /\ 1 + k^0 <= n^0 /\ 1 + k^0 <= n^0 + scale^0 /\ 1 <= scale^0, {all remain the same}>
1.44/1.51	
1.44/1.51	LOG: CALL solverLinear in Graph for feasibility
1.44/1.51	
1.44/1.51	LOG: RETURN solveLinear in Graph for feasibility
1.44/1.51	Strengthening transition (result): 
1.44/1.51	<l6, l6, 1 + n^0 <= i^0 /\ 1 + k^0 <= n^0 + scale^0 /\ 2 + k^0 <= n^0 /\ scale^0 = 0, {k^0 -> 1 + k^0, scale^0 -> 0, rest remain the same}>
1.44/1.51	
1.44/1.51	LOG: CALL solverLinear in Graph for feasibility
1.44/1.51	
1.44/1.51	LOG: RETURN solveLinear in Graph for feasibility
1.44/1.51	Strengthening transition (result): 
1.44/1.51	<l6, l6, 1 + k^0 <= n^0 /\ 1 + k^0 <= n^0 + scale^0 /\ i^0 <= n^0 /\ scale^0 <= undef660 /\ 0 <= scale^0, {i^0 -> 1 + i^0, scale^0 -> undef660, rest remain the same}>
1.44/1.51	
1.44/1.51	LOG: CALL solverLinear in Graph for feasibility
1.44/1.51	
1.44/1.51	LOG: RETURN solveLinear in Graph for feasibility
1.44/1.51	Strengthening transition (result): 
1.44/1.51	<l6, l6, 1 + k^0 <= n^0 /\ 1 + k^0 <= n^0 + scale^0 /\ 1 + undef660 <= scale^0 /\ i^0 <= n^0 /\ 0 <= scale^0, {i^0 -> 1 + i^0, rest remain the same}>
1.44/1.51	
1.44/1.51	LOG: CALL solverLinear in Graph for feasibility
1.44/1.51	
1.44/1.51	LOG: RETURN solveLinear in Graph for feasibility
1.44/1.51	Strengthening transition (result): 
1.44/1.51	<l10, l6, 1 + n^0 <= i^0 /\ n^0 <= j^0 /\ j^0 <= 1 + i^0 /\ k^0 <= 1 + i^0 /\ 2 + k^0 <= n^0, {j^0 -> 1 + j^0, k^0 -> 1 + k^0, scale^0 -> 0, rest remain the same}>
1.44/1.51	
1.44/1.51	LOG: CALL solverLinear in Graph for feasibility
1.44/1.51	
1.44/1.51	LOG: RETURN solveLinear in Graph for feasibility
1.44/1.51	Strengthening transition (result): 
1.44/1.51	<l10, l14, 1 + n^0 <= i^0 /\ 1 + j^0 <= n^0 /\ j^0 <= 1 + i^0 /\ k^0 <= 1 + i^0 /\ k^0 <= 1 + n^0, {j^0 -> 1 + j^0, rest remain the same}>
1.44/1.51	
1.44/1.51	LOG: CALL solverLinear in Graph for feasibility
1.44/1.51	
1.44/1.51	LOG: RETURN solveLinear in Graph for feasibility
1.44/1.51	Strengthening transition (result): 
1.44/1.51	<l11, l17, 1 + n^0 <= i^0 /\ 1 + n^0 <= i^0 + scale^0 /\ 1 + k^0 <= n^0 /\ k^0 <= i^0, {all remain the same}>
1.44/1.51	
1.44/1.51	LOG: CALL solverLinear in Graph for feasibility
1.44/1.51	
1.44/1.51	LOG: RETURN solveLinear in Graph for feasibility
1.44/1.51	
1.44/1.51	LOG: CALL solverLinear in Graph for feasibility
1.44/1.51	
1.44/1.51	LOG: RETURN solveLinear in Graph for feasibility
1.44/1.51	Strengthening transition (result): 
1.44/1.51	<l17, l6, 1 + n^0 <= i^0 /\ 1 + n^0 <= j^0 /\ k^0 <= i^0 /\ 2 + k^0 <= n^0, {k^0 -> 1 + k^0, scale^0 -> 0, rest remain the same}>
1.44/1.51	
1.44/1.51	LOG: CALL solverLinear in Graph for feasibility
1.44/1.51	
1.44/1.51	LOG: RETURN solveLinear in Graph for feasibility
1.44/1.51	Strengthening transition (result): 
1.44/1.51	<l17, l14, 1 + n^0 <= i^0 /\ 1 + k^0 <= n^0 /\ k^0 <= i^0 /\ j^0 <= n^0, {all remain the same}>
1.44/1.51	
1.44/1.51	LOG: CALL solverLinear in Graph for feasibility
1.44/1.51	
1.44/1.51	LOG: RETURN solveLinear in Graph for feasibility
1.44/1.51	Strengthening transition (result): 
1.44/1.51	<l17, l6, 1 + n^0 <= i^0 /\ 1 + n^0 <= j^0 /\ k^0 <= i^0 /\ 2 + k^0 <= n^0, {k^0 -> 1 + k^0, scale^0 -> 0, rest remain the same}>
1.44/1.51	
1.44/1.51	LOG: CALL solverLinear in Graph for feasibility
1.44/1.51	
1.44/1.51	LOG: RETURN solveLinear in Graph for feasibility
1.44/1.51	Strengthening transition (result): 
1.44/1.51	<l17, l14, 1 + n^0 <= i^0 /\ 1 + k^0 <= n^0 /\ k^0 <= i^0 /\ j^0 <= n^0, {all remain the same}>
1.44/1.51	
1.44/1.51	LOG: CALL solverLinear in Graph for feasibility
1.44/1.51	
1.44/1.51	LOG: RETURN solveLinear in Graph for feasibility
1.44/1.51	It's unfeasible. Removing transition: 
1.44/1.51	<l17, l17, 1 + k^0 <= n^0 /\ 1 <= undef423 /\ i^0 <= n^0 /\ k^0 <= i^0, {i^0 -> 1 + i^0, sum^0 -> sum^0 + undef302, rest remain the same}>
1.44/1.51	
1.44/1.51	LOG: CALL solverLinear in Graph for feasibility
1.44/1.51	
1.44/1.51	LOG: RETURN solveLinear in Graph for feasibility
1.44/1.51	It's unfeasible. Removing transition: 
1.44/1.51	<l17, l17, 1 + k^0 <= n^0 /\ 1 + undef423 <= 0 /\ i^0 <= n^0 /\ k^0 <= i^0, {i^0 -> 1 + i^0, sum^0 -> sum^0 + undef302, rest remain the same}>
1.44/1.51	Checking unfeasibility...
1.44/1.51	Time used: 0.29387
1.44/1.51	
1.44/1.51	Checking conditional termination of SCC {l6, l10, l11, l14, l17}...
1.44/1.51	
1.44/1.51	LOG: CALL solveLinear
1.44/1.51	
1.44/1.51	LOG: RETURN solveLinear - Elapsed time: 0.015399s
1.44/1.51	Ranking function: -i^0 + n^0
1.44/1.51	New Graphs: 
1.44/1.51	Transitions:
1.44/1.51	<l6, l6, 1 + n^0 <= i^0 /\ 1 + n^0 <= i^0 + scale^0 /\ 1 + n^0 <= j^0 /\ 1 + k^0 <= n^0 + scale^0 /\ 1 <= scale^0 /\ k^0 <= i^0 /\ 2 + k^0 <= n^0, {k^0 -> 1 + k^0, scale^0 -> 0, rest remain the same}>
1.44/1.51	<l6, l14, 1 + n^0 <= i^0 /\ 1 + n^0 <= i^0 + scale^0 /\ 1 + k^0 <= n^0 /\ 1 + k^0 <= n^0 + scale^0 /\ 1 <= scale^0 /\ k^0 <= i^0 /\ j^0 <= n^0, {all remain the same}>
1.44/1.51	<l6, l6, 1 + n^0 <= i^0 /\ 1 + n^0 <= i^0 + scale^0 /\ 1 + n^0 <= j^0 /\ 1 + k^0 <= n^0 + scale^0 /\ 1 <= scale^0 /\ k^0 <= i^0 /\ 2 + k^0 <= n^0, {k^0 -> 1 + k^0, scale^0 -> 0, rest remain the same}>
1.44/1.51	<l6, l14, 1 + n^0 <= i^0 /\ 1 + n^0 <= i^0 + scale^0 /\ 1 + k^0 <= n^0 /\ 1 + k^0 <= n^0 + scale^0 /\ 1 <= scale^0 /\ k^0 <= i^0 /\ j^0 <= n^0, {all remain the same}>
1.44/1.51	<l6, l6, 1 + n^0 <= i^0 /\ 1 + k^0 <= n^0 + scale^0 /\ 2 + k^0 <= n^0 /\ scale^0 = 0, {k^0 -> 1 + k^0, scale^0 -> 0, rest remain the same}>
1.44/1.51	<l14, l6, 1 + n^0 <= i^0 /\ n^0 <= j^0 /\ j^0 <= 1 + i^0 /\ k^0 <= 1 + i^0 /\ 2 + k^0 <= n^0, {j^0 -> 1 + j^0, k^0 -> 1 + k^0, scale^0 -> 0, rest remain the same}>
1.44/1.51	<l14, l14, 1 + n^0 <= i^0 /\ 1 + j^0 <= n^0 /\ j^0 <= 1 + i^0 /\ k^0 <= 1 + i^0 /\ k^0 <= 1 + n^0, {j^0 -> 1 + j^0, rest remain the same}>
1.44/1.51	Variables:
1.44/1.51	i^0, j^0, k^0, n^0, scale^0
1.44/1.51	Checking conditional termination of SCC {l6, l14}...
1.44/1.51	
1.44/1.51	LOG: CALL solveLinear
1.44/1.51	
1.44/1.51	LOG: RETURN solveLinear - Elapsed time: 0.005832s
1.44/1.51	Ranking function: -2 + 3*i^0 - k^0 - 2*n^0
1.44/1.51	New Graphs: 
1.44/1.51	Transitions:
1.44/1.51	<l14, l14, 1 + n^0 <= i^0 /\ 1 + j^0 <= n^0 /\ j^0 <= 1 + i^0 /\ k^0 <= 1 + i^0 /\ k^0 <= 1 + n^0, {j^0 -> 1 + j^0, rest remain the same}>
1.44/1.51	Variables:
1.44/1.51	i^0, j^0, k^0, n^0
1.44/1.51	Checking conditional termination of SCC {l14}...
1.44/1.51	
1.44/1.51	LOG: CALL solveLinear
1.44/1.51	
1.44/1.51	LOG: RETURN solveLinear - Elapsed time: 0.001825s
1.44/1.51	Ranking function: -1 - j^0 + n^0
1.44/1.51	New Graphs: 
1.44/1.51	Proving termination of subgraph 2
1.44/1.51	Analyzing SCC {l4}...
1.44/1.51	No cycles found.
1.44/1.51	
1.44/1.51	Program Terminates
1.44/1.51	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
1.44/1.51	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
1.44/1.51	EOF