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 248K
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.4K 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 7.7K 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 17K 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.7K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K 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 88K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is RwMutex-PT-r0010w0050, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r148-smll-152685547000112
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526945353954

info: Time: 3600 - MCC
===========================================================================================
prep: translating RwMutex-PT-r0010w0050 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-r0010w0050 formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ RwMutex-PT-r0010w0050 @ 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: 250/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 130
lola: finding significant places
lola: 130 places, 120 transitions, 60 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 71 transition conflict sets
lola: TASK
lola: reading formula from RwMutex-PT-r0010w0050-ReachabilityFireability.task
lola: E (F (((NOT FIREABLE(t75) AND (FIREABLE(t104) OR FIREABLE(t37)) AND NOT FIREABLE(t57) AND NOT FIREABLE(t119)) OR ((NOT FIREABLE(t41) OR NOT FIREABLE(t110)) AND NOT FIREABLE(t101))))) : E (F ((((NOT FIREABLE(t9) OR NOT FIREABLE(t102)) AND (NOT FIREABLE(t117) OR NOT FIREABLE(t56))) OR ((FIREABLE(t37) OR FIREABLE(t105)) AND NOT FIREABLE(t50) AND FIREABLE(t117) AND FIREABLE(t98) AND (FIREABLE(t74) OR FIREABLE(t69)))))) : E (F (FIREABLE(t66))) : E (F ((NOT FIREABLE(t88) AND (FIREABLE(t59) OR FIREABLE(t60) OR FIREABLE(t61)) AND FIREABLE(t53)))) : E (F (FIREABLE(t15))) : A (G ((NOT FIREABLE(t22) AND FIREABLE(t103) AND (FIREABLE(t55) OR FIREABLE(t102)) AND FIREABLE(t28) AND FIREABLE(t33)))) : E (F ((FIREABLE(t83) OR ((NOT FIREABLE(t1) OR FIREABLE(t59)) AND FIREABLE(t43))))) : A (G (FIREABLE(t81))) : A (G ((((NOT FIREABLE(t80) OR NOT FIREABLE(t53)) AND NOT FIREABLE(t50)) OR FIREABLE(t68)))) : A (G (FIREABLE(t80))) : E (F ((NOT FIREABLE(t107) AND NOT FIREABLE(t95) AND NOT FIREABLE(t17) AND NOT FIREABLE(t109) AND (FIREABLE(t54) OR NOT FIREABLE(t35) OR NOT FIREABLE(t55) OR NOT FIREABLE(t22))))) : A (G (FIREABLE(t79))) : E (F (((FIREABLE(t74) OR NOT FIREABLE(t103)) AND FIREABLE(t10) AND FIREABLE(t35)))) : E (F (NOT FIREABLE(t38))) : A (G ((FIREABLE(t79) OR FIREABLE(t17) OR (FIREABLE(t88) AND FIREABLE(t70)) OR (FIREABLE(t88) AND FIREABLE(t62) AND (FIREABLE(t1) OR FIREABLE(t92))) OR FIREABLE(t85)))) : A (G (((NOT FIREABLE(t39) OR (FIREABLE(t52) AND FIREABLE(t99))) AND FIREABLE(t50) AND NOT FIREABLE(t19) AND NOT FIREABLE(t73) AND ((FIREABLE(t40) AND FIREABLE(t99)) OR (FIREABLE(t15) AND FIREABLE(t66))))))
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(t66)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (FIREABLE(t66)))
lola: processed formula length: 21
lola: 1 rewrites
lola: closed formula file RwMutex-PT-r0010w0050-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(t66)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: write sara problem file to RwMutex-PT-r0010w0050-ReachabilityFireability-0.sara
lola: The predicate is reachable.
lola: 2 markings, 1 edges
lola: ========================================
lola: state equation: calling and running sara

FORMULA RwMutex-PT-r0010w0050-ReachabilityFireability-2 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(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(t15)))
lola: processed formula length: 21
lola: 1 rewrites
lola: closed formula file RwMutex-PT-r0010w0050-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(t15)
lola: state equation: Generated DNF with 11 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA RwMutex-PT-r0010w0050-ReachabilityFireability-4 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(t81)))
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(t81)))
lola: processed formula length: 21
lola: 2 rewrites
lola: closed formula file RwMutex-PT-r0010w0050-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(t81)
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-r0010w0050-ReachabilityFireability-7 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)
sara: try reading problem file RwMutex-PT-r0010w0050-ReachabilityFireability-0.sara.
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(t80)))
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(t80)))
lola: processed formula length: 21
lola: 2 rewrites
lola: closed formula file RwMutex-PT-r0010w0050-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)
sara: could not read problem information -- aborting [#01]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges

FORMULA RwMutex-PT-r0010w0050-ReachabilityFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: NOT FIREABLE(t80)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(t79)))
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(t79)))
lola: processed formula length: 21
lola: 2 rewrites
lola: closed formula file RwMutex-PT-r0010w0050-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(t79)
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RwMutex-PT-r0010w0050-ReachabilityFireability-4-0.sara

