YES

Solver Timeout: 4
Global Timeout: 300
No parsing errors!
Init Location: 0
Transitions:
<l0, l14, true>
<l1, l2, (5 <= (0 + i2^0))>
<l1, l3, ((1 + i2^0) <= 5), par{j3^0 -> 0}>
<l4, l1, true>
<l3, l5, true>
<l2, l6, true>
<l7, l8, true>
<l9, l10, true, par{l5^0 -> (1 + l5^0)}>
<l10, l11, true>
<l12, l9, true>
<l12, l2, true>
<l12, l9, true>
<l11, l7, (5 <= (0 + l5^0)), par{k4^0 -> (1 + k4^0)}>
<l11, l12, ((1 + l5^0) <= 5)>
<l8, l3, (5 <= (0 + k4^0)), par{j3^0 -> (1 + j3^0)}>
<l8, l10, ((1 + k4^0) <= 5), par{l5^0 -> 0}>
<l5, l4, (5 <= (0 + j3^0)), par{i2^0 -> (1 + i2^0)}>
<l5, l7, ((1 + j3^0) <= 5), par{k4^0 -> 0}>
<l13, l4, true, par{i2^0 -> 0, x1^0 -> 400}>
<l14, l13, true>

Fresh variables:

Undef variables:

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l7, (i2^0 = 0) /\ ((1 + i2^0) <= 5) /\ ((1 + 0) <= 5), par{j3^0 -> 0, k4^0 -> 0}>
<l7, l6, (5 <= (0 + k4^0)) /\ (5 <= (0 + (1 + j3^0))) /\ (5 <= (0 + (1 + i2^0))), par{i2^0 -> (1 + i2^0), j3^0 -> (1 + j3^0)}>
<l7, l7, (5 <= (0 + k4^0)) /\ (5 <= (0 + (1 + j3^0))) /\ ((1 + (1 + i2^0)) <= 5) /\ ((1 + 0) <= 5), par{i2^0 -> (1 + i2^0), j3^0 -> 0, k4^0 -> 0}>
<l7, l7, (5 <= (0 + k4^0)) /\ ((1 + (1 + j3^0)) <= 5), par{j3^0 -> (1 + j3^0), k4^0 -> 0}>
<l7, l10, ((1 + k4^0) <= 5), par{l5^0 -> 0}>
<l10, l7, (5 <= (0 + l5^0)), par{k4^0 -> (1 + k4^0)}>
<l10, l10, ((1 + l5^0) <= 5), par{l5^0 -> (1 + l5^0)}>
<l10, l6, ((1 + l5^0) <= 5)>
<l10, l10, ((1 + l5^0) <= 5), par{l5^0 -> (1 + l5^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:
<l7, l7, 5 <= k4^0 /\ 4 <= j3^0 /\ i2^0 <= 3, {i2^0 -> 1 + i2^0, j3^0 -> 0, k4^0 -> 0, rest remain the same}>
<l7, l7, 5 <= k4^0 /\ j3^0 <= 3, {j3^0 -> 1 + j3^0, k4^0 -> 0, rest remain the same}>
<l7, l10, k4^0 <= 4, {l5^0 -> 0, rest remain the same}>
<l10, l7, 5 <= l5^0, {k4^0 -> 1 + k4^0, rest remain the same}>
<l10, l10, l5^0 <= 4, {l5^0 -> 1 + l5^0, rest remain the same}>
<l10, l10, l5^0 <= 4, {l5^0 -> 1 + l5^0, rest remain the same}>
Variables:
i2^0, j3^0, k4^0, l5^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l7, i2^0 = 0, {j3^0 -> 0, k4^0 -> 0, rest remain the same}>

Graph 2
<l7, l6, 5 <= k4^0 /\ 4 <= i2^0 /\ 4 <= j3^0, {i2^0 -> 1 + i2^0, j3^0 -> 1 + j3^0, rest remain the same}>
<l10, l6, l5^0 <= 4, {all remain the same}>

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

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

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

Checking conditional termination of SCC {l7, l10}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002500s
Ranking function: 3 - i2^0
New Graphs: 
Transitions:
<l7, l7, 5 <= k4^0 /\ j3^0 <= 3, {j3^0 -> 1 + j3^0, k4^0 -> 0, rest remain the same}>
<l7, l10, k4^0 <= 4, {l5^0 -> 0, rest remain the same}>
<l10, l7, 5 <= l5^0, {k4^0 -> 1 + k4^0, rest remain the same}>
<l10, l10, l5^0 <= 4, {l5^0 -> 1 + l5^0, rest remain the same}>
<l10, l10, l5^0 <= 4, {l5^0 -> 1 + l5^0, rest remain the same}>
Variables:
j3^0, k4^0, l5^0
Checking conditional termination of SCC {l7, l10}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000860s
Ranking function: 3 - j3^0
New Graphs: 
Transitions:
<l7, l10, k4^0 <= 4, {l5^0 -> 0, rest remain the same}>
<l10, l7, 5 <= l5^0, {k4^0 -> 1 + k4^0, rest remain the same}>
<l10, l10, l5^0 <= 4, {l5^0 -> 1 + l5^0, rest remain the same}>
<l10, l10, l5^0 <= 4, {l5^0 -> 1 + l5^0, rest remain the same}>
Variables:
k4^0, l5^0
Checking conditional termination of SCC {l7, l10}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000567s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002835s
Trying to remove transition: <l10, l10, l5^0 <= 4, {l5^0 -> 1 + l5^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013609s
Time used: 0.013504
Trying to remove transition: <l10, l10, l5^0 <= 4, {l5^0 -> 1 + l5^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012934s
Time used: 0.01249
Trying to remove transition: <l10, l7, 5 <= l5^0, {k4^0 -> 1 + k4^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006223s
Time used: 0.005799
Trying to remove transition: <l7, l10, k4^0 <= 4, {l5^0 -> 0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004537s
Time used: 0.004069
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.081539s
Time used: 0.081084

LOG: SAT solveNonLinear - Elapsed time: 0.081539s
Cost: 0; Total time: 0.081084
Termination implied by a set of invariant(s):
Invariant at l10: k4^0 <= 4
[ Invariant Graph ]
Strengthening and disabling transitions...

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): 
<l10, l7, 5 <= l5^0 /\ k4^0 <= 4, {k4^0 -> 1 + k4^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l10, k4^0 <= 4 /\ l5^0 <= 4, {l5^0 -> 1 + l5^0, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

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): 
<l10, l7, 5 <= l5^0 /\ k4^0 <= 4, {k4^0 -> 1 + k4^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l10, k4^0 <= 4 /\ l5^0 <= 4, {l5^0 -> 1 + l5^0, rest remain the same}>
Ranking function: 4 - k4^0
New Graphs: 
Transitions:
<l10, l10, k4^0 <= 4 /\ l5^0 <= 4, {l5^0 -> 1 + l5^0, rest remain the same}>
<l10, l10, k4^0 <= 4 /\ l5^0 <= 4, {l5^0 -> 1 + l5^0, rest remain the same}>
Variables:
k4^0, l5^0
Checking conditional termination of SCC {l10}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000623s
Ranking function: 4 - l5^0
New Graphs: 
INVARIANTS: 
10: k4^0 <= 4 , 
Quasi-INVARIANTS to narrow Graph: 
10: 
Proving termination of subgraph 2
Analyzing SCC {l6}...
No cycles found.

Program Terminates