YES

Solver Timeout: 4
Global Timeout: 300
No parsing errors!
Init Location: 0
Transitions:
<l0, l24, true>
<l1, l2, ((0 + n^0) <= (0 + m^0))>
<l1, l3, ((1 + m^0) <= (0 + n^0)), par{i^0 -> (0 + m^0), x^0 -> 0}>
<l3, l4, true>
<l5, l6, true>
<l7, l8, true, par{m^0 -> (1 + m^0)}>
<l9, l10, true, par{i^0 -> (1 + i^0)}>
<l11, l12, true>
<l13, l9, ((1 + n^0) <= (0 + j^0))>
<l13, l14, ((0 + j^0) <= (0 + n^0)), par{j^0 -> (1 + j^0)}>
<l15, l14, ((1 + n^0) <= (0 + j^0))>
<l15, l16, ((0 + j^0) <= (0 + n^0)), par{j^0 -> (1 + j^0)}>
<l17, l16, (undef96 = undef96), par{y^0 -> undef96}>
<l18, l9, ((0 + y^0) <= 0) /\ (0 <= (0 + y^0))>
<l18, l17, (1 <= (0 + y^0))>
<l18, l17, ((1 + y^0) <= 0)>
<l10, l19, true>
<l19, l7, ((1 + n^0) <= (0 + i^0))>
<l19, l18, ((0 + i^0) <= (0 + n^0)) /\ (undef144 = undef144), par{y^0 -> undef144}>
<l20, l7, ((0 + x^0) <= 0) /\ (0 <= (0 + x^0))>
<l20, l10, (1 <= (0 + x^0))>
<l20, l10, ((1 + x^0) <= 0)>
<l16, l15, true>
<l12, l20, ((1 + n^0) <= (0 + j^0))>
<l12, l11, ((0 + j^0) <= (0 + n^0)) /\ (undef192 = undef192), par{j^0 -> (1 + j^0), y^0 -> undef192}>
<l6, l11, ((1 + n^0) <= (0 + j^0))>
<l6, l5, ((0 + j^0) <= (0 + n^0)) /\ (undef208 = undef208), par{j^0 -> (1 + j^0), y^0 -> undef208}>
<l21, l20, ((0 + i^0) <= (0 + m^0)) /\ ((0 + m^0) <= (0 + i^0))>
<l21, l5, ((1 + m^0) <= (0 + i^0))>
<l21, l5, ((1 + i^0) <= (0 + m^0))>
<l14, l13, true>
<l22, l3, true, par{j^0 -> (1 + j^0)}>
<l23, l22, ((0 + tmp^0) <= (0 + tmp___0^0))>
<l23, l22, ((1 + tmp___0^0) <= (0 + tmp^0)) /\ (undef263 = undef263), par{i^0 -> (0 + j^0), x^0 -> undef263}>
<l4, l21, ((1 + n^0) <= (0 + j^0))>
<l4, l23, ((0 + j^0) <= (0 + n^0)) /\ (undef277 = undef277) /\ (undef278 = undef278), par{tmp^0 -> undef277, tmp___0^0 -> undef278}>
<l8, l1, true>
<l24, l8, true>

Fresh variables:
undef96, undef144, undef192, undef208, undef263, undef277, undef278, 

