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_Solitaire-PT-EngNC7x7, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r158-ebro-149443463900081
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496559559887


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


checking for too many tokens
===========================================================================================
S_Solitaire-PT-EngNC7x7: translating PT formula ReachabilityFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
ReachabilityFireability @ S_Solitaire-PT-EngNC7x7 @ 3539 seconds
----- Start make result stdout -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 142/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 66 places, 76 transitions, 33 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 152 transition conflict sets
lola: TASK
lola: reading formula from Solitaire-PT-EngNC7x7-ReachabilityFireability.task
lola: E (F ((((FIREABLE(right35) AND FIREABLE(left32)) OR FIREABLE(up34)) AND FIREABLE(down42) AND (FIREABLE(left35) OR FIREABLE(right46))))) : E (F ((FIREABLE(right42) AND FIREABLE(down46) AND (FIREABLE(down43) OR FIREABLE(right33) OR FIREABLE(up42) OR FIREABLE(left54)) AND FIREABLE(up44)))) : E (F ((((FIREABLE(down47) AND FIREABLE(up65) AND NOT FIREABLE(down25)) OR (FIREABLE(left55) AND FIREABLE(up25) AND (FIREABLE(down63) OR FIREABLE(left44)))) AND FIREABLE(left56)))) : A (G ((NOT FIREABLE(up23) OR (FIREABLE(down46) AND FIREABLE(right45)) OR FIREABLE(right14) OR NOT FIREABLE(up25) OR NOT FIREABLE(left46) OR NOT FIREABLE(right64) OR NOT FIREABLE(down41)))) : E (F ((FIREABLE(down35) AND FIREABLE(down24) AND (FIREABLE(left33) OR FIREABLE(right52))))) : A (G (())) : A (G ((NOT FIREABLE(down46) OR (FIREABLE(left53) AND FIREABLE(right56)) OR FIREABLE(right45) OR FIREABLE(up35) OR NOT FIREABLE(right42) OR (NOT FIREABLE(right64) AND NOT FIREABLE(left52))))) : A (G (((NOT FIREABLE(down47) AND NOT FIREABLE(right52)) OR NOT FIREABLE(left46) OR NOT FIREABLE(left56)))) : A (G ((NOT FIREABLE(left52) OR NOT FIREABLE(right46) OR NOT FIREABLE(down34) OR NOT FIREABLE(right74) OR (FIREABLE(left43) AND NOT FIREABLE(left45))))) : E (F ((FIREABLE(left64) AND FIREABLE(down65) AND NOT FIREABLE(right55) AND FIREABLE(right33) AND FIREABLE(down47)))) : E (F ((FIREABLE(right44) AND FIREABLE(left46) AND FIREABLE(up42) AND (NOT FIREABLE(up55) OR NOT FIREABLE(right45))))) : E (F (((FIREABLE(down24) OR FIREABLE(down34) OR (FIREABLE(left53) AND FIREABLE(down64) AND NOT FIREABLE(up41))) AND FIREABLE(right52)))) : A (G ((NOT FIREABLE(left34) OR FIREABLE(down35) OR NOT FIREABLE(left35)))) : A (G ((FIREABLE(left56) OR ((FIREABLE(left14) OR FIREABLE(down25)) AND NOT FIREABLE(right35)) OR NOT FIREABLE(right52) OR NOT FIREABLE(down25) OR NOT FIREABLE(down44)))) : E (F ((FIREABLE(up63) AND FIREABLE(up64) AND FIREABLE(right36)))) : A (G ((NOT FIREABLE(down63) OR NOT FIREABLE(up64) OR NOT FIREABLE(down53) OR (NOT FIREABLE(up25) AND NOT FIREABLE(left36)))))
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(right35) AND FIREABLE(left32)) OR FIREABLE(up34)) AND FIREABLE(down42) AND (FIREABLE(left35) OR FIREABLE(right46)))))
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 132 bytes per marking, with 0 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 42 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-EngNC7x7-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-EngNC7x7-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: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(right42) AND FIREABLE(down46) AND (FIREABLE(down43) OR FIREABLE(right33) OR FIREABLE(up42) OR FIREABLE(left54)) AND FIREABLE(up44))))
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 132 bytes per marking, with 0 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: ========================================
lola: state equation: Generated DNF with 48 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-EngNC7x7-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-EngNC7x7-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(down47) AND FIREABLE(up65) AND NOT FIREABLE(down25)) OR (FIREABLE(left55) AND FIREABLE(up25) AND (FIREABLE(down63) OR FIREABLE(left44)))) AND FIREABLE(left56))))
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 132 bytes per marking, with 0 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 54 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-EngNC7x7-ReachabilityFireability-2.sara
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-EngNC7x7-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 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(up23) OR (FIREABLE(down46) AND FIREABLE(right45)) OR FIREABLE(right14) OR NOT FIREABLE(up25) OR NOT FIREABLE(left46) OR NOT FIREABLE(right64) OR NOT FIREABLE(down41))))
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 132 bytes per marking, with 0 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 102 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-EngNC7x7-ReachabilityFireability-3.sara
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-EngNC7x7-ReachabilityFireability-3.sara.
sara: place or transition ordering is non-deterministic

