fond

jQuery Multi Level CSS Menu Css3Menu.com

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

About the Execution of LoLA for S_DES-PT-50b

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2843.580 608513.00 1220534.00 110.20 FFFFTTFTTT?TFTFT 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_DES-PT-50b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-ebro-149488455800333
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496457366863


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


checking for too many tokens
===========================================================================================
S_DES-PT-50b: translating PT formula ReachabilityFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
ReachabilityFireability @ S_DES-PT-50b @ 3539 seconds
----- Start make result stdout -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 909/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 479 places, 430 transitions, 414 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 527 transition conflict sets
lola: TASK
lola: reading formula from DES-PT-50b-ReachabilityFireability.task
lola: A (G (((NOT FIREABLE(t263) OR NOT FIREABLE(t340)) AND (NOT FIREABLE(t18) OR NOT FIREABLE(t409)) AND NOT FIREABLE(t239)))) : E (F ((FIREABLE(t36) AND FIREABLE(t406) AND NOT FIREABLE(t429) AND FIREABLE(t333) AND FIREABLE(t131) AND NOT FIREABLE(t91) AND FIREABLE(t5)))) : E (F (FIREABLE(t0))) : E (F (FIREABLE(t91))) : A (G ((NOT FIREABLE(t336) OR NOT FIREABLE(t287) OR ((FIREABLE(t284) OR NOT FIREABLE(t195)) AND FIREABLE(t134))))) : E (F (FIREABLE(t228))) : A (G ((NOT FIREABLE(t269) OR (FIREABLE(t14) AND FIREABLE(t359)) OR ((FIREABLE(t181) OR FIREABLE(t83)) AND (FIREABLE(t193) OR FIREABLE(t141))) OR FIREABLE(t380) OR (FIREABLE(t272) AND FIREABLE(t233) AND FIREABLE(t73))))) : E (F ((FIREABLE(t147) AND FIREABLE(t348)))) : E (F ((FIREABLE(t212) AND FIREABLE(t341) AND FIREABLE(t273) AND FIREABLE(t27)))) : E (F (((NOT FIREABLE(t78) OR NOT FIREABLE(t344)) AND NOT FIREABLE(t170) AND FIREABLE(t10)))) : A (G (NOT FIREABLE(t306))) : A (G ((FIREABLE(t99) OR (NOT FIREABLE(t295) AND NOT FIREABLE(t51)) OR (FIREABLE(t126) AND FIREABLE(t26) AND NOT FIREABLE(t358) AND (FIREABLE(t192) OR FIREABLE(t99) OR FIREABLE(t311)))))) : E (F ((FIREABLE(t331) OR FIREABLE(t254)))) : E (F (FIREABLE(t347))) : A (G (NOT FIREABLE(t410))) : E (F (FIREABLE(t295)))
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 (((NOT FIREABLE(t263) OR NOT FIREABLE(t340)) AND (NOT FIREABLE(t18) OR NOT FIREABLE(t409)) AND NOT FIREABLE(t239))))
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 52 bytes per marking, with 2 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 DES-PT-50b-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-50b-ReachabilityFireability.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 690771 markings, 1017138 edges, 138154 markings/sec, 0 secs
lola: sara is running 5 secs || 1235798 markings, 2136625 edges, 109005 markings/sec, 5 secs
lola: sara is running 10 secs || 1765611 markings, 3237042 edges, 105963 markings/sec, 10 secs
lola: sara is running 15 secs || 2360297 markings, 4461297 edges, 118937 markings/sec, 15 secs
lola: sara is running 20 secs || 2911907 markings, 5581493 edges, 110322 markings/sec, 20 secs
lola: sara is running 25 secs || 3438355 markings, 6659219 edges, 105290 markings/sec, 25 secs
lola: sara is running 30 secs || 3998820 markings, 7847023 edges, 112093 markings/sec, 30 secs
lola: sara is running 35 secs || 4580496 markings, 9012343 edges, 116335 markings/sec, 35 secs
lola: sara is running 40 secs || 5121793 markings, 10118951 edges, 108259 markings/sec, 40 secs
lola: sara is running 45 secs || 5647326 markings, 11217774 edges, 105107 markings/sec, 45 secs
lola: sara is running 50 secs || 6245516 markings, 12437573 edges, 119638 markings/sec, 50 secs

