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 316K
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K 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.8K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.1K 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 106 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 344 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 148K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is DLCround-PT-03a, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r064-smll-152649735100007
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526579832569

info: Time: 3600 - MCC
===========================================================================================
prep: translating DLCround-PT-03a 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 DLCround-PT-03a formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ DLCround-PT-03a @ 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: 730/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 113
lola: finding significant places
lola: 113 places, 617 transitions, 61 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 518 transition conflict sets
lola: TASK
lola: reading formula from DLCround-PT-03a-ReachabilityFireability.task
lola: A (G (NOT FIREABLE(t133))) : E (F ((FIREABLE(t206) AND FIREABLE(t85) AND NOT FIREABLE(t250) AND NOT FIREABLE(t579) AND NOT FIREABLE(t506) AND NOT FIREABLE(t37)))) : A (G ((NOT FIREABLE(t603) OR NOT FIREABLE(t31) OR NOT FIREABLE(t444) OR (NOT FIREABLE(t220) AND FIREABLE(t147))))) : E (F ((NOT FIREABLE(t606) AND FIREABLE(t198) AND FIREABLE(t283)))) : E (F (((FIREABLE(t537) AND (NOT FIREABLE(t40) OR NOT FIREABLE(t170))) OR (FIREABLE(t345) AND FIREABLE(t69) AND FIREABLE(t464) AND FIREABLE(t282) AND NOT FIREABLE(t490))))) : A (G ((NOT FIREABLE(t122) OR NOT FIREABLE(t309) OR NOT FIREABLE(t487) OR NOT FIREABLE(t502) OR (NOT FIREABLE(t242) AND NOT FIREABLE(t612) AND FIREABLE(t586))))) : A (G (())) : A (G ((NOT FIREABLE(t381) OR (FIREABLE(t323) AND FIREABLE(t392)) OR NOT FIREABLE(t17) OR NOT FIREABLE(t113) OR FIREABLE(t205)))) : E (F ((NOT FIREABLE(t394) AND NOT FIREABLE(t530) AND FIREABLE(t327) AND FIREABLE(t199)))) : A (G ((FIREABLE(t256) OR FIREABLE(t258) OR NOT FIREABLE(t569) OR FIREABLE(t357) OR NOT FIREABLE(t76)))) : A (G ((NOT FIREABLE(t405) OR NOT FIREABLE(t292) OR NOT FIREABLE(t118) OR NOT FIREABLE(t378) OR NOT FIREABLE(t314)))) : E (F ((FIREABLE(t189) AND FIREABLE(t427) AND FIREABLE(t513)))) : E (F ((FIREABLE(t445) AND FIREABLE(t603) AND FIREABLE(t174) AND ((FIREABLE(t325) AND FIREABLE(t96)) OR (FIREABLE(t514) AND FIREABLE(t238))) AND (NOT FIREABLE(t495) OR NOT FIREABLE(t153))))) : E (F ((FIREABLE(t520) AND FIREABLE(t437) AND FIREABLE(t123)))) : E (F ((FIREABLE(t375) AND FIREABLE(t9) AND NOT FIREABLE(t502) AND (FIREABLE(t405) OR FIREABLE(t67) OR (FIREABLE(t242) AND FIREABLE(t612))) AND (FIREABLE(t172) OR FIREABLE(t454) OR (FIREABLE(t53) AND FIREABLE(t341)) OR (FIREABLE(t276) AND FIREABLE(t378) AND NOT FIREABLE(t294)))))) : E (F (FIREABLE(t308)))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 3 rewrites
lola: closed formula file DLCround-PT-03a-ReachabilityFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA DLCround-PT-03a-ReachabilityFireability-6 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: A (G (NOT FIREABLE(t133)))
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(t133)))
lola: processed formula length: 26
lola: 5 rewrites
lola: closed formula file DLCround-PT-03a-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(t133)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: write sara problem file to DLCround-PT-03a-ReachabilityFireability-0.sara
lola: The predicate is not invariant.
lola: 6 markings, 5 edges

FORMULA DLCround-PT-03a-ReachabilityFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t308)))
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(t308)))
lola: processed formula length: 22
lola: 4 rewrites
lola: closed formula file DLCround-PT-03a-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(t308)
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: 6 markings, 5 edges
lola: ========================================

