YES

Solver Timeout: 4
Global Timeout: 300
No parsing errors!
Init Location: 0
Transitions:
<l0, l3, true>
<l1, l2, (undef4 = 0) /\ (undef5 = undef5) /\ (undef3 = undef3) /\ (undef2 = undef2), par{A^0 -> (0 + undef4), NBuffers^0 -> undef2, NLocBuffer^0 -> undef3, R^0 -> undef4, istemp^0 -> undef5}>
<l3, l1, true>

Fresh variables:
undef2, undef3, undef4, undef5, 

Undef variables:
undef2, undef3, undef4, undef5, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, (undef4 = 0) /\ (undef5 = undef5) /\ (undef3 = undef3) /\ (undef2 = undef2)>

Fresh variables:
undef2, undef3, undef4, undef5, 

Undef variables:
undef2, undef3, undef4, undef5, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l2, undef4 = 0, {all remain the same}>

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

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

Proving termination of subgraph 0
Proving termination of subgraph 1
Analyzing SCC {l2}...
No cycles found.

Program Terminates