NO

Solver Timeout: 4
Global Timeout: 60
No parsing errors!
Init Location: 0
Transitions:
<l0, l6, true>
<l1, l2, ((0 + __rho_2^0) <= 0), par{p^0 -> 0}>
<l1, l2, (1 <= (0 + __rho_2^0)), par{p^0 -> 1}>
<l2, l1, (undef12 = undef12), par{__rho_2^0 -> undef12}>
<l3, l4, ((0 + __rho_1^0) <= 0), par{x^0 -> (~(2) + x^0)}>
<l3, l4, (1 <= (0 + __rho_1^0)), par{x^0 -> (~(1) + x^0)}>
<l4, l2, ((0 + x^0) <= 0)>
<l4, l3, (1 <= (0 + x^0)) /\ (undef31 = undef31), par{__rho_1^0 -> undef31}>
<l5, l4, (undef41 = 0) /\ (undef42 = 1), par{p^0 -> 0, start^0 -> 0}>
<l6, l5, true>

Fresh variables:
undef12, undef31, undef41, undef42, 

Undef variables:
undef12, undef31, undef41, undef42, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l4, (undef41 = 0) /\ (undef42 = 1)>
<l2, l2, (undef12 = undef12) /\ ((0 + undef12) <= 0)>
<l2, l2, (undef12 = undef12) /\ (1 <= (0 + undef12))>
<l4, l2, ((0 + x^0) <= 0)>
<l4, l4, (1 <= (0 + x^0)) /\ (undef31 = undef31) /\ ((0 + undef31) <= 0), par{x^0 -> (~(2) + x^0)}>
<l4, l4, (1 <= (0 + x^0)) /\ (undef31 = undef31) /\ (1 <= (0 + undef31)), par{x^0 -> (~(1) + x^0)}>

Fresh variables:
undef12, undef31, undef41, undef42, 

Undef variables:
undef12, undef31, undef41, undef42, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l4, l4, undef31 <= 0 /\ 1 <= x^0, {x^0 -> -2 + x^0, rest remain the same}>
<l4, l4, 1 <= x^0 /\ 1 <= undef31, {x^0 -> -1 + x^0, rest remain the same}>
Variables:
x^0

Graph 2:
Transitions:
<l2, l2, undef12 <= 0, {all remain the same}>
<l2, l2, 1 <= undef12, {all remain the same}>
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l4, undef41 = 0 /\ undef42 = 1, {all remain the same}>

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

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

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

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

Checking conditional termination of SCC {l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001045s
Ranking function: -1 + x^0
New Graphs: 
Proving termination of subgraph 2
Checking unfeasibility...
Time used: 0.001398

> No variable changes in termination graph.
Checking conditional unfeasibility...
Termination failed. Trying to show unreachability...
Proving unreachability of entry: <l4, l2, x^0 <= 0, {all remain the same}>

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

LOG: Try proving POST
Postcondition: 1 <= 0

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

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000396s

LOG: NarrowEntry size 1
Narrowing transition: 
<l4, l4, undef31 <= 0 /\ 1 <= x^0, {x^0 -> -2 + x^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l4, l4, 1 <= x^0 /\ 1 <= undef31, {x^0 -> -1 + x^0, rest remain the same}>

LOG: Narrow transition size 1
ENTRIES:
<l0, l4, 0 <= 0 /\ undef41 = 0 /\ undef42 = 1, {all remain the same}>
END ENTRIES:
GRAPH:
<l4, l4, 0 <= 0 /\ undef31 <= 0 /\ 1 <= x^0, {x^0 -> -2 + x^0, rest remain the same}>
<l4, l4, 0 <= 0 /\ 1 <= x^0 /\ 1 <= undef31, {x^0 -> -1 + x^0, rest remain the same}>
END GRAPH:
EXIT: <l4, l2, x^0 <= 0, {all remain the same}>
POST: 1 <= 0


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

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005838s
Time used: 0.005679
Improving Solution with cost 51 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000288s
Time used: 1.00025

LOG: SAT solveNonLinear - Elapsed time: 1.006126s
Cost: 51; Total time: 1.00592
Failed at location 4: 1 + x^0 <= 0
Before Improving: 
Quasi-invariant at l4: 1 + x^0 <= 0
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003477s
Remaining time after improvement: 0.998716
Some transition disabled by a set of quasi-invariant(s):
Quasi-invariant at l4: 1 + x^0 <= 0

LOG: NEXT CALL check - disable

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

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000594s
Solving with 2 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.021445s
Time used: 0.021245
Improving Solution with cost 51 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000408s
Time used: 1.00038

LOG: SAT solveNonLinear - Elapsed time: 1.021853s
Cost: 51; Total time: 1.02163
Failed at location 4: x^0 <= 0
Before Improving: 
Quasi-invariant at l4: x^0 <= 0
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.011355s
Remaining time after improvement: 0.998648
Some transition disabled by a set of quasi-invariant(s):
Quasi-invariant at l4: x^0 <= 0

LOG: NEXT CALL check - disable

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

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000705s
Solving with 3 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.061652s
Time used: 0.061379
Improving Solution with cost 51 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.939190s
Time used: 0.939152

LOG: SAT solveNonLinear - Elapsed time: 1.000842s
Cost: 51; Total time: 1.00053
Failed at location 4: x^0 <= 0
Before Improving: 
Quasi-invariant at l4: x^0 <= 0
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.014815s
Remaining time after improvement: 0.997756
Some transition disabled by a set of quasi-invariant(s):
Quasi-invariant at l4: x^0 <= 0

LOG: NEXT CALL check - disable

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

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000799s

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

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

Proving non-termination of subgraph 2
Transitions:
<l2, l2, undef12 <= 0, {all remain the same}>
<l2, l2, 1 <= undef12, {all remain the same}>
Variables:

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: <l4, l2, x^0 <= 0, {all remain the same}>
Conditions: 
OPEN EXITS: 
<l4, l2, x^0 <= 0, {all remain the same}>

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

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

> Conditions are reachable!

Program does NOT terminate