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 812K
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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 5.6K 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 9.9K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K 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.9K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 117 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 355 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 4.8K 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.9K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K 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 9 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 633K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is PhaseVariation-PT-D05CS100, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r112-csrt-152666469700623
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527048647740

info: Time: 3600 - MCC
===========================================================================================
prep: translating PhaseVariation-PT-D05CS100 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating PhaseVariation-PT-D05CS100 formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ PhaseVariation-PT-D05CS100 @ 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: 754/65536 symbol table entries, 76 collisions
lola: preprocessing...
lola: Size of bit vector: 2464
lola: finding significant places
lola: 77 places, 677 transitions, 51 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2 transition conflict sets
lola: TASK
lola: reading formula from PhaseVariation-PT-D05CS100-ReachabilityFireability.task
lola: E (F ((FIREABLE(division1_mutate_1_2_A) AND FIREABLE(division2_replicate_2_4_A_2_3) AND FIREABLE(division2_replicate_1_4_A_2_3) AND FIREABLE(division2_mutate_1_2_B_2_2) AND ((FIREABLE(division2_mutate_3_5_B_4_4) AND FIREABLE(division2_mutate_3_2_B_2_3)) OR NOT FIREABLE(division2_mutate_1_1_B_1_2)) AND (FIREABLE(division2_mutate_4_4_B_3_4) OR FIREABLE(division2_replicate_4_2_B_4_1))))) : E (F ((FIREABLE(division2_mutate_4_4_A_4_5) AND (FIREABLE(division2_replicate_1_3_B_1_2) OR FIREABLE(division1_mutate_5_4_B) OR FIREABLE(division2_mutate_4_4_B_3_5) OR FIREABLE(division2_mutate_2_4_B_1_3) OR (FIREABLE(division2_mutate_4_3_B_4_2) AND FIREABLE(division2_replicate_1_4_B_2_5) AND NOT FIREABLE(division2_mutate_2_2_A_1_2)))))) : E (F ((FIREABLE(division2_replicate_1_5_A_2_5) AND FIREABLE(division2_replicate_2_5_B_3_5)))) : E (F ((FIREABLE(division2_mutate_4_2_B_4_3) AND FIREABLE(division2_mutate_2_5_A_1_5)))) : E (F (NOT FIREABLE(division2_replicate_3_2_A_2_2))) : A (G ((NOT FIREABLE(division1_replicate_5_3_A) OR NOT FIREABLE(division2_replicate_1_3_B_2_2)))) : E (F (((FIREABLE(division2_mutate_5_5_B_5_4) OR FIREABLE(division2_mutate_1_4_B_2_3)) AND FIREABLE(division1_replicate_4_5_B)))) : A (G ((FIREABLE(division2_replicate_3_5_B_3_4) OR NOT FIREABLE(division1_mutate_3_2_A) OR FIREABLE(division2_replicate_4_2_A_3_2) OR (FIREABLE(division2_replicate_3_2_A_2_3) AND (FIREABLE(division2_mutate_1_4_B_1_5) OR FIREABLE(division2_replicate_1_5_A_1_4) OR NOT FIREABLE(division2_mutate_2_4_A_1_3)))))) : A (G (((NOT FIREABLE(division2_mutate_1_4_B_1_5) AND (NOT FIREABLE(division2_replicate_2_1_B_3_2) OR NOT FIREABLE(division2_mutate_3_2_B_4_3))) OR NOT FIREABLE(division2_replicate_1_5_B_1_4)))) : E (F ((FIREABLE(division1_mutate_3_1_B) AND FIREABLE(division2_replicate_2_5_B_3_5) AND NOT FIREABLE(division2_replicate_4_5_B_3_5)))) : A (G ((NOT FIREABLE(division2_mutate_4_3_A_5_4) OR NOT FIREABLE(division1_replicate_1_5_A) OR NOT FIREABLE(division2_replicate_3_4_B_2_3) OR NOT FIREABLE(division2_mutate_2_5_A_3_5) OR FIREABLE(division2_replicate_1_4_B_2_5)))) : E (F ((FIREABLE(division2_replicate_2_1_B_1_1) AND FIREABLE(division2_replicate_4_2_A_5_2) AND (FIREABLE(division2_replicate_3_5_B_2_5) OR FIREABLE(division2_mutate_2_2_B_2_1)) AND (FIREABLE(division2_replicate_4_4_A_3_3) OR FIREABLE(division2_mutate_4_2_B_5_2) OR (FIREABLE(division2_replicate_4_5_B_4_4) AND FIREABLE(division2_replicate_5_4_B_4_5))) AND (FIREABLE(division1_mutate_2_4_B) OR FIREABLE(division1_replicate_3_5_A) OR FIREABLE(division2_replicate_4_4_B_5_4) OR FIREABLE(division1_mutate_3_2_A)) AND (NOT FIREABLE(division1_mutate_1_4_A) OR NOT FIREABLE(division2_replicate_4_5_A_3_5))))) : E (F ((FIREABLE(division2_mutate_4_3_A_4_4) AND FIREABLE(division2_mutate_1_2_B_1_3) AND (((FIREABLE(division2_replicate_3_3_B_4_3) OR FIREABLE(division2_replicate_1_4_B_1_5)) AND FIREABLE(division2_replicate_5_2_B_4_3)) OR (FIREABLE(division2_replicate_4_4_B_3_4) AND FIREABLE(division2_mutate_4_5_B_5_5) AND FIREABLE(division2_mutate_2_4_A_3_5)))))) : A (G ((NOT FIREABLE(division1_replicate_5_1_A) OR NOT FIREABLE(division2_mutate_1_2_B_2_1) OR (NOT FIREABLE(division2_replicate_3_2_B_2_3) AND NOT FIREABLE(division1_replicate_5_1_B)) OR FIREABLE(division2_mutate_5_4_B_4_3)))) : E (F ((FIREABLE(division1_mutate_5_3_B) AND FIREABLE(division2_replicate_1_2_A_2_3)))) : A (G ((NOT FIREABLE(division2_mutate_1_2_A_2_1) OR NOT FIREABLE(division2_replicate_1_3_A_1_4) OR (NOT FIREABLE(division2_mutate_3_2_A_2_1) AND (FIREABLE(division2_mutate_2_3_B_3_3) OR FIREABLE(division2_mutate_4_2_A_3_3))) OR (FIREABLE(division2_replicate_1_3_B_1_2) AND FIREABLE(division2_replicate_5_1_A_4_2)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (NOT FIREABLE(division2_replicate_3_2_A_2_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(division2_replicate_3_2_A_2_2)))
lola: processed formula length: 51
lola: 1 rewrites
lola: closed formula file PhaseVariation-PT-D05CS100-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(division2_replicate_3_2_A_2_2)
lola: state equation: Generated DNF with 3 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D05CS100-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: 46 markings, 45 edges
lola: ========================================

FORMULA PhaseVariation-PT-D05CS100-ReachabilityFireability-4 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: E (F ((FIREABLE(division2_mutate_4_2_B_4_3) AND FIREABLE(division2_mutate_2_5_A_1_5))))
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(division2_mutate_4_2_B_4_3) AND FIREABLE(division2_mutate_2_5_A_1_5))))
lola: processed formula length: 87
lola: 1 rewrites
lola: closed formula file PhaseVariation-PT-D05CS100-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(division2_mutate_4_2_B_4_3) AND FIREABLE(division2_mutate_2_5_A_1_5))
lola: state equation: Generated DNF with 6 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D05CS100-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: 6 markings, 5 edges
lola: ========================================

