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 368K
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K 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 6.3K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.4K 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 8.5K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K 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 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.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K 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 202K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is ResAllocation-PT-R050C002, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-qhx2-152673579200413
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527018375146

info: Time: 3600 - MCC
===========================================================================================
prep: translating ResAllocation-PT-R050C002 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-R050C002 formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ ResAllocation-PT-R050C002 @ 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: 302/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 200
lola: finding significant places
lola: 200 places, 102 transitions, 100 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 152 transition conflict sets
lola: TASK
lola: reading formula from ResAllocation-PT-R050C002-ReachabilityFireability.task
lola: A (G ((((NOT FIREABLE(t_0_49) OR NOT FIREABLE(t_0_2)) AND (NOT FIREABLE(t_1_19) OR NOT FIREABLE(t_1_38))) OR NOT FIREABLE(t_0_39)))) : E (F (((FIREABLE(t_1_12) AND FIREABLE(t_0_5) AND (FIREABLE(t_0_10) OR FIREABLE(t_1_1)) AND FIREABLE(t_0_46) AND NOT FIREABLE(t_1_11)) OR FIREABLE(t_1_0)))) : E (F ((FIREABLE(t_0_11) AND FIREABLE(t_0_24)))) : E (F ((NOT FIREABLE(t_1_20) AND NOT FIREABLE(t_1_34) AND NOT FIREABLE(t_1_12) AND FIREABLE(t_0_39)))) : E (F (FIREABLE(t_0_38))) : E (F (FIREABLE(t_1_16))) : E (F ((((FIREABLE(t_1_35) AND (FIREABLE(t_1_36) OR FIREABLE(t_0_15))) OR FIREABLE(t_1_6)) AND (NOT FIREABLE(t_0_17) OR NOT FIREABLE(t_0_5) OR FIREABLE(t_0_7))))) : E (F ((NOT FIREABLE(t_1_40) AND (FIREABLE(t_0_13) OR FIREABLE(t_1_16)) AND FIREABLE(t_0_37) AND (NOT FIREABLE(t_0_27) OR NOT FIREABLE(t_1_37) OR (NOT FIREABLE(t_1_49) AND NOT FIREABLE(t_1_0)))))) : E (F (((FIREABLE(t_0_27) OR FIREABLE(t_1_0)) AND NOT FIREABLE(t_0_33)))) : E (F (FIREABLE(t_1_18))) : A (G ((((NOT FIREABLE(t_0_10) AND (FIREABLE(t_1_14) OR FIREABLE(t_0_28))) OR NOT FIREABLE(t_1_32)) AND NOT FIREABLE(t_1_19)))) : E (F (FIREABLE(t_0_24))) : A (G (((FIREABLE(t_0_19) AND (NOT FIREABLE(t_0_16) OR NOT FIREABLE(t_0_34))) OR NOT FIREABLE(t_1_24)))) : E (F (FIREABLE(t_0_32))) : E (F (((FIREABLE(t_1_40) OR FIREABLE(t_0_45) OR NOT FIREABLE(t_1_12)) AND (FIREABLE(t_1_0) OR (FIREABLE(t_0_36) AND FIREABLE(t_0_20))) AND (FIREABLE(t_0_31) OR (NOT FIREABLE(t_0_5) AND NOT FIREABLE(t_0_34)))))) : E (F (FIREABLE(t_0_30)))
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(t_0_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(t_0_38)))
lola: processed formula length: 24
lola: 1 rewrites
lola: closed formula file ResAllocation-PT-R050C002-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_0_38)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ResAllocation-PT-R050C002-ReachabilityFireability-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 39 markings, 38 edges

FORMULA ResAllocation-PT-R050C002-ReachabilityFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t_1_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(t_1_16)))
lola: processed formula length: 24
lola: 1 rewrites
lola: closed formula file ResAllocation-PT-R050C002-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_1_16)
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ResAllocation-PT-R050C002-ReachabilityFireability-0.sara
lola: state equation: calling and running sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 35 markings, 34 edges
lola: ========================================

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

