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 184K
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K 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 6.0K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 10K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.8K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 115 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 353 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 13K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is HouseConstruction-PT-200, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-smll-152658630700098
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526725652868

info: Time: 3600 - MCC
===========================================================================================
prep: translating HouseConstruction-PT-200 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating HouseConstruction-PT-200 formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ HouseConstruction-PT-200 @ 3569 seconds
lola: LoLA will run for 3569 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 44/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 832
lola: finding significant places
lola: 26 places, 18 transitions, 18 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 24 transition conflict sets
lola: TASK
lola: reading formula from HouseConstruction-PT-200-ReachabilityFireability.task
lola: A (G ((FIREABLE(t1) OR NOT FIREABLE(t18) OR FIREABLE(t7)))) : E (F ((FIREABLE(t18) AND FIREABLE(t16) AND (NOT FIREABLE(t11) OR NOT FIREABLE(t17)) AND (FIREABLE(t16) OR FIREABLE(t8) OR NOT FIREABLE(t13))))) : E (F (((FIREABLE(t6) OR (NOT FIREABLE(t10) AND NOT FIREABLE(t13))) AND FIREABLE(t18)))) : E (F ((NOT FIREABLE(t1) AND FIREABLE(t4)))) : A (G ((NOT FIREABLE(t12) OR NOT FIREABLE(t4) OR (NOT FIREABLE(t14) AND NOT FIREABLE(t16)) OR NOT FIREABLE(t10)))) : E (F ((FIREABLE(t17) AND (FIREABLE(t8) OR FIREABLE(t13)) AND (FIREABLE(t16) OR (FIREABLE(t5) AND FIREABLE(t18))) AND FIREABLE(t16)))) : E (F ((FIREABLE(t18) AND (NOT FIREABLE(t8) OR NOT FIREABLE(t11) OR (NOT FIREABLE(t9) AND NOT FIREABLE(t15)))))) : A (G (())) : E (F ((FIREABLE(t16) AND FIREABLE(t12) AND FIREABLE(t18) AND FIREABLE(t11) AND (((FIREABLE(t15)) AND NOT FIREABLE(t8)) OR FIREABLE(t10))))) : E (F ((FIREABLE(t18) AND FIREABLE(t13)))) : E (F ((NOT FIREABLE(t3) AND NOT FIREABLE(t1) AND FIREABLE(t2) AND NOT FIREABLE(t6) AND NOT FIREABLE(t14) AND FIREABLE(t18) AND FIREABLE(t5) AND (FIREABLE(t18) OR FIREABLE(t10))))) : A (G ((NOT FIREABLE(t10) OR FIREABLE(t12) OR NOT FIREABLE(t10) OR NOT FIREABLE(t7) OR NOT FIREABLE(t18) OR NOT FIREABLE(t4)))) : E (F ((FIREABLE(t18) OR (FIREABLE(t10) AND FIREABLE(t12) AND FIREABLE(t14) AND (NOT FIREABLE(t10) OR NOT FIREABLE(t9)))))) : A (G ((FIREABLE(t14) OR FIREABLE(t1) OR FIREABLE(t6) OR FIREABLE(t9) OR FIREABLE(t3)))) : E (F ((NOT FIREABLE(t14) AND (NOT FIREABLE(t15) OR NOT FIREABLE(t9)) AND (FIREABLE(t16) OR FIREABLE(t11) OR NOT FIREABLE(t9) OR FIREABLE(t3))))) : A (G ((NOT FIREABLE(t17) OR NOT FIREABLE(t11))))
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 HouseConstruction-PT-200-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 HouseConstruction-PT-200-ReachabilityFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t1) AND FIREABLE(t4))))
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(t1) AND FIREABLE(t4))))
lola: processed formula length: 43
lola: 4 rewrites
lola: closed formula file HouseConstruction-PT-200-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(t1) AND FIREABLE(t4))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to HouseConstruction-PT-200-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: 203 markings, 202 edges
lola: ========================================

FORMULA HouseConstruction-PT-200-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t18) AND FIREABLE(t13))))
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(t18) AND FIREABLE(t13))))
lola: processed formula length: 41
lola: 4 rewrites
lola: closed formula file HouseConstruction-PT-200-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(t18) AND FIREABLE(t13))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 26 markings, 25 edges
lola: ========================================

