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


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


NO

Solver Timeout: 4
Global Timeout: 300
Maximum number of concurrent processes: 900
No parsing errors!
Init Location: 0
Transitions:
<l0, l9, true>
<l1, l2, ((0 + conditional^0) <= 1)>
<l1, l3, (2 <= (0 + conditional^0)), par{num^0 -> (1 + num^0)}>
<l4, l3, ((0 + conditional^0) <= 1), par{IoCreateDevice^0 -> 0, i^0 -> (1 + i^0), status^0 -> 1}>
<l4, l1, (2 <= (0 + conditional^0)) /\ (undef40 = undef40), par{IoCreateDevice^0 -> 0, Pdo^0 -> 0, conditional^0 -> undef40}>
<l2, l5, (1 <= (0 + rho_1^0)), par{rho_1^0 -> (~(1) + rho_1^0)}>
<l5, l2, true>
<l2, l6, ((0 + rho_1^0) <= 0), par{PPBunlockInits^0 -> 1, num^0 -> 0}>
<l7, l2, ((0 + DName^0) <= 0)>
<l7, l4, (1 <= (0 + DName^0)) /\ (undef95 = undef95), par{IoCreateDevice^0 -> 1, conditional^0 -> undef95}>
<l3, l2, ((0 + Pdolen^0) <= (0 + i^0)), par{status^0 -> 0}>
<l3, l7, ((1 + i^0) <= (0 + Pdolen^0)) /\ (undef111 = undef111), par{DName^0 -> undef111, PPBlockInits^0 -> 1, status^0 -> 0}>
<l8, l3, (undef129 = undef129) /\ (undef127 = undef127), par{IoCreateDevice^0 -> 0, PPBlockInits^0 -> 1, PPBunlockInits^0 -> 0, Pdolen^0 -> undef127, i^0 -> undef129, status^0 -> 0}>
<l9, l8, true>

Fresh variables:
undef40, undef95, undef111, undef127, undef129, 

Undef variables:
undef40, undef95, undef111, undef127, undef129, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l3, (Pdolen^0 = undef127) /\ (i^0 = undef129) /\ (undef129 = undef129) /\ (undef127 = undef127)>
<l2, l2, (1 <= (0 + rho_1^0)), par{rho_1^0 -> (~(1) + rho_1^0)}>
<l2, l6, ((0 + rho_1^0) <= 0), par{num^0 -> 0}>
<l3, l2, ((0 + Pdolen^0) <= (0 + i^0))>
<l3, l2, ((1 + i^0) <= (0 + Pdolen^0)) /\ (undef111 = undef111) /\ ((0 + undef111) <= 0)>
<l3, l3, ((1 + i^0) <= (0 + Pdolen^0)) /\ (undef111 = undef111) /\ (1 <= (0 + undef111)) /\ (undef95 = undef95) /\ ((0 + undef95) <= 1), par{i^0 -> (1 + i^0)}>
<l3, l2, ((1 + i^0) <= (0 + Pdolen^0)) /\ (undef111 = undef111) /\ (1 <= (0 + undef111)) /\ (undef95 = undef95) /\ (2 <= (0 + undef95)) /\ (undef40 = undef40) /\ ((0 + undef40) <= 1)>
<l3, l3, ((1 + i^0) <= (0 + Pdolen^0)) /\ (undef111 = undef111) /\ (1 <= (0 + undef111)) /\ (undef95 = undef95) /\ (2 <= (0 + undef95)) /\ (undef40 = undef40) /\ (2 <= (0 + undef40)), par{num^0 -> (1 + num^0)}>

Fresh variables:
undef40, undef95, undef111, undef127, undef129, 

Undef variables:
undef40, undef95, undef111, undef127, undef129, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ undef95 <= 1, {i^0 -> 1 + i^0, rest remain the same}>
<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ 2 <= undef40 /\ 2 <= undef95, {num^0 -> 1 + num^0, rest remain the same}>
Variables:
Pdolen^0, i^0, num^0

Graph 2:
Transitions:
<l2, l2, 1 <= rho_1^0, {rho_1^0 -> -1 + rho_1^0, rest remain the same}>
Variables:
rho_1^0

Graph 3:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l3, Pdolen^0 = undef127 /\ i^0 = undef129, {all remain the same}>

