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 252K
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K 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.0K 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.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 10K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.6K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 24K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 106 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 344 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 78K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is Railroad-PT-010, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-qhx2-152673578900182
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526962156598

info: Time: 3600 - MCC
===========================================================================================
prep: translating Railroad-PT-010 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating Railroad-PT-010 formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ Railroad-PT-010 @ 3559 seconds
lola: LoLA will run for 3559 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 274/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 3776
lola: finding significant places
lola: 118 places, 156 transitions, 47 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 72 transition conflict sets
lola: TASK
lola: reading formula from Railroad-PT-010-ReachabilityFireability.task
lola: E (F (FIREABLE(tr_T33_48))) : E (F (FIREABLE(tr_T33_79))) : E (F ((FIREABLE(tr_T34_1) AND ((FIREABLE(tr_T33_73) AND FIREABLE(tr_T33_93)) OR (NOT FIREABLE(tr_T33_72) AND FIREABLE(tr_T21_1)))))) : E (F (FIREABLE(tr_T33_100))) : A (G ((NOT FIREABLE(tr_T33_85) OR (NOT FIREABLE(tr_T33_81) AND NOT FIREABLE(tr_T9_1) AND (NOT FIREABLE(tr_T37_4) OR NOT FIREABLE(tr_T14_13)))))) : E (F (((FIREABLE(tr_T33_46) AND FIREABLE(tr_T19_1)) OR (FIREABLE(tr_T33_83) AND FIREABLE(tr_T37_3))))) : A (G (((NOT FIREABLE(tr_T14_18) OR NOT FIREABLE(tr_T33_76) OR NOT FIREABLE(tr_T33_45)) AND NOT FIREABLE(tr_T33_89)))) : E (F (FIREABLE(tr_T33_63))) : E (F (((FIREABLE(tr_T33_112) AND FIREABLE(tr_T33_44)) OR (FIREABLE(tr_T13_1) AND FIREABLE(tr_T14_22))))) : E (F ((FIREABLE(tr_T36_1) AND FIREABLE(tr_T33_119) AND NOT FIREABLE(tr_T33_102) AND FIREABLE(tr_T37_7)))) : E (F (FIREABLE(tr_T33_47))) : E (F (((FIREABLE(tr_T33_88) AND FIREABLE(tr_T33_37) AND (FIREABLE(tr_T33_104) OR FIREABLE(tr_T33_59)) AND FIREABLE(tr_T37_10)) OR ((FIREABLE(tr_T37_2) OR NOT FIREABLE(tr_T24_1)) AND ((FIREABLE(tr_T37_8) AND FIREABLE(tr_T33_116)) OR (FIREABLE(tr_T14_16) AND FIREABLE(tr_T7_1))))))) : A (G ((NOT FIREABLE(tr_T33_41) OR (NOT FIREABLE(tr_T33_62) AND NOT FIREABLE(tr_T27_1))))) : E (F (FIREABLE(tr_T33_68))) : A (G ((FIREABLE(tr_T20_1) OR FIREABLE(tr_T33_33) OR NOT FIREABLE(tr_T33_81)))) : E (F (FIREABLE(tr_T33_75)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(tr_T33_48)))
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(tr_T33_48)))
lola: processed formula length: 27
lola: 1 rewrites
lola: closed formula file Railroad-PT-010-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(tr_T33_48)
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-010-ReachabilityFireability-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.lola:
state equation: calling and running sara
lola: 19 markings, 18 edges
lola: ========================================

FORMULA Railroad-PT-010-ReachabilityFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(tr_T33_79)))
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(tr_T33_79)))
lola: processed formula length: 27
lola: 1 rewrites
lola: closed formula file Railroad-PT-010-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(tr_T33_79)
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-010-ReachabilityFireability-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: 20 markings, 19 edges
lola: ========================================

FORMULA Railroad-PT-010-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(tr_T33_100)))
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(tr_T33_100)))
lola: processed formula length: 28
lola: 1 rewrites
lola: closed formula file Railroad-PT-010-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: sara: try reading problem file Railroad-PT-010-ReachabilityFireability-0.sara.
rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: FIREABLE(tr_T33_100)
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 24 markings, 23 edges
sara: place or transition ordering is non-deterministic


