/export/starexec/sandbox/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox/benchmark/theBenchmark.smt2 /export/starexec/sandbox/output/output_files


--------------------------------------------------------------------------------


NO

Solver Timeout: 4
Global Timeout: 300
Maximum number of concurrent processes: 900
No parsing errors!
Init Location: 0
Transitions:
<l0, l7, true>
<l1, l2, ((0 + conditional^0) <= 1) /\ (undef10 = undef10), par{conditional^0 -> undef10}>
<l1, l2, (2 <= (0 + conditional^0)) /\ (undef15 = undef15) /\ (1 <= (0 + undef15)) /\ (undef23 = undef23), par{INCREASE^0 -> undef15, conditional^0 -> undef23, j_min^0 -> ((0 + undef15) + j_min^0)}>
<l3, l1, ((0 + conditional^0) <= 1) /\ (undef36 = undef36), par{P^0 -> 1, conditional^0 -> undef36}>
<l3, l2, (2 <= (0 + conditional^0)) /\ (undef41 = undef41) /\ (undef46 = ((0 + (~(1) * MIN^0)) + num^0)) /\ ((0 + num^0) <= (0 + undef41)) /\ ((0 + undef41) <= ((0 + MAX^0) + (~(1) * MIN^0))) /\ ((0 + undef41) <= (0 + undef46)) /\ (undef50 = undef50) /\ (1 <= (0 + undef50)) /\ (undef49 = undef49), par{INCREASE^0 -> undef41, MAX_MIN^0 -> ((0 + MAX^0) + (~(1) * MIN^0)), MIN^0 -> ((0 + undef41) + MIN^0), NUM_MIN^0 -> undef46, Q^0 -> 1, conditional^0 -> undef49, j_min^0 -> undef50}>
<l4, l3, ((0 + conditional^0) <= 1) /\ (undef62 = undef62), par{conditional^0 -> undef62}>
<l4, l3, (2 <= (0 + conditional^0)) /\ (undef67 = undef67) /\ (1 <= (0 + undef67)) /\ (undef75 = undef75), par{INCREASE^0 -> undef67, MAX^0 -> ((0 + undef67) + MAX^0), conditional^0 -> undef75}>
<l2, l4, ((0 + MIN^0) <= (0 + num^0)) /\ ((1 + j_min^0) <= (0 + pid^0)) /\ (undef88 = undef88), par{conditional^0 -> undef88}>
<l2, l5, ((0 + pid^0) <= (0 + j_min^0)), par{CRITICAL^0 -> 1, P^0 -> 0, Q^0 -> 0}>
<l2, l5, ((1 + num^0) <= (0 + MIN^0)), par{CRITICAL^0 -> 1, P^0 -> 0, Q^0 -> 0}>
<l5, l2, true, par{CRITICAL^0 -> 0, MAX^0 -> (1 + MAX^0), NONCRITICAL^0 -> 1, num^0 -> (1 + MAX^0)}>
<l6, l5, (undef143 = undef143) /\ (1 <= (0 + undef143)) /\ (undef141 = undef141) /\ (1 <= (0 + undef141)) /\ (undef135 = undef135) /\ (1 <= (0 + undef135)) /\ (undef133 = undef133) /\ ((0 + undef135) <= (0 + undef133)), par{CRITICAL^0 -> 0, MAX^0 -> undef133, MIN^0 -> undef135, NONCRITICAL^0 -> 1, P^0 -> 0, Q^0 -> 0, j_min^0 -> undef141, pid^0 -> undef143}>
<l7, l6, true>

Fresh variables:
undef10, undef15, undef23, undef36, undef41, undef46, undef49, undef50, undef62, undef67, undef75, undef88, undef133, undef135, undef141, undef143, 

Undef variables:
undef10, undef15, undef23, undef36, undef41, undef46, undef49, undef50, undef62, undef67, undef75, undef88, undef133, undef135, undef141, undef143, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, (MAX^0 = (1 + undef133)) /\ (MIN^0 = undef135) /\ (j_min^0 = undef141) /\ (num^0 = (1 + undef133)) /\ (pid^0 = undef143) /\ (undef143 = undef143) /\ (1 <= (0 + undef143)) /\ (undef141 = undef141) /\ (1 <= (0 + undef141)) /\ (undef135 = undef135) /\ (1 <= (0 + undef135)) /\ (undef133 = undef133) /\ ((0 + undef135) <= (0 + undef133))>
<l2, l2, ((0 + MIN^0) <= (0 + num^0)) /\ ((1 + j_min^0) <= (0 + pid^0)) /\ (undef88 = undef88) /\ ((0 + undef88) <= 1) /\ (undef62 = undef62) /\ ((0 + undef62) <= 1) /\ (undef36 = undef36) /\ ((0 + undef36) <= 1) /\ (undef10 = undef10)>
<l2, l2, ((0 + MIN^0) <= (0 + num^0)) /\ ((1 + j_min^0) <= (0 + pid^0)) /\ (undef88 = undef88) /\ ((0 + undef88) <= 1) /\ (undef62 = undef62) /\ ((0 + undef62) <= 1) /\ (undef36 = undef36) /\ (2 <= (0 + undef36)) /\ (undef15 = undef15) /\ (1 <= (0 + undef15)) /\ (undef23 = undef23), par{j_min^0 -> ((0 + undef15) + j_min^0)}>
<l2, l2, ((0 + MIN^0) <= (0 + num^0)) /\ ((1 + j_min^0) <= (0 + pid^0)) /\ (undef88 = undef88) /\ ((0 + undef88) <= 1) /\ (undef62 = undef62) /\ (2 <= (0 + undef62)) /\ (undef41 = undef41) /\ (undef46 = ((0 + (~(1) * MIN^0)) + num^0)) /\ ((0 + num^0) <= (0 + undef41)) /\ ((0 + undef41) <= ((0 + MAX^0) + (~(1) * MIN^0))) /\ ((0 + undef41) <= (0 + undef46)) /\ (undef50 = undef50) /\ (1 <= (0 + undef50)) /\ (undef49 = undef49), par{MIN^0 -> ((0 + undef41) + MIN^0), j_min^0 -> undef50}>
<l2, l2, ((0 + MIN^0) <= (0 + num^0)) /\ ((1 + j_min^0) <= (0 + pid^0)) /\ (undef88 = undef88) /\ (2 <= (0 + undef88)) /\ (undef67 = undef67) /\ (1 <= (0 + undef67)) /\ (undef75 = undef75) /\ ((0 + undef75) <= 1) /\ (undef36 = undef36) /\ ((0 + undef36) <= 1) /\ (undef10 = undef10), par{MAX^0 -> ((0 + undef67) + MAX^0)}>
<l2, l2, ((0 + MIN^0) <= (0 + num^0)) /\ ((1 + j_min^0) <= (0 + pid^0)) /\ (undef88 = undef88) /\ (2 <= (0 + undef88)) /\ (undef67 = undef67) /\ (1 <= (0 + undef67)) /\ (undef75 = undef75) /\ ((0 + undef75) <= 1) /\ (undef36 = undef36) /\ (2 <= (0 + undef36)) /\ (undef15 = undef15) /\ (1 <= (0 + undef15)) /\ (undef23 = undef23), par{MAX^0 -> ((0 + undef67) + MAX^0), j_min^0 -> ((0 + undef15) + j_min^0)}>
<l2, l2, ((0 + MIN^0) <= (0 + num^0)) /\ ((1 + j_min^0) <= (0 + pid^0)) /\ (undef88 = undef88) /\ (2 <= (0 + undef88)) /\ (undef67 = undef67) /\ (1 <= (0 + undef67)) /\ (undef75 = undef75) /\ (2 <= (0 + undef75)) /\ (undef41 = undef41) /\ (undef46 = ((0 + (~(1) * MIN^0)) + num^0)) /\ ((0 + num^0) <= (0 + undef41)) /\ ((0 + undef41) <= ((0 + ((0 + undef67) + MAX^0)) + (~(1) * MIN^0))) /\ ((0 + undef41) <= (0 + undef46)) /\ (undef50 = undef50) /\ (1 <= (0 + undef50)) /\ (undef49 = undef49), par{MAX^0 -> ((0 + undef67) + MAX^0), MIN^0 -> ((0 + undef41) + MIN^0), j_min^0 -> undef50}>
<l2, l2, ((0 + pid^0) <= (0 + j_min^0)), par{MAX^0 -> (1 + MAX^0), num^0 -> (1 + MAX^0)}>
<l2, l2, ((1 + num^0) <= (0 + MIN^0)), par{MAX^0 -> (1 + MAX^0), num^0 -> (1 + MAX^0)}>

Fresh variables:
undef10, undef15, undef23, undef36, undef41, undef46, undef49, undef50, undef62, undef67, undef75, undef88, undef133, undef135, undef141, undef143, 