FORMULA HouseConstruction-PT-200-ReachabilityFireability-9 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(t17) OR NOT FIREABLE(t11))))
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(t17) OR NOT FIREABLE(t11))))
lola: processed formula length: 49
lola: 5 rewrites
lola: closed formula file HouseConstruction-PT-200-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(t17) AND FIREABLE(t11))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to HouseConstruction-PT-200-ReachabilityFireability-3-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 18 markings, 17 edges
lola: ========================================

FORMULA HouseConstruction-PT-200-ReachabilityFireability-15 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: A (G ((FIREABLE(t1) OR NOT FIREABLE(t18) 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 ((FIREABLE(t1) OR NOT FIREABLE(t18) OR FIREABLE(t7))))
lola: processed formula length: 61
lola: 5 rewrites
lola: closed formula file HouseConstruction-PT-200-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(t1) AND FIREABLE(t18) AND NOT FIREABLE(t7))
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to HouseConstruction-PT-200-ReachabilityFireability-4-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 217 markings, 216 edges
lola: ========================================

FORMULA HouseConstruction-PT-200-ReachabilityFireability-0 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(t6) OR (NOT FIREABLE(t10) AND NOT FIREABLE(t13))) AND FIREABLE(t18))))
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(t6) OR (NOT FIREABLE(t10) AND NOT FIREABLE(t13))) AND FIREABLE(t18))))
lola: processed formula length: 88
lola: 4 rewrites
lola: closed formula file HouseConstruction-PT-200-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(t6) OR (NOT FIREABLE(t10) AND NOT FIREABLE(t13))) AND FIREABLE(t18))
lola: state equation: Generated DNF with 14 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 18 markings, 17 edges
lola: ========================================

FORMULA HouseConstruction-PT-200-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t18) AND (NOT FIREABLE(t8) OR NOT FIREABLE(t11) OR (NOT FIREABLE(t9) AND NOT FIREABLE(t15))))))
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(t18) AND (NOT FIREABLE(t8) OR NOT FIREABLE(t11) OR (NOT FIREABLE(t9) AND NOT FIREABLE(t15))))))
lola: processed formula length: 113
lola: 4 rewrites
lola: closed formula file HouseConstruction-PT-200-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(t18) AND (NOT FIREABLE(t8) OR NOT FIREABLE(t11) OR (NOT FIREABLE(t9) AND NOT FIREABLE(t15))))
lola: state equation: Generated DNF with 26 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to HouseConstruction-PT-200-ReachabilityFireability-6-0.sara
lola: SUBRESULT
lola: lola: state equation: calling and running sara
result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 18 markings, 17 edges

FORMULA HouseConstruction-PT-200-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t10) OR FIREABLE(t12) OR NOT FIREABLE(t10) OR NOT FIREABLE(t7) OR NOT FIREABLE(t18) OR NOT FIREABLE(t4))))
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(t10) OR FIREABLE(t12) OR NOT FIREABLE(t10) OR NOT FIREABLE(t7) OR NOT FIREABLE(t18) OR NOT FIREABLE(t4))))
lola: processed formula length: 131
lola: 5 rewrites
lola: closed formula file HouseConstruction-PT-200-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(t10) AND NOT FIREABLE(t12) AND FIREABLE(t10) AND FIREABLE(t7) AND FIREABLE(t18) AND FIREABLE(t4))
lola: state equation: Generated DNF with 10 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 31 markings, 30 edges
lola: state equation: write sara problem file to HouseConstruction-PT-200-ReachabilityFireability-7-0.sara

FORMULA HouseConstruction-PT-200-ReachabilityFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t18) OR (FIREABLE(t10) AND FIREABLE(t12) AND FIREABLE(t14) AND (NOT FIREABLE(t10) OR NOT FIREABLE(t9))))))
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(t18) OR (FIREABLE(t10) AND FIREABLE(t12) AND FIREABLE(t14) AND (NOT FIREABLE(t10) OR NOT FIREABLE(t9))))))
lola: processed formula length: 124
lola: 4 rewrites
lola: closed formula file HouseConstruction-PT-200-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: ========================================
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (FIREABLE(t18) OR (FIREABLE(t10) AND FIREABLE(t12) AND FIREABLE(t14) AND (NOT FIREABLE(t10) OR NOT FIREABLE(t9))))
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to HouseConstruction-PT-200-ReachabilityFireability-8-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: 18 markings, 17 edges
lola: ========================================

