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 208K
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.4K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 116 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 354 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 10 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rwxr-xr-x 1 mcc users 46K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is NeighborGrid-PT-d3n3m1t11, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r112-csrt-152666469200224
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527021626481

info: Time: 3600 - MCC
===========================================================================================
prep: translating NeighborGrid-PT-d3n3m1t11 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating NeighborGrid-PT-d3n3m1t11 formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ NeighborGrid-PT-d3n3m1t11 @ 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: 189/65536 symbol table entries, 8 collisions
lola: preprocessing...
lola: Size of bit vector: 864
lola: finding significant places
lola: 27 places, 162 transitions, 26 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 27 transition conflict sets
lola: TASK
lola: reading formula from NeighborGrid-PT-d3n3m1t11-ReachabilityFireability.task
lola: A (G ((FIREABLE(ti_1_1_1v_1_1_2) OR (FIREABLE(ti_0_0_2v_0_1_2) AND FIREABLE(ti_0_2_2v_2_2_2))))) : A (G ((FIREABLE(to_0_2_2v_1_2_2) OR (FIREABLE(to_2_0_0v_2_0_2) AND FIREABLE(ti_0_0_0v_0_2_0) AND FIREABLE(to_2_0_0v_2_1_0)) OR FIREABLE(to_1_2_0v_1_2_2)))) : E (F ((NOT FIREABLE(ti_0_0_2v_1_0_2) AND NOT FIREABLE(ti_2_1_0v_2_2_0) AND NOT FIREABLE(ti_1_1_0v_2_1_0) AND (NOT FIREABLE(to_2_1_1v_2_2_1) OR FIREABLE(to_1_0_0v_1_2_0))))) : A (G (())) : E (F ((FIREABLE(ti_1_2_0v_2_2_0) AND NOT FIREABLE(ti_0_0_0v_0_0_1) AND (FIREABLE(to_2_2_1v_2_2_2) OR FIREABLE(ti_1_0_2v_1_1_2)) AND (FIREABLE(ti_2_0_1v_2_0_2) OR FIREABLE(ti_0_0_2v_0_2_2)) AND (NOT FIREABLE(ti_2_1_2v_2_2_2) OR NOT FIREABLE(to_0_2_0v_2_2_0)) AND (NOT FIREABLE(ti_2_0_0v_2_0_1) OR NOT FIREABLE(ti_0_0_1v_2_0_1))))) : A (G ((FIREABLE(to_0_0_1v_0_1_1) OR FIREABLE(ti_2_0_0v_2_0_2)))) : A (G ((FIREABLE(ti_1_1_1v_2_1_1) OR FIREABLE(ti_1_2_0v_2_2_0) OR FIREABLE(ti_2_0_1v_2_2_1) OR FIREABLE(to_0_2_1v_2_2_1) OR (FIREABLE(to_2_0_2v_2_2_2) AND (NOT FIREABLE(ti_2_2_1v_2_2_2) OR NOT FIREABLE(ti_2_1_1v_2_2_1)))))) : A (G ((FIREABLE(ti_1_1_0v_2_1_0) OR NOT FIREABLE(ti_2_0_0v_2_1_0)))) : A (G ((FIREABLE(ti_1_0_0v_1_0_2) OR FIREABLE(ti_1_1_1v_1_1_2)))) : A (G ((((FIREABLE(ti_0_2_0v_0_2_1) OR FIREABLE(ti_1_0_1v_1_1_1)) AND FIREABLE(ti_1_0_0v_1_0_2)) OR (NOT FIREABLE(ti_1_2_1v_1_2_2) AND NOT FIREABLE(to_0_0_0v_0_0_1)) OR FIREABLE(to_2_1_1v_2_2_1) OR FIREABLE(ti_0_1_1v_1_1_1) OR FIREABLE(ti_0_1_1v_2_1_1) OR FIREABLE(ti_1_0_1v_1_0_2)))) : A (G ((FIREABLE(ti_2_0_0v_2_0_2) OR FIREABLE(ti_0_1_2v_2_1_2) OR (FIREABLE(ti_0_0_0v_0_0_2) AND FIREABLE(to_1_1_1v_1_2_1)) OR FIREABLE(to_1_2_1v_1_2_2) OR FIREABLE(to_1_2_0v_2_2_0)))) : E (F ((FIREABLE(ti_1_1_1v_1_2_1) AND FIREABLE(ti_1_2_2v_2_2_2) AND NOT FIREABLE(ti_0_1_1v_2_1_1) AND NOT FIREABLE(to_1_2_0v_2_2_0) AND FIREABLE(to_2_1_1v_2_1_2)))) : E (F ((NOT FIREABLE(ti_0_0_2v_0_1_2) AND FIREABLE(ti_1_1_0v_2_1_0) AND NOT FIREABLE(ti_0_1_1v_0_2_1) AND NOT FIREABLE(to_0_1_1v_2_1_1) AND FIREABLE(ti_0_1_1v_0_1_2)))) : A (G (((FIREABLE(ti_0_1_1v_0_2_1) AND FIREABLE(ti_2_2_0v_2_2_2)) OR NOT FIREABLE(ti_2_1_1v_2_2_1) OR (FIREABLE(to_0_1_1v_0_1_2) AND FIREABLE(to_0_0_1v_1_0_1)) OR NOT FIREABLE(ti_2_1_0v_2_2_0)))) : A (G (((NOT FIREABLE(ti_0_1_0v_2_1_0) AND FIREABLE(to_0_1_0v_1_1_0)) OR NOT FIREABLE(ti_0_0_0v_0_0_2) OR FIREABLE(to_0_0_2v_1_0_2)))) : A (G (((FIREABLE(to_0_0_2v_2_0_2) AND FIREABLE(to_0_0_0v_0_1_0) AND FIREABLE(ti_1_0_0v_1_1_0)) OR FIREABLE(ti_1_0_2v_1_2_2) OR FIREABLE(to_1_0_0v_1_2_0))))
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 NeighborGrid-PT-d3n3m1t11-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 NeighborGrid-PT-d3n3m1t11-ReachabilityFireability-3 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(to_0_0_1v_0_1_1) OR FIREABLE(ti_2_0_0v_2_0_2))))
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(to_0_0_1v_0_1_1) OR FIREABLE(ti_2_0_0v_2_0_2))))
lola: processed formula length: 65
lola: 5 rewrites
lola: closed formula file NeighborGrid-PT-d3n3m1t11-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(to_0_0_1v_0_1_1) AND NOT FIREABLE(ti_2_0_0v_2_0_2))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to NeighborGrid-PT-d3n3m1t11-ReachabilityFireability-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 3 markings, 2 edges
lola: ========================================