FORMULA ResAllocation-PT-R050C002-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
sara: place or transition ordering is non-deterministic
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t_0_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(t_0_24)))
lola: processed formula length: 24
lola: 1 rewrites
lola: closed formula file ResAllocation-PT-R050C002-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_0_24)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 25 markings, 24 edges
lola: state equation: write sara problem file to ResAllocation-PT-R050C002-ReachabilityFireability-3-0.sara
lola: ========================================

FORMULA ResAllocation-PT-R050C002-ReachabilityFireability-11 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(t_0_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(t_0_32)))
lola: processed formula length: 24
lola: 1 rewrites
lola: closed formula file ResAllocation-PT-R050C002-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: 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: state equation: calling and running sara

sara: try reading problem file ResAllocation-PT-R050C002-ReachabilityFireability-3-0.sara.
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: FIREABLE(t_0_32)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
sara: place or transition ordering is non-deterministic
lola:
state equation: write sara problem file to ResAllocation-PT-R050C002-ReachabilityFireability-4-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 33 markings, 32 edges
lola: ========================================

FORMULA ResAllocation-PT-R050C002-ReachabilityFireability-13 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(t_0_30)))
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_0_30)))
lola: processed formula length: 24
lola: 1 rewrites
lola: closed formula file ResAllocation-PT-R050C002-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_0_30)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: write sara problem file to ResAllocation-PT-R050C002-ReachabilityFireability-5-0.sara
lola: The predicate is reachable.
lola: 31 markings, 30 edges
lola: ========================================

FORMULA ResAllocation-PT-R050C002-ReachabilityFireability-15 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(t_0_11) AND FIREABLE(t_0_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(t_0_11) AND FIREABLE(t_0_24))))
lola: processed formula length: 47
lola: 1 rewrites
lola: closed formula file ResAllocation-PT-R050C002-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_0_11) AND FIREABLE(t_0_24))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ResAllocation-PT-R050C002-ReachabilityFireability-6-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 36 markings, 35 edges
lola:
FORMULA ResAllocation-PT-R050C002-ReachabilityFireability-2 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(t_0_27) OR FIREABLE(t_1_0)) AND NOT FIREABLE(t_0_33))))
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_0_27) OR FIREABLE(t_1_0)) AND NOT FIREABLE(t_0_33))))
lola: processed formula length: 73
lola: 1 rewrites
lola: closed formula file ResAllocation-PT-R050C002-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_0_27) OR FIREABLE(t_1_0)) AND NOT FIREABLE(t_0_33))
lola: state equation: Generated DNF with 10 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to ResAllocation-PT-R050C002-ReachabilityFireability-7-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 28 markings, 27 edges

FORMULA ResAllocation-PT-R050C002-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t_1_20) AND NOT FIREABLE(t_1_34) AND NOT FIREABLE(t_1_12) AND FIREABLE(t_0_39))))
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(t_1_20) AND NOT FIREABLE(t_1_34) AND NOT FIREABLE(t_1_12) AND FIREABLE(t_0_39))))
lola: processed formula length: 101
lola: 1 rewrites
lola: closed formula file ResAllocation-PT-R050C002-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
sara: try reading problem file ResAllocation-PT-R050C002-ReachabilityFireability-7-0.sara.
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (NOT FIREABLE(t_1_20) AND NOT FIREABLE(t_1_34) AND NOT FIREABLE(t_1_12) AND FIREABLE(t_0_39))
lola: state equation: Generated DNF with 135 literals and 27 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 40 markings, 39 edges
lola: state equation: write sara problem file to ResAllocation-PT-R050C002-ReachabilityFireability-8-0.sara
lola: ========================================

FORMULA ResAllocation-PT-R050C002-ReachabilityFireability-3 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: A (G (((FIREABLE(t_0_19) AND (NOT FIREABLE(t_0_16) OR NOT FIREABLE(t_0_34))) OR NOT FIREABLE(t_1_24))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
sara: place or transition ordering is non-deterministic
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((FIREABLE(t_0_19) AND (NOT FIREABLE(t_0_16) OR NOT FIREABLE(t_0_34))) OR NOT FIREABLE(t_1_24))))
lola: processed formula length: 105
lola: 2 rewrites
lola: closed formula file ResAllocation-PT-R050C002-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_0_19) OR (FIREABLE(t_0_16) AND FIREABLE(t_0_34))) AND FIREABLE(t_1_24))
lola: state equation: Generated DNF with 15 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to ResAllocation-PT-R050C002-ReachabilityFireability-9-0.sara

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