Undef variables:
undef10, undef15, undef23, undef36, undef41, undef46, undef49, undef50, undef62, undef67, undef75, undef88, undef133, undef135, undef141, undef143, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l2, l2, MIN^0 <= num^0 /\ 1 + j_min^0 <= pid^0 /\ undef36 <= 1 /\ undef62 <= 1 /\ undef88 <= 1, {all remain the same}>
<l2, l2, MIN^0 <= num^0 /\ 1 + j_min^0 <= pid^0 /\ 1 <= undef15 /\ 2 <= undef36 /\ undef62 <= 1 /\ undef88 <= 1, {j_min^0 -> j_min^0 + undef15, rest remain the same}>
<l2, l2, MIN^0 + undef41 <= MAX^0 /\ MIN^0 <= num^0 /\ num^0 <= undef41 /\ undef41 <= undef46 /\ 1 + j_min^0 <= pid^0 /\ 1 <= undef50 /\ 2 <= undef62 /\ undef88 <= 1 /\ MIN^0 + undef46 = num^0, {MIN^0 -> MIN^0 + undef41, j_min^0 -> undef50, rest remain the same}>
<l2, l2, MIN^0 <= num^0 /\ 1 + j_min^0 <= pid^0 /\ 1 <= undef67 /\ 2 <= undef88 /\ undef36 <= 1 /\ undef75 <= 1, {MAX^0 -> MAX^0 + undef67, rest remain the same}>
<l2, l2, MIN^0 <= num^0 /\ 1 + j_min^0 <= pid^0 /\ 1 <= undef15 /\ 1 <= undef67 /\ 2 <= undef36 /\ 2 <= undef88 /\ undef75 <= 1, {MAX^0 -> MAX^0 + undef67, j_min^0 -> j_min^0 + undef15, rest remain the same}>
<l2, l2, MIN^0 + undef41 <= MAX^0 + undef67 /\ MIN^0 <= num^0 /\ num^0 <= undef41 /\ undef41 <= undef46 /\ 1 + j_min^0 <= pid^0 /\ 1 <= undef50 /\ 1 <= undef67 /\ 2 <= undef75 /\ 2 <= undef88 /\ MIN^0 + undef46 = num^0, {MAX^0 -> MAX^0 + undef67, MIN^0 -> MIN^0 + undef41, j_min^0 -> undef50, rest remain the same}>
<l2, l2, pid^0 <= j_min^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
<l2, l2, 1 + num^0 <= MIN^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Variables:
MIN^0, j_min^0, num^0, pid^0, MAX^0

Precedence: 
Graph 0

