YES

Solver Timeout: 4
Global Timeout: 300
No parsing errors!
Init Location: 0
Transitions:
<l0, l10, true>
<l1, l2, ((0 + n^0) <= (0 + j^0)), par{i^0 -> (1 + i^0)}>
<l1, l3, ((1 + j^0) <= (0 + n^0)) /\ (undef5 = undef5), par{guard^0 -> undef5}>
<l4, l5, ((0 + n^0) <= (0 + i^0))>
<l4, l6, ((1 + i^0) <= (0 + n^0)), par{j^0 -> (1 + i^0)}>
<l2, l4, true>
<l6, l1, true>
<l7, l6, true, par{j^0 -> (1 + j^0)}>
<l8, l7, true, par{j^0 -> (~(1) + j^0), n^0 -> (~(1) + n^0)}>
<l3, l7, ((0 + guard^0) <= 0) /\ (0 <= (0 + guard^0))>
<l3, l8, (1 <= (0 + guard^0))>
<l3, l8, ((1 + guard^0) <= 0)>
<l9, l2, true, par{i^0 -> 0}>
<l10, l9, true>

Fresh variables:
undef5, 

Undef variables:
undef5, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l5, (i^0 = 0) /\ ((0 + n^0) <= (0 + 0))>
<l0, l6, (i^0 = 0) /\ ((1 + 0) <= (0 + n^0)), par{j^0 -> (1 + 0)}>
<l6, l5, ((0 + n^0) <= (0 + j^0)) /\ ((0 + n^0) <= (0 + (1 + i^0))), par{i^0 -> (1 + i^0)}>
<l6, l6, ((0 + n^0) <= (0 + j^0)) /\ ((1 + (1 + i^0)) <= (0 + n^0)), par{i^0 -> (1 + i^0), j^0 -> (1 + (1 + i^0))}>
<l6, l6, ((1 + j^0) <= (0 + n^0)) /\ (undef5 = undef5) /\ ((0 + undef5) <= 0) /\ (0 <= (0 + undef5)), par{j^0 -> (1 + j^0)}>
<l6, l6, ((1 + j^0) <= (0 + n^0)) /\ (undef5 = undef5) /\ (1 <= (0 + undef5)), par{j^0 -> (1 + (~(1) + j^0)), n^0 -> (~(1) + n^0)}>
<l6, l6, ((1 + j^0) <= (0 + n^0)) /\ (undef5 = undef5) /\ ((1 + undef5) <= 0), par{j^0 -> (1 + (~(1) + j^0)), n^0 -> (~(1) + n^0)}>

Fresh variables:
undef5, 

Undef variables:
undef5, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l6, l6, n^0 <= j^0 /\ 2 + i^0 <= n^0, {i^0 -> 1 + i^0, j^0 -> 2 + i^0, rest remain the same}>
<l6, l6, 1 + j^0 <= n^0 /\ undef5 = 0, {j^0 -> 1 + j^0, rest remain the same}>
<l6, l6, 1 + j^0 <= n^0 /\ 1 <= undef5, {n^0 -> -1 + n^0, rest remain the same}>
<l6, l6, 1 + j^0 <= n^0 /\ 1 + undef5 <= 0, {n^0 -> -1 + n^0, rest remain the same}>
Variables:
i^0, j^0, n^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l6, 1 <= n^0 /\ i^0 = 0, {j^0 -> 1, rest remain the same}>

Graph 2
<l0, l5, n^0 <= 0 /\ i^0 = 0, {all remain the same}>
<l6, l5, n^0 <= j^0 /\ n^0 <= 1 + i^0, {i^0 -> 1 + i^0, rest remain the same}>

Map Locations to Subgraph:
( 0 , 0 )
( 5 , 2 )
( 6 , 1 )

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

Proving termination of subgraph 0
Proving termination of subgraph 1
Checking unfeasibility...
Time used: 0.037592

Checking conditional termination of SCC {l6}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001363s
Ranking function: -6 - 3*i^0 + 3*n^0
New Graphs: 
Transitions:
<l6, l6, 1 + j^0 <= n^0 /\ undef5 = 0, {j^0 -> 1 + j^0, rest remain the same}>
<l6, l6, 1 + j^0 <= n^0 /\ 1 <= undef5, {n^0 -> -1 + n^0, rest remain the same}>
<l6, l6, 1 + j^0 <= n^0 /\ 1 + undef5 <= 0, {n^0 -> -1 + n^0, rest remain the same}>
Variables:
j^0, n^0
Checking conditional termination of SCC {l6}...

LOG: CALL solveLinear

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

Program Terminates