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 260K
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 10K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.4K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 101 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 339 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K 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 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 97K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is DES-PT-50a, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r052-smll-152646380100273
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526635952090

info: Time: 3600 - MCC
===========================================================================================
prep: translating DES-PT-50a Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: net is already safe
prep: check for too many tokens
===========================================================================================
prep: translating DES-PT-50a formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ DES-PT-50a @ 3570 seconds
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 585/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 314
lola: finding significant places
lola: 314 places, 271 transitions, 255 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 296 transition conflict sets
lola: TASK
lola: reading formula from DES-PT-50a-ReachabilityFireability.task
lola: E (F ((NOT FIREABLE(t242) AND ((FIREABLE(t208) AND FIREABLE(t116)) OR FIREABLE(t90)) AND FIREABLE(t28)))) : E (F ((FIREABLE(t92) AND FIREABLE(t12) AND FIREABLE(t221) AND (FIREABLE(t143) OR FIREABLE(t185) OR NOT FIREABLE(t63)) AND FIREABLE(t248)))) : E (F (FIREABLE(t132))) : E (F (FIREABLE(t40))) : E (F (((FIREABLE(t163) AND NOT FIREABLE(t248)) OR ((FIREABLE(t61) OR FIREABLE(t187) OR NOT FIREABLE(t214)) AND FIREABLE(t182))))) : A (G ((NOT FIREABLE(t250) OR (FIREABLE(t125) AND FIREABLE(t199)) OR (NOT FIREABLE(t142) AND NOT FIREABLE(t106)) OR FIREABLE(t94)))) : E (F (FIREABLE(t79))) : E (F (FIREABLE(t199))) : E (F ((FIREABLE(t190) AND ((FIREABLE(t137) AND NOT FIREABLE(t225)) OR NOT FIREABLE(t11))))) : E (F (FIREABLE(t85))) : E (F ((NOT FIREABLE(t97) AND NOT FIREABLE(t32) AND (NOT FIREABLE(t253) OR NOT FIREABLE(t205)) AND FIREABLE(t245)))) : E (F ((FIREABLE(t29) AND NOT FIREABLE(t98) AND NOT FIREABLE(t23) AND NOT FIREABLE(t51) AND (NOT FIREABLE(t193) OR NOT FIREABLE(t91))))) : A (G ((FIREABLE(t241) OR FIREABLE(t69) OR NOT FIREABLE(t96) OR (FIREABLE(t70) AND FIREABLE(t265) AND FIREABLE(t116)) OR FIREABLE(t78)))) : A (G ((NOT FIREABLE(t132) OR FIREABLE(t210)))) : E (F (FIREABLE(t196))) : A (G ((FIREABLE(t166) OR FIREABLE(t268) OR NOT FIREABLE(t194))))
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(t132)))
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(t132)))
lola: processed formula length: 22
lola: 1 rewrites
lola: closed formula file DES-PT-50a-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(t132)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-50a-ReachabilityFireability-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-50a-ReachabilityFireability-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 1910 markings, 2235 edges
lola: ========================================

FORMULA DES-PT-50a-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t40)))
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(t40)))
lola: processed formula length: 21
lola: 1 rewrites
lola: closed formula file DES-PT-50a-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(t40)
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-50a-ReachabilityFireability-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-50a-ReachabilityFireability-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 1027 markings, 1026 edges
lola: ========================================

FORMULA DES-PT-50a-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t79)))
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(t79)))
lola: processed formula length: 21
lola: 1 rewrites
lola: closed formula file DES-PT-50a-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(t79)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-50a-ReachabilityFireability-2-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-50a-ReachabilityFireability-2-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 116946 markings, 189472 edges
lola: ========================================

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

FORMULA DES-PT-50a-ReachabilityFireability-7 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(t85)))
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(t85)))
lola: processed formula length: 21
lola: 1 rewrites
lola: closed formula file DES-PT-50a-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(t85)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-50a-ReachabilityFireability-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-50a-ReachabilityFireability-4-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 95790 markings, 153226 edges
lola: ========================================

