NO

Solver Timeout: 4
Global Timeout: 60
No parsing errors!
Init Location: 0
Transitions:
<l0, l9, true>
<l1, l2, true>
<l3, l4, true>
<l5, l6, true>
<l6, l5, true>
<l7, l1, ((0 + ___rho_1_^0) <= 0) /\ ((1 + c^0) <= (0 + curr_serv^0)), par{curr_serv^0 -> (~(2) + curr_serv^0)}>
<l7, l1, (1 <= (0 + ___rho_1_^0)), par{c^0 -> (~(1) + c^0), curr_serv^0 -> (~(2) + curr_serv^0), resp^0 -> (1 + resp^0)}>
<l2, l7, (1 <= (0 + curr_serv^0)) /\ (undef37 = undef37), par{___rho_1_^0 -> undef37}>
<l2, l5, ((0 + curr_serv^0) <= 0)>
<l8, l1, (undef50 = undef50) /\ (undef51 = (0 + undef50)) /\ (1 <= (0 + undef51)) /\ (undef54 = 4), par{___rho_2_^0 -> undef50, c^0 -> undef51, curr_serv^0 -> (0 + undef54), resp^0 -> 0, servers^0 -> undef54}>
<l9, l8, true>

Fresh variables:
undef37, undef50, undef51, undef54, 

Undef variables:
undef37, undef50, undef51, undef54, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l1, (c^0 = undef51) /\ (curr_serv^0 = (0 + undef54)) /\ (resp^0 = 0) /\ (undef50 = undef50) /\ (undef51 = (0 + undef50)) /\ (1 <= (0 + undef51)) /\ (undef54 = 4)>
<l1, l1, (1 <= (0 + curr_serv^0)) /\ (undef37 = undef37) /\ ((0 + undef37) <= 0) /\ ((1 + c^0) <= (0 + curr_serv^0)), par{curr_serv^0 -> (~(2) + curr_serv^0)}>
<l1, l1, (1 <= (0 + curr_serv^0)) /\ (undef37 = undef37) /\ (1 <= (0 + undef37)), par{c^0 -> (~(1) + c^0), curr_serv^0 -> (~(2) + curr_serv^0), resp^0 -> (1 + resp^0)}>
<l1, l5, ((0 + curr_serv^0) <= 0)>
<l5, l5, true>

Fresh variables:
undef37, undef50, undef51, undef54, 

Undef variables:
undef37, undef50, undef51, undef54, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l1, l1, undef37 <= 0 /\ 1 + c^0 <= curr_serv^0 /\ 1 <= curr_serv^0, {curr_serv^0 -> -2 + curr_serv^0, rest remain the same}>
<l1, l1, 1 <= curr_serv^0 /\ 1 <= undef37, {c^0 -> -1 + c^0, curr_serv^0 -> -2 + curr_serv^0, resp^0 -> 1 + resp^0, rest remain the same}>
Variables:
c^0, curr_serv^0, resp^0

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

Precedence: 
Graph 0

Graph 1
<l0, l1, 1 <= undef51 /\ c^0 = undef51 /\ curr_serv^0 = undef54 /\ resp^0 = 0 /\ undef50 = undef51 /\ undef54 = 4, {all remain the same}>

Graph 2
<l1, l5, curr_serv^0 <= 0, {all remain the same}>

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

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

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

Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001576s
Ranking function: -1 - c^0 + curr_serv^0
New Graphs: 
Transitions:
<l1, l1, 1 <= curr_serv^0 /\ 1 <= undef37, {c^0 -> -1 + c^0, curr_serv^0 -> -2 + curr_serv^0, resp^0 -> 1 + resp^0, rest remain the same}>
Variables:
c^0, curr_serv^0, resp^0
Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000732s
Ranking function: (~(1) / 2) + (1 / 2)*curr_serv^0
New Graphs: 
Proving termination of subgraph 2
Checking unfeasibility...
Time used: 0.000847

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

LOG: CALL check - Post:1 <= 0 - Process 1
* Exit transition: <l1, l5, curr_serv^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, l1, 1 <= undef51 /\ c^0 = undef51 /\ curr_serv^0 = undef54 /\ resp^0 = 0 /\ undef50 = undef51 /\ undef54 = 4, {all remain the same}>
* Postcondition  : 1 <= 0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000771s

