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 504K
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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.3K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.2K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.8K 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 16K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 116 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 354 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 9 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 346K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is ResAllocation-PT-R003C050, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-qhx2-152673579200371
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527010602496

info: Time: 3600 - MCC
===========================================================================================
prep: translating ResAllocation-PT-R003C050 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: added safe information to the net based on GenericPropertiesVerdict
prep: check for too many tokens
===========================================================================================
prep: translating ResAllocation-PT-R003C050 formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ ResAllocation-PT-R003C050 @ 3555 seconds
lola: LoLA will run for 3555 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 500/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 300
lola: finding significant places
lola: 300 places, 200 transitions, 150 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 350 transition conflict sets
lola: TASK
lola: reading formula from ResAllocation-PT-R003C050-ReachabilityFireability.task
lola: A (G ((NOT FIREABLE(t_8_0) OR ((FIREABLE(t_5_0) OR FIREABLE(t_11_2)) AND NOT FIREABLE(t_49_2)) OR NOT FIREABLE(t_21_1) OR NOT FIREABLE(t_27_0) OR NOT FIREABLE(t_46_0)))) : E (F (FIREABLE(t_30_3))) : E (F (FIREABLE(t_20_3))) : E (F (FIREABLE(t_45_0))) : A (G ((NOT FIREABLE(t_32_0) OR (FIREABLE(t_22_0) AND FIREABLE(t_22_1)) OR NOT FIREABLE(t_3_2) OR (NOT FIREABLE(t_0_2) AND NOT FIREABLE(t_34_3))))) : E (F (((FIREABLE(t_25_2) OR FIREABLE(t_25_0) OR (FIREABLE(t_46_2) AND FIREABLE(t_4_3)) OR (FIREABLE(t_37_2) AND FIREABLE(t_35_2) AND NOT FIREABLE(t_35_0))) AND FIREABLE(t_47_0)))) : E (F (FIREABLE(t_21_0))) : A (G ((NOT FIREABLE(t_41_0) OR NOT FIREABLE(t_38_3) OR FIREABLE(t_42_2) OR NOT FIREABLE(t_7_1)))) : A (G (NOT FIREABLE(t_11_0))) : E (F (FIREABLE(t_43_0))) : A (G ((NOT FIREABLE(t_18_2) OR NOT FIREABLE(t_11_2) OR NOT FIREABLE(t_25_0) OR (NOT FIREABLE(t_27_0) AND NOT FIREABLE(t_5_2) AND (NOT FIREABLE(t_48_1) OR NOT FIREABLE(t_32_2)))))) : E (F (FIREABLE(t_5_0))) : E (F ((FIREABLE(t_35_0) AND FIREABLE(t_6_3) AND (FIREABLE(t_36_0) OR FIREABLE(t_27_2))))) : E (F ((FIREABLE(t_38_0) AND FIREABLE(t_4_3) AND FIREABLE(t_29_2) AND FIREABLE(t_39_1) AND FIREABLE(t_7_1) AND FIREABLE(t_35_1) AND FIREABLE(t_37_1) AND FIREABLE(t_0_0)))) : A (G (((NOT FIREABLE(t_14_2) AND (NOT FIREABLE(t_37_2) OR NOT FIREABLE(t_21_2))) OR NOT FIREABLE(t_13_2)))) : A (G ((FIREABLE(t_19_2) OR FIREABLE(t_47_2) OR FIREABLE(t_35_3) OR FIREABLE(t_16_3) OR NOT FIREABLE(t_47_1) OR (NOT FIREABLE(t_27_2) AND NOT FIREABLE(t_21_1) AND (NOT FIREABLE(t_39_1) OR (FIREABLE(t_8_3) AND FIREABLE(t_19_2)))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t_30_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(t_30_3)))
lola: processed formula length: 24
lola: 1 rewrites
lola: closed formula file ResAllocation-PT-R003C050-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(t_30_3)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ResAllocation-PT-R003C050-ReachabilityFireability-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4 markings, 3 edges
lola: ========================================

FORMULA ResAllocation-PT-R003C050-ReachabilityFireability-1 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(t_20_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(t_20_3)))
lola: processed formula length: 24
lola: 1 rewrites
lola: closed formula file ResAllocation-PT-R003C050-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(t_20_3)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ResAllocation-PT-R003C050-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: 4 markings, 3 edges
lola: ========================================

FORMULA ResAllocation-PT-R003C050-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 253 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t_45_0)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (FIREABLE(t_45_0)))
lola: processed formula length: 24
lola: 1 rewrites
lola: closed formula file ResAllocation-PT-R003C050-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: 4 markings, 3 edges
lola: ========================================