FORMULA DES-PT-50a-ReachabilityFireability-9 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(t196)))
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(t196)))
lola: processed formula length: 22
lola: 1 rewrites
lola: closed formula file DES-PT-50a-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(t196)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-50a-ReachabilityFireability-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-50a-ReachabilityFireability-5-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 1316 markings, 1316 edges
lola:
FORMULA DES-PT-50a-ReachabilityFireability-14 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: A (G ((NOT FIREABLE(t132) OR FIREABLE(t210))))
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(t132) OR FIREABLE(t210))))
lola: processed formula length: 47
lola: 2 rewrites
lola: closed formula file DES-PT-50a-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(t132) AND NOT FIREABLE(t210))
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-50a-ReachabilityFireability-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-50a-ReachabilityFireability-6-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 1910 markings, 2235 edges
lola: ========================================

FORMULA DES-PT-50a-ReachabilityFireability-13 FALSE 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 ((FIREABLE(t166) OR FIREABLE(t268) OR NOT FIREABLE(t194))))
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(t166) OR FIREABLE(t268) OR NOT FIREABLE(t194))))
lola: processed formula length: 66
lola: 2 rewrites
lola: closed formula file DES-PT-50a-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(t166) AND NOT FIREABLE(t268) AND FIREABLE(t194))
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-50a-ReachabilityFireability-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-50a-ReachabilityFireability-7-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 DES-PT-50a-ReachabilityFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t190) AND ((FIREABLE(t137) AND NOT FIREABLE(t225)) OR NOT FIREABLE(t11)))))
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(t190) AND ((FIREABLE(t137) AND NOT FIREABLE(t225)) OR NOT FIREABLE(t11)))))
lola: processed formula length: 92
lola: 1 rewrites
lola: closed formula file DES-PT-50a-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(t190) AND ((FIREABLE(t137) AND NOT FIREABLE(t225)) OR NOT FIREABLE(t11)))
lola: state equation: Generated DNF with 19 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-50a-ReachabilityFireability-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-50a-ReachabilityFireability-8-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 1094 markings, 1094 edges
lola: ========================================

FORMULA DES-PT-50a-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t97) AND NOT FIREABLE(t32) AND (NOT FIREABLE(t253) OR NOT FIREABLE(t205)) AND FIREABLE(t245))))
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(t97) AND NOT FIREABLE(t32) AND (NOT FIREABLE(t253) OR NOT FIREABLE(t205)) AND FIREABLE(t245))))
lola: processed formula length: 116
lola: 1 rewrites
lola: closed formula file DES-PT-50a-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(t97) AND NOT FIREABLE(t32) AND (NOT FIREABLE(t253) OR NOT FIREABLE(t205)) AND FIREABLE(t245))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: Generated DNF with 120 literals and 24 conjunctive subformulas
lola: The predicate is reachable.
lola: 19 markings, 18 edges
lola: ========================================

FORMULA DES-PT-50a-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t242) AND ((FIREABLE(t208) AND FIREABLE(t116)) OR FIREABLE(t90)) AND FIREABLE(t28))))
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(t242) AND ((FIREABLE(t208) AND FIREABLE(t116)) OR FIREABLE(t90)) AND FIREABLE(t28))))
lola: processed formula length: 106
lola: 1 rewrites
lola: closed formula file DES-PT-50a-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(t242) AND ((FIREABLE(t208) AND FIREABLE(t116)) OR FIREABLE(t90)) AND FIREABLE(t28))
lola: state equation: Generated DNF with 28 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-50a-ReachabilityFireability-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-50a-ReachabilityFireability-10-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 DES-PT-50a-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(t250) OR (FIREABLE(t125) AND FIREABLE(t199)) OR (NOT FIREABLE(t142) AND NOT FIREABLE(t106)) OR FIREABLE(t94))))
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(t250) OR (FIREABLE(t125) AND FIREABLE(t199)) OR (NOT FIREABLE(t142) AND NOT FIREABLE(t106)) OR FIREABLE(t94))))
lola: processed formula length: 134
lola: 2 rewrites
lola: closed formula file DES-PT-50a-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(t250) AND (NOT FIREABLE(t125) OR NOT FIREABLE(t199)) AND (FIREABLE(t142) OR FIREABLE(t106)) AND NOT FIREABLE(t94))
lola: state equation: Generated DNF with 60 literals and 10 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-50a-ReachabilityFireability-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-50a-ReachabilityFireability-11-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 11968 markings, 17625 edges
lola: ========================================

