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 328K
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 10K 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 9.0K 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 9.7K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K 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 112 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 350 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K 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 11 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 172K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is RwMutex-PT-r0010w0100, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r148-smll-152685547000119
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526947649823

info: Time: 3600 - MCC
===========================================================================================
prep: translating RwMutex-PT-r0010w0100 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: added safe information to the net based on GenericPropertiesVerdict
prep: check for too many tokens
===========================================================================================
prep: translating RwMutex-PT-r0010w0100 formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ RwMutex-PT-r0010w0100 @ 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: 450/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 230
lola: finding significant places
lola: 230 places, 220 transitions, 110 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 121 transition conflict sets
lola: TASK
lola: reading formula from RwMutex-PT-r0010w0100-ReachabilityFireability.task
lola: A (G ((NOT FIREABLE(t158) OR NOT FIREABLE(t180) OR FIREABLE(t165) OR NOT FIREABLE(t188)))) : E (F ((FIREABLE(t53) AND (FIREABLE(t64) OR FIREABLE(t134))))) : A (G ((FIREABLE(t100) OR FIREABLE(t155) OR FIREABLE(t174) OR FIREABLE(t142) OR ((FIREABLE(t112) OR NOT FIREABLE(t219)) AND (FIREABLE(t127) OR FIREABLE(t91) OR FIREABLE(t110)))))) : A (G ((NOT FIREABLE(t183) AND FIREABLE(t167)))) : E (F (FIREABLE(t38))) : E (F ((FIREABLE(t77) AND FIREABLE(t6) AND ((FIREABLE(t39) AND FIREABLE(t155)) OR (FIREABLE(t119) AND FIREABLE(t139))) AND (NOT FIREABLE(t214) OR (FIREABLE(t160) AND FIREABLE(t171)) OR FIREABLE(t212) OR FIREABLE(t192) OR FIREABLE(t62))))) : A (G ((NOT FIREABLE(t1) OR NOT FIREABLE(t189) OR FIREABLE(t197) OR (NOT FIREABLE(t152) AND NOT FIREABLE(t52) AND (NOT FIREABLE(t83) OR NOT FIREABLE(t48)))))) : E (F (FIREABLE(t149))) : A (G ((NOT FIREABLE(t49) OR NOT FIREABLE(t196) OR NOT FIREABLE(t35) OR NOT FIREABLE(t51) OR ((FIREABLE(t46) OR FIREABLE(t220)) AND NOT FIREABLE(t43)) OR FIREABLE(t205)))) : A (G ((FIREABLE(t65) AND FIREABLE(t39)))) : E (F ((FIREABLE(t19) AND NOT FIREABLE(t132)))) : A (G (FIREABLE(t32))) : A (G (FIREABLE(t125))) : E (F ((FIREABLE(t169) OR FIREABLE(t58) OR (NOT FIREABLE(t204) AND NOT FIREABLE(t128) AND NOT FIREABLE(t218) AND NOT FIREABLE(t17))))) : A (G ((NOT FIREABLE(t77) OR NOT FIREABLE(t199) OR FIREABLE(t12) OR FIREABLE(t172)))) : A (G (FIREABLE(t94)))
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(t38)))
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(t38)))
lola: processed formula length: 21
lola: 1 rewrites
lola: closed formula file RwMutex-PT-r0010w0100-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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: FIREABLE(t38)
lola: state equation: Generated DNF with 11 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RwMutex-PT-r0010w0100-ReachabilityFireability-0.sara
lola: ========================================

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

FORMULA RwMutex-PT-r0010w0100-ReachabilityFireability-7 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: A (G (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 (FIREABLE(t32)))
lola: processed formula length: 21
lola: 2 rewrites
lola: closed formula file RwMutex-PT-r0010w0100-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(t32)
lola: state equation: Generated DNF with 11 literals and 11 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2 markings, 1 edges
lola: ========================================

FORMULA RwMutex-PT-r0010w0100-ReachabilityFireability-11 FALSE 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 (FIREABLE(t125)))
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(t125)))
lola: processed formula length: 22
lola: 2 rewrites
lola: closed formula file RwMutex-PT-r0010w0100-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(t125)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA RwMutex-PT-r0010w0100-ReachabilityFireability-12 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(t94)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (FIREABLE(t94)))
lola: processed formula length: 21
lola: 2 rewrites
lola: closed formula file RwMutex-PT-r0010w0100-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(t94)
lola: state equation: Generated DNF with 11 literals and 11 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2 markings, 1 edges
lola: ========================================

FORMULA RwMutex-PT-r0010w0100-ReachabilityFireability-15 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: A (G ((NOT FIREABLE(t183) AND FIREABLE(t167))))
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(t183) AND FIREABLE(t167))))
lola: processed formula length: 47
lola: 2 rewrites
lola: closed formula file RwMutex-PT-r0010w0100-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(t183) OR NOT FIREABLE(t167))
lola: SUBRESULT
lola: result: no
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA RwMutex-PT-r0010w0100-ReachabilityFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t65) AND FIREABLE(t39))))
lola: sara: try reading problem file RwMutex-PT-r0010w0100-ReachabilityFireability-0.sara.
========================================
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(t65) AND FIREABLE(t39))))
lola: processed formula length: 41
lola: 2 rewrites
lola: closed formula file RwMutex-PT-r0010w0100-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(t65) OR NOT FIREABLE(t39))
lola: state equation: Generated DNF with 22 literals and 22 conjunctive subformulas
lola: state equation: write sara problem file to RwMutex-PT-r0010w0100-ReachabilityFireability-6-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2 markings, 1 edges
lola: ========================================

