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 204K
-rw-r--r-- 1 mcc users 4.6K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K 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.7K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.9K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K 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 3.0K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K 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 30K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is Railroad-PT-005, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-qhx2-152673578900175
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526961417963

info: Time: 3600 - MCC
===========================================================================================
prep: translating Railroad-PT-005 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating Railroad-PT-005 formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ Railroad-PT-005 @ 3569 seconds
lola: LoLA will run for 3569 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 124/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 2176
lola: finding significant places
lola: 68 places, 56 transitions, 27 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 42 transition conflict sets
lola: TASK
lola: reading formula from Railroad-PT-005-ReachabilityFireability.task
lola: E (F (((FIREABLE(tr_T23_32) AND FIREABLE(tr_T23_28) AND FIREABLE(tr_T24_3) AND FIREABLE(tr_T23_25)) OR FIREABLE(tr_T24_2) OR NOT FIREABLE(tr_T23_18)))) : A (G ((FIREABLE(tr_T24_3) AND NOT FIREABLE(tr_T23_20)))) : E (F ((FIREABLE(tr_T7_1) OR FIREABLE(tr_T23_34) OR FIREABLE(tr_T23_15)))) : A (G ((NOT FIREABLE(tr_T23_34) AND NOT FIREABLE(tr_T23_31) AND FIREABLE(tr_T9_12) AND FIREABLE(tr_T11_1)))) : A (G (FIREABLE(tr_T23_29))) : A (G ((FIREABLE(tr_T0_1) AND FIREABLE(tr_T5_1) AND (NOT FIREABLE(tr_T5_1) OR NOT FIREABLE(tr_T9_11))))) : A (G ((NOT FIREABLE(tr_T23_16) AND NOT FIREABLE(tr_T7_1) AND ((NOT FIREABLE(tr_T24_4) AND NOT FIREABLE(tr_T23_25)) OR NOT FIREABLE(tr_T9_7))))) : A (G (FIREABLE(tr_T23_31))) : A (G ((FIREABLE(tr_T9_7) OR NOT FIREABLE(tr_T4_1)))) : A (G (((NOT FIREABLE(tr_T23_35) AND NOT FIREABLE(tr_T23_28)) OR (FIREABLE(tr_T4_1) AND FIREABLE(tr_T7_1) AND FIREABLE(tr_T22_1) AND FIREABLE(tr_T23_21)) OR FIREABLE(tr_T3_1) OR FIREABLE(tr_T23_20) OR NOT FIREABLE(tr_T22_1) OR ((FIREABLE(tr_T23_13) OR FIREABLE(tr_T6_1)) AND NOT FIREABLE(tr_T23_24))))) : A (G ((NOT FIREABLE(tr_T9_11) AND (NOT FIREABLE(tr_T24_3) OR NOT FIREABLE(tr_T23_31)) AND ((FIREABLE(tr_T2_1) AND FIREABLE(tr_T19_1) AND (FIREABLE(tr_T23_13) OR FIREABLE(tr_T9_8))) OR (FIREABLE(tr_T23_32) AND FIREABLE(tr_T6_1) AND NOT FIREABLE(tr_T11_1)))))) : A (G ((NOT FIREABLE(tr_T23_15) OR NOT FIREABLE(tr_T8_1) OR NOT FIREABLE(tr_T1_1) OR NOT FIREABLE(tr_T10_1) OR FIREABLE(tr_T18_1) OR FIREABLE(tr_T24_4)))) : A (G ((FIREABLE(tr_T24_4) OR FIREABLE(tr_T23_33) OR NOT FIREABLE(tr_T24_5) OR (FIREABLE(tr_T12_1) AND FIREABLE(tr_T17_1)) OR (FIREABLE(tr_T9_9) AND FIREABLE(tr_T24_3)) OR (FIREABLE(tr_T9_7) AND FIREABLE(tr_T0_1)) OR NOT FIREABLE(tr_T23_24)))) : E (F (((NOT FIREABLE(tr_T23_31) AND NOT FIREABLE(tr_T6_1)) OR FIREABLE(tr_T24_4) OR (FIREABLE(tr_T23_35) AND FIREABLE(tr_T23_36))))) : A (G ((FIREABLE(tr_T23_16) OR FIREABLE(tr_T24_2)))) : E (F (FIREABLE(tr_T15_1)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(tr_T23_29)))
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_T23_29)))
lola: processed formula length: 27
lola: 2 rewrites
lola: closed formula file Railroad-PT-005-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_T23_29)
lola: state equation: Generated DNF with 3 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to Railroad-PT-005-ReachabilityFireability-0.sara

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