Undef variables:
undef96, undef144, undef192, undef208, undef263, undef277, undef278, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, ((0 + n^0) <= (0 + m^0))>
<l0, l3, ((1 + m^0) <= (0 + n^0)), par{i^0 -> (0 + m^0), x^0 -> 0}>
<l3, l2, ((1 + n^0) <= (0 + j^0)) /\ ((0 + i^0) <= (0 + m^0)) /\ ((0 + m^0) <= (0 + i^0)) /\ ((0 + x^0) <= 0) /\ (0 <= (0 + x^0)) /\ ((0 + n^0) <= (0 + (1 + m^0))), par{m^0 -> (1 + m^0)}>
<l3, l3, ((1 + n^0) <= (0 + j^0)) /\ ((0 + i^0) <= (0 + m^0)) /\ ((0 + m^0) <= (0 + i^0)) /\ ((0 + x^0) <= 0) /\ (0 <= (0 + x^0)) /\ ((1 + (1 + m^0)) <= (0 + n^0)), par{i^0 -> (0 + (1 + m^0)), m^0 -> (1 + m^0), x^0 -> 0}>
<l3, l10, ((1 + n^0) <= (0 + j^0)) /\ ((0 + i^0) <= (0 + m^0)) /\ ((0 + m^0) <= (0 + i^0)) /\ (1 <= (0 + x^0))>
<l3, l10, ((1 + n^0) <= (0 + j^0)) /\ ((0 + i^0) <= (0 + m^0)) /\ ((0 + m^0) <= (0 + i^0)) /\ ((1 + x^0) <= 0)>
<l3, l5, ((1 + n^0) <= (0 + j^0)) /\ ((1 + m^0) <= (0 + i^0))>
<l3, l5, ((1 + n^0) <= (0 + j^0)) /\ ((1 + i^0) <= (0 + m^0))>
<l3, l3, ((0 + j^0) <= (0 + n^0)) /\ (undef277 = undef277) /\ (undef278 = undef278) /\ ((0 + undef277) <= (0 + undef278)), par{j^0 -> (1 + j^0)}>
<l3, l3, ((0 + j^0) <= (0 + n^0)) /\ (undef277 = undef277) /\ (undef278 = undef278) /\ ((1 + undef278) <= (0 + undef277)) /\ (undef263 = undef263), par{i^0 -> (0 + j^0), j^0 -> (1 + j^0), x^0 -> undef263}>
<l5, l11, ((1 + n^0) <= (0 + j^0))>
<l5, l5, ((0 + j^0) <= (0 + n^0)) /\ (undef208 = undef208), par{j^0 -> (1 + j^0)}>
<l10, l2, ((1 + n^0) <= (0 + i^0)) /\ ((0 + n^0) <= (0 + (1 + m^0))), par{m^0 -> (1 + m^0)}>
<l10, l3, ((1 + n^0) <= (0 + i^0)) /\ ((1 + (1 + m^0)) <= (0 + n^0)), par{i^0 -> (0 + (1 + m^0)), m^0 -> (1 + m^0), x^0 -> 0}>
<l10, l10, ((0 + i^0) <= (0 + n^0)) /\ (undef144 = undef144) /\ ((0 + undef144) <= 0) /\ (0 <= (0 + undef144)), par{i^0 -> (1 + i^0)}>
<l10, l16, ((0 + i^0) <= (0 + n^0)) /\ (undef144 = undef144) /\ (1 <= (0 + undef144)) /\ (undef96 = undef96)>
<l10, l16, ((0 + i^0) <= (0 + n^0)) /\ (undef144 = undef144) /\ ((1 + undef144) <= 0) /\ (undef96 = undef96)>
<l11, l2, ((1 + n^0) <= (0 + j^0)) /\ ((0 + x^0) <= 0) /\ (0 <= (0 + x^0)) /\ ((0 + n^0) <= (0 + (1 + m^0))), par{m^0 -> (1 + m^0)}>
<l11, l3, ((1 + n^0) <= (0 + j^0)) /\ ((0 + x^0) <= 0) /\ (0 <= (0 + x^0)) /\ ((1 + (1 + m^0)) <= (0 + n^0)), par{i^0 -> (0 + (1 + m^0)), m^0 -> (1 + m^0), x^0 -> 0}>
<l11, l10, ((1 + n^0) <= (0 + j^0)) /\ (1 <= (0 + x^0))>
<l11, l10, ((1 + n^0) <= (0 + j^0)) /\ ((1 + x^0) <= 0)>
<l11, l11, ((0 + j^0) <= (0 + n^0)) /\ (undef192 = undef192), par{j^0 -> (1 + j^0)}>
<l14, l10, ((1 + n^0) <= (0 + j^0)), par{i^0 -> (1 + i^0)}>
<l14, l14, ((0 + j^0) <= (0 + n^0)), par{j^0 -> (1 + j^0)}>
<l16, l14, ((1 + n^0) <= (0 + j^0))>
<l16, l16, ((0 + j^0) <= (0 + n^0)), par{j^0 -> (1 + j^0)}>