FORMULA ResAllocation-PT-R050C002-ReachabilityFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((NOT FIREABLE(t_0_49) OR NOT FIREABLE(t_0_2)) AND (NOT FIREABLE(t_1_19) OR NOT FIREABLE(t_1_38))) OR NOT FIREABLE(t_0_39))))
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_0_49) OR NOT FIREABLE(t_0_2)) AND (NOT FIREABLE(t_1_19) OR NOT FIREABLE(t_1_38))) OR NOT FIREABLE(t_0_39))))
lola: processed formula length: 135
lola: 2 rewrites
lola: closed formula file ResAllocation-PT-R050C002-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_0_49) AND FIREABLE(t_0_2)) OR (FIREABLE(t_1_19) AND FIREABLE(t_1_38))) AND FIREABLE(t_0_39))
lola: state equation: Generated DNF with 14 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ResAllocation-PT-R050C002-ReachabilityFireability-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ResAllocation-PT-R050C002-ReachabilityFireability-10-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================

FORMULA ResAllocation-PT-R050C002-ReachabilityFireability-0 FALSE 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(t_0_10) AND (FIREABLE(t_1_14) OR FIREABLE(t_0_28))) OR NOT FIREABLE(t_1_32)) AND NOT FIREABLE(t_1_19))))
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_0_10) AND (FIREABLE(t_1_14) OR FIREABLE(t_0_28))) OR NOT FIREABLE(t_1_32)) AND NOT FIREABLE(t_1_19))))
lola: processed formula length: 128
lola: 2 rewrites
lola: closed formula file ResAllocation-PT-R050C002-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_0_10) OR (NOT FIREABLE(t_1_14) AND NOT FIREABLE(t_0_28))) AND FIREABLE(t_1_32)) OR FIREABLE(t_1_19))
lola: state equation: Generated DNF with 38 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to ResAllocation-PT-R050C002-ReachabilityFireability-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ResAllocation-PT-R050C002-ReachabilityFireability-11-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 19 markings, 18 edges
lola: ========================================

FORMULA ResAllocation-PT-R050C002-ReachabilityFireability-10 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(t_1_35) AND (FIREABLE(t_1_36) OR FIREABLE(t_0_15))) OR FIREABLE(t_1_6)) AND (NOT FIREABLE(t_0_17) OR NOT FIREABLE(t_0_5) OR FIREABLE(t_0_7)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((((FIREABLE(t_1_35) AND (FIREABLE(t_1_36) OR FIREABLE(t_0_15))) OR FIREABLE(t_1_6)) AND (NOT FIREABLE(t_0_17) OR NOT FIREABLE(t_0_5) OR FIREABLE(t_0_7)))))
lola: processed formula length: 165
lola: 1 rewrites
lola: closed formula file ResAllocation-PT-R050C002-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_1_35) AND (FIREABLE(t_1_36) OR FIREABLE(t_0_15))) OR FIREABLE(t_1_6)) AND (NOT FIREABLE(t_0_17) OR NOT FIREABLE(t_0_5) OR FIREABLE(t_0_7)))
lola: state equation: Generated DNF with 84 literals and 14 conjunctive subformulas
lola: state equation: write sara problem file to ResAllocation-PT-R050C002-ReachabilityFireability-12-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: 389 markings, 388 edges
lola: ========================================

