NO

Solver Timeout: 4
Global Timeout: 60
No parsing errors!
Init Location: 0
Transitions:
<l0, l14, true>
<l1, l2, true>
<l2, l3, (((0 + (~(1) * x_5^0)) + y_6^0) <= 0) /\ (((0 + (~(1) * x_5^0)) + y_6^0) <= 0)>
<l3, l4, (undef16 = __disjvr_0^0) /\ (__disjvr_0^0 = undef16), par{__disjvr_0^0 -> undef16}>
<l4, l5, (undef22 = undef22), par{Result_4^0 -> undef22}>
<l2, l6, (((0 + (~(1) * x_5^0)) + y_6^0) <= 0) /\ (((0 + (~(1) * x_5^0)) + y_6^0) <= 0) /\ ((0 + x_5^0) <= (0 + y_6^0)) /\ ((0 + y_6^0) <= (0 + x_5^0)) /\ (undef33 = undef33) /\ ((0 + undef33) <= 0) /\ (0 <= (0 + undef33)), par{tmp_7^0 -> undef33}>
<l6, l2, true>
<l2, l7, (((0 + (~(1) * x_5^0)) + y_6^0) <= 0) /\ (((0 + (~(1) * x_5^0)) + y_6^0) <= 0) /\ ((0 + x_5^0) <= (0 + y_6^0)) /\ ((0 + y_6^0) <= (0 + x_5^0)) /\ (undef47 = undef47), par{tmp_7^0 -> undef47}>
<l7, l8, (undef52 = __disjvr_1^0) /\ (__disjvr_1^0 = undef52), par{__disjvr_1^0 -> undef52}>
<l8, l9, true, par{x_5^0 -> (1 + x_5^0)}>
<l9, l2, true>
<l2, l10, (0 <= ((~(1) + (~(1) * x_5^0)) + y_6^0)) /\ (undef75 = undef75) /\ ((0 + undef75) <= 0) /\ (0 <= (0 + undef75)), par{tmp_7^0 -> undef75}>
<l10, l2, true>
<l2, l11, (0 <= ((~(1) + (~(1) * x_5^0)) + y_6^0)) /\ (undef89 = undef89), par{tmp_7^0 -> undef89}>
<l11, l12, (undef95 = __disjvr_2^0) /\ (__disjvr_2^0 = undef95), par{__disjvr_2^0 -> undef95}>
<l12, l13, true, par{x_5^0 -> (1 + x_5^0)}>
<l13, l2, true>
<l14, l1, true>

Fresh variables:
undef16, undef22, undef33, undef47, undef52, undef75, undef89, undef95, 

Undef variables:
undef16, undef22, undef33, undef47, undef52, undef75, undef89, undef95, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, true>
<l2, l5, (((0 + (~(1) * x_5^0)) + y_6^0) <= 0) /\ (((0 + (~(1) * x_5^0)) + y_6^0) <= 0) /\ (undef16 = __disjvr_0^0) /\ (__disjvr_0^0 = undef16) /\ (undef22 = undef22), par{__disjvr_0^0 -> undef16}>
<l2, l2, (((0 + (~(1) * x_5^0)) + y_6^0) <= 0) /\ (((0 + (~(1) * x_5^0)) + y_6^0) <= 0) /\ ((0 + x_5^0) <= (0 + y_6^0)) /\ ((0 + y_6^0) <= (0 + x_5^0)) /\ (undef33 = undef33) /\ ((0 + undef33) <= 0) /\ (0 <= (0 + undef33))>
<l2, l2, (((0 + (~(1) * x_5^0)) + y_6^0) <= 0) /\ (((0 + (~(1) * x_5^0)) + y_6^0) <= 0) /\ ((0 + x_5^0) <= (0 + y_6^0)) /\ ((0 + y_6^0) <= (0 + x_5^0)) /\ (undef47 = undef47) /\ (undef52 = __disjvr_1^0) /\ (__disjvr_1^0 = undef52), par{__disjvr_1^0 -> undef52, x_5^0 -> (1 + x_5^0)}>
<l2, l2, (0 <= ((~(1) + (~(1) * x_5^0)) + y_6^0)) /\ (undef75 = undef75) /\ ((0 + undef75) <= 0) /\ (0 <= (0 + undef75))>
<l2, l2, (0 <= ((~(1) + (~(1) * x_5^0)) + y_6^0)) /\ (undef89 = undef89) /\ (undef95 = __disjvr_2^0) /\ (__disjvr_2^0 = undef95), par{__disjvr_2^0 -> undef95, x_5^0 -> (1 + x_5^0)}>

Fresh variables:
undef16, undef22, undef33, undef47, undef52, undef75, undef89, undef95, 