lola: sara is running 0 secs || 549589 markings, 1984158 edges, 109918 markings/sec, 0 secs
lola: state equation: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(down35) AND FIREABLE(down24) AND (FIREABLE(left33) OR FIREABLE(right52)))))
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 132 bytes per marking, with 0 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 2 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-EngNC7x7-ReachabilityFireability-4.sara
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-EngNC7x7-ReachabilityFireability-4.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 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (()))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 3 rewrites
lola: formula mentions 0 of 66 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngNC7x7-ReachabilityFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(down46) OR (FIREABLE(left53) AND FIREABLE(right56)) OR FIREABLE(right45) OR FIREABLE(up35) OR NOT FIREABLE(right42) OR (NOT FIREABLE(right64) AND NOT FIREABLE(left52)))))
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 132 bytes per marking, with 0 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 7 will run for 392 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(down47) AND NOT FIREABLE(right52)) OR NOT FIREABLE(left46) OR NOT FIREABLE(left56))))
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 132 bytes per marking, with 0 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 2 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-EngNC7x7-ReachabilityFireability-7.sara
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-EngNC7x7-ReachabilityFireability-7.sara.
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: subprocess 8 will run for 441 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(left52) OR NOT FIREABLE(right46) OR NOT FIREABLE(down34) OR NOT FIREABLE(right74) OR (FIREABLE(left43) AND NOT FIREABLE(left45)))))
lola: ========================================
lola: SUBTASK
lola: 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 132 bytes per marking, with 0 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 54 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-EngNC7x7-ReachabilityFireability-8.sara
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-EngNC7x7-ReachabilityFireability-8.sara.
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 9 will run for 504 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(left64) AND FIREABLE(down65) AND NOT FIREABLE(right55) AND FIREABLE(right33) AND FIREABLE(down47))))
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 132 bytes per marking, with 0 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 39 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-EngNC7x7-ReachabilityFireability-9.sara
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-EngNC7x7-ReachabilityFireability-9.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 10 will run for 588 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(right44) AND FIREABLE(left46) AND FIREABLE(up42) AND (NOT FIREABLE(up55) OR NOT FIREABLE(right45)))))
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 132 bytes per marking, with 0 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 3 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-EngNC7x7-ReachabilityFireability-10.sara
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-EngNC7x7-ReachabilityFireability-10.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 11 will run for 706 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(down24) OR FIREABLE(down34) OR (FIREABLE(left53) AND FIREABLE(down64) AND NOT FIREABLE(up41))) AND FIREABLE(right52))))
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 132 bytes per marking, with 0 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 32 literals and 4 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 Solitaire-PT-EngNC7x7-ReachabilityFireability-11.sara
lola: subprocess 12 will run for 883 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(left34) OR FIREABLE(down35) OR NOT FIREABLE(left35))))
lola: ========================================
lola: lola: SUBTASK
lola: lola: ======================================== state equation: calling and running sara

checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 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 2 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-EngNC7x7-ReachabilityFireability-12.sara
sara: try reading problem file Solitaire-PT-EngNC7x7-ReachabilityFireability-11.sara.
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-EngNC7x7-ReachabilityFireability-12.sara.
sara: place or transition ordering is non-deterministic
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 13 will run for 1177 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(left56) OR ((FIREABLE(left14) OR FIREABLE(down25)) AND NOT FIREABLE(right35)) OR NOT FIREABLE(right52) OR NOT FIREABLE(down25) OR NOT FIREABLE(down44))))
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 132 bytes per marking, with 0 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 39 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-EngNC7x7-ReachabilityFireability-13.sara
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-EngNC7x7-ReachabilityFireability-13.sara.
sara: place or transition ordering is non-deterministic
sara: warning, failure of lp_solve (at job 32)

lola: state equation: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 14 will run for 1766 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(up63) AND FIREABLE(up64) AND FIREABLE(right36))))
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 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 9 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-EngNC7x7-ReachabilityFireability-14.sara
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-EngNC7x7-ReachabilityFireability-14.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 15 will run for 3531 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(down63) OR NOT FIREABLE(up64) OR NOT FIREABLE(down53) OR (NOT FIREABLE(up25) AND NOT FIREABLE(left36)))))
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 132 bytes per marking, with 0 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 2 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-EngNC7x7-ReachabilityFireability-15.sara
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-EngNC7x7-ReachabilityFireability-15.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: RESULT
lola:
SUMMARY: yes yes no no yes yes no no no no yes yes yes no yes yes
FORMULA Solitaire-PT-EngNC7x7-ReachabilityFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngNC7x7-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngNC7x7-ReachabilityFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngNC7x7-ReachabilityFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngNC7x7-ReachabilityFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngNC7x7-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngNC7x7-ReachabilityFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngNC7x7-ReachabilityFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngNC7x7-ReachabilityFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngNC7x7-ReachabilityFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngNC7x7-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngNC7x7-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngNC7x7-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngNC7x7-ReachabilityFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngNC7x7-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngNC7x7-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496559568188

--------------------
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_Solitaire-PT-EngNC7x7"
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_Solitaire-PT-EngNC7x7.tgz
mv S_Solitaire-PT-EngNC7x7 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_Solitaire-PT-EngNC7x7, 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 r158-ebro-149443463900081"
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 ;