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

--------------------
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 1494630268649


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
ReachabilityFireability @ 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: state equation: write sara problem file to DES-PT-30b-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 ((NOT FIREABLE(t139) AND FIREABLE(t262) AND (((FIREABLE(t54) OR FIREABLE(t266)) AND NOT FIREABLE(t143)) OR FIREABLE(t75)))))
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 15 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-30b-ReachabilityFireability-3.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
lola: sara is running 0 secs || 795496 markings, 1014298 edges, 159099 markings/sec, 0 secs
lola: sara is running 5 secs || 1571480 markings, 2015956 edges, 155197 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 || 836323 markings, 1061357 edges, 167265 markings/sec, 0 secs
lola: sara is running 5 secs || 1634243 markings, 2095252 edges, 159584 markings/sec, 5 secs
lola: sara is running 10 secs || 2370659 markings, 3127800 edges, 147283 markings/sec, 10 secs
lola: sara is running 15 secs || 3140219 markings, 4183927 edges, 153912 markings/sec, 15 secs
lola: sara is running 20 secs || 3906582 markings, 5223277 edges, 153273 markings/sec, 20 secs
lola: sara is running 25 secs || 4619444 markings, 6249478 edges, 142572 markings/sec, 25 secs
lola: sara is running 30 secs || 5336716 markings, 7261350 edges, 143454 markings/sec, 30 secs
lola: sara is running 35 secs || 6008334 markings, 8190819 edges, 134324 markings/sec, 35 secs
lola: sara is running 40 secs || 6537569 markings, 9361484 edges, 105847 markings/sec, 40 secs
lola: sara is running 45 secs || 7102894 markings, 10457210 edges, 113065 markings/sec, 45 secs
lola: sara is running 50 secs || 7608742 markings, 11630939 edges, 101170 markings/sec, 50 secs
lola: sara is running 55 secs || 8182152 markings, 12741691 edges, 114682 markings/sec, 55 secs
lola: sara is running 60 secs || 8709338 markings, 13804842 edges, 105437 markings/sec, 60 secs
lola: sara is running 65 secs || 9244717 markings, 14990410 edges, 107076 markings/sec, 65 secs
lola: sara is running 70 secs || 9808139 markings, 16080044 edges, 112684 markings/sec, 70 secs
lola: sara is running 75 secs || 10314056 markings, 17255519 edges, 101183 markings/sec, 75 secs
lola: sara is running 80 secs || 10892200 markings, 18377464 edges, 115629 markings/sec, 80 secs
lola: sara is running 85 secs || 11428410 markings, 19443407 edges, 107242 markings/sec, 85 secs
lola: sara is running 90 secs || 11963695 markings, 20647448 edges, 107057 markings/sec, 90 secs
lola: sara is running 95 secs || 12535429 markings, 21754593 edges, 114347 markings/sec, 95 secs
lola: sara is running 100 secs || 13038286 markings, 22924493 edges, 100571 markings/sec, 100 secs
lola: sara is running 105 secs || 13623997 markings, 24064477 edges, 117142 markings/sec, 105 secs
lola: sara is running 110 secs || 14181422 markings, 25140327 edges, 111485 markings/sec, 110 secs
lola: sara is running 115 secs || 14706999 markings, 26361166 edges, 105115 markings/sec, 115 secs
lola: sara is running 120 secs || 15287784 markings, 27489603 edges, 116157 markings/sec, 120 secs
lola: sara is running 125 secs || 15800706 markings, 28628453 edges, 102584 markings/sec, 125 secs
lola: sara is running 130 secs || 16378797 markings, 29804014 edges, 115618 markings/sec, 130 secs
lola: sara is running 135 secs || 16946938 markings, 30903961 edges, 113628 markings/sec, 135 secs
lola: sara is running 140 secs || 17468632 markings, 32113709 edges, 104339 markings/sec, 140 secs
lola: sara is running 145 secs || 18062784 markings, 33273954 edges, 118830 markings/sec, 145 secs
lola: sara is running 150 secs || 18604855 markings, 34378234 edges, 108414 markings/sec, 150 secs
lola: sara is running 155 secs || 19160978 markings, 35606687 edges, 111225 markings/sec, 155 secs
lola: sara is running 160 secs || 19745279 markings, 36741000 edges, 116860 markings/sec, 160 secs
lola: sara is running 165 secs || 20261721 markings, 37931200 edges, 103288 markings/sec, 165 secs
lola: sara is running 170 secs || 20859482 markings, 39113399 edges, 119552 markings/sec, 170 secs
lola: sara is running 175 secs || 21435677 markings, 40230878 edges, 115239 markings/sec, 175 secs
lola: sara is running 180 secs || 21967934 markings, 41465925 edges, 106451 markings/sec, 180 secs
lola: sara is running 185 secs || 22569347 markings, 42643353 edges, 120283 markings/sec, 185 secs
lola: sara is running 190 secs || 23120544 markings, 43754125 edges, 110239 markings/sec, 190 secs
lola: sara is running 195 secs || 23679875 markings, 45004573 edges, 111866 markings/sec, 195 secs
lola: sara is running 200 secs || 24278817 markings, 46175104 edges, 119788 markings/sec, 200 secs
lola: sara is running 205 secs || 24809817 markings, 47349422 edges, 106200 markings/sec, 205 secs
lola: sara is running 210 secs || 25409840 markings, 48581434 edges, 120005 markings/sec, 210 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 9 will run for 472 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: ========================================
lola: subprocess 11 will run for 661 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: 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: 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-11.sara
lola: subprocess 12 will run for 827 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t270)))
lola: lola: ========================================
lola: state equation: calling and running sara
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 1102 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: state equation: write sara problem file to DES-PT-30b-ReachabilityFireability-13.sara
lola: The predicate is invariant.
lola: subprocess 14 will run for 1653 seconds at most (--localtimelimit=-1)
lola: lola: state equation: calling and running sara
========================================
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: 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 3304 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: The predicate is not invariant.
lola: state equation: write sara problem file to DES-PT-30b-ReachabilityFireability-15.sara
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 1494630505008

--------------------
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="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/DES-PT-30b.tgz
mv 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 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 r018-ebro-149436309100297"
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 ;