FORMULA DLCround-PT-03a-ReachabilityFireability-15 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(t189) AND FIREABLE(t427) AND FIREABLE(t513))))
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(t189) AND FIREABLE(t427) AND FIREABLE(t513))))
lola: processed formula length: 62
lola: 4 rewrites
lola: closed formula file DLCround-PT-03a-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(t189) AND FIREABLE(t427) AND FIREABLE(t513))
lola: state equation: Generated DNF with 6 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-03a-ReachabilityFireability-3-0.sara
sara: try reading problem file DLCround-PT-03a-ReachabilityFireability-0.sara.
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-03a-ReachabilityFireability-3-0.sara.
sara: place or transition ordering is non-deterministic

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.

FORMULA DLCround-PT-03a-ReachabilityFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t520) AND FIREABLE(t437) AND FIREABLE(t123))))
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(t520) AND FIREABLE(t437) AND FIREABLE(t123))))
lola: processed formula length: 62
lola: 4 rewrites
lola: closed formula file DLCround-PT-03a-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(t520) AND FIREABLE(t437) AND FIREABLE(t123))
lola: state equation: Generated DNF with 6 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 DLCround-PT-03a-ReachabilityFireability-4-0.sara
lola: 6 markings, 5 edges

FORMULA DLCround-PT-03a-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t606) AND FIREABLE(t198) AND FIREABLE(t283))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: lola: ========================================
lola: state equation: calling and running sara
Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((NOT FIREABLE(t606) AND FIREABLE(t198) AND FIREABLE(t283))))
lola: processed formula length: 66
lola: 4 rewrites
lola: closed formula file DLCround-PT-03a-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: try reading problem file DLCround-PT-03a-ReachabilityFireability-4-0.sara.
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(t606) AND FIREABLE(t198) AND FIREABLE(t283))
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-03a-ReachabilityFireability-5-0.sara
lola: lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 10 markings, 9 edges
lola: ========================================

FORMULA DLCround-PT-03a-ReachabilityFireability-3 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 ((NOT FIREABLE(t394) AND NOT FIREABLE(t530) AND FIREABLE(t327) AND 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 ((NOT FIREABLE(t394) AND NOT FIREABLE(t530) AND FIREABLE(t327) AND FIREABLE(t199))))
lola: processed formula length: 89
lola: 4 rewrites
lola: closed formula file DLCround-PT-03a-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(t394) AND NOT FIREABLE(t530) AND FIREABLE(t327) AND FIREABLE(t199))
lola: state equation: Generated DNF with 24 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6 markings, 5 edges
lola: ========================================

FORMULA DLCround-PT-03a-ReachabilityFireability-8 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(t603) OR NOT FIREABLE(t31) OR NOT FIREABLE(t444) OR (NOT FIREABLE(t220) AND FIREABLE(t147)))))
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(t603) OR NOT FIREABLE(t31) OR NOT FIREABLE(t444) OR (NOT FIREABLE(t220) AND FIREABLE(t147)))))
lola: processed formula length: 117
lola: 5 rewrites
lola: closed formula file DLCround-PT-03a-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(t603) AND FIREABLE(t31) AND FIREABLE(t444) AND (FIREABLE(t220) OR NOT FIREABLE(t147)))
lola: state equation: Generated DNF with 16 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-03a-ReachabilityFireability-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-03a-ReachabilityFireability-7-0.sara.
sara: place or transition ordering is non-deterministic

sara: place or transition ordering is non-deterministic

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

FORMULA DLCround-PT-03a-ReachabilityFireability-2 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 ((FIREABLE(t256) OR FIREABLE(t258) OR NOT FIREABLE(t569) OR FIREABLE(t357) OR NOT 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(t256) OR FIREABLE(t258) OR NOT FIREABLE(t569) OR FIREABLE(t357) OR NOT FIREABLE(t76))))
lola: processed formula length: 107
lola: 5 rewrites
lola: closed formula file DLCround-PT-03a-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(t256) AND NOT FIREABLE(t258) AND FIREABLE(t569) AND NOT FIREABLE(t357) AND FIREABLE(t76))
lola: state equation: Generated DNF with 48 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-03a-ReachabilityFireability-8-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 7 markings, 7 edges

