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 200K
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.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.3K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K 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.1K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 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 37K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is DES-PT-05a, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r052-smll-152646380000203
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526588325235

info: Time: 3600 - MCC
===========================================================================================
prep: translating DES-PT-05a 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-05a formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ DES-PT-05a @ 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: 227/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 135
lola: finding significant places
lola: 135 places, 92 transitions, 76 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 117 transition conflict sets
lola: TASK
lola: reading formula from DES-PT-05a-ReachabilityFireability.task
lola: E (F (FIREABLE(t28))) : A (G ((NOT FIREABLE(t73) OR NOT FIREABLE(t61) OR NOT FIREABLE(t14) OR (NOT FIREABLE(t63) AND NOT FIREABLE(t82) AND NOT FIREABLE(t81) AND NOT FIREABLE(t32))))) : E (F ((NOT FIREABLE(t83) AND FIREABLE(t12)))) : E (F (((NOT FIREABLE(t57) OR FIREABLE(t41)) AND FIREABLE(t62)))) : E (F (FIREABLE(t70))) : A (G (((NOT FIREABLE(t52) AND NOT FIREABLE(t86)) OR NOT FIREABLE(t4) OR FIREABLE(t7)))) : E (F (FIREABLE(t64))) : E (F ((FIREABLE(t61) AND FIREABLE(t30) AND (FIREABLE(t23) OR FIREABLE(t1)) AND NOT FIREABLE(t29) AND NOT FIREABLE(t27) AND FIREABLE(t72) AND NOT FIREABLE(t66)))) : A (G (NOT FIREABLE(t77))) : A (G (((NOT FIREABLE(t4) OR NOT FIREABLE(t82) OR FIREABLE(t72)) AND NOT FIREABLE(t23)))) : E (F ((NOT FIREABLE(t55) AND NOT FIREABLE(t27) AND (NOT FIREABLE(t47) OR NOT FIREABLE(t32)) AND NOT FIREABLE(t18) AND FIREABLE(t35) AND FIREABLE(t51) AND FIREABLE(t76) AND NOT FIREABLE(t59)))) : E (F ((FIREABLE(t72) AND FIREABLE(t61) AND (NOT FIREABLE(t68) OR NOT FIREABLE(t42) OR NOT FIREABLE(t54))))) : E (F (FIREABLE(t55))) : E (F (FIREABLE(t21))) : A (G ((NOT FIREABLE(t30) OR (NOT FIREABLE(t64) AND NOT FIREABLE(t25)) OR FIREABLE(t48) OR FIREABLE(t2)))) : E (F ((FIREABLE(t31) AND FIREABLE(t48) AND (FIREABLE(t73) OR FIREABLE(t26)))))
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(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 (FIREABLE(t28)))
lola: processed formula length: 21
lola: 1 rewrites
lola: closed formula file DES-PT-05a-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(t28)
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: state equation: write sara problem file to DES-PT-05a-ReachabilityFireability-0.sara
lola: 16 markings, 15 edges
lola: ========================================

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

FORMULA DES-PT-05a-ReachabilityFireability-4 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(t64)))
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(t64)))
lola: processed formula length: 21
lola: 1 rewrites
lola: closed formula file DES-PT-05a-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(t64)
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: 19 markings, 18 edges
lola: ========================================

FORMULA DES-PT-05a-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: A (G (NOT FIREABLE(t77)))
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(t77)))
lola: processed formula length: 25
lola: 2 rewrites
lola: closed formula file DES-PT-05a-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(t77)
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: 20 markings, 19 edges
lola: ========================================

FORMULA DES-PT-05a-ReachabilityFireability-8 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(t55)))
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(t55)))
lola: processed formula length: 21
lola: 1 rewrites
lola: closed formula file DES-PT-05a-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(t55)
lola: state equation: Generated DNF with 9 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 35 markings, 34 edges
lola: ========================================

FORMULA DES-PT-05a-ReachabilityFireability-12 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(t21)))
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(t21)))
lola: processed formula length: 21
lola: 1 rewrites
lola: closed formula file DES-PT-05a-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(t21)
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: 77 markings, 76 edges
lola: ========================================