FORMULA RwMutex-PT-r0010w0100-ReachabilityFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t19) AND NOT FIREABLE(t132))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((FIREABLE(t19) AND NOT FIREABLE(t132))))
lola: processed formula length: 46
lola: 1 rewrites
lola: closed formula file RwMutex-PT-r0010w0100-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(t19) AND NOT FIREABLE(t132))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: state equation: Generated DNF with 12 literals and 1 conjunctive subformulas

FORMULA RwMutex-PT-r0010w0100-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: write sara problem file to RwMutex-PT-r0010w0100-ReachabilityFireability-7-0.sara
lola: ========================================
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t53) AND (FIREABLE(t64) OR FIREABLE(t134)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((FIREABLE(t53) AND (FIREABLE(t64) OR FIREABLE(t134)))))
lola: processed formula length: 62
lola: 1 rewrites
lola: closed formula file RwMutex-PT-r0010w0100-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(t53) AND (FIREABLE(t64) OR FIREABLE(t134)))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: state equation: Generated DNF with 34 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to RwMutex-PT-r0010w0100-ReachabilityFireability-8-0.sara
lola: ========================================

FORMULA RwMutex-PT-r0010w0100-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: calling and running sara
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t77) OR NOT FIREABLE(t199) OR FIREABLE(t12) OR FIREABLE(t172))))
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) OR NOT FIREABLE(t199) OR FIREABLE(t12) OR FIREABLE(t172))))
lola: processed formula length: 87
lola: 2 rewrites
lola: closed formula file RwMutex-PT-r0010w0100-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) AND FIREABLE(t199) AND NOT FIREABLE(t12) AND NOT FIREABLE(t172))
sara: try reading problem file RwMutex-PT-r0010w0100-ReachabilityFireability-8-0.sara.
lola: state equation: Generated DNF with 14 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RwMutex-PT-r0010w0100-ReachabilityFireability-9-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 111 markings, 220 edges
lola: ========================================

FORMULA RwMutex-PT-r0010w0100-ReachabilityFireability-14 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: A (G ((NOT FIREABLE(t158) OR NOT FIREABLE(t180) OR FIREABLE(t165) OR NOT FIREABLE(t188))))
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(t158) OR NOT FIREABLE(t180) OR FIREABLE(t165) OR NOT FIREABLE(t188))))
lola: processed formula length: 93
lola: 2 rewrites
lola: closed formula file RwMutex-PT-r0010w0100-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(t158) AND FIREABLE(t180) AND NOT FIREABLE(t165) AND FIREABLE(t188))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RwMutex-PT-r0010w0100-ReachabilityFireability-10-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 111 markings, 220 edges
lola: ========================================

FORMULA RwMutex-PT-r0010w0100-ReachabilityFireability-0 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: E (F ((FIREABLE(t169) OR FIREABLE(t58) OR (NOT FIREABLE(t204) AND NOT FIREABLE(t128) AND NOT FIREABLE(t218) AND NOT FIREABLE(t17)))))
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(t169) OR FIREABLE(t58) OR (NOT FIREABLE(t204) AND NOT FIREABLE(t128) AND NOT FIREABLE(t218) AND NOT FIREABLE(t17)))))
lola: processed formula length: 135
lola: 1 rewrites
lola: closed formula file RwMutex-PT-r0010w0100-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(t169) OR FIREABLE(t58) OR (NOT FIREABLE(t204) AND NOT FIREABLE(t128) AND NOT FIREABLE(t218) AND NOT FIREABLE(t17)))
lola: state equation: Generated DNF with 56 literals and 13 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 RwMutex-PT-r0010w0100-ReachabilityFireability-11-0.sara
lola: ========================================

FORMULA RwMutex-PT-r0010w0100-ReachabilityFireability-13 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(t1) OR NOT FIREABLE(t189) OR FIREABLE(t197) OR (NOT FIREABLE(t152) AND NOT FIREABLE(t52) AND (NOT FIREABLE(t83) OR NOT FIREABLE(t48))))))
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(t1) OR NOT FIREABLE(t189) OR FIREABLE(t197) OR (NOT FIREABLE(t152) AND NOT FIREABLE(t52) AND (NOT FIREABLE(t83) OR NOT FIREABLE(t48))))))
lola: processed formula length: 161
lola: 2 rewrites
lola: closed formula file RwMutex-PT-r0010w0100-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
sara: place or transition ordering is non-deterministic
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(t1) AND FIREABLE(t189) AND NOT FIREABLE(t197) AND (FIREABLE(t152) OR FIREABLE(t52) OR (FIREABLE(t83) AND FIREABLE(t48))))
lola: state equation: Generated DNF with 46 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to RwMutex-PT-r0010w0100-ReachabilityFireability-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RwMutex-PT-r0010w0100-ReachabilityFireability-12-0.sara.

lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 111 markings, 220 edges
lola: ========================================

FORMULA RwMutex-PT-r0010w0100-ReachabilityFireability-6 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: A (G ((NOT FIREABLE(t49) OR NOT FIREABLE(t196) OR NOT FIREABLE(t35) OR NOT FIREABLE(t51) OR ((FIREABLE(t46) OR FIREABLE(t220)) AND NOT FIREABLE(t43)) 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(t49) OR NOT FIREABLE(t196) OR NOT FIREABLE(t35) OR NOT FIREABLE(t51) OR ((FIREABLE(t46) OR FIREABLE(t220)) AND NOT FIREABLE(t43)) OR FIREABLE(t205))))
lola: processed formula length: 176
lola: 2 rewrites
lola: closed formula file RwMutex-PT-r0010w0100-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(t49) AND FIREABLE(t196) AND FIREABLE(t35) AND FIREABLE(t51) AND ((NOT FIREABLE(t46) AND NOT FIREABLE(t220)) OR FIREABLE(t43)) AND NOT FIREABLE(t205))
lola: state equation: Generated DNF with 83 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to RwMutex-PT-r0010w0100-ReachabilityFireability-13-0.sara
lola: state equation: calling and running sara
sara: place or transition ordering is non-deterministic
sara: try reading problem file RwMutex-PT-r0010w0100-ReachabilityFireability-13-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 111 markings, 220 edges
lola: ========================================

FORMULA RwMutex-PT-r0010w0100-ReachabilityFireability-8 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: A (G ((FIREABLE(t100) OR FIREABLE(t155) OR FIREABLE(t174) OR FIREABLE(t142) OR ((FIREABLE(t112) OR NOT FIREABLE(t219)) AND (FIREABLE(t127) OR FIREABLE(t91) OR FIREABLE(t110))))))
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(t100) OR FIREABLE(t155) OR FIREABLE(t174) OR FIREABLE(t142) OR ((FIREABLE(t112) OR NOT FIREABLE(t219)) AND (FIREABLE(t127) OR FIREABLE(t91) OR FIREABLE(t110))))))
lola: processed formula length: 185
lola: 2 rewrites
lola: closed formula file RwMutex-PT-r0010w0100-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: formula 0: (NOT FIREABLE(t100) AND NOT FIREABLE(t155) AND NOT FIREABLE(t174) AND NOT FIREABLE(t142) AND ((NOT FIREABLE(t112) AND FIREABLE(t219)) OR (NOT FIREABLE(t127) AND NOT FIREABLE(t91) AND NOT FIREABLE(t110))))
lola: The predicate is not invariant.
lola: 2 markings, 1 edges
lola: ========================================

FORMULA RwMutex-PT-r0010w0100-ReachabilityFireability-2 FALSE 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(t77) AND FIREABLE(t6) AND ((FIREABLE(t39) AND FIREABLE(t155)) OR (FIREABLE(t119) AND FIREABLE(t139))) AND (NOT FIREABLE(t214) OR (FIREABLE(t160) AND FIREABLE(t171)) OR FIREABLE(t212) OR FIREABLE(t192) OR 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 ((FIREABLE(t77) AND FIREABLE(t6) AND ((FIREABLE(t39) AND FIREABLE(t155)) OR (FIREABLE(t119) AND FIREABLE(t139))) AND (NOT FIREABLE(t214) OR (FIREABLE(t160) AND FIREABLE(t171)) OR FIREABLE(t212) OR FIREABLE(t192) OR FIREABLE(t62)))))
lola: processed formula length: 242
lola: 1 rewrites
lola: closed formula file RwMutex-PT-r0010w0100-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(t77) AND FIREABLE(t6) AND ((FIREABLE(t39) AND FIREABLE(t155)) OR (FIREABLE(t119) AND FIREABLE(t139))) AND (NOT FIREABLE(t214) OR (FIREABLE(t160) AND FIREABLE(t171)) OR FIREABLE(t212) OR FIREABLE(t192) OR FIREABLE(t62)))
lola: state equation: Generated DNF with 232 literals and 10 conjunctive subformulas
lola: state equation: write sara problem file to RwMutex-PT-r0010w0100-ReachabilityFireability-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RwMutex-PT-r0010w0100-ReachabilityFireability-15-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 111 markings, 220 edges
lola:
FORMULA RwMutex-PT-r0010w0100-ReachabilityFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes yes no no yes no yes yes yes no yes no no yes yes no
lola:
preliminary result: yes yes no no yes no yes yes yes no yes no no yes yes no
========================================
lola: memory consumption: 15016 KB
lola: time consumption: 0 seconds


BK_STOP 1526947650300

--------------------
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="RwMutex-PT-r0010w0100"
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/RwMutex-PT-r0010w0100.tgz
mv RwMutex-PT-r0010w0100 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 RwMutex-PT-r0010w0100, 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 r148-smll-152685547000119"
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 ;