FORMULA Railroad-PT-010-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: write sara problem file to Railroad-PT-010-ReachabilityFireability-2-0.sara
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 3 will run for 273 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(tr_T33_63)))
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(tr_T33_63)))
lola: processed formula length: 27
lola: 1 rewrites
lola: closed formula file Railroad-PT-010-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(tr_T33_63)
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-010-ReachabilityFireability-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-010-ReachabilityFireability-2-0.sara.
sara: try reading problem file Railroad-PT-010-ReachabilityFireability-3-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 21 markings, 20 edges
lola: ========================================

FORMULA Railroad-PT-010-ReachabilityFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(tr_T33_47)))
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(tr_T33_47)))
lola: processed formula length: 27
lola: 1 rewrites
lola: closed formula file Railroad-PT-010-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(tr_T33_47)
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: The predicate is reachable.
lola: 14 markings, 13 edges
lola:
FORMULA Railroad-PT-010-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
state equation: write sara problem file to Railroad-PT-010-ReachabilityFireability-4-0.sara
lola: ========================================
lola: subprocess 5 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(tr_T33_68)))
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(tr_T33_68)))
lola: processed formula length: 27
lola: 1 rewrites
lola: closed formula file Railroad-PT-010-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(tr_T33_68)
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 23 markings, 22 edges
lola: state equation: write sara problem file to Railroad-PT-010-ReachabilityFireability-5-0.sara

FORMULA Railroad-PT-010-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
sara: place or transition ordering is non-deterministic
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 6 will run for 355 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(tr_T33_75)))
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(tr_T33_75)))
lola: processed formula length: 27
lola: 1 rewrites
lola: closed formula file Railroad-PT-010-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(tr_T33_75)
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 18 markings, 17 edges
sara: try reading problem file Railroad-PT-010-ReachabilityFireability-5-0.sara.
lola: ========================================

FORMULA Railroad-PT-010-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(tr_T20_1) OR FIREABLE(tr_T33_33) OR NOT FIREABLE(tr_T33_81))))
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(tr_T20_1) OR FIREABLE(tr_T33_33) OR NOT FIREABLE(tr_T33_81))))
lola: processed formula length: 80
lola: 2 rewrites
lola: closed formula file Railroad-PT-010-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(tr_T20_1) AND NOT FIREABLE(tr_T33_33) AND FIREABLE(tr_T33_81))
lola: state equation: Generated DNF with 20 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 25 markings, 24 edges
lola: state equation: write sara problem file to Railroad-PT-010-ReachabilityFireability-7-0.sara
lola: ========================================

FORMULA Railroad-PT-010-ReachabilityFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: calling and running sara
lola: subprocess 8 will run for 444 seconds at most (--localtimelimit=0)
lola: ========================================
lola: sara: ...considering subproblem: A (G ((NOT FIREABLE(tr_T33_41) OR (NOT FIREABLE(tr_T33_62) AND NOT FIREABLE(tr_T27_1)))))
lola: ========================================
lola: SUBTASK
place or transition ordering is non-deterministic
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(tr_T33_41) OR (NOT FIREABLE(tr_T33_62) AND NOT FIREABLE(tr_T27_1)))))
lola: processed formula length: 90
lola: 2 rewrites
lola: closed formula file Railroad-PT-010-ReachabilityFireability.task
sara: try reading problem file Railroad-PT-010-ReachabilityFireability-7-0.sara.
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(tr_T33_41) AND (FIREABLE(tr_T33_62) OR FIREABLE(tr_T27_1)))
lola: state equation: Generated DNF with 12 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 17 markings, 16 edges

lola: state equation: write sara problem file to Railroad-PT-010-ReachabilityFireability-8-0.sara
lola: ========================================

FORMULA Railroad-PT-010-ReachabilityFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 508 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(tr_T33_46) AND FIREABLE(tr_T19_1)) OR (FIREABLE(tr_T33_83) AND FIREABLE(tr_T37_3)))))
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(tr_T33_46) AND FIREABLE(tr_T19_1)) OR (FIREABLE(tr_T33_83) AND FIREABLE(tr_T37_3)))))
lola: processed formula length: 103
lola: 1 rewrites
lola: closed formula file Railroad-PT-010-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(tr_T33_46) AND FIREABLE(tr_T19_1)) OR (FIREABLE(tr_T33_83) AND FIREABLE(tr_T37_3)))
lola: state equation: Generated DNF with 12 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-010-ReachabilityFireability-9-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 19 markings, 18 edges
lola: ========================================