FORMULA HouseConstruction-PT-200-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t14) OR FIREABLE(t1) OR FIREABLE(t6) OR FIREABLE(t9) OR FIREABLE(t3))))
lola: sara: try reading problem file HouseConstruction-PT-200-ReachabilityFireability-6-0.sara.
========================================
lola: SUBTASK
lola: state equation: calling and running sara
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(t14) OR FIREABLE(t1) OR FIREABLE(t6) OR FIREABLE(t9) OR FIREABLE(t3))))
lola: processed formula length: 91
lola: 5 rewrites
lola: closed formula file HouseConstruction-PT-200-ReachabilityFireability.task
lola: STORE
lola: sara: try reading problem file HouseConstruction-PT-200-ReachabilityFireability-7-0.sara.
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(t14) AND NOT FIREABLE(t1) AND NOT FIREABLE(t6) AND NOT FIREABLE(t9) AND NOT FIREABLE(t3))
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to HouseConstruction-PT-200-ReachabilityFireability-9-0.sara
sara: place or transition ordering is non-deterministic
lola: state equation: calling and running sara
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 201 markings, 200 edges
lola: ========================================

FORMULA HouseConstruction-PT-200-ReachabilityFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t12) OR NOT FIREABLE(t4) OR (NOT FIREABLE(t14) AND NOT FIREABLE(t16)) OR NOT FIREABLE(t10))))
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(t12) OR NOT FIREABLE(t4) OR (NOT FIREABLE(t14) AND NOT FIREABLE(t16)) OR NOT FIREABLE(t10))))
lola: processed formula length: 116
lola: 5 rewrites
lola: closed formula file HouseConstruction-PT-200-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(t12) AND FIREABLE(t4) AND (FIREABLE(t14) OR FIREABLE(t16)) AND FIREABLE(t10))
lola: state equation: Generated DNF with 11 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to HouseConstruction-PT-200-ReachabilityFireability-10-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 22 markings, 21 edges
lola: ========================================

FORMULA HouseConstruction-PT-200-ReachabilityFireability-4 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: E (F ((FIREABLE(t17) AND (FIREABLE(t8) OR FIREABLE(t13)) AND (FIREABLE(t16) OR (FIREABLE(t5) AND FIREABLE(t18))) AND FIREABLE(t16))))
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(t17) AND (FIREABLE(t8) OR FIREABLE(t13)) AND (FIREABLE(t16) OR (FIREABLE(t5) AND FIREABLE(t18))) AND FIREABLE(t16))))
lola: processed formula length: 135
lola: 4 rewrites
lola: closed formula file HouseConstruction-PT-200-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(t17) AND (FIREABLE(t8) OR FIREABLE(t13)) AND (FIREABLE(t16) OR (FIREABLE(t5) AND FIREABLE(t18))) AND FIREABLE(t16))
lola: state equation: Generated DNF with 34 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to HouseConstruction-PT-200-ReachabilityFireability-11-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 29 markings, 28 edges
lola: ========================================

FORMULA HouseConstruction-PT-200-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: calling and running sara
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t14) AND (NOT FIREABLE(t15) OR NOT FIREABLE(t9)) AND (FIREABLE(t16) OR FIREABLE(t11) OR NOT FIREABLE(t9) OR FIREABLE(t3)))))
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(t14) AND (NOT FIREABLE(t15) OR NOT FIREABLE(t9)) AND (FIREABLE(t16) OR FIREABLE(t11) OR NOT FIREABLE(t9) OR FIREABLE(t3)))))
lola: processed formula length: 148
lola: 4 rewrites
lola: closed formula file HouseConstruction-PT-200-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(t14) AND (NOT FIREABLE(t15) OR NOT FIREABLE(t9)) AND (FIREABLE(t16) OR FIREABLE(t11) OR NOT FIREABLE(t9) OR FIREABLE(t3)))
lola: state equation: Generated DNF with 39 literals and 12 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to HouseConstruction-PT-200-ReachabilityFireability-12-0.sara
lola: ========================================