FORMULA DLCround-PT-03a-ReachabilityFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: lola: ========================================
state equation: calling and running sara
lola: subprocess 9 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t405) OR NOT FIREABLE(t292) OR NOT FIREABLE(t118) OR NOT FIREABLE(t378) OR NOT FIREABLE(t314))))
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(t405) OR NOT FIREABLE(t292) OR NOT FIREABLE(t118) OR NOT FIREABLE(t378) OR NOT FIREABLE(t314))))
lola: processed formula length: 120
lola: 5 rewrites
lola: closed formula file DLCround-PT-03a-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(t405) AND FIREABLE(t292) AND FIREABLE(t118) AND FIREABLE(t378) AND FIREABLE(t314))
lola: state equation: Generated DNF with 10 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-03a-ReachabilityFireability-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-03a-ReachabilityFireability-8-0.sara.
sara: try reading problem file DLCround-PT-03a-ReachabilityFireability-9-0.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic

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

FORMULA DLCround-PT-03a-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 ((FIREABLE(t206) AND FIREABLE(t85) AND NOT FIREABLE(t250) AND NOT FIREABLE(t579) AND NOT FIREABLE(t506) AND NOT FIREABLE(t37))))
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(t206) AND FIREABLE(t85) AND NOT FIREABLE(t250) AND NOT FIREABLE(t579) AND NOT FIREABLE(t506) AND NOT FIREABLE(t37))))
lola: processed formula length: 133
lola: 4 rewrites
lola: closed formula file DLCround-PT-03a-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(t206) AND FIREABLE(t85) AND NOT FIREABLE(t250) AND NOT FIREABLE(t579) AND NOT FIREABLE(t506) AND NOT FIREABLE(t37))
lola: state equation: Generated DNF with 28 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-03a-ReachabilityFireability-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-03a-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 DLCround-PT-03a-ReachabilityFireability-1 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(t381) OR (FIREABLE(t323) AND FIREABLE(t392)) OR NOT FIREABLE(t17) OR NOT FIREABLE(t113) OR FIREABLE(t205))))
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(t381) OR (FIREABLE(t323) AND FIREABLE(t392)) OR NOT FIREABLE(t17) OR NOT FIREABLE(t113) OR FIREABLE(t205))))
lola: processed formula length: 132
lola: 5 rewrites
lola: closed formula file DLCround-PT-03a-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(t381) AND (NOT FIREABLE(t323) OR NOT FIREABLE(t392)) AND FIREABLE(t17) AND FIREABLE(t113) AND NOT FIREABLE(t205))
lola: state equation: Generated DNF with 56 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-03a-ReachabilityFireability-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-03a-ReachabilityFireability-11-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola:
FORMULA DLCround-PT-03a-ReachabilityFireability-7 TRUE 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 ((NOT FIREABLE(t122) OR NOT FIREABLE(t309) OR NOT FIREABLE(t487) OR NOT FIREABLE(t502) OR (NOT FIREABLE(t242) AND NOT FIREABLE(t612) AND FIREABLE(t586)))))
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(t122) OR NOT FIREABLE(t309) OR NOT FIREABLE(t487) OR NOT FIREABLE(t502) OR (NOT FIREABLE(t242) AND NOT FIREABLE(t612) AND FIREABLE(t586)))))
lola: processed formula length: 164
lola: 5 rewrites
lola: closed formula file DLCround-PT-03a-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(t122) AND FIREABLE(t309) AND FIREABLE(t487) AND FIREABLE(t502) AND (FIREABLE(t242) OR FIREABLE(t612) OR NOT FIREABLE(t586)))
lola: state equation: Generated DNF with 37 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-03a-ReachabilityFireability-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-03a-ReachabilityFireability-12-0.sara.
sara: place or transition ordering is non-deterministic

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

