Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
...............
=====================================================================
Generated by BenchKit 2-3253
Executing tool lola
Input is S_SmallOperatingSystem-PT-MT8192DC2048, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r158-ebro-149443463900052
=====================================================================

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-0
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-1
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-10
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-11
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-12
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-13
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-14
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-15
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-2
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-3
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-4
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-5
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-6
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-7
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-8
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-9

=== Now, execution of the tool begins

BK_START 1496557708061


Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_SmallOperatingSystem-PT-MT8192DC2048: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
S_SmallOperatingSystem-PT-MT8192DC2048: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
ReachabilityCardinality @ S_SmallOperatingSystem-PT-MT8192DC2048 @ 3540 seconds
----- Start make result stdout -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 17/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 9 places, 8 transitions, 5 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 10 transition conflict sets
lola: TASK
lola: reading formula from SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality.task
lola: E (F (((ExecutingTask <= 2) AND (CPUUnit + 1 <= ExecutingTask) AND (FreeMemSegment <= LoadingMem)))) : A (G (((2 <= DiskControllerUnit) OR (2 <= DiskControllerUnit)))) : A (G (((FreeMemSegment + 1 <= TaskOnDisk) OR (FreeMemSegment <= 0) OR (TaskReady + 1 <= FreeMemSegment)))) : A (G ((((ExecutingTask <= 2) OR (TransferToDisk <= 2))))) : E (F (())) : A (G ((2 <= FreeMemSegment))) : E (F ((DiskControllerUnit + 1 <= TaskReady))) : A (G ((TaskSuspended <= TaskOnDisk))) : E (F (((2 <= TaskSuspended) AND (CPUUnit <= 1) AND ((TransferToDisk <= 1))))) : E (F (((FreeMemSegment + 1 <= DiskControllerUnit) AND (DiskControllerUnit <= TransferToDisk) AND ((2 <= TransferToDisk) OR (TaskReady <= DiskControllerUnit) OR ((CPUUnit <= TaskSuspended) AND (3 <= TransferToDisk)))))) : A (G (((TaskReady <= DiskControllerUnit) AND (((2 <= TaskOnDisk) AND (1 <= CPUUnit)) OR ((3 <= CPUUnit) AND (TaskReady <= TaskSuspended)))))) : A (G (((FreeMemSegment + 1 <= TaskSuspended) OR (TaskReady + 1 <= TaskOnDisk) OR ((CPUUnit <= 0) AND (LoadingMem + 1 <= ExecutingTask))))) : A (G ((LoadingMem + 1 <= CPUUnit))) : A (G ((2 <= DiskControllerUnit))) : A (G ((LoadingMem <= DiskControllerUnit))) : E (F (((ExecutingTask <= CPUUnit) AND (2 <= TaskOnDisk) AND ((3 <= FreeMemSegment) OR (3 <= LoadingMem)) AND (LoadingMem + 1 <= TransferToDisk) AND (TransferToDisk <= 0))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((ExecutingTask <= 2) AND (CPUUnit + 1 <= ExecutingTask) AND (FreeMemSegment <= LoadingMem))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= DiskControllerUnit) OR (2 <= DiskControllerUnit))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((FreeMemSegment + 1 <= TaskOnDisk) OR (FreeMemSegment <= 0) OR (TaskReady + 1 <= FreeMemSegment))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-2.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((ExecutingTask <= 2) OR (TransferToDisk <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-3.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (()))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 3 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= FreeMemSegment)))
lola: ========================================
lola: SUBTASK
lola: sara: try reading problem file SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-3.sara.checking invariance

lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
sara: place or transition ordering is non-deterministic
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-5.sara

lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-5.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((DiskControllerUnit + 1 <= TaskReady)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((TaskSuspended <= TaskOnDisk)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-7.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= TaskSuspended) AND (CPUUnit <= 1) AND ((TransferToDisk <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-8.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 2382878 markings, 4166803 edges, 476576 markings/sec, 0 secs
lola: sara is running 5 secs || 4431660 markings, 7751045 edges, 409756 markings/sec, 5 secs
lola: sara is running 10 secs || 6286440 markings, 10996692 edges, 370956 markings/sec, 10 secs
lola: sara is running 15 secs || 8093885 markings, 14158676 edges, 361489 markings/sec, 15 secs
lola: sara is running 20 secs || 9863343 markings, 17254721 edges, 353892 markings/sec, 20 secs
lola: sara is running 25 secs || 11633044 markings, 20351196 edges, 353940 markings/sec, 25 secs
lola: sara is running 30 secs || 13404351 markings, 23450778 edges, 354261 markings/sec, 30 secs
lola: sara is running 35 secs || 15166281 markings, 26533427 edges, 352386 markings/sec, 35 secs
lola: sara is running 40 secs || 16912219 markings, 29588944 edges, 349188 markings/sec, 40 secs
lola: sara is running 45 secs || 18642476 markings, 32616925 edges, 346051 markings/sec, 45 secs
lola: sara is running 50 secs || 20352797 markings, 35609578 edges, 342064 markings/sec, 50 secs
lola: sara is running 55 secs || 22057422 markings, 38592029 edges, 340925 markings/sec, 55 secs
lola: sara is running 60 secs || 23752918 markings, 41559771 edges, 339099 markings/sec, 60 secs
lola: sara is running 65 secs || 25444597 markings, 44518542 edges, 338336 markings/sec, 65 secs
lola: sara is running 70 secs || 27123461 markings, 47455478 edges, 335773 markings/sec, 70 secs
lola: sara is running 75 secs || 28800821 markings, 50391151 edges, 335472 markings/sec, 75 secs
lola: sara is running 80 secs || 30470395 markings, 53314336 edges, 333915 markings/sec, 80 secs
lola: sara is running 85 secs || 32124496 markings, 56206949 edges, 330820 markings/sec, 85 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 9 will run for 492 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FreeMemSegment + 1 <= DiskControllerUnit) AND (DiskControllerUnit <= TransferToDisk) AND ((2 <= TransferToDisk) OR (TaskReady <= DiskControllerUnit) OR ((CPUUnit <= TaskSuspended) AND (3 <= TransferToDisk))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 10 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-9.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 2234483 markings, 3658747 edges, 446897 markings/sec, 0 secs
lola: sara is running 5 secs || 4392982 markings, 7186939 edges, 431700 markings/sec, 5 secs
lola: sara is running 10 secs || 6539686 markings, 10693688 edges, 429341 markings/sec, 10 secs
lola: sara is running 15 secs || 8624198 markings, 14096171 edges, 416902 markings/sec, 15 secs
lola: sara is running 20 secs || 10710458 markings, 17498564 edges, 417252 markings/sec, 20 secs
lola: sara is running 25 secs || 12812026 markings, 20924457 edges, 420314 markings/sec, 25 secs
lola: sara is running 30 secs || 14891771 markings, 24311801 edges, 415949 markings/sec, 30 secs
lola: sara is running 35 secs || 16924472 markings, 27618779 edges, 406540 markings/sec, 35 secs
lola: sara is running 40 secs || 18994673 markings, 30985464 edges, 414040 markings/sec, 40 secs
lola: sara is running 45 secs || 21024505 markings, 34284781 edges, 405966 markings/sec, 45 secs
lola: sara is running 50 secs || 23090024 markings, 37638308 edges, 413104 markings/sec, 50 secs
lola: sara is running 55 secs || 25171300 markings, 41013659 edges, 416255 markings/sec, 55 secs
lola: sara is running 60 secs || 27213052 markings, 44322743 edges, 408350 markings/sec, 60 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: sara is running 65 secs || 29239206 markings, 47602833 edges, 405231 markings/sec, 65 secs
lola: ========================================
lola: subprocess 10 will run for 562 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((TaskReady <= DiskControllerUnit) AND (((2 <= TaskOnDisk) AND (1 <= CPUUnit)) OR ((3 <= CPUUnit) AND (TaskReady <= TaskSuspended))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 9 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-10.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 11 will run for 675 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((FreeMemSegment + 1 <= TaskSuspended) OR (TaskReady + 1 <= TaskOnDisk) OR ((CPUUnit <= 0) AND (LoadingMem + 1 <= ExecutingTask)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-11.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 12 will run for 844 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((LoadingMem + 1 <= CPUUnit)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-12.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 13 will run for 1125 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= DiskControllerUnit)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-13.sara
lola: lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 14 will run for 1687 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((LoadingMem <= DiskControllerUnit)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-14.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 15 will run for 3375 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((ExecutingTask <= CPUUnit) AND (2 <= TaskOnDisk) AND ((3 <= FreeMemSegment) OR (3 <= LoadingMem)) AND (LoadingMem + 1 <= TransferToDisk) AND (TransferToDisk <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 10 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-15.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes no no no yes yes yes yes no no no no no no
FORMULA SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496557873092

--------------------
content from stderr:

----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="S_SmallOperatingSystem-PT-MT8192DC2048"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/S_SmallOperatingSystem-PT-MT8192DC2048.tgz
mv S_SmallOperatingSystem-PT-MT8192DC2048 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3253"
echo " Executing tool lola"
echo " Input is S_SmallOperatingSystem-PT-MT8192DC2048, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r158-ebro-149443463900052"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;