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 7.5M
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 14K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K 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.8K 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 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.2K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.8K 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.8K 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 8 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 7.3M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is Diffusion2D-PT-D50N150, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r076-blw3-152649937100315
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526716931974

info: Time: 3600 - MCC
===========================================================================================
prep: translating Diffusion2D-PT-D50N150 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating Diffusion2D-PT-D50N150 formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ Diffusion2D-PT-D50N150 @ 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: 21904/65536 symbol table entries, 8280 collisions
lola: preprocessing...
lola: Size of bit vector: 80000
lola: finding significant places
lola: 2500 places, 19404 transitions, 2499 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2500 transition conflict sets
lola: TASK
lola: reading formula from Diffusion2D-PT-D50N150-ReachabilityFireability.task
lola: E (F (FIREABLE(t1_27_33_28_32))) : E (F ((FIREABLE(t1_43_43_43_42) AND (NOT FIREABLE(t1_11_15_10_15) OR FIREABLE(t1_40_23_39_24))))) : E (F ((NOT FIREABLE(t1_42_49_42_48) AND (FIREABLE(t1_42_33_41_34) OR FIREABLE(t1_35_46_36_45))))) : A (G (((NOT FIREABLE(t1_14_27_14_26) AND FIREABLE(t1_30_50_31_50)) OR (NOT FIREABLE(t1_36_43_37_44) AND (NOT FIREABLE(t1_44_2_43_1) OR NOT FIREABLE(t1_2_32_1_31)))))) : E (F (FIREABLE(t1_2_47_1_46))) : E (F (FIREABLE(t1_31_42_32_41))) : E (F (FIREABLE(t1_6_10_5_9))) : E (F (FIREABLE(t1_36_45_35_44))) : E (F (FIREABLE(t1_15_3_14_3))) : E (F ((FIREABLE(t1_38_23_38_24) AND NOT FIREABLE(t1_33_42_32_43)))) : A (G ((NOT FIREABLE(t1_11_42_12_42) OR (NOT FIREABLE(t1_38_31_39_32) AND NOT FIREABLE(t1_18_17_18_18) AND NOT FIREABLE(t1_12_47_11_48) AND NOT FIREABLE(t1_6_13_5_12))))) : A (G ((NOT FIREABLE(t1_5_29_4_30) OR NOT FIREABLE(t1_44_26_44_27) OR (FIREABLE(t1_5_27_5_28) AND FIREABLE(t1_31_38_32_37))))) : E (F ((FIREABLE(t1_25_48_24_49) OR (NOT FIREABLE(t1_12_40_13_39) AND NOT FIREABLE(t1_42_25_43_26) AND FIREABLE(t1_7_27_6_26) AND NOT FIREABLE(t1_5_1_6_1))))) : E (F ((FIREABLE(t1_23_10_22_11) AND FIREABLE(t1_46_36_47_36) AND (FIREABLE(t1_7_23_8_22) OR FIREABLE(t1_15_45_16_46) OR (FIREABLE(t1_26_29_25_28) AND FIREABLE(t1_20_22_21_23)) OR (FIREABLE(t1_6_12_5_11) AND FIREABLE(t1_7_37_7_38) AND (FIREABLE(t1_39_7_38_8) OR FIREABLE(t1_19_15_19_16))))))) : E (F (FIREABLE(t1_15_39_15_38))) : E (F ((FIREABLE(t1_18_47_19_46) AND (FIREABLE(t1_2_38_1_39) OR FIREABLE(t1_45_44_45_45)))))
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 (FIREABLE(t1_27_33_28_32)))
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(t1_27_33_28_32)))
lola: processed formula length: 32
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D50N150-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(t1_27_33_28_32)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D50N150-ReachabilityFireability-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N150-ReachabilityFireability-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 8 markings, 7 edges
lola: ========================================

FORMULA Diffusion2D-PT-D50N150-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(t1_2_47_1_46)))
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(t1_2_47_1_46)))
lola: processed formula length: 30
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D50N150-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(t1_2_47_1_46)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D50N150-ReachabilityFireability-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N150-ReachabilityFireability-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 25 markings, 24 edges
lola: ========================================

FORMULA Diffusion2D-PT-D50N150-ReachabilityFireability-4 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(t1_31_42_32_41)))
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(t1_31_42_32_41)))
lola: processed formula length: 32
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D50N150-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(t1_31_42_32_41)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D50N150-ReachabilityFireability-2-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N150-ReachabilityFireability-2-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 17 markings, 16 edges
lola: ========================================

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

FORMULA Diffusion2D-PT-D50N150-ReachabilityFireability-7 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(t1_15_3_14_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(t1_15_3_14_3)))
lola: processed formula length: 30
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D50N150-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(t1_15_3_14_3)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D50N150-ReachabilityFireability-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N150-ReachabilityFireability-5-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 24 markings, 23 edges
lola: ========================================

