NO

Solver Timeout: 4
Global Timeout: 300
No parsing errors!
Init Location: 0
Transitions:
<l0, l5, true>
<l1, l2, ((1 + x^0) <= 0)>
<l1, l3, (0 <= (0 + x^0)), par{x^0 -> ((0 + x^0) + (~(1) * y^0))}>
<l3, l1, true>
<l4, l1, (((1 + x^0) + y^0) <= 0) /\ (1 <= (0 + x^0))>
<l5, l4, true>

Fresh variables:

Undef variables:

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l1, (((1 + x^0) + y^0) <= 0) /\ (1 <= (0 + x^0))>
<l1, l2, ((1 + x^0) <= 0)>
<l1, l1, (0 <= (0 + x^0)), par{x^0 -> ((0 + x^0) + (~(1) * y^0))}>

Fresh variables:

Undef variables:

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l1, l1, 0 <= x^0, {x^0 -> x^0 - y^0, rest remain the same}>
Variables:
x^0, y^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l1, 1 + x^0 + y^0 <= 0 /\ 1 <= x^0, {all remain the same}>

Graph 2
<l1, l2, 1 + x^0 <= 0, {all remain the same}>

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

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

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

Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000728s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001217s
Trying to remove transition: <l1, l1, 0 <= x^0, {x^0 -> x^0 - y^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.006662s
Time used: 0.006661

LOG: SAT solveNonLinear - Elapsed time: 0.011507s
Cost: 1; Total time: 0.009617
Termination implied by a set of invariant(s):
Invariant at l1: 1 + y^0 <= 0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l1, l1, 1 + y^0 <= 0 /\ 0 <= x^0, {x^0 -> x^0 - y^0, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l1, l1, 1 + y^0 <= 0 /\ 0 <= x^0, {x^0 -> x^0 - y^0, rest remain the same}>
Quasi-ranking function: 50000 - x^0 - y^0
New Graphs: 
Transitions:
<l1, l1, 1 + y^0 <= 0 /\ 0 <= x^0 /\ 50001 <= x^0 + y^0, {x^0 -> x^0 - y^0, rest remain the same}>
Variables:
x^0, y^0
Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000285s

LOG: CALL solveLinear

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.009906s
Time used: 0.009904

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000308s

LOG: CALL solveLinear

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.009439s
Time used: 0.009436

LOG: SAT solveNonLinear - Elapsed time: 0.016362s
Cost: 1; Total time: 0.014231
Termination implied by a set of invariant(s):
Invariant at l1: y^0 <= 1
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l1, l1, 1 + y^0 <= 0 /\ 0 <= x^0, {x^0 -> x^0 - y^0, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l1, l1, 1 + y^0 <= 0 /\ 50001 <= x^0 /\ 50001 <= x^0 + y^0, {x^0 -> x^0 - y^0, rest remain the same}>
Quasi-ranking function: 50000 - x^0 + y^0
New Graphs: 
Transitions:
<l1, l1, 1 + y^0 <= 0 /\ 50001 <= x^0 /\ 50001 + y^0 <= x^0 /\ 50001 <= x^0 + y^0, {x^0 -> x^0 - y^0, rest remain the same}>
Variables:
x^0, y^0
Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000349s

LOG: CALL solveLinear

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007706s
Time used: 0.005423
Termination failed. Trying to show unreachability...
Proving unreachability of entry: <l0, l1, 1 + x^0 + y^0 <= 0 /\ 1 <= x^0, {all remain the same}>

LOG: CALL check - Post:1 <= 0 - Process 1
* Exit transition: <l0, l1, 1 + x^0 + y^0 <= 0 /\ 1 <= x^0, {all remain the same}>
* Postcondition  : 1 <= 0

LOG: CALL solveLinear

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

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

Proving non-termination of subgraph 1
Transitions:
<l1, l1, 0 <= x^0, {x^0 -> x^0 - y^0, rest remain the same}>
Variables:
x^0, y^0

Checking conditional non-termination of SCC {l1}...
EXIT TRANSITIONS:
<l1, end, 1 + x^0 <= 0, {all remain the same}>

Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005921s
Time used: 0.0058

LOG: SAT solveNonLinear - Elapsed time: 0.005921s
Cost: 0; Total time: 0.0058
Non-termination implied by a set of quasi-invariant(s):
Quasi-invariant at l1: y^0 <= 0
Quasi-invariant at l1: 0 <= x^0

Strengthening and disabling EXIT transitions...
Closed exits from l1: 1

Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l1, l1, 0 <= x^0 /\ y^0 <= 0, {x^0 -> x^0 - y^0, rest remain the same}>

Calling reachability with...
Transition: <l1, end, true, {all remain the same}>
Conditions: y^0 <= 0, 0 <= x^0, 
OPEN EXITS: 
<l1, end, 0 <= x^0, {all remain the same}> (condsUp: y^0 <= 0)

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

Calling reachability with...
Transition: <l0, l1, 1 + x^0 + y^0 <= 0 /\ 1 <= x^0, {all remain the same}>
Conditions: 0 <= x^0, y^0 <= 0, 
OPEN EXITS: 
<l0, l1, 1 + x^0 + y^0 <= 0 /\ 1 <= x^0 /\ y^0 <= 0, {all remain the same}>

> Conditions are reachable!

Program does NOT terminate