NO

Solver Timeout: 4
Global Timeout: 60
No parsing errors!
Init Location: 0
Transitions:
<l0, l10, true>
<l1, l2, true>
<l3, l4, true>
<l5, l6, true>
<l7, l8, true>
<l8, l7, true>
<l4, l3, (1 <= (0 + n^0))>
<l4, l1, ((0 + n^0) <= 0) /\ (undef36 = 1) /\ (undef33 = undef33), par{R^0 -> 0, ___rho_1_^0 -> undef33, dobreak^0 -> (0 + undef33)}>
<l2, l3, ((0 + dobreak^0) <= 0) /\ (undef42 = 1) /\ (undef41 = undef41) /\ (1 <= (0 + undef41)), par{A^0 -> 0, n^0 -> undef41}>
<l2, l7, (1 <= (0 + dobreak^0))>
<l9, l1, (undef50 = undef50), par{A^0 -> 0, R^0 -> 0, ___rho_1_^0 -> undef50, dobreak^0 -> (0 + undef50)}>
<l10, l9, true>

Fresh variables:
undef33, undef36, undef41, undef42, undef50, 

Undef variables:
undef33, undef36, undef41, undef42, undef50, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l3, (undef50 = undef50) /\ ((0 + (0 + undef50)) <= 0) /\ (undef42 = 1) /\ (undef41 = undef41) /\ (1 <= (0 + undef41)), par{n^0 -> undef41}>
<l0, l7, (undef50 = undef50) /\ (1 <= (0 + (0 + undef50)))>
<l3, l3, (1 <= (0 + n^0))>
<l3, l3, ((0 + n^0) <= 0) /\ (undef36 = 1) /\ (undef33 = undef33) /\ ((0 + (0 + undef33)) <= 0) /\ (undef42 = 1) /\ (undef41 = undef41) /\ (1 <= (0 + undef41)), par{n^0 -> undef41}>
<l3, l7, ((0 + n^0) <= 0) /\ (undef36 = 1) /\ (undef33 = undef33) /\ (1 <= (0 + (0 + undef33)))>
<l7, l7, true>

Fresh variables:
undef33, undef36, undef41, undef42, undef50, 

Undef variables:
undef33, undef36, undef41, undef42, undef50, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l3, l3, 1 <= n^0, {all remain the same}>
<l3, l3, 1 <= undef41 /\ n^0 <= 0 /\ undef33 <= 0 /\ undef36 = 1 /\ undef42 = 1, {n^0 -> undef41, rest remain the same}>
Variables:
n^0

Graph 2:
Transitions:
<l7, l7, true, {all remain the same}>
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l3, 1 <= undef41 /\ undef50 <= 0 /\ undef42 = 1, {n^0 -> undef41, rest remain the same}>

Graph 2
<l0, l7, 1 <= undef50, {all remain the same}>
<l3, l7, 1 <= undef33 /\ n^0 <= 0 /\ undef36 = 1, {all remain the same}>

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

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

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

Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l3, l3, 1 <= undef41 /\ n^0 <= 0 /\ undef33 <= 0 /\ undef36 = 1 /\ undef42 = 1, {n^0 -> undef41, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l3, 1 <= n^0, {all remain the same}>
Checking unfeasibility...
Time used: 0.001382

> No variable changes in termination graph.
Checking conditional unfeasibility...
Calling Safety with literal n^0 <= 0 and entry <l3, l3, true, {all remain the same}>

LOG: CALL check - Post:n^0 <= 0 - Process 1
* Exit transition: <l3, l3, true, {all remain the same}>
* Postcondition  : n^0 <= 0
Postcodition moved up: n^0 <= 0

LOG: Try proving POST
Postcondition: n^0 <= 0

LOG: CALL check - Post:n^0 <= 0 - Process 2
* Exit transition: <l0, l3, 1 <= undef41 /\ undef50 <= 0 /\ undef42 = 1, {n^0 -> undef41, rest remain the same}>
* Postcondition  : n^0 <= 0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000451s

LOG: NarrowEntry size 1
Narrowing transition: 
<l3, l3, 1 <= n^0, {all remain the same}>

LOG: Narrow transition size 1
ENTRIES:
<l0, l3, 1 <= undef41 /\ undef50 <= 0 /\ undef42 = 1, {n^0 -> undef41, rest remain the same}>
END ENTRIES:
GRAPH:
<l3, l3, 1 <= n^0, {all remain the same}>
END GRAPH:
EXIT: <l3, l3, true, {all remain the same}>
POST: n^0 <= 0


LOG: Try proving POST
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.020438s
Time used: 1.00039

LOG: Postcondition is not implied - no solution
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 5.048901s

Proving non-termination of subgraph 1
Transitions:
<l3, l3, 1 <= n^0, {all remain the same}>
Variables:
n^0

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

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

Calling reachability with...
Transition: <l0, l3, 1 <= undef41 /\ undef50 <= 0 /\ undef42 = 1, {n^0 -> undef41, rest remain the same}>
Conditions: 
OPEN EXITS: 
<l0, l3, 1 <= undef41 /\ undef50 <= 0 /\ undef42 = 1, {n^0 -> undef41, rest remain the same}>

> Conditions are reachable!

Program does NOT terminate