FORMULA DES-PT-05a-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
sara: try reading problem file DES-PT-05a-ReachabilityFireability-0.sara.
sara: try reading problem file DES-PT-05a-ReachabilityFireability-0.sara.
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t83) AND FIREABLE(t12))))
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(t83) AND FIREABLE(t12))))
lola: processed formula length: 45
lola: 1 rewrites
lola: closed formula file DES-PT-05a-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(t83) AND FIREABLE(t12))
lola: state equation: Generated DNF with 12 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 201 markings, 200 edges
lola: ========================================

FORMULA DES-PT-05a-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(t57) OR FIREABLE(t41)) AND FIREABLE(t62))))
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(t57) OR FIREABLE(t41)) AND FIREABLE(t62))))
lola: processed formula length: 65
lola: 1 rewrites
lola: closed formula file DES-PT-05a-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(t57) OR FIREABLE(t41)) AND FIREABLE(t62))
lola: state equation: Generated DNF with 10 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-05a-ReachabilityFireability-7-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: 19 markings, 18 edges

lola: ========================================
FORMULA DES-PT-05a-ReachabilityFireability-3 TRUE 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(t52) AND NOT FIREABLE(t86)) OR NOT FIREABLE(t4) OR FIREABLE(t7))))
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(t52) AND NOT FIREABLE(t86)) OR NOT FIREABLE(t4) OR FIREABLE(t7))))
lola: processed formula length: 89
lola: 2 rewrites
lola: closed formula file DES-PT-05a-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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 16 markings, 15 edges
sara: place or transition ordering is non-deterministic
lola: ========================================

FORMULA DES-PT-05a-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: A (G (((NOT FIREABLE(t4) OR NOT FIREABLE(t82) OR FIREABLE(t72)) AND NOT FIREABLE(t23))))
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(t4) OR NOT FIREABLE(t82) OR FIREABLE(t72)) AND NOT FIREABLE(t23))))
lola: processed formula length: 90
lola: 2 rewrites
lola: closed formula file DES-PT-05a-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: 12 markings, 11 edges
lola: ========================================

FORMULA DES-PT-05a-ReachabilityFireability-9 FALSE 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(t31) AND FIREABLE(t48) AND (FIREABLE(t73) OR FIREABLE(t26)))))
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(t31) AND FIREABLE(t48) AND (FIREABLE(t73) OR FIREABLE(t26)))))
lola: processed formula length: 79
lola: 1 rewrites
lola: closed formula file DES-PT-05a-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(t31) AND FIREABLE(t48) AND (FIREABLE(t73) OR FIREABLE(t26)))
lola: state equation: Generated DNF with 12 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-05a-ReachabilityFireability-10-0.sara
lola: state equation: calling and running sara
sara: place or transition ordering is non-deterministic
sara: try reading problem file DES-PT-05a-ReachabilityFireability-10-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: 411934 markings, 768203 edges
lola: ========================================

FORMULA DES-PT-05a-ReachabilityFireability-15 TRUE 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(t30) OR (NOT FIREABLE(t64) AND NOT FIREABLE(t25)) OR FIREABLE(t48) OR FIREABLE(t2))))
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(t30) OR (NOT FIREABLE(t64) AND NOT FIREABLE(t25)) OR FIREABLE(t48) OR FIREABLE(t2))))
lola: processed formula length: 108
lola: 2 rewrites
lola: closed formula file DES-PT-05a-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(t30) AND (FIREABLE(t64) OR FIREABLE(t25)) AND NOT FIREABLE(t48) AND NOT FIREABLE(t2))
lola: state equation: Generated DNF with 48 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-05a-ReachabilityFireability-11-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: 183 markings, 182 edges
lola: ========================================

FORMULA DES-PT-05a-ReachabilityFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t72) AND FIREABLE(t61) AND (NOT FIREABLE(t68) OR NOT FIREABLE(t42) OR NOT FIREABLE(t54)))))
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(t72) AND FIREABLE(t61) AND (NOT FIREABLE(t68) OR NOT FIREABLE(t42) OR NOT FIREABLE(t54)))))
lola: processed formula length: 109
lola: 1 rewrites
lola: closed formula file DES-PT-05a-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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: formula 0: (FIREABLE(t72) AND FIREABLE(t61) AND (NOT FIREABLE(t68) OR NOT FIREABLE(t42) OR NOT FIREABLE(t54)))
lola: The predicate is reachable.
lola: 21 markings, 20 edges
lola: state equation: Generated DNF with 30 literals and 6 conjunctive subformulas

