YES

Solver Timeout: 4
Global Timeout: 300
No parsing errors!
Init Location: 0
Transitions:
<l0, l7, true>
<l1, l2, (100 <= (0 + i^0)), par{j^0 -> 100}>
<l1, l3, ((1 + i^0) <= 100), par{i^0 -> (1 + i^0), y4^0 -> (0 + i^0), y6^0 -> (0 + i^0)}>
<l3, l1, true>
<l4, l5, (200 <= (0 + j^0))>
<l4, l2, ((1 + j^0) <= 200), par{j^0 -> (1 + j^0), y8^0 -> (0 + j^0)}>
<l2, l4, true>
<l6, l3, true, par{i^0 -> 0}>
<l7, l6, true>

Fresh variables:

Undef variables:

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l3, (i^0 = 0)>
<l2, l5, (200 <= (0 + j^0))>
<l2, l2, ((1 + j^0) <= 200), par{j^0 -> (1 + j^0)}>
<l3, l2, (100 <= (0 + i^0)), par{j^0 -> 100}>
<l3, l3, ((1 + i^0) <= 100), par{i^0 -> (1 + i^0)}>

Fresh variables:

Undef variables:

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l3, l3, i^0 <= 99, {i^0 -> 1 + i^0, rest remain the same}>
Variables:
i^0

Graph 2:
Transitions:
<l2, l2, j^0 <= 199, {j^0 -> 1 + j^0, rest remain the same}>
Variables:
j^0

Graph 3:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l3, i^0 = 0, {all remain the same}>

Graph 2
<l3, l2, 100 <= i^0, {j^0 -> 100, rest remain the same}>

Graph 3
<l2, l5, 200 <= j^0, {all remain the same}>

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

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

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

Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000288s
Ranking function: 99 - i^0
New Graphs: 
Proving termination of subgraph 2
Checking unfeasibility...
Time used: 0.052973

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000860s
Ranking function: 199 - j^0
New Graphs: 
Proving termination of subgraph 3
Analyzing SCC {l5}...
No cycles found.

Program Terminates