FORMULA NeighborGrid-PT-d3n3m1t11-ReachabilityFireability-5 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(ti_1_1_0v_2_1_0) OR NOT FIREABLE(ti_2_0_0v_2_1_0))))
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(ti_1_1_0v_2_1_0) OR NOT FIREABLE(ti_2_0_0v_2_1_0))))
lola: processed formula length: 69
lola: 5 rewrites
lola: closed formula file NeighborGrid-PT-d3n3m1t11-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(ti_1_1_0v_2_1_0) AND FIREABLE(ti_2_0_0v_2_1_0))
lola: state equation: State predicate is contradiction.
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.

FORMULA NeighborGrid-PT-d3n3m1t11-ReachabilityFireability-7 TRUE 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: A (G ((FIREABLE(ti_1_0_0v_1_0_2) OR FIREABLE(ti_1_1_1v_1_1_2))))
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(ti_1_0_0v_1_0_2) OR FIREABLE(ti_1_1_1v_1_1_2))))
lola: processed formula length: 65
lola: 5 rewrites
lola: closed formula file NeighborGrid-PT-d3n3m1t11-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(ti_1_0_0v_1_0_2) AND NOT FIREABLE(ti_1_1_1v_1_1_2))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 3 markings, 2 edges

FORMULA NeighborGrid-PT-d3n3m1t11-ReachabilityFireability-8 FALSE 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 ((FIREABLE(ti_1_1_1v_1_1_2) OR (FIREABLE(ti_0_0_2v_0_1_2) AND FIREABLE(ti_0_2_2v_2_2_2)))))
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(ti_1_1_1v_1_1_2) OR (FIREABLE(ti_0_0_2v_0_1_2) AND FIREABLE(ti_0_2_2v_2_2_2)))))
lola: processed formula length: 97
lola: 5 rewrites
lola: closed formula file NeighborGrid-PT-d3n3m1t11-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: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 4 markings, 3 edges
lola: ========================================