Graph 1
<l0, l2, undef135 <= undef133 /\ 1 <= undef135 /\ 1 <= undef141 /\ 1 <= undef143 /\ MIN^0 = undef135 /\ j_min^0 = undef141 /\ pid^0 = undef143 /\ MAX^0 = 1 + undef133 /\ num^0 = 1 + undef133, {all remain the same}>

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

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

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

Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l2, l2, MIN^0 + undef41 <= MAX^0 + undef67 /\ MIN^0 <= num^0 /\ num^0 <= undef41 /\ undef41 <= undef46 /\ 1 + j_min^0 <= pid^0 /\ 1 <= undef50 /\ 1 <= undef67 /\ 2 <= undef75 /\ 2 <= undef88 /\ MIN^0 + undef46 = num^0, {MAX^0 -> MAX^0 + undef67, MIN^0 -> MIN^0 + undef41, j_min^0 -> undef50, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MIN^0 <= num^0 /\ 1 <= MIN^0 /\ 1 + j_min^0 <= pid^0 /\ undef36 <= 1 /\ undef62 <= 1 /\ undef88 <= 1, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MIN^0 <= num^0 /\ 1 <= MIN^0 /\ 1 + j_min^0 <= pid^0 /\ 1 <= undef15 /\ 2 <= undef36 /\ undef62 <= 1 /\ undef88 <= 1, {j_min^0 -> j_min^0 + undef15, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, MIN^0 + undef41 <= MAX^0 /\ MIN^0 <= num^0 /\ num^0 <= undef41 /\ undef41 <= undef46 /\ 1 + j_min^0 <= pid^0 /\ 1 <= undef50 /\ 2 <= undef62 /\ undef88 <= 1 /\ MIN^0 + undef46 = num^0, {MIN^0 -> MIN^0 + undef41, j_min^0 -> undef50, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MIN^0 <= num^0 /\ 1 <= MIN^0 /\ 1 + j_min^0 <= pid^0 /\ 1 <= undef67 /\ 2 <= undef88 /\ undef36 <= 1 /\ undef75 <= 1, {MAX^0 -> MAX^0 + undef67, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MIN^0 <= num^0 /\ 1 <= MIN^0 /\ 1 + j_min^0 <= pid^0 /\ 1 <= undef15 /\ 1 <= undef67 /\ 2 <= undef36 /\ 2 <= undef88 /\ undef75 <= 1, {MAX^0 -> MAX^0 + undef67, j_min^0 -> j_min^0 + undef15, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, pid^0 <= j_min^0 /\ 1 <= MIN^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 1 <= MIN^0 /\ 1 + num^0 <= MIN^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Checking unfeasibility...
Time used: 0.049576

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.006499s
Ranking function: -2 - 2*j_min^0 + 2*pid^0
New Graphs: 
Transitions:
<l2, l2, MIN^0 <= num^0 /\ 1 <= MIN^0 /\ 1 + j_min^0 <= pid^0 /\ undef36 <= 1 /\ undef62 <= 1 /\ undef88 <= 1, {all remain the same}>
<l2, l2, MIN^0 <= num^0 /\ 1 <= MIN^0 /\ 1 + j_min^0 <= pid^0 /\ 1 <= undef67 /\ 2 <= undef88 /\ undef36 <= 1 /\ undef75 <= 1, {MAX^0 -> MAX^0 + undef67, rest remain the same}>
<l2, l2, pid^0 <= j_min^0 /\ 1 <= MIN^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
<l2, l2, 1 <= MIN^0 /\ 1 + num^0 <= MIN^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Variables:
MAX^0, MIN^0, j_min^0, num^0, pid^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001839s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.011145s
[54532 : 54533]
[54532 : 54534]
Successful child: 54533
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, num^0 <= MAX^0 /\ MIN^0 <= num^0 /\ 1 <= MIN^0 /\ 1 + j_min^0 <= pid^0 /\ undef36 <= 1 /\ undef62 <= 1 /\ undef88 <= 1, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, num^0 <= MAX^0 /\ MIN^0 <= num^0 /\ 1 <= MIN^0 /\ 1 + j_min^0 <= pid^0 /\ 1 <= undef15 /\ 2 <= undef36 /\ undef62 <= 1 /\ undef88 <= 1, {j_min^0 -> j_min^0 + undef15, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, num^0 <= MAX^0 /\ MIN^0 <= num^0 /\ 1 <= MIN^0 /\ 1 + j_min^0 <= pid^0 /\ 1 <= undef67 /\ 2 <= undef88 /\ undef36 <= 1 /\ undef75 <= 1, {MAX^0 -> MAX^0 + undef67, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, num^0 <= MAX^0 /\ MIN^0 <= num^0 /\ 1 <= MIN^0 /\ 1 + j_min^0 <= pid^0 /\ 1 <= undef15 /\ 1 <= undef67 /\ 2 <= undef36 /\ 2 <= undef88 /\ undef75 <= 1, {MAX^0 -> MAX^0 + undef67, j_min^0 -> j_min^0 + undef15, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, num^0 <= MAX^0 /\ pid^0 <= j_min^0 /\ 1 <= MIN^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, num^0 <= MAX^0 /\ 1 <= MIN^0 /\ 1 + num^0 <= MIN^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^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): 
<l2, l2, num^0 <= MAX^0 /\ MIN^0 <= num^0 /\ 1 <= MIN^0 /\ 1 + j_min^0 <= pid^0 /\ undef36 <= 1 /\ undef62 <= 1 /\ undef88 <= 1, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, num^0 <= MAX^0 /\ MIN^0 <= num^0 /\ 1 <= MIN^0 /\ 1 + j_min^0 <= pid^0 /\ 1 <= undef67 /\ 2 <= undef88 /\ undef36 <= 1 /\ undef75 <= 1, {MAX^0 -> MAX^0 + undef67, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, num^0 <= MAX^0 /\ pid^0 <= j_min^0 /\ 1 <= MIN^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, num^0 <= MAX^0 /\ 1 <= MIN^0 /\ 1 + num^0 <= MIN^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Ranking function: MIN^0 - num^0
New Graphs: 
Transitions:
<l2, l2, num^0 <= MAX^0 /\ MIN^0 <= num^0 /\ 1 <= MIN^0 /\ 1 + j_min^0 <= pid^0 /\ undef36 <= 1 /\ undef62 <= 1 /\ undef88 <= 1, {all remain the same}>
<l2, l2, num^0 <= MAX^0 /\ MIN^0 <= num^0 /\ 1 <= MIN^0 /\ 1 + j_min^0 <= pid^0 /\ 1 <= undef67 /\ 2 <= undef88 /\ undef36 <= 1 /\ undef75 <= 1, {MAX^0 -> MAX^0 + undef67, rest remain the same}>
<l2, l2, num^0 <= MAX^0 /\ pid^0 <= j_min^0 /\ 1 <= MIN^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Variables:
MAX^0, MIN^0, j_min^0, num^0, pid^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001796s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.009627s
[54532 : 54538]
[54532 : 54539]
Successful child: 54538
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, num^0 <= MAX^0 /\ MIN^0 <= num^0 /\ 1 <= MIN^0 /\ 1 + j_min^0 <= pid^0 /\ undef36 <= 1 /\ undef62 <= 1 /\ undef88 <= 1, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, num^0 <= MAX^0 /\ MIN^0 <= num^0 /\ 1 <= MIN^0 /\ 1 + j_min^0 <= pid^0 /\ 1 <= undef15 /\ 2 <= undef36 /\ undef62 <= 1 /\ undef88 <= 1, {j_min^0 -> j_min^0 + undef15, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, num^0 <= MAX^0 /\ MIN^0 <= num^0 /\ 1 <= MIN^0 /\ 1 + j_min^0 <= pid^0 /\ 1 <= undef67 /\ 2 <= undef88 /\ undef36 <= 1 /\ undef75 <= 1, {MAX^0 -> MAX^0 + undef67, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, num^0 <= MAX^0 /\ MIN^0 <= num^0 /\ 1 <= MIN^0 /\ 1 + j_min^0 <= pid^0 /\ 1 <= undef15 /\ 1 <= undef67 /\ 2 <= undef36 /\ 2 <= undef88 /\ undef75 <= 1, {MAX^0 -> MAX^0 + undef67, j_min^0 -> j_min^0 + undef15, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, num^0 <= MAX^0 /\ pid^0 <= j_min^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MIN^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, num^0 <= MAX^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MIN^0 /\ 1 + num^0 <= MIN^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^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
It's unfeasible. Removing transition: 
<l2, l2, num^0 <= MAX^0 /\ MIN^0 <= num^0 /\ 1 <= MIN^0 /\ 1 + j_min^0 <= pid^0 /\ undef36 <= 1 /\ undef62 <= 1 /\ undef88 <= 1, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, num^0 <= MAX^0 /\ MIN^0 <= num^0 /\ 1 <= MIN^0 /\ 1 + j_min^0 <= pid^0 /\ 1 <= undef67 /\ 2 <= undef88 /\ undef36 <= 1 /\ undef75 <= 1, {MAX^0 -> MAX^0 + undef67, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, num^0 <= MAX^0 /\ pid^0 <= j_min^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MIN^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
New Graphs: 
Transitions:
<l2, l2, num^0 <= MAX^0 /\ pid^0 <= j_min^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MIN^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Variables:
MAX^0, MIN^0, j_min^0, num^0, pid^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000895s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003802s
[54532 : 54543]
[54532 : 54544]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.044053s
Time used: 0.044049

LOG: SAT solveNonLinear - Elapsed time: 0.067149s
Cost: 1; Total time: 0.066368
Termination implied by a set of invariant(s):
Invariant at l2: MAX^0 <= num^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, pid^0 <= j_min^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MIN^0 /\ 1 + num^0 <= MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^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): 
<l2, l2, pid^0 <= j_min^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Quasi-ranking function: 50000 - num^0
New Graphs: 
Transitions:
<l2, l2, pid^0 <= j_min^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MIN^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Variables:
MAX^0, MIN^0, j_min^0, num^0, pid^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000969s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004642s
[54532 : 54633]
[54532 : 54634]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.045090s
Time used: 0.045087

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, pid^0 <= j_min^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MIN^0 /\ 1 + num^0 <= MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^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): 
<l2, l2, pid^0 <= j_min^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MIN^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Quasi-ranking function: 50000 - 2*MAX^0 + 50000*MIN^0 + j_min^0 + num^0 - pid^0
New Graphs: 
Transitions:
<l2, l2, pid^0 <= j_min^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Variables:
MAX^0, MIN^0, j_min^0, num^0, pid^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001084s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.007328s
[54532 : 54661]
[54532 : 54662]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.046291s
Time used: 0.046288

LOG: SAT solveNonLinear - Elapsed time: 0.072330s
Cost: 1; Total time: 0.071524
Termination implied by a set of invariant(s):
Invariant at l2: MAX^0 <= j_min^0 + num^0 + pid^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ pid^0 <= j_min^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MIN^0 /\ 1 + num^0 <= MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^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): 
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ pid^0 <= j_min^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Quasi-ranking function: 50000 - 2*MAX^0 + MIN^0 + 100003*j_min^0 + num^0 + pid^0
New Graphs: 
Transitions:
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ pid^0 <= j_min^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MIN^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Variables:
MAX^0, MIN^0, j_min^0, num^0, pid^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001329s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.009892s
[54532 : 54666]
[54532 : 54667]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.049376s
Time used: 0.049374

LOG: SAT solveNonLinear - Elapsed time: 0.089386s
Cost: 1; Total time: 0.088534
Termination implied by a set of invariant(s):
Invariant at l2: num^0 <= MAX^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ pid^0 <= j_min^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MIN^0 /\ 1 + num^0 <= MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^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): 
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ pid^0 <= j_min^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MIN^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Quasi-ranking function: 50000 - 2*MAX^0 - MIN^0 + 100007*j_min^0 + num^0 + pid^0
New Graphs: 
Transitions:
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ pid^0 <= j_min^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MIN^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Variables:
MAX^0, MIN^0, j_min^0, num^0, pid^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001469s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.007618s
[54532 : 54682]
[54532 : 54683]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.055987s
Time used: 0.055984

LOG: SAT solveNonLinear - Elapsed time: 0.092625s
Cost: 1; Total time: 0.091396
Termination implied by a set of invariant(s):
Invariant at l2: MAX^0 <= num^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ pid^0 <= j_min^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MIN^0 /\ 1 + num^0 <= MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^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): 
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ pid^0 <= j_min^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MIN^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Quasi-ranking function: 50000 - 2*MAX^0 + 100003*MIN^0 - j_min^0 + num^0 + pid^0
New Graphs: 
Transitions:
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ pid^0 <= j_min^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MIN^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Variables:
MAX^0, MIN^0, j_min^0, num^0, pid^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001601s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.007904s
[54532 : 54687]
[54532 : 54688]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.069485s
Time used: 0.069482

LOG: SAT solveNonLinear - Elapsed time: 0.108236s
Cost: 1; Total time: 0.107268
Termination implied by a set of invariant(s):
Invariant at l2: num^0 <= MAX^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ pid^0 <= j_min^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MIN^0 /\ 1 + num^0 <= MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^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): 
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ pid^0 <= j_min^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MIN^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Quasi-ranking function: 50000 - 2*MAX^0 - MIN^0 - j_min^0 + num^0 + pid^0
New Graphs: 
Transitions:
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ pid^0 <= j_min^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MIN^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Variables:
MAX^0, MIN^0, j_min^0, num^0, pid^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001735s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.010365s
[54532 : 54692]
[54532 : 54693]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.049267s
Time used: 0.049264

LOG: SAT solveNonLinear - Elapsed time: 0.099497s
Cost: 1; Total time: 0.09847
Termination implied by a set of invariant(s):
Invariant at l2: 1 + num^0 <= MAX^0 + pid^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ pid^0 <= j_min^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 + num^0 <= MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^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): 
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ pid^0 <= j_min^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Quasi-ranking function: 50000 - 2*MAX^0 + MIN^0 - j_min^0 + num^0 - pid^0
New Graphs: 
Transitions:
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ pid^0 <= j_min^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Variables:
MAX^0, MIN^0, j_min^0, num^0, pid^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002104s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.056828s
[54532 : 54697]
[54532 : 54698]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.051359s
Time used: 0.051355

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ pid^0 <= j_min^0 /\ 0 <= num^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= num^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 + num^0 <= MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^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): 
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ pid^0 <= j_min^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Quasi-ranking function: 50000 - 2*MAX^0 - MIN^0 - j_min^0 + num^0 - pid^0
New Graphs: 
Transitions:
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ pid^0 <= j_min^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Variables:
MAX^0, MIN^0, j_min^0, num^0, pid^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002243s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.077103s
[54532 : 54702]
[54532 : 54703]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.056115s
Time used: 0.056111

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ pid^0 <= j_min^0 /\ 0 <= num^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= num^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 + num^0 <= MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^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): 
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Quasi-ranking function: 50000 - 2*MAX^0 - MIN^0 + j_min^0 + num^0 - pid^0
New Graphs: 
Transitions:
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Variables:
MAX^0, MIN^0, j_min^0, num^0, pid^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002480s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.022350s
[54532 : 54707]
[54532 : 54708]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.058093s
Time used: 0.058091

LOG: SAT solveNonLinear - Elapsed time: 0.107926s
Cost: 1; Total time: 0.106187
Termination implied by a set of invariant(s):
Invariant at l2: MIN^0 <= 1 + MAX^0 + pid^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ pid^0 <= j_min^0 /\ 0 <= num^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= num^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 + num^0 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^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): 
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Quasi-ranking function: 50000 + MAX^0 + MIN^0 + j_min^0 - 2*num^0 - pid^0
New Graphs: 
Transitions:
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Variables:
MAX^0, MIN^0, j_min^0, num^0, pid^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002513s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.116776s
[54532 : 54712]
[54532 : 54713]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.054215s
Time used: 0.054213

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ pid^0 <= j_min^0 /\ 0 <= num^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= num^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 + num^0 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^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): 
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Quasi-ranking function: 50000 - MAX^0 + MIN^0 + j_min^0 - pid^0
New Graphs: 
Transitions:
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Variables:
MAX^0, MIN^0, j_min^0, num^0, pid^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002707s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.067873s
[54532 : 54717]
[54532 : 54718]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.065202s
Time used: 0.065199

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ pid^0 <= j_min^0 /\ 0 <= num^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= num^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 + num^0 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^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): 
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Quasi-ranking function: 50000 + MAX^0 + MIN^0 + j_min^0 - 2*num^0 + pid^0
New Graphs: 
Transitions:
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 + pid^0 <= 2*num^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Variables:
MAX^0, MIN^0, j_min^0, num^0, pid^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002923s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.038257s
[54532 : 54722]
[54532 : 54723]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.067697s
Time used: 0.067695

LOG: SAT solveNonLinear - Elapsed time: 0.104970s
Cost: 1; Total time: 0.103314
Termination implied by a set of invariant(s):
Invariant at l2: MAX^0 <= num^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ pid^0 <= j_min^0 /\ 0 <= num^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= num^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 + num^0 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^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): 
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 + pid^0 <= 2*num^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Quasi-ranking function: 50000 - MAX^0 + MIN^0 + j_min^0 - num^0 - pid^0
New Graphs: 
Transitions:
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 + pid^0 <= 2*num^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Variables:
MAX^0, MIN^0, j_min^0, num^0, pid^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003074s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.136526s
[54532 : 54727]
[54532 : 54728]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.081412s
Time used: 0.08141

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ pid^0 <= j_min^0 /\ 0 <= num^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= num^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 + num^0 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^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): 
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 + pid^0 <= 2*num^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Quasi-ranking function: 50000 + MAX^0 + MIN^0 - j_min^0 - 2*num^0 - pid^0
New Graphs: 
Transitions:
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 + pid^0 <= 2*num^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MAX^0 + MIN^0 <= j_min^0 + 2*num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Variables:
MAX^0, MIN^0, j_min^0, num^0, pid^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003195s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.143331s
[54532 : 54732]
[54532 : 54733]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.081446s
Time used: 0.081443