FORMULA DLCround-PT-03a-ReachabilityFireability-5 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: E (F (((FIREABLE(t537) AND (NOT FIREABLE(t40) OR NOT FIREABLE(t170))) OR (FIREABLE(t345) AND FIREABLE(t69) AND FIREABLE(t464) AND FIREABLE(t282) AND NOT FIREABLE(t490)))))
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(t537) AND (NOT FIREABLE(t40) OR NOT FIREABLE(t170))) OR (FIREABLE(t345) AND FIREABLE(t69) AND FIREABLE(t464) AND FIREABLE(t282) AND NOT FIREABLE(t490)))))
lola: processed formula length: 173
lola: 4 rewrites
lola: closed formula file DLCround-PT-03a-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(t537) AND (NOT FIREABLE(t40) OR NOT FIREABLE(t170))) OR (FIREABLE(t345) AND FIREABLE(t69) AND FIREABLE(t464) AND FIREABLE(t282) AND NOT FIREABLE(t490)))
lola: state equation: Generated DNF with 25 literals and 5 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: write sara problem file to DLCround-PT-03a-ReachabilityFireability-13-0.sara
lola: The predicate is reachable.
lola: 12 markings, 22 edges
lola: ========================================

FORMULA DLCround-PT-03a-ReachabilityFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t445) AND FIREABLE(t603) AND FIREABLE(t174) AND ((FIREABLE(t325) AND FIREABLE(t96)) OR (FIREABLE(t514) AND FIREABLE(t238))) AND (NOT FIREABLE(t495) OR NOT FIREABLE(t153)))))
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(t445) AND FIREABLE(t603) AND FIREABLE(t174) AND ((FIREABLE(t325) AND FIREABLE(t96)) OR (FIREABLE(t514) AND FIREABLE(t238))) AND (NOT FIREABLE(t495) OR NOT FIREABLE(t153)))))
lola: processed formula length: 191
lola: 4 rewrites
lola: closed formula file DLCround-PT-03a-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(t445) AND FIREABLE(t603) AND FIREABLE(t174) AND ((FIREABLE(t325) AND FIREABLE(t96)) OR (FIREABLE(t514) AND FIREABLE(t238))) AND (NOT FIREABLE(t495) OR NOT FIREABLE(t153)))
lola: state equation: Generated DNF with 76 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-03a-ReachabilityFireability-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-03a-ReachabilityFireability-14-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================

FORMULA DLCround-PT-03a-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t375) AND FIREABLE(t9) AND NOT FIREABLE(t502) AND (FIREABLE(t405) OR FIREABLE(t67) OR (FIREABLE(t242) AND FIREABLE(t612))) AND (FIREABLE(t172) OR FIREABLE(t454) OR (FIREABLE(t53) AND FIREABLE(t341)) OR (FIREABLE(t276) AND FIREABLE(t378) AND NOT FIREABLE(t294))))))
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(t375) AND FIREABLE(t9) AND NOT FIREABLE(t502) AND (FIREABLE(t405) OR FIREABLE(t67) OR (FIREABLE(t242) AND FIREABLE(t612))) AND (FIREABLE(t172) OR FIREABLE(t454) OR (FIREABLE(t53) AND FIREABLE(t341)) OR (FIREABLE(t276) AND FIREABLE(t378) AND NOT FIREABLE(t294))))))
lola: processed formula length: 285
lola: 4 rewrites
lola: closed formula file DLCround-PT-03a-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(t375) AND FIREABLE(t9) AND NOT FIREABLE(t502) AND (FIREABLE(t405) OR FIREABLE(t67) OR (FIREABLE(t242) AND FIREABLE(t612))) AND (FIREABLE(t172) OR FIREABLE(t454) OR (FIREABLE(t53) AND FIREABLE(t341)) OR (FIREABLE(t276) AND FIREABLE(t378) AND NOT FIREABLE(t294))))
lola: state equation: Generated DNF with 282 literals and 30 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-03a-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: 33 markings, 117 edges
lola: ========================================

FORMULA DLCround-PT-03a-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no yes yes yes yes yes yes yes no yes no yes yes yes yes
lola:
preliminary result: no no yes yes yes yes yes yes yes no yes no yes yes yes yes
lola: memory consumption: 15152 KB
lola: time consumption: 1 seconds

BK_STOP 1526579833498

--------------------
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="DLCround-PT-03a"
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/DLCround-PT-03a.tgz
mv DLCround-PT-03a 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 DLCround-PT-03a, 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 r064-smll-152649735100007"
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 ;