FORMULA Railroad-PT-005-ReachabilityFireability-7 FALSE 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_T15_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_T15_1)))
lola: processed formula length: 26
lola: 1 rewrites
lola: closed formula file Railroad-PT-005-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_T15_1)
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: write sara problem file to Railroad-PT-005-ReachabilityFireability-2-0.sara
lola: The predicate is reachable.
lola: 2 markings, 1 edges
lola: ========================================

FORMULA Railroad-PT-005-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: calling and running sara
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(tr_T9_7) OR NOT FIREABLE(tr_T4_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(tr_T9_7) OR NOT FIREABLE(tr_T4_1))))
lola: processed formula length: 53
lola: 2 rewrites
lola: closed formula file Railroad-PT-005-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)
sara: try reading problem file Railroad-PT-005-ReachabilityFireability-2-0.sara.
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (NOT FIREABLE(tr_T9_7) AND FIREABLE(tr_T4_1))
lola: state equation: Generated DNF with 12 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-005-ReachabilityFireability-3-0.sara
sara: place or transition ordering is non-deterministic

lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: lola: state equation: calling and running sara
9 markings, 8 edges
lola: ========================================

FORMULA Railroad-PT-005-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(tr_T23_16) OR FIREABLE(tr_T24_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(tr_T23_16) OR FIREABLE(tr_T24_2))))
lola: processed formula length: 52
lola: 2 rewrites
lola: closed formula file Railroad-PT-005-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_T23_16) AND NOT FIREABLE(tr_T24_2))
lola: state equation: Generated DNF with 18 literals and 9 conjunctive subformulas
sara: try reading problem file Railroad-PT-005-ReachabilityFireability-3-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to Railroad-PT-005-ReachabilityFireability-4-0.sara
sara: place or transition ordering is non-deterministic

lola: state equation: calling and running sara
lola: ========================================

FORMULA Railroad-PT-005-ReachabilityFireability-14 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 ((FIREABLE(tr_T24_3) AND NOT FIREABLE(tr_T23_20))))
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_T24_3) AND NOT FIREABLE(tr_T23_20))))
lola: processed formula length: 56
lola: 2 rewrites
lola: closed formula file Railroad-PT-005-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_T24_3) OR FIREABLE(tr_T23_20))
lola: state equation: Generated DNF with 6 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-005-ReachabilityFireability-5-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA Railroad-PT-005-ReachabilityFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(tr_T7_1) OR FIREABLE(tr_T23_34) OR FIREABLE(tr_T23_15))))
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_T7_1) OR FIREABLE(tr_T23_34) OR FIREABLE(tr_T23_15))))
lola: processed formula length: 75
lola: 1 rewrites
lola: closed formula file Railroad-PT-005-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_T7_1) OR FIREABLE(tr_T23_34) OR FIREABLE(tr_T23_15))
lola: state equation: Generated DNF with 8 literals and 3 conjunctive subformulas
sara: try reading problem file Railroad-PT-005-ReachabilityFireability-4-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 7 markings, 6 edges
sara: place or transition ordering is non-deterministic
lola: state equation: write sara problem file to Railroad-PT-005-ReachabilityFireability-6-0.sara


FORMULA Railroad-PT-005-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: calling and running sara
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(tr_T0_1) AND FIREABLE(tr_T5_1) AND (NOT FIREABLE(tr_T5_1) OR NOT FIREABLE(tr_T9_11)))))
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_T0_1) AND FIREABLE(tr_T5_1) AND (NOT FIREABLE(tr_T5_1) OR NOT FIREABLE(tr_T9_11)))))
lola: processed formula length: 104
lola: 2 rewrites
lola: closed formula file Railroad-PT-005-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 0 markings, 0 edges
lola: ========================================

FORMULA Railroad-PT-005-ReachabilityFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
sara: try reading problem file Railroad-PT-005-ReachabilityFireability-6-0.sara.
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(tr_T23_34) AND NOT FIREABLE(tr_T23_31) AND FIREABLE(tr_T9_12) AND FIREABLE(tr_T11_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 ((NOT FIREABLE(tr_T23_34) AND NOT FIREABLE(tr_T23_31) AND FIREABLE(tr_T9_12) AND FIREABLE(tr_T11_1))))
lola: processed formula length: 107
lola: 2 rewrites
lola: closed formula file Railroad-PT-005-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_T23_34) OR FIREABLE(tr_T23_31) OR NOT FIREABLE(tr_T9_12) OR NOT FIREABLE(tr_T11_1))
lola: sara: place or transition ordering is non-deterministic
state equation: Generated DNF with 12 literals and 8 conjunctive subformulas

lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA Railroad-PT-005-ReachabilityFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(tr_T23_16) AND NOT FIREABLE(tr_T7_1) AND ((NOT FIREABLE(tr_T24_4) AND NOT FIREABLE(tr_T23_25)) OR NOT FIREABLE(tr_T9_7)))))
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_T23_16) AND NOT FIREABLE(tr_T7_1) AND ((NOT FIREABLE(tr_T24_4) AND NOT FIREABLE(tr_T23_25)) OR NOT FIREABLE(tr_T9_7)))))
lola: processed formula length: 144
lola: 2 rewrites
lola: closed formula file Railroad-PT-005-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_T23_16) OR FIREABLE(tr_T7_1) OR ((FIREABLE(tr_T24_4) OR FIREABLE(tr_T23_25)) AND FIREABLE(tr_T9_7)))
lola: state equation: Generated DNF with 17 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 7 markings, 6 edges
lola: state equation: write sara problem file to Railroad-PT-005-ReachabilityFireability-9-0.sara
lola: ========================================

FORMULA Railroad-PT-005-ReachabilityFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(tr_T23_31) AND NOT FIREABLE(tr_T6_1)) OR FIREABLE(tr_T24_4) OR (FIREABLE(tr_T23_35) AND FIREABLE(tr_T23_36)))))
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(tr_T23_31) AND NOT FIREABLE(tr_T6_1)) OR FIREABLE(tr_T24_4) OR (FIREABLE(tr_T23_35) AND FIREABLE(tr_T23_36)))))
lola: processed formula length: 134
lola: 1 rewrites
lola: closed formula file Railroad-PT-005-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(tr_T23_31) AND NOT FIREABLE(tr_T6_1)) OR FIREABLE(tr_T24_4) OR (FIREABLE(tr_T23_35) AND FIREABLE(tr_T23_36)))
lola: state equation: Generated DNF with 27 literals and 11 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-005-ReachabilityFireability-10-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2 markings, 1 edges
lola: ========================================

FORMULA Railroad-PT-005-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(tr_T23_15) OR NOT FIREABLE(tr_T8_1) OR NOT FIREABLE(tr_T1_1) OR NOT FIREABLE(tr_T10_1) OR FIREABLE(tr_T18_1) OR FIREABLE(tr_T24_4))))
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_T23_15) OR NOT FIREABLE(tr_T8_1) OR NOT FIREABLE(tr_T1_1) OR NOT FIREABLE(tr_T10_1) OR FIREABLE(tr_T18_1) OR FIREABLE(tr_T24_4))))
lola: processed formula length: 158
lola: 2 rewrites
lola: closed formula file Railroad-PT-005-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_T23_15) AND FIREABLE(tr_T8_1) AND FIREABLE(tr_T1_1) AND FIREABLE(tr_T10_1) AND NOT FIREABLE(tr_T18_1) AND NOT FIREABLE(tr_T24_4))
lola: state equation: Generated DNF with 44 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-005-ReachabilityFireability-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-005-ReachabilityFireability-11-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 1836 markings, 7595 edges
lola: ========================================

FORMULA Railroad-PT-005-ReachabilityFireability-11 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 (((FIREABLE(tr_T23_32) AND FIREABLE(tr_T23_28) AND FIREABLE(tr_T24_3) AND FIREABLE(tr_T23_25)) OR FIREABLE(tr_T24_2) OR NOT FIREABLE(tr_T23_18))))
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_T23_32) AND FIREABLE(tr_T23_28) AND FIREABLE(tr_T24_3) AND FIREABLE(tr_T23_25)) OR FIREABLE(tr_T24_2) OR NOT FIREABLE(tr_T23_18))))
lola: processed formula length: 153
lola: 1 rewrites
lola: closed formula file Railroad-PT-005-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_T23_32) AND FIREABLE(tr_T23_28) AND FIREABLE(tr_T24_3) AND FIREABLE(tr_T23_25)) OR FIREABLE(tr_T24_2) OR NOT FIREABLE(tr_T23_18))
lola: state equation: Generated DNF with 18 literals and 5 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to Railroad-PT-005-ReachabilityFireability-12-0.sara