LOG: SAT solveNonLinear - Elapsed time: 0.132825s
Cost: 1; Total time: 0.130877
Quasi-ranking function: 50000 - MAX^0 + MIN^0 + j_min^0 - num^0 + pid^0
New Graphs: 
Transitions:
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 + pid^0 <= 2*num^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MAX^0 + MIN^0 <= j_min^0 + 2*num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 + pid^0 <= MAX^0 + num^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Variables:
MAX^0, MIN^0, j_min^0, num^0, pid^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003419s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.022139s
[54532 : 54845]
[54532 : 54846]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.062282s
Time used: 0.06228

LOG: SAT solveNonLinear - Elapsed time: 0.107235s
Cost: 1; Total time: 0.105349
Termination implied by a set of invariant(s):
Invariant at l2: 0 <= MAX^0 + MIN^0 + num^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= num^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ 0 <= num^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 + num^0 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^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): 
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 + pid^0 <= 2*num^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MAX^0 + MIN^0 <= j_min^0 + 2*num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 + pid^0 <= MAX^0 + num^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Quasi-ranking function: 50000 + MAX^0 + MIN^0 - j_min^0 - 2*num^0 + pid^0
New Graphs: 
Transitions:
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 + pid^0 <= 2*num^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + 2*num^0 /\ 50001 + MAX^0 + MIN^0 <= j_min^0 + 2*num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 + pid^0 <= MAX^0 + num^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Variables:
MAX^0, MIN^0, j_min^0, num^0, pid^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003544s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.413136s
[54532 : 54850]
[54532 : 54851]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.079420s
Time used: 0.079418

LOG: SAT solveNonLinear - Elapsed time: 0.131704s
Cost: 1; Total time: 0.129311
Quasi-ranking function: 50000 - MAX^0 + MIN^0 - j_min^0 - num^0 - pid^0
New Graphs: 
Transitions:
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 + pid^0 <= 2*num^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + 2*num^0 /\ 50001 + MAX^0 + MIN^0 <= j_min^0 + 2*num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 + pid^0 <= MAX^0 + num^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + pid^0 /\ 50001 + MIN^0 <= MAX^0 + j_min^0 + num^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Variables:
MAX^0, MIN^0, j_min^0, num^0, pid^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003752s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.070868s
[54532 : 54855]
[54532 : 54856]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.075765s
Time used: 0.075762

LOG: SAT solveNonLinear - Elapsed time: 0.119218s
Cost: 1; Total time: 0.117254
Termination implied by a set of invariant(s):
Invariant at l2: MAX^0 <= MIN^0 + num^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= num^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ 0 <= num^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 + num^0 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^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): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 + pid^0 <= 2*num^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + 2*num^0 /\ 50001 + MAX^0 + MIN^0 <= j_min^0 + 2*num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 + pid^0 <= MAX^0 + num^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + pid^0 /\ 50001 + MIN^0 <= MAX^0 + j_min^0 + num^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Quasi-ranking function: 50000 + MAX^0 - MIN^0 + j_min^0 - 2*num^0 + pid^0
New Graphs: 
Transitions:
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 + pid^0 <= 2*num^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + 2*num^0 /\ 50001 + MAX^0 + MIN^0 <= j_min^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + j_min^0 + pid^0 <= MIN^0 + 2*num^0 /\ 50001 + MIN^0 + j_min^0 + pid^0 <= MAX^0 + num^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + pid^0 /\ 50001 + MIN^0 <= MAX^0 + j_min^0 + num^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Variables:
MAX^0, MIN^0, j_min^0, num^0, pid^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003892s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.168158s
[54532 : 54860]
[54532 : 54861]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.071514s
Time used: 0.071511

LOG: SAT solveNonLinear - Elapsed time: 0.136228s
Cost: 1; Total time: 0.133778
Termination implied by a set of invariant(s):
Invariant at l2: MIN^0 <= j_min^0 + num^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= num^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ 0 <= num^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 + num^0 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^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): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 + pid^0 <= 2*num^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + 2*num^0 /\ 50001 + MAX^0 + MIN^0 <= j_min^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + j_min^0 + pid^0 <= MIN^0 + 2*num^0 /\ 50001 + MIN^0 + j_min^0 + pid^0 <= MAX^0 + num^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + pid^0 /\ 50001 + MIN^0 <= MAX^0 + j_min^0 + num^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Quasi-ranking function: 50000 - MAX^0 + 2*MIN^0 - j_min^0 - num^0 + pid^0
New Graphs: 
Transitions:
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 + pid^0 <= 2*num^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + 2*num^0 /\ 50001 + MAX^0 + MIN^0 <= j_min^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + j_min^0 + pid^0 <= MIN^0 + 2*num^0 /\ 50001 + MIN^0 + j_min^0 + pid^0 <= MAX^0 + num^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + pid^0 /\ 50001 + MIN^0 <= MAX^0 + j_min^0 + num^0 + pid^0 /\ 50001 + 2*MIN^0 + pid^0 <= MAX^0 + j_min^0 + num^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Variables:
MAX^0, MIN^0, j_min^0, num^0, pid^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004122s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.146393s
[54532 : 54865]
[54532 : 54866]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.068856s
Time used: 0.068853

LOG: SAT solveNonLinear - Elapsed time: 0.123256s
Cost: 1; Total time: 0.120592
Quasi-ranking function: 50000 - MAX^0 - MIN^0 - j_min^0 - num^0 - pid^0
New Graphs: 
Transitions:
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 + pid^0 <= 2*num^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + 2*num^0 /\ 50001 + MAX^0 + MIN^0 <= j_min^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + j_min^0 + pid^0 <= MIN^0 + 2*num^0 /\ 50001 + MIN^0 + j_min^0 + pid^0 <= MAX^0 + num^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + pid^0 /\ 50001 + MIN^0 <= MAX^0 + j_min^0 + num^0 + pid^0 /\ 50001 + 2*MIN^0 + pid^0 <= MAX^0 + j_min^0 + num^0 /\ 50001 <= MAX^0 + MIN^0 + j_min^0 + num^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Variables:
MAX^0, MIN^0, j_min^0, num^0, pid^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004276s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.025272s
[54532 : 54870]
[54532 : 54871]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.083152s
Time used: 0.08315

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 <= num^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 + num^0 <= MIN^0 /\ 1 <= num^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^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): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 + pid^0 <= 2*num^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + 2*num^0 /\ 50001 + MAX^0 + MIN^0 <= j_min^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + j_min^0 + pid^0 <= MIN^0 + 2*num^0 /\ 50001 + MIN^0 + j_min^0 + pid^0 <= MAX^0 + num^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + pid^0 /\ 50001 + MIN^0 <= MAX^0 + j_min^0 + num^0 + pid^0 /\ 50001 + 2*MIN^0 + pid^0 <= MAX^0 + j_min^0 + num^0 /\ 50001 <= MAX^0 + MIN^0 + j_min^0 + num^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Quasi-ranking function: 50000 + MAX^0 - MIN^0 - j_min^0 - 2*num^0 - pid^0
New Graphs: 
Transitions:
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 + pid^0 <= 2*num^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + 2*num^0 /\ 50001 + MAX^0 + MIN^0 <= j_min^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + j_min^0 + pid^0 <= MIN^0 + 2*num^0 /\ 50001 + MAX^0 <= MIN^0 + j_min^0 + 2*num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 + pid^0 <= MAX^0 + num^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + pid^0 /\ 50001 + MIN^0 <= MAX^0 + j_min^0 + num^0 + pid^0 /\ 50001 + 2*MIN^0 + pid^0 <= MAX^0 + j_min^0 + num^0 /\ 50001 <= MAX^0 + MIN^0 + j_min^0 + num^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Variables:
MAX^0, MIN^0, j_min^0, num^0, pid^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004385s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.274414s
[54532 : 54875]
[54532 : 54876]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.079068s
Time used: 0.079066

LOG: SAT solveNonLinear - Elapsed time: 0.130587s
Cost: 1; Total time: 0.127829
Termination implied by a set of invariant(s):
Invariant at l2: num^0 <= MAX^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 <= num^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 + num^0 <= MIN^0 /\ 1 <= num^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^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): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 + pid^0 <= 2*num^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + 2*num^0 /\ 50001 + MAX^0 + MIN^0 <= j_min^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + j_min^0 + pid^0 <= MIN^0 + 2*num^0 /\ 50001 + MAX^0 <= MIN^0 + j_min^0 + 2*num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 + pid^0 <= MAX^0 + num^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + pid^0 /\ 50001 + MIN^0 <= MAX^0 + j_min^0 + num^0 + pid^0 /\ 50001 + 2*MIN^0 + pid^0 <= MAX^0 + j_min^0 + num^0 /\ 50001 <= MAX^0 + MIN^0 + j_min^0 + num^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Quasi-ranking function: 50000 - MAX^0 - MIN^0 - j_min^0 - num^0 + pid^0
New Graphs: 
Transitions:
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 + pid^0 <= 2*num^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + 2*num^0 /\ 50001 + MAX^0 + MIN^0 <= j_min^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + j_min^0 + pid^0 <= MIN^0 + 2*num^0 /\ 50001 + MAX^0 <= MIN^0 + j_min^0 + 2*num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 + pid^0 <= MAX^0 + num^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + pid^0 /\ 50001 + MIN^0 <= MAX^0 + j_min^0 + num^0 + pid^0 /\ 50001 + 2*MIN^0 + pid^0 <= MAX^0 + j_min^0 + num^0 /\ 50001 + pid^0 <= MAX^0 + MIN^0 + j_min^0 + num^0 /\ 50001 <= MAX^0 + MIN^0 + j_min^0 + num^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Variables:
MAX^0, MIN^0, j_min^0, num^0, pid^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004525s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.026782s
[54532 : 54880]
[54532 : 54881]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.114962s
Time used: 0.114942