Fresh variables:
undef96, undef144, undef192, undef208, undef263, undef277, undef278, 

Undef variables:
undef96, undef144, undef192, undef208, undef263, undef277, undef278, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

*************************************************************
*******************************************************************************************
***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
*******************************************************************************************

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l3, l3, 1 + n^0 <= j^0 /\ 2 + m^0 <= n^0 /\ i^0 = m^0 /\ x^0 = 0, {i^0 -> 1 + m^0, m^0 -> 1 + m^0, x^0 -> 0, rest remain the same}>
<l3, l10, 1 + n^0 <= j^0 /\ 1 <= x^0 /\ i^0 = m^0, {all remain the same}>
<l3, l10, 1 + n^0 <= j^0 /\ 1 + x^0 <= 0 /\ i^0 = m^0, {all remain the same}>
<l3, l5, 1 + m^0 <= i^0 /\ 1 + n^0 <= j^0, {all remain the same}>
<l3, l5, 1 + i^0 <= m^0 /\ 1 + n^0 <= j^0, {all remain the same}>
<l3, l3, j^0 <= n^0 /\ undef277 <= undef278, {j^0 -> 1 + j^0, rest remain the same}>
<l3, l3, j^0 <= n^0 /\ 1 + undef278 <= undef277, {i^0 -> j^0, j^0 -> 1 + j^0, x^0 -> undef263, rest remain the same}>
<l5, l11, 1 + n^0 <= j^0, {all remain the same}>
<l5, l5, j^0 <= n^0, {j^0 -> 1 + j^0, rest remain the same}>
<l10, l3, 1 + n^0 <= i^0 /\ 2 + m^0 <= n^0, {i^0 -> 1 + m^0, m^0 -> 1 + m^0, x^0 -> 0, rest remain the same}>
<l10, l10, i^0 <= n^0 /\ undef144 = 0, {i^0 -> 1 + i^0, rest remain the same}>
<l10, l16, i^0 <= n^0 /\ 1 <= undef144, {all remain the same}>
<l10, l16, i^0 <= n^0 /\ 1 + undef144 <= 0, {all remain the same}>
<l11, l3, 1 + n^0 <= j^0 /\ 2 + m^0 <= n^0 /\ x^0 = 0, {i^0 -> 1 + m^0, m^0 -> 1 + m^0, x^0 -> 0, rest remain the same}>
<l11, l10, 1 + n^0 <= j^0 /\ 1 <= x^0, {all remain the same}>
<l11, l10, 1 + n^0 <= j^0 /\ 1 + x^0 <= 0, {all remain the same}>
<l11, l11, j^0 <= n^0, {j^0 -> 1 + j^0, rest remain the same}>
<l14, l10, 1 + n^0 <= j^0, {i^0 -> 1 + i^0, rest remain the same}>
<l14, l14, j^0 <= n^0, {j^0 -> 1 + j^0, rest remain the same}>
<l16, l14, 1 + n^0 <= j^0, {all remain the same}>
<l16, l16, j^0 <= n^0, {j^0 -> 1 + j^0, rest remain the same}>
Variables:
i^0, j^0, m^0, n^0, x^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l3, 1 + m^0 <= n^0, {i^0 -> m^0, x^0 -> 0, rest remain the same}>