LOG: NarrowEntry size 1
Narrowing transition: 
<l1, l1, undef37 <= 0 /\ 1 + c^0 <= curr_serv^0 /\ 1 <= curr_serv^0, {curr_serv^0 -> -2 + curr_serv^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l1, l1, 1 <= curr_serv^0 /\ 1 <= undef37, {c^0 -> -1 + c^0, curr_serv^0 -> -2 + curr_serv^0, resp^0 -> 1 + resp^0, rest remain the same}>

LOG: Narrow transition size 1
ENTRIES:
<l0, l1, 0 <= 0 /\ 1 <= undef51 /\ c^0 = undef51 /\ curr_serv^0 = undef54 /\ resp^0 = 0 /\ undef50 = undef51 /\ undef54 = 4, {all remain the same}>
END ENTRIES:
GRAPH:
<l1, l1, 0 <= 0 /\ undef37 <= 0 /\ 1 + c^0 <= curr_serv^0 /\ 1 <= curr_serv^0, {curr_serv^0 -> -2 + curr_serv^0, rest remain the same}>
<l1, l1, 0 <= 0 /\ 1 <= curr_serv^0 /\ 1 <= undef37, {c^0 -> -1 + c^0, curr_serv^0 -> -2 + curr_serv^0, resp^0 -> 1 + resp^0, rest remain the same}>
END GRAPH:
EXIT: <l1, l5, curr_serv^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.012886s
Time used: 0.012693
Improving Solution with cost 51 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.049154s
Time used: 0.049145

LOG: SAT solveNonLinear - Elapsed time: 0.062040s
Cost: 51; Total time: 0.061838
Failed at location 1: curr_serv^0 <= c^0
Before Improving: 
Quasi-invariant at l1: curr_serv^0 <= c^0
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002800s
Remaining time after improvement: 0.998817
Some transition disabled by a set of quasi-invariant(s):
Quasi-invariant at l1: curr_serv^0 <= c^0

LOG: NEXT CALL check - disable

LOG: CALL check - Post:curr_serv^0 <= c^0 - Process 3
* Exit transition: <l0, l1, 0 <= 0 /\ 1 <= undef51 /\ c^0 = undef51 /\ curr_serv^0 = undef54 /\ resp^0 = 0 /\ undef50 = undef51 /\ undef54 = 4, {all remain the same}>
* Postcondition  : curr_serv^0 <= c^0

LOG: CALL solveLinear

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

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000523s
Time used: 1.00027

LOG: SAT solveNonLinear - Elapsed time: 1.079983s
Cost: 51; Total time: 1.07942
Failed at location 1: 1 + curr_serv^0 <= c^0
Before Improving: 
Quasi-invariant at l1: 1 + curr_serv^0 <= c^0
Quasi-invariant at l1: 1 <= c^0 + resp^0
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.009719s
Remaining time after improvement: 0.998096
Some transition disabled by a set of quasi-invariant(s):
Quasi-invariant at l1: 1 + curr_serv^0 <= c^0
Quasi-invariant at l1: 1 <= c^0 + resp^0

LOG: NEXT CALL check - disable

LOG: CALL check - Post:1 + curr_serv^0 <= c^0 - Process 4
* Exit transition: <l0, l1, 0 <= 0 /\ 1 <= undef51 /\ c^0 = undef51 /\ curr_serv^0 = undef54 /\ resp^0 = 0 /\ undef50 = undef51 /\ undef54 = 4, {all remain the same}>
* Postcondition  : 1 + curr_serv^0 <= c^0

LOG: CALL solveLinear

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

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.441340s
Time used: 0.441304

LOG: SAT solveNonLinear - Elapsed time: 1.001430s
Cost: 51; Total time: 1.00095
Failed at location 1: 1 + curr_serv^0 <= c^0
Before Improving: 
Quasi-invariant at l1: 1 <= c^0 + resp^0
Quasi-invariant at l1: 1 <= c^0 + resp^0
Quasi-invariant at l1: 1 + curr_serv^0 <= c^0
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.051920s
Remaining time after improvement: 0.997332
Some transition disabled by a set of quasi-invariant(s):
Quasi-invariant at l1: 1 <= c^0 + resp^0
Quasi-invariant at l1: 1 <= c^0 + resp^0
Quasi-invariant at l1: 1 + curr_serv^0 <= c^0

LOG: NEXT CALL check - disable

LOG: CALL check - Post:1 + curr_serv^0 <= c^0 - Process 5
* Exit transition: <l0, l1, 0 <= 0 /\ 1 <= undef51 /\ c^0 = undef51 /\ curr_serv^0 = undef54 /\ resp^0 = 0 /\ undef50 = undef51 /\ undef54 = 4, {all remain the same}>
* Postcondition  : 1 + curr_serv^0 <= c^0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.001613s

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

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

Proving non-termination of subgraph 2
Transitions:
<l5, l5, true, {all remain the same}>
Variables:

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

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

Calling reachability with...
Transition: <l1, l5, curr_serv^0 <= 0, {all remain the same}>
Conditions: 
OPEN EXITS: 
<l1, l5, curr_serv^0 <= 0, {all remain the same}>

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

Calling reachability with...
Transition: <l0, l1, 1 <= undef51 /\ c^0 = undef51 /\ curr_serv^0 = undef54 /\ resp^0 = 0 /\ undef50 = undef51 /\ undef54 = 4, {all remain the same}>
Conditions: curr_serv^0 <= 0, 
OPEN EXITS: 

> Conditions are not feasible after transitions.
--- Reachability graph ---
Transitions:
<l1, l1, undef37 <= 0 /\ 1 + c^0 <= curr_serv^0 /\ 1 <= curr_serv^0, {curr_serv^0 -> -2 + curr_serv^0, rest remain the same}>
Variables:
c^0, curr_serv^0
Checking edge-closing of SCC {l1}...
EXIT TRANSITIONS (TO CLOSE):
<l1, end, curr_serv^0 <= c^0 /\ 1 <= curr_serv^0, {all remain the same}>

Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.004744s
Time used: 5.00064
> No quasi-invariants that block all exits have been found.
--- Reachability graph ---
Transitions:
<l1, l1, 1 <= curr_serv^0 /\ 1 <= undef37, {c^0 -> -1 + c^0, curr_serv^0 -> -2 + curr_serv^0, resp^0 -> 1 + resp^0, rest remain the same}>
Variables:
c^0, curr_serv^0, resp^0
Checking edge-closing of SCC {l1}...
> No exit transition to close.
Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001042s
Ranking function: (~(1) / 2) + (1 / 2)*curr_serv^0
New Graphs: 
Calling reachability with...
Transition: <l0, l1, 1 <= undef51 /\ c^0 = undef51 /\ curr_serv^0 = undef54 /\ resp^0 = 0 /\ undef50 = undef51 /\ undef54 = 4, {all remain the same}>
Conditions: 
OPEN EXITS: 
<l0, l1, 1 <= undef51 /\ c^0 = undef51 /\ curr_serv^0 = undef54 /\ resp^0 = 0 /\ undef50 = undef51 /\ undef54 = 4, {all remain the same}>

> Conditions are reachable!

Program does NOT terminate