NO

Solver Timeout: 4
Global Timeout: 60
No parsing errors!
Init Location: 0
Transitions:
<l0, l7, true>
<l1, l2, (1 <= (0 + rhop^0)), par{xp^0 -> (1 + xp^0)}>
<l1, l2, ((0 + rhop^0) <= 0), par{xp^0 -> (~(1) + xp^0)}>
<l3, l4, ((0 + retpp^0) <= 0), par{retp^0 -> 0}>
<l3, l4, true, par{retp^0 -> 1}>
<l3, l1, (undef28 = undef28) /\ (1 <= (0 + undef28)), par{rhop^0 -> undef28}>
<l2, l3, ((0 + xp^0) <= 1), par{retpp^0 -> 0}>
<l2, l3, (2 <= (0 + xp^0)), par{retpp^0 -> 1}>
<l5, l2, (undef47 = 2), par{rhop^0 -> (0 + rho^0), x^0 -> undef47, xp^0 -> (0 + undef47)}>
<l4, l6, ((0 + retp^0) <= 0)>
<l7, l5, true>

Fresh variables:
undef28, undef47, 

Undef variables:
undef28, undef47, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, (xp^0 = (0 + undef47)) /\ (undef47 = 2)>
<l2, l6, ((0 + xp^0) <= 1) /\ ((0 + 0) <= 0) /\ ((0 + 0) <= 0)>
<l2, l2, ((0 + xp^0) <= 1) /\ (undef28 = undef28) /\ (1 <= (0 + undef28)) /\ (1 <= (0 + undef28)), par{xp^0 -> (1 + xp^0)}>
<l2, l2, (2 <= (0 + xp^0)) /\ (undef28 = undef28) /\ (1 <= (0 + undef28)) /\ (1 <= (0 + undef28)), par{xp^0 -> (1 + xp^0)}>

Fresh variables:
undef28, undef47, 

Undef variables:
undef28, undef47, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

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

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l2, xp^0 = undef47 /\ undef47 = 2, {all remain the same}>

Graph 2
<l2, l6, xp^0 <= 1, {all 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.005959
Some transition disabled by a set of invariant(s):
Invariant at l2: 2 <= xp^0

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

LOG: CALL solverLinear in Graph for feasibility

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

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000527s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001546s
Trying to remove transition: <l2, l2, 1 <= undef28 /\ 2 <= xp^0, {xp^0 -> 1 + xp^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009200s
Time used: 0.005319
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000693s
Time used: 1.00066

LOG: SAT solveNonLinear - Elapsed time: 1.009894s
Cost: 1; Total time: 1.00598
Quasi-ranking function: 50000 - xp^0
New Graphs: 
Transitions:
<l2, l2, 1 <= undef28 /\ 50001 <= xp^0, {xp^0 -> 1 + xp^0, rest remain the same}>
Variables:
xp^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000518s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001761s
Trying to remove transition: <l2, l2, 1 <= undef28 /\ 50001 <= xp^0, {xp^0 -> 1 + xp^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.023019s
Time used: 4.01896
Termination failed. Trying to show unreachability...
Proving unreachability of entry: <l0, l2, xp^0 = undef47 /\ undef47 = 2, {all remain the same}>

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

LOG: CALL solveLinear

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

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

Proving non-termination of subgraph 1
Transitions:
<l2, l2, 1 <= undef28 /\ 2 <= xp^0, {xp^0 -> 1 + xp^0, rest remain the same}>
Variables:
xp^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, xp^0 = undef47 /\ undef47 = 2, {all remain the same}>
Conditions: 
OPEN EXITS: 
<l0, l2, xp^0 = undef47 /\ undef47 = 2, {all remain the same}>

> Conditions are reachable!

Program does NOT terminate