Graph 2
<l0, l2, n^0 <= m^0, {all remain the same}>
<l3, l2, 1 + n^0 <= j^0 /\ n^0 <= 1 + m^0 /\ i^0 = m^0 /\ x^0 = 0, {m^0 -> 1 + m^0, rest remain the same}>
<l10, l2, 1 + n^0 <= i^0 /\ n^0 <= 1 + m^0, {m^0 -> 1 + m^0, rest remain the same}>
<l11, l2, 1 + n^0 <= j^0 /\ n^0 <= 1 + m^0 /\ x^0 = 0, {m^0 -> 1 + m^0, rest remain the same}>

Map Locations to Subgraph:
( 0 , 0 )
( 2 , 2 )
( 3 , 1 )
( 5 , 1 )
( 10 , 1 )
( 11 , 1 )
( 14 , 1 )
( 16 , 1 )

*******************************************************************************************
********************************    CHECKING ASSERTIONS    ********************************
*******************************************************************************************

Proving termination of subgraph 0
Proving termination of subgraph 1
Checking unfeasibility...
Time used: 0.124814
Some transition disabled by a set of invariant(s):
Invariant at l14: 1 + n^0 <= j^0

Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l14, l14, j^0 <= n^0, {j^0 -> 1 + j^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l10, 1 + n^0 <= j^0, {i^0 -> 1 + i^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Checking unfeasibility...
Time used: 0.059464
Some transition disabled by a set of invariant(s):
Invariant at l3: 1 + m^0 <= n^0
Invariant at l5: 1 + n^0 <= j^0
Invariant at l10: n^0 <= 1 + j^0
Invariant at l14: i^0 <= 1 + j^0
Invariant at l16: i^0 <= 1 + j^0

Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l5, l5, j^0 <= n^0, {j^0 -> 1 + j^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l3, 1 + n^0 <= j^0 /\ 2 + m^0 <= n^0 /\ i^0 = m^0 /\ x^0 = 0, {i^0 -> 1 + m^0, m^0 -> 1 + m^0, x^0 -> 0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l10, 1 + n^0 <= j^0 /\ 1 + m^0 <= n^0 /\ 1 <= x^0 /\ i^0 = m^0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l10, 1 + n^0 <= j^0 /\ 1 + m^0 <= n^0 /\ 1 + x^0 <= 0 /\ i^0 = m^0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l5, 1 + m^0 <= i^0 /\ 1 + n^0 <= j^0 /\ 1 + m^0 <= n^0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l5, 1 + i^0 <= m^0 /\ 1 + n^0 <= j^0 /\ 1 + m^0 <= n^0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l3, j^0 <= n^0 /\ undef277 <= undef278 /\ 1 + m^0 <= n^0, {j^0 -> 1 + j^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l3, j^0 <= n^0 /\ 1 + m^0 <= n^0 /\ 1 + undef278 <= undef277, {i^0 -> j^0, j^0 -> 1 + j^0, x^0 -> undef263, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l5, l11, 1 + n^0 <= j^0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l3, 1 + n^0 <= i^0 /\ n^0 <= 1 + j^0 /\ 2 + m^0 <= n^0, {i^0 -> 1 + m^0, m^0 -> 1 + m^0, x^0 -> 0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l10, i^0 <= n^0 /\ n^0 <= 1 + j^0 /\ undef144 = 0, {i^0 -> 1 + i^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l16, i^0 <= n^0 /\ 1 <= undef144 /\ n^0 <= 1 + j^0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l16, i^0 <= n^0 /\ 1 + undef144 <= 0 /\ n^0 <= 1 + j^0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l10, 1 + n^0 <= j^0 /\ i^0 <= 1 + j^0, {i^0 -> 1 + i^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l16, l14, 1 + n^0 <= j^0 /\ i^0 <= 1 + j^0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l16, l16, j^0 <= n^0 /\ i^0 <= 1 + j^0, {j^0 -> 1 + j^0, rest remain the same}>
Checking unfeasibility...
Time used: 0.072357
Some transition disabled by a set of invariant(s):
Invariant at l5: 1 + m^0 <= n^0
Invariant at l10: 1 + n^0 <= j^0
Invariant at l11: 1 + m^0 <= n^0
Invariant at l16: 1 + n^0 <= j^0

Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l16, l16, j^0 <= n^0 /\ i^0 <= 1 + j^0, {j^0 -> 1 + j^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l5, l11, 1 + n^0 <= j^0 /\ 1 + m^0 <= n^0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l3, 1 + n^0 <= i^0 /\ 1 + n^0 <= j^0 /\ 2 + m^0 <= n^0, {i^0 -> 1 + m^0, m^0 -> 1 + m^0, x^0 -> 0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l10, i^0 <= n^0 /\ 1 + n^0 <= j^0 /\ undef144 = 0, {i^0 -> 1 + i^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l16, i^0 <= n^0 /\ 1 + n^0 <= j^0 /\ 1 <= undef144, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l16, i^0 <= n^0 /\ 1 + n^0 <= j^0 /\ 1 + undef144 <= 0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l11, l3, 1 + n^0 <= j^0 /\ 2 + m^0 <= n^0 /\ x^0 = 0, {i^0 -> 1 + m^0, m^0 -> 1 + m^0, x^0 -> 0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l11, l10, 1 + n^0 <= j^0 /\ 1 + m^0 <= n^0 /\ 1 <= x^0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l11, l10, 1 + n^0 <= j^0 /\ 1 + m^0 <= n^0 /\ 1 + x^0 <= 0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l11, l11, j^0 <= n^0 /\ 1 + m^0 <= n^0, {j^0 -> 1 + j^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l16, l14, 1 + n^0 <= j^0 /\ i^0 <= 1 + j^0, {all remain the same}>
Checking unfeasibility...
Time used: 0.088272
Some transition disabled by a set of invariant(s):
Invariant at l3: 1 + m^0 <= n^0
Invariant at l5: n^0 <= j^0
Invariant at l11: 1 + n^0 <= j^0

Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l11, l11, j^0 <= n^0 /\ 1 + m^0 <= n^0, {j^0 -> 1 + j^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l3, 1 + n^0 <= j^0 /\ 2 + m^0 <= n^0 /\ i^0 = m^0 /\ x^0 = 0, {i^0 -> 1 + m^0, m^0 -> 1 + m^0, x^0 -> 0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l10, 1 + n^0 <= j^0 /\ 1 + m^0 <= n^0 /\ 1 <= x^0 /\ i^0 = m^0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l10, 1 + n^0 <= j^0 /\ 1 + m^0 <= n^0 /\ 1 + x^0 <= 0 /\ i^0 = m^0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l5, 1 + m^0 <= i^0 /\ 1 + n^0 <= j^0 /\ 1 + m^0 <= n^0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l5, 1 + i^0 <= m^0 /\ 1 + n^0 <= j^0 /\ 1 + m^0 <= n^0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l3, j^0 <= n^0 /\ undef277 <= undef278 /\ 1 + m^0 <= n^0, {j^0 -> 1 + j^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l3, j^0 <= n^0 /\ 1 + m^0 <= n^0 /\ 1 + undef278 <= undef277, {i^0 -> j^0, j^0 -> 1 + j^0, x^0 -> undef263, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l5, l11, 1 + n^0 <= j^0 /\ 1 + m^0 <= n^0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l11, l3, 1 + n^0 <= j^0 /\ 2 + m^0 <= n^0 /\ x^0 = 0, {i^0 -> 1 + m^0, m^0 -> 1 + m^0, x^0 -> 0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l11, l10, 1 + n^0 <= j^0 /\ 1 + m^0 <= n^0 /\ 1 <= x^0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l11, l10, 1 + n^0 <= j^0 /\ 1 + m^0 <= n^0 /\ 1 + x^0 <= 0, {all remain the same}>
Checking unfeasibility...
Time used: 0.144901

Checking conditional termination of SCC {l3, l5, l10, l11, l14, l16}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008729s
Ranking function: -2 - 8*j^0 - 2*m^0 + 10*n^0
New Graphs: 
Transitions:
<l3, l3, 1 + n^0 <= j^0 /\ 2 + m^0 <= n^0 /\ i^0 = m^0 /\ x^0 = 0, {i^0 -> 1 + m^0, m^0 -> 1 + m^0, x^0 -> 0, rest remain the same}>
<l3, l10, 1 + n^0 <= j^0 /\ 1 + m^0 <= n^0 /\ 1 <= x^0 /\ i^0 = m^0, {all remain the same}>
<l3, l10, 1 + n^0 <= j^0 /\ 1 + m^0 <= n^0 /\ 1 + x^0 <= 0 /\ i^0 = m^0, {all remain the same}>
<l3, l3, 1 + m^0 <= i^0 /\ 1 + n^0 <= j^0 /\ 2 + m^0 <= n^0 /\ x^0 = 0, {i^0 -> 1 + m^0, m^0 -> 1 + m^0, x^0 -> 0, rest remain the same}>
<l3, l10, 1 + m^0 <= i^0 /\ 1 + n^0 <= j^0 /\ 1 + m^0 <= n^0 /\ 1 <= x^0, {all remain the same}>
<l3, l10, 1 + m^0 <= i^0 /\ 1 + n^0 <= j^0 /\ 1 + m^0 <= n^0 /\ 1 + x^0 <= 0, {all remain the same}>
<l3, l3, 1 + i^0 <= m^0 /\ 1 + n^0 <= j^0 /\ 2 + m^0 <= n^0 /\ x^0 = 0, {i^0 -> 1 + m^0, m^0 -> 1 + m^0, x^0 -> 0, rest remain the same}>
<l3, l10, 1 + i^0 <= m^0 /\ 1 + n^0 <= j^0 /\ 1 + m^0 <= n^0 /\ 1 <= x^0, {all remain the same}>
<l3, l10, 1 + i^0 <= m^0 /\ 1 + n^0 <= j^0 /\ 1 + m^0 <= n^0 /\ 1 + x^0 <= 0, {all remain the same}>
<l10, l3, 1 + n^0 <= i^0 /\ 1 + n^0 <= j^0 /\ 2 + m^0 <= n^0, {i^0 -> 1 + m^0, m^0 -> 1 + m^0, x^0 -> 0, rest remain the same}>
<l10, l10, i^0 <= n^0 /\ 1 + n^0 <= j^0 /\ undef144 = 0, {i^0 -> 1 + i^0, rest remain the same}>
<l10, l10, i^0 <= n^0 /\ 1 + n^0 <= j^0 /\ 1 <= undef144 /\ i^0 <= 1 + j^0, {i^0 -> 1 + i^0, rest remain the same}>
<l10, l10, i^0 <= n^0 /\ 1 + n^0 <= j^0 /\ 1 + undef144 <= 0 /\ i^0 <= 1 + j^0, {i^0 -> 1 + i^0, rest remain the same}>
Variables:
i^0, j^0, m^0, n^0, x^0
Checking conditional termination of SCC {l3, l10}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002961s
Ranking function: -5 + (~(9) / 2)*m^0 + (9 / 2)*n^0
New Graphs: 
Transitions:
<l10, l10, i^0 <= n^0 /\ 1 + n^0 <= j^0 /\ undef144 = 0, {i^0 -> 1 + i^0, rest remain the same}>
<l10, l10, i^0 <= n^0 /\ 1 + n^0 <= j^0 /\ 1 <= undef144 /\ i^0 <= 1 + j^0, {i^0 -> 1 + i^0, rest remain the same}>
<l10, l10, i^0 <= n^0 /\ 1 + n^0 <= j^0 /\ 1 + undef144 <= 0 /\ i^0 <= 1 + j^0, {i^0 -> 1 + i^0, rest remain the same}>
Variables:
i^0, j^0, n^0
Checking conditional termination of SCC {l10}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001350s
Ranking function: -i^0 + n^0
New Graphs: 
Proving termination of subgraph 2
Analyzing SCC {l2}...
No cycles found.

Program Terminates