YES

Solver Timeout: 4
Global Timeout: 300
No parsing errors!
Init Location: 0
Transitions:
<l0, l7, true>
<l1, l2, true, par{nI6^0 -> (1 + nI6^0), res5^0 -> ((0 + res5^0) + tmp7^0)}>
<l3, l1, true, par{tmp7^0 -> 0}>
<l3, l1, true, par{tmp7^0 -> 1}>
<l4, l5, ((0 + (2 * __const_8^0)) <= (0 + nI6^0)) /\ (undef44 = (0 + res5^0)) /\ (undef40 = (0 + nX^0)) /\ (undef49 = (0 + undef40)) /\ (undef50 = undef50) /\ (undef51 = undef51) /\ (undef52 = undef52) /\ (undef42 = undef42) /\ (undef45 = (0 + undef42)), par{nX9^0 -> undef40, res10^0 -> undef42, ret_nBC18^0 -> undef44, ret_nBC211^0 -> undef45, tmp^0 -> (0 + undef44), tmp___0^0 -> (0 + undef45)}>
<l4, l3, ((1 + nI6^0) <= (0 + (2 * __const_8^0)))>
<l2, l4, true>
<l6, l2, true, par{nI6^0 -> 0, nX4^0 -> (0 + nX^0), res5^0 -> 0}>
<l7, l6, true>

Fresh variables:
undef40, undef42, undef44, undef45, undef49, undef50, undef51, undef52, 

Undef variables:
undef40, undef42, undef44, undef45, undef49, undef50, undef51, undef52, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, (nI6^0 = 0) /\ (res5^0 = 0)>
<l2, l5, ((0 + (2 * __const_8^0)) <= (0 + nI6^0)) /\ (undef44 = (0 + res5^0)) /\ (undef40 = (0 + nX^0)) /\ (undef49 = (0 + undef40)) /\ (undef50 = undef50) /\ (undef51 = undef51) /\ (undef52 = undef52) /\ (undef42 = undef42) /\ (undef45 = (0 + undef42))>
<l2, l2, ((1 + nI6^0) <= (0 + (2 * __const_8^0))), par{nI6^0 -> (1 + nI6^0), res5^0 -> ((0 + res5^0) + 0)}>
<l2, l2, ((1 + nI6^0) <= (0 + (2 * __const_8^0))), par{nI6^0 -> (1 + nI6^0), res5^0 -> ((0 + res5^0) + 1)}>

Fresh variables:
undef40, undef42, undef44, undef45, undef49, undef50, undef51, undef52, 

Undef variables:
undef40, undef42, undef44, undef45, undef49, undef50, undef51, undef52, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l2, l2, 1 + nI6^0 <= 2*__const_8^0, {nI6^0 -> 1 + nI6^0, rest remain the same}>
<l2, l2, 1 + nI6^0 <= 2*__const_8^0, {nI6^0 -> 1 + nI6^0, res5^0 -> 1 + res5^0, rest remain the same}>
Variables:
__const_8^0, nI6^0, res5^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l2, nI6^0 = 0 /\ res5^0 = 0, {all remain the same}>

Graph 2
<l2, l5, 2*__const_8^0 <= nI6^0 /\ nX^0 = undef40 /\ res5^0 = undef44 /\ undef40 = undef49 /\ undef42 = undef45, {all remain the same}>

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

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

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

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

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

Program Terminates