LOG: SAT solveNonLinear - Elapsed time: 0.191882s
Cost: 1; Total time: 0.188922
Termination implied by a set of invariant(s):
Invariant at l2: MAX^0 <= num^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 <= num^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 + num^0 <= MIN^0 /\ 1 <= num^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^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): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 + pid^0 <= 2*num^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + 2*num^0 /\ 50001 + MAX^0 + MIN^0 <= j_min^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + j_min^0 + pid^0 <= MIN^0 + 2*num^0 /\ 50001 + MAX^0 <= MIN^0 + j_min^0 + 2*num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 + pid^0 <= MAX^0 + num^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + pid^0 /\ 50001 + MIN^0 <= MAX^0 + j_min^0 + num^0 + pid^0 /\ 50001 + 2*MIN^0 + pid^0 <= MAX^0 + j_min^0 + num^0 /\ 50001 + pid^0 <= MAX^0 + MIN^0 + j_min^0 + num^0 /\ 50001 <= MAX^0 + MIN^0 + j_min^0 + num^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Quasi-ranking function: 50000 - MAX^0 - MIN^0 + j_min^0 - num^0 - pid^0
New Graphs: 
Transitions:
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 + pid^0 <= 2*num^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + 2*num^0 /\ 50001 + MAX^0 + MIN^0 <= j_min^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + j_min^0 + pid^0 <= MIN^0 + 2*num^0 /\ 50001 + MAX^0 <= MIN^0 + j_min^0 + 2*num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 + pid^0 <= MAX^0 + num^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + pid^0 /\ 50001 + MIN^0 <= MAX^0 + j_min^0 + num^0 + pid^0 /\ 50001 + 2*MIN^0 + pid^0 <= MAX^0 + j_min^0 + num^0 /\ 50001 + j_min^0 <= MAX^0 + MIN^0 + num^0 + pid^0 /\ 50001 + pid^0 <= MAX^0 + MIN^0 + j_min^0 + num^0 /\ 50001 <= MAX^0 + MIN^0 + j_min^0 + num^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Variables:
MAX^0, MIN^0, j_min^0, num^0, pid^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004648s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.093802s
[54532 : 54894]
[54532 : 54895]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.081673s
Time used: 0.081671

LOG: SAT solveNonLinear - Elapsed time: 0.135041s
Cost: 1; Total time: 0.132692
Termination implied by a set of invariant(s):
Invariant at l2: num^0 <= MAX^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 <= num^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 + num^0 <= MIN^0 /\ 1 <= num^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^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): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 + pid^0 <= 2*num^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + 2*num^0 /\ 50001 + MAX^0 + MIN^0 <= j_min^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + j_min^0 + pid^0 <= MIN^0 + 2*num^0 /\ 50001 + MAX^0 <= MIN^0 + j_min^0 + 2*num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 + pid^0 <= MAX^0 + num^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + pid^0 /\ 50001 + MIN^0 <= MAX^0 + j_min^0 + num^0 + pid^0 /\ 50001 + 2*MIN^0 + pid^0 <= MAX^0 + j_min^0 + num^0 /\ 50001 + j_min^0 <= MAX^0 + MIN^0 + num^0 + pid^0 /\ 50001 + pid^0 <= MAX^0 + MIN^0 + j_min^0 + num^0 /\ 50001 <= MAX^0 + MIN^0 + j_min^0 + num^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Quasi-ranking function: 50000 - MAX^0 - MIN^0 + j_min^0 - num^0 + pid^0
New Graphs: 
Transitions:
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 + pid^0 <= 2*num^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + 2*num^0 /\ 50001 + MAX^0 + MIN^0 <= j_min^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + j_min^0 + pid^0 <= MIN^0 + 2*num^0 /\ 50001 + MAX^0 <= MIN^0 + j_min^0 + 2*num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 + pid^0 <= MAX^0 + num^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + pid^0 /\ 50001 + MIN^0 <= MAX^0 + j_min^0 + num^0 + pid^0 /\ 50001 + 2*MIN^0 + pid^0 <= MAX^0 + j_min^0 + num^0 /\ 50001 + j_min^0 + pid^0 <= MAX^0 + MIN^0 + num^0 /\ 50001 + j_min^0 <= MAX^0 + MIN^0 + num^0 + pid^0 /\ 50001 + pid^0 <= MAX^0 + MIN^0 + j_min^0 + num^0 /\ 50001 <= MAX^0 + MIN^0 + j_min^0 + num^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Variables:
MAX^0, MIN^0, j_min^0, num^0, pid^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004823s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.108691s
[54532 : 54899]
[54532 : 54900]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.072949s
Time used: 0.072947

LOG: SAT solveNonLinear - Elapsed time: 0.136785s
Cost: 1; Total time: 0.133768
Termination implied by a set of invariant(s):
Invariant at l2: MAX^0 <= num^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 <= num^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 + num^0 <= MIN^0 /\ 1 <= num^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^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): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 + pid^0 <= 2*num^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + 2*num^0 /\ 50001 + MAX^0 + MIN^0 <= j_min^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + j_min^0 + pid^0 <= MIN^0 + 2*num^0 /\ 50001 + MAX^0 <= MIN^0 + j_min^0 + 2*num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 + pid^0 <= MAX^0 + num^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + pid^0 /\ 50001 + MIN^0 <= MAX^0 + j_min^0 + num^0 + pid^0 /\ 50001 + 2*MIN^0 + pid^0 <= MAX^0 + j_min^0 + num^0 /\ 50001 + j_min^0 + pid^0 <= MAX^0 + MIN^0 + num^0 /\ 50001 + j_min^0 <= MAX^0 + MIN^0 + num^0 + pid^0 /\ 50001 + pid^0 <= MAX^0 + MIN^0 + j_min^0 + num^0 /\ 50001 <= MAX^0 + MIN^0 + j_min^0 + num^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Quasi-ranking function: 50000 + MAX^0 - MIN^0 + j_min^0 - 2*num^0 - pid^0
New Graphs: 
Transitions:
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 + pid^0 <= 2*num^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + 2*num^0 /\ 50001 + MAX^0 + MIN^0 <= j_min^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + j_min^0 + pid^0 <= MIN^0 + 2*num^0 /\ 50001 + MAX^0 + j_min^0 <= MIN^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 <= MIN^0 + j_min^0 + 2*num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 + pid^0 <= MAX^0 + num^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + pid^0 /\ 50001 + MIN^0 <= MAX^0 + j_min^0 + num^0 + pid^0 /\ 50001 + 2*MIN^0 + pid^0 <= MAX^0 + j_min^0 + num^0 /\ 50001 + j_min^0 + pid^0 <= MAX^0 + MIN^0 + num^0 /\ 50001 + j_min^0 <= MAX^0 + MIN^0 + num^0 + pid^0 /\ 50001 + pid^0 <= MAX^0 + MIN^0 + j_min^0 + num^0 /\ 50001 <= MAX^0 + MIN^0 + j_min^0 + num^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Variables:
MAX^0, MIN^0, j_min^0, num^0, pid^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004921s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.057147s
[54532 : 54904]
[54532 : 54905]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.088841s
Time used: 0.088839

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 <= num^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 + num^0 <= MIN^0 /\ 1 <= num^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^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): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 + pid^0 <= 2*num^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + 2*num^0 /\ 50001 + MAX^0 + MIN^0 <= j_min^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + j_min^0 + pid^0 <= MIN^0 + 2*num^0 /\ 50001 + MAX^0 + j_min^0 <= MIN^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 <= MIN^0 + j_min^0 + 2*num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 + pid^0 <= MAX^0 + num^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + pid^0 /\ 50001 + MIN^0 <= MAX^0 + j_min^0 + num^0 + pid^0 /\ 50001 + 2*MIN^0 + pid^0 <= MAX^0 + j_min^0 + num^0 /\ 50001 + j_min^0 + pid^0 <= MAX^0 + MIN^0 + num^0 /\ 50001 + j_min^0 <= MAX^0 + MIN^0 + num^0 + pid^0 /\ 50001 + pid^0 <= MAX^0 + MIN^0 + j_min^0 + num^0 /\ 50001 <= MAX^0 + MIN^0 + j_min^0 + num^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Quasi-ranking function: 50000 + MAX^0 - MIN^0 - j_min^0 - 2*num^0 + pid^0
New Graphs: 
Transitions:
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 + pid^0 <= 2*num^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + 2*num^0 /\ 50001 + MAX^0 + MIN^0 <= j_min^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + j_min^0 + pid^0 <= MIN^0 + 2*num^0 /\ 50001 + MAX^0 + j_min^0 <= MIN^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + pid^0 <= MIN^0 + j_min^0 + 2*num^0 /\ 50001 + MAX^0 <= MIN^0 + j_min^0 + 2*num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 + pid^0 <= MAX^0 + num^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + pid^0 /\ 50001 + MIN^0 <= MAX^0 + j_min^0 + num^0 + pid^0 /\ 50001 + 2*MIN^0 + pid^0 <= MAX^0 + j_min^0 + num^0 /\ 50001 + j_min^0 + pid^0 <= MAX^0 + MIN^0 + num^0 /\ 50001 + j_min^0 <= MAX^0 + MIN^0 + num^0 + pid^0 /\ 50001 + pid^0 <= MAX^0 + MIN^0 + j_min^0 + num^0 /\ 50001 <= MAX^0 + MIN^0 + j_min^0 + num^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Variables:
MAX^0, MIN^0, j_min^0, num^0, pid^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.005032s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.029441s
[54532 : 54909]
[54532 : 54910]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.111039s
Time used: 0.111038