FORMULA RwMutex-PT-r0010w0050-ReachabilityFireability-11 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 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (NOT 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 (NOT FIREABLE(t38)))
lola: processed formula length: 25
lola: 1 rewrites
lola: closed formula file RwMutex-PT-r0010w0050-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(t38)
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: Generated DNF with 11 literals and 11 conjunctive subformulas
lola: The predicate is reachable.
lola: 2 markings, 1 edges
lola: ========================================

FORMULA RwMutex-PT-r0010w0050-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
sara: try reading problem file RwMutex-PT-r0010w0050-ReachabilityFireability-4-0.sara.
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((NOT FIREABLE(t80) OR NOT FIREABLE(t53)) AND NOT FIREABLE(t50)) OR FIREABLE(t68))))
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(t80) OR NOT FIREABLE(t53)) AND NOT FIREABLE(t50)) OR FIREABLE(t68))))
lola: processed formula length: 93
lola: 2 rewrites
lola: closed formula file RwMutex-PT-r0010w0050-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola:
FORMULA RwMutex-PT-r0010w0050-ReachabilityFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t74) OR NOT FIREABLE(t103)) AND FIREABLE(t10) AND FIREABLE(t35))))
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(t74) OR NOT FIREABLE(t103)) AND FIREABLE(t10) AND FIREABLE(t35))))
lola: processed formula length: 84
lola: 1 rewrites
lola: closed formula file RwMutex-PT-r0010w0050-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: ========================================

FORMULA RwMutex-PT-r0010w0050-ReachabilityFireability-12 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: E (F ((FIREABLE(t83) OR ((NOT FIREABLE(t1) OR FIREABLE(t59)) AND FIREABLE(t43)))))
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(t83) OR ((NOT FIREABLE(t1) OR FIREABLE(t59)) AND FIREABLE(t43)))))
lola: processed formula length: 84
lola: 1 rewrites
lola: closed formula file RwMutex-PT-r0010w0050-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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (FIREABLE(t83) OR ((NOT FIREABLE(t1) OR FIREABLE(t59)) AND FIREABLE(t43)))
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA RwMutex-PT-r0010w0050-ReachabilityFireability-6 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: E (F ((NOT FIREABLE(t88) AND (FIREABLE(t59) OR FIREABLE(t60) OR FIREABLE(t61)) AND FIREABLE(t53))))
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(t88) AND (FIREABLE(t59) OR FIREABLE(t60) OR FIREABLE(t61)) AND FIREABLE(t53))))
lola: processed formula length: 101
lola: 1 rewrites
lola: closed formula file RwMutex-PT-r0010w0050-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: formula 0: (NOT FIREABLE(t88) AND (FIREABLE(t59) OR FIREABLE(t60) OR FIREABLE(t61)) AND FIREABLE(t53))
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: state equation: Generated DNF with 59 literals and 3 conjunctive subformulas
lola: ========================================

FORMULA RwMutex-PT-r0010w0050-ReachabilityFireability-3 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(t22) AND FIREABLE(t103) AND (FIREABLE(t55) OR FIREABLE(t102)) AND FIREABLE(t28) AND FIREABLE(t33))))
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(t22) AND FIREABLE(t103) AND (FIREABLE(t55) OR FIREABLE(t102)) AND FIREABLE(t28) AND FIREABLE(t33))))
lola: processed formula length: 121
lola: 2 rewrites
lola: closed formula file RwMutex-PT-r0010w0050-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(t22) OR NOT FIREABLE(t103) OR (NOT FIREABLE(t55) AND NOT FIREABLE(t102)) OR NOT FIREABLE(t28) OR NOT FIREABLE(t33))
lola: state equation: Generated DNF with 56 literals and 35 conjunctive subformulas
lola: state equation: write sara problem file to RwMutex-PT-r0010w0050-ReachabilityFireability-10-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA RwMutex-PT-r0010w0050-ReachabilityFireability-5 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 ((NOT FIREABLE(t107) AND NOT FIREABLE(t95) AND NOT FIREABLE(t17) AND NOT FIREABLE(t109) AND (FIREABLE(t54) OR NOT FIREABLE(t35) OR NOT FIREABLE(t55) OR NOT FIREABLE(t22)))))
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(t107) AND NOT FIREABLE(t95) AND NOT FIREABLE(t17) AND NOT FIREABLE(t109) AND (FIREABLE(t54) OR NOT FIREABLE(t35) OR NOT FIREABLE(t55) OR NOT FIREABLE(t22)))))
lola: processed formula length: 181
lola: 1 rewrites
lola: closed formula file RwMutex-PT-r0010w0050-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2 markings, 1 edges
lola: formula 0: (NOT FIREABLE(t107) AND NOT FIREABLE(t95) AND NOT FIREABLE(t17) AND NOT FIREABLE(t109) AND (FIREABLE(t54) OR NOT FIREABLE(t35) OR NOT FIREABLE(t55) OR NOT FIREABLE(t22)))
lola: ========================================