FORMULA ResAllocation-PT-R050C002-ReachabilityFireability-6 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: E (F (((FIREABLE(t_1_12) AND FIREABLE(t_0_5) AND (FIREABLE(t_0_10) OR FIREABLE(t_1_1)) AND FIREABLE(t_0_46) AND NOT FIREABLE(t_1_11)) OR FIREABLE(t_1_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_1_12) AND FIREABLE(t_0_5) AND (FIREABLE(t_0_10) OR FIREABLE(t_1_1)) AND FIREABLE(t_0_46) AND NOT FIREABLE(t_1_11)) OR FIREABLE(t_1_0))))
lola: processed formula length: 157
lola: 1 rewrites
lola: closed formula file ResAllocation-PT-R050C002-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_1_12) AND FIREABLE(t_0_5) AND (FIREABLE(t_0_10) OR FIREABLE(t_1_1)) AND FIREABLE(t_0_46) AND NOT FIREABLE(t_1_11)) OR FIREABLE(t_1_0))
lola: state equation: Generated DNF with 54 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to ResAllocation-PT-R050C002-ReachabilityFireability-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ResAllocation-PT-R050C002-ReachabilityFireability-13-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 681479 markings, 2563999 edges, 136296 markings/sec, 0 secs
lola: sara is running 5 secs || 1301633 markings, 5016126 edges, 124031 markings/sec, 5 secs
lola: sara is running 10 secs || 1914551 markings, 7474398 edges, 122584 markings/sec, 10 secs
lola: sara is running 15 secs || 2495707 markings, 9854085 edges, 116231 markings/sec, 15 secs
lola: sara is running 20 secs || 3104015 markings, 12221794 edges, 121662 markings/sec, 20 secs
lola: sara is running 25 secs || 3665074 markings, 14540670 edges, 112212 markings/sec, 25 secs
lola: sara is running 30 secs || 4241218 markings, 16902476 edges, 115229 markings/sec, 30 secs
lola: sara is running 35 secs || 4821576 markings, 19236761 edges, 116072 markings/sec, 35 secs
lola: sara is running 40 secs || 5398334 markings, 21574618 edges, 115352 markings/sec, 40 secs
lola: sara is running 45 secs || 5970132 markings, 23927999 edges, 114360 markings/sec, 45 secs
lola: sara is running 50 secs || 6538560 markings, 26306484 edges, 113686 markings/sec, 50 secs
lola: sara is running 55 secs || 7077448 markings, 28590802 edges, 107778 markings/sec, 55 secs
lola: sara is running 60 secs || 7633944 markings, 30907405 edges, 111299 markings/sec, 60 secs
lola: sara is running 65 secs || 8160813 markings, 33097535 edges, 105374 markings/sec, 65 secs
lola: sara is running 70 secs || 8702717 markings, 35326755 edges, 108381 markings/sec, 70 secs
lola: sara is running 75 secs || 9222442 markings, 37534054 edges, 103945 markings/sec, 75 secs
lola: sara is running 80 secs || 9792169 markings, 39883567 edges, 113945 markings/sec, 80 secs
lola: sara is running 85 secs || 10339850 markings, 42126505 edges, 109536 markings/sec, 85 secs
lola: sara is running 90 secs || 10883237 markings, 44448512 edges, 108677 markings/sec, 90 secs
lola: sara is running 95 secs || 11451094 markings, 46762098 edges, 113571 markings/sec, 95 secs
lola: sara is running 100 secs || 12003638 markings, 49022984 edges, 110509 markings/sec, 100 secs
lola: sara is running 105 secs || 12552693 markings, 51263431 edges, 109811 markings/sec, 105 secs
lola: sara is running 110 secs || 13104925 markings, 53509842 edges, 110446 markings/sec, 110 secs
lola: sara is running 115 secs || 13629414 markings, 55852923 edges, 104898 markings/sec, 115 secs
lola: sara is running 120 secs || 14166346 markings, 58038023 edges, 107386 markings/sec, 120 secs
lola: sara is running 125 secs || 14706375 markings, 60231086 edges, 108006 markings/sec, 125 secs
lola: sara is running 130 secs || 15241804 markings, 62465184 edges, 107086 markings/sec, 130 secs
lola: sara is running 135 secs || 15766039 markings, 64643366 edges, 104847 markings/sec, 135 secs
lola: sara is running 140 secs || 16284959 markings, 66876384 edges, 103784 markings/sec, 140 secs
lola: sara is running 145 secs || 16811410 markings, 69089246 edges, 105290 markings/sec, 145 secs
lola: sara is running 150 secs || 17302030 markings, 71226123 edges, 98124 markings/sec, 150 secs
lola: sara is running 155 secs || 17832901 markings, 73414593 edges, 106174 markings/sec, 155 secs
lola: sara is running 160 secs || 18338263 markings, 75617002 edges, 101072 markings/sec, 160 secs
lola: sara is running 165 secs || 18860335 markings, 77811004 edges, 104414 markings/sec, 165 secs
lola: sara is running 170 secs || 19299125 markings, 79821881 edges, 87758 markings/sec, 170 secs
lola: sara is running 175 secs || 19726246 markings, 81707840 edges, 85424 markings/sec, 175 secs
lola: sara is running 180 secs || 20120940 markings, 83478335 edges, 78939 markings/sec, 180 secs
lola: sara is running 185 secs || 20496466 markings, 85223193 edges, 75105 markings/sec, 185 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 20582342 markings, 86577948 edges