FORMULA NeighborGrid-PT-d3n3m1t11-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: A (G (((NOT FIREABLE(ti_0_1_0v_2_1_0) AND FIREABLE(to_0_1_0v_1_1_0)) OR NOT FIREABLE(ti_0_0_0v_0_0_2) OR FIREABLE(to_0_0_2v_1_0_2))))
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(ti_0_1_0v_2_1_0) AND FIREABLE(to_0_1_0v_1_1_0)) OR NOT FIREABLE(ti_0_0_0v_0_0_2) OR FIREABLE(to_0_0_2v_1_0_2))))
lola: processed formula length: 135
lola: 5 rewrites
lola: closed formula file NeighborGrid-PT-d3n3m1t11-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: state equation: write sara problem file to NeighborGrid-PT-d3n3m1t11-ReachabilityFireability-3-0.sara
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((FIREABLE(ti_0_1_0v_2_1_0) OR NOT FIREABLE(to_0_1_0v_1_1_0)) AND FIREABLE(ti_0_0_0v_0_0_2) AND NOT FIREABLE(to_0_0_2v_1_0_2))
lola: state equation: State predicate is contradiction.
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================

FORMULA NeighborGrid-PT-d3n3m1t11-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(ti_0_0_2v_1_0_2) AND NOT FIREABLE(ti_2_1_0v_2_2_0) AND NOT FIREABLE(ti_1_1_0v_2_1_0) AND (NOT FIREABLE(to_2_1_1v_2_2_1) OR FIREABLE(to_1_0_0v_1_2_0)))))
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(ti_0_0_2v_1_0_2) AND NOT FIREABLE(ti_2_1_0v_2_2_0) AND NOT FIREABLE(ti_1_1_0v_2_1_0) AND (NOT FIREABLE(to_2_1_1v_2_2_1) OR FIREABLE(to_1_0_0v_1_2_0)))))
lola: processed formula length: 173
lola: 4 rewrites
lola: closed formula file NeighborGrid-PT-d3n3m1t11-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(ti_0_0_2v_1_0_2) AND NOT FIREABLE(ti_2_1_0v_2_2_0) AND NOT FIREABLE(ti_1_1_0v_2_1_0) AND (NOT FIREABLE(to_2_1_1v_2_2_1) OR FIREABLE(to_1_0_0v_1_2_0)))
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to NeighborGrid-PT-d3n3m1t11-ReachabilityFireability-6-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4 markings, 3 edges
lola: ========================================

FORMULA NeighborGrid-PT-d3n3m1t11-ReachabilityFireability-2 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: lola: ...considering subproblem: E (F ((FIREABLE(ti_1_1_1v_1_2_1) AND FIREABLE(ti_1_2_2v_2_2_2) AND NOT FIREABLE(ti_0_1_1v_2_1_1) AND NOT FIREABLE(to_1_2_0v_2_2_0) AND FIREABLE(to_2_1_1v_2_1_2))))
========================================
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(ti_1_1_1v_1_2_1) AND FIREABLE(ti_1_2_2v_2_2_2) AND NOT FIREABLE(ti_0_1_1v_2_1_1) AND NOT FIREABLE(to_1_2_0v_2_2_0) AND FIREABLE(to_2_1_1v_2_1_2))))
lola: processed formula length: 163
lola: 4 rewrites
lola: closed formula file NeighborGrid-PT-d3n3m1t11-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(ti_1_1_1v_1_2_1) AND FIREABLE(ti_1_2_2v_2_2_2) AND NOT FIREABLE(ti_0_1_1v_2_1_1) AND NOT FIREABLE(to_1_2_0v_2_2_0) AND FIREABLE(to_2_1_1v_2_1_2))
lola: state equation: State predicate is contradiction.
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================

FORMULA NeighborGrid-PT-d3n3m1t11-ReachabilityFireability-11 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(ti_0_0_2v_0_1_2) AND FIREABLE(ti_1_1_0v_2_1_0) AND NOT FIREABLE(ti_0_1_1v_0_2_1) AND NOT FIREABLE(to_0_1_1v_2_1_1) AND FIREABLE(ti_0_1_1v_0_1_2))))
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(ti_0_0_2v_0_1_2) AND FIREABLE(ti_1_1_0v_2_1_0) AND NOT FIREABLE(ti_0_1_1v_0_2_1) AND NOT FIREABLE(to_0_1_1v_2_1_1) AND FIREABLE(ti_0_1_1v_0_1_2))))
lola: processed formula length: 167
lola: 4 rewrites
lola: closed formula file NeighborGrid-PT-d3n3m1t11-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(ti_0_0_2v_0_1_2) AND FIREABLE(ti_1_1_0v_2_1_0) AND NOT FIREABLE(ti_0_1_1v_0_2_1) AND NOT FIREABLE(to_0_1_1v_2_1_1) AND FIREABLE(ti_0_1_1v_0_1_2))
lola: state equation: State predicate is contradiction.
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.

