/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, l5, ((0 + conditional^0) <= 1), par{IoCreateDevice^0 -> 0, status^0 -> 1}>
<l4, l1, (2 <= (0 + conditional^0)) /\ (undef37 = undef37), par{IoCreateDevice^0 -> 0, Pdo^0 -> 0, conditional^0 -> undef37}>
<l2, l6, true, par{PPBunlockInits^0 -> 1, num^0 -> 0}>
<l6, l2, true>
<l7, l2, ((0 + DName^0) <= 0)>
<l7, l4, (1 <= (0 + DName^0)) /\ (undef77 = undef77), par{IoCreateDevice^0 -> 1, conditional^0 -> undef77}>
<l5, l3, true, par{i^0 -> (~(1) + i^0)}>
<l5, l3, true, par{i^0 -> (1 + i^0)}>
<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, (undef128 = undef128) /\ (undef126 = undef126), par{IoCreateDevice^0 -> 0, PPBlockInits^0 -> 1, PPBunlockInits^0 -> 0, Pdolen^0 -> undef126, i^0 -> undef128, status^0 -> 0}>
<l9, l8, true>

Fresh variables:
undef37, undef77, undef111, undef126, undef128, 

Undef variables:
undef37, undef77, undef111, undef126, undef128, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l3, (Pdolen^0 = undef126) /\ (i^0 = undef128) /\ (undef128 = undef128) /\ (undef126 = undef126)>
<l2, l2, true, 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)) /\ (undef77 = undef77) /\ ((0 + undef77) <= 1), par{i^0 -> (~(1) + i^0)}>
<l3, l3, ((1 + i^0) <= (0 + Pdolen^0)) /\ (undef111 = undef111) /\ (1 <= (0 + undef111)) /\ (undef77 = undef77) /\ ((0 + undef77) <= 1), par{i^0 -> (1 + i^0)}>
<l3, l2, ((1 + i^0) <= (0 + Pdolen^0)) /\ (undef111 = undef111) /\ (1 <= (0 + undef111)) /\ (undef77 = undef77) /\ (2 <= (0 + undef77)) /\ (undef37 = undef37) /\ ((0 + undef37) <= 1)>
<l3, l3, ((1 + i^0) <= (0 + Pdolen^0)) /\ (undef111 = undef111) /\ (1 <= (0 + undef111)) /\ (undef77 = undef77) /\ (2 <= (0 + undef77)) /\ (undef37 = undef37) /\ (2 <= (0 + undef37)), par{num^0 -> (1 + num^0)}>

Fresh variables:
undef37, undef77, undef111, undef126, undef128, 

Undef variables:
undef37, undef77, undef111, undef126, undef128, 

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 /\ undef77 <= 1, {i^0 -> -1 + i^0, rest remain the same}>
<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ undef77 <= 1, {i^0 -> 1 + i^0, rest remain the same}>
<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ 2 <= undef37 /\ 2 <= undef77, {num^0 -> 1 + num^0, rest remain the same}>
Variables:
Pdolen^0, i^0, num^0

Graph 2:
Transitions:
<l2, l2, true, {num^0 -> 0, rest remain the same}>
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l3, Pdolen^0 = undef126 /\ i^0 = undef128, {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 <= undef77 /\ undef37 <= 1, {all remain the same}>

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

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

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

Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001799s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.011344s
[32564 : 32565]
[32564 : 32566]
Successful child: 32565
[ 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 /\ undef77 <= 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 /\ undef77 <= 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 <= undef37 /\ 2 <= undef77, {num^0 -> 1 + num^0, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ 2 <= undef37 /\ 2 <= undef77, {num^0 -> 1 + num^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 /\ undef77 <= 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 /\ undef77 <= 1, {i^0 -> 1 + i^0, rest remain the same}>
New Graphs: 

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

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000802s
INVARIANTS: 
3: 
Quasi-INVARIANTS to narrow Graph: 
3: 1 + Pdolen^0 <= i^0 , 
Narrowing transition: 
<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ undef77 <= 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 /\ undef77 <= 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 <= undef37 /\ 2 <= undef77, {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 /\ undef77 <= 1, {i^0 -> -1 + i^0, rest remain the same}>
<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ undef77 <= 1, {i^0 -> 1 + i^0, rest remain the same}>
<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ 2 <= undef37 /\ 2 <= undef77, {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.001606s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.011616s
[32564 : 32570]
[32564 : 32571]
Successful child: 32570
[ 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 /\ undef77 <= 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 /\ undef77 <= 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 <= undef37 /\ 2 <= undef77, {num^0 -> 1 + num^0, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ undef77 <= 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 /\ undef77 <= 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 <= undef37 /\ 2 <= undef77, {num^0 -> 1 + num^0, rest remain the same}>
New Graphs: 

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

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000894s
INVARIANTS: 
3: 
Quasi-INVARIANTS to narrow Graph: 
3: Pdolen^0 <= i^0 , 
Narrowing transition: 
<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ undef77 <= 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 /\ undef77 <= 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 <= undef37 /\ 2 <= undef77, {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 /\ undef77 <= 1, {i^0 -> -1 + i^0, rest remain the same}>
<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ undef77 <= 1, {i^0 -> 1 + i^0, rest remain the same}>
<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ 2 <= undef37 /\ 2 <= undef77, {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.001586s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.011647s
[32564 : 32575]
[32564 : 32576]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.080597s
Time used: 0.08059

LOG: SAT solveNonLinear - Elapsed time: 0.117325s
Cost: 1; Total time: 0.116348
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 /\ undef77 <= 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 /\ undef77 <= 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 <= undef37 /\ 2 <= undef77, {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 /\ undef77 <= 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 /\ undef77 <= 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 <= undef37 /\ 2 <= undef77, {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 /\ undef77 <= 1, {i^0 -> -1 + i^0, rest remain the same}>
<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ undef77 <= 1, {i^0 -> 1 + i^0, rest remain the same}>
<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ 2 <= undef37 /\ 2 <= undef77 /\ 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.001665s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.013450s
[32564 : 32580]
[32564 : 32581]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.065910s
Time used: 0.065904

LOG: SAT solveNonLinear - Elapsed time: 0.099430s
Cost: 1; Total time: 0.097867
Quasi-ranking function: 50000 + Pdolen^0 - num^0
New Graphs: 
Transitions:
<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ undef77 <= 1, {i^0 -> -1 + i^0, rest remain the same}>
<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ undef77 <= 1, {i^0 -> 1 + i^0, rest remain the same}>
<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ 2 <= undef37 /\ 2 <= undef77 /\ 50001 + 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.001898s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.014903s
[32564 : 32681]
[32564 : 32682]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.074946s
Time used: 0.074941

LOG: SAT solveNonLinear - Elapsed time: 0.107088s
Cost: 1; Total time: 0.105186
Quasi-ranking function: 50000 - Pdolen^0 - num^0
New Graphs: 
Transitions:
<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ undef77 <= 1, {i^0 -> -1 + i^0, rest remain the same}>
<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ undef77 <= 1, {i^0 -> 1 + i^0, rest remain the same}>
<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ 2 <= undef37 /\ 2 <= undef77 /\ 50001 + Pdolen^0 <= num^0 /\ 50001 <= 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.001970s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.015157s
[32564 : 32686]
[32564 : 32687]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.037672s
Time used: 0.035973

[32564 : 32691]
[32564 : 32695]
Successful child: 32695

Program does NOT terminate