0.00/0.46	YES
0.00/0.46	
0.00/0.46	Solver Timeout: 4
0.00/0.46	Global Timeout: 300
0.00/0.46	No parsing errors!
0.00/0.46	Init Location: 0
0.00/0.46	Transitions:
0.00/0.46	<l0, l33, true>
0.00/0.46	<l1, l2, ((1 + n^0) <= (0 + j^0))>
0.00/0.46	<l1, l3, ((0 + j^0) <= (0 + n^0)) /\ (undef21 = undef21), par{temp^0 -> (0 + undef21), tmp^0 -> undef21}>
0.00/0.46	<l4, l1, true>
0.00/0.46	<l5, l6, true, par{j^0 -> (1 + j^0)}>
0.00/0.46	<l7, l5, ((1 + n^0) <= (0 + i^0))>
0.00/0.46	<l7, l8, ((0 + i^0) <= (0 + n^0)), par{i^0 -> (1 + i^0)}>
0.00/0.46	<l8, l7, true>
0.00/0.46	<l9, l8, (undef79 = undef79), par{dum^0 -> undef79}>
0.00/0.46	<l10, l5, ((0 + j^0) <= (0 + n^0)) /\ ((0 + n^0) <= (0 + j^0))>
0.00/0.46	<l10, l9, ((1 + n^0) <= (0 + j^0))>
0.00/0.46	<l10, l9, ((1 + j^0) <= (0 + n^0))>
0.00/0.46	<l11, l10, true>
0.00/0.46	<l11, l10, true>
0.00/0.46	<l11, l10, true>
0.00/0.46	<l12, l11, true>
0.00/0.46	<l13, l12, ((1 + n^0) <= (0 + k^0))>
0.00/0.46	<l13, l14, ((0 + k^0) <= (0 + n^0)) /\ (undef178 = undef178), par{dum^0 -> undef178, k^0 -> (1 + k^0)}>
0.00/0.46	<l14, l13, true>
0.00/0.46	<l15, l12, ((0 + j^0) <= (0 + imax^0)) /\ ((0 + imax^0) <= (0 + j^0))>
0.00/0.46	<l15, l14, ((1 + imax^0) <= (0 + j^0))>
0.00/0.46	<l15, l14, ((1 + j^0) <= (0 + imax^0))>
0.00/0.46	<l16, l17, true, par{i^0 -> (1 + i^0)}>
0.00/0.46	<l18, l16, ((1 + dum^0) <= (0 + big^0))>
0.00/0.46	<l18, l16, ((0 + big^0) <= (0 + dum^0)), par{big^0 -> (0 + dum^0), imax^0 -> (0 + i^0)}>
0.00/0.46	<l19, l6, ((1 + n^0) <= (0 + i^0))>
0.00/0.46	<l19, l4, ((0 + i^0) <= (0 + n^0)), par{big^0 -> 0}>
0.00/0.46	<l20, l18, ((0 + j^0) <= (0 + k^0)) /\ (undef297 = undef297) /\ (undef288 = undef288), par{dum^0 -> undef288, tmp___0^0 -> undef297}>
0.00/0.46	<l20, l21, ((1 + k^0) <= (0 + j^0)) /\ (undef305 = undef305), par{k^0 -> (1 + k^0), sum^0 -> undef305}>
0.00/0.46	<l21, l20, true>
0.00/0.46	<l22, l15, ((1 + n^0) <= (0 + i^0))>
0.00/0.46	<l22, l21, ((0 + i^0) <= (0 + n^0)) /\ (undef338 = undef338), par{sum^0 -> undef338}>
0.00/0.46	<l23, l19, true>
0.00/0.46	<l17, l22, true>
0.00/0.46	<l24, l25, ((0 + i^0) <= (0 + k^0)), par{i^0 -> (1 + i^0)}>
0.00/0.46	<l24, l26, ((1 + k^0) <= (0 + i^0)) /\ (undef382 = undef382), par{k^0 -> (1 + k^0), sum^0 -> undef382}>
0.00/0.46	<l26, l24, true>
0.00/0.46	<l27, l17, ((0 + j^0) <= (0 + i^0)), par{big^0 -> 0}>
0.00/0.46	<l27, l26, ((1 + i^0) <= (0 + j^0)) /\ (undef415 = undef415), par{sum^0 -> undef415}>
0.00/0.46	<l25, l27, true>
0.00/0.46	<l28, l29, ((1 + n^0) <= (0 + j^0))>
0.00/0.46	<l28, l25, ((0 + j^0) <= (0 + n^0))>
0.00/0.46	<l6, l28, true>
0.00/0.46	<l30, l23, true>
0.00/0.46	<l31, l23, true, par{i^0 -> (1 + i^0)}>
0.00/0.46	<l2, l31, (1 <= (0 + big^0))>
0.00/0.46	<l2, l31, ((1 + big^0) <= 0)>
0.00/0.46	<l2, l31, ((0 + big^0) <= 0) /\ (0 <= (0 + big^0))>
0.00/0.46	<l32, l4, true, par{j^0 -> (1 + j^0)}>
0.00/0.46	<l3, l32, ((0 + temp^0) <= (0 + big^0))>
0.00/0.46	<l3, l32, ((1 + big^0) <= (0 + temp^0)), par{big^0 -> (0 + temp^0)}>
0.00/0.46	<l33, l30, true>
0.00/0.46	
0.00/0.46	Fresh variables:
0.00/0.46	undef21, undef79, undef178, undef288, undef297, undef305, undef338, undef382, undef415, 
0.00/0.46	
0.00/0.46	Undef variables:
0.00/0.46	undef21, undef79, undef178, undef288, undef297, undef305, undef338, undef382, undef415, 
0.00/0.46	
0.00/0.46	Abstraction variables:
0.00/0.46	
0.00/0.46	Exit nodes:
0.00/0.46	
0.00/0.46	Accepting locations:
0.00/0.46	
0.00/0.46	Asserts:
0.00/0.46	
0.00/0.46	Preprocessed LLVMGraph
0.00/0.46	Init Location: 0
0.00/0.46	Transitions:
0.00/0.46	<l0, l29, ((1 + n^0) <= (0 + i^0)) /\ ((1 + n^0) <= (0 + j^0))>
0.00/0.46	<l0, l10, ((1 + n^0) <= (0 + i^0)) /\ ((0 + j^0) <= (0 + n^0)) /\ ((0 + j^0) <= (0 + i^0)) /\ ((1 + n^0) <= (0 + i^0)) /\ ((0 + j^0) <= (0 + imax^0)) /\ ((0 + imax^0) <= (0 + j^0)), par{big^0 -> 0}>
0.00/0.46	<l0, l10, ((1 + n^0) <= (0 + i^0)) /\ ((0 + j^0) <= (0 + n^0)) /\ ((0 + j^0) <= (0 + i^0)) /\ ((1 + n^0) <= (0 + i^0)) /\ ((0 + j^0) <= (0 + imax^0)) /\ ((0 + imax^0) <= (0 + j^0)), par{big^0 -> 0}>
0.00/0.46	<l0, l10, ((1 + n^0) <= (0 + i^0)) /\ ((0 + j^0) <= (0 + n^0)) /\ ((0 + j^0) <= (0 + i^0)) /\ ((1 + n^0) <= (0 + i^0)) /\ ((0 + j^0) <= (0 + imax^0)) /\ ((0 + imax^0) <= (0 + j^0)), par{big^0 -> 0}>
0.00/0.46	<l0, l14, ((1 + n^0) <= (0 + i^0)) /\ ((0 + j^0) <= (0 + n^0)) /\ ((0 + j^0) <= (0 + i^0)) /\ ((1 + n^0) <= (0 + i^0)) /\ ((1 + imax^0) <= (0 + j^0)), par{big^0 -> 0}>
0.00/0.46	<l0, l14, ((1 + n^0) <= (0 + i^0)) /\ ((0 + j^0) <= (0 + n^0)) /\ ((0 + j^0) <= (0 + i^0)) /\ ((1 + n^0) <= (0 + i^0)) /\ ((1 + j^0) <= (0 + imax^0)), par{big^0 -> 0}>
0.00/0.46	<l0, l4, ((0 + i^0) <= (0 + n^0)), par{big^0 -> 0}>
0.00/0.46	<l4, l29, ((1 + n^0) <= (0 + j^0)) /\ (1 <= (0 + big^0)) /\ ((1 + n^0) <= (0 + (1 + i^0))) /\ ((1 + n^0) <= (0 + j^0)), par{i^0 -> (1 + i^0)}>
0.00/0.46	<l4, l4, ((1 + n^0) <= (0 + j^0)) /\ (1 <= (0 + big^0)) /\ ((0 + (1 + i^0)) <= (0 + n^0)), par{big^0 -> 0, i^0 -> (1 + i^0)}>
0.00/0.46	<l4, l29, ((1 + n^0) <= (0 + j^0)) /\ ((1 + big^0) <= 0) /\ ((1 + n^0) <= (0 + (1 + i^0))) /\ ((1 + n^0) <= (0 + j^0)), par{i^0 -> (1 + i^0)}>
0.00/0.46	<l4, l4, ((1 + n^0) <= (0 + j^0)) /\ ((1 + big^0) <= 0) /\ ((0 + (1 + i^0)) <= (0 + n^0)), par{big^0 -> 0, i^0 -> (1 + i^0)}>
0.00/0.46	<l4, l29, ((1 + n^0) <= (0 + j^0)) /\ ((0 + big^0) <= 0) /\ (0 <= (0 + big^0)) /\ ((1 + n^0) <= (0 + (1 + i^0))) /\ ((1 + n^0) <= (0 + j^0)), par{i^0 -> (1 + i^0)}>
0.00/0.46	<l4, l4, ((1 + n^0) <= (0 + j^0)) /\ ((0 + big^0) <= 0) /\ (0 <= (0 + big^0)) /\ ((0 + (1 + i^0)) <= (0 + n^0)), par{big^0 -> 0, i^0 -> (1 + i^0)}>
0.00/0.46	<l4, l4, ((0 + j^0) <= (0 + n^0)) /\ (undef21 = undef21) /\ ((0 + (0 + undef21)) <= (0 + big^0)), par{j^0 -> (1 + j^0)}>
0.00/0.46	<l4, l4, ((0 + j^0) <= (0 + n^0)) /\ (undef21 = undef21) /\ ((1 + big^0) <= (0 + (0 + undef21))), par{big^0 -> (0 + (0 + undef21)), j^0 -> (1 + j^0)}>
0.00/0.46	<l8, l29, ((1 + n^0) <= (0 + i^0)) /\ ((1 + n^0) <= (0 + (1 + j^0))), par{j^0 -> (1 + j^0)}>
0.00/0.46	<l8, l10, ((1 + n^0) <= (0 + i^0)) /\ ((0 + (1 + j^0)) <= (0 + n^0)) /\ ((0 + (1 + j^0)) <= (0 + i^0)) /\ ((1 + n^0) <= (0 + i^0)) /\ ((0 + (1 + j^0)) <= (0 + imax^0)) /\ ((0 + imax^0) <= (0 + (1 + j^0))), par{big^0 -> 0, j^0 -> (1 + j^0)}>
0.00/0.46	<l8, l10, ((1 + n^0) <= (0 + i^0)) /\ ((0 + (1 + j^0)) <= (0 + n^0)) /\ ((0 + (1 + j^0)) <= (0 + i^0)) /\ ((1 + n^0) <= (0 + i^0)) /\ ((0 + (1 + j^0)) <= (0 + imax^0)) /\ ((0 + imax^0) <= (0 + (1 + j^0))), par{big^0 -> 0, j^0 -> (1 + j^0)}>
0.00/0.46	<l8, l10, ((1 + n^0) <= (0 + i^0)) /\ ((0 + (1 + j^0)) <= (0 + n^0)) /\ ((0 + (1 + j^0)) <= (0 + i^0)) /\ ((1 + n^0) <= (0 + i^0)) /\ ((0 + (1 + j^0)) <= (0 + imax^0)) /\ ((0 + imax^0) <= (0 + (1 + j^0))), par{big^0 -> 0, j^0 -> (1 + j^0)}>
0.00/0.46	<l8, l14, ((1 + n^0) <= (0 + i^0)) /\ ((0 + (1 + j^0)) <= (0 + n^0)) /\ ((0 + (1 + j^0)) <= (0 + i^0)) /\ ((1 + n^0) <= (0 + i^0)) /\ ((1 + imax^0) <= (0 + (1 + j^0))), par{big^0 -> 0, j^0 -> (1 + j^0)}>
0.00/0.46	<l8, l14, ((1 + n^0) <= (0 + i^0)) /\ ((0 + (1 + j^0)) <= (0 + n^0)) /\ ((0 + (1 + j^0)) <= (0 + i^0)) /\ ((1 + n^0) <= (0 + i^0)) /\ ((1 + (1 + j^0)) <= (0 + imax^0)), par{big^0 -> 0, j^0 -> (1 + j^0)}>
0.00/0.46	<l8, l8, ((0 + i^0) <= (0 + n^0)), par{i^0 -> (1 + i^0)}>
0.00/0.46	<l10, l29, ((0 + j^0) <= (0 + n^0)) /\ ((0 + n^0) <= (0 + j^0)) /\ ((1 + n^0) <= (0 + (1 + j^0))), par{j^0 -> (1 + j^0)}>
0.00/0.46	<l10, l8, ((1 + n^0) <= (0 + j^0)) /\ (undef79 = undef79)>
0.00/0.46	<l10, l8, ((1 + j^0) <= (0 + n^0)) /\ (undef79 = undef79)>
0.00/0.46	<l14, l10, ((1 + n^0) <= (0 + k^0))>
0.00/0.46	<l14, l10, ((1 + n^0) <= (0 + k^0))>
0.00/0.46	<l14, l10, ((1 + n^0) <= (0 + k^0))>
0.00/0.46	<l14, l14, ((0 + k^0) <= (0 + n^0)) /\ (undef178 = undef178), par{k^0 -> (1 + k^0)}>
0.00/0.46	
0.00/0.46	Fresh variables:
0.00/0.46	undef21, undef79, undef178, undef288, undef297, undef305, undef338, undef382, undef415, 
0.00/0.46	
0.00/0.46	Undef variables:
0.00/0.46	undef21, undef79, undef178, undef288, undef297, undef305, undef338, undef382, undef415, 
0.00/0.46	
0.00/0.46	Abstraction variables:
0.00/0.46	
0.00/0.46	Exit nodes:
0.00/0.46	
0.00/0.46	Accepting locations:
0.00/0.46	
0.00/0.46	Asserts:
0.00/0.46	
0.00/0.46	*************************************************************
0.00/0.46	*******************************************************************************************
0.00/0.46	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
0.00/0.46	*******************************************************************************************
0.00/0.46	
0.00/0.46	Init Location: 0
0.00/0.46	Graph 0:
0.00/0.46	Transitions:
0.00/0.46	Variables:
0.00/0.46	
0.00/0.46	Graph 1:
0.00/0.46	Transitions:
0.00/0.46	<l4, l4, 1 <= big^0 /\ 1 + i^0 <= n^0 /\ 1 + n^0 <= j^0, {big^0 -> 0, i^0 -> 1 + i^0, rest remain the same}>
0.00/0.46	<l4, l4, 1 + big^0 <= 0 /\ 1 + i^0 <= n^0 /\ 1 + n^0 <= j^0, {big^0 -> 0, i^0 -> 1 + i^0, rest remain the same}>
0.00/0.46	<l4, l4, 1 + i^0 <= n^0 /\ 1 + n^0 <= j^0 /\ big^0 = 0, {big^0 -> 0, i^0 -> 1 + i^0, rest remain the same}>
0.00/0.46	<l4, l4, undef21 <= big^0 /\ j^0 <= n^0, {j^0 -> 1 + j^0, rest remain the same}>
0.00/0.46	<l4, l4, 1 + big^0 <= undef21 /\ j^0 <= n^0, {big^0 -> undef21, j^0 -> 1 + j^0, rest remain the same}>
0.00/0.46	Variables:
0.00/0.46	big^0, i^0, j^0, n^0
0.00/0.46	
0.00/0.46	Graph 2:
0.00/0.46	Transitions:
0.00/0.46	<l8, l10, 1 + j^0 <= i^0 /\ 1 + n^0 <= i^0 /\ 1 + j^0 <= n^0 /\ imax^0 = 1 + j^0, {big^0 -> 0, j^0 -> 1 + j^0, rest remain the same}>
0.00/0.46	<l8, l10, 1 + j^0 <= i^0 /\ 1 + n^0 <= i^0 /\ 1 + j^0 <= n^0 /\ imax^0 = 1 + j^0, {big^0 -> 0, j^0 -> 1 + j^0, rest remain the same}>
0.00/0.46	<l8, l10, 1 + j^0 <= i^0 /\ 1 + n^0 <= i^0 /\ 1 + j^0 <= n^0 /\ imax^0 = 1 + j^0, {big^0 -> 0, j^0 -> 1 + j^0, rest remain the same}>
0.00/0.46	<l8, l14, 1 + j^0 <= i^0 /\ 1 + n^0 <= i^0 /\ 1 + j^0 <= n^0 /\ imax^0 <= j^0, {big^0 -> 0, j^0 -> 1 + j^0, rest remain the same}>
0.00/0.46	<l8, l14, 1 + j^0 <= i^0 /\ 1 + n^0 <= i^0 /\ 1 + j^0 <= n^0 /\ 2 + j^0 <= imax^0, {big^0 -> 0, j^0 -> 1 + j^0, rest remain the same}>
0.00/0.46	<l8, l8, i^0 <= n^0, {i^0 -> 1 + i^0, rest remain the same}>
0.00/0.46	<l10, l8, 1 + n^0 <= j^0, {all remain the same}>
0.00/0.46	<l10, l8, 1 + j^0 <= n^0, {all remain the same}>
0.00/0.46	<l14, l10, 1 + n^0 <= k^0, {all remain the same}>
0.00/0.46	<l14, l10, 1 + n^0 <= k^0, {all remain the same}>
0.00/0.46	<l14, l10, 1 + n^0 <= k^0, {all remain the same}>
0.00/0.46	<l14, l14, k^0 <= n^0, {k^0 -> 1 + k^0, rest remain the same}>
0.00/0.46	Variables:
0.00/0.46	i^0, imax^0, j^0, n^0, k^0
0.00/0.46	
0.00/0.46	Graph 3:
0.00/0.46	Transitions:
0.00/0.46	Variables:
0.00/0.46	
0.00/0.46	Precedence: 
0.00/0.46	Graph 0
0.00/0.46	
0.00/0.46	Graph 1
0.00/0.46	<l0, l4, i^0 <= n^0, {big^0 -> 0, rest remain the same}>
0.00/0.46	
0.00/0.46	Graph 2
0.00/0.46	<l0, l10, 1 + n^0 <= i^0 /\ j^0 <= i^0 /\ j^0 <= n^0 /\ imax^0 = j^0, {big^0 -> 0, rest remain the same}>
0.00/0.46	<l0, l10, 1 + n^0 <= i^0 /\ j^0 <= i^0 /\ j^0 <= n^0 /\ imax^0 = j^0, {big^0 -> 0, rest remain the same}>
0.00/0.46	<l0, l10, 1 + n^0 <= i^0 /\ j^0 <= i^0 /\ j^0 <= n^0 /\ imax^0 = j^0, {big^0 -> 0, rest remain the same}>
0.00/0.46	<l0, l14, 1 + n^0 <= i^0 /\ 1 + imax^0 <= j^0 /\ j^0 <= i^0 /\ j^0 <= n^0, {big^0 -> 0, rest remain the same}>
0.00/0.46	<l0, l14, 1 + n^0 <= i^0 /\ 1 + j^0 <= imax^0 /\ j^0 <= i^0 /\ j^0 <= n^0, {big^0 -> 0, rest remain the same}>
0.00/0.46	
0.00/0.46	Graph 3
0.00/0.46	<l0, l29, 1 + n^0 <= i^0 /\ 1 + n^0 <= j^0, {all remain the same}>
0.00/0.46	<l4, l29, 1 <= big^0 /\ 1 + n^0 <= j^0 /\ n^0 <= i^0, {i^0 -> 1 + i^0, rest remain the same}>
0.00/0.46	<l4, l29, 1 + big^0 <= 0 /\ 1 + n^0 <= j^0 /\ n^0 <= i^0, {i^0 -> 1 + i^0, rest remain the same}>
0.00/0.46	<l4, l29, 1 + n^0 <= j^0 /\ n^0 <= i^0 /\ big^0 = 0, {i^0 -> 1 + i^0, rest remain the same}>
0.00/0.46	<l8, l29, 1 + n^0 <= i^0 /\ n^0 <= j^0, {j^0 -> 1 + j^0, rest remain the same}>
0.00/0.46	<l10, l29, j^0 = n^0, {j^0 -> 1 + j^0, rest remain the same}>
0.00/0.46	
0.00/0.46	Map Locations to Subgraph:
0.00/0.46	( 0 , 0 )
0.00/0.46	( 4 , 1 )
0.00/0.46	( 8 , 2 )
0.00/0.46	( 10 , 2 )
0.00/0.46	( 14 , 2 )
0.00/0.46	( 29 , 3 )
0.00/0.46	
0.00/0.46	*******************************************************************************************
0.00/0.46	********************************    CHECKING ASSERTIONS    ********************************
0.00/0.46	*******************************************************************************************
0.00/0.46	
0.00/0.46	Proving termination of subgraph 0
0.00/0.46	Proving termination of subgraph 1
0.00/0.46	Checking unfeasibility...
0.00/0.46	Time used: 0.020079
0.00/0.46	Some transition disabled by a set of invariant(s):
0.00/0.46	Invariant at l4: 0 <= big^0
0.00/0.46	
0.00/0.46	Strengthening and disabling transitions...
0.00/0.46	> It's unfeasible. Removing transition: 
0.00/0.46	<l4, l4, 1 + big^0 <= 0 /\ 1 + i^0 <= n^0 /\ 1 + n^0 <= j^0, {big^0 -> 0, i^0 -> 1 + i^0, rest remain the same}>
0.00/0.46	
0.00/0.46	LOG: CALL solverLinear in Graph for feasibility
0.00/0.46	
0.00/0.46	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.46	Strengthening transition (result): 
0.00/0.46	<l4, l4, 1 <= big^0 /\ 1 + i^0 <= n^0 /\ 1 + n^0 <= j^0, {big^0 -> 0, i^0 -> 1 + i^0, rest remain the same}>
0.00/0.46	
0.00/0.46	LOG: CALL solverLinear in Graph for feasibility
0.00/0.46	
0.00/0.46	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.47	Strengthening transition (result): 
0.00/0.47	<l4, l4, 1 + i^0 <= n^0 /\ 1 + n^0 <= j^0 /\ big^0 = 0, {big^0 -> 0, i^0 -> 1 + i^0, rest remain the same}>
0.00/0.47	
0.00/0.47	LOG: CALL solverLinear in Graph for feasibility
0.00/0.47	
0.00/0.47	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.47	Strengthening transition (result): 
0.00/0.47	<l4, l4, 0 <= big^0 /\ undef21 <= big^0 /\ j^0 <= n^0, {j^0 -> 1 + j^0, rest remain the same}>
0.00/0.47	
0.00/0.47	LOG: CALL solverLinear in Graph for feasibility
0.00/0.47	
0.00/0.47	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.47	Strengthening transition (result): 
0.00/0.47	<l4, l4, 1 + big^0 <= undef21 /\ 0 <= big^0 /\ j^0 <= n^0, {big^0 -> undef21, j^0 -> 1 + j^0, rest remain the same}>
0.00/0.47	Checking unfeasibility...
0.00/0.47	Time used: 0.011372
0.00/0.47	
0.00/0.47	Checking conditional termination of SCC {l4}...
0.00/0.47	
0.00/0.47	LOG: CALL solveLinear
0.00/0.47	
0.00/0.47	LOG: RETURN solveLinear - Elapsed time: 0.003337s
0.00/0.47	Ranking function: -2 - 2*i^0 + 2*n^0
0.00/0.47	New Graphs: 
0.00/0.47	Transitions:
0.00/0.47	<l4, l4, 0 <= big^0 /\ undef21 <= big^0 /\ j^0 <= n^0, {j^0 -> 1 + j^0, rest remain the same}>
0.00/0.47	<l4, l4, 1 + big^0 <= undef21 /\ 0 <= big^0 /\ j^0 <= n^0, {big^0 -> undef21, j^0 -> 1 + j^0, rest remain the same}>
0.00/0.47	Variables:
0.00/0.47	big^0, j^0, n^0
0.00/0.47	Checking conditional termination of SCC {l4}...
0.00/0.47	
0.00/0.47	LOG: CALL solveLinear
0.00/0.47	
0.00/0.47	LOG: RETURN solveLinear - Elapsed time: 0.001631s
0.00/0.47	Ranking function: -j^0 + n^0
0.00/0.47	New Graphs: 
0.00/0.47	Proving termination of subgraph 2
0.00/0.47	Checking unfeasibility...
0.00/0.47	Time used: 0.101722
0.00/0.47	Some transition disabled by a set of invariant(s):
0.00/0.47	Invariant at l8: 1 + j^0 <= n^0
0.00/0.47	Invariant at l10: j^0 <= n^0
0.00/0.47	Invariant at l14: j^0 <= n^0
0.00/0.47	
0.00/0.47	Strengthening and disabling transitions...
0.00/0.47	> It's unfeasible. Removing transition: 
0.00/0.47	<l10, l8, 1 + n^0 <= j^0, {all remain the same}>
0.00/0.47	
0.00/0.47	LOG: CALL solverLinear in Graph for feasibility
0.00/0.47	
0.00/0.47	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.47	Strengthening transition (result): 
0.00/0.47	<l8, l10, 1 + j^0 <= i^0 /\ 1 + n^0 <= i^0 /\ 1 + j^0 <= n^0 /\ imax^0 = 1 + j^0, {big^0 -> 0, j^0 -> 1 + j^0, rest remain the same}>
0.00/0.47	
0.00/0.47	LOG: CALL solverLinear in Graph for feasibility
0.00/0.47	
0.00/0.47	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.47	Strengthening transition (result): 
0.00/0.47	<l8, l10, 1 + j^0 <= i^0 /\ 1 + n^0 <= i^0 /\ 1 + j^0 <= n^0 /\ imax^0 = 1 + j^0, {big^0 -> 0, j^0 -> 1 + j^0, rest remain the same}>
0.00/0.47	
0.00/0.47	LOG: CALL solverLinear in Graph for feasibility
0.00/0.47	
0.00/0.47	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.47	Strengthening transition (result): 
0.00/0.47	<l8, l10, 1 + j^0 <= i^0 /\ 1 + n^0 <= i^0 /\ 1 + j^0 <= n^0 /\ imax^0 = 1 + j^0, {big^0 -> 0, j^0 -> 1 + j^0, rest remain the same}>
0.00/0.47	
0.00/0.47	LOG: CALL solverLinear in Graph for feasibility
0.00/0.47	
0.00/0.47	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.47	Strengthening transition (result): 
0.00/0.47	<l8, l14, 1 + j^0 <= i^0 /\ 1 + n^0 <= i^0 /\ 1 + j^0 <= n^0 /\ imax^0 <= j^0, {big^0 -> 0, j^0 -> 1 + j^0, rest remain the same}>
0.00/0.47	
0.00/0.47	LOG: CALL solverLinear in Graph for feasibility
0.00/0.47	
0.00/0.47	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.47	Strengthening transition (result): 
0.00/0.47	<l8, l14, 1 + j^0 <= i^0 /\ 1 + n^0 <= i^0 /\ 1 + j^0 <= n^0 /\ 2 + j^0 <= imax^0, {big^0 -> 0, j^0 -> 1 + j^0, rest remain the same}>
0.00/0.47	
0.00/0.47	LOG: CALL solverLinear in Graph for feasibility
0.00/0.47	
0.00/0.47	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.47	Strengthening transition (result): 
0.00/0.47	<l8, l8, 1 + j^0 <= n^0 /\ i^0 <= n^0, {i^0 -> 1 + i^0, rest remain the same}>
0.00/0.47	
0.00/0.47	LOG: CALL solverLinear in Graph for feasibility
0.00/0.47	
0.00/0.47	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.47	Strengthening transition (result): 
0.00/0.47	<l10, l8, 1 + j^0 <= n^0, {all remain the same}>
0.00/0.47	
0.00/0.47	LOG: CALL solverLinear in Graph for feasibility
0.00/0.47	
0.00/0.47	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.47	Strengthening transition (result): 
0.00/0.47	<l14, l10, 1 + n^0 <= k^0 /\ j^0 <= n^0, {all remain the same}>
0.00/0.47	
0.00/0.47	LOG: CALL solverLinear in Graph for feasibility
0.00/0.47	
0.00/0.47	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.47	Strengthening transition (result): 
0.00/0.47	<l14, l10, 1 + n^0 <= k^0 /\ j^0 <= n^0, {all remain the same}>
0.00/0.47	
0.00/0.47	LOG: CALL solverLinear in Graph for feasibility
0.00/0.47	
0.00/0.47	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.47	Strengthening transition (result): 
0.00/0.47	<l14, l10, 1 + n^0 <= k^0 /\ j^0 <= n^0, {all remain the same}>
0.00/0.47	
0.00/0.47	LOG: CALL solverLinear in Graph for feasibility
0.00/0.47	
0.00/0.47	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.47	Strengthening transition (result): 
0.00/0.47	<l14, l14, j^0 <= n^0 /\ k^0 <= n^0, {k^0 -> 1 + k^0, rest remain the same}>
0.00/0.47	Checking unfeasibility...
0.00/0.47	Time used: 0.073423
0.00/0.47	Some transition disabled by a set of invariant(s):
0.00/0.47	Invariant at l8: 1 + n^0 <= i^0
0.00/0.47	Invariant at l10: 1 + n^0 <= i^0
0.00/0.47	Invariant at l14: 1 + n^0 <= i^0
0.00/0.47	
0.00/0.47	Strengthening and disabling transitions...
0.00/0.47	> It's unfeasible. Removing transition: 
0.00/0.47	<l8, l8, 1 + j^0 <= n^0 /\ i^0 <= n^0, {i^0 -> 1 + i^0, rest remain the same}>
0.00/0.47	
0.00/0.47	LOG: CALL solverLinear in Graph for feasibility
0.00/0.47	
0.00/0.47	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.47	Strengthening transition (result): 
0.00/0.47	<l8, l10, 1 + j^0 <= i^0 /\ 1 + n^0 <= i^0 /\ 1 + j^0 <= n^0 /\ imax^0 = 1 + j^0, {big^0 -> 0, j^0 -> 1 + j^0, rest remain the same}>
0.00/0.47	
0.00/0.47	LOG: CALL solverLinear in Graph for feasibility
0.00/0.47	
0.00/0.47	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.47	Strengthening transition (result): 
0.00/0.47	<l8, l10, 1 + j^0 <= i^0 /\ 1 + n^0 <= i^0 /\ 1 + j^0 <= n^0 /\ imax^0 = 1 + j^0, {big^0 -> 0, j^0 -> 1 + j^0, rest remain the same}>
0.00/0.47	
0.00/0.47	LOG: CALL solverLinear in Graph for feasibility
0.00/0.47	
0.00/0.47	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.47	Strengthening transition (result): 
0.00/0.47	<l8, l10, 1 + j^0 <= i^0 /\ 1 + n^0 <= i^0 /\ 1 + j^0 <= n^0 /\ imax^0 = 1 + j^0, {big^0 -> 0, j^0 -> 1 + j^0, rest remain the same}>
0.00/0.47	
0.00/0.47	LOG: CALL solverLinear in Graph for feasibility
0.00/0.47	
0.00/0.47	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.47	Strengthening transition (result): 
0.00/0.47	<l8, l14, 1 + j^0 <= i^0 /\ 1 + n^0 <= i^0 /\ 1 + j^0 <= n^0 /\ imax^0 <= j^0, {big^0 -> 0, j^0 -> 1 + j^0, rest remain the same}>
0.00/0.47	
0.00/0.47	LOG: CALL solverLinear in Graph for feasibility
0.00/0.47	
0.00/0.47	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.47	Strengthening transition (result): 
0.00/0.47	<l8, l14, 1 + j^0 <= i^0 /\ 1 + n^0 <= i^0 /\ 1 + j^0 <= n^0 /\ 2 + j^0 <= imax^0, {big^0 -> 0, j^0 -> 1 + j^0, rest remain the same}>
0.00/0.47	
0.00/0.47	LOG: CALL solverLinear in Graph for feasibility
0.00/0.47	
0.00/0.47	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.47	Strengthening transition (result): 
0.00/0.47	<l10, l8, 1 + n^0 <= i^0 /\ 1 + j^0 <= n^0, {all remain the same}>
0.00/0.47	
0.00/0.47	LOG: CALL solverLinear in Graph for feasibility
0.00/0.47	
0.00/0.47	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.47	Strengthening transition (result): 
0.00/0.47	<l14, l10, 1 + n^0 <= i^0 /\ 1 + n^0 <= k^0 /\ j^0 <= n^0, {all remain the same}>
0.00/0.47	
0.00/0.47	LOG: CALL solverLinear in Graph for feasibility
0.00/0.47	
0.00/0.47	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.47	Strengthening transition (result): 
0.00/0.47	<l14, l10, 1 + n^0 <= i^0 /\ 1 + n^0 <= k^0 /\ j^0 <= n^0, {all remain the same}>
0.00/0.47	
0.00/0.47	LOG: CALL solverLinear in Graph for feasibility
0.00/0.47	
0.00/0.47	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.47	Strengthening transition (result): 
0.00/0.47	<l14, l10, 1 + n^0 <= i^0 /\ 1 + n^0 <= k^0 /\ j^0 <= n^0, {all remain the same}>
0.00/0.47	
0.00/0.47	LOG: CALL solverLinear in Graph for feasibility
0.00/0.47	
0.00/0.47	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.47	Strengthening transition (result): 
0.00/0.47	<l14, l14, 1 + n^0 <= i^0 /\ j^0 <= n^0 /\ k^0 <= n^0, {k^0 -> 1 + k^0, rest remain the same}>
0.00/0.47	Checking unfeasibility...
0.00/0.47	Time used: 0.078791
0.00/0.47	
0.00/0.47	Checking conditional termination of SCC {l8, l10, l14}...
0.00/0.47	
0.00/0.47	LOG: CALL solveLinear
0.00/0.47	
0.00/0.47	LOG: RETURN solveLinear - Elapsed time: 0.010167s
0.00/0.47	Ranking function: 1 + 4*i^0 - 2*imax^0 - j^0 - n^0
0.00/0.47	New Graphs: 
0.00/0.47	Transitions:
0.00/0.47	<l8, l14, 1 + j^0 <= i^0 /\ 1 + n^0 <= i^0 /\ 1 + j^0 <= n^0 /\ 2 + j^0 <= imax^0, {big^0 -> 0, j^0 -> 1 + j^0, rest remain the same}>
0.00/0.47	<l14, l8, 1 + n^0 <= i^0 /\ 1 + j^0 <= n^0 /\ 1 + n^0 <= k^0, {all remain the same}>
0.00/0.47	<l14, l8, 1 + n^0 <= i^0 /\ 1 + j^0 <= n^0 /\ 1 + n^0 <= k^0, {all remain the same}>
0.00/0.47	<l14, l8, 1 + n^0 <= i^0 /\ 1 + j^0 <= n^0 /\ 1 + n^0 <= k^0, {all remain the same}>
0.00/0.47	<l14, l14, 1 + n^0 <= i^0 /\ j^0 <= n^0 /\ k^0 <= n^0, {k^0 -> 1 + k^0, rest remain the same}>
0.00/0.47	Variables:
0.00/0.47	i^0, imax^0, j^0, k^0, n^0
0.00/0.47	Checking conditional termination of SCC {l8, l14}...
0.00/0.47	
0.00/0.47	LOG: CALL solveLinear
0.00/0.47	
0.00/0.47	LOG: RETURN solveLinear - Elapsed time: 0.002138s
0.00/0.47	Ranking function: -2 + 4*imax^0 - 4*j^0
0.00/0.47	New Graphs: 
0.00/0.47	Transitions:
0.00/0.47	<l14, l14, 1 + n^0 <= i^0 /\ j^0 <= n^0 /\ k^0 <= n^0, {k^0 -> 1 + k^0, rest remain the same}>
0.00/0.47	Variables:
0.00/0.47	i^0, j^0, k^0, n^0
0.00/0.47	Checking conditional termination of SCC {l14}...
0.00/0.47	
0.00/0.47	LOG: CALL solveLinear
0.00/0.47	
0.00/0.47	LOG: RETURN solveLinear - Elapsed time: 0.001548s
0.00/0.47	Ranking function: -k^0 + n^0
0.00/0.47	New Graphs: 
0.00/0.47	Proving termination of subgraph 3
0.00/0.47	Analyzing SCC {l29}...
0.00/0.47	No cycles found.
0.00/0.47	
0.00/0.47	Program Terminates
0.00/0.47	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
0.00/0.47	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
0.00/0.47	EOF