Graph 2
<l3, l2, Pdolen^0 <= i^0, {all remain the same}>
<l3, l2, undef111 <= 0 /\ 1 + i^0 <= Pdolen^0, {all remain the same}>
<l3, l2, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ 2 <= undef95 /\ undef40 <= 1, {all remain the same}>

Graph 3
<l2, l6, rho_1^0 <= 0, {num^0 -> 0, rest remain the same}>

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

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

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

Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001628s
Ranking function: -6 + 6*Pdolen^0 - 6*i^0
New Graphs: 
Transitions:
<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ 2 <= undef40 /\ 2 <= undef95, {num^0 -> 1 + num^0, rest remain the same}>
Variables:
Pdolen^0, i^0, num^0
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000697s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002755s
[52256 : 52257]
[52256 : 52258]
Successful child: 52257
[ 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: 
<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ undef95 <= 1, {i^0 -> 1 + i^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ 2 <= undef40 /\ 2 <= undef95, {num^0 -> 1 + num^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: 
<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ 2 <= undef40 /\ 2 <= undef95, {num^0 -> 1 + num^0, rest remain the same}>
New Graphs: 

LOG: CALL check - Post:Pdolen^0 <= i^0 - Process 1
* Exit transition: <l0, l3, Pdolen^0 = undef127 /\ i^0 = undef129, {all remain the same}>
* Postcondition  : Pdolen^0 <= i^0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000744s
INVARIANTS: 
3: 
Quasi-INVARIANTS to narrow Graph: 
3: Pdolen^0 <= i^0 , 
Narrowing transition: 
<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ undef95 <= 1, {i^0 -> 1 + i^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ 2 <= undef40 /\ 2 <= undef95, {num^0 -> 1 + num^0, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ undef95 <= 1, {i^0 -> 1 + i^0, rest remain the same}>
<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ 2 <= undef40 /\ 2 <= undef95, {num^0 -> 1 + num^0, rest remain the same}>
Variables:
Pdolen^0, i^0, num^0
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001669s
Ranking function: -6 + 6*Pdolen^0 - 6*i^0
New Graphs: 
Transitions:
<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ 2 <= undef40 /\ 2 <= undef95, {num^0 -> 1 + num^0, rest remain the same}>
Variables:
Pdolen^0, i^0, num^0
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000718s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002879s
[52256 : 52262]
[52256 : 52263]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.020527s
Time used: 0.020522

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ undef95 <= 1, {i^0 -> 1 + i^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000798s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003182s
[52256 : 52277]
[52256 : 52278]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.021462s
Time used: 0.021458

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ undef95 <= 1, {i^0 -> 1 + i^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000930s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003973s
[52256 : 52284]
[52256 : 52285]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.013674s
Time used: 0.013669

LOG: SAT solveNonLinear - Elapsed time: 0.027226s
Cost: 1; Total time: 0.026596
Termination implied by a set of invariant(s):
Invariant at l3: i^0 <= Pdolen^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ undef95 <= 1, {i^0 -> 1 + i^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001007s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004210s
[52256 : 52289]
[52256 : 52290]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.017532s
Time used: 0.017527

LOG: SAT solveNonLinear - Elapsed time: 0.030349s
Cost: 1; Total time: 0.029426
Quasi-ranking function: 50000 - Pdolen^0 - 50001*i^0 - num^0
New Graphs: 
Transitions:
<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ 2 <= undef40 /\ 2 <= undef95 /\ 50001 + Pdolen^0 <= i^0 + num^0 /\ 50001 + i^0 <= Pdolen^0 + num^0 /\ 50001 <= Pdolen^0 + 50001*i^0 + num^0 /\ 50001 <= num^0, {num^0 -> 1 + num^0, rest remain the same}>
Variables:
Pdolen^0, i^0, num^0
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001145s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.005878s
[52256 : 52294]
[52256 : 52295]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.018292s
Time used: 0.018287

LOG: SAT solveNonLinear - Elapsed time: 0.033010s
Cost: 1; Total time: 0.032304
Quasi-ranking function: 50000 + 50004*Pdolen^0 + i^0 - num^0
New Graphs: 
Transitions:
<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ 2 <= undef40 /\ 2 <= undef95 /\ 50001 + Pdolen^0 <= i^0 + num^0 /\ 50001 + i^0 <= Pdolen^0 + num^0 /\ 50001 <= Pdolen^0 + 50001*i^0 + num^0 /\ 50001 + 50004*Pdolen^0 + i^0 <= num^0 /\ 50001 <= num^0, {num^0 -> 1 + num^0, rest remain the same}>
Variables:
Pdolen^0, i^0, num^0
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001264s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.011075s
[52256 : 52299]
[52256 : 52300]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.017996s
Time used: 0.017991

LOG: SAT solveNonLinear - Elapsed time: 0.032871s
Cost: 1; Total time: 0.032164
Quasi-ranking function: 50000 - i^0 - num^0
New Graphs: 
Transitions:
<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ 2 <= undef40 /\ 2 <= undef95 /\ 50001 + Pdolen^0 <= i^0 + num^0 /\ 50001 + i^0 <= Pdolen^0 + num^0 /\ 50001 <= Pdolen^0 + 50001*i^0 + num^0 /\ 50001 + 50004*Pdolen^0 + i^0 <= num^0 /\ 50001 <= i^0 + num^0 /\ 50001 <= num^0, {num^0 -> 1 + num^0, rest remain the same}>
Variables:
Pdolen^0, i^0, num^0
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001362s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.009095s
[52256 : 52315]
[52256 : 52316]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.019366s
Time used: 0.019361

LOG: SAT solveNonLinear - Elapsed time: 0.033952s
Cost: 1; Total time: 0.033229
Quasi-ranking function: 50000 + i^0 - num^0
New Graphs: 
Transitions:
<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ 2 <= undef40 /\ 2 <= undef95 /\ 50001 + Pdolen^0 <= i^0 + num^0 /\ 50001 + i^0 <= Pdolen^0 + num^0 /\ 50001 <= Pdolen^0 + 50001*i^0 + num^0 /\ 50001 + 50004*Pdolen^0 + i^0 <= num^0 /\ 50001 + i^0 <= num^0 /\ 50001 <= i^0 + num^0 /\ 50001 <= num^0, {num^0 -> 1 + num^0, rest remain the same}>
Variables:
Pdolen^0, i^0, num^0
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001442s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.011100s
[52256 : 52322]
[52256 : 52323]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.017567s
Time used: 0.017562

LOG: SAT solveNonLinear - Elapsed time: 0.033178s
Cost: 1; Total time: 0.032426
Quasi-ranking function: 50000 + Pdolen^0 - num^0
New Graphs: 
Transitions:
<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ 2 <= undef40 /\ 2 <= undef95 /\ 50001 + Pdolen^0 <= i^0 + num^0 /\ 50001 + Pdolen^0 <= num^0 /\ 50001 + i^0 <= Pdolen^0 + num^0 /\ 50001 <= Pdolen^0 + 50001*i^0 + num^0 /\ 50001 + 50004*Pdolen^0 + i^0 <= num^0 /\ 50001 + i^0 <= num^0 /\ 50001 <= i^0 + num^0 /\ 50001 <= num^0, {num^0 -> 1 + num^0, rest remain the same}>
Variables:
Pdolen^0, i^0, num^0
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001540s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008024s
[52256 : 52327]
[52256 : 52328]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.018020s
Time used: 0.018015

LOG: SAT solveNonLinear - Elapsed time: 0.033964s
Cost: 1; Total time: 0.032677
Quasi-ranking function: 50000 - Pdolen^0 - num^0
New Graphs: 
Transitions:
<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ 2 <= undef40 /\ 2 <= undef95 /\ 50001 + Pdolen^0 <= i^0 + num^0 /\ 50001 + Pdolen^0 <= num^0 /\ 50001 + i^0 <= Pdolen^0 + num^0 /\ 50001 <= Pdolen^0 + 50001*i^0 + num^0 /\ 50001 <= Pdolen^0 + num^0 /\ 50001 + 50004*Pdolen^0 + i^0 <= num^0 /\ 50001 + i^0 <= num^0 /\ 50001 <= i^0 + num^0 /\ 50001 <= num^0, {num^0 -> 1 + num^0, rest remain the same}>
Variables:
Pdolen^0, i^0, num^0
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001673s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.019127s
[52256 : 52332]
[52256 : 52333]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.015065s
Time used: 0.013912

[52256 : 52337]
[52256 : 52341]
Successful child: 52341

Program does NOT terminate