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 212K
-rw-r--r-- 1 mcc users 3.5K 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 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.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.7K 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 8.2K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K 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.8K 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 11 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 43K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is RwMutex-PT-r0020w0010, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r148-smll-152685547100147
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526952190526

info: Time: 3600 - MCC
===========================================================================================
prep: translating RwMutex-PT-r0020w0010 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-r0020w0010 formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ RwMutex-PT-r0020w0010 @ 3570 seconds
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 140/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 80
lola: finding significant places
lola: 80 places, 60 transitions, 30 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 51 transition conflict sets
lola: TASK
lola: reading formula from RwMutex-PT-r0020w0010-ReachabilityFireability.task
lola: E (F ((FIREABLE(t57) AND FIREABLE(t43) AND NOT FIREABLE(t49)))) : E (F ((FIREABLE(t8) AND FIREABLE(t16) AND FIREABLE(t38) AND (NOT FIREABLE(t51) OR NOT FIREABLE(t24)) AND FIREABLE(t3)))) : E (F (())) : E (F ((FIREABLE(t23) AND FIREABLE(t51)))) : A (G ((NOT FIREABLE(t59) OR NOT FIREABLE(t25)))) : E (F ((FIREABLE(t35) AND FIREABLE(t56) AND ((FIREABLE(t50) AND FIREABLE(t45)) OR (FIREABLE(t21) AND FIREABLE(t19))) AND FIREABLE(t15) AND (FIREABLE(t11) OR FIREABLE(t36)) AND NOT FIREABLE(t29)))) : E (F ((FIREABLE(t57) AND (FIREABLE(t12) OR FIREABLE(t38))))) : E (F ((FIREABLE(t37) AND FIREABLE(t28) AND (NOT FIREABLE(t48) OR NOT FIREABLE(t47) OR NOT FIREABLE(t9))))) : E (F ((FIREABLE(t6) AND FIREABLE(t35) AND (FIREABLE(t51) OR FIREABLE(t28))))) : A (G ((NOT FIREABLE(t28) OR (FIREABLE(t22) AND NOT FIREABLE(t48))))) : A (G ((NOT FIREABLE(t11) OR NOT FIREABLE(t58) OR (FIREABLE(t44) AND FIREABLE(t9) AND NOT FIREABLE(t31)) OR FIREABLE(t25)))) : A (G (((NOT FIREABLE(t41) AND NOT FIREABLE(t25)) OR NOT FIREABLE(t54) OR FIREABLE(t7)))) : A (G (((FIREABLE(t6) AND FIREABLE(t27) AND FIREABLE(t26)) OR FIREABLE(t39) OR NOT FIREABLE(t7) OR NOT FIREABLE(t30) OR NOT FIREABLE(t17)))) : E (F ((FIREABLE(t26) AND FIREABLE(t53) AND (FIREABLE(t11) OR FIREABLE(t22))))) : A (G ((NOT FIREABLE(t58) OR NOT FIREABLE(t19) OR NOT FIREABLE(t16) OR FIREABLE(t17) OR FIREABLE(t55)))) : A (G ((NOT FIREABLE(t18) OR NOT FIREABLE(t58))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 3 rewrites
lola: closed formula file RwMutex-PT-r0020w0010-ReachabilityFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA RwMutex-PT-r0020w0010-ReachabilityFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t23) AND FIREABLE(t51))))
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(t23) AND FIREABLE(t51))))
lola: processed formula length: 41
lola: 4 rewrites
lola: closed formula file RwMutex-PT-r0020w0010-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(t23) AND FIREABLE(t51))
lola: state equation: Generated DNF with 22 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RwMutex-PT-r0020w0010-ReachabilityFireability-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 31 markings, 60 edges
lola: ========================================

FORMULA RwMutex-PT-r0020w0010-ReachabilityFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t59) OR NOT FIREABLE(t25))))
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(t59) OR NOT FIREABLE(t25))))
lola: processed formula length: 49
lola: 5 rewrites
lola: closed formula file RwMutex-PT-r0020w0010-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(t59) AND FIREABLE(t25))
lola: state equation: Generated DNF with 22 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 31 markings, 60 edges

FORMULA RwMutex-PT-r0020w0010-ReachabilityFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t18) OR NOT FIREABLE(t58))))
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(t18) OR NOT FIREABLE(t58))))
lola: processed formula length: 49
lola: 5 rewrites
lola: closed formula file RwMutex-PT-r0020w0010-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(t18) AND FIREABLE(t58))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RwMutex-PT-r0020w0010-ReachabilityFireability-3-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 31 markings, 60 edges
lola: ========================================

FORMULA RwMutex-PT-r0020w0010-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t57) AND (FIREABLE(t12) OR 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(t57) AND (FIREABLE(t12) OR FIREABLE(t38)))))
lola: processed formula length: 61
lola: 4 rewrites
lola: closed formula file RwMutex-PT-r0020w0010-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(t57) AND (FIREABLE(t12) OR FIREABLE(t38)))
lola: state equation: Generated DNF with 5 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to RwMutex-PT-r0020w0010-ReachabilityFireability-4-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 32 markings, 62 edges