FORMULA NeighborGrid-PT-d3n3m1t11-ReachabilityFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(to_0_2_2v_1_2_2) OR (FIREABLE(to_2_0_0v_2_0_2) AND FIREABLE(ti_0_0_0v_0_2_0) AND FIREABLE(to_2_0_0v_2_1_0)) OR FIREABLE(to_1_2_0v_1_2_2))))
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(to_0_2_2v_1_2_2) OR (FIREABLE(to_2_0_0v_2_0_2) AND FIREABLE(ti_0_0_0v_0_2_0) AND FIREABLE(to_2_0_0v_2_1_0)) OR FIREABLE(to_1_2_0v_1_2_2))))
lola: processed formula length: 157
lola: 5 rewrites
lola: closed formula file NeighborGrid-PT-d3n3m1t11-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(to_0_2_2v_1_2_2) AND (NOT FIREABLE(to_2_0_0v_2_0_2) OR NOT FIREABLE(ti_0_0_0v_0_2_0) OR NOT FIREABLE(to_2_0_0v_2_1_0)) AND NOT FIREABLE(to_1_2_0v_1_2_2))
lola: state equation: Generated DNF with 9 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to NeighborGrid-PT-d3n3m1t11-ReachabilityFireability-9-0.sara
lola: ========================================
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 4 markings, 3 edges
lola: ========================================

FORMULA NeighborGrid-PT-d3n3m1t11-ReachabilityFireability-1 FALSE 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(to_0_0_2v_2_0_2) AND FIREABLE(to_0_0_0v_0_1_0) AND FIREABLE(ti_1_0_0v_1_1_0)) OR FIREABLE(ti_1_0_2v_1_2_2) OR FIREABLE(to_1_0_0v_1_2_0))))
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(to_0_0_2v_2_0_2) AND FIREABLE(to_0_0_0v_0_1_0) AND FIREABLE(ti_1_0_0v_1_1_0)) OR FIREABLE(ti_1_0_2v_1_2_2) OR FIREABLE(to_1_0_0v_1_2_0))))
lola: processed formula length: 157
lola: 5 rewrites
lola: closed formula file NeighborGrid-PT-d3n3m1t11-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: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 4 markings, 3 edges
lola: ========================================

FORMULA NeighborGrid-PT-d3n3m1t11-ReachabilityFireability-15 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: A (G ((FIREABLE(ti_2_0_0v_2_0_2) OR FIREABLE(ti_0_1_2v_2_1_2) OR (FIREABLE(ti_0_0_0v_0_0_2) AND FIREABLE(to_1_1_1v_1_2_1)) OR FIREABLE(to_1_2_1v_1_2_2) OR FIREABLE(to_1_2_0v_2_2_0))))
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(ti_2_0_0v_2_0_2) OR FIREABLE(ti_0_1_2v_2_1_2) OR (FIREABLE(ti_0_0_0v_0_0_2) AND FIREABLE(to_1_1_1v_1_2_1)) OR FIREABLE(to_1_2_1v_1_2_2) OR FIREABLE(to_1_2_0v_2_2_0))))
lola: processed formula length: 187
lola: 5 rewrites
lola: closed formula file NeighborGrid-PT-d3n3m1t11-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(ti_2_0_0v_2_0_2) AND NOT FIREABLE(ti_0_1_2v_2_1_2) AND (NOT FIREABLE(ti_0_0_0v_0_0_2) OR NOT FIREABLE(to_1_1_1v_1_2_1)) AND NOT FIREABLE(to_1_2_1v_1_2_2) AND NOT FIREABLE(to_1_2_0v_2_2_0))
lola: state equation: Generated DNF with 10 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to NeighborGrid-PT-d3n3m1t11-ReachabilityFireability-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file NeighborGrid-PT-d3n3m1t11-ReachabilityFireability-11-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 8 markings, 7 edges
lola: ========================================