FORMULA ResAllocation-PT-R050C002-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1687 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t_1_40) AND (FIREABLE(t_0_13) OR FIREABLE(t_1_16)) AND FIREABLE(t_0_37) AND (NOT FIREABLE(t_0_27) OR NOT FIREABLE(t_1_37) OR (NOT FIREABLE(t_1_49) AND NOT FIREABLE(t_1_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 ((NOT FIREABLE(t_1_40) AND (FIREABLE(t_0_13) OR FIREABLE(t_1_16)) AND FIREABLE(t_0_37) AND (NOT FIREABLE(t_0_27) OR NOT FIREABLE(t_1_37) OR (NOT FIREABLE(t_1_49) AND NOT FIREABLE(t_1_0))))))
lola: processed formula length: 198
lola: 1 rewrites
lola: closed formula file ResAllocation-PT-R050C002-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: 51 markings, 50 edges
lola: ========================================

FORMULA ResAllocation-PT-R050C002-ReachabilityFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 15 will run for 3375 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t_1_40) OR FIREABLE(t_0_45) OR NOT FIREABLE(t_1_12)) AND (FIREABLE(t_1_0) OR (FIREABLE(t_0_36) AND FIREABLE(t_0_20))) AND (FIREABLE(t_0_31) OR (NOT FIREABLE(t_0_5) AND NOT FIREABLE(t_0_34))))))
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_1_40) OR FIREABLE(t_0_45) OR NOT FIREABLE(t_1_12)) AND (FIREABLE(t_1_0) OR (FIREABLE(t_0_36) AND FIREABLE(t_0_20))) AND (FIREABLE(t_0_31) OR (NOT FIREABLE(t_0_5) AND NOT FIREABLE(t_0_34))))))
lola: processed formula length: 214
lola: 1 rewrites
lola: closed formula file ResAllocation-PT-R050C002-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_1_40) OR FIREABLE(t_0_45) OR NOT FIREABLE(t_1_12)) AND (FIREABLE(t_1_0) OR (FIREABLE(t_0_36) AND FIREABLE(t_0_20))) AND (FIREABLE(t_0_31) OR (NOT FIREABLE(t_0_5) AND NOT FIREABLE(t_0_34))))
lola: state equation: Generated DNF with 305 literals and 50 conjunctive subformulas
lola: state equation: write sara problem file to ResAllocation-PT-R050C002-ReachabilityFireability-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ResAllocation-PT-R050C002-ReachabilityFireability-15-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 57 markings, 56 edges
lola: ========================================

FORMULA ResAllocation-PT-R050C002-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes yes yes yes yes yes yes yes yes no yes no yes yes yes
lola:
preliminary result: no yes yes yes yes yes yes yes yes yes no yes no yes yes yes
lola: memory consumption: 14744 KB
lola: time consumption: 194 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-R050C002"
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-R050C002.tgz
mv ResAllocation-PT-R050C002 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-R050C002, 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-152673579200413"
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 ;