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 256K
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K 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 22K 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.6K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.7K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K 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 3.0K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K 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 81K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is ResAllocation-PT-R020C002, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-qhx2-152673579200406
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527015773714

info: Time: 3600 - MCC
===========================================================================================
prep: translating ResAllocation-PT-R020C002 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-R020C002 formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ ResAllocation-PT-R020C002 @ 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: 122/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 80
lola: finding significant places
lola: 80 places, 42 transitions, 40 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 62 transition conflict sets
lola: TASK
lola: reading formula from ResAllocation-PT-R020C002-ReachabilityFireability.task
lola: A (G (((NOT FIREABLE(t_0_17) AND NOT FIREABLE(t_1_9)) OR (NOT FIREABLE(t_1_7) AND NOT FIREABLE(t_0_11)) OR FIREABLE(t_0_18) OR FIREABLE(t_0_8) OR FIREABLE(t_0_15)))) : A (G (((FIREABLE(t_1_4) AND FIREABLE(t_1_20)) OR NOT FIREABLE(t_1_8) OR NOT FIREABLE(t_1_19) OR NOT FIREABLE(t_1_2) OR (NOT FIREABLE(t_0_12) AND NOT FIREABLE(t_0_0)) OR FIREABLE(t_0_16)))) : A (G (((NOT FIREABLE(t_0_20) AND NOT FIREABLE(t_0_19)) OR (FIREABLE(t_0_16) AND FIREABLE(t_1_11) AND FIREABLE(t_0_6)) OR FIREABLE(t_0_4)))) : E (F (((FIREABLE(t_1_1) OR (FIREABLE(t_1_5) AND FIREABLE(t_0_17))) AND FIREABLE(t_0_6) AND FIREABLE(t_1_9)))) : E (F (((NOT FIREABLE(t_0_14) OR NOT FIREABLE(t_1_8)) AND FIREABLE(t_1_0) AND FIREABLE(t_1_2)))) : A (G (NOT FIREABLE(t_0_17))) : E (F ((FIREABLE(t_0_20) AND (FIREABLE(t_1_17) OR FIREABLE(t_1_6))))) : A (G ((NOT FIREABLE(t_1_18) OR NOT FIREABLE(t_0_18) OR FIREABLE(t_0_0) OR FIREABLE(t_0_16)))) : E (F (FIREABLE(t_1_1))) : E (F ((NOT FIREABLE(t_0_6) AND NOT FIREABLE(t_1_14) AND NOT FIREABLE(t_0_3) AND FIREABLE(t_1_8) AND FIREABLE(t_1_4) AND (FIREABLE(t_1_16) OR FIREABLE(t_0_16)) AND (FIREABLE(t_1_14) OR FIREABLE(t_0_6) OR (FIREABLE(t_0_0) AND FIREABLE(t_1_0)))))) : A (G (NOT FIREABLE(t_0_16))) : A (G (NOT FIREABLE(t_0_17))) : E (F ((FIREABLE(t_1_6) AND FIREABLE(t_0_19) AND NOT FIREABLE(t_1_10)))) : E (F (((FIREABLE(t_1_20) AND FIREABLE(t_0_18)) OR FIREABLE(t_1_2)))) : E (F ((((FIREABLE(t_0_3) OR FIREABLE(t_1_6)) AND (FIREABLE(t_1_14) OR FIREABLE(t_1_16)) AND FIREABLE(t_0_11)) OR ((FIREABLE(t_0_10) OR (FIREABLE(t_0_8) AND FIREABLE(t_1_2))) AND FIREABLE(t_1_12))))) : A (G ((NOT FIREABLE(t_0_5) OR NOT FIREABLE(t_0_13) OR (FIREABLE(t_1_9) AND FIREABLE(t_0_7) AND NOT FIREABLE(t_0_12)) OR NOT FIREABLE(t_1_4) OR NOT FIREABLE(t_1_13) OR NOT FIREABLE(t_1_8) OR NOT FIREABLE(t_1_4))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t_0_17)))
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_17)))
lola: processed formula length: 28
lola: 2 rewrites
lola: closed formula file ResAllocation-PT-R020C002-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_17)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ResAllocation-PT-R020C002-ReachabilityFireability-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 ResAllocation-PT-R020C002-ReachabilityFireability-5 FALSE 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_1_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(t_1_1)))
lola: processed formula length: 23
lola: 1 rewrites
lola: closed formula file ResAllocation-PT-R020C002-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_1)
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 20 markings, 19 edges
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: ========================================

FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-8 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: A (G (NOT FIREABLE(t_0_16)))
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_16)))
lola: processed formula length: 28
lola: 2 rewrites
lola: closed formula file ResAllocation-PT-R020C002-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_16)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ResAllocation-PT-R020C002-ReachabilityFireability-2-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 17 markings, 16 edges
lola: ========================================

FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t_0_17)))
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_17)))
lola: processed formula length: 28
lola: 2 rewrites
lola: closed formula file ResAllocation-PT-R020C002-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_17)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 18 markings, 17 edges
lola: ========================================

FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t_0_20) AND (FIREABLE(t_1_17) OR FIREABLE(t_1_6)))))
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_20) AND (FIREABLE(t_1_17) OR FIREABLE(t_1_6)))))
lola: processed formula length: 69
lola: 1 rewrites
lola: closed formula file ResAllocation-PT-R020C002-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_20) AND (FIREABLE(t_1_17) OR FIREABLE(t_1_6)))
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ResAllocation-PT-R020C002-ReachabilityFireability-4-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 690 markings, 1682 edges
lola: ========================================

FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t_1_6) AND FIREABLE(t_0_19) AND NOT FIREABLE(t_1_10))))
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_6) AND FIREABLE(t_0_19) AND NOT FIREABLE(t_1_10))))
lola: processed formula length: 71
lola: 1 rewrites
lola: closed formula file ResAllocation-PT-R020C002-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_6) AND FIREABLE(t_0_19) AND NOT FIREABLE(t_1_10))
lola: state equation: Generated DNF with 18 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to ResAllocation-PT-R020C002-ReachabilityFireability-5-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1147 markings, 2776 edges
lola:
FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t_1_20) AND FIREABLE(t_0_18)) OR FIREABLE(t_1_2))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((FIREABLE(t_1_20) AND FIREABLE(t_0_18)) OR FIREABLE(t_1_2))))
lola: processed formula length: 69
lola: 1 rewrites
lola: closed formula file ResAllocation-PT-R020C002-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_20) AND FIREABLE(t_0_18)) OR FIREABLE(t_1_2))
lola: state equation: Generated DNF with 7 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 19 markings, 18 edges
lola: state equation: write sara problem file to ResAllocation-PT-R020C002-ReachabilityFireability-6-0.sara
lola: ========================================

FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t_1_18) OR NOT FIREABLE(t_0_18) OR FIREABLE(t_0_0) OR FIREABLE(t_0_16))))
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_1_18) OR NOT FIREABLE(t_0_18) OR FIREABLE(t_0_0) OR FIREABLE(t_0_16))))
lola: processed formula length: 96
lola: 2 rewrites
lola: closed formula file ResAllocation-PT-R020C002-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_1_18) AND FIREABLE(t_0_18) AND NOT FIREABLE(t_0_0) AND NOT FIREABLE(t_0_16))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: Generated DNF with 14 literals and 2 conjunctive subformulas
lola: The predicate is invariant.
lola: 1116 markings, 2790 edges
lola:
FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
state equation: write sara problem file to ResAllocation-PT-R020C002-ReachabilityFireability-7-0.sara
lola: ========================================
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(t_0_14) OR NOT FIREABLE(t_1_8)) AND FIREABLE(t_1_0) AND FIREABLE(t_1_2))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((NOT FIREABLE(t_0_14) OR NOT FIREABLE(t_1_8)) AND FIREABLE(t_1_0) AND FIREABLE(t_1_2))))
lola: processed formula length: 96
lola: 1 rewrites
lola: closed formula file ResAllocation-PT-R020C002-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(t_0_14) OR NOT FIREABLE(t_1_8)) AND FIREABLE(t_1_0) AND FIREABLE(t_1_2))
lola: state equation: Generated DNF with 25 literals and 5 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 39 markings, 38 edges

FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: write sara problem file to ResAllocation-PT-R020C002-ReachabilityFireability-8-0.sara
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t_1_1) OR (FIREABLE(t_1_5) AND FIREABLE(t_0_17))) AND FIREABLE(t_0_6) AND FIREABLE(t_1_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(t_1_1) OR (FIREABLE(t_1_5) AND FIREABLE(t_0_17))) AND FIREABLE(t_0_6) AND FIREABLE(t_1_9))))
lola: processed formula length: 110
lola: 1 rewrites
lola: closed formula file ResAllocation-PT-R020C002-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_1) OR (FIREABLE(t_1_5) AND FIREABLE(t_0_17))) AND FIREABLE(t_0_6) AND FIREABLE(t_1_9))
lola: state equation: Generated DNF with 18 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ResAllocation-PT-R020C002-ReachabilityFireability-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ResAllocation-PT-R020C002-ReachabilityFireability-9-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 42593 markings, 140476 edges
lola: ========================================

FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-3 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_20) AND NOT FIREABLE(t_0_19)) OR (FIREABLE(t_0_16) AND FIREABLE(t_1_11) AND FIREABLE(t_0_6)) OR FIREABLE(t_0_4))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((NOT FIREABLE(t_0_20) AND NOT FIREABLE(t_0_19)) OR (FIREABLE(t_0_16) AND FIREABLE(t_1_11) AND FIREABLE(t_0_6)) OR FIREABLE(t_0_4))))
lola: processed formula length: 141
lola: 2 rewrites
lola: closed formula file ResAllocation-PT-R020C002-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_20) OR FIREABLE(t_0_19)) AND (NOT FIREABLE(t_0_16) OR NOT FIREABLE(t_1_11) OR NOT FIREABLE(t_0_6)) AND NOT FIREABLE(t_0_4))
lola: state equation: Generated DNF with 98 literals and 28 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 20 markings, 19 edges
lola: state equation: write sara problem file to ResAllocation-PT-R020C002-ReachabilityFireability-10-0.sara

FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t_0_17) AND NOT FIREABLE(t_1_9)) OR (NOT FIREABLE(t_1_7) AND NOT FIREABLE(t_0_11)) OR FIREABLE(t_0_18) OR FIREABLE(t_0_8) OR FIREABLE(t_0_15))))
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_17) AND NOT FIREABLE(t_1_9)) OR (NOT FIREABLE(t_1_7) AND NOT FIREABLE(t_0_11)) OR FIREABLE(t_0_18) OR FIREABLE(t_0_8) OR FIREABLE(t_0_15))))
lola: processed formula length: 169
lola: 2 rewrites
lola: closed formula file ResAllocation-PT-R020C002-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_17) OR FIREABLE(t_1_9)) AND (FIREABLE(t_1_7) OR FIREABLE(t_0_11)) AND NOT FIREABLE(t_0_18) AND NOT FIREABLE(t_0_8) AND NOT FIREABLE(t_0_15))
lola: state equation: Generated DNF with 188 literals and 24 conjunctive subformulas
lola: state equation: write sara problem file to ResAllocation-PT-R020C002-ReachabilityFireability-11-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 29 markings, 28 edges
lola: ========================================

FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-0 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: A (G (((FIREABLE(t_1_4) AND FIREABLE(t_1_20)) OR NOT FIREABLE(t_1_8) OR NOT FIREABLE(t_1_19) OR NOT FIREABLE(t_1_2) OR (NOT FIREABLE(t_0_12) AND NOT FIREABLE(t_0_0)) OR FIREABLE(t_0_16))))
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_1_4) AND FIREABLE(t_1_20)) OR NOT FIREABLE(t_1_8) OR NOT FIREABLE(t_1_19) OR NOT FIREABLE(t_1_2) OR (NOT FIREABLE(t_0_12) AND NOT FIREABLE(t_0_0)) OR FIREABLE(t_0_16))))
lola: processed formula length: 193
lola: 2 rewrites
lola: closed formula file ResAllocation-PT-R020C002-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_1_4) OR NOT FIREABLE(t_1_20)) AND FIREABLE(t_1_8) AND FIREABLE(t_1_19) AND FIREABLE(t_1_2) AND (FIREABLE(t_0_12) OR FIREABLE(t_0_0)) AND NOT FIREABLE(t_0_16))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 32 markings, 31 edges
lola: state equation: Generated DNF with 250 literals and 20 conjunctive subformulas
lola:
FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-1 FALSE 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(t_0_5) OR NOT FIREABLE(t_0_13) OR (FIREABLE(t_1_9) AND FIREABLE(t_0_7) AND NOT FIREABLE(t_0_12)) OR NOT FIREABLE(t_1_4) OR NOT FIREABLE(t_1_13) OR NOT FIREABLE(t_1_8) OR NOT FIREABLE(t_1_4))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((NOT FIREABLE(t_0_5) OR NOT FIREABLE(t_0_13) OR (FIREABLE(t_1_9) AND FIREABLE(t_0_7) AND NOT FIREABLE(t_0_12)) OR NOT FIREABLE(t_1_4) OR NOT FIREABLE(t_1_13) OR NOT FIREABLE(t_1_8) OR NOT FIREABLE(t_1_4))))
lola: processed formula length: 218
lola: 2 rewrites
lola: closed formula file ResAllocation-PT-R020C002-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_5) AND FIREABLE(t_0_13) AND (NOT FIREABLE(t_1_9) OR NOT FIREABLE(t_0_7) OR FIREABLE(t_0_12)) AND FIREABLE(t_1_4) AND FIREABLE(t_1_13) AND FIREABLE(t_1_8) AND FIREABLE(t_1_4))
lola: state equation: Generated DNF with 86 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to ResAllocation-PT-R020C002-ReachabilityFireability-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ResAllocation-PT-R020C002-ReachabilityFireability-13-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.

FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((FIREABLE(t_0_3) OR FIREABLE(t_1_6)) AND (FIREABLE(t_1_14) OR FIREABLE(t_1_16)) AND FIREABLE(t_0_11)) OR ((FIREABLE(t_0_10) OR (FIREABLE(t_0_8) AND FIREABLE(t_1_2))) AND FIREABLE(t_1_12)))))
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_3) OR FIREABLE(t_1_6)) AND (FIREABLE(t_1_14) OR FIREABLE(t_1_16)) AND FIREABLE(t_0_11)) OR ((FIREABLE(t_0_10) OR (FIREABLE(t_0_8) AND FIREABLE(t_1_2))) AND FIREABLE(t_1_12)))))
lola: processed formula length: 202
lola: 1 rewrites
lola: closed formula file ResAllocation-PT-R020C002-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_3) OR FIREABLE(t_1_6)) AND (FIREABLE(t_1_14) OR FIREABLE(t_1_16)) AND FIREABLE(t_0_11)) OR ((FIREABLE(t_0_10) OR (FIREABLE(t_0_8) AND FIREABLE(t_1_2))) AND FIREABLE(t_1_12)))
lola: state equation: Generated DNF with 43 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to ResAllocation-PT-R020C002-ReachabilityFireability-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ResAllocation-PT-R020C002-ReachabilityFireability-14-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 19 markings, 18 edges
lola: ========================================

FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 15 will run for 3568 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t_0_6) AND NOT FIREABLE(t_1_14) AND NOT FIREABLE(t_0_3) AND FIREABLE(t_1_8) AND FIREABLE(t_1_4) AND (FIREABLE(t_1_16) OR FIREABLE(t_0_16)) AND (FIREABLE(t_1_14) OR FIREABLE(t_0_6) OR (FIREABLE(t_0_0) AND 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_0_6) AND NOT FIREABLE(t_1_14) AND NOT FIREABLE(t_0_3) AND FIREABLE(t_1_8) AND FIREABLE(t_1_4) AND (FIREABLE(t_1_16) OR FIREABLE(t_0_16)) AND (FIREABLE(t_1_14) OR FIREABLE(t_0_6) OR (FIREABLE(t_0_0) AND FIREABLE(t_1_0))))))
lola: processed formula length: 247
lola: 1 rewrites
lola: closed formula file ResAllocation-PT-R020C002-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(t_0_6) AND NOT FIREABLE(t_1_14) AND NOT FIREABLE(t_0_3) AND FIREABLE(t_1_8) AND FIREABLE(t_1_4) AND (FIREABLE(t_1_16) OR FIREABLE(t_0_16)) AND (FIREABLE(t_1_14) OR FIREABLE(t_0_6) OR (FIREABLE(t_0_0) AND FIREABLE(t_1_0))))
lola: state equation: Generated DNF with 162 literals and 12 conjunctive subformulas
lola: state equation: write sara problem file to ResAllocation-PT-R020C002-ReachabilityFireability-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ResAllocation-PT-R020C002-ReachabilityFireability-15-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================

FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no no no yes no no yes yes no no no no yes yes yes
lola:
preliminary result: no no no no yes no no yes yes no no no no yes yes yes
lola: memory consumption: 14748 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-R020C002"
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-R020C002.tgz
mv ResAllocation-PT-R020C002 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-R020C002, 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-152673579200406"
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 ;