FORMULA ResAllocation-PT-R003C050-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 273 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t_21_0)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (FIREABLE(t_21_0)))
lola: processed formula length: 24
lola: 1 rewrites
lola: closed formula file ResAllocation-PT-R003C050-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(t_21_0)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4 markings, 3 edges
lola: ========================================

FORMULA ResAllocation-PT-R003C050-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t_11_0)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (NOT FIREABLE(t_11_0)))
lola: processed formula length: 28
lola: 2 rewrites
lola: closed formula file ResAllocation-PT-R003C050-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(t_11_0)
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: The predicate is not invariant.
lola: 4 markings, 3 edges
lola: state equation: write sara problem file to ResAllocation-PT-R003C050-ReachabilityFireability-4-0.sara
lola: ========================================

FORMULA ResAllocation-PT-R003C050-ReachabilityFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t_43_0)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (FIREABLE(t_43_0)))
lola: processed formula length: 24
lola: 1 rewrites
lola: closed formula file ResAllocation-PT-R003C050-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(t_43_0)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ResAllocation-PT-R003C050-ReachabilityFireability-5-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4 markings, 3 edges
lola: ========================================

FORMULA ResAllocation-PT-R003C050-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 355 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t_5_0)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (FIREABLE(t_5_0)))
lola: processed formula length: 23
lola: 1 rewrites
lola: closed formula file ResAllocation-PT-R003C050-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(t_5_0)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4 markings, 3 edges
lola: ========================================

FORMULA ResAllocation-PT-R003C050-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t_41_0) OR NOT FIREABLE(t_38_3) OR FIREABLE(t_42_2) OR NOT FIREABLE(t_7_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(t_41_0) OR NOT FIREABLE(t_38_3) OR FIREABLE(t_42_2) OR NOT FIREABLE(t_7_1))))
lola: processed formula length: 100
lola: 2 rewrites
lola: closed formula file ResAllocation-PT-R003C050-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(t_41_0) AND FIREABLE(t_38_3) AND NOT FIREABLE(t_42_2) AND FIREABLE(t_7_1))
lola: state equation: Generated DNF with 18 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 9 markings, 8 edges
lola: ========================================

FORMULA ResAllocation-PT-R003C050-ReachabilityFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 444 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t_35_0) AND FIREABLE(t_6_3) AND (FIREABLE(t_36_0) OR FIREABLE(t_27_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(t_35_0) AND FIREABLE(t_6_3) AND (FIREABLE(t_36_0) OR FIREABLE(t_27_2)))))
lola: processed formula length: 90
lola: 1 rewrites
lola: closed formula file ResAllocation-PT-R003C050-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(t_35_0) AND FIREABLE(t_6_3) AND (FIREABLE(t_36_0) OR FIREABLE(t_27_2)))
lola: state equation: Generated DNF with 9 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 8 markings, 8 edges
lola: state equation: write sara problem file to ResAllocation-PT-R003C050-ReachabilityFireability-8-0.sara
lola: ========================================

FORMULA ResAllocation-PT-R003C050-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 507 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t_14_2) AND (NOT FIREABLE(t_37_2) OR NOT FIREABLE(t_21_2))) OR NOT FIREABLE(t_13_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(t_14_2) AND (NOT FIREABLE(t_37_2) OR NOT FIREABLE(t_21_2))) OR NOT FIREABLE(t_13_2))))
lola: processed formula length: 109
lola: 2 rewrites
lola: closed formula file ResAllocation-PT-R003C050-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(t_14_2) OR (FIREABLE(t_37_2) AND FIREABLE(t_21_2))) AND FIREABLE(t_13_2))
lola: state equation: Generated DNF with 15 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ResAllocation-PT-R003C050-ReachabilityFireability-9-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 4 markings, 3 edges
lola: ========================================
lola: state equation: calling and running sara

