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 240K
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.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 9.8K 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.9K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K 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.5K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.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 73K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is DES-PT-05b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r052-smll-152646380100210
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526591993722

info: Time: 3600 - MCC
===========================================================================================
prep: translating DES-PT-05b 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-05b formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ DES-PT-05b @ 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: 551/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 300
lola: finding significant places
lola: 300 places, 251 transitions, 235 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 348 transition conflict sets
lola: TASK
lola: reading formula from DES-PT-05b-ReachabilityFireability.task
lola: E (F (FIREABLE(t89))) : E (F (FIREABLE(t110))) : E (F (FIREABLE(t190))) : E (F ((FIREABLE(t102) AND FIREABLE(t43) AND (FIREABLE(t17) OR FIREABLE(t223)) AND NOT FIREABLE(t100) AND FIREABLE(t210)))) : A (G ((NOT FIREABLE(t172) AND NOT FIREABLE(t201) AND NOT FIREABLE(t91) AND NOT FIREABLE(t107) AND (NOT FIREABLE(t133) OR NOT FIREABLE(t208) OR NOT FIREABLE(t21))))) : A (G (((NOT FIREABLE(t81) OR NOT FIREABLE(t187)) AND NOT FIREABLE(t173) AND NOT FIREABLE(t98)))) : A (G ((FIREABLE(t49) OR (NOT FIREABLE(t50) AND NOT FIREABLE(t126)) OR FIREABLE(t230) OR (FIREABLE(t157) AND (FIREABLE(t201) OR FIREABLE(t76)))))) : E (F (((FIREABLE(t65) AND FIREABLE(t89) AND NOT FIREABLE(t198) AND (NOT FIREABLE(t240) OR NOT FIREABLE(t185))) OR (FIREABLE(t100) AND FIREABLE(t133))))) : A (G ((FIREABLE(t224) OR NOT FIREABLE(t83) OR (NOT FIREABLE(t248) AND NOT FIREABLE(t136) AND FIREABLE(t228) AND (FIREABLE(t11) OR FIREABLE(t29)))))) : E (F (((FIREABLE(t125) AND FIREABLE(t128) AND FIREABLE(t216) AND FIREABLE(t47)) OR (FIREABLE(t29) AND FIREABLE(t201))))) : E (F (FIREABLE(t90))) : E (F ((NOT FIREABLE(t59) AND NOT FIREABLE(t76) AND FIREABLE(t226) AND (NOT FIREABLE(t43) OR NOT FIREABLE(t165))))) : A (G (((NOT FIREABLE(t208) AND FIREABLE(t43) AND NOT FIREABLE(t248)) OR NOT FIREABLE(t34)))) : A (G (NOT FIREABLE(t195))) : E (F ((FIREABLE(t24) OR FIREABLE(t183) OR FIREABLE(t134)))) : E (F ((FIREABLE(t54) AND FIREABLE(t213) AND NOT FIREABLE(t63))))
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(t89)))
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(t89)))
lola: processed formula length: 21
lola: 1 rewrites
lola: closed formula file DES-PT-05b-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(t89)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-05b-ReachabilityFireability-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 34 markings, 33 edges
lola: ========================================

FORMULA DES-PT-05b-ReachabilityFireability-0 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(t110)))
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(t110)))
lola: processed formula length: 22
lola: 1 rewrites
lola: closed formula file DES-PT-05b-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(t110)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation: write sara problem file to DES-PT-05b-ReachabilityFireability-0.sara
lola: 21 markings, 20 edges
lola: state equation: calling and running sara
lola: ========================================

FORMULA DES-PT-05b-ReachabilityFireability-1 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(t190)))
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)))
lola: processed formula length: 22
lola: 1 rewrites
lola: closed formula file DES-PT-05b-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)
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: 21 markings, 20 edges
sara: try reading problem file DES-PT-05b-ReachabilityFireability-0.sara.
lola: state equation: write sara problem file to DES-PT-05b-ReachabilityFireability-2-0.sara

FORMULA DES-PT-05b-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: calling and running sara
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t90)))
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(t90)))
lola: processed formula length: 21
lola: 1 rewrites
lola: closed formula file DES-PT-05b-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
sara: try reading problem file DES-PT-05b-ReachabilityFireability-2-0.sara.
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: FIREABLE(t90)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-05b-ReachabilityFireability-3-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: 37 markings, 36 edges
lola: lola: ========================================

FORMULA DES-PT-05b-ReachabilityFireability-10 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: A (G (NOT FIREABLE(t195)))
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(t195)))
lola: processed formula length: 26
lola: 2 rewrites
lola: closed formula file DES-PT-05b-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(t195)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-05b-ReachabilityFireability-4-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 20 markings, 19 edges
lola: ========================================