FORMULA PhaseVariation-PT-D05CS100-ReachabilityFireability-3 TRUE 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: E (F ((FIREABLE(division2_replicate_1_5_A_2_5) AND FIREABLE(division2_replicate_2_5_B_3_5))))
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(division2_replicate_1_5_A_2_5) AND FIREABLE(division2_replicate_2_5_B_3_5))))
lola: processed formula length: 93
lola: 1 rewrites
lola: closed formula file PhaseVariation-PT-D05CS100-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(division2_replicate_1_5_A_2_5) AND FIREABLE(division2_replicate_2_5_B_3_5))
lola: state equation: Generated DNF with 6 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 4 edges
lola: ========================================

FORMULA PhaseVariation-PT-D05CS100-ReachabilityFireability-2 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 ((NOT FIREABLE(division1_replicate_5_3_A) OR NOT FIREABLE(division2_replicate_1_3_B_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 ((NOT FIREABLE(division1_replicate_5_3_A) OR NOT FIREABLE(division2_replicate_1_3_B_2_2))))
lola: processed formula length: 97
lola: 2 rewrites
lola: closed formula file PhaseVariation-PT-D05CS100-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(division1_replicate_5_3_A) AND FIREABLE(division2_replicate_1_3_B_2_2))
lola: state equation: Generated DNF with 6 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D05CS100-ReachabilityFireability-3-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: 5 markings, 4 edges
lola: ========================================

FORMULA PhaseVariation-PT-D05CS100-ReachabilityFireability-5 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: E (F ((FIREABLE(division1_mutate_5_3_B) AND FIREABLE(division2_replicate_1_2_A_2_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(division1_mutate_5_3_B) AND FIREABLE(division2_replicate_1_2_A_2_3))))
lola: processed formula length: 86
lola: 1 rewrites
lola: closed formula file PhaseVariation-PT-D05CS100-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(division1_mutate_5_3_B) AND FIREABLE(division2_replicate_1_2_A_2_3))
lola: state equation: Generated DNF with 6 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D05CS100-ReachabilityFireability-4-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 4 edges

FORMULA PhaseVariation-PT-D05CS100-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(division1_mutate_3_1_B) AND FIREABLE(division2_replicate_2_5_B_3_5) AND NOT FIREABLE(division2_replicate_4_5_B_3_5))))
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(division1_mutate_3_1_B) AND FIREABLE(division2_replicate_2_5_B_3_5) AND NOT FIREABLE(division2_replicate_4_5_B_3_5))))
lola: processed formula length: 134
lola: 1 rewrites
lola: closed formula file PhaseVariation-PT-D05CS100-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(division1_mutate_3_1_B) AND FIREABLE(division2_replicate_2_5_B_3_5) AND NOT FIREABLE(division2_replicate_4_5_B_3_5))
lola: lola: ========================================
state equation: Generated DNF with 7 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D05CS100-ReachabilityFireability-5-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: 118 markings, 117 edges
lola: ========================================