FORMULA RwMutex-PT-r0010w0050-ReachabilityFireability-10 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: E (F (((NOT FIREABLE(t75) AND (FIREABLE(t104) OR FIREABLE(t37)) AND NOT FIREABLE(t57) AND NOT FIREABLE(t119)) OR ((NOT FIREABLE(t41) OR NOT FIREABLE(t110)) AND NOT FIREABLE(t101)))))
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(t75) AND (FIREABLE(t104) OR FIREABLE(t37)) AND NOT FIREABLE(t57) AND NOT FIREABLE(t119)) OR ((NOT FIREABLE(t41) OR NOT FIREABLE(t110)) AND NOT FIREABLE(t101)))))
lola: processed formula length: 185
lola: 1 rewrites
lola: closed formula file RwMutex-PT-r0010w0050-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(t75) AND (FIREABLE(t104) OR FIREABLE(t37)) AND NOT FIREABLE(t57) AND NOT FIREABLE(t119)) OR ((NOT FIREABLE(t41) OR NOT FIREABLE(t110)) AND NOT FIREABLE(t101)))
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 82 literals and 24 conjunctive subformulas
lola: ========================================

FORMULA RwMutex-PT-r0010w0050-ReachabilityFireability-0 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 ((FIREABLE(t79) OR FIREABLE(t17) OR (FIREABLE(t88) AND FIREABLE(t70)) OR (FIREABLE(t88) AND FIREABLE(t62) AND (FIREABLE(t1) OR FIREABLE(t92))) OR FIREABLE(t85))))
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(t79) OR FIREABLE(t17) OR (FIREABLE(t88) AND FIREABLE(t70)) OR (FIREABLE(t88) AND FIREABLE(t62) AND (FIREABLE(t1) OR FIREABLE(t92))) OR FIREABLE(t85))))
lola: processed formula length: 172
lola: 2 rewrites
lola: closed formula file RwMutex-PT-r0010w0050-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2 markings, 1 edges
lola: ========================================

FORMULA RwMutex-PT-r0010w0050-ReachabilityFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t39) OR (FIREABLE(t52) AND FIREABLE(t99))) AND FIREABLE(t50) AND NOT FIREABLE(t19) AND NOT FIREABLE(t73) AND ((FIREABLE(t40) AND FIREABLE(t99)) OR (FIREABLE(t15) AND FIREABLE(t66))))))
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(t39) OR (FIREABLE(t52) AND FIREABLE(t99))) AND FIREABLE(t50) AND NOT FIREABLE(t19) AND NOT FIREABLE(t73) AND ((FIREABLE(t40) AND FIREABLE(t99)) OR (FIREABLE(t15) AND FIREABLE(t66))))))
lola: processed formula length: 207
lola: 2 rewrites
lola: closed formula file RwMutex-PT-r0010w0050-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA RwMutex-PT-r0010w0050-ReachabilityFireability-15 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 ((((NOT FIREABLE(t9) OR NOT FIREABLE(t102)) AND (NOT FIREABLE(t117) OR NOT FIREABLE(t56))) OR ((FIREABLE(t37) OR FIREABLE(t105)) AND NOT FIREABLE(t50) AND FIREABLE(t117) AND FIREABLE(t98) AND (FIREABLE(t74) OR FIREABLE(t69))))))
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(t9) OR NOT FIREABLE(t102)) AND (NOT FIREABLE(t117) OR NOT FIREABLE(t56))) OR ((FIREABLE(t37) OR FIREABLE(t105)) AND NOT FIREABLE(t50) AND FIREABLE(t117) AND FIREABLE(t98) AND (FIREABLE(t74) OR FIREABLE(t69))))))
lola: processed formula length: 238
lola: 1 rewrites
lola: closed formula file RwMutex-PT-r0010w0050-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: ========================================

FORMULA RwMutex-PT-r0010w0050-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes yes yes yes yes no yes no no no yes no yes yes no no
lola:
preliminary result: yes yes yes yes yes no yes no no no yes no yes yes no no
sara: place or transition ordering is non-deterministic

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

BK_STOP 1526945354323

--------------------
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-r0010w0050"
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-r0010w0050.tgz
mv RwMutex-PT-r0010w0050 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-r0010w0050, 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-152685547000112"
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 ;