FORMULA ResAllocation-PT-R003C050-ReachabilityFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 592 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t_32_0) OR (FIREABLE(t_22_0) AND FIREABLE(t_22_1)) OR NOT FIREABLE(t_3_2) OR (NOT FIREABLE(t_0_2) AND NOT FIREABLE(t_34_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(t_32_0) OR (FIREABLE(t_22_0) AND FIREABLE(t_22_1)) OR NOT FIREABLE(t_3_2) OR (NOT FIREABLE(t_0_2) AND NOT FIREABLE(t_34_3)))))
lola: processed formula length: 149
lola: 2 rewrites
lola: closed formula file ResAllocation-PT-R003C050-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(t_32_0) AND (NOT FIREABLE(t_22_0) OR NOT FIREABLE(t_22_1)) AND FIREABLE(t_3_2) AND (FIREABLE(t_0_2) OR FIREABLE(t_34_3)))
lola: state equation: Generated DNF with 75 literals and 10 conjunctive subformulas
lola: state equation: write sara problem file to ResAllocation-PT-R003C050-ReachabilityFireability-10-0.sara
sara: try reading problem file ResAllocation-PT-R003C050-ReachabilityFireability-9-0.sara.
lola: state equation: calling and running sara
sara: try reading problem file ResAllocation-PT-R003C050-ReachabilityFireability-10-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 ResAllocation-PT-R003C050-ReachabilityFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 711 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t_18_2) OR NOT FIREABLE(t_11_2) OR NOT FIREABLE(t_25_0) OR (NOT FIREABLE(t_27_0) AND NOT FIREABLE(t_5_2) AND (NOT FIREABLE(t_48_1) OR NOT FIREABLE(t_32_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(t_18_2) OR NOT FIREABLE(t_11_2) OR NOT FIREABLE(t_25_0) OR (NOT FIREABLE(t_27_0) AND NOT FIREABLE(t_5_2) AND (NOT FIREABLE(t_48_1) OR NOT FIREABLE(t_32_2))))))
lola: processed formula length: 183
lola: 2 rewrites
lola: closed formula file ResAllocation-PT-R003C050-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(t_18_2) AND FIREABLE(t_11_2) AND FIREABLE(t_25_0) AND (FIREABLE(t_27_0) OR FIREABLE(t_5_2) OR (FIREABLE(t_48_1) AND FIREABLE(t_32_2))))
lola: state equation: Generated DNF with 31 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to ResAllocation-PT-R003C050-ReachabilityFireability-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ResAllocation-PT-R003C050-ReachabilityFireability-11-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 8 markings, 7 edges
lola: ========================================

FORMULA ResAllocation-PT-R003C050-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: subprocess 12 will run for 888 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t_8_0) OR ((FIREABLE(t_5_0) OR FIREABLE(t_11_2)) AND NOT FIREABLE(t_49_2)) OR NOT FIREABLE(t_21_1) OR NOT FIREABLE(t_27_0) OR NOT FIREABLE(t_46_0))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((NOT FIREABLE(t_8_0) OR ((FIREABLE(t_5_0) OR FIREABLE(t_11_2)) AND NOT FIREABLE(t_49_2)) OR NOT FIREABLE(t_21_1) OR NOT FIREABLE(t_27_0) OR NOT FIREABLE(t_46_0))))
lola: processed formula length: 174
lola: 2 rewrites
lola: closed formula file ResAllocation-PT-R003C050-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(t_8_0) AND ((NOT FIREABLE(t_5_0) AND NOT FIREABLE(t_11_2)) OR FIREABLE(t_49_2)) AND FIREABLE(t_21_1) AND FIREABLE(t_27_0) AND FIREABLE(t_46_0))
lola: state equation: Generated DNF with 41 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation: write sara problem file to ResAllocation-PT-R003C050-ReachabilityFireability-12-0.sara
lola: 6 markings, 5 edges
lola: ========================================