FORMULA Diffusion2D-PT-D50N150-ReachabilityFireability-8 TRUE 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(t1_15_39_15_38)))
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(t1_15_39_15_38)))
lola: processed formula length: 32
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D50N150-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(t1_15_39_15_38)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D50N150-ReachabilityFireability-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N150-ReachabilityFireability-6-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 14 markings, 13 edges
lola: ========================================

FORMULA Diffusion2D-PT-D50N150-ReachabilityFireability-14 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: E (F ((FIREABLE(t1_38_23_38_24) AND NOT FIREABLE(t1_33_42_32_43))))
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(t1_38_23_38_24) AND NOT FIREABLE(t1_33_42_32_43))))
lola: processed formula length: 67
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D50N150-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(t1_38_23_38_24) AND NOT FIREABLE(t1_33_42_32_43))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D50N150-ReachabilityFireability-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N150-ReachabilityFireability-7-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 13 markings, 12 edges
lola: ========================================

FORMULA Diffusion2D-PT-D50N150-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t1_42_49_42_48) AND (FIREABLE(t1_42_33_41_34) OR FIREABLE(t1_35_46_36_45)))))
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(t1_42_49_42_48) AND (FIREABLE(t1_42_33_41_34) OR FIREABLE(t1_35_46_36_45)))))
lola: processed formula length: 98
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D50N150-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(t1_42_49_42_48) AND (FIREABLE(t1_42_33_41_34) OR FIREABLE(t1_35_46_36_45)))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D50N150-ReachabilityFireability-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N150-ReachabilityFireability-8-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 17 markings, 16 edges
lola: ========================================

FORMULA Diffusion2D-PT-D50N150-ReachabilityFireability-2 TRUE 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: E (F ((FIREABLE(t1_43_43_43_42) AND (NOT FIREABLE(t1_11_15_10_15) OR FIREABLE(t1_40_23_39_24)))))
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(t1_43_43_43_42) AND (NOT FIREABLE(t1_11_15_10_15) OR FIREABLE(t1_40_23_39_24)))))
lola: processed formula length: 98
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D50N150-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(t1_43_43_43_42) AND (NOT FIREABLE(t1_11_15_10_15) OR FIREABLE(t1_40_23_39_24)))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D50N150-ReachabilityFireability-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N150-ReachabilityFireability-9-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 18 markings, 17 edges
lola: ========================================

FORMULA Diffusion2D-PT-D50N150-ReachabilityFireability-1 TRUE 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 ((FIREABLE(t1_18_47_19_46) AND (FIREABLE(t1_2_38_1_39) OR FIREABLE(t1_45_44_45_45)))))
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(t1_18_47_19_46) AND (FIREABLE(t1_2_38_1_39) OR FIREABLE(t1_45_44_45_45)))))
lola: processed formula length: 92
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D50N150-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(t1_18_47_19_46) AND (FIREABLE(t1_2_38_1_39) OR FIREABLE(t1_45_44_45_45)))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D50N150-ReachabilityFireability-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N150-ReachabilityFireability-10-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 1919 markings, 7025 edges
lola: ========================================

FORMULA Diffusion2D-PT-D50N150-ReachabilityFireability-15 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(t1_5_29_4_30) OR NOT FIREABLE(t1_44_26_44_27) OR (FIREABLE(t1_5_27_5_28) AND FIREABLE(t1_31_38_32_37)))))
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(t1_5_29_4_30) OR NOT FIREABLE(t1_44_26_44_27) OR (FIREABLE(t1_5_27_5_28) AND FIREABLE(t1_31_38_32_37)))))
lola: processed formula length: 127
lola: 2 rewrites
lola: closed formula file Diffusion2D-PT-D50N150-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(t1_5_29_4_30) AND FIREABLE(t1_44_26_44_27) AND (NOT FIREABLE(t1_5_27_5_28) OR NOT FIREABLE(t1_31_38_32_37)))
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D50N150-ReachabilityFireability-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N150-ReachabilityFireability-11-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 40 markings, 39 edges
lola: ========================================

FORMULA Diffusion2D-PT-D50N150-ReachabilityFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t1_25_48_24_49) OR (NOT FIREABLE(t1_12_40_13_39) AND NOT FIREABLE(t1_42_25_43_26) AND FIREABLE(t1_7_27_6_26) AND NOT FIREABLE(t1_5_1_6_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(t1_25_48_24_49) OR (NOT FIREABLE(t1_12_40_13_39) AND NOT FIREABLE(t1_42_25_43_26) AND FIREABLE(t1_7_27_6_26) AND NOT FIREABLE(t1_5_1_6_1)))))
lola: processed formula length: 158
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D50N150-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(t1_25_48_24_49) OR (NOT FIREABLE(t1_12_40_13_39) AND NOT FIREABLE(t1_42_25_43_26) AND FIREABLE(t1_7_27_6_26) AND NOT FIREABLE(t1_5_1_6_1)))
lola: state equation: Generated DNF with 5 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D50N150-ReachabilityFireability-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N150-ReachabilityFireability-12-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 20 markings, 19 edges
lola: ========================================