Undef variables:
undef16, undef22, undef33, undef47, undef52, undef75, undef89, undef95, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l2, l2, x_5^0 = y_6^0 /\ undef33 = 0, {all remain the same}>
<l2, l2, __disjvr_1^0 = undef52 /\ x_5^0 = y_6^0, {__disjvr_1^0 -> undef52, x_5^0 -> 1 + x_5^0, rest remain the same}>
<l2, l2, 1 + x_5^0 <= y_6^0 /\ undef75 = 0, {all remain the same}>
<l2, l2, 1 + x_5^0 <= y_6^0 /\ __disjvr_2^0 = undef95, {__disjvr_2^0 -> undef95, x_5^0 -> 1 + x_5^0, rest remain the same}>
Variables:
x_5^0, y_6^0, __disjvr_1^0, __disjvr_2^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l2, true, {all remain the same}>

Graph 2
<l2, l5, y_6^0 <= x_5^0 /\ __disjvr_0^0 = undef16, {__disjvr_0^0 -> undef16, rest remain the same}>

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

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

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

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001863s
Ranking function: -1 - x_5^0 + y_6^0
New Graphs: 
Transitions:
<l2, l2, x_5^0 = y_6^0 /\ undef33 = 0, {all remain the same}>
<l2, l2, __disjvr_1^0 = undef52 /\ x_5^0 = y_6^0, {__disjvr_1^0 -> undef52, x_5^0 -> 1 + x_5^0, rest remain the same}>
<l2, l2, 1 + x_5^0 <= y_6^0 /\ undef75 = 0, {all remain the same}>
Variables:
__disjvr_1^0, x_5^0, y_6^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000707s
Ranking function: -x_5^0 + y_6^0
New Graphs: 
Transitions:
<l2, l2, x_5^0 = y_6^0 /\ undef33 = 0, {all remain the same}>
<l2, l2, 1 + x_5^0 <= y_6^0 /\ undef75 = 0, {all remain the same}>
Variables:
x_5^0, y_6^0
> No variable changes in termination graph.
Checking conditional unfeasibility...
Termination failed. Trying to show unreachability...
Proving unreachability of entry: <l0, l2, true, {all remain the same}>

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

LOG: CALL solveLinear

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

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

Proving non-termination of subgraph 1
Transitions:
<l2, l2, x_5^0 = y_6^0 /\ undef33 = 0, {all remain the same}>
<l2, l2, __disjvr_1^0 = undef52 /\ x_5^0 = y_6^0, {__disjvr_1^0 -> undef52, x_5^0 -> 1 + x_5^0, rest remain the same}>
<l2, l2, 1 + x_5^0 <= y_6^0 /\ undef75 = 0, {all remain the same}>
<l2, l2, 1 + x_5^0 <= y_6^0 /\ __disjvr_2^0 = undef95, {__disjvr_2^0 -> undef95, x_5^0 -> 1 + x_5^0, rest remain the same}>
Variables:
x_5^0, y_6^0, __disjvr_1^0, __disjvr_2^0

Checking that every undef value has an assignment...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001360s
Checking conditional non-termination of SCC {l2}...
EXIT TRANSITIONS:
<l2, end, 1 + y_6^0 <= x_5^0, {all remain the same}>

Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.169033s
Time used: 5.00583
> Checking if the negation of the conditions of every pending exit is quasi-invariant... NO

Proving non-termination of subgraph 1
Transitions:
<l2, l2, x_5^0 = y_6^0 /\ undef33 = 0, {all remain the same}>
<l2, l2, 1 + x_5^0 <= y_6^0 /\ undef75 = 0, {all remain the same}>
Variables:
x_5^0, y_6^0

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

Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.030611s
Time used: 0.03013

LOG: SAT solveNonLinear - Elapsed time: 0.046957s
Cost: 1; Total time: 0.046263
Failed at location 2: x_5^0 <= y_6^0
Before Improving: 
Quasi-invariant at l2: x_5^0 <= y_6^0
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.010723s
Remaining time after improvement: 0.99808
Minimizing number of undef constraints...

LOG: CALL solveNonLinear

LOG: RETURN solveNonLinear - Elapsed time: 0.003212s
Number of undef constraints reduced!

Non-termination implied by a set of quasi-invariant(s):
Quasi-invariant at l2: x_5^0 <= y_6^0

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

Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, x_5^0 = y_6^0 /\ undef33 = 0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 1 + x_5^0 <= y_6^0 /\ undef75 = 0, {all remain the same}>

Calling reachability with...
Transition: <l2, end, true, {all remain the same}>
Conditions: x_5^0 <= y_6^0, 
OPEN EXITS: 
<l2, end, x_5^0 <= y_6^0, {all remain the same}>

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

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

> Conditions are reachable!

Program does NOT terminate