lola: state equation: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 1 will run for 232 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t36) AND FIREABLE(t406) AND NOT FIREABLE(t429) AND FIREABLE(t333) AND FIREABLE(t131) AND NOT FIREABLE(t91) AND FIREABLE(t5))))
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 52 bytes per marking, with 2 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 60 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-50b-ReachabilityFireability.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 2 will run for 248 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t0)))
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 52 bytes per marking, with 2 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 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-50b-ReachabilityFireability-2.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-50b-ReachabilityFireability-2.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 823045 markings, 973799 edges, 164609 markings/sec, 0 secs
lola: sara is running 5 secs || 1647192 markings, 2011133 edges, 164829 markings/sec, 5 secs
lola: sara is running 10 secs || 2461415 markings, 3028450 edges, 162845 markings/sec, 10 secs
lola: sara is running 15 secs || 3250628 markings, 4036328 edges, 157843 markings/sec, 15 secs
lola: sara is running 20 secs || 4053403 markings, 5026461 edges, 160555 markings/sec, 20 secs
lola: sara is running 25 secs || 4838975 markings, 6009744 edges, 157114 markings/sec, 25 secs
lola: sara is running 30 secs || 5622739 markings, 6998142 edges, 156753 markings/sec, 30 secs
lola: sara is running 35 secs || 6405159 markings, 7973747 edges, 156484 markings/sec, 35 secs
lola: sara is running 40 secs || 7193242 markings, 8972519 edges, 157617 markings/sec, 40 secs
lola: sara is running 45 secs || 7985724 markings, 9964806 edges, 158496 markings/sec, 45 secs
lola: sara is running 50 secs || 8777879 markings, 10950267 edges, 158431 markings/sec, 50 secs
lola: sara is running 55 secs || 9559708 markings, 11933822 edges, 156366 markings/sec, 55 secs
lola: sara is running 60 secs || 10343116 markings, 12916029 edges, 156682 markings/sec, 60 secs
lola: sara is running 65 secs || 11131311 markings, 13906003 edges, 157639 markings/sec, 65 secs
lola: sara is running 70 secs || 11919426 markings, 14904601 edges, 157623 markings/sec, 70 secs
lola: sara is running 75 secs || 12717113 markings, 15891251 edges, 159537 markings/sec, 75 secs
lola: sara is running 80 secs || 13505842 markings, 16881212 edges, 157746 markings/sec, 80 secs
lola: sara is running 85 secs || 14291199 markings, 17868010 edges, 157071 markings/sec, 85 secs
lola: sara is running 90 secs || 15077608 markings, 18853432 edges, 157282 markings/sec, 90 secs
lola: sara is running 95 secs || 15855787 markings, 19847139 edges, 155636 markings/sec, 95 secs
lola: sara is running 100 secs || 16647137 markings, 20825298 edges, 158270 markings/sec, 100 secs
lola: sara is running 105 secs || 17454609 markings, 21834843 edges, 161494 markings/sec, 105 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 3 will run for 259 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t91)))
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 52 bytes per marking, with 2 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation: write sara problem file to DES-PT-50b-ReachabilityFireability-3.sara
lola: subprocess 4 will run for 280 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t336) OR NOT FIREABLE(t287) OR ((FIREABLE(t284) OR NOT FIREABLE(t195)) AND FIREABLE(t134)))))
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 52 bytes per marking, with 2 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: calling and running sara
lola: ========================================
lola: state equation: Generated DNF with 12 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-50b-ReachabilityFireability-4.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-50b-ReachabilityFireability-3.sara.
sara: try reading problem file DES-PT-50b-ReachabilityFireability-4.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic

lola: sara is running 0 secs || 839165 markings, 1089154 edges, 167833 markings/sec, 0 secs
lola: sara is running 5 secs || 1629822 markings, 2173396 edges, 158131 markings/sec, 5 secs
lola: sara is running 10 secs || 2330347 markings, 3282952 edges, 140105 markings/sec, 10 secs
lola: sara is running 15 secs || 3123234 markings, 4347191 edges, 158577 markings/sec, 15 secs
lola: sara is running 20 secs || 4069838 markings, 5452225 edges, 189321 markings/sec, 20 secs
lola: sara is running 25 secs || 5020127 markings, 6578026 edges, 190058 markings/sec, 25 secs
lola: sara is running 30 secs || 5840987 markings, 7639670 edges, 164172 markings/sec, 30 secs
lola: sara is running 35 secs || 6601387 markings, 8660782 edges, 152080 markings/sec, 35 secs
lola: sara is running 40 secs || 7434095 markings, 9736540 edges, 166542 markings/sec, 40 secs
lola: sara is running 45 secs || 8189468 markings, 10801121 edges, 151075 markings/sec, 45 secs
lola: sara is running 50 secs || 8877937 markings, 11704728 edges, 137694 markings/sec, 50 secs
lola: sara is running 55 secs || 9566666 markings, 12630168 edges, 137746 markings/sec, 55 secs
lola: sara is running 60 secs || 10257901 markings, 13547586 edges, 138247 markings/sec, 60 secs
lola: sara is running 65 secs || 10922730 markings, 14423751 edges, 132966 markings/sec, 65 secs
lola: sara is running 70 secs || 11620164 markings, 15314139 edges, 139487 markings/sec, 70 secs
lola: sara is running 75 secs || 12276383 markings, 16242993 edges, 131244 markings/sec, 75 secs
lola: sara is running 80 secs || 12793504 markings, 17020608 edges, 103424 markings/sec, 80 secs
lola: sara is running 85 secs || 13273934 markings, 17775812 edges, 96086 markings/sec, 85 secs
lola: sara is running 90 secs || 13813297 markings, 18506617 edges, 107873 markings/sec, 90 secs
lola: sara is running 95 secs || 14312639 markings, 19328583 edges, 99868 markings/sec, 95 secs
lola: sara is running 100 secs || 14747199 markings, 20181605 edges, 86912 markings/sec, 100 secs
lola: sara is running 105 secs || 15163157 markings, 21010177 edges, 83192 markings/sec, 105 secs
lola: sara is running 110 secs || 15639775 markings, 21818020 edges, 95324 markings/sec, 110 secs
lola: sara is running 115 secs || 16184278 markings, 22631895 edges, 108901 markings/sec, 115 secs
lola: sara is running 120 secs || 16711874 markings, 23490952 edges, 105519 markings/sec, 120 secs
lola: sara is running 125 secs || 17221390 markings, 24356429 edges, 101903 markings/sec, 125 secs
lola: sara is running 130 secs || 17716598 markings, 25222955 edges, 99042 markings/sec, 130 secs
lola: sara is running 135 secs || 18206196 markings, 26083690 edges, 97920 markings/sec, 135 secs
lola: sara is running 140 secs || 18702313 markings, 26941431 edges, 99223 markings/sec, 140 secs
lola: sara is running 145 secs || 19190064 markings, 27795374 edges, 97550 markings/sec, 145 secs
lola: sara is running 150 secs || 19676685 markings, 28648183 edges, 97324 markings/sec, 150 secs
lola: sara is running 155 secs || 20157855 markings, 29478146 edges, 96234 markings/sec, 155 secs
lola: sara is running 160 secs || 20629247 markings, 30310106 edges, 94278 markings/sec, 160 secs
lola: sara is running 165 secs || 21103337 markings, 31138476 edges, 94818 markings/sec, 165 secs
lola: sara is running 170 secs || 21564800 markings, 31964562 edges, 92293 markings/sec, 170 secs
lola: sara is running 175 secs || 22046851 markings, 32809600 edges, 96410 markings/sec, 175 secs
lola: sara is running 180 secs || 22555724 markings, 33626739 edges, 101775 markings/sec, 180 secs
lola: sara is running 185 secs || 23072489 markings, 34455031 edges, 103353 markings/sec, 185 secs
lola: sara is running 190 secs || 23573201 markings, 35277960 edges, 100142 markings/sec, 190 secs
lola: sara is running 195 secs || 24083593 markings, 36093775 edges, 102078 markings/sec, 195 secs
lola: sara is running 200 secs || 24594870 markings, 36900534 edges, 102255 markings/sec, 200 secs
lola: sara is running 205 secs || 25036175 markings, 37759322 edges, 88261 markings/sec, 205 secs
lola: sara is running 210 secs || 25456578 markings, 38581790 edges, 84081 markings/sec, 210 secs
lola: sara is running 215 secs || 25905281 markings, 39397971 edges, 89741 markings/sec, 215 secs
lola: sara is running 220 secs || 26395100 markings, 40199838 edges, 97964 markings/sec, 220 secs
lola: sara is running 225 secs || 26843903 markings, 41070395 edges, 89761 markings/sec, 225 secs
lola: sara is running 230 secs || 27267367 markings, 41899123 edges, 84693 markings/sec, 230 secs
lola: sara is running 235 secs || 27720440 markings, 42724453 edges, 90615 markings/sec, 235 secs
lola: sara is running 240 secs || 28226264 markings, 43507116 edges, 101165 markings/sec, 240 secs
lola: sara is running 245 secs || 28763542 markings, 44364204 edges, 107456 markings/sec, 245 secs
lola: sara is running 250 secs || 29283384 markings, 45218201 edges, 103968 markings/sec, 250 secs
lola: sara is running 255 secs || 29771195 markings, 46078073 edges, 97562 markings/sec, 255 secs
lola: sara is running 260 secs || 30265032 markings, 46932775 edges, 98767 markings/sec, 260 secs
lola: sara is running 265 secs || 30755557 markings, 47790729 edges, 98105 markings/sec, 265 secs
lola: sara is running 270 secs || 31236324 markings, 48635810 edges, 96153 markings/sec, 270 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 280 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t228)))
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 52 bytes per marking, with 2 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 DES-PT-50b-ReachabilityFireability-5.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-50b-ReachabilityFireability-5.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 838548 markings, 992128 edges, 167710 markings/sec, 0 secs
lola: sara is running 5 secs || 1666390 markings, 2035713 edges, 165568 markings/sec, 5 secs
lola: sara is running 10 secs || 2482594 markings, 3058197 edges, 163241 markings/sec, 10 secs
lola: sara is running 15 secs || 3285156 markings, 4072612 edges, 160512 markings/sec, 15 secs
lola: sara is running 20 secs || 4094844 markings, 5076561 edges, 161938 markings/sec, 20 secs
lola: sara is running 25 secs || 4887467 markings, 6075115 edges, 158525 markings/sec, 25 secs
lola: sara is running 30 secs || 5682902 markings, 7067786 edges, 159087 markings/sec, 30 secs
lola: sara is running 35 secs || 6473945 markings, 8070952 edges, 158209 markings/sec, 35 secs
lola: sara is running 40 secs || 7264937 markings, 9060798 edges, 158198 markings/sec, 40 secs
lola: sara is running 45 secs || 8064636 markings, 10055777 edges, 159940 markings/sec, 45 secs
lola: sara is running 50 secs || 8858440 markings, 11056121 edges, 158761 markings/sec, 50 secs
lola: sara is running 55 secs || 9643731 markings, 12035963 edges, 157058 markings/sec, 55 secs
lola: sara is running 60 secs || 10437929 markings, 13043280 edges, 158840 markings/sec, 60 secs
lola: sara is running 65 secs || 11232241 markings, 14035891 edges, 158862 markings/sec, 65 secs
lola: sara is running 70 secs || 12028113 markings, 15026918 edges, 159174 markings/sec, 70 secs
lola: sara is running 75 secs || 12820219 markings, 16025094 edges, 158421 markings/sec, 75 secs
lola: sara is running 80 secs || 13608575 markings, 17008502 edges, 157671 markings/sec, 80 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 6 will run for 300 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t269) OR (FIREABLE(t14) AND FIREABLE(t359)) OR ((FIREABLE(t181) OR FIREABLE(t83)) AND (FIREABLE(t193) OR FIREABLE(t141))) OR FIREABLE(t380) OR (FIREABLE(t272) AND FIREABLE(t233) AND FIREABLE(t73)))))
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 52 bytes per marking, with 2 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 672 literals and 96 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-50b-ReachabilityFireability-6.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-50b-ReachabilityFireability-6.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 747435 markings, 1031250 edges, 149487 markings/sec, 0 secs
lola: sara is running 5 secs || 1438338 markings, 2085583 edges, 138181 markings/sec, 5 secs
lola: sara is running 10 secs || 2099330 markings, 3186212 edges, 132198 markings/sec, 10 secs
lola: sara is running 15 secs || 2746591 markings, 4279590 edges, 129452 markings/sec, 15 secs
lola: sara is running 20 secs || 3408150 markings, 5372693 edges, 132312 markings/sec, 20 secs
lola: sara is running 25 secs || 4063701 markings, 6472424 edges, 131110 markings/sec, 25 secs
lola: sara is running 30 secs || 4726199 markings, 7571948 edges, 132500 markings/sec, 30 secs
lola: sara is running 35 secs || 5378856 markings, 8667460 edges, 130531 markings/sec, 35 secs
lola: sara is running 40 secs || 6042458 markings, 9768135 edges, 132720 markings/sec, 40 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 7 will run for 328 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t147) AND FIREABLE(t348))))
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 52 bytes per marking, with 2 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 DES-PT-50b-ReachabilityFireability-7.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-50b-ReachabilityFireability-7.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 8 will run for 368 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t212) AND FIREABLE(t341) AND FIREABLE(t273) AND FIREABLE(t27))))
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 52 bytes per marking, with 2 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 DES-PT-50b-ReachabilityFireability-8.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-50b-ReachabilityFireability-8.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 9 will run for 421 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(t78) OR NOT FIREABLE(t344)) AND NOT FIREABLE(t170) AND FIREABLE(t10))))
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 52 bytes per marking, with 2 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 24 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-50b-ReachabilityFireability-9.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: lola: ======================================== lola:
state equation: calling and running sara
subprocess 10 will run for 491 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t306)))
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 52 bytes per marking, with 2 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
sara: try reading problem file DES-PT-50b-ReachabilityFireability-9.sara.
lola: state equation: write sara problem file to DES-PT-50b-ReachabilityFireability-10.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-50b-ReachabilityFireability-10.sara.
sara: place or transition ordering is non-deterministic
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 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t99) OR (NOT FIREABLE(t295) AND NOT FIREABLE(t51)) OR (FIREABLE(t126) AND FIREABLE(t26) AND NOT FIREABLE(t358) AND (FIREABLE(t192) OR FIREABLE(t99) OR FIREABLE(t311))))))
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 52 bytes per marking, with 2 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 55 literals and 12 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-50b-ReachabilityFireability-11.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-50b-ReachabilityFireability-11.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 12 will run for 736 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t331) OR FIREABLE(t254))))
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 52 bytes per marking, with 2 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 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-50b-ReachabilityFireability-12.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-50b-ReachabilityFireability-12.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 504484 markings, 1223174 edges, 100897 markings/sec, 0 secs

lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 13 will run for 979 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t347)))
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 52 bytes per marking, with 2 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 DES-PT-50b-ReachabilityFireability-13.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-50b-ReachabilityFireability-13.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 1468 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t410)))
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 52 bytes per marking, with 2 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 DES-PT-50b-ReachabilityFireability-14.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-50b-ReachabilityFireability-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 2936 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t295)))
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 52 bytes per marking, with 2 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 DES-PT-50b-ReachabilityFireability-15.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-50b-ReachabilityFireability-15.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 741319 markings, 1031236 edges, 148264 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes yes unknown yes no yes no yes no no yes yes no yes
FORMULA DES-PT-50b-ReachabilityFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50b-ReachabilityFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50b-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50b-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50b-ReachabilityFireability-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50b-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50b-ReachabilityFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50b-ReachabilityFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50b-ReachabilityFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50b-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50b-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50b-ReachabilityFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50b-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50b-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50b-ReachabilityFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50b-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496457975376

--------------------
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_DES-PT-50b"
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_DES-PT-50b.tgz
mv S_DES-PT-50b 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_DES-PT-50b, 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 r098-ebro-149488455800333"
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 ;