FORMULA DES-PT-50a-ReachabilityFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t163) AND NOT FIREABLE(t248)) OR ((FIREABLE(t61) OR FIREABLE(t187) OR NOT FIREABLE(t214)) AND FIREABLE(t182)))))
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(t163) AND NOT FIREABLE(t248)) OR ((FIREABLE(t61) OR FIREABLE(t187) OR NOT FIREABLE(t214)) AND FIREABLE(t182)))))
lola: processed formula length: 132
lola: 1 rewrites
lola: closed formula file DES-PT-50a-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(t163) AND NOT FIREABLE(t248)) OR ((FIREABLE(t61) OR FIREABLE(t187) OR NOT FIREABLE(t214)) AND FIREABLE(t182)))
lola: state equation: Generated DNF with 20 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-50a-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: 40 markings, 40 edges
lola: ========================================

FORMULA DES-PT-50a-ReachabilityFireability-4 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(t29) AND NOT FIREABLE(t98) AND NOT FIREABLE(t23) AND NOT FIREABLE(t51) AND (NOT FIREABLE(t193) OR NOT FIREABLE(t91)))))
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(t29) AND NOT FIREABLE(t98) AND NOT FIREABLE(t23) AND NOT FIREABLE(t51) AND (NOT FIREABLE(t193) OR NOT FIREABLE(t91)))))
lola: processed formula length: 136
lola: 1 rewrites
lola: closed formula file DES-PT-50a-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(t29) AND NOT FIREABLE(t98) AND NOT FIREABLE(t23) AND NOT FIREABLE(t51) AND (NOT FIREABLE(t193) OR NOT FIREABLE(t91)))
lola: state equation: Generated DNF with 56 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-50a-ReachabilityFireability-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-50a-ReachabilityFireability-13-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 1588 markings, 1587 edges
lola: ========================================

FORMULA DES-PT-50a-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t241) OR FIREABLE(t69) OR NOT FIREABLE(t96) OR (FIREABLE(t70) AND FIREABLE(t265) AND FIREABLE(t116)) OR FIREABLE(t78))))
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(t241) OR FIREABLE(t69) OR NOT FIREABLE(t96) OR (FIREABLE(t70) AND FIREABLE(t265) AND FIREABLE(t116)) OR FIREABLE(t78))))
lola: processed formula length: 140
lola: 2 rewrites
lola: closed formula file DES-PT-50a-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(t241) AND NOT FIREABLE(t69) AND FIREABLE(t96) AND (NOT FIREABLE(t70) OR NOT FIREABLE(t265) OR NOT FIREABLE(t116)) AND NOT FIREABLE(t78))
lola: state equation: Generated DNF with 72 literals and 12 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-50a-ReachabilityFireability-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-50a-ReachabilityFireability-14-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 56922 markings, 86571 edges

FORMULA DES-PT-50a-ReachabilityFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 15 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t92) AND FIREABLE(t12) AND FIREABLE(t221) AND (FIREABLE(t143) OR FIREABLE(t185) OR NOT FIREABLE(t63)) AND FIREABLE(t248))))
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(t92) AND FIREABLE(t12) AND FIREABLE(t221) AND (FIREABLE(t143) OR FIREABLE(t185) OR NOT FIREABLE(t63)) AND FIREABLE(t248))))
lola: processed formula length: 141
lola: 1 rewrites
lola: closed formula file DES-PT-50a-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(t92) AND FIREABLE(t12) AND FIREABLE(t221) AND (FIREABLE(t143) OR FIREABLE(t185) OR NOT FIREABLE(t63)) AND FIREABLE(t248))
lola: state equation: Generated DNF with 32 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-50a-ReachabilityFireability-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-50a-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 DES-PT-50a-ReachabilityFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no yes yes yes no yes yes yes yes yes yes no no yes no
lola:
preliminary result: no no yes yes yes no yes yes yes yes yes yes no no yes no
lola: memory consumption: 15112 KB
lola: time consumption: 3 seconds

BK_STOP 1526635955965

--------------------
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="DES-PT-50a"
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/DES-PT-50a.tgz
mv DES-PT-50a 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 DES-PT-50a, 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 r052-smll-152646380100273"
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 ;