FORMULA HouseConstruction-PT-200-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t18) AND FIREABLE(t16) AND (NOT FIREABLE(t11) OR NOT FIREABLE(t17)) AND (FIREABLE(t16) OR FIREABLE(t8) OR NOT FIREABLE(t13)))))
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(t18) AND FIREABLE(t16) AND (NOT FIREABLE(t11) OR NOT FIREABLE(t17)) AND (FIREABLE(t16) OR FIREABLE(t8) OR NOT FIREABLE(t13)))))
lola: processed formula length: 146
lola: 4 rewrites
lola: closed formula file HouseConstruction-PT-200-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(t18) AND FIREABLE(t16) AND (NOT FIREABLE(t11) OR NOT FIREABLE(t17)) AND (FIREABLE(t16) OR FIREABLE(t8) OR NOT FIREABLE(t13)))
lola: state equation: Generated DNF with 48 literals and 6 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: state equation: write sara problem file to HouseConstruction-PT-200-ReachabilityFireability-13-0.sara
lola: produced by: state space
lola: The predicate is reachable.
lola: 30 markings, 29 edges

FORMULA HouseConstruction-PT-200-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t16) AND FIREABLE(t12) AND FIREABLE(t18) AND FIREABLE(t11) AND (((FIREABLE(t15)) AND NOT FIREABLE(t8)) OR FIREABLE(t10)))))
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(t16) AND FIREABLE(t12) AND FIREABLE(t18) AND FIREABLE(t11) AND (((FIREABLE(t15)) AND NOT FIREABLE(t8)) OR FIREABLE(t10)))))
lola: processed formula length: 140
lola: 4 rewrites
lola: closed formula file HouseConstruction-PT-200-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
sara: try reading problem file HouseConstruction-PT-200-ReachabilityFireability-11-0.sara.

sara: place or transition ordering is non-deterministic
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(t16) AND FIREABLE(t12) AND FIREABLE(t18) AND FIREABLE(t11) AND (((FIREABLE(t15)) AND NOT FIREABLE(t8)) OR FIREABLE(t10)))
lola: state equation: Generated DNF with 39 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 42 markings, 41 edges
lola: state equation: write sara problem file to HouseConstruction-PT-200-ReachabilityFireability-14-0.sara
lola: ========================================

FORMULA HouseConstruction-PT-200-ReachabilityFireability-8 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 ((NOT FIREABLE(t3) AND NOT FIREABLE(t1) AND FIREABLE(t2) AND NOT FIREABLE(t6) AND NOT FIREABLE(t14) AND FIREABLE(t18) AND FIREABLE(t5) AND (FIREABLE(t18) OR FIREABLE(t10)))))
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(t3) AND NOT FIREABLE(t1) AND FIREABLE(t2) AND NOT FIREABLE(t6) AND NOT FIREABLE(t14) AND FIREABLE(t18) AND FIREABLE(t5) AND (FIREABLE(t18) OR FIREABLE(t10)))))
lola: processed formula length: 180
lola: 4 rewrites
lola: closed formula file HouseConstruction-PT-200-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(t3) AND NOT FIREABLE(t1) AND FIREABLE(t2) AND NOT FIREABLE(t6) AND NOT FIREABLE(t14) AND FIREABLE(t18) AND FIREABLE(t5) AND (FIREABLE(t18) OR FIREABLE(t10)))
lola: state equation: Generated DNF with 25 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to HouseConstruction-PT-200-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: 221 markings, 220 edges
lola: ========================================

FORMULA HouseConstruction-PT-200-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes yes yes no yes yes yes yes yes yes no yes no yes no
lola:
preliminary result: no yes yes yes no yes yes yes yes yes yes no yes no yes no

lola: memory consumption: 14776 KB
lola: time consumption: 0 seconds

BK_STOP 1526725653189

--------------------
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="HouseConstruction-PT-200"
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/HouseConstruction-PT-200.tgz
mv HouseConstruction-PT-200 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 HouseConstruction-PT-200, 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 r100-smll-152658630700098"
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 ;