FORMULA PhaseVariation-PT-D05CS100-ReachabilityFireability-9 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 (((FIREABLE(division2_mutate_5_5_B_5_4) OR FIREABLE(division2_mutate_1_4_B_2_3)) AND FIREABLE(division1_replicate_4_5_B))))
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(division2_mutate_5_5_B_5_4) OR FIREABLE(division2_mutate_1_4_B_2_3)) AND FIREABLE(division1_replicate_4_5_B))))
lola: processed formula length: 129
lola: 1 rewrites
lola: closed formula file PhaseVariation-PT-D05CS100-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(division2_mutate_5_5_B_5_4) OR FIREABLE(division2_mutate_1_4_B_2_3)) AND FIREABLE(division1_replicate_4_5_B))
lola: state equation: Generated DNF with 12 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D05CS100-ReachabilityFireability-6-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: 4 markings, 3 edges
lola: ========================================

FORMULA PhaseVariation-PT-D05CS100-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(division2_mutate_1_4_B_1_5) AND (NOT FIREABLE(division2_replicate_2_1_B_3_2) OR NOT FIREABLE(division2_mutate_3_2_B_4_3))) OR NOT FIREABLE(division2_replicate_1_5_B_1_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(division2_mutate_1_4_B_1_5) AND (NOT FIREABLE(division2_replicate_2_1_B_3_2) OR NOT FIREABLE(division2_mutate_3_2_B_4_3))) OR NOT FIREABLE(division2_replicate_1_5_B_1_4))))
lola: processed formula length: 195
lola: 2 rewrites
lola: closed formula file PhaseVariation-PT-D05CS100-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(division2_mutate_1_4_B_1_5) OR (FIREABLE(division2_replicate_2_1_B_3_2) AND FIREABLE(division2_mutate_3_2_B_4_3))) AND FIREABLE(division2_replicate_1_5_B_1_4))
lola: state equation: Generated DNF with 15 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D05CS100-ReachabilityFireability-7-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: 5 markings, 4 edges
lola: ========================================

