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)
.................
/home/mcc/execution
total 276K
-rw-r--r-- 1 mcc users 3.4K May 30 22:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 30 22:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 16:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 29 16:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 24 11:17 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.2K May 24 11:17 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.6K May 28 11:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 28 11:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 28 09:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.5K May 28 09:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 24 11:17 NewModel
-rw-r--r-- 1 mcc users 3.6K May 28 07:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 28 07:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 111 May 26 06:33 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 349 May 26 06:33 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.6K May 27 05:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 27 05:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 28 07:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 28 07:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 24 11:17 equiv_col
-rw-r--r-- 1 mcc users 7 May 24 11:17 instance
-rw-r--r-- 1 mcc users 6 May 24 11:17 iscolored
-rw-r--r-- 1 mcc users 109K May 24 11:17 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is RefineWMG-PT-050050, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r280-csrt-152749170400738
=====================================================================

--------------------
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 RefineWMG-PT-050-050-ReachabilityFireability-00
FORMULA_NAME RefineWMG-PT-050-050-ReachabilityFireability-01
FORMULA_NAME RefineWMG-PT-050-050-ReachabilityFireability-02
FORMULA_NAME RefineWMG-PT-050-050-ReachabilityFireability-03
FORMULA_NAME RefineWMG-PT-050-050-ReachabilityFireability-04
FORMULA_NAME RefineWMG-PT-050-050-ReachabilityFireability-05
FORMULA_NAME RefineWMG-PT-050-050-ReachabilityFireability-06
FORMULA_NAME RefineWMG-PT-050-050-ReachabilityFireability-07
FORMULA_NAME RefineWMG-PT-050-050-ReachabilityFireability-08
FORMULA_NAME RefineWMG-PT-050-050-ReachabilityFireability-09
FORMULA_NAME RefineWMG-PT-050-050-ReachabilityFireability-10
FORMULA_NAME RefineWMG-PT-050-050-ReachabilityFireability-11
FORMULA_NAME RefineWMG-PT-050-050-ReachabilityFireability-12
FORMULA_NAME RefineWMG-PT-050-050-ReachabilityFireability-13
FORMULA_NAME RefineWMG-PT-050-050-ReachabilityFireability-14
FORMULA_NAME RefineWMG-PT-050-050-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1527825921125

info: Time: 3600 - MCC
===========================================================================================
prep: translating RefineWMG-PT-050050 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating RefineWMG-PT-050050 formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ RefineWMG-PT-050050 @ 3570 seconds
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 457/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 8128
lola: finding significant places
lola: 254 places, 203 transitions, 152 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 254 transition conflict sets
lola: TASK
lola: reading formula from RefineWMG-PT-050-050-ReachabilityFireability.task
lola: A (G (NOT FIREABLE(t90))) : A (G (FIREABLE(t116))) : A (G ((FIREABLE(t132) OR FIREABLE(t31)))) : E (F ((NOT FIREABLE(t74) AND NOT FIREABLE(t148) AND NOT FIREABLE(t184) AND (NOT FIREABLE(t17) OR NOT FIREABLE(t34) OR (FIREABLE(t73) AND (FIREABLE(t170) OR FIREABLE(t151))))))) : A (G (FIREABLE(t184))) : E (F (((FIREABLE(t) OR FIREABLE(t70)) AND (NOT FIREABLE(t86) OR NOT FIREABLE(t63) OR FIREABLE(t160))))) : E (F (FIREABLE(t141))) : E (F (((NOT FIREABLE(t162) OR NOT FIREABLE(t173)) AND FIREABLE(t34) AND FIREABLE(t175)))) : E (F ((NOT FIREABLE(t48) AND (FIREABLE(t178) OR FIREABLE(t153))))) : A (G ((FIREABLE(t44) OR FIREABLE(t26) OR (NOT FIREABLE(t108) AND NOT FIREABLE(t72) AND FIREABLE(t98))))) : A (G (())) : E (F (((NOT FIREABLE(t103) OR NOT FIREABLE(t162)) AND FIREABLE(t30) AND (FIREABLE(t44) OR NOT FIREABLE(t57) OR (FIREABLE(t4) AND NOT FIREABLE(t199)))))) : A (G ((((FIREABLE(t75) OR FIREABLE(t27)) AND NOT FIREABLE(t74)) OR FIREABLE(t70) OR NOT FIREABLE(t109) OR NOT FIREABLE(t43) OR NOT FIREABLE(t86) OR NOT FIREABLE(t66)))) : A (G ((FIREABLE(t107) OR FIREABLE(t183) OR FIREABLE(t40) OR FIREABLE(t10) OR (FIREABLE(t52) AND FIREABLE(t38)) OR FIREABLE(t199) OR FIREABLE(t8)))) : E (F (FIREABLE(t113))) : E (F (NOT FIREABLE(t68)))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 3 rewrites
lola: closed formula file RefineWMG-PT-050-050-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: 0 markings, 0 edges
lola: ========================================