FORMULA RwMutex-PT-r0020w0010-ReachabilityFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t28) OR (FIREABLE(t22) AND 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(t28) OR (FIREABLE(t22) AND NOT FIREABLE(t48)))))
lola: processed formula length: 69
lola: 5 rewrites
lola: closed formula file RwMutex-PT-r0020w0010-ReachabilityFireability.task
lola: lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
state equation: calling and running sara
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(t28) AND (NOT FIREABLE(t22) OR FIREABLE(t48)))
lola: state equation: Generated DNF with 44 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to RwMutex-PT-r0020w0010-ReachabilityFireability-5-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: 31 markings, 60 edges
lola: ========================================

FORMULA RwMutex-PT-r0020w0010-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t57) AND FIREABLE(t43) AND NOT FIREABLE(t49))))
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(t57) AND FIREABLE(t43) AND NOT FIREABLE(t49))))
lola: processed formula length: 63
lola: 4 rewrites
sara: lola: try reading problem file RwMutex-PT-r0020w0010-ReachabilityFireability-4-0.sara.
closed formula file RwMutex-PT-r0020w0010-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(t57) AND FIREABLE(t43) AND NOT FIREABLE(t49))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RwMutex-PT-r0020w0010-ReachabilityFireability-6-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 31 markings, 60 edges
lola: ========================================

FORMULA RwMutex-PT-r0020w0010-ReachabilityFireability-0 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: A (G (((NOT FIREABLE(t41) AND NOT FIREABLE(t25)) OR NOT FIREABLE(t54) OR FIREABLE(t7))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((NOT FIREABLE(t41) AND NOT FIREABLE(t25)) OR NOT FIREABLE(t54) OR FIREABLE(t7))))
lola: processed formula length: 90
lola: 5 rewrites
lola: closed formula file RwMutex-PT-r0020w0010-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(t41) OR FIREABLE(t25)) AND FIREABLE(t54) AND NOT FIREABLE(t7))
lola: state equation: Generated DNF with 29 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to RwMutex-PT-r0020w0010-ReachabilityFireability-7-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 68 markings, 135 edges
lola: ========================================

FORMULA RwMutex-PT-r0020w0010-ReachabilityFireability-11 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(t26) AND FIREABLE(t53) AND (FIREABLE(t11) OR 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 ((FIREABLE(t26) AND FIREABLE(t53) AND (FIREABLE(t11) OR FIREABLE(t22)))))
lola: processed formula length: 79
lola: 4 rewrites
lola: closed formula file RwMutex-PT-r0020w0010-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(t26) AND FIREABLE(t53) AND (FIREABLE(t11) OR FIREABLE(t22)))
lola: state equation: Generated DNF with 67 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to RwMutex-PT-r0020w0010-ReachabilityFireability-8-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 31 markings, 60 edges
lola: ========================================

FORMULA RwMutex-PT-r0020w0010-ReachabilityFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 510 seconds at most (--localtimelimit=0)
sara: place or transition ordering is non-deterministic
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t6) AND FIREABLE(t35) AND (FIREABLE(t51) OR FIREABLE(t28)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((FIREABLE(t6) AND FIREABLE(t35) AND (FIREABLE(t51) OR FIREABLE(t28)))))
lola: processed formula length: 78
lola: 4 rewrites
lola: closed formula file RwMutex-PT-r0020w0010-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) AND FIREABLE(t35) AND (FIREABLE(t51) OR FIREABLE(t28)))
lola: state equation: Generated DNF with 28 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to RwMutex-PT-r0020w0010-ReachabilityFireability-9-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 31 markings, 60 edges
lola: ========================================

FORMULA RwMutex-PT-r0020w0010-ReachabilityFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t58) OR NOT FIREABLE(t19) OR NOT FIREABLE(t16) OR FIREABLE(t17) OR FIREABLE(t55))))
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(t58) OR NOT FIREABLE(t19) OR NOT FIREABLE(t16) OR FIREABLE(t17) OR FIREABLE(t55))))
lola: processed formula length: 107
lola: 5 rewrites
lola: closed formula file RwMutex-PT-r0020w0010-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(t58) AND FIREABLE(t19) AND FIREABLE(t16) AND NOT FIREABLE(t17) AND NOT FIREABLE(t55))
lola: state equation: Generated DNF with 14 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to RwMutex-PT-r0020w0010-ReachabilityFireability-10-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 48 markings, 94 edges

