fond
Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r158-ebro-149443463900063
Last Updated
June 27, 2017

About the Execution of LoLA for S_SmallOperatingSystem-PT-MT8192DC4096

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
7834.460 253145.00 257887.00 85.20 TFFFFFTF?TTTFFTF normal

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-MT8192DC4096, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r158-ebro-149443463900063
=====================================================================


--------------------
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-MT8192DC4096-ReachabilityFireability-0
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-ReachabilityFireability-1
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-ReachabilityFireability-10
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-ReachabilityFireability-11
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-ReachabilityFireability-12
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-ReachabilityFireability-13
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-ReachabilityFireability-14
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-ReachabilityFireability-15
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-ReachabilityFireability-2
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-ReachabilityFireability-3
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-ReachabilityFireability-4
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-ReachabilityFireability-5
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-ReachabilityFireability-6
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-ReachabilityFireability-7
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-ReachabilityFireability-8
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-ReachabilityFireability-9

=== Now, execution of the tool begins

BK_START 1496558358307


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


checking for too many tokens
===========================================================================================
S_SmallOperatingSystem-PT-MT8192DC4096: translating PT formula ReachabilityFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
ReachabilityFireability @ S_SmallOperatingSystem-PT-MT8192DC4096 @ 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-MT8192DC4096-ReachabilityFireability.task
lola: A (G (())) : E (F ((FIREABLE(freeMemory) AND NOT FIREABLE(startFirst)))) : E (F (((NOT FIREABLE(endLoading) OR NOT FIREABLE(freeMemory)) AND (NOT FIREABLE(startLoading) OR NOT FIREABLE(startNext)) AND FIREABLE(startUnload)))) : A (G (())) : E (F (((NOT FIREABLE(startUnload)) AND FIREABLE(endUnload) AND NOT FIREABLE(startLoading)))) : E (F ((NOT FIREABLE(startLoading) AND NOT FIREABLE(endUnload) AND (NOT FIREABLE(suspend))))) : A (G ((FIREABLE(startNext) OR FIREABLE(endLoading) OR NOT FIREABLE(endUnload) OR (FIREABLE(startNext) AND FIREABLE(endUnload)) OR ((NOT FIREABLE(endLoading) OR NOT FIREABLE(startLoading)) AND (FIREABLE(startLoading) OR FIREABLE(startNext) OR NOT FIREABLE(freeMemory)))))) : A (G (FIREABLE(startLoading))) : A (G (())) : A (G (FIREABLE(startLoading))) : A (G ((NOT FIREABLE(endLoading) OR NOT FIREABLE(startNext) OR FIREABLE(startLoading) OR (NOT FIREABLE(startLoading) AND FIREABLE(startFirst) AND ((FIREABLE(freeMemory) AND FIREABLE(suspend)) OR FIREABLE(startLoading)))))) : E (F ((((FIREABLE(startNext) AND FIREABLE(startFirst)) OR (FIREABLE(startLoading) AND FIREABLE(suspend))) AND FIREABLE(startFirst) AND NOT FIREABLE(freeMemory)))) : E (F ((FIREABLE(startLoading) AND FIREABLE(startUnload) AND NOT FIREABLE(startNext)))) : A (G ((FIREABLE(startLoading) OR FIREABLE(startFirst) OR NOT FIREABLE(suspend)))) : E (F ((NOT FIREABLE(startLoading) AND NOT FIREABLE(endLoading) AND (NOT FIREABLE(endLoading) OR NOT FIREABLE(startLoading) OR FIREABLE(suspend))))) : A (G (FIREABLE(startLoading)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (()))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 3 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SmallOperatingSystem-PT-MT8192DC4096-ReachabilityFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(freeMemory) AND NOT FIREABLE(startFirst))))
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 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT8192DC4096-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT8192DC4096-ReachabilityFireability.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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(endLoading) OR NOT FIREABLE(freeMemory)) AND (NOT FIREABLE(startLoading) OR NOT FIREABLE(startNext)) AND FIREABLE(startUnload))))
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 20 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT8192DC4096-ReachabilityFireability-2.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT8192DC4096-ReachabilityFireability-2.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 2995131 markings, 4494216 edges, 599026 markings/sec, 0 secs
lola: sara is running 5 secs || 5816564 markings, 8726970 edges, 564287 markings/sec, 5 secs
lola: sara is running 10 secs || 8569590 markings, 12856962 edges, 550605 markings/sec, 10 secs
lola: sara is running 15 secs || 11465328 markings, 17200976 edges, 579148 markings/sec, 15 secs
lola: sara is running 20 secs || 14292831 markings, 21442580 edges, 565501 markings/sec, 20 secs
lola: sara is running 25 secs || 17096208 markings, 25647957 edges, 560675 markings/sec, 25 secs
lola: sara is running 30 secs || 19855191 markings, 29786716 edges, 551797 markings/sec, 30 secs
lola: sara is running 35 secs || 22634012 markings, 33955212 edges, 555764 markings/sec, 35 secs
lola: sara is running 40 secs || 25376410 markings, 38069057 edges, 548480 markings/sec, 40 secs
lola: sara is running 45 secs || 28109302 markings, 42168631 edges, 546578 markings/sec, 45 secs
lola: sara is running 50 secs || 30790763 markings, 46191038 edges, 536292 markings/sec, 50 secs
lola: sara is running 55 secs || 33433848 markings, 50155875 edges, 528617 markings/sec, 55 secs
lola: sara is running 60 secs || 35247802 markings, 53442750 edges, 362791 markings/sec, 60 secs
lola: sara is running 65 secs || 36606370 markings, 56581448 edges, 271714 markings/sec, 65 secs
lola: sara is running 70 secs || 37914526 markings, 59655073 edges, 261631 markings/sec, 70 secs
lola: sara is running 75 secs || 39482969 markings, 62650237 edges, 313689 markings/sec, 75 secs
lola: sara is running 80 secs || 40773950 markings, 65671562 edges, 258196 markings/sec, 80 secs
lola: sara is running 85 secs || 42257458 markings, 68585419 edges, 296702 markings/sec, 85 secs
lola: sara is running 90 secs || 43379428 markings, 71591012 edges, 224394 markings/sec, 90 secs
lola: sara is running 95 secs || 45093215 markings, 74519907 edges, 342757 markings/sec, 95 secs
lola: sara is running 100 secs || 45911635 markings, 77452250 edges, 163684 markings/sec, 100 secs
lola: sara is running 105 secs || 47522566 markings, 80412230 edges, 322186 markings/sec, 105 secs
lola: sara is running 110 secs || 49202307 markings, 83287442 edges, 335948 markings/sec, 110 secs
lola: sara is running 115 secs || 49845404 markings, 86234482 edges, 128619 markings/sec, 115 secs
lola: sara is running 120 secs || 51445595 markings, 89174213 edges, 320038 markings/sec, 120 secs
lola: sara is running 125 secs || 53122602 markings, 92037920 edges, 335401 markings/sec, 125 secs
lola: sara is running 130 secs || 54057605 markings, 94919295 edges, 187001 markings/sec, 130 secs
lola: sara is running 135 secs || 55111997 markings, 97842540 edges, 210878 markings/sec, 135 secs
lola: sara is running 140 secs || 56831443 markings, 100741952 edges, 343889 markings/sec, 140 secs
lola: sara is running 145 secs || 58476919 markings, 103538035 edges, 329095 markings/sec, 145 secs
lola: sara is running 150 secs || 59119185 markings, 106395098 edges, 128453 markings/sec, 150 secs
lola: sara is running 155 secs || 60230445 markings, 109260869 edges, 222252 markings/sec, 155 secs
lola: sara is running 160 secs || 61850546 markings, 111985904 edges, 324020 markings/sec, 160 secs
lola: sara is running 165 secs || 63353366 markings, 114536961 edges, 300564 markings/sec, 165 secs
lola: sara is running 170 secs || 64326471 markings, 117118728 edges, 194621 markings/sec, 170 secs
lola: sara is running 175 secs || 64852305 markings, 119758880 edges, 105167 markings/sec, 175 secs
lola: sara is running 180 secs || 66185170 markings, 122400715 edges, 266573 markings/sec, 180 secs
lola: sara is running 185 secs || 67752719 markings, 125042351 edges, 313510 markings/sec, 185 secs
lola: sara is running 190 secs || 69311884 markings, 127683761 edges, 311833 markings/sec, 190 secs
lola: sara is running 195 secs || 70331085 markings, 130357122 edges, 203840 markings/sec, 195 secs
lola: sara is running 200 secs || 70872565 markings, 133071782 edges, 108296 markings/sec, 200 secs
lola: sara is running 205 secs || 72107967 markings, 135814420 edges, 247080 markings/sec, 205 secs
lola: sara is running 210 secs || 73763765 markings, 138593694 edges, 331160 markings/sec, 210 secs
lola: sara is running 215 secs || 75381325 markings, 141332784 edges, 323512 markings/sec, 215 secs
lola: sara is running 220 secs || 76716664 markings, 144031375 edges, 267068 markings/sec, 220 secs
lola: sara is running 225 secs || 77270735 markings, 146794172 edges, 110814 markings/sec, 225 secs
lola: sara is running 230 secs || 78046905 markings, 149582192 edges, 155234 markings/sec, 230 secs
lola: sara is running 235 secs || 79763691 markings, 152444753 edges, 343357 markings/sec, 235 secs
lola: sara is running 240 secs || 81408594 markings, 155228231 edges, 328981 markings/sec, 240 secs
lola: sara is running 245 secs || 83031371 markings, 157967590 edges, 324555 markings/sec, 245 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (()))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 3 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SmallOperatingSystem-PT-MT8192DC4096-ReachabilityFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: subprocess 4 will run for 273 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(startUnload)) AND FIREABLE(endUnload) AND NOT FIREABLE(startLoading))))
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 27 literals and 9 conjunctive subformulas
lola: ========================================
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT8192DC4096-ReachabilityFireability-4.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 5 will run for 298 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(startLoading) AND NOT FIREABLE(endUnload) AND (NOT FIREABLE(suspend)))))
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 9 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT8192DC4096-ReachabilityFireability-5.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT8192DC4096-ReachabilityFireability-5.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 6 will run for 328 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(startNext) OR FIREABLE(endLoading) OR NOT FIREABLE(endUnload) OR (FIREABLE(startNext) AND FIREABLE(endUnload)) OR ((NOT FIREABLE(endLoading) OR NOT FIREABLE(startLoading)) AND (FIREABLE(startLoading) OR FIREABLE(startNext) OR NOT FIREABLE(freeMemory))))))
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 168 literals and 24 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT8192DC4096-ReachabilityFireability-6.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT8192DC4096-ReachabilityFireability-6.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 7 will run for 365 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(startLoading)))
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 3 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT8192DC4096-ReachabilityFireability-7.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 8 will run for 410 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (()))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 3 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SmallOperatingSystem-PT-MT8192DC4096-ReachabilityFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 9 will run for 469 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(startLoading)))
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 3 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT8192DC4096-ReachabilityFireability-9.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 10 will run for 547 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(endLoading) OR NOT FIREABLE(startNext) OR FIREABLE(startLoading) OR (NOT FIREABLE(startLoading) AND FIREABLE(startFirst) AND ((FIREABLE(freeMemory) AND FIREABLE(suspend)) OR FIREABLE(startLoading))))))
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 123 literals and 21 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT8192DC4096-ReachabilityFireability-10.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT8192DC4096-ReachabilityFireability-10.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 11 will run for 657 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((FIREABLE(startNext) AND FIREABLE(startFirst)) OR (FIREABLE(startLoading) AND FIREABLE(suspend))) AND FIREABLE(startFirst) AND NOT FIREABLE(freeMemory))))
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: State predicate is contradiction.
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 12 will run for 821 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(startLoading) AND FIREABLE(startUnload) AND NOT FIREABLE(startNext))))
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 7 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT8192DC4096-ReachabilityFireability-12.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT8192DC4096-ReachabilityFireability-12.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 13 will run for 1095 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(startLoading) OR FIREABLE(startFirst) OR NOT FIREABLE(suspend))))
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 18 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT8192DC4096-ReachabilityFireability-13.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 14 will run for 1643 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(startLoading) AND NOT FIREABLE(endLoading) AND (NOT FIREABLE(endLoading) OR NOT FIREABLE(startLoading) OR FIREABLE(suspend)))))
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 45 literals and 15 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT8192DC4096-ReachabilityFireability-14.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT8192DC4096-ReachabilityFireability-14.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 15 will run for 3287 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(startLoading)))
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 3 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT8192DC4096-ReachabilityFireability-15.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: RESULT
lola:
SUMMARY: yes no unknown yes yes yes no no yes no no no no no yes no
lola: ========================================
FORMULA SmallOperatingSystem-PT-MT8192DC4096-ReachabilityFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-ReachabilityFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-ReachabilityFireability-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-ReachabilityFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-ReachabilityFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-ReachabilityFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-ReachabilityFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-ReachabilityFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-ReachabilityFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-ReachabilityFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-ReachabilityFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496558611452

--------------------
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-MT8192DC4096"
export BK_EXAMINATION="ReachabilityFireability"
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-MT8192DC4096.tgz
mv S_SmallOperatingSystem-PT-MT8192DC4096 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-MT8192DC4096, examination is ReachabilityFireability"
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-149443463900063"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.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 ;