FORMULA DES-PT-05b-ReachabilityFireability-13 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(t24) OR FIREABLE(t183) OR FIREABLE(t134))))
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(t24) OR FIREABLE(t183) OR FIREABLE(t134))))
lola: processed formula length: 61
lola: 1 rewrites
lola: closed formula file DES-PT-05b-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(t24) OR FIREABLE(t183) OR FIREABLE(t134))
lola: state equation: Generated DNF with 4 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-05b-ReachabilityFireability-5-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 18 markings, 17 edges
lola: ========================================

FORMULA DES-PT-05b-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t54) AND FIREABLE(t213) AND NOT FIREABLE(t63))))
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(t54) AND FIREABLE(t213) AND NOT FIREABLE(t63))))
lola: processed formula length: 64
lola: 1 rewrites
lola: closed formula file DES-PT-05b-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)
sara: place or transition ordering is non-deterministic
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: 35 markings, 34 edges
lola: ========================================

FORMULA DES-PT-05b-ReachabilityFireability-15 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(t208) AND FIREABLE(t43) AND NOT FIREABLE(t248)) OR NOT FIREABLE(t34))))
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(t208) AND FIREABLE(t43) AND NOT FIREABLE(t248)) OR NOT FIREABLE(t34))))
lola: processed formula length: 93
lola: 2 rewrites
lola: closed formula file DES-PT-05b-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(t208) OR NOT FIREABLE(t43) OR FIREABLE(t248)) AND FIREABLE(t34))
lola: state equation: Generated DNF with 7 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-05b-ReachabilityFireability-7-0.sara
lola: lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 23 markings, 22 edges
lola: ========================================

FORMULA DES-PT-05b-ReachabilityFireability-12 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: A (G (((NOT FIREABLE(t81) OR NOT FIREABLE(t187)) AND NOT FIREABLE(t173) AND NOT FIREABLE(t98))))
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(t81) OR NOT FIREABLE(t187)) AND NOT FIREABLE(t173) AND NOT FIREABLE(t98))))
lola: processed formula length: 97
lola: 2 rewrites
lola: closed formula file DES-PT-05b-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: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 55 markings, 54 edges
lola: ========================================

FORMULA DES-PT-05b-ReachabilityFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t59) AND NOT FIREABLE(t76) AND FIREABLE(t226) AND (NOT FIREABLE(t43) OR NOT FIREABLE(t165)))))
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(t59) AND NOT FIREABLE(t76) AND FIREABLE(t226) AND (NOT FIREABLE(t43) OR NOT FIREABLE(t165)))))
lola: processed formula length: 115
lola: 1 rewrites
lola: closed formula file DES-PT-05b-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(t59) AND NOT FIREABLE(t76) AND FIREABLE(t226) AND (NOT FIREABLE(t43) OR NOT FIREABLE(t165)))
lola: state equation: Generated DNF with 10 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-05b-ReachabilityFireability-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-05b-ReachabilityFireability-9-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: 4701 markings, 4801 edges
lola: ========================================

FORMULA DES-PT-05b-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t102) AND FIREABLE(t43) AND (FIREABLE(t17) OR FIREABLE(t223)) AND NOT FIREABLE(t100) AND FIREABLE(t210))))
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(t102) AND FIREABLE(t43) AND (FIREABLE(t17) OR FIREABLE(t223)) AND NOT FIREABLE(t100) AND FIREABLE(t210))))
lola: processed formula length: 123
lola: 1 rewrites
lola: closed formula file DES-PT-05b-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(t102) AND FIREABLE(t43) AND (FIREABLE(t17) OR FIREABLE(t223)) AND NOT FIREABLE(t100) AND FIREABLE(t210))
lola: state equation: Generated DNF with 13 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-05b-ReachabilityFireability-10-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 140 markings, 139 edges
lola: ========================================