FORMULA DES-PT-05a-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t73) OR NOT FIREABLE(t61) OR NOT FIREABLE(t14) OR (NOT FIREABLE(t63) AND NOT FIREABLE(t82) AND NOT FIREABLE(t81) AND NOT FIREABLE(t32)))))
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(t73) OR NOT FIREABLE(t61) OR NOT FIREABLE(t14) OR (NOT FIREABLE(t63) AND NOT FIREABLE(t82) AND NOT FIREABLE(t81) AND NOT FIREABLE(t32)))))
lola: processed formula length: 161
lola: 2 rewrites
lola: closed formula file DES-PT-05a-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(t73) AND FIREABLE(t61) AND FIREABLE(t14) AND (FIREABLE(t63) OR FIREABLE(t82) OR FIREABLE(t81) OR FIREABLE(t32)))
lola: state equation: Generated DNF with 36 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-05a-ReachabilityFireability-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-05a-ReachabilityFireability-13-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-05a-ReachabilityFireability-1 FALSE 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: E (F ((FIREABLE(t61) AND FIREABLE(t30) AND (FIREABLE(t23) OR FIREABLE(t1)) AND NOT FIREABLE(t29) AND NOT FIREABLE(t27) AND FIREABLE(t72) AND NOT FIREABLE(t66))))
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(t61) AND FIREABLE(t30) AND (FIREABLE(t23) OR FIREABLE(t1)) AND NOT FIREABLE(t29) AND NOT FIREABLE(t27) AND FIREABLE(t72) AND NOT FIREABLE(t66))))
lola: processed formula length: 162
lola: 1 rewrites
lola: closed formula file DES-PT-05a-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(t61) AND FIREABLE(t30) AND (FIREABLE(t23) OR FIREABLE(t1)) AND NOT FIREABLE(t29) AND NOT FIREABLE(t27) AND FIREABLE(t72) AND NOT FIREABLE(t66))
lola: state equation: Generated DNF with 56 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-05a-ReachabilityFireability-14-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 134 markings, 133 edges
lola: ========================================

FORMULA DES-PT-05a-ReachabilityFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t55) AND NOT FIREABLE(t27) AND (NOT FIREABLE(t47) OR NOT FIREABLE(t32)) AND NOT FIREABLE(t18) AND FIREABLE(t35) AND FIREABLE(t51) AND FIREABLE(t76) AND NOT FIREABLE(t59))))
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(t55) AND NOT FIREABLE(t27) AND (NOT FIREABLE(t47) OR NOT FIREABLE(t32)) AND NOT FIREABLE(t18) AND FIREABLE(t35) AND FIREABLE(t51) AND FIREABLE(t76) AND NOT FIREABLE(t59))))
lola: processed formula length: 193
lola: 1 rewrites
lola: closed formula file DES-PT-05a-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(t55) AND NOT FIREABLE(t27) AND (NOT FIREABLE(t47) OR NOT FIREABLE(t32)) AND NOT FIREABLE(t18) AND FIREABLE(t35) AND FIREABLE(t51) AND FIREABLE(t76) AND NOT FIREABLE(t59))
lola: state equation: Generated DNF with 1728 literals and 144 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-05a-ReachabilityFireability-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-05a-ReachabilityFireability-15-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: 105372 markings, 198515 edges
lola: ========================================

FORMULA DES-PT-05a-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no yes yes yes no yes yes no no yes yes yes yes no yes
lola:
preliminary result: yes no yes yes yes no yes yes no no yes yes yes yes no yes
lola: memory consumption: 14872 KB
lola: time consumption: 4 seconds

BK_STOP 1526588329165

--------------------
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-05a"
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-05a.tgz
mv DES-PT-05a 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-05a, 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-152646380000203"
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 ;