About the Execution of LoLA for S_DES-PT-40b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2580.280 | 418496.00 | 965146.00 | 77.70 | FTTTTTTFTTFTFTTT | 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-40b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-ebro-149488455700315
=====================================================================
--------------------
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-40b-ReachabilityFireability-0
FORMULA_NAME DES-PT-40b-ReachabilityFireability-1
FORMULA_NAME DES-PT-40b-ReachabilityFireability-10
FORMULA_NAME DES-PT-40b-ReachabilityFireability-11
FORMULA_NAME DES-PT-40b-ReachabilityFireability-12
FORMULA_NAME DES-PT-40b-ReachabilityFireability-13
FORMULA_NAME DES-PT-40b-ReachabilityFireability-14
FORMULA_NAME DES-PT-40b-ReachabilityFireability-15
FORMULA_NAME DES-PT-40b-ReachabilityFireability-2
FORMULA_NAME DES-PT-40b-ReachabilityFireability-3
FORMULA_NAME DES-PT-40b-ReachabilityFireability-4
FORMULA_NAME DES-PT-40b-ReachabilityFireability-5
FORMULA_NAME DES-PT-40b-ReachabilityFireability-6
FORMULA_NAME DES-PT-40b-ReachabilityFireability-7
FORMULA_NAME DES-PT-40b-ReachabilityFireability-8
FORMULA_NAME DES-PT-40b-ReachabilityFireability-9
=== Now, execution of the tool begins
BK_START 1496455509621
Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_DES-PT-40b: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
S_DES-PT-40b: translating PT formula ReachabilityFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
ReachabilityFireability @ S_DES-PT-40b @ 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: 829/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 439 places, 390 transitions, 374 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 487 transition conflict sets
lola: TASK
lola: reading formula from DES-PT-40b-ReachabilityFireability.task
lola: E (F ((NOT FIREABLE(t189) AND FIREABLE(t243) AND FIREABLE(t208) AND FIREABLE(t270) AND FIREABLE(t123) AND (FIREABLE(t33) OR (NOT FIREABLE(t37) AND NOT FIREABLE(t228)))))) : E (F ((NOT FIREABLE(t208) AND NOT FIREABLE(t159) AND NOT FIREABLE(t56) AND FIREABLE(t99) AND (FIREABLE(t305) OR FIREABLE(t285))))) : E (F (FIREABLE(t59))) : E (F (((FIREABLE(t144) OR FIREABLE(t62) OR (FIREABLE(t376) AND FIREABLE(t25))) AND FIREABLE(t156) AND (NOT FIREABLE(t113) OR NOT FIREABLE(t223) OR (NOT FIREABLE(t248) AND NOT FIREABLE(t339)))))) : A (G (NOT FIREABLE(t332))) : E (F (FIREABLE(t136))) : E (F ((FIREABLE(t189) AND FIREABLE(t39) AND FIREABLE(t81) AND FIREABLE(t36) AND (NOT FIREABLE(t387) OR NOT FIREABLE(t244)) AND FIREABLE(t64)))) : E (F (FIREABLE(t376))) : E (F (FIREABLE(t205))) : E (F ((FIREABLE(t274) AND (FIREABLE(t37) OR FIREABLE(t201) OR (FIREABLE(t8) AND FIREABLE(t231))) AND NOT FIREABLE(t124)))) : E (F ((FIREABLE(t160) OR FIREABLE(t9)))) : E (F (((FIREABLE(t212) AND FIREABLE(t164)) OR (FIREABLE(t234) AND FIREABLE(t94) AND FIREABLE(t75) AND FIREABLE(t366))))) : E (F ((FIREABLE(t27) AND (((FIREABLE(t166) OR FIREABLE(t303)) AND (FIREABLE(t299) OR FIREABLE(t75))) OR (NOT FIREABLE(t181) AND NOT FIREABLE(t218)))))) : E (F (((((FIREABLE(t348) OR FIREABLE(t48)) AND (FIREABLE(t137) OR FIREABLE(t283))) OR FIREABLE(t232)) AND ((NOT FIREABLE(t279) AND NOT FIREABLE(t26)) OR (FIREABLE(t156) AND FIREABLE(t177) AND NOT FIREABLE(t343)))))) : E (F (FIREABLE(t378))) : A (G (NOT FIREABLE(t258)))
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 ((NOT FIREABLE(t189) AND FIREABLE(t243) AND FIREABLE(t208) AND FIREABLE(t270) AND FIREABLE(t123) AND (FIREABLE(t33) OR (NOT FIREABLE(t37) AND NOT 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 48 bytes per marking, with 10 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 19 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-40b-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-40b-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 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t208) AND NOT FIREABLE(t159) AND NOT FIREABLE(t56) AND FIREABLE(t99) AND (FIREABLE(t305) OR FIREABLE(t285)))))
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 48 bytes per marking, with 10 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 4 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-40b-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-40b-ReachabilityFireability.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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t59)))
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 48 bytes per marking, with 10 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 DES-PT-40b-ReachabilityFireability-2.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-40b-ReachabilityFireability-2.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t144) OR FIREABLE(t62) OR (FIREABLE(t376) AND FIREABLE(t25))) AND FIREABLE(t156) AND (NOT FIREABLE(t113) OR NOT FIREABLE(t223) OR (NOT FIREABLE(t248) AND NOT FIREABLE(t339))))))
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 48 bytes per marking, with 10 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 89 literals and 21 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-40b-ReachabilityFireability-3.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t332)))
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 48 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: ========================================
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-40b-ReachabilityFireability-4.sara
lola: SUBRESULT
lola: lola: result: nostate equation: calling and running sara
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t136)))
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 48 bytes per marking, with 10 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)
sara: try reading problem file DES-PT-40b-ReachabilityFireability-4.sara.
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-40b-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 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t189) AND FIREABLE(t39) AND FIREABLE(t81) AND FIREABLE(t36) AND (NOT FIREABLE(t387) OR NOT FIREABLE(t244)) AND FIREABLE(t64))))
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 48 bytes per marking, with 10 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 21 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-40b-ReachabilityFireability-6.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t376)))
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 48 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
sara: try reading problem file DES-PT-40b-ReachabilityFireability-6.sara.
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-40b-ReachabilityFireability-7.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-40b-ReachabilityFireability-7.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
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 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t205)))
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 48 bytes per marking, with 10 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-40b-ReachabilityFireability-8.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-40b-ReachabilityFireability-8.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 928067 markings, 1169488 edges, 185613 markings/sec, 0 secs
lola: sara is running 5 secs || 1799351 markings, 2319366 edges, 174257 markings/sec, 5 secs
lola: sara is running 10 secs || 2606596 markings, 3452028 edges, 161449 markings/sec, 10 secs
lola: sara is running 15 secs || 3432292 markings, 4580072 edges, 165139 markings/sec, 15 secs
lola: sara is running 20 secs || 4231612 markings, 5689785 edges, 159864 markings/sec, 20 secs
lola: sara is running 25 secs || 5001734 markings, 6794800 edges, 154024 markings/sec, 25 secs
lola: sara is running 30 secs || 5771142 markings, 7869922 edges, 153882 markings/sec, 30 secs
lola: sara is running 35 secs || 6396513 markings, 9033413 edges, 125074 markings/sec, 35 secs
lola: sara is running 40 secs || 6966584 markings, 10140632 edges, 114014 markings/sec, 40 secs
lola: sara is running 45 secs || 7507613 markings, 11396592 edges, 108206 markings/sec, 45 secs
lola: sara is running 50 secs || 8105292 markings, 12564941 edges, 119536 markings/sec, 50 secs
lola: sara is running 55 secs || 8623082 markings, 13691188 edges, 103558 markings/sec, 55 secs
lola: sara is running 60 secs || 9214846 markings, 14917733 edges, 118353 markings/sec, 60 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 9 will run for 495 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t274) AND (FIREABLE(t37) OR FIREABLE(t201) OR (FIREABLE(t8) AND FIREABLE(t231))) AND NOT FIREABLE(t124))))
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 48 bytes per marking, with 10 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 16 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-40b-ReachabilityFireability-9.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-40b-ReachabilityFireability-9.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 10 will run for 578 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t160) OR FIREABLE(t9))))
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 48 bytes per marking, with 10 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 2 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-40b-ReachabilityFireability-10.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: lola: state equation: calling and running saraThe predicate is reachable.
lola: ========================================
lola: subprocess 11 will run for 693 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t212) AND FIREABLE(t164)) OR (FIREABLE(t234) AND FIREABLE(t94) AND FIREABLE(t75) AND FIREABLE(t366)))))
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 48 bytes per marking, with 10 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 2 conjunctive subformulas
lola: sara: try reading problem file DES-PT-40b-ReachabilityFireability-10.sara.
state equation: write sara problem file to DES-PT-40b-ReachabilityFireability-11.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-40b-ReachabilityFireability-11.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 579468 markings, 1268963 edges, 115894 markings/sec, 0 secs
lola: sara is running 5 secs || 1030756 markings, 2327639 edges, 90258 markings/sec, 5 secs
lola: sara is running 10 secs || 1474485 markings, 3342639 edges, 88746 markings/sec, 10 secs
lola: sara is running 15 secs || 1951313 markings, 4524332 edges, 95366 markings/sec, 15 secs
lola: sara is running 20 secs || 2408736 markings, 5575145 edges, 91485 markings/sec, 20 secs
lola: sara is running 25 secs || 2865035 markings, 6616792 edges, 91260 markings/sec, 25 secs
lola: sara is running 30 secs || 3311453 markings, 7698969 edges, 89284 markings/sec, 30 secs
lola: sara is running 35 secs || 3717921 markings, 8729397 edges, 81294 markings/sec, 35 secs
lola: sara is running 40 secs || 4117500 markings, 9720296 edges, 79916 markings/sec, 40 secs
lola: sara is running 45 secs || 4513013 markings, 10686940 edges, 79103 markings/sec, 45 secs
lola: sara is running 50 secs || 4909120 markings, 11618530 edges, 79221 markings/sec, 50 secs
lola: sara is running 55 secs || 5292323 markings, 12552197 edges, 76641 markings/sec, 55 secs
lola: sara is running 60 secs || 5678128 markings, 13494570 edges, 77161 markings/sec, 60 secs
lola: sara is running 65 secs || 6055400 markings, 14419043 edges, 75454 markings/sec, 65 secs
lola: sara is running 70 secs || 6433646 markings, 15345914 edges, 75649 markings/sec, 70 secs
lola: sara is running 75 secs || 6812787 markings, 16275922 edges, 75828 markings/sec, 75 secs
lola: sara is running 80 secs || 7190971 markings, 17202646 edges, 75637 markings/sec, 80 secs
lola: sara is running 85 secs || 7557198 markings, 18101631 edges, 73245 markings/sec, 85 secs
lola: sara is running 90 secs || 7926049 markings, 19023634 edges, 73770 markings/sec, 90 secs
lola: sara is running 95 secs || 8338635 markings, 20056242 edges, 82517 markings/sec, 95 secs
lola: sara is running 100 secs || 8752091 markings, 21149332 edges, 82691 markings/sec, 100 secs
lola: sara is running 105 secs || 9171891 markings, 22242853 edges, 83960 markings/sec, 105 secs
lola: sara is running 110 secs || 9612161 markings, 23417688 edges, 88054 markings/sec, 110 secs
lola: sara is running 115 secs || 10032657 markings, 24575014 edges, 84099 markings/sec, 115 secs
lola: sara is running 120 secs || 10414041 markings, 25630045 edges, 76277 markings/sec, 120 secs
lola: sara is running 125 secs || 10788334 markings, 26635677 edges, 74859 markings/sec, 125 secs
lola: sara is running 130 secs || 11152194 markings, 27637255 edges, 72772 markings/sec, 130 secs
lola: sara is running 135 secs || 11516720 markings, 28643334 edges, 72905 markings/sec, 135 secs
lola: sara is running 140 secs || 11868846 markings, 29616812 edges, 70425 markings/sec, 140 secs
lola: sara is running 145 secs || 12275732 markings, 30749882 edges, 81377 markings/sec, 145 secs
lola: sara is running 150 secs || 12758832 markings, 31926511 edges, 96620 markings/sec, 150 secs
lola: sara is running 155 secs || 13247155 markings, 33135630 edges, 97665 markings/sec, 155 secs
lola: sara is running 160 secs || 13702780 markings, 34161532 edges, 91125 markings/sec, 160 secs
lola: sara is running 165 secs || 14173226 markings, 35276036 edges, 94089 markings/sec, 165 secs
lola: sara is running 170 secs || 14662028 markings, 36396199 edges, 97760 markings/sec, 170 secs
lola: sara is running 175 secs || 15175932 markings, 37500180 edges, 102781 markings/sec, 175 secs
lola: sara is running 180 secs || 15698588 markings, 38803534 edges, 104531 markings/sec, 180 secs
lola: sara is running 185 secs || 16217867 markings, 40117277 edges, 103856 markings/sec, 185 secs
lola: sara is running 190 secs || 16728159 markings, 41445900 edges, 102058 markings/sec, 190 secs
lola: sara is running 195 secs || 17236370 markings, 42776842 edges, 101642 markings/sec, 195 secs
lola: sara is running 200 secs || 17724693 markings, 44041027 edges, 97665 markings/sec, 200 secs
lola: sara is running 205 secs || 18458814 markings, 45087123 edges, 146824 markings/sec, 205 secs
lola: sara is running 210 secs || 19111983 markings, 46249475 edges, 130634 markings/sec, 210 secs
lola: sara is running 215 secs || 19862782 markings, 47283863 edges, 150160 markings/sec, 215 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 12 will run for 811 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t27) AND (((FIREABLE(t166) OR FIREABLE(t303)) AND (FIREABLE(t299) OR FIREABLE(t75))) OR (NOT FIREABLE(t181) AND NOT FIREABLE(t218))))))
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 48 bytes per marking, with 10 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 28 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-40b-ReachabilityFireability-12.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-40b-ReachabilityFireability-12.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 13 will run for 1081 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((((FIREABLE(t348) OR FIREABLE(t48)) AND (FIREABLE(t137) OR FIREABLE(t283))) OR FIREABLE(t232)) AND ((NOT FIREABLE(t279) AND NOT FIREABLE(t26)) OR (FIREABLE(t156) AND FIREABLE(t177) AND NOT FIREABLE(t343))))))
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 48 bytes per marking, with 10 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 105 literals and 18 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-40b-ReachabilityFireability-13.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-40b-ReachabilityFireability-13.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 546698 markings, 1123810 edges, 109340 markings/sec, 0 secs
lola: sara is running 5 secs || 1057069 markings, 2212846 edges, 102074 markings/sec, 5 secs
lola: sara is running 10 secs || 1562190 markings, 3326667 edges, 101024 markings/sec, 10 secs
lola: sara is running 15 secs || 2070861 markings, 4469979 edges, 101734 markings/sec, 15 secs
lola: sara is running 20 secs || 2579046 markings, 5616190 edges, 101637 markings/sec, 20 secs
lola: sara is running 25 secs || 3085376 markings, 6756016 edges, 101266 markings/sec, 25 secs
lola: sara is running 30 secs || 3590263 markings, 7894617 edges, 100977 markings/sec, 30 secs
lola: sara is running 35 secs || 4097717 markings, 9036380 edges, 101491 markings/sec, 35 secs
lola: sara is running 40 secs || 4604180 markings, 10179444 edges, 101293 markings/sec, 40 secs
lola: sara is running 45 secs || 5115747 markings, 11329476 edges, 102313 markings/sec, 45 secs
lola: sara is running 50 secs || 5626789 markings, 12480042 edges, 102208 markings/sec, 50 secs
lola: sara is running 55 secs || 6132616 markings, 13620784 edges, 101165 markings/sec, 55 secs
lola: sara is running 60 secs || 6637908 markings, 14759021 edges, 101058 markings/sec, 60 secs
lola: sara is running 65 secs || 7144435 markings, 15899452 edges, 101305 markings/sec, 65 secs
lola: sara is running 70 secs || 7606002 markings, 16942112 edges, 92313 markings/sec, 70 secs
lola: sara is running 75 secs || 8052074 markings, 17946923 edges, 89214 markings/sec, 75 secs
lola: sara is running 80 secs || 8482879 markings, 18914578 edges, 86161 markings/sec, 80 secs
lola: sara is running 85 secs || 8915531 markings, 19892093 edges, 86530 markings/sec, 85 secs
lola: sara is running 90 secs || 9335294 markings, 20838308 edges, 83953 markings/sec, 90 secs
lola: sara is running 95 secs || 9755723 markings, 21784490 edges, 84086 markings/sec, 95 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 1570 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t378)))
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 48 bytes per marking, with 10 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: write sara problem file to DES-PT-40b-ReachabilityFireability-14.sara
lola: The predicate is reachable.
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 15 will run for 3140 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t258)))
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 48 bytes per marking, with 10 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-40b-ReachabilityFireability-15.sara
sara: try reading problem file DES-PT-40b-ReachabilityFireability-14.sara.
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-40b-ReachabilityFireability-15.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 771087 markings, 1074342 edges, 154217 markings/sec, 0 secs
lola: sara is running 5 secs || 1428963 markings, 2162530 edges, 131575 markings/sec, 5 secs
lola: sara is running 10 secs || 2090651 markings, 3259389 edges, 132338 markings/sec, 10 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes yes yes no yes no yes yes yes yes yes yes yes yes no
FORMULA DES-PT-40b-ReachabilityFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-40b-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-40b-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-40b-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-40b-ReachabilityFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-40b-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-40b-ReachabilityFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-40b-ReachabilityFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-40b-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-40b-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-40b-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-40b-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-40b-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-40b-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-40b-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-40b-ReachabilityFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----
BK_STOP 1496455928117
--------------------
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-40b"
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-40b.tgz
mv S_DES-PT-40b 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-40b, 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-149488455700315"
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 '
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 ;