FORMULA PhaseVariation-PT-D05CS100-ReachabilityFireability-8 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: A (G ((NOT FIREABLE(division1_replicate_5_1_A) OR NOT FIREABLE(division2_mutate_1_2_B_2_1) OR (NOT FIREABLE(division2_replicate_3_2_B_2_3) AND NOT FIREABLE(division1_replicate_5_1_B)) OR FIREABLE(division2_mutate_5_4_B_4_3))))
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(division1_replicate_5_1_A) OR NOT FIREABLE(division2_mutate_1_2_B_2_1) OR (NOT FIREABLE(division2_replicate_3_2_B_2_3) AND NOT FIREABLE(division1_replicate_5_1_B)) OR FIREABLE(division2_mutate_5_4_B_4_3))))
lola: processed formula length: 229
lola: 2 rewrites
lola: closed formula file PhaseVariation-PT-D05CS100-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(division1_replicate_5_1_A) AND FIREABLE(division2_mutate_1_2_B_2_1) AND (FIREABLE(division2_replicate_3_2_B_2_3) OR FIREABLE(division1_replicate_5_1_B)) AND NOT FIREABLE(division2_mutate_5_4_B_4_3))
lola: state equation: Generated DNF with 40 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D05CS100-ReachabilityFireability-8-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 6 markings, 5 edges
lola: ========================================

FORMULA PhaseVariation-PT-D05CS100-ReachabilityFireability-13 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 ((NOT FIREABLE(division2_mutate_4_3_A_5_4) OR NOT FIREABLE(division1_replicate_1_5_A) OR NOT FIREABLE(division2_replicate_3_4_B_2_3) OR NOT FIREABLE(division2_mutate_2_5_A_3_5) OR FIREABLE(division2_replicate_1_4_B_2_5))))
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(division2_mutate_4_3_A_5_4) OR NOT FIREABLE(division1_replicate_1_5_A) OR NOT FIREABLE(division2_replicate_3_4_B_2_3) OR NOT FIREABLE(division2_mutate_2_5_A_3_5) OR FIREABLE(division2_replicate_1_4_B_2_5))))
lola: processed formula length: 231
lola: 2 rewrites
lola: closed formula file PhaseVariation-PT-D05CS100-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(division2_mutate_4_3_A_5_4) AND FIREABLE(division1_replicate_1_5_A) AND FIREABLE(division2_replicate_3_4_B_2_3) AND FIREABLE(division2_mutate_2_5_A_3_5) AND NOT FIREABLE(division2_replicate_1_4_B_2_5))
lola: state equation: Generated DNF with 26 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D05CS100-ReachabilityFireability-9-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: 9 markings, 8 edges