FORMULA RefineWMG-PT-050-050-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(t116)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (FIREABLE(t116)))
lola: processed formula length: 22
lola: 5 rewrites
lola: closed formula file RefineWMG-PT-050-050-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: NOT FIREABLE(t116)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 51 markings, 50 edges
lola: ========================================

FORMULA RefineWMG-PT-050-050-ReachabilityFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(t184)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (FIREABLE(t184)))
lola: processed formula length: 22
lola: 5 rewrites
lola: closed formula file RefineWMG-PT-050-050-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: NOT FIREABLE(t184)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 51 markings, 50 edges
lola: ========================================

FORMULA RefineWMG-PT-050-050-ReachabilityFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t141)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (FIREABLE(t141)))
lola: processed formula length: 22
lola: 4 rewrites
lola: closed formula file RefineWMG-PT-050-050-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6 markings, 5 edges
lola: ========================================

FORMULA RefineWMG-PT-050-050-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t90)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (NOT FIREABLE(t90)))
lola: processed formula length: 25
lola: 5 rewrites
lola: closed formula file RefineWMG-PT-050-050-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: FIREABLE(t90)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RefineWMG-PT-050-050-ReachabilityFireability-4-0.sara
lola: lola: state equation: calling and running sara
SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 20 markings, 19 edges
lola: ========================================

FORMULA RefineWMG-PT-050-050-ReachabilityFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t113)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (FIREABLE(t113)))
lola: processed formula length: 22
lola: 4 rewrites
lola: closed formula file RefineWMG-PT-050-050-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: FIREABLE(t113)
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RefineWMG-PT-050-050-ReachabilityFireability-5-0.sara
sara: try reading problem file RefineWMG-PT-050-050-ReachabilityFireability-4-0.sara.
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 13 markings, 12 edges
lola:
========================================
FORMULA RefineWMG-PT-050-050-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (NOT FIREABLE(t68)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (NOT FIREABLE(t68)))
lola: processed formula length: 25
lola: 4 rewrites
lola: closed formula file RefineWMG-PT-050-050-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: NOT FIREABLE(t68)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RefineWMG-PT-050-050-ReachabilityFireability-6-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 51 markings, 50 edges
lola: ========================================

FORMULA RefineWMG-PT-050-050-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t132) OR FIREABLE(t31))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((FIREABLE(t132) OR FIREABLE(t31))))
lola: processed formula length: 42
lola: 5 rewrites
lola: closed formula file RefineWMG-PT-050-050-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (NOT FIREABLE(t132) AND NOT FIREABLE(t31))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 51 markings, 50 edges
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: ========================================

FORMULA RefineWMG-PT-050-050-ReachabilityFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t48) AND (FIREABLE(t178) OR FIREABLE(t153)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((NOT FIREABLE(t48) AND (FIREABLE(t178) OR FIREABLE(t153)))))
lola: processed formula length: 67
lola: 4 rewrites
lola: closed formula file RefineWMG-PT-050-050-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (NOT FIREABLE(t48) AND (FIREABLE(t178) OR FIREABLE(t153)))
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 52 markings, 51 edges
lola:
FORMULA RefineWMG-PT-050-050-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
state equation: write sara problem file to RefineWMG-PT-050-050-ReachabilityFireability-8-0.sara
lola: ========================================
lola: subprocess 9 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(t162) OR NOT FIREABLE(t173)) AND FIREABLE(t34) AND FIREABLE(t175))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((NOT FIREABLE(t162) OR NOT FIREABLE(t173)) AND FIREABLE(t34) AND FIREABLE(t175))))
lola: processed formula length: 90
lola: 4 rewrites
lola: closed formula file RefineWMG-PT-050-050-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 35 markings, 34 edges
lola: ========================================

FORMULA RefineWMG-PT-050-050-ReachabilityFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t44) OR FIREABLE(t26) OR (NOT FIREABLE(t108) AND NOT FIREABLE(t72) AND FIREABLE(t98)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((FIREABLE(t44) OR FIREABLE(t26) OR (NOT FIREABLE(t108) AND NOT FIREABLE(t72) AND FIREABLE(t98)))))
lola: processed formula length: 106
lola: 5 rewrites
lola: closed formula file RefineWMG-PT-050-050-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (NOT FIREABLE(t44) AND NOT FIREABLE(t26) AND (FIREABLE(t108) OR FIREABLE(t72) OR NOT FIREABLE(t98)))
lola: state equation: Generated DNF with 9 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to RefineWMG-PT-050-050-ReachabilityFireability-10-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 51 markings, 50 edges
lola: ========================================

FORMULA RefineWMG-PT-050-050-ReachabilityFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 714 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t) OR FIREABLE(t70)) AND (NOT FIREABLE(t86) OR NOT FIREABLE(t63) OR FIREABLE(t160)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((FIREABLE(t) OR FIREABLE(t70)) AND (NOT FIREABLE(t86) OR NOT FIREABLE(t63) OR FIREABLE(t160)))))
lola: processed formula length: 106
lola: 4 rewrites
lola: closed formula file RefineWMG-PT-050-050-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((FIREABLE(t) OR FIREABLE(t70)) AND (NOT FIREABLE(t86) OR NOT FIREABLE(t63) OR FIREABLE(t160)))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 25 markings, 24 edges
lola: state equation: Generated DNF with 12 literals and 6 conjunctive subformulas
lola: ========================================