FORMULA Railroad-PT-010-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
sara: place or transition ordering is non-deterministic
lola: subprocess 10 will run for 593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(tr_T33_112) AND FIREABLE(tr_T33_44)) OR (FIREABLE(tr_T13_1) AND FIREABLE(tr_T14_22)))))
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(tr_T33_112) AND FIREABLE(tr_T33_44)) OR (FIREABLE(tr_T13_1) AND FIREABLE(tr_T14_22)))))
lola: processed formula length: 105
lola: 1 rewrites
lola: closed formula file Railroad-PT-010-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(tr_T33_112) AND FIREABLE(tr_T33_44)) OR (FIREABLE(tr_T13_1) AND FIREABLE(tr_T14_22)))
lola: state equation: Generated DNF with 12 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-010-ReachabilityFireability-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-010-ReachabilityFireability-10-0.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: ========================================

FORMULA Railroad-PT-010-ReachabilityFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 711 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(tr_T36_1) AND FIREABLE(tr_T33_119) AND NOT FIREABLE(tr_T33_102) AND FIREABLE(tr_T37_7))))
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(tr_T36_1) AND FIREABLE(tr_T33_119) AND NOT FIREABLE(tr_T33_102) AND FIREABLE(tr_T37_7))))
lola: processed formula length: 105
lola: 1 rewrites
lola: closed formula file Railroad-PT-010-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(tr_T36_1) AND FIREABLE(tr_T33_119) AND NOT FIREABLE(tr_T33_102) AND FIREABLE(tr_T37_7))
lola: state equation: Generated DNF with 18 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-010-ReachabilityFireability-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-010-ReachabilityFireability-11-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 476482 markings, 1367848 edges, 95296 markings/sec, 0 secs
lola: sara is running 5 secs || 890780 markings, 2792844 edges, 82860 markings/sec, 5 secs
lola: sara is running 10 secs || 1242183 markings, 4203909 edges, 70281 markings/sec, 10 secs
lola: sara is running 15 secs || 1565489 markings, 5718053 edges, 64661 markings/sec, 15 secs
lola: sara is running 20 secs || 1862195 markings, 7305021 edges, 59341 markings/sec, 20 secs
lola: sara is running 25 secs || 2020764 markings, 9378651 edges, 31714 markings/sec, 25 secs
lola: sara is running 30 secs || 2032061 markings, 11777688 edges, 2259 markings/sec, 30 secs
lola: sara is running 35 secs || 2036624 markings, 14407203 edges, 913 markings/sec, 35 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 2038164 markings, 16269821 edges

FORMULA Railroad-PT-010-ReachabilityFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 878 seconds at most (--localtimelimit=0)
lola: ========================================lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(tr_T14_18) OR NOT FIREABLE(tr_T33_76) OR NOT FIREABLE(tr_T33_45)) AND NOT FIREABLE(tr_T33_89))))
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(tr_T14_18) OR NOT FIREABLE(tr_T33_76) OR NOT FIREABLE(tr_T33_45)) AND NOT FIREABLE(tr_T33_89))))
lola: processed formula length: 119
lola: 2 rewrites
lola: closed formula file Railroad-PT-010-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(tr_T14_18) AND FIREABLE(tr_T33_76) AND FIREABLE(tr_T33_45)) OR FIREABLE(tr_T33_89))
lola: state equation: Generated DNF with 12 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-010-ReachabilityFireability-12-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 185 markings, 238 edges

FORMULA Railroad-PT-010-ReachabilityFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1171 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(tr_T34_1) AND ((FIREABLE(tr_T33_73) AND FIREABLE(tr_T33_93)) OR (NOT FIREABLE(tr_T33_72) AND FIREABLE(tr_T21_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(tr_T34_1) AND ((FIREABLE(tr_T33_73) AND FIREABLE(tr_T33_93)) OR (NOT FIREABLE(tr_T33_72) AND FIREABLE(tr_T21_1))))))
lola: processed formula length: 133
lola: 1 rewrites
lola: closed formula file Railroad-PT-010-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(tr_T34_1) AND ((FIREABLE(tr_T33_73) AND FIREABLE(tr_T33_93)) OR (NOT FIREABLE(tr_T33_72) AND FIREABLE(tr_T21_1))))
lola: state equation: Generated DNF with 23 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-010-ReachabilityFireability-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-010-ReachabilityFireability-13-0.sara.
sara: place or transition ordering is non-deterministic
lola: ========================================

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================

