YES

Solver Timeout: 4
Global Timeout: 60
No parsing errors!
Init Location: 0
Transitions:
<l0, l5, true>
<l1, l2, ((1 + n3^0) <= (0 + i4^0)) /\ (undef5 = (0 + Fnew5^0)) /\ (undef8 = (0 + undef5)), par{ans8^0 -> undef5, ret_fib9^0 -> undef8, tmp^0 -> (0 + undef8)}>
<l1, l3, ((0 + i4^0) <= (0 + n3^0)) /\ (undef19 = (0 + Fnew5^0)), par{Fnew5^0 -> ((0 + Fnew5^0) + Fold6^0), Fold6^0 -> (0 + undef19), i4^0 -> (1 + i4^0), temp7^0 -> undef19}>
<l3, l1, true>
<l4, l3, (undef34 = (0 + __const_30^0)), par{Fnew5^0 -> 1, Fold6^0 -> 0, a^0 -> undef34, i4^0 -> 2, n3^0 -> (0 + undef34)}>
<l5, l4, true>

Fresh variables:
undef5, undef8, undef19, undef34, 

Undef variables:
undef5, undef8, undef19, undef34, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l3, (Fnew5^0 = 1) /\ (Fold6^0 = 0) /\ (i4^0 = 2) /\ (n3^0 = (0 + undef34)) /\ (undef34 = (0 + __const_30^0))>
<l3, l2, ((1 + n3^0) <= (0 + i4^0)) /\ (undef5 = (0 + Fnew5^0)) /\ (undef8 = (0 + undef5))>
<l3, l3, ((0 + i4^0) <= (0 + n3^0)) /\ (undef19 = (0 + Fnew5^0)), par{Fnew5^0 -> ((0 + Fnew5^0) + Fold6^0), Fold6^0 -> (0 + undef19), i4^0 -> (1 + i4^0)}>

Fresh variables:
undef5, undef8, undef19, undef34, 

Undef variables:
undef5, undef8, undef19, undef34, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l3, l3, i4^0 <= n3^0 /\ Fnew5^0 = undef19, {Fnew5^0 -> Fnew5^0 + Fold6^0, Fold6^0 -> undef19, i4^0 -> 1 + i4^0, rest remain the same}>
Variables:
Fnew5^0, Fold6^0, i4^0, n3^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l3, Fold6^0 = 0 /\ __const_30^0 = undef34 /\ n3^0 = undef34 /\ Fnew5^0 = 1 /\ i4^0 = 2, {all remain the same}>

Graph 2
<l3, l2, 1 + n3^0 <= i4^0 /\ Fnew5^0 = undef5 /\ undef5 = undef8, {all remain the same}>

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

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

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

Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001169s
Ranking function: -i4^0 + n3^0
New Graphs: 
Proving termination of subgraph 2
Analyzing SCC {l2}...
No cycles found.

Program Terminates