NO

Solver Timeout: 4
Global Timeout: 60
No parsing errors!
Init Location: 0
Transitions:
<l0, l5, true>
<l1, l2, true, par{x_1^0 -> 2}>
<l3, l2, ((0 + y_1^0) <= 0), par{x_1^0 -> (~(1) + x_1^0)}>
<l3, l2, (1 <= (0 + y_1^0)), par{x_1^0 -> (1 + x_1^0)}>
<l2, l3, (undef8 = undef8), par{y_1^0 -> undef8}>
<l2, l4, (2 <= 0)>
<l5, l1, true>

Fresh variables:
undef8, 

Undef variables:
undef8, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, (x_1^0 = 2)>
<l2, l2, (undef8 = undef8) /\ ((0 + undef8) <= 0), par{x_1^0 -> (~(1) + x_1^0)}>
<l2, l2, (undef8 = undef8) /\ (1 <= (0 + undef8)), par{x_1^0 -> (1 + x_1^0)}>

Fresh variables:
undef8, 

Undef variables:
undef8, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l2, l2, undef8 <= 0, {x_1^0 -> -1 + x_1^0, rest remain the same}>
<l2, l2, 1 <= undef8, {x_1^0 -> 1 + x_1^0, rest remain the same}>
Variables:
x_1^0

Precedence: 
Graph 0

Graph 1
<l0, l2, x_1^0 = 2, {all remain the same}>

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

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

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

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001054s

LOG: CALL solveLinear

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

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004801s
Time used: 0.004675
Trying to remove transition: <l2, l2, undef8 <= 0, {x_1^0 -> -1 + x_1^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012019s
Time used: 0.011737
Solving with 2 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.189756s
Time used: 0.189305
Solving with 3 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.015987s
Time used: 0.010753
Termination failed. Trying to show unreachability...
Proving unreachability of entry: <l0, l2, x_1^0 = 2, {all remain the same}>

LOG: CALL check - Post:1 <= 0 - Process 1
* Exit transition: <l0, l2, x_1^0 = 2, {all remain the same}>
* Postcondition  : 1 <= 0

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000798s
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 0.000877s
Cannot prove unreachability

Proving non-termination of subgraph 1
Transitions:
<l2, l2, undef8 <= 0, {x_1^0 -> -1 + x_1^0, rest remain the same}>
<l2, l2, 1 <= undef8, {x_1^0 -> 1 + x_1^0, rest remain the same}>
Variables:
x_1^0

Checking conditional non-termination of SCC {l2}...
> No exit transition to close.
Calling reachability with...
Transition: <l2, end, true, {all remain the same}>
Conditions: 
OPEN EXITS: 
<l2, end, true, {all remain the same}>

--- Reachability graph ---
> Graph without transitions.

Calling reachability with...
Transition: <l0, l2, x_1^0 = 2, {all remain the same}>
Conditions: 
OPEN EXITS: 
<l0, l2, x_1^0 = 2, {all remain the same}>

> Conditions are reachable!

Program does NOT terminate