FORMULA NeighborGrid-PT-d3n3m1t11-ReachabilityFireability-10 FALSE 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: A (G (((FIREABLE(ti_0_1_1v_0_2_1) AND FIREABLE(ti_2_2_0v_2_2_2)) OR NOT FIREABLE(ti_2_1_1v_2_2_1) OR (FIREABLE(to_0_1_1v_0_1_2) AND FIREABLE(to_0_0_1v_1_0_1)) OR NOT FIREABLE(ti_2_1_0v_2_2_0))))
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(ti_0_1_1v_0_2_1) AND FIREABLE(ti_2_2_0v_2_2_2)) OR NOT FIREABLE(ti_2_1_1v_2_2_1) OR (FIREABLE(to_0_1_1v_0_1_2) AND FIREABLE(to_0_0_1v_1_0_1)) OR NOT FIREABLE(ti_2_1_0v_2_2_0))))
lola: processed formula length: 197
lola: 5 rewrites
lola: closed formula file NeighborGrid-PT-d3n3m1t11-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: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 3 markings, 2 edges
lola: ========================================

FORMULA NeighborGrid-PT-d3n3m1t11-ReachabilityFireability-13 FALSE 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(ti_1_1_1v_2_1_1) OR FIREABLE(ti_1_2_0v_2_2_0) OR FIREABLE(ti_2_0_1v_2_2_1) OR FIREABLE(to_0_2_1v_2_2_1) OR (FIREABLE(to_2_0_2v_2_2_2) AND (NOT FIREABLE(ti_2_2_1v_2_2_2) OR NOT FIREABLE(ti_2_1_1v_2_2_1))))))
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(ti_1_1_1v_2_1_1) OR FIREABLE(ti_1_2_0v_2_2_0) OR FIREABLE(ti_2_0_1v_2_2_1) OR FIREABLE(to_0_2_1v_2_2_1) OR (FIREABLE(to_2_0_2v_2_2_2) AND (NOT FIREABLE(ti_2_2_1v_2_2_2) OR NOT FIREABLE(ti_2_1_1v_2_2_1))))))
lola: processed formula length: 227
lola: 5 rewrites
lola: closed formula file NeighborGrid-PT-d3n3m1t11-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(ti_1_1_1v_2_1_1) AND NOT FIREABLE(ti_1_2_0v_2_2_0) AND NOT FIREABLE(ti_2_0_1v_2_2_1) AND NOT FIREABLE(to_0_2_1v_2_2_1) AND (NOT FIREABLE(to_2_0_2v_2_2_2) OR (FIREABLE(ti_2_2_1v_2_2_2) AND FIREABLE(ti_2_1_1v_2_2_1))))
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to NeighborGrid-PT-d3n3m1t11-ReachabilityFireability-13-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 15 markings, 20 edges
lola: ========================================
lola: state equation: calling and running sara