FORMULA PhaseVariation-PT-D05CS100-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 10 will run for 595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(division2_replicate_3_5_B_3_4) OR NOT FIREABLE(division1_mutate_3_2_A) OR FIREABLE(division2_replicate_4_2_A_3_2) OR (FIREABLE(division2_replicate_3_2_A_2_3) AND (FIREABLE(division2_mutate_1_4_B_1_5) OR FIREABLE(division2_replicate_1_5_A_1_4) OR NOT FIREABLE(division2_mutate_2_4_A_1_3))))))
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(division2_replicate_3_5_B_3_4) OR NOT FIREABLE(division1_mutate_3_2_A) OR FIREABLE(division2_replicate_4_2_A_3_2) OR (FIREABLE(division2_replicate_3_2_A_2_3) AND (FIREABLE(division2_mutate_1_4_B_1_5) OR FIREABLE(division2_replicate_1_5_A_1_4) OR NOT FIREABLE(division2_mutate_2_4_A_1_3))))))
lola: processed formula length: 312
lola: 2 rewrites
lola: closed formula file PhaseVariation-PT-D05CS100-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(division2_replicate_3_5_B_3_4) AND FIREABLE(division1_mutate_3_2_A) AND NOT FIREABLE(division2_replicate_4_2_A_3_2) AND (NOT FIREABLE(division2_replicate_3_2_A_2_3) OR (NOT FIREABLE(division2_mutate_1_4_B_1_5) AND NOT FIREABLE(division2_replicate_1_5_A_1_4) AND FIREABLE(division2_mutate_2_4_A_1_3))))
lola: state equation: Generated DNF with 92 literals and 10 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D05CS100-ReachabilityFireability-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D05CS100-ReachabilityFireability-10-0.sara.lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 70 markings, 73 edges
lola: ========================================

FORMULA PhaseVariation-PT-D05CS100-ReachabilityFireability-7 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 ((NOT FIREABLE(division2_mutate_1_2_A_2_1) OR NOT FIREABLE(division2_replicate_1_3_A_1_4) OR (NOT FIREABLE(division2_mutate_3_2_A_2_1) AND (FIREABLE(division2_mutate_2_3_B_3_3) OR FIREABLE(division2_mutate_4_2_A_3_3))) OR (FIREABLE(division2_replicate_1_3_B_1_2) AND FIREABLE(division2_replicate_5_1_A_4_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(division2_mutate_1_2_A_2_1) OR NOT FIREABLE(division2_replicate_1_3_A_1_4) OR (NOT FIREABLE(division2_mutate_3_2_A_2_1) AND (FIREABLE(division2_mutate_2_3_B_3_3) OR FIREABLE(division2_mutate_4_2_A_3_3))) OR (FIREABLE(division2_replicate_1_3_B_1_2) AND FIREABLE(division2_replicate_5_1_A_4_2)))))
lola: processed formula length: 319
lola: 2 rewrites
lola: closed formula file PhaseVariation-PT-D05CS100-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(division2_mutate_1_2_A_2_1) AND FIREABLE(division2_replicate_1_3_A_1_4) AND (FIREABLE(division2_mutate_3_2_A_2_1) OR (NOT FIREABLE(division2_mutate_2_3_B_3_3) AND NOT FIREABLE(division2_mutate_4_2_A_3_3))) AND (NOT FIREABLE(division2_replicate_1_3_B_1_2) OR NOT FIREABLE(division2_replicate_5_1_A_4_2)))
lola: state equation: Generated DNF with 138 literals and 15 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D05CS100-ReachabilityFireability-11-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 4 markings, 3 edges
lola: ========================================