FORMULA Railroad-PT-005-ReachabilityFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: state equation: calling and running sara
lola: ...considering subproblem: A (G ((FIREABLE(tr_T24_4) OR FIREABLE(tr_T23_33) OR NOT FIREABLE(tr_T24_5) OR (FIREABLE(tr_T12_1) AND FIREABLE(tr_T17_1)) OR (FIREABLE(tr_T9_9) AND FIREABLE(tr_T24_3)) OR (FIREABLE(tr_T9_7) AND FIREABLE(tr_T0_1)) OR NOT FIREABLE(tr_T23_24))))
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_T24_4) OR FIREABLE(tr_T23_33) OR NOT FIREABLE(tr_T24_5) OR (FIREABLE(tr_T12_1) AND FIREABLE(tr_T17_1)) OR (FIREABLE(tr_T9_9) AND FIREABLE(tr_T24_3)) OR (FIREABLE(tr_T9_7) AND FIREABLE(tr_T0_1)) OR NOT FIREABLE(tr_T23_24))))
lola: processed formula length: 248
lola: 2 rewrites
lola: closed formula file Railroad-PT-005-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_T24_4) AND NOT FIREABLE(tr_T23_33) AND FIREABLE(tr_T24_5) AND (NOT FIREABLE(tr_T12_1) OR NOT FIREABLE(tr_T17_1)) AND (NOT FIREABLE(tr_T9_9) OR NOT FIREABLE(tr_T24_3)) AND (NOT FIREABLE(tr_T9_7) OR NOT FIREABLE(tr_T0_1)) AND FIREABLE(tr_T23_24))
lola: state equation: State predicate is contradiction.
sara: try reading problem file Railroad-PT-005-ReachabilityFireability-12-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================

FORMULA Railroad-PT-005-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(tr_T9_11) AND (NOT FIREABLE(tr_T24_3) OR NOT FIREABLE(tr_T23_31)) AND ((FIREABLE(tr_T2_1) AND FIREABLE(tr_T19_1) AND (FIREABLE(tr_T23_13) OR FIREABLE(tr_T9_8))) OR (FIREABLE(tr_T23_32) AND FIREABLE(tr_T6_1) AND NOT FIREABLE(tr_T11_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 ((NOT FIREABLE(tr_T9_11) AND (NOT FIREABLE(tr_T24_3) OR NOT FIREABLE(tr_T23_31)) AND ((FIREABLE(tr_T2_1) AND FIREABLE(tr_T19_1) AND (FIREABLE(tr_T23_13) OR FIREABLE(tr_T9_8))) OR (FIREABLE(tr_T23_32) AND FIREABLE(tr_T6_1) AND NOT FIREABLE(tr_T11_1))))))
lola: processed formula length: 261
lola: 2 rewrites
lola: closed formula file Railroad-PT-005-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: 0 markings, 0 edges
lola: ========================================

FORMULA Railroad-PT-005-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
sara: place or transition ordering is non-deterministic
lola: ========================================
lola: subprocess 15 will run for 3568 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(tr_T23_35) AND NOT FIREABLE(tr_T23_28)) OR (FIREABLE(tr_T4_1) AND FIREABLE(tr_T7_1) AND FIREABLE(tr_T22_1) AND FIREABLE(tr_T23_21)) OR FIREABLE(tr_T3_1) OR FIREABLE(tr_T23_20) OR NOT FIREABLE(tr_T22_1) OR ((FIREABLE(tr_T23_13) OR FIREABLE(tr_T6_1)) AND NOT FIREABLE(tr_T23_24)))))
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_T23_35) AND NOT FIREABLE(tr_T23_28)) OR (FIREABLE(tr_T4_1) AND FIREABLE(tr_T7_1) AND FIREABLE(tr_T22_1) AND FIREABLE(tr_T23_21)) OR FIREABLE(tr_T3_1) OR FIREABLE(tr_T23_20) OR NOT FIREABLE(tr_T22_1) OR ((FIREABLE(tr_T23_13) OR FIREABLE(tr_T6_1)) AND NOT FIREABLE(tr_T23_24)))))
lola: processed formula length: 307
lola: 2 rewrites
lola: closed formula file Railroad-PT-005-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_T23_35) OR FIREABLE(tr_T23_28)) AND (NOT FIREABLE(tr_T4_1) OR NOT FIREABLE(tr_T7_1) OR NOT FIREABLE(tr_T22_1) OR NOT FIREABLE(tr_T23_21)) AND NOT FIREABLE(tr_T3_1) AND NOT FIREABLE(tr_T23_20) AND FIREABLE(tr_T22_1) AND ((NOT FIREABLE(tr_T23_13) AND NOT FIREABLE(tr_T6_1)) OR FIREABLE(tr_T23_24)))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 14 markings, 13 edges
lola: ========================================

FORMULA Railroad-PT-005-ReachabilityFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no yes no no no no no no no no yes yes yes no yes
lola:
preliminary result: yes no yes no no no no no no no no yes yes yes no yes

lola: memory consumption: 14620 KB
lola: time consumption: 1 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="Railroad-PT-005"
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-005.tgz
mv Railroad-PT-005 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-005, 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-152673578900175"
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 ;