FORMULA NeighborGrid-PT-d3n3m1t11-ReachabilityFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1785 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((FIREABLE(ti_0_2_0v_0_2_1) OR FIREABLE(ti_1_0_1v_1_1_1)) AND FIREABLE(ti_1_0_0v_1_0_2)) OR (NOT FIREABLE(ti_1_2_1v_1_2_2) AND NOT FIREABLE(to_0_0_0v_0_0_1)) OR FIREABLE(to_2_1_1v_2_2_1) OR FIREABLE(ti_0_1_1v_1_1_1) OR FIREABLE(ti_0_1_1v_2_1_1) OR FIREABLE(ti_1_0_1v_1_0_2))))
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(ti_0_2_0v_0_2_1) OR FIREABLE(ti_1_0_1v_1_1_1)) AND FIREABLE(ti_1_0_0v_1_0_2)) OR (NOT FIREABLE(ti_1_2_1v_1_2_2) AND NOT FIREABLE(to_0_0_0v_0_0_1)) OR FIREABLE(to_2_1_1v_2_2_1) OR FIREABLE(ti_0_1_1v_1_1_1) OR FIREABLE(ti_0_1_1v_2_1_1) OR FIREABLE(ti_1_0_1v_1_0_2))))
lola: processed formula length: 289
lola: 5 rewrites
lola: closed formula file NeighborGrid-PT-d3n3m1t11-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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: sara: try reading problem file NeighborGrid-PT-d3n3m1t11-ReachabilityFireability-13-0.sara.
5 markings, 4 edges
sara: place or transition ordering is non-deterministic
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (((NOT FIREABLE(ti_0_2_0v_0_2_1) AND NOT FIREABLE(ti_1_0_1v_1_1_1)) OR NOT FIREABLE(ti_1_0_0v_1_0_2)) AND (FIREABLE(ti_1_2_1v_1_2_2) OR FIREABLE(to_0_0_0v_0_0_1)) AND NOT FIREABLE(to_2_1_1v_2_2_1) AND NOT FIREABLE(ti_0_1_1v_1_1_1) AND NOT FIREABLE(ti_0_1_1v_2_1_1) AND NOT FIREABLE(ti_1_0_1v_1_0_2))
lola: state equation: Generated DNF with 26 literals and 4 conjunctive subformulas
lola:
FORMULA NeighborGrid-PT-d3n3m1t11-ReachabilityFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
state equation: write sara problem file to NeighborGrid-PT-d3n3m1t11-ReachabilityFireability-14-0.sara
lola: ========================================
lola: subprocess 15 will run for 3570 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(ti_1_2_0v_2_2_0) AND NOT FIREABLE(ti_0_0_0v_0_0_1) AND (FIREABLE(to_2_2_1v_2_2_2) OR FIREABLE(ti_1_0_2v_1_1_2)) AND (FIREABLE(ti_2_0_1v_2_0_2) OR FIREABLE(ti_0_0_2v_0_2_2)) AND (NOT FIREABLE(ti_2_1_2v_2_2_2) OR NOT FIREABLE(to_0_2_0v_2_2_0)) AND (NOT FIREABLE(ti_2_0_0v_2_0_1) OR NOT FIREABLE(ti_0_0_1v_2_0_1)))))
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(ti_1_2_0v_2_2_0) AND NOT FIREABLE(ti_0_0_0v_0_0_1) AND (FIREABLE(to_2_2_1v_2_2_2) OR FIREABLE(ti_1_0_2v_1_1_2)) AND (FIREABLE(ti_2_0_1v_2_0_2) OR FIREABLE(ti_0_0_2v_0_2_2)) AND (NOT FIREABLE(ti_2_1_2v_2_2_2) OR NOT FIREABLE(to_0_2_0v_2_2_0)) AND (NOT FIREABLE(ti_2_0_0v_2_0_1) OR NOT FIREABLE(ti_0_0_1v_2_0_1)))))
lola: processed formula length: 333
lola: 4 rewrites
lola: closed formula file NeighborGrid-PT-d3n3m1t11-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(ti_1_2_0v_2_2_0) AND NOT FIREABLE(ti_0_0_0v_0_0_1) AND (FIREABLE(to_2_2_1v_2_2_2) OR FIREABLE(ti_1_0_2v_1_1_2)) AND (FIREABLE(ti_2_0_1v_2_0_2) OR FIREABLE(ti_0_0_2v_0_2_2)) AND (NOT FIREABLE(ti_2_1_2v_2_2_2) OR NOT FIREABLE(to_0_2_0v_2_2_0)) AND (NOT FIREABLE(ti_2_0_0v_2_0_1) OR NOT FIREABLE(ti_0_0_1v_2_0_1)))
lola: state equation: Generated DNF with 96 literals and 16 conjunctive subformulas
lola: state equation: write sara problem file to NeighborGrid-PT-d3n3m1t11-ReachabilityFireability-15-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4 markings, 3 edges

FORMULA NeighborGrid-PT-d3n3m1t11-ReachabilityFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no yes yes yes no no yes no no no no no no yes no
lola: ========================================
lola:
preliminary result: no no yes yes yes no no yes no no no no no no yes no
lola: state equation: calling and running sara
sara: try reading problem file NeighborGrid-PT-d3n3m1t11-ReachabilityFireability-15-0.sara.
sara: place or transition ordering is non-deterministic

lola: memory consumption: 14564 KB
lola: time consumption: 0 seconds


BK_TIME_CONFINEMENT_REACHED

--------------------
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="NeighborGrid-PT-d3n3m1t11"
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/NeighborGrid-PT-d3n3m1t11.tgz
mv NeighborGrid-PT-d3n3m1t11 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 NeighborGrid-PT-d3n3m1t11, 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 r112-csrt-152666469200224"
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 ;