FORMULA PhaseVariation-PT-D05CS100-ReachabilityFireability-15 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: E (F ((FIREABLE(division2_mutate_4_3_A_4_4) AND FIREABLE(division2_mutate_1_2_B_1_3) AND (((FIREABLE(division2_replicate_3_3_B_4_3) OR FIREABLE(division2_replicate_1_4_B_1_5)) AND FIREABLE(division2_replicate_5_2_B_4_3)) OR (FIREABLE(division2_replicate_4_4_B_3_4) AND FIREABLE(division2_mutate_4_5_B_5_5) AND FIREABLE(division2_mutate_2_4_A_3_5))))))
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(division2_mutate_4_3_A_4_4) AND FIREABLE(division2_mutate_1_2_B_1_3) AND (((FIREABLE(division2_replicate_3_3_B_4_3) OR FIREABLE(division2_replicate_1_4_B_1_5)) AND FIREABLE(division2_replicate_5_2_B_4_3)) OR (FIREABLE(division2_replicate_4_4_B_3_4) AND FIREABLE(division2_mutate_4_5_B_5_5) AND FIREABLE(division2_mutate_2_4_A_3_5))))))
lola: processed formula length: 353
lola: 1 rewrites
lola: closed formula file PhaseVariation-PT-D05CS100-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(division2_mutate_4_3_A_4_4) AND FIREABLE(division2_mutate_1_2_B_1_3) AND (((FIREABLE(division2_replicate_3_3_B_4_3) OR FIREABLE(division2_replicate_1_4_B_1_5)) AND FIREABLE(division2_replicate_5_2_B_4_3)) OR (FIREABLE(division2_replicate_4_4_B_3_4) AND FIREABLE(division2_mutate_4_5_B_5_5) AND FIREABLE(division2_mutate_2_4_A_3_5))))
lola: state equation: Generated DNF with 39 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D05CS100-ReachabilityFireability-12-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 4 edges
lola: ========================================
lola: state equation: calling and running sara

FORMULA PhaseVariation-PT-D05CS100-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1190 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(division2_mutate_4_4_A_4_5) AND (FIREABLE(division2_replicate_1_3_B_1_2) OR FIREABLE(division1_mutate_5_4_B) OR FIREABLE(division2_mutate_4_4_B_3_5) OR FIREABLE(division2_mutate_2_4_B_1_3) OR (FIREABLE(division2_mutate_4_3_B_4_2) AND FIREABLE(division2_replicate_1_4_B_2_5) AND NOT FIREABLE(division2_mutate_2_2_A_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(division2_mutate_4_4_A_4_5) AND (FIREABLE(division2_replicate_1_3_B_1_2) OR FIREABLE(division1_mutate_5_4_B) OR FIREABLE(division2_mutate_4_4_B_3_5) OR FIREABLE(division2_mutate_2_4_B_1_3) OR (FIREABLE(division2_mutate_4_3_B_4_2) AND FIREABLE(division2_replicate_1_4_B_2_5) AND NOT FIREABLE(division2_mutate_2_2_A_1_2))))))
lola: processed formula length: 343
lola: 1 rewrites
lola: closed formula file PhaseVariation-PT-D05CS100-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 4 edges
lola: ========================================
sara: try reading problem file PhaseVariation-PT-D05CS100-ReachabilityFireability-12-0.sara.

