YES

Solver Timeout: 4
Global Timeout: 60
No parsing errors!
Init Location: 0
Transitions:
<l0, l12, true>
<l1, l2, (1 <= (0 + x_14^0)), par{b_16^0 -> 1}>
<l3, l4, (1 <= (0 + x_14^0))>
<l3, l4, ((1 + x_14^0) <= 0)>
<l4, l5, (1 <= (0 + b_16^0)) /\ ((0 + b_16^0) <= 1), par{b_16^0 -> 0, x_14^0 -> (~(1) + x_14^0)}>
<l2, l6, (0 <= (0 + x_14^0)) /\ ((0 + x_14^0) <= 0), par{rt_11^0 -> (0 + st_15^0)}>
<l2, l7, (1 <= (0 + x_14^0))>
<l2, l7, ((1 + x_14^0) <= 0)>
<l7, l5, (1 <= (0 + b_16^0)) /\ ((0 + b_16^0) <= 1), par{b_16^0 -> 0, x_14^0 -> (~(1) + x_14^0)}>
<l8, l6, (0 <= (0 + x_14^0)) /\ ((0 + x_14^0) <= 0), par{rt_11^0 -> (0 + st_15^0)}>
<l8, l9, (1 <= (0 + x_14^0))>
<l8, l9, ((1 + x_14^0) <= 0)>
<l9, l10, (2 <= (0 + b_16^0))>
<l9, l10, ((1 + b_16^0) <= 1)>
<l10, l2, (undef57 = (1 + x_14^0)), par{b_16^0 -> 1, x_14^0 -> (0 + (~(1) * undef57))}>
<l5, l8, true, par{x_14^0 -> (0 + (~(1) * x_14^0))}>
<l11, l8, true, par{x_14^0 -> (0 + (~(1) * x_14^0))}>
<l12, l1, true>

Fresh variables:
undef57, 

Undef variables:
undef57, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, (b_16^0 = 1) /\ (1 <= (0 + x_14^0))>
<l2, l6, (0 <= (0 + x_14^0)) /\ ((0 + x_14^0) <= 0)>
<l2, l6, (1 <= (0 + x_14^0)) /\ (1 <= (0 + b_16^0)) /\ ((0 + b_16^0) <= 1) /\ (0 <= (0 + (0 + (~(1) * (~(1) + x_14^0))))) /\ ((0 + (0 + (~(1) * (~(1) + x_14^0)))) <= 0), par{b_16^0 -> 0, x_14^0 -> (0 + (~(1) * (~(1) + x_14^0)))}>
<l2, l2, (1 <= (0 + x_14^0)) /\ (1 <= (0 + b_16^0)) /\ ((0 + b_16^0) <= 1) /\ ((1 + (0 + (~(1) * (~(1) + x_14^0)))) <= 0) /\ ((1 + 0) <= 1) /\ (undef57 = (1 + (0 + (~(1) * (~(1) + x_14^0))))), par{b_16^0 -> 1, x_14^0 -> (0 + (~(1) * undef57))}>
<l2, l2, ((1 + x_14^0) <= 0) /\ (1 <= (0 + b_16^0)) /\ ((0 + b_16^0) <= 1) /\ (1 <= (0 + (0 + (~(1) * (~(1) + x_14^0))))) /\ ((1 + 0) <= 1) /\ (undef57 = (1 + (0 + (~(1) * (~(1) + x_14^0))))), par{b_16^0 -> 1, x_14^0 -> (0 + (~(1) * undef57))}>

Fresh variables:
undef57, 

Undef variables:
undef57, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l2, l2, 2 <= x_14^0 /\ b_16^0 = 1 /\ x_14^0 + undef57 = 2, {b_16^0 -> 1, x_14^0 -> -undef57, rest remain the same}>
<l2, l2, 1 + x_14^0 <= 0 /\ b_16^0 = 1 /\ x_14^0 + undef57 = 2, {b_16^0 -> 1, x_14^0 -> -undef57, rest remain the same}>
Variables:
b_16^0, x_14^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

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

Graph 2
<l2, l6, x_14^0 = 0, {all remain the same}>
<l2, l6, b_16^0 = 1 /\ x_14^0 = 1, {b_16^0 -> 0, x_14^0 -> 1 - x_14^0, rest remain the same}>

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

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

Proving termination of subgraph 0
Proving termination of subgraph 1
Checking unfeasibility...
Time used: 0.004563
Some transition disabled by a set of invariant(s):
Invariant at l2: 0 <= x_14^0

Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l2, l2, 1 + x_14^0 <= 0 /\ b_16^0 = 1 /\ x_14^0 + undef57 = 2, {b_16^0 -> 1, x_14^0 -> -undef57, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 2 <= x_14^0 /\ b_16^0 = 1 /\ x_14^0 + undef57 = 2, {b_16^0 -> 1, x_14^0 -> -undef57, rest remain the same}>
Checking unfeasibility...
Time used: 0.002296

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000811s
Ranking function: -1 + (1 / 2)*x_14^0
New Graphs: 
Proving termination of subgraph 2
Analyzing SCC {l6}...
No cycles found.

Program Terminates