FORMULA ResAllocation-PT-R003C050-ReachabilityFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1185 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t_38_0) AND FIREABLE(t_4_3) AND FIREABLE(t_29_2) AND FIREABLE(t_39_1) AND FIREABLE(t_7_1) AND FIREABLE(t_35_1) AND FIREABLE(t_37_1) AND FIREABLE(t_0_0))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((FIREABLE(t_38_0) AND FIREABLE(t_4_3) AND FIREABLE(t_29_2) AND FIREABLE(t_39_1) AND FIREABLE(t_7_1) AND FIREABLE(t_35_1) AND FIREABLE(t_37_1) AND FIREABLE(t_0_0))))
lola: processed formula length: 170
lola: 1 rewrites
lola: closed formula file ResAllocation-PT-R003C050-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(t_38_0) AND FIREABLE(t_4_3) AND FIREABLE(t_29_2) AND FIREABLE(t_39_1) AND FIREABLE(t_7_1) AND FIREABLE(t_35_1) AND FIREABLE(t_37_1) AND FIREABLE(t_0_0))
lola: state equation: Generated DNF with 19 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ResAllocation-PT-R003C050-ReachabilityFireability-13-0.sara
lola: lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 13 markings, 12 edges
lola: ========================================

FORMULA ResAllocation-PT-R003C050-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1777 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t_25_2) OR FIREABLE(t_25_0) OR (FIREABLE(t_46_2) AND FIREABLE(t_4_3)) OR (FIREABLE(t_37_2) AND FIREABLE(t_35_2) AND NOT FIREABLE(t_35_0))) AND FIREABLE(t_47_0))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((FIREABLE(t_25_2) OR FIREABLE(t_25_0) OR (FIREABLE(t_46_2) AND FIREABLE(t_4_3)) OR (FIREABLE(t_37_2) AND FIREABLE(t_35_2) AND NOT FIREABLE(t_35_0))) AND FIREABLE(t_47_0))))
lola: processed formula length: 182
lola: 1 rewrites
lola: closed formula file ResAllocation-PT-R003C050-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(t_25_2) OR FIREABLE(t_25_0) OR (FIREABLE(t_46_2) AND FIREABLE(t_4_3)) OR (FIREABLE(t_37_2) AND FIREABLE(t_35_2) AND NOT FIREABLE(t_35_0))) AND FIREABLE(t_47_0))
lola: state equation: Generated DNF with 19 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 4 edges
lola: state equation: write sara problem file to ResAllocation-PT-R003C050-ReachabilityFireability-14-0.sara

FORMULA ResAllocation-PT-R003C050-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 15 will run for 3555 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t_19_2) OR FIREABLE(t_47_2) OR FIREABLE(t_35_3) OR FIREABLE(t_16_3) OR NOT FIREABLE(t_47_1) OR (NOT FIREABLE(t_27_2) AND NOT FIREABLE(t_21_1) AND (NOT FIREABLE(t_39_1) OR (FIREABLE(t_8_3) AND FIREABLE(t_19_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(t_19_2) OR FIREABLE(t_47_2) OR FIREABLE(t_35_3) OR FIREABLE(t_16_3) OR NOT FIREABLE(t_47_1) OR (NOT FIREABLE(t_27_2) AND NOT FIREABLE(t_21_1) AND (NOT FIREABLE(t_39_1) OR (FIREABLE(t_8_3) AND FIREABLE(t_19_2)))))))
lola: processed formula length: 236
lola: 2 rewrites
lola: closed formula file ResAllocation-PT-R003C050-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(t_19_2) AND NOT FIREABLE(t_47_2) AND NOT FIREABLE(t_35_3) AND NOT FIREABLE(t_16_3) AND FIREABLE(t_47_1) AND (FIREABLE(t_27_2) OR FIREABLE(t_21_1) OR (FIREABLE(t_39_1) AND (NOT FIREABLE(t_8_3) OR NOT FIREABLE(t_19_2)))))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 5 markings, 4 edges
lola: ========================================

FORMULA ResAllocation-PT-R003C050-ReachabilityFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes yes yes no yes yes no no yes no yes yes yes no no
lola:
preliminary result: no yes yes yes no yes yes no no yes no yes yes yes no no
lola: memory consumption: 14988 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="ResAllocation-PT-R003C050"
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/ResAllocation-PT-R003C050.tgz
mv ResAllocation-PT-R003C050 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 ResAllocation-PT-R003C050, 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-152673579200371"
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 ;