FORMULA RefineWMG-PT-050-050-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(t103) OR NOT FIREABLE(t162)) AND FIREABLE(t30) AND (FIREABLE(t44) OR NOT FIREABLE(t57) OR (FIREABLE(t4) AND NOT FIREABLE(t199))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((NOT FIREABLE(t103) OR NOT FIREABLE(t162)) AND FIREABLE(t30) AND (FIREABLE(t44) OR NOT FIREABLE(t57) OR (FIREABLE(t4) AND NOT FIREABLE(t199))))))
lola: processed formula length: 155
lola: 4 rewrites
lola: closed formula file RefineWMG-PT-050-050-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((NOT FIREABLE(t103) OR NOT FIREABLE(t162)) AND FIREABLE(t30) AND (FIREABLE(t44) OR NOT FIREABLE(t57) OR (FIREABLE(t4) AND NOT FIREABLE(t199))))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 35 markings, 34 edges
lola: state equation: Generated DNF with 32 literals and 10 conjunctive subformulas
lola: ========================================

FORMULA RefineWMG-PT-050-050-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1190 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t107) OR FIREABLE(t183) OR FIREABLE(t40) OR FIREABLE(t10) OR (FIREABLE(t52) AND FIREABLE(t38)) OR FIREABLE(t199) OR FIREABLE(t8))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((FIREABLE(t107) OR FIREABLE(t183) OR FIREABLE(t40) OR FIREABLE(t10) OR (FIREABLE(t52) AND FIREABLE(t38)) OR FIREABLE(t199) OR FIREABLE(t8))))
lola: processed formula length: 153
lola: 5 rewrites
lola: closed formula file RefineWMG-PT-050-050-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (NOT FIREABLE(t107) AND NOT FIREABLE(t183) AND NOT FIREABLE(t40) AND NOT FIREABLE(t10) AND (NOT FIREABLE(t52) OR NOT FIREABLE(t38)) AND NOT FIREABLE(t199) AND NOT FIREABLE(t8))
lola: state equation: Generated DNF with 14 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 101 markings, 100 edges

FORMULA RefineWMG-PT-050-050-ReachabilityFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: write sara problem file to RefineWMG-PT-050-050-ReachabilityFireability-13-0.sara
lola: ========================================
lola: subprocess 14 will run for 1785 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t74) AND NOT FIREABLE(t148) AND NOT FIREABLE(t184) AND (NOT FIREABLE(t17) OR NOT FIREABLE(t34) OR (FIREABLE(t73) AND (FIREABLE(t170) OR FIREABLE(t151)))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((NOT FIREABLE(t74) AND NOT FIREABLE(t148) AND NOT FIREABLE(t184) AND (NOT FIREABLE(t17) OR NOT FIREABLE(t34) OR (FIREABLE(t73) AND (FIREABLE(t170) OR FIREABLE(t151)))))))
lola: processed formula length: 179
lola: 4 rewrites
lola: closed formula file RefineWMG-PT-050-050-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 101 markings, 100 edges
lola: ========================================

FORMULA RefineWMG-PT-050-050-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3570 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((FIREABLE(t75) OR FIREABLE(t27)) AND NOT FIREABLE(t74)) OR FIREABLE(t70) OR NOT FIREABLE(t109) OR NOT FIREABLE(t43) OR NOT FIREABLE(t86) OR NOT FIREABLE(t66))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((((FIREABLE(t75) OR FIREABLE(t27)) AND NOT FIREABLE(t74)) OR FIREABLE(t70) OR NOT FIREABLE(t109) OR NOT FIREABLE(t43) OR NOT FIREABLE(t86) OR NOT FIREABLE(t66))))
lola: processed formula length: 174
lola: 5 rewrites
lola: closed formula file RefineWMG-PT-050-050-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (((NOT FIREABLE(t75) AND NOT FIREABLE(t27)) OR FIREABLE(t74)) AND NOT FIREABLE(t70) AND FIREABLE(t109) AND FIREABLE(t43) AND FIREABLE(t86) AND FIREABLE(t66))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 40 markings, 39 edges
lola: state equation: Generated DNF with 17 literals and 2 conjunctive subformulas
lola: ========================================

FORMULA RefineWMG-PT-050-050-ReachabilityFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no no yes no yes yes yes yes no yes yes no no yes yes
lola:
preliminary result: no no no yes no yes yes yes yes no yes yes no no yes yes
lola: memory consumption: 14832 KB
lola: time consumption: 0 seconds
sara: place or transition ordering is non-deterministic


BK_STOP 1527825921518

--------------------
content from 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="RefineWMG-PT-050050"
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/RefineWMG-PT-050050.tgz
mv RefineWMG-PT-050050 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool lola"
echo " Input is RefineWMG-PT-050050, 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 r280-csrt-152749170400738"
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 ;