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-30b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-ebro-149488455700297
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496454628137


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


checking for too many tokens
===========================================================================================
S_DES-PT-30b: translating PT formula ReachabilityFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
ReachabilityFireability @ S_DES-PT-30b @ 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: 749/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 399 places, 350 transitions, 334 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 447 transition conflict sets
lola: TASK
lola: reading formula from DES-PT-30b-ReachabilityFireability.task
lola: E (F ((FIREABLE(t338) OR (FIREABLE(t44) AND FIREABLE(t46) AND NOT FIREABLE(t63) AND FIREABLE(t124))))) : E (F ((NOT FIREABLE(t183) AND NOT FIREABLE(t260) AND FIREABLE(t35) AND (NOT FIREABLE(t286) OR NOT FIREABLE(t276) OR FIREABLE(t22) OR FIREABLE(t25))))) : E (F (FIREABLE(t30))) : E (F ((NOT FIREABLE(t139) AND FIREABLE(t262) AND (((FIREABLE(t54) OR FIREABLE(t266)) AND NOT FIREABLE(t143)) OR FIREABLE(t75))))) : E (F ((NOT FIREABLE(t313) AND (NOT FIREABLE(t53) OR NOT FIREABLE(t146)) AND FIREABLE(t331)))) : E (F ((FIREABLE(t80) AND ((FIREABLE(t105) AND FIREABLE(t329)) OR NOT FIREABLE(t66) OR (FIREABLE(t246) AND FIREABLE(t107)) OR NOT FIREABLE(t344))))) : E (F (FIREABLE(t221))) : E (F ((NOT FIREABLE(t203) AND FIREABLE(t326) AND FIREABLE(t111)))) : A (G (((FIREABLE(t250) AND FIREABLE(t197)) OR FIREABLE(t139) OR NOT FIREABLE(t177)))) : A (G ((FIREABLE(t189) OR FIREABLE(t75) OR NOT FIREABLE(t250)))) : E (F ((FIREABLE(t117) AND FIREABLE(t327) AND (FIREABLE(t157) OR FIREABLE(t267)) AND FIREABLE(t137) AND (NOT FIREABLE(t88) OR (NOT FIREABLE(t163) AND NOT FIREABLE(t104)))))) : E (F (((FIREABLE(t212) AND FIREABLE(t176) AND ((FIREABLE(t52) AND FIREABLE(t342)) OR FIREABLE(t122))) OR FIREABLE(t58)))) : E (F (FIREABLE(t270))) : A (G ((FIREABLE(t250) OR FIREABLE(t274) OR NOT FIREABLE(t14) OR FIREABLE(t153) OR NOT FIREABLE(t133)))) : A (G ((NOT FIREABLE(t283) OR FIREABLE(t249)))) : A (G (((NOT FIREABLE(t245) OR NOT FIREABLE(t65)) AND NOT FIREABLE(t264) AND (NOT FIREABLE(t37) OR FIREABLE(t203) OR (NOT FIREABLE(t100) AND NOT FIREABLE(t33))))))
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 ((FIREABLE(t338) OR (FIREABLE(t44) AND FIREABLE(t46) AND NOT FIREABLE(t63) AND 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 44 bytes per marking, with 18 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-30b-ReachabilityFireability.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t183) AND NOT FIREABLE(t260) AND FIREABLE(t35) AND (NOT FIREABLE(t286) OR NOT FIREABLE(t276) OR FIREABLE(t22) OR FIREABLE(t25)))))
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 44 bytes per marking, with 18 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 96 literals and 24 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-30b-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-30b-ReachabilityFireability.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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t30)))
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 44 bytes per marking, with 18 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-30b-ReachabilityFireability-2.sara
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t139) AND FIREABLE(t262) AND (((FIREABLE(t54) OR FIREABLE(t266)) AND NOT FIREABLE(t143)) OR FIREABLE(t75)))))
lola: ========================================
lola: SUBTASK
lola: lola: checking reachability
========================================
lola: state equation: calling and running sara
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 bytes per marking, with 18 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 15 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-30b-ReachabilityFireability-3.sara
sara: try reading problem file DES-PT-30b-ReachabilityFireability-2.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t313) AND (NOT FIREABLE(t53) OR NOT FIREABLE(t146)) AND FIREABLE(t331))))
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 44 bytes per marking, with 18 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 4 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-30b-ReachabilityFireability-4.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-30b-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 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t80) AND ((FIREABLE(t105) AND FIREABLE(t329)) OR NOT FIREABLE(t66) OR (FIREABLE(t246) AND FIREABLE(t107)) OR NOT FIREABLE(t344)))))
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 44 bytes per marking, with 18 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 14 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-30b-ReachabilityFireability-5.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-30b-ReachabilityFireability-5.sara.
sara: place or transition ordering is non-deterministic

sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 809240 markings, 1029901 edges, 161848 markings/sec, 0 secs
lola: sara is running 5 secs || 1610751 markings, 2066252 edges, 160302 markings/sec, 5 secs

lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 6 will run for 352 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t221)))
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 44 bytes per marking, with 18 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-30b-ReachabilityFireability-6.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-30b-ReachabilityFireability-6.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 7 will run for 391 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t203) AND FIREABLE(t326) AND FIREABLE(t111))))
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 44 bytes per marking, with 18 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 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-30b-ReachabilityFireability-7.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 8 will run for 440 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(t250) AND FIREABLE(t197)) OR FIREABLE(t139) OR NOT FIREABLE(t177))))
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 44 bytes per marking, with 18 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 12 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-30b-ReachabilityFireability-8.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-30b-ReachabilityFireability-8.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 840011 markings, 1065718 edges, 168002 markings/sec, 0 secs
lola: sara is running 5 secs || 1632905 markings, 2093648 edges, 158579 markings/sec, 5 secs
lola: sara is running 10 secs || 2370557 markings, 3127647 edges, 147530 markings/sec, 10 secs
lola: sara is running 15 secs || 3148610 markings, 4194579 edges, 155611 markings/sec, 15 secs
lola: sara is running 20 secs || 3925005 markings, 5249017 edges, 155279 markings/sec, 20 secs
lola: sara is running 25 secs || 4647771 markings, 6290016 edges, 144553 markings/sec, 25 secs
lola: sara is running 30 secs || 5379027 markings, 7315977 edges, 146251 markings/sec, 30 secs
lola: sara is running 35 secs || 6062210 markings, 8263506 edges, 136637 markings/sec, 35 secs
lola: sara is running 40 secs || 6589796 markings, 9484647 edges, 105517 markings/sec, 40 secs
lola: sara is running 45 secs || 7171538 markings, 10615121 edges, 116348 markings/sec, 45 secs
lola: sara is running 50 secs || 7684038 markings, 11768358 edges, 102500 markings/sec, 50 secs
lola: sara is running 55 secs || 8260385 markings, 12925710 edges, 115269 markings/sec, 55 secs
lola: sara is running 60 secs || 8821297 markings, 14007337 edges, 112182 markings/sec, 60 secs
lola: sara is running 65 secs || 9343439 markings, 15218605 edges, 104428 markings/sec, 65 secs
lola: sara is running 70 secs || 9928617 markings, 16361516 edges, 117036 markings/sec, 70 secs
lola: sara is running 75 secs || 10452190 markings, 17469718 edges, 104715 markings/sec, 75 secs
lola: sara is running 80 secs || 11018746 markings, 18670839 edges, 113311 markings/sec, 80 secs
lola: sara is running 85 secs || 11591391 markings, 19784183 edges, 114529 markings/sec, 85 secs
lola: sara is running 90 secs || 12105292 markings, 20976283 edges, 102780 markings/sec, 90 secs
lola: sara is running 95 secs || 12692772 markings, 22120163 edges, 117496 markings/sec, 95 secs
lola: sara is running 100 secs || 13241907 markings, 23203474 edges, 109827 markings/sec, 100 secs
lola: sara is running 105 secs || 13781518 markings, 24430805 edges, 107922 markings/sec, 105 secs
lola: sara is running 110 secs || 14360946 markings, 25555678 edges, 115886 markings/sec, 110 secs
lola: sara is running 115 secs || 14872996 markings, 26720797 edges, 102410 markings/sec, 115 secs
lola: sara is running 120 secs || 15461316 markings, 27893486 edges, 117664 markings/sec, 120 secs
lola: sara is running 125 secs || 16029297 markings, 28991397 edges, 113596 markings/sec, 125 secs
lola: sara is running 130 secs || 16553284 markings, 30205697 edges, 104797 markings/sec, 130 secs
lola: sara is running 135 secs || 17146576 markings, 31366725 edges, 118658 markings/sec, 135 secs
lola: sara is running 140 secs || 17681234 markings, 32475528 edges, 106932 markings/sec, 140 secs
lola: sara is running 145 secs || 18247531 markings, 33703884 edges, 113259 markings/sec, 145 secs
lola: sara is running 150 secs || 18834508 markings, 34848053 edges, 117395 markings/sec, 150 secs
lola: sara is running 155 secs || 19354873 markings, 36051213 edges, 104073 markings/sec, 155 secs
lola: sara is running 160 secs || 19953155 markings, 37228004 edges, 119656 markings/sec, 160 secs
lola: sara is running 165 secs || 20530398 markings, 38347675 edges, 115449 markings/sec, 165 secs
lola: sara is running 170 secs || 21066098 markings, 39590899 edges, 107140 markings/sec, 170 secs
lola: sara is running 175 secs || 21672014 markings, 40779044 edges, 121183 markings/sec, 175 secs
lola: sara is running 180 secs || 22232613 markings, 41899591 edges, 112120 markings/sec, 180 secs
lola: sara is running 185 secs || 22787055 markings, 43150837 edges, 110888 markings/sec, 185 secs
lola: sara is running 190 secs || 23386527 markings, 44322902 edges, 119894 markings/sec, 190 secs
lola: sara is running 195 secs || 23921336 markings, 45493802 edges, 106962 markings/sec, 195 secs
lola: sara is running 200 secs || 24519032 markings, 46730521 edges, 119539 markings/sec, 200 secs
lola: sara is running 205 secs || 25117983 markings, 47904489 edges, 119790 markings/sec, 205 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 9 will run for 473 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t189) OR FIREABLE(t75) OR NOT FIREABLE(t250))))
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 44 bytes per marking, with 18 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 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-30b-ReachabilityFireability-9.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-30b-ReachabilityFireability-9.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 10 will run for 551 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t117) AND FIREABLE(t327) AND (FIREABLE(t157) OR FIREABLE(t267)) AND FIREABLE(t137) AND (NOT FIREABLE(t88) OR (NOT FIREABLE(t163) AND NOT FIREABLE(t104))))))
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 44 bytes per marking, with 18 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 4 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-30b-ReachabilityFireability-10.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-30b-ReachabilityFireability-10.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: subprocess 11 will run for 662 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t212) AND FIREABLE(t176) AND ((FIREABLE(t52) AND FIREABLE(t342)) OR FIREABLE(t122))) OR FIREABLE(t58))))
lola: 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 44 bytes per marking, with 18 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 13 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-30b-ReachabilityFireability-11.sara
lola: SUBRESULT
lola: result: yes
lola: lola: produced by: state space
state equation: calling and running sara
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 12 will run for 827 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t270)))
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 44 bytes per marking, with 18 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-30b-ReachabilityFireability-12.sara
sara: try reading problem file DES-PT-30b-ReachabilityFireability-11.sara.
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-30b-ReachabilityFireability-12.sara.
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 13 will run for 1103 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t250) OR FIREABLE(t274) OR NOT FIREABLE(t14) OR FIREABLE(t153) OR NOT FIREABLE(t133))))
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 44 bytes per marking, with 18 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: state equation: write sara problem file to DES-PT-30b-ReachabilityFireability-13.sara
lola: subprocess 14 will run for 1655 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t283) OR FIREABLE(t249))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: ========================================
lola: state equation: calling and running saralola:
STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 bytes per marking, with 18 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-30b-ReachabilityFireability-14.sara
sara: try reading problem file DES-PT-30b-ReachabilityFireability-13.sara.
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-30b-ReachabilityFireability-14.sara.
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: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 15 will run for 3306 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t245) OR NOT FIREABLE(t65)) AND NOT FIREABLE(t264) AND (NOT FIREABLE(t37) OR FIREABLE(t203) OR (NOT FIREABLE(t100) AND NOT FIREABLE(t33))))))
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 44 bytes per marking, with 18 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 17 literals and 6 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: write sara problem file to DES-PT-30b-ReachabilityFireability-15.sara
lola: The predicate is not invariant.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes yes yes yes yes yes yes no no yes yes yes yes no no
FORMULA DES-PT-30b-ReachabilityFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-30b-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-30b-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-30b-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-30b-ReachabilityFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-30b-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-30b-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-30b-ReachabilityFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-30b-ReachabilityFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-30b-ReachabilityFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-30b-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-30b-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-30b-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-30b-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-30b-ReachabilityFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-30b-ReachabilityFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496454862303

--------------------
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-30b"
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-30b.tgz
mv S_DES-PT-30b 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-30b, 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-149488455700297"
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 ;