FORMULA DES-PT-05b-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 714 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t125) AND FIREABLE(t128) AND FIREABLE(t216) AND FIREABLE(t47)) OR (FIREABLE(t29) AND FIREABLE(t201)))))
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(t125) AND FIREABLE(t128) AND FIREABLE(t216) AND FIREABLE(t47)) OR (FIREABLE(t29) AND FIREABLE(t201)))))
lola: processed formula length: 121
lola: 1 rewrites
lola: closed formula file DES-PT-05b-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(t125) AND FIREABLE(t128) AND FIREABLE(t216) AND FIREABLE(t47)) OR (FIREABLE(t29) AND FIREABLE(t201)))
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-05b-ReachabilityFireability-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-05b-ReachabilityFireability-11-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-05b-ReachabilityFireability-9 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(t224) OR NOT FIREABLE(t83) OR (NOT FIREABLE(t248) AND NOT FIREABLE(t136) AND FIREABLE(t228) AND (FIREABLE(t11) OR FIREABLE(t29))))))
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(t224) OR NOT FIREABLE(t83) OR (NOT FIREABLE(t248) AND NOT FIREABLE(t136) AND FIREABLE(t228) AND (FIREABLE(t11) OR FIREABLE(t29))))))
lola: processed formula length: 151
lola: 2 rewrites
lola: closed formula file DES-PT-05b-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(t224) AND FIREABLE(t83) AND (FIREABLE(t248) OR FIREABLE(t136) OR NOT FIREABLE(t228) OR (NOT FIREABLE(t11) AND NOT FIREABLE(t29))))
lola: state equation: Generated DNF with 40 literals and 12 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-05b-ReachabilityFireability-12-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 25 markings, 24 edges
lola: ========================================

FORMULA DES-PT-05b-ReachabilityFireability-8 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(t172) AND NOT FIREABLE(t201) AND NOT FIREABLE(t91) AND NOT FIREABLE(t107) AND (NOT FIREABLE(t133) OR NOT FIREABLE(t208) OR NOT FIREABLE(t21)))))
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(t172) AND NOT FIREABLE(t201) AND NOT FIREABLE(t91) AND NOT FIREABLE(t107) AND (NOT FIREABLE(t133) OR NOT FIREABLE(t208) OR NOT FIREABLE(t21)))))
lola: processed formula length: 166
lola: 2 rewrites
lola: closed formula file DES-PT-05b-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(t172) OR FIREABLE(t201) OR FIREABLE(t91) OR FIREABLE(t107) OR (FIREABLE(t133) AND FIREABLE(t208) AND FIREABLE(t21)))
lola: state equation: Generated DNF with 10 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-05b-ReachabilityFireability-13-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 20 markings, 19 edges
lola: ========================================

FORMULA DES-PT-05b-ReachabilityFireability-4 FALSE 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: A (G ((FIREABLE(t49) OR (NOT FIREABLE(t50) AND NOT FIREABLE(t126)) OR FIREABLE(t230) OR (FIREABLE(t157) AND (FIREABLE(t201) OR FIREABLE(t76))))))
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(t49) OR (NOT FIREABLE(t50) AND NOT FIREABLE(t126)) OR FIREABLE(t230) OR (FIREABLE(t157) AND (FIREABLE(t201) OR FIREABLE(t76))))))
lola: processed formula length: 149
lola: 2 rewrites
lola: closed formula file DES-PT-05b-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(t49) AND (FIREABLE(t50) OR FIREABLE(t126)) AND NOT FIREABLE(t230) AND (NOT FIREABLE(t157) OR (NOT FIREABLE(t201) AND NOT FIREABLE(t76))))
lola: state equation: Generated DNF with 56 literals and 12 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-05b-ReachabilityFireability-14-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 20 markings, 19 edges
lola: ========================================

FORMULA DES-PT-05b-ReachabilityFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: calling and running sara
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t65) AND FIREABLE(t89) AND NOT FIREABLE(t198) AND (NOT FIREABLE(t240) OR NOT FIREABLE(t185))) OR (FIREABLE(t100) AND FIREABLE(t133)))))
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(t65) AND FIREABLE(t89) AND NOT FIREABLE(t198) AND (NOT FIREABLE(t240) OR NOT FIREABLE(t185))) OR (FIREABLE(t100) AND FIREABLE(t133)))))
lola: processed formula length: 154
lola: 1 rewrites
lola: closed formula file DES-PT-05b-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(t65) AND FIREABLE(t89) AND NOT FIREABLE(t198) AND (NOT FIREABLE(t240) OR NOT FIREABLE(t185))) OR (FIREABLE(t100) AND FIREABLE(t133)))
lola: state equation: Generated DNF with 34 literals and 9 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-05b-ReachabilityFireability-15-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: 25 markings, 24 edges

lola: ========================================
FORMULA DES-PT-05b-ReachabilityFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes yes yes yes no no no yes no no yes yes no no yes yes
lola:
preliminary result: yes yes yes yes no no no yes no no yes yes no no yes yes
sara: try reading problem file DES-PT-05b-ReachabilityFireability-14-0.sara.
lola: memory consumption: 15032 KB
lola: time consumption: 1 seconds
sara: place or transition ordering is non-deterministic


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="DES-PT-05b"
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-05b.tgz
mv DES-PT-05b 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-05b, 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-152646380100210"
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 ;