LOG: SAT solveNonLinear - Elapsed time: 0.175660s
Cost: 1; Total time: 0.172683
Termination implied by a set of invariant(s):
Invariant at l2: MIN^0 <= 1 + MAX^0 + num^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 <= num^0 /\ MIN^0 <= 1 + MAX^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 + num^0 <= MIN^0 /\ 1 <= num^0 /\ MIN^0 <= 1 + MAX^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^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): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 + pid^0 <= 2*num^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + 2*num^0 /\ 50001 + MAX^0 + MIN^0 <= j_min^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + j_min^0 + pid^0 <= MIN^0 + 2*num^0 /\ 50001 + MAX^0 + j_min^0 <= MIN^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + pid^0 <= MIN^0 + j_min^0 + 2*num^0 /\ 50001 + MAX^0 <= MIN^0 + j_min^0 + 2*num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 + pid^0 <= MAX^0 + num^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + pid^0 /\ 50001 + MIN^0 <= MAX^0 + j_min^0 + num^0 + pid^0 /\ 50001 + 2*MIN^0 + pid^0 <= MAX^0 + j_min^0 + num^0 /\ 50001 + j_min^0 + pid^0 <= MAX^0 + MIN^0 + num^0 /\ 50001 + j_min^0 <= MAX^0 + MIN^0 + num^0 + pid^0 /\ 50001 + pid^0 <= MAX^0 + MIN^0 + j_min^0 + num^0 /\ 50001 <= MAX^0 + MIN^0 + j_min^0 + num^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Quasi-ranking function: 50000 + MIN^0 - j_min^0 - num^0 - pid^0
New Graphs: 
Transitions:
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 + pid^0 <= 2*num^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + 2*num^0 /\ 50001 + MAX^0 + MIN^0 <= j_min^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + j_min^0 + pid^0 <= MIN^0 + 2*num^0 /\ 50001 + MAX^0 + j_min^0 <= MIN^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + pid^0 <= MIN^0 + j_min^0 + 2*num^0 /\ 50001 + MAX^0 <= MIN^0 + j_min^0 + 2*num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 + pid^0 <= MAX^0 + num^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + pid^0 /\ 50001 + MIN^0 <= MAX^0 + j_min^0 + num^0 + pid^0 /\ 50001 + 2*MIN^0 + pid^0 <= MAX^0 + j_min^0 + num^0 /\ 50001 + j_min^0 + pid^0 <= MAX^0 + MIN^0 + num^0 /\ 50001 + j_min^0 <= MAX^0 + MIN^0 + num^0 + pid^0 /\ 50001 + pid^0 <= MAX^0 + MIN^0 + j_min^0 + num^0 /\ 50001 <= MAX^0 + MIN^0 + j_min^0 + num^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 + MIN^0 <= j_min^0 + num^0 + pid^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Variables:
MAX^0, MIN^0, j_min^0, num^0, pid^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.005245s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.031773s
[54532 : 54914]
[54532 : 54915]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.079699s
Time used: 0.079689

LOG: SAT solveNonLinear - Elapsed time: 0.149079s
Cost: 1; Total time: 0.146506
Termination implied by a set of invariant(s):
Invariant at l2: MAX^0 <= 1 + j_min^0 + num^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 <= num^0 /\ MAX^0 <= 1 + j_min^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 + num^0 <= MIN^0 /\ 1 <= num^0 /\ MAX^0 <= 1 + j_min^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^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): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MAX^0 <= 1 + j_min^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 + pid^0 <= 2*num^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + 2*num^0 /\ 50001 + MAX^0 + MIN^0 <= j_min^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + j_min^0 + pid^0 <= MIN^0 + 2*num^0 /\ 50001 + MAX^0 + j_min^0 <= MIN^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + pid^0 <= MIN^0 + j_min^0 + 2*num^0 /\ 50001 + MAX^0 <= MIN^0 + j_min^0 + 2*num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 + pid^0 <= MAX^0 + num^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + pid^0 /\ 50001 + MIN^0 <= MAX^0 + j_min^0 + num^0 + pid^0 /\ 50001 + 2*MIN^0 + pid^0 <= MAX^0 + j_min^0 + num^0 /\ 50001 + j_min^0 + pid^0 <= MAX^0 + MIN^0 + num^0 /\ 50001 + j_min^0 <= MAX^0 + MIN^0 + num^0 + pid^0 /\ 50001 + pid^0 <= MAX^0 + MIN^0 + j_min^0 + num^0 /\ 50001 <= MAX^0 + MIN^0 + j_min^0 + num^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 + MIN^0 <= j_min^0 + num^0 + pid^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Quasi-ranking function: 50000 - MAX^0 - MIN^0 - j_min^0 - num^0
New Graphs: 
Transitions:
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MAX^0 <= 1 + j_min^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 + pid^0 <= 2*num^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + 2*num^0 /\ 50001 + MAX^0 + MIN^0 <= j_min^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + j_min^0 + pid^0 <= MIN^0 + 2*num^0 /\ 50001 + MAX^0 + j_min^0 <= MIN^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + pid^0 <= MIN^0 + j_min^0 + 2*num^0 /\ 50001 + MAX^0 <= MIN^0 + j_min^0 + 2*num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 + pid^0 <= MAX^0 + num^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + pid^0 /\ 50001 + MIN^0 <= MAX^0 + j_min^0 + num^0 + pid^0 /\ 50001 + 2*MIN^0 + pid^0 <= MAX^0 + j_min^0 + num^0 /\ 50001 + j_min^0 + pid^0 <= MAX^0 + MIN^0 + num^0 /\ 50001 + j_min^0 <= MAX^0 + MIN^0 + num^0 + pid^0 /\ 50001 <= MAX^0 + MIN^0 + j_min^0 + num^0 /\ 50001 + pid^0 <= MAX^0 + MIN^0 + j_min^0 + num^0 /\ 50001 <= MAX^0 + MIN^0 + j_min^0 + num^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 + MIN^0 <= j_min^0 + num^0 + pid^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Variables:
MAX^0, MIN^0, j_min^0, num^0, pid^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.005468s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.032335s
[54532 : 54919]
[54532 : 54920]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.096833s
Time used: 0.09683

LOG: SAT solveNonLinear - Elapsed time: 0.163617s
Cost: 1; Total time: 0.160673
Termination implied by a set of invariant(s):
Invariant at l2: MIN^0 <= j_min^0 + num^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 <= num^0 /\ MAX^0 <= 1 + j_min^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 + num^0 <= MIN^0 /\ 1 <= num^0 /\ MAX^0 <= 1 + j_min^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^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): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MAX^0 <= 1 + j_min^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 + pid^0 <= 2*num^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + 2*num^0 /\ 50001 + MAX^0 + MIN^0 <= j_min^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + j_min^0 + pid^0 <= MIN^0 + 2*num^0 /\ 50001 + MAX^0 + j_min^0 <= MIN^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + pid^0 <= MIN^0 + j_min^0 + 2*num^0 /\ 50001 + MAX^0 <= MIN^0 + j_min^0 + 2*num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 + pid^0 <= MAX^0 + num^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + pid^0 /\ 50001 + MIN^0 <= MAX^0 + j_min^0 + num^0 + pid^0 /\ 50001 + 2*MIN^0 + pid^0 <= MAX^0 + j_min^0 + num^0 /\ 50001 + j_min^0 + pid^0 <= MAX^0 + MIN^0 + num^0 /\ 50001 + j_min^0 <= MAX^0 + MIN^0 + num^0 + pid^0 /\ 50001 <= MAX^0 + MIN^0 + j_min^0 + num^0 /\ 50001 + pid^0 <= MAX^0 + MIN^0 + j_min^0 + num^0 /\ 50001 <= MAX^0 + MIN^0 + j_min^0 + num^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 + MIN^0 <= j_min^0 + num^0 + pid^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Quasi-ranking function: 50000 + MIN^0 - j_min^0 - num^0 + pid^0
New Graphs: 
Transitions:
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MAX^0 <= 1 + j_min^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 + pid^0 <= 2*num^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + 2*num^0 /\ 50001 + MAX^0 + MIN^0 <= j_min^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + j_min^0 + pid^0 <= MIN^0 + 2*num^0 /\ 50001 + MAX^0 + j_min^0 <= MIN^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + pid^0 <= MIN^0 + j_min^0 + 2*num^0 /\ 50001 + MAX^0 <= MIN^0 + j_min^0 + 2*num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 + pid^0 <= MAX^0 + num^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + pid^0 /\ 50001 + MIN^0 <= MAX^0 + j_min^0 + num^0 + pid^0 /\ 50001 + 2*MIN^0 + pid^0 <= MAX^0 + j_min^0 + num^0 /\ 50001 + j_min^0 + pid^0 <= MAX^0 + MIN^0 + num^0 /\ 50001 + j_min^0 <= MAX^0 + MIN^0 + num^0 + pid^0 /\ 50001 <= MAX^0 + MIN^0 + j_min^0 + num^0 /\ 50001 + pid^0 <= MAX^0 + MIN^0 + j_min^0 + num^0 /\ 50001 <= MAX^0 + MIN^0 + j_min^0 + num^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 50001 + MIN^0 <= j_min^0 + num^0 + pid^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Variables:
MAX^0, MIN^0, j_min^0, num^0, pid^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.005607s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.059428s
[54532 : 55032]
[54532 : 55033]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.096359s
Time used: 0.096357

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 <= MIN^0 + num^0 /\ 1 <= num^0 /\ MAX^0 <= 1 + j_min^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 + num^0 <= MIN^0 /\ 1 <= MIN^0 + num^0 /\ 1 <= num^0 /\ MAX^0 <= 1 + j_min^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^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): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 <= MIN^0 + num^0 /\ MAX^0 <= 1 + j_min^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 + pid^0 <= 2*num^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + 2*num^0 /\ 50001 + MAX^0 + MIN^0 <= j_min^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + j_min^0 + pid^0 <= MIN^0 + 2*num^0 /\ 50001 + MAX^0 + j_min^0 <= MIN^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + pid^0 <= MIN^0 + j_min^0 + 2*num^0 /\ 50001 + MAX^0 <= MIN^0 + j_min^0 + 2*num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 + pid^0 <= MAX^0 + num^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + pid^0 /\ 50001 + MIN^0 <= MAX^0 + j_min^0 + num^0 + pid^0 /\ 50001 + 2*MIN^0 + pid^0 <= MAX^0 + j_min^0 + num^0 /\ 50001 + j_min^0 + pid^0 <= MAX^0 + MIN^0 + num^0 /\ 50001 + j_min^0 <= MAX^0 + MIN^0 + num^0 + pid^0 /\ 50001 <= MAX^0 + MIN^0 + j_min^0 + num^0 /\ 50001 + pid^0 <= MAX^0 + MIN^0 + j_min^0 + num^0 /\ 50001 <= MAX^0 + MIN^0 + j_min^0 + num^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 50001 + MIN^0 <= j_min^0 + num^0 + pid^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Quasi-ranking function: 50000 - MIN^0 - j_min^0 - num^0 + pid^0
New Graphs: 
Transitions:
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 <= MIN^0 + num^0 /\ MAX^0 <= 1 + j_min^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 + pid^0 <= 2*num^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + 2*num^0 /\ 50001 + MAX^0 + MIN^0 <= j_min^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + j_min^0 + pid^0 <= MIN^0 + 2*num^0 /\ 50001 + MAX^0 + j_min^0 <= MIN^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + pid^0 <= MIN^0 + j_min^0 + 2*num^0 /\ 50001 + MAX^0 <= MIN^0 + j_min^0 + 2*num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 + pid^0 <= MAX^0 + num^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + pid^0 /\ 50001 + MIN^0 <= MAX^0 + j_min^0 + num^0 + pid^0 /\ 50001 + 2*MIN^0 + pid^0 <= MAX^0 + j_min^0 + num^0 /\ 50001 + j_min^0 + pid^0 <= MAX^0 + MIN^0 + num^0 /\ 50001 + j_min^0 <= MAX^0 + MIN^0 + num^0 + pid^0 /\ 50001 <= MAX^0 + MIN^0 + j_min^0 + num^0 /\ 50001 + pid^0 <= MAX^0 + MIN^0 + j_min^0 + num^0 /\ 50001 <= MAX^0 + MIN^0 + j_min^0 + num^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 50001 + MIN^0 <= j_min^0 + num^0 + pid^0 /\ 50001 + pid^0 <= MIN^0 + j_min^0 + num^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Variables:
MAX^0, MIN^0, j_min^0, num^0, pid^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.005801s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.187410s
[54532 : 55037]
[54532 : 55038]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.076576s
Time used: 0.076573