FORMULA Diffusion2D-PT-D50N150-ReachabilityFireability-12 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: ...considering subproblem: A (G ((NOT FIREABLE(t1_11_42_12_42) OR (NOT FIREABLE(t1_38_31_39_32) AND NOT FIREABLE(t1_18_17_18_18) AND NOT FIREABLE(t1_12_47_11_48) AND NOT FIREABLE(t1_6_13_5_12)))))
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(t1_11_42_12_42) OR (NOT FIREABLE(t1_38_31_39_32) AND NOT FIREABLE(t1_18_17_18_18) AND NOT FIREABLE(t1_12_47_11_48) AND NOT FIREABLE(t1_6_13_5_12)))))
lola: processed formula length: 170
lola: 2 rewrites
lola: closed formula file Diffusion2D-PT-D50N150-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(t1_11_42_12_42) AND (FIREABLE(t1_38_31_39_32) OR FIREABLE(t1_18_17_18_18) OR FIREABLE(t1_12_47_11_48) OR FIREABLE(t1_6_13_5_12)))
lola: state equation: Generated DNF with 8 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D50N150-ReachabilityFireability-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N150-ReachabilityFireability-13-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 154 markings, 477 edges
lola: ========================================

FORMULA Diffusion2D-PT-D50N150-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t1_14_27_14_26) AND FIREABLE(t1_30_50_31_50)) OR (NOT FIREABLE(t1_36_43_37_44) AND (NOT FIREABLE(t1_44_2_43_1) OR NOT FIREABLE(t1_2_32_1_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 (((NOT FIREABLE(t1_14_27_14_26) AND FIREABLE(t1_30_50_31_50)) OR (NOT FIREABLE(t1_36_43_37_44) AND (NOT FIREABLE(t1_44_2_43_1) OR NOT FIREABLE(t1_2_32_1_31))))))
lola: processed formula length: 168
lola: 2 rewrites
lola: closed formula file Diffusion2D-PT-D50N150-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(t1_14_27_14_26) OR NOT FIREABLE(t1_30_50_31_50)) AND (FIREABLE(t1_36_43_37_44) OR (FIREABLE(t1_44_2_43_1) AND FIREABLE(t1_2_32_1_31))))
lola: state equation: Generated DNF with 10 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D50N150-ReachabilityFireability-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N150-ReachabilityFireability-14-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 18 markings, 17 edges
lola: ========================================

FORMULA Diffusion2D-PT-D50N150-ReachabilityFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t1_23_10_22_11) AND FIREABLE(t1_46_36_47_36) AND (FIREABLE(t1_7_23_8_22) OR FIREABLE(t1_15_45_16_46) OR (FIREABLE(t1_26_29_25_28) AND FIREABLE(t1_20_22_21_23)) OR (FIREABLE(t1_6_12_5_11) AND FIREABLE(t1_7_37_7_38) AND (FIREABLE(t1_39_7_38_8) OR FIREABLE(t1_19_15_19_16)))))))
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(t1_23_10_22_11) AND FIREABLE(t1_46_36_47_36) AND (FIREABLE(t1_7_23_8_22) OR FIREABLE(t1_15_45_16_46) OR (FIREABLE(t1_26_29_25_28) AND FIREABLE(t1_20_22_21_23)) OR (FIREABLE(t1_6_12_5_11) AND FIREABLE(t1_7_37_7_38) AND (FIREABLE(t1_39_7_38_8) OR FIREABLE(t1_19_15_19_16)))))))
lola: processed formula length: 295
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D50N150-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(t1_23_10_22_11) AND FIREABLE(t1_46_36_47_36) AND (FIREABLE(t1_7_23_8_22) OR FIREABLE(t1_15_45_16_46) OR (FIREABLE(t1_26_29_25_28) AND FIREABLE(t1_20_22_21_23)) OR (FIREABLE(t1_6_12_5_11) AND FIREABLE(t1_7_37_7_38) AND (FIREABLE(t1_39_7_38_8) OR FIREABLE(t1_19_15_19_16)))))
lola: state equation: Generated DNF with 20 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D50N150-ReachabilityFireability-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N150-ReachabilityFireability-15-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 46 markings, 45 edges
lola: ========================================

FORMULA Diffusion2D-PT-D50N150-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes yes yes no yes yes yes yes yes yes no no yes yes yes yes
lola:
preliminary result: yes yes yes no yes yes yes yes yes yes no no yes yes yes yes
lola: memory consumption: 31520 KB
lola: time consumption: 2 seconds

BK_STOP 1526716934850

--------------------
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="Diffusion2D-PT-D50N150"
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/Diffusion2D-PT-D50N150.tgz
mv Diffusion2D-PT-D50N150 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 Diffusion2D-PT-D50N150, 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 r076-blw3-152649937100315"
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 ;