FORMULA Railroad-PT-010-ReachabilityFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1757 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(tr_T33_85) OR (NOT FIREABLE(tr_T33_81) AND NOT FIREABLE(tr_T9_1) AND (NOT FIREABLE(tr_T37_4) OR NOT FIREABLE(tr_T14_13))))))
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(tr_T33_85) OR (NOT FIREABLE(tr_T33_81) AND NOT FIREABLE(tr_T9_1) AND (NOT FIREABLE(tr_T37_4) OR NOT FIREABLE(tr_T14_13))))))
lola: processed formula length: 146
lola: 2 rewrites
lola: closed formula file Railroad-PT-010-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(tr_T33_85) AND (FIREABLE(tr_T33_81) OR FIREABLE(tr_T9_1) OR (FIREABLE(tr_T37_4) AND FIREABLE(tr_T14_13))))
lola: state equation: Generated DNF with 21 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-010-ReachabilityFireability-14-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 20 markings, 19 edges
lola: ========================================

FORMULA Railroad-PT-010-ReachabilityFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3515 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(tr_T33_88) AND FIREABLE(tr_T33_37) AND (FIREABLE(tr_T33_104) OR FIREABLE(tr_T33_59)) AND FIREABLE(tr_T37_10)) OR ((FIREABLE(tr_T37_2) OR NOT FIREABLE(tr_T24_1)) AND ((FIREABLE(tr_T37_8) AND FIREABLE(tr_T33_116)) OR (FIREABLE(tr_T14_16) AND FIREABLE(tr_T7_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(tr_T33_88) AND FIREABLE(tr_T33_37) AND (FIREABLE(tr_T33_104) OR FIREABLE(tr_T33_59)) AND FIREABLE(tr_T37_10)) OR ((FIREABLE(tr_T37_2) OR NOT FIREABLE(tr_T24_1)) AND ((FIREABLE(tr_T37_8) AND FIREABLE(tr_T33_116)) OR (FIREABLE(tr_T14_16) AND FIREABLE(tr_T7_1)))))))
lola: processed formula length: 284
lola: 1 rewrites
lola: closed formula file Railroad-PT-010-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(tr_T33_88) AND FIREABLE(tr_T33_37) AND (FIREABLE(tr_T33_104) OR FIREABLE(tr_T33_59)) AND FIREABLE(tr_T37_10)) OR ((FIREABLE(tr_T37_2) OR NOT FIREABLE(tr_T24_1)) AND ((FIREABLE(tr_T37_8) AND FIREABLE(tr_T33_116)) OR (FIREABLE(tr_T14_16) AND FIREABLE(tr_T7_1)))))
lola: state equation: Generated DNF with 74 literals and 9 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-010-ReachabilityFireability-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-010-ReachabilityFireability-15-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 469385 markings, 1247166 edges, 93877 markings/sec, 0 secs
lola: sara is running 5 secs || 899144 markings, 2536351 edges, 85952 markings/sec, 5 secs
lola: sara is running 10 secs || 1290322 markings, 3827955 edges, 78236 markings/sec, 10 secs
lola: sara is running 15 secs || 1633487 markings, 5202737 edges, 68633 markings/sec, 15 secs
lola: sara is running 20 secs || 1924690 markings, 6783065 edges, 58241 markings/sec, 20 secs
lola: sara is running 25 secs || 2032928 markings, 9025337 edges, 21648 markings/sec, 25 secs
lola: sara is running 30 secs || 2035455 markings, 11582699 edges, 505 markings/sec, 30 secs
lola: sara is running 35 secs || 2037194 markings, 14270542 edges, 348 markings/sec, 35 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 2038166 markings, 16324600 edges
lola: ========================================

FORMULA Railroad-PT-010-ReachabilityFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes yes no yes no yes no yes no no yes no no yes no yes
lola:
preliminary result: yes yes no yes no yes no yes no no yes no no yes no yes
lola: memory consumption: 14852 KB
lola: time consumption: 88 seconds

BK_STOP 1526962277343

--------------------
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="Railroad-PT-010"
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/Railroad-PT-010.tgz
mv Railroad-PT-010 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 Railroad-PT-010, 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 r136-qhx2-152673578900182"
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 ;