LOG: SAT solveNonLinear - Elapsed time: 0.150923s
Cost: 1; Total time: 0.148483
Termination implied by a set of invariant(s):
Invariant at l2: MAX^0 <= MIN^0 + num^0 + pid^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= MIN^0 + num^0 + pid^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 <= MIN^0 + num^0 /\ 1 <= num^0 /\ MAX^0 <= 1 + j_min^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= MIN^0 + num^0 + pid^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 + num^0 <= MIN^0 /\ 1 <= MIN^0 + num^0 /\ 1 <= num^0 /\ MAX^0 <= 1 + j_min^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^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): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= MIN^0 + num^0 + pid^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 <= MIN^0 + num^0 /\ MAX^0 <= 1 + j_min^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 + pid^0 <= 2*num^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + 2*num^0 /\ 50001 + MAX^0 + MIN^0 <= j_min^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + j_min^0 + pid^0 <= MIN^0 + 2*num^0 /\ 50001 + MAX^0 + j_min^0 <= MIN^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + pid^0 <= MIN^0 + j_min^0 + 2*num^0 /\ 50001 + MAX^0 <= MIN^0 + j_min^0 + 2*num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 + pid^0 <= MAX^0 + num^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + pid^0 /\ 50001 + MIN^0 <= MAX^0 + j_min^0 + num^0 + pid^0 /\ 50001 + 2*MIN^0 + pid^0 <= MAX^0 + j_min^0 + num^0 /\ 50001 + j_min^0 + pid^0 <= MAX^0 + MIN^0 + num^0 /\ 50001 + j_min^0 <= MAX^0 + MIN^0 + num^0 + pid^0 /\ 50001 <= MAX^0 + MIN^0 + j_min^0 + num^0 /\ 50001 + pid^0 <= MAX^0 + MIN^0 + j_min^0 + num^0 /\ 50001 <= MAX^0 + MIN^0 + j_min^0 + num^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 50001 + MIN^0 <= j_min^0 + num^0 + pid^0 /\ 50001 + pid^0 <= MIN^0 + j_min^0 + num^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Quasi-ranking function: 50000 + MIN^0 + j_min^0 - num^0 - pid^0
New Graphs: 
Transitions:
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= MIN^0 + num^0 + pid^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 <= MIN^0 + num^0 /\ MAX^0 <= 1 + j_min^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 + pid^0 <= 2*num^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + 2*num^0 /\ 50001 + MAX^0 + MIN^0 <= j_min^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + j_min^0 + pid^0 <= MIN^0 + 2*num^0 /\ 50001 + MAX^0 + j_min^0 <= MIN^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + pid^0 <= MIN^0 + j_min^0 + 2*num^0 /\ 50001 + MAX^0 <= MIN^0 + j_min^0 + 2*num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 + pid^0 <= MAX^0 + num^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + pid^0 /\ 50001 + MIN^0 <= MAX^0 + j_min^0 + num^0 + pid^0 /\ 50001 + 2*MIN^0 + pid^0 <= MAX^0 + j_min^0 + num^0 /\ 50001 + j_min^0 + pid^0 <= MAX^0 + MIN^0 + num^0 /\ 50001 + j_min^0 <= MAX^0 + MIN^0 + num^0 + pid^0 /\ 50001 <= MAX^0 + MIN^0 + j_min^0 + num^0 /\ 50001 + pid^0 <= MAX^0 + MIN^0 + j_min^0 + num^0 /\ 50001 <= MAX^0 + MIN^0 + j_min^0 + num^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 + MIN^0 + j_min^0 <= num^0 + pid^0 /\ 50001 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 50001 + MIN^0 <= j_min^0 + num^0 + pid^0 /\ 50001 + pid^0 <= MIN^0 + j_min^0 + num^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Variables:
MAX^0, MIN^0, j_min^0, num^0, pid^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.006277s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.068957s
[54532 : 55191]
[54532 : 55192]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.108917s
Time used: 0.108915

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= MIN^0 + num^0 + pid^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 <= MIN^0 + num^0 /\ 1 <= num^0 /\ MAX^0 <= 1 + j_min^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= MIN^0 + num^0 + pid^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 + num^0 <= MIN^0 /\ 1 <= MIN^0 + num^0 /\ 1 <= num^0 /\ MAX^0 <= 1 + j_min^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^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): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= MIN^0 + num^0 + pid^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 <= MIN^0 + num^0 /\ MAX^0 <= 1 + j_min^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 + pid^0 <= 2*num^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + 2*num^0 /\ 50001 + MAX^0 + MIN^0 <= j_min^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + j_min^0 + pid^0 <= MIN^0 + 2*num^0 /\ 50001 + MAX^0 + j_min^0 <= MIN^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + pid^0 <= MIN^0 + j_min^0 + 2*num^0 /\ 50001 + MAX^0 <= MIN^0 + j_min^0 + 2*num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 + pid^0 <= MAX^0 + num^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + pid^0 /\ 50001 + MIN^0 <= MAX^0 + j_min^0 + num^0 + pid^0 /\ 50001 + 2*MIN^0 + pid^0 <= MAX^0 + j_min^0 + num^0 /\ 50001 + j_min^0 + pid^0 <= MAX^0 + MIN^0 + num^0 /\ 50001 + j_min^0 <= MAX^0 + MIN^0 + num^0 + pid^0 /\ 50001 <= MAX^0 + MIN^0 + j_min^0 + num^0 /\ 50001 + pid^0 <= MAX^0 + MIN^0 + j_min^0 + num^0 /\ 50001 <= MAX^0 + MIN^0 + j_min^0 + num^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 + MIN^0 + j_min^0 <= num^0 + pid^0 /\ 50001 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 50001 + MIN^0 <= j_min^0 + num^0 + pid^0 /\ 50001 + pid^0 <= MIN^0 + j_min^0 + num^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Quasi-ranking function: 50000 + MIN^0 + j_min^0 - num^0 + pid^0
New Graphs: 
Transitions:
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= MIN^0 + num^0 + pid^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 <= MIN^0 + num^0 /\ MAX^0 <= 1 + j_min^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 + pid^0 <= 2*num^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + 2*num^0 /\ 50001 + MAX^0 + MIN^0 <= j_min^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + j_min^0 + pid^0 <= MIN^0 + 2*num^0 /\ 50001 + MAX^0 + j_min^0 <= MIN^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + pid^0 <= MIN^0 + j_min^0 + 2*num^0 /\ 50001 + MAX^0 <= MIN^0 + j_min^0 + 2*num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 + pid^0 <= MAX^0 + num^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + pid^0 /\ 50001 + MIN^0 <= MAX^0 + j_min^0 + num^0 + pid^0 /\ 50001 + 2*MIN^0 + pid^0 <= MAX^0 + j_min^0 + num^0 /\ 50001 + j_min^0 + pid^0 <= MAX^0 + MIN^0 + num^0 /\ 50001 + j_min^0 <= MAX^0 + MIN^0 + num^0 + pid^0 /\ 50001 <= MAX^0 + MIN^0 + j_min^0 + num^0 /\ 50001 + pid^0 <= MAX^0 + MIN^0 + j_min^0 + num^0 /\ 50001 <= MAX^0 + MIN^0 + j_min^0 + num^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 + MIN^0 + j_min^0 + pid^0 <= num^0 /\ 50001 + MIN^0 + j_min^0 <= num^0 + pid^0 /\ 50001 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 50001 + MIN^0 <= j_min^0 + num^0 + pid^0 /\ 50001 + pid^0 <= MIN^0 + j_min^0 + num^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Variables:
MAX^0, MIN^0, j_min^0, num^0, pid^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.006218s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.467217s
[54532 : 55196]
[54532 : 55197]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.086052s
Time used: 0.086049