FORMULA RwMutex-PT-r0020w0010-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 11 will run for 714 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t37) AND FIREABLE(t28) AND (NOT FIREABLE(t48) OR NOT FIREABLE(t47) 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(t37) AND FIREABLE(t28) AND (NOT FIREABLE(t48) OR NOT FIREABLE(t47) OR NOT FIREABLE(t9)))))
lola: processed formula length: 108
lola: 4 rewrites
lola: closed formula file RwMutex-PT-r0020w0010-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(t37) AND FIREABLE(t28) AND (NOT FIREABLE(t48) OR NOT FIREABLE(t47) OR NOT FIREABLE(t9)))
lola: state equation: Generated DNF with 69 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 31 markings, 60 edges
lola: ========================================

FORMULA RwMutex-PT-r0020w0010-ReachabilityFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola:
========================================
lola: ...considering subproblem: E (F ((FIREABLE(t8) AND FIREABLE(t16) AND FIREABLE(t38) AND (NOT FIREABLE(t51) OR NOT FIREABLE(t24)) AND 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 ((FIREABLE(t8) AND FIREABLE(t16) AND FIREABLE(t38) AND (NOT FIREABLE(t51) OR NOT FIREABLE(t24)) AND FIREABLE(t3))))
lola: processed formula length: 121
lola: 4 rewrites
lola: closed formula file RwMutex-PT-r0020w0010-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(t8) AND FIREABLE(t16) AND FIREABLE(t38) AND (NOT FIREABLE(t51) OR NOT FIREABLE(t24)) AND FIREABLE(t3))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 48 markings, 94 edges
lola: ========================================

FORMULA RwMutex-PT-r0020w0010-ReachabilityFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1190 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t11) OR NOT FIREABLE(t58) OR (FIREABLE(t44) AND FIREABLE(t9) AND NOT FIREABLE(t31)) OR FIREABLE(t25))))
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(t11) OR NOT FIREABLE(t58) OR (FIREABLE(t44) AND FIREABLE(t9) AND NOT FIREABLE(t31)) OR FIREABLE(t25))))
lola: processed formula length: 126
lola: 5 rewrites
lola: closed formula file RwMutex-PT-r0020w0010-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(t11) AND FIREABLE(t58) AND (NOT FIREABLE(t44) OR NOT FIREABLE(t9) OR FIREABLE(t31)) AND NOT FIREABLE(t25))
lola: state equation: Generated DNF with 400 literals and 80 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 33 markings, 64 edges

FORMULA RwMutex-PT-r0020w0010-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1785 seconds at most (--localtimelimit=0)
lola: state equation: write sara problem file to RwMutex-PT-r0020w0010-ReachabilityFireability-13-0.sara
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(t6) AND FIREABLE(t27) AND FIREABLE(t26)) OR FIREABLE(t39) OR NOT FIREABLE(t7) OR NOT FIREABLE(t30) OR NOT FIREABLE(t17))))
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(t6) AND FIREABLE(t27) AND FIREABLE(t26)) OR FIREABLE(t39) OR NOT FIREABLE(t7) OR NOT FIREABLE(t30) OR NOT FIREABLE(t17))))
lola: processed formula length: 143
lola: 5 rewrites
lola: closed formula file RwMutex-PT-r0020w0010-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(t6) OR NOT FIREABLE(t27) OR NOT FIREABLE(t26)) AND NOT FIREABLE(t39) AND FIREABLE(t7) AND FIREABLE(t30) AND FIREABLE(t17))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 31 markings, 60 edges
lola: state equation: Generated DNF with 81 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to RwMutex-PT-r0020w0010-ReachabilityFireability-14-0.sara

FORMULA RwMutex-PT-r0020w0010-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 15 will run for 3570 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t35) AND FIREABLE(t56) AND ((FIREABLE(t50) AND FIREABLE(t45)) OR (FIREABLE(t21) AND FIREABLE(t19))) AND FIREABLE(t15) AND (FIREABLE(t11) OR FIREABLE(t36)) AND NOT FIREABLE(t29))))
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(t35) AND FIREABLE(t56) AND ((FIREABLE(t50) AND FIREABLE(t45)) OR (FIREABLE(t21) AND FIREABLE(t19))) AND FIREABLE(t15) AND (FIREABLE(t11) OR FIREABLE(t36)) AND NOT FIREABLE(t29))))
lola: processed formula length: 197
lola: 4 rewrites
lola: closed formula file RwMutex-PT-r0020w0010-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(t35) AND FIREABLE(t56) AND ((FIREABLE(t50) AND FIREABLE(t45)) OR (FIREABLE(t21) AND FIREABLE(t19))) AND FIREABLE(t15) AND (FIREABLE(t11) OR FIREABLE(t36)) AND NOT FIREABLE(t29))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 55 markings, 109 edges
lola: ========================================

FORMULA RwMutex-PT-r0020w0010-ReachabilityFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no no no yes no no no no yes yes yes yes no yes yes
lola:
preliminary result: no no no no yes no no no no yes yes yes yes no yes yes
lola: memory consumption: 14628 KB
lola: time consumption: 0 seconds

BK_TIME_CONFINEMENT_REACHED

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