FORMULA PhaseVariation-PT-D05CS100-ReachabilityFireability-1 TRUE 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: E (F ((FIREABLE(division1_mutate_1_2_A) AND FIREABLE(division2_replicate_2_4_A_2_3) AND FIREABLE(division2_replicate_1_4_A_2_3) AND FIREABLE(division2_mutate_1_2_B_2_2) AND ((FIREABLE(division2_mutate_3_5_B_4_4) AND FIREABLE(division2_mutate_3_2_B_2_3)) OR NOT FIREABLE(division2_mutate_1_1_B_1_2)) AND (FIREABLE(division2_mutate_4_4_B_3_4) OR FIREABLE(division2_replicate_4_2_B_4_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(division1_mutate_1_2_A) AND FIREABLE(division2_replicate_2_4_A_2_3) AND FIREABLE(division2_replicate_1_4_A_2_3) AND FIREABLE(division2_mutate_1_2_B_2_2) AND ((FIREABLE(division2_mutate_3_5_B_4_4) AND FIREABLE(division2_mutate_3_2_B_2_3)) OR NOT FIREABLE(division2_mutate_1_1_B_1_2)) AND (FIREABLE(division2_mutate_4_4_B_3_4) OR FIREABLE(division2_replicate_4_2_B_4_1)))))
lola: processed formula length: 389
lola: 1 rewrites
lola: closed formula file PhaseVariation-PT-D05CS100-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(division1_mutate_1_2_A) AND FIREABLE(division2_replicate_2_4_A_2_3) AND FIREABLE(division2_replicate_1_4_A_2_3) AND FIREABLE(division2_mutate_1_2_B_2_2) AND ((FIREABLE(division2_mutate_3_5_B_4_4) AND FIREABLE(division2_mutate_3_2_B_2_3)) OR NOT FIREABLE(division2_mutate_1_1_B_1_2)) AND (FIREABLE(division2_mutate_4_4_B_3_4) OR FIREABLE(division2_replicate_4_2_B_4_1)))
lola: state equation: Generated DNF with 106 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D05CS100-ReachabilityFireability-14-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 4 edges
lola: ========================================

FORMULA PhaseVariation-PT-D05CS100-ReachabilityFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3570 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(division2_replicate_2_1_B_1_1) AND FIREABLE(division2_replicate_4_2_A_5_2) AND (FIREABLE(division2_replicate_3_5_B_2_5) OR FIREABLE(division2_mutate_2_2_B_2_1)) AND (FIREABLE(division2_replicate_4_4_A_3_3) OR FIREABLE(division2_mutate_4_2_B_5_2) OR (FIREABLE(division2_replicate_4_5_B_4_4) AND FIREABLE(division2_replicate_5_4_B_4_5))) AND (FIREABLE(division1_mutate_2_4_B) OR FIR... (shortened)
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(division2_replicate_2_1_B_1_1) AND FIREABLE(division2_replicate_4_2_A_5_2) AND (FIREABLE(division2_replicate_3_5_B_2_5) OR FIREABLE(division2_mutate_2_2_B_2_1)) AND (FIREABLE(division2_replicate_4_4_A_3_3) OR FIREABLE(division2_mutate_4_2_B_5_2) OR (FIREABLE(division2_replicate_4_5_B_4_4) AND FIREABLE(division2_replicate_5_4_B_4_5))) AND (FIREABLE(division1_mutate_2_4_B) OR FIR... (shortened)
lola: processed formula length: 608
lola: 1 rewrites
lola: closed formula file PhaseVariation-PT-D05CS100-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(division2_replicate_2_1_B_1_1) AND FIREABLE(division2_replicate_4_2_A_5_2) AND (FIREABLE(division2_replicate_3_5_B_2_5) OR FIREABLE(division2_mutate_2_2_B_2_1)) AND (FIREABLE(division2_replicate_4_4_A_3_3) OR FIREABLE(division2_mutate_4_2_B_5_2) OR (FIREABLE(division2_replicate_4_5_B_4_4) AND FIREABLE(division2_replicate_5_4_B_4_5))) AND (FIREABLE(division1_mutate_2_4_B) OR FIREABLE(division1_replicate_3_5_A) OR FIREABLE(division2_replicate_4_4_B_5_4) OR FIREABLE(division1_mutate_3_2_A)) AND (NOT FIREABLE(division1_mutate_1_4_A) OR NOT FIREABLE(division2_replicate_4_5_A_3_5)))
lola: state equation: Generated DNF with 1378 literals and 82 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D05CS100-ReachabilityFireability-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D05CS100-ReachabilityFireability-15-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 8 markings, 7 edges
lola: ========================================

FORMULA PhaseVariation-PT-D05CS100-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes yes yes yes yes no yes no no yes no yes yes no yes no
lola:
preliminary result: yes yes yes yes yes no yes no no yes no yes yes no yes no
lola: memory consumption: 15292 KB
lola: time consumption: 0 seconds
sara: place or transition ordering is non-deterministic


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="PhaseVariation-PT-D05CS100"
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/PhaseVariation-PT-D05CS100.tgz
mv PhaseVariation-PT-D05CS100 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 PhaseVariation-PT-D05CS100, 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-152666469700623"
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 ;