LOG: SAT solveNonLinear - Elapsed time: 0.157123s
Cost: 1; Total time: 0.15365
Termination implied by a set of invariant(s):
Invariant at l2: MAX^0 <= num^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= MIN^0 + num^0 + pid^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 <= MIN^0 + num^0 /\ 1 <= num^0 /\ MAX^0 <= 1 + j_min^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= MIN^0 + num^0 + pid^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 + num^0 <= MIN^0 /\ 1 <= MIN^0 + num^0 /\ 1 <= num^0 /\ MAX^0 <= 1 + j_min^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^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): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= MIN^0 + num^0 + pid^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 <= MIN^0 + num^0 /\ MAX^0 <= 1 + j_min^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 + pid^0 <= 2*num^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + 2*num^0 /\ 50001 + MAX^0 + MIN^0 <= j_min^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + j_min^0 + pid^0 <= MIN^0 + 2*num^0 /\ 50001 + MAX^0 + j_min^0 <= MIN^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + pid^0 <= MIN^0 + j_min^0 + 2*num^0 /\ 50001 + MAX^0 <= MIN^0 + j_min^0 + 2*num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 + pid^0 <= MAX^0 + num^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + pid^0 /\ 50001 + MIN^0 <= MAX^0 + j_min^0 + num^0 + pid^0 /\ 50001 + 2*MIN^0 + pid^0 <= MAX^0 + j_min^0 + num^0 /\ 50001 + j_min^0 + pid^0 <= MAX^0 + MIN^0 + num^0 /\ 50001 + j_min^0 <= MAX^0 + MIN^0 + num^0 + pid^0 /\ 50001 <= MAX^0 + MIN^0 + j_min^0 + num^0 /\ 50001 + pid^0 <= MAX^0 + MIN^0 + j_min^0 + num^0 /\ 50001 <= MAX^0 + MIN^0 + j_min^0 + num^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 + MIN^0 + j_min^0 + pid^0 <= num^0 /\ 50001 + MIN^0 + j_min^0 <= num^0 + pid^0 /\ 50001 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 50001 + MIN^0 <= j_min^0 + num^0 + pid^0 /\ 50001 + pid^0 <= MIN^0 + j_min^0 + num^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Quasi-ranking function: 50000 - MIN^0 + j_min^0 - num^0 + pid^0
New Graphs: 
Transitions:
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= MIN^0 + num^0 + pid^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 <= MIN^0 + num^0 /\ MAX^0 <= 1 + j_min^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 + pid^0 <= 2*num^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + 2*num^0 /\ 50001 + MAX^0 + MIN^0 <= j_min^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + j_min^0 + pid^0 <= MIN^0 + 2*num^0 /\ 50001 + MAX^0 + j_min^0 <= MIN^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + pid^0 <= MIN^0 + j_min^0 + 2*num^0 /\ 50001 + MAX^0 <= MIN^0 + j_min^0 + 2*num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 + pid^0 <= MAX^0 + num^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + pid^0 /\ 50001 + MIN^0 <= MAX^0 + j_min^0 + num^0 + pid^0 /\ 50001 + 2*MIN^0 + pid^0 <= MAX^0 + j_min^0 + num^0 /\ 50001 + j_min^0 + pid^0 <= MAX^0 + MIN^0 + num^0 /\ 50001 + j_min^0 <= MAX^0 + MIN^0 + num^0 + pid^0 /\ 50001 <= MAX^0 + MIN^0 + j_min^0 + num^0 /\ 50001 + pid^0 <= MAX^0 + MIN^0 + j_min^0 + num^0 /\ 50001 <= MAX^0 + MIN^0 + j_min^0 + num^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 + MIN^0 + j_min^0 + pid^0 <= num^0 /\ 50001 + MIN^0 + j_min^0 <= num^0 + pid^0 /\ 50001 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 50001 + MIN^0 <= j_min^0 + num^0 + pid^0 /\ 50001 + j_min^0 + pid^0 <= MIN^0 + num^0 /\ 50001 + pid^0 <= MIN^0 + j_min^0 + num^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Variables:
MAX^0, MIN^0, j_min^0, num^0, pid^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.006309s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.048022s
[54532 : 55201]
[54532 : 55202]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.091412s
Time used: 0.09141

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= MIN^0 + num^0 + pid^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 <= MIN^0 + num^0 /\ 1 <= MIN^0 + pid^0 /\ 1 <= num^0 /\ MAX^0 <= 1 + j_min^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= MIN^0 + num^0 + pid^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 + num^0 <= MIN^0 /\ 1 <= MIN^0 + num^0 /\ 1 <= MIN^0 + pid^0 /\ 1 <= num^0 /\ MAX^0 <= 1 + j_min^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^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): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= MIN^0 + num^0 + pid^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 <= MIN^0 + num^0 /\ 1 <= MIN^0 + pid^0 /\ MAX^0 <= 1 + j_min^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 + pid^0 <= 2*num^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + 2*num^0 /\ 50001 + MAX^0 + MIN^0 <= j_min^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + j_min^0 + pid^0 <= MIN^0 + 2*num^0 /\ 50001 + MAX^0 + j_min^0 <= MIN^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + pid^0 <= MIN^0 + j_min^0 + 2*num^0 /\ 50001 + MAX^0 <= MIN^0 + j_min^0 + 2*num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 + pid^0 <= MAX^0 + num^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + pid^0 /\ 50001 + MIN^0 <= MAX^0 + j_min^0 + num^0 + pid^0 /\ 50001 + 2*MIN^0 + pid^0 <= MAX^0 + j_min^0 + num^0 /\ 50001 + j_min^0 + pid^0 <= MAX^0 + MIN^0 + num^0 /\ 50001 + j_min^0 <= MAX^0 + MIN^0 + num^0 + pid^0 /\ 50001 <= MAX^0 + MIN^0 + j_min^0 + num^0 /\ 50001 + pid^0 <= MAX^0 + MIN^0 + j_min^0 + num^0 /\ 50001 <= MAX^0 + MIN^0 + j_min^0 + num^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 + MIN^0 + j_min^0 + pid^0 <= num^0 /\ 50001 + MIN^0 + j_min^0 <= num^0 + pid^0 /\ 50001 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 50001 + MIN^0 <= j_min^0 + num^0 + pid^0 /\ 50001 + j_min^0 + pid^0 <= MIN^0 + num^0 /\ 50001 + pid^0 <= MIN^0 + j_min^0 + num^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Quasi-ranking function: 50000 - MAX^0 - MIN^0 - j_min^0
New Graphs: 
Transitions:
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= MIN^0 + num^0 + pid^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 <= MIN^0 + num^0 /\ 1 <= MIN^0 + pid^0 /\ MAX^0 <= 1 + j_min^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 + pid^0 <= 2*num^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + 2*num^0 /\ 50001 + MAX^0 + MIN^0 <= j_min^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + j_min^0 + pid^0 <= MIN^0 + 2*num^0 /\ 50001 + MAX^0 + j_min^0 <= MIN^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + pid^0 <= MIN^0 + j_min^0 + 2*num^0 /\ 50001 + MAX^0 <= MIN^0 + j_min^0 + 2*num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 + pid^0 <= MAX^0 + num^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + pid^0 /\ 50001 + MIN^0 <= MAX^0 + j_min^0 + num^0 + pid^0 /\ 50001 + 2*MIN^0 + pid^0 <= MAX^0 + j_min^0 + num^0 /\ 50001 + j_min^0 + pid^0 <= MAX^0 + MIN^0 + num^0 /\ 50001 + j_min^0 <= MAX^0 + MIN^0 + num^0 + pid^0 /\ 50001 <= MAX^0 + MIN^0 + j_min^0 /\ 50001 <= MAX^0 + MIN^0 + j_min^0 + num^0 /\ 50001 + pid^0 <= MAX^0 + MIN^0 + j_min^0 + num^0 /\ 50001 <= MAX^0 + MIN^0 + j_min^0 + num^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 + MIN^0 + j_min^0 + pid^0 <= num^0 /\ 50001 + MIN^0 + j_min^0 <= num^0 + pid^0 /\ 50001 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 50001 + MIN^0 <= j_min^0 + num^0 + pid^0 /\ 50001 + j_min^0 + pid^0 <= MIN^0 + num^0 /\ 50001 + pid^0 <= MIN^0 + j_min^0 + num^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Variables:
MAX^0, MIN^0, j_min^0, num^0, pid^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.006545s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.559230s
[54532 : 55399]
[54532 : 55400]
Timeout expired!
Termination failed. Trying to show unreachability...
Proving unreachability of entry: <l0, l2, undef135 <= undef133 /\ 1 <= undef135 /\ 1 <= undef141 /\ 1 <= undef143 /\ MIN^0 = undef135 /\ j_min^0 = undef141 /\ pid^0 = undef143 /\ MAX^0 = 1 + undef133 /\ num^0 = 1 + undef133, {all remain the same}>

LOG: CALL check - Post:1 <= 0 - Process 1
* Exit transition: <l0, l2, undef135 <= undef133 /\ 1 <= undef135 /\ 1 <= undef141 /\ 1 <= undef143 /\ MIN^0 = undef135 /\ j_min^0 = undef141 /\ pid^0 = undef143 /\ MAX^0 = 1 + undef133 /\ num^0 = 1 + undef133, {all remain the same}>
* Postcondition  : 1 <= 0

LOG: CALL solveLinear

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

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

[54532 : 55418]
[54532 : 55419]
Successful child: 55418

Program does NOT terminate