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

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

=== Now, execution of the tool begins

BK_START 1496456545500


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


checking for too many tokens
===========================================================================================
S_DES-PT-50a: translating PT formula ReachabilityFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
ReachabilityFireability @ S_DES-PT-50a @ 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: 585/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 314 places, 271 transitions, 255 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 296 transition conflict sets
lola: TASK
lola: reading formula from DES-PT-50a-ReachabilityFireability.task
lola: E (F (((FIREABLE(t100) AND FIREABLE(t115)) OR (((FIREABLE(t16) AND FIREABLE(t173)) OR (FIREABLE(t15) AND FIREABLE(t53))) AND NOT FIREABLE(t175))))) : A (G ((FIREABLE(t238) OR (FIREABLE(t31) AND FIREABLE(t258) AND NOT FIREABLE(t232)) OR NOT FIREABLE(t70)))) : E (F ((FIREABLE(t26) AND FIREABLE(t180) AND ((FIREABLE(t75) AND FIREABLE(t207)) OR (FIREABLE(t158) AND FIREABLE(t96)) OR FIREABLE(t89))))) : E (F ((NOT FIREABLE(t22) AND NOT FIREABLE(t97) AND FIREABLE(t197) AND FIREABLE(t82)))) : A (G ((NOT FIREABLE(t215) OR NOT FIREABLE(t114) OR (FIREABLE(t159) AND (FIREABLE(t38) OR FIREABLE(t131))) OR (FIREABLE(t252) AND FIREABLE(t185) AND (FIREABLE(t227) OR FIREABLE(t95) OR FIREABLE(t40)))))) : E (F ((FIREABLE(t181) AND FIREABLE(t90)))) : E (F (FIREABLE(t130))) : A (G (NOT FIREABLE(t49))) : E (F (FIREABLE(t48))) : A (G (((FIREABLE(t6) AND FIREABLE(t46)) OR NOT FIREABLE(t74) OR FIREABLE(t135) OR FIREABLE(t148)))) : A (G ((NOT FIREABLE(t90) OR NOT FIREABLE(t131) OR FIREABLE(t206) OR (FIREABLE(t133) AND (FIREABLE(t126) OR FIREABLE(t130) OR FIREABLE(t247)))))) : A (G (((NOT FIREABLE(t170) AND NOT FIREABLE(t211) AND FIREABLE(t11)) OR NOT FIREABLE(t168)))) : E (F (((NOT FIREABLE(t210) OR NOT FIREABLE(t112) OR FIREABLE(t195)) AND FIREABLE(t58)))) : A (G (((NOT FIREABLE(t53) OR NOT FIREABLE(t217) OR (NOT FIREABLE(t202) AND NOT FIREABLE(t174))) AND ((NOT FIREABLE(t231) AND NOT FIREABLE(t205)) OR (NOT FIREABLE(t142) AND NOT FIREABLE(t84)))))) : E (F (((NOT FIREABLE(t230) OR NOT FIREABLE(t123) OR (NOT FIREABLE(t140) AND NOT FIREABLE(t223))) AND FIREABLE(t34)))) : E (F (FIREABLE(t68)))
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(t100) AND FIREABLE(t115)) OR (((FIREABLE(t16) AND FIREABLE(t173)) OR (FIREABLE(t15) AND FIREABLE(t53))) AND NOT FIREABLE(t175)))))
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 32 bytes per marking, with 1 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-50a-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-50a-ReachabilityFireability.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 593031 markings, 1421806 edges, 118606 markings/sec, 0 secs
lola: sara is running 5 secs || 1180915 markings, 2895429 edges, 117577 markings/sec, 5 secs
lola: sara is running 10 secs || 1739058 markings, 4417822 edges, 111629 markings/sec, 10 secs
lola: sara is running 15 secs || 2348427 markings, 5836806 edges, 121874 markings/sec, 15 secs
lola: sara is running 20 secs || 2923431 markings, 7376775 edges, 115001 markings/sec, 20 secs
lola: sara is running 25 secs || 3512389 markings, 8877429 edges, 117792 markings/sec, 25 secs
lola: sara is running 30 secs || 4136203 markings, 10278882 edges, 124763 markings/sec, 30 secs
lola: sara is running 35 secs || 4704502 markings, 11836646 edges, 113660 markings/sec, 35 secs
lola: sara is running 40 secs || 5282725 markings, 13353596 edges, 115645 markings/sec, 40 secs
lola: sara is running 45 secs || 5902531 markings, 14713109 edges, 123961 markings/sec, 45 secs
lola: sara is running 50 secs || 6468656 markings, 16261286 edges, 113225 markings/sec, 50 secs
lola: sara is running 55 secs || 7015928 markings, 17843314 edges, 109454 markings/sec, 55 secs
lola: sara is running 60 secs || 7585969 markings, 19264814 edges, 114008 markings/sec, 60 secs
lola: sara is running 65 secs || 8150295 markings, 20713284 edges, 112865 markings/sec, 65 secs
lola: sara is running 70 secs || 8720958 markings, 22140085 edges, 114133 markings/sec, 70 secs
lola: sara is running 75 secs || 9269110 markings, 23684784 edges, 109630 markings/sec, 75 secs
lola: sara is running 80 secs || 9797908 markings, 25229144 edges, 105760 markings/sec, 80 secs
lola: sara is running 85 secs || 10316487 markings, 26843250 edges, 103716 markings/sec, 85 secs
lola: sara is running 90 secs || 10853506 markings, 28289202 edges, 107404 markings/sec, 90 secs
lola: sara is running 95 secs || 11388113 markings, 29714905 edges, 106921 markings/sec, 95 secs
lola: sara is running 100 secs || 11915302 markings, 31166698 edges, 105438 markings/sec, 100 secs
lola: sara is running 105 secs || 12452869 markings, 32645674 edges, 107513 markings/sec, 105 secs
lola: sara is running 110 secs || 12963018 markings, 34183979 edges, 102030 markings/sec, 110 secs
lola: sara is running 115 secs || 13468791 markings, 35766545 edges, 101155 markings/sec, 115 secs
lola: sara is running 120 secs || 13946489 markings, 37362569 edges, 95540 markings/sec, 120 secs
lola: sara is running 125 secs || 14460146 markings, 38836774 edges, 102731 markings/sec, 125 secs
lola: sara is running 130 secs || 14979735 markings, 40247169 edges, 103918 markings/sec, 130 secs
lola: sara is running 135 secs || 15477235 markings, 41689023 edges, 99500 markings/sec, 135 secs
lola: sara is running 140 secs || 15993955 markings, 43116285 edges, 103344 markings/sec, 140 secs
lola: sara is running 145 secs || 16499302 markings, 44554575 edges, 101069 markings/sec, 145 secs
lola: sara is running 150 secs || 16994052 markings, 46061760 edges, 98950 markings/sec, 150 secs
lola: sara is running 155 secs || 17451264 markings, 47584497 edges, 91442 markings/sec, 155 secs
lola: sara is running 160 secs || 17936247 markings, 49109178 edges, 96997 markings/sec, 160 secs
lola: sara is running 165 secs || 18407746 markings, 50661345 edges, 94300 markings/sec, 165 secs
lola: sara is running 170 secs || 18883652 markings, 52034958 edges, 95181 markings/sec, 170 secs
lola: sara is running 175 secs || 19379090 markings, 53411068 edges, 99088 markings/sec, 175 secs
lola: sara is running 180 secs || 19874358 markings, 54829734 edges, 99054 markings/sec, 180 secs
lola: sara is running 185 secs || 20360854 markings, 56198672 edges, 97299 markings/sec, 185 secs
lola: sara is running 190 secs || 20861302 markings, 57597717 edges, 100090 markings/sec, 190 secs
lola: sara is running 195 secs || 21338785 markings, 59014221 edges, 95497 markings/sec, 195 secs
lola: sara is running 200 secs || 21836881 markings, 60379850 edges, 99619 markings/sec, 200 secs
lola: sara is running 205 secs || 22316433 markings, 61700376 edges, 95910 markings/sec, 205 secs
lola: sara is running 210 secs || 22771564 markings, 63012167 edges, 91026 markings/sec, 210 secs
lola: sara is running 215 secs || 23215287 markings, 64443543 edges, 88745 markings/sec, 215 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t238) OR (FIREABLE(t31) AND FIREABLE(t258) AND NOT FIREABLE(t232)) OR NOT FIREABLE(t70))))
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 32 bytes per marking, with 1 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 60 literals and 14 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-50a-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-50a-ReachabilityFireability.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 2 will run for 237 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t26) AND FIREABLE(t180) AND ((FIREABLE(t75) AND FIREABLE(t207)) OR (FIREABLE(t158) AND FIREABLE(t96)) OR FIREABLE(t89)))))
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 32 bytes per marking, with 1 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 25 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-50a-ReachabilityFireability-2.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-50a-ReachabilityFireability-2.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 3 will run for 255 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t22) AND NOT FIREABLE(t97) AND FIREABLE(t197) AND FIREABLE(t82))))
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 32 bytes per marking, with 1 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 18 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-50a-ReachabilityFireability-3.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-50a-ReachabilityFireability-3.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 4 will run for 276 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t215) OR NOT FIREABLE(t114) OR (FIREABLE(t159) AND (FIREABLE(t38) OR FIREABLE(t131))) OR (FIREABLE(t252) AND FIREABLE(t185) AND (FIREABLE(t227) OR FIREABLE(t95) OR FIREABLE(t40))))))
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 32 bytes per marking, with 1 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 528 literals and 64 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-50a-ReachabilityFireability-4.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-50a-ReachabilityFireability-4.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 5 will run for 301 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t181) AND FIREABLE(t90))))
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 32 bytes per marking, with 1 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-50a-ReachabilityFireability-5.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-50a-ReachabilityFireability-5.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 6 will run for 331 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t130)))
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 32 bytes per marking, with 1 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-50a-ReachabilityFireability-6.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-50a-ReachabilityFireability-6.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 7 will run for 368 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t49)))
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 32 bytes per marking, with 1 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-50a-ReachabilityFireability-7.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-50a-ReachabilityFireability-7.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: subprocess 8 will run for 414 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t48)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: ========================================
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 1 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-50a-ReachabilityFireability-8.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 9 will run for 473 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(t6) AND FIREABLE(t46)) OR NOT FIREABLE(t74) OR FIREABLE(t135) OR FIREABLE(t148))))
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 32 bytes per marking, with 1 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 80 literals and 16 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-50a-ReachabilityFireability-9.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-50a-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 552 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t90) OR NOT FIREABLE(t131) OR FIREABLE(t206) OR (FIREABLE(t133) AND (FIREABLE(t126) OR FIREABLE(t130) OR FIREABLE(t247))))))
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 32 bytes per marking, with 1 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 44 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-50a-ReachabilityFireability-10.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-50a-ReachabilityFireability-10.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 11 will run for 662 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t170) AND NOT FIREABLE(t211) AND FIREABLE(t11)) OR NOT FIREABLE(t168))))
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 32 bytes per marking, with 1 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 5 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-50a-ReachabilityFireability-11.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 12 will run for 828 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(t210) OR NOT FIREABLE(t112) OR FIREABLE(t195)) AND 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 32 bytes per marking, with 1 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 5 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-50a-ReachabilityFireability-12.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: subprocess 13 will run for 1104 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t53) OR NOT FIREABLE(t217) OR (NOT FIREABLE(t202) AND NOT FIREABLE(t174))) AND ((NOT FIREABLE(t231) AND NOT FIREABLE(t205)) OR (NOT FIREABLE(t142) AND NOT FIREABLE(t84))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: ========================================lola:
STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 1 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 30 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-50a-ReachabilityFireability-13.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-50a-ReachabilityFireability-13.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 14 will run for 1657 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(t230) OR NOT FIREABLE(t123) OR (NOT FIREABLE(t140) AND NOT FIREABLE(t223))) AND FIREABLE(t34))))
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 32 bytes per marking, with 1 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 40 literals and 9 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-50a-ReachabilityFireability-14.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 15 will run for 3314 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t68)))
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 32 bytes per marking, with 1 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-50a-ReachabilityFireability-15.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-50a-ReachabilityFireability-15.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: RESULT
lola:
SUMMARY: unknown no no yes no yes yes no yes no yes no yes no yes yes
lola: ========================================
FORMULA DES-PT-50a-ReachabilityFireability-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50a-ReachabilityFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50a-ReachabilityFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50a-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50a-ReachabilityFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50a-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50a-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50a-ReachabilityFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50a-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50a-ReachabilityFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50a-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50a-ReachabilityFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50a-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50a-ReachabilityFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50a-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50a-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496456772460

--------------------
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-50a"
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-50a.tgz
mv S_DES-PT-50a 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-50a, 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-149488455700324"
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 ;