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 3.6M
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.5K 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 3.1K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.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 3.4M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is RwMutex-PT-r0010w2000, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r148-smll-152685547100140
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526951741389

info: Time: 3600 - MCC
===========================================================================================
prep: translating RwMutex-PT-r0010w2000 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-r0010w2000 formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ RwMutex-PT-r0010w2000 @ 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: 8050/65536 symbol table entries, 1809 collisions
lola: preprocessing...
lola: Size of bit vector: 4030
lola: finding significant places
lola: 4030 places, 4020 transitions, 2010 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2021 transition conflict sets
lola: TASK
lola: reading formula from RwMutex-PT-r0010w2000-ReachabilityFireability.task
lola: E (F ((NOT FIREABLE(t3080) AND (FIREABLE(t1449) OR FIREABLE(t412)) AND (NOT FIREABLE(t3795) OR NOT FIREABLE(t551)) AND NOT FIREABLE(t3463) AND NOT FIREABLE(t58) AND FIREABLE(t3766) AND FIREABLE(t2997) AND FIREABLE(t2284)))) : A (G (((NOT FIREABLE(t1264) AND NOT FIREABLE(t3998)) OR FIREABLE(t3686) OR NOT FIREABLE(t2668)))) : E (F ((FIREABLE(t2962) AND FIREABLE(t3739) AND FIREABLE(t76)))) : E (F ((NOT FIREABLE(t3224) AND (NOT FIREABLE(t821) OR NOT FIREABLE(t60)) AND FIREABLE(t115) AND FIREABLE(t2615)))) : E (F (((FIREABLE(t2962) OR FIREABLE(t2800)) AND FIREABLE(t3349)))) : A (G ((NOT FIREABLE(t751) OR NOT FIREABLE(t2184)))) : A (G (((FIREABLE(t368) AND FIREABLE(t78)) OR (NOT FIREABLE(t656) AND NOT FIREABLE(t1392)) OR FIREABLE(t1427)))) : E (F ((FIREABLE(t3309) AND FIREABLE(t500)))) : A (G ((NOT FIREABLE(t2747) OR NOT FIREABLE(t1792) OR FIREABLE(t3360) OR ((FIREABLE(t3265) OR FIREABLE(t3142)) AND FIREABLE(t58) AND FIREABLE(t460))))) : E (F (((FIREABLE(t791) OR FIREABLE(t471)) AND NOT FIREABLE(t3979) AND FIREABLE(t2285) AND FIREABLE(t59)))) : A (G ((FIREABLE(t1232) OR NOT FIREABLE(t302) OR (FIREABLE(t3277) AND (NOT FIREABLE(t2353) OR NOT FIREABLE(t2364)))))) : A (G ((NOT FIREABLE(t2854) OR (NOT FIREABLE(t1238) AND NOT FIREABLE(t1088)) OR (FIREABLE(t1232) AND FIREABLE(t3199))))) : A (G ((FIREABLE(t2769) OR (NOT FIREABLE(t3488) AND NOT FIREABLE(t3083)) OR (NOT FIREABLE(t1186) AND NOT FIREABLE(t3957)) OR (FIREABLE(t1759) AND FIREABLE(t122) AND (FIREABLE(t3491) OR FIREABLE(t1599)))))) : A (G ((NOT FIREABLE(t2263) OR NOT FIREABLE(t2979) OR NOT FIREABLE(t470) OR (NOT FIREABLE(t1640) AND NOT FIREABLE(t724) AND FIREABLE(t2932))))) : A (G ((FIREABLE(t1979) OR (FIREABLE(t2390) AND FIREABLE(t679)) OR (FIREABLE(t1421) AND FIREABLE(t938) AND NOT FIREABLE(t2414)) OR NOT FIREABLE(t160) OR NOT FIREABLE(t2797) OR FIREABLE(t1670) OR (FIREABLE(t368) AND FIREABLE(t3293))))) : E (F ((FIREABLE(t2187) AND FIREABLE(t700) AND (FIREABLE(t100) OR FIREABLE(t3269)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t751) OR NOT FIREABLE(t2184))))
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(t751) OR NOT FIREABLE(t2184))))
lola: processed formula length: 52
lola: 2 rewrites
lola: closed formula file RwMutex-PT-r0010w2000-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(t751) AND FIREABLE(t2184))
lola: state equation: Generated DNF with 12 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RwMutex-PT-r0010w2000-ReachabilityFireability-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RwMutex-PT-r0010w2000-ReachabilityFireability-0.sara.
lola: sara is running 0 secs || 845 markings, 1687 edges, 169 markings/sec, 0 secs
lola: sara is running 5 secs || 1755 markings, 3507 edges, 182 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 2011 markings, 4020 edges

FORMULA RwMutex-PT-r0010w2000-ReachabilityFireability-5 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(t3309) AND FIREABLE(t500))))
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(t3309) AND FIREABLE(t500))))
lola: processed formula length: 44
lola: 1 rewrites
lola: closed formula file RwMutex-PT-r0010w2000-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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(t3309) AND FIREABLE(t500))
lola: state equation: Generated DNF with 12 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RwMutex-PT-r0010w2000-ReachabilityFireability-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RwMutex-PT-r0010w2000-ReachabilityFireability-0.sara.
lola: sara is running 0 secs || 877 markings, 1751 edges, 175 markings/sec, 0 secs
lola: sara is running 5 secs || 1790 markings, 3577 edges, 183 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 2011 markings, 4020 edges
lola: ========================================

FORMULA RwMutex-PT-r0010w2000-ReachabilityFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 253 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t2962) AND FIREABLE(t3739) AND FIREABLE(t76))))
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(t2962) AND FIREABLE(t3739) AND FIREABLE(t76))))
lola: processed formula length: 63
lola: 1 rewrites
lola: closed formula file RwMutex-PT-r0010w2000-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(t2962) AND FIREABLE(t3739) AND FIREABLE(t76))
lola: state equation: Generated DNF with 13 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RwMutex-PT-r0010w2000-ReachabilityFireability-2-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RwMutex-PT-r0010w2000-ReachabilityFireability-2-0.sara.
lola: sara is running 0 secs || 903 markings, 1803 edges, 181 markings/sec, 0 secs
lola: sara is running 5 secs || 1758 markings, 3513 edges, 171 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 2011 markings, 4020 edges

FORMULA RwMutex-PT-r0010w2000-ReachabilityFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 271 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t2962) OR FIREABLE(t2800)) AND FIREABLE(t3349))))
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(t2962) OR FIREABLE(t2800)) AND FIREABLE(t3349))))
lola: processed formula length: 67
lola: 1 rewrites
lola: closed formula file RwMutex-PT-r0010w2000-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(t2962) OR FIREABLE(t2800)) AND FIREABLE(t3349))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to RwMutex-PT-r0010w2000-ReachabilityFireability-3-0.sara
lola: ========================================
lola: state equation: calling and running sara
sara: try reading problem file RwMutex-PT-r0010w2000-ReachabilityFireability-3-0.sara.
lola: sara is running 0 secs || 912 markings, 1821 edges, 182 markings/sec, 0 secs
lola: sara is running 5 secs || 1824 markings, 3645 edges, 182 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 2011 markings, 4020 edges
lola: ========================================

FORMULA RwMutex-PT-r0010w2000-ReachabilityFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 293 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t1264) AND NOT FIREABLE(t3998)) OR FIREABLE(t3686) OR NOT FIREABLE(t2668))))
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(t1264) AND NOT FIREABLE(t3998)) OR FIREABLE(t3686) OR NOT FIREABLE(t2668))))
lola: processed formula length: 99
lola: 2 rewrites
lola: closed formula file RwMutex-PT-r0010w2000-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(t1264) OR FIREABLE(t3998)) AND NOT FIREABLE(t3686) AND FIREABLE(t2668))
lola: state equation: Generated DNF with 16 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to RwMutex-PT-r0010w2000-ReachabilityFireability-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RwMutex-PT-r0010w2000-ReachabilityFireability-4-0.sara.
lola: sara is running 0 secs || 877 markings, 1751 edges, 175 markings/sec, 0 secs
lola: sara is running 5 secs || 1788 markings, 3573 edges, 182 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 2011 markings, 4020 edges
lola: ========================================

FORMULA RwMutex-PT-r0010w2000-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 319 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t2187) AND FIREABLE(t700) AND (FIREABLE(t100) OR FIREABLE(t3269)))))
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(t2187) AND FIREABLE(t700) AND (FIREABLE(t100) OR FIREABLE(t3269)))))
lola: processed formula length: 85
lola: 1 rewrites
lola: closed formula file RwMutex-PT-r0010w2000-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(t2187) AND FIREABLE(t700) AND (FIREABLE(t100) OR FIREABLE(t3269)))
lola: state equation: Generated DNF with 36 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to RwMutex-PT-r0010w2000-ReachabilityFireability-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RwMutex-PT-r0010w2000-ReachabilityFireability-5-0.sara.
lola: sara is running 0 secs || 913 markings, 1823 edges, 183 markings/sec, 0 secs
lola: sara is running 5 secs || 1822 markings, 3641 edges, 182 markings/sec, 5 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 2011 markings, 4020 edges
lola: ========================================

FORMULA RwMutex-PT-r0010w2000-ReachabilityFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 350 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t3224) AND (NOT FIREABLE(t821) OR NOT FIREABLE(t60)) AND FIREABLE(t115) AND FIREABLE(t2615))))
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(t3224) AND (NOT FIREABLE(t821) OR NOT FIREABLE(t60)) AND FIREABLE(t115) AND FIREABLE(t2615))))
lola: processed formula length: 115
lola: 1 rewrites
lola: closed formula file RwMutex-PT-r0010w2000-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(t3224) AND (NOT FIREABLE(t821) OR NOT FIREABLE(t60)) AND FIREABLE(t115) AND FIREABLE(t2615))
lola: state equation: Generated DNF with 28 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to RwMutex-PT-r0010w2000-ReachabilityFireability-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RwMutex-PT-r0010w2000-ReachabilityFireability-6-0.sara.
lola: sara is running 0 secs || 879 markings, 1755 edges, 176 markings/sec, 0 secs
lola: sara is running 5 secs || 1788 markings, 3573 edges, 182 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 2011 markings, 4020 edges
lola: ========================================

FORMULA RwMutex-PT-r0010w2000-ReachabilityFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 387 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t791) OR FIREABLE(t471)) AND NOT FIREABLE(t3979) AND FIREABLE(t2285) AND FIREABLE(t59))))
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(t791) OR FIREABLE(t471)) AND NOT FIREABLE(t3979) AND FIREABLE(t2285) AND FIREABLE(t59))))
lola: processed formula length: 107
lola: 1 rewrites
lola: closed formula file RwMutex-PT-r0010w2000-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(t791) OR FIREABLE(t471)) AND NOT FIREABLE(t3979) AND FIREABLE(t2285) AND FIREABLE(t59))
lola: state equation: Generated DNF with 48 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to RwMutex-PT-r0010w2000-ReachabilityFireability-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RwMutex-PT-r0010w2000-ReachabilityFireability-7-0.sara.
lola: sara is running 0 secs || 878 markings, 1753 edges, 176 markings/sec, 0 secs
lola: sara is running 5 secs || 1790 markings, 3577 edges, 182 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 2011 markings, 4020 edges
lola: ========================================

FORMULA RwMutex-PT-r0010w2000-ReachabilityFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 435 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t1232) OR NOT FIREABLE(t302) OR (FIREABLE(t3277) AND (NOT FIREABLE(t2353) OR NOT FIREABLE(t2364))))))
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(t1232) OR NOT FIREABLE(t302) OR (FIREABLE(t3277) AND (NOT FIREABLE(t2353) OR NOT FIREABLE(t2364))))))
lola: processed formula length: 120
lola: 2 rewrites
lola: closed formula file RwMutex-PT-r0010w2000-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(t1232) AND FIREABLE(t302) AND (NOT FIREABLE(t3277) OR (FIREABLE(t2353) AND FIREABLE(t2364))))
lola: state equation: Generated DNF with 27 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to RwMutex-PT-r0010w2000-ReachabilityFireability-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RwMutex-PT-r0010w2000-ReachabilityFireability-8-0.sara.
lola: sara is running 0 secs || 914 markings, 1825 edges, 183 markings/sec, 0 secs
lola: sara is running 5 secs || 1825 markings, 3647 edges, 182 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 2011 markings, 4020 edges
lola: ========================================

FORMULA RwMutex-PT-r0010w2000-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 495 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t2854) OR (NOT FIREABLE(t1238) AND NOT FIREABLE(t1088)) OR (FIREABLE(t1232) AND FIREABLE(t3199)))))
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(t2854) OR (NOT FIREABLE(t1238) AND NOT FIREABLE(t1088)) OR (FIREABLE(t1232) AND FIREABLE(t3199)))))
lola: processed formula length: 121
lola: 2 rewrites
lola: closed formula file RwMutex-PT-r0010w2000-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(t2854) AND (FIREABLE(t1238) OR FIREABLE(t1088)) AND (NOT FIREABLE(t1232) OR NOT FIREABLE(t3199)))
lola: state equation: Generated DNF with 52 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to RwMutex-PT-r0010w2000-ReachabilityFireability-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RwMutex-PT-r0010w2000-ReachabilityFireability-9-0.sara.
lola: sara is running 0 secs || 913 markings, 1823 edges, 183 markings/sec, 0 secs
lola: sara is running 5 secs || 1821 markings, 3639 edges, 182 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 2011 markings, 4020 edges

FORMULA RwMutex-PT-r0010w2000-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 10 will run for 576 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(t368) AND FIREABLE(t78)) OR (NOT FIREABLE(t656) AND NOT FIREABLE(t1392)) OR FIREABLE(t1427))))
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(t368) AND FIREABLE(t78)) OR (NOT FIREABLE(t656) AND NOT FIREABLE(t1392)) OR FIREABLE(t1427))))
lola: processed formula length: 113
lola: 2 rewrites
lola: closed formula file RwMutex-PT-r0010w2000-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(t368) OR NOT FIREABLE(t78)) AND (FIREABLE(t656) OR FIREABLE(t1392)) AND NOT FIREABLE(t1427))
lola: state equation: Generated DNF with 52 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to RwMutex-PT-r0010w2000-ReachabilityFireability-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RwMutex-PT-r0010w2000-ReachabilityFireability-10-0.sara.
lola: sara is running 0 secs || 911 markings, 1819 edges, 182 markings/sec, 0 secs
lola: sara is running 5 secs || 1817 markings, 3631 edges, 181 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 2011 markings, 4020 edges
lola: ========================================

FORMULA RwMutex-PT-r0010w2000-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 689 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t2263) OR NOT FIREABLE(t2979) OR NOT FIREABLE(t470) OR (NOT FIREABLE(t1640) AND NOT FIREABLE(t724) AND FIREABLE(t2932)))))
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(t2263) OR NOT FIREABLE(t2979) OR NOT FIREABLE(t470) OR (NOT FIREABLE(t1640) AND NOT FIREABLE(t724) AND FIREABLE(t2932)))))
lola: processed formula length: 145
lola: 2 rewrites
lola: closed formula file RwMutex-PT-r0010w2000-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(t2263) AND FIREABLE(t2979) AND FIREABLE(t470) AND (FIREABLE(t1640) OR FIREABLE(t724) OR NOT FIREABLE(t2932)))
lola: state equation: Generated DNF with 62 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to RwMutex-PT-r0010w2000-ReachabilityFireability-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RwMutex-PT-r0010w2000-ReachabilityFireability-11-0.sara.
lola: sara is running 0 secs || 915 markings, 1827 edges, 183 markings/sec, 0 secs
lola: sara is running 5 secs || 1826 markings, 3649 edges, 182 markings/sec, 5 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 2011 markings, 4020 edges

FORMULA RwMutex-PT-r0010w2000-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 858 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t2747) OR NOT FIREABLE(t1792) OR FIREABLE(t3360) OR ((FIREABLE(t3265) OR FIREABLE(t3142)) AND FIREABLE(t58) AND FIREABLE(t460)))))
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(t2747) OR NOT FIREABLE(t1792) OR FIREABLE(t3360) OR ((FIREABLE(t3265) OR FIREABLE(t3142)) AND FIREABLE(t58) AND FIREABLE(t460)))))
lola: processed formula length: 154
lola: 2 rewrites
lola: closed formula file RwMutex-PT-r0010w2000-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(t2747) AND FIREABLE(t1792) AND NOT FIREABLE(t3360) AND ((NOT FIREABLE(t3265) AND NOT FIREABLE(t3142)) OR NOT FIREABLE(t58) OR NOT FIREABLE(t460)))
lola: state equation: Generated DNF with 43 literals and 3 conjunctive subformulas
lola: ========================================
lola: state equation: write sara problem file to RwMutex-PT-r0010w2000-ReachabilityFireability-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RwMutex-PT-r0010w2000-ReachabilityFireability-12-0.sara.
lola: sara is running 0 secs || 839 markings, 1675 edges, 168 markings/sec, 0 secs
lola: sara is running 5 secs || 1753 markings, 3503 edges, 183 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 2011 markings, 4020 edges
lola: ========================================

FORMULA RwMutex-PT-r0010w2000-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1141 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t2769) OR (NOT FIREABLE(t3488) AND NOT FIREABLE(t3083)) OR (NOT FIREABLE(t1186) AND NOT FIREABLE(t3957)) OR (FIREABLE(t1759) AND FIREABLE(t122) AND (FIREABLE(t3491) OR FIREABLE(t1599))))))
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(t2769) OR (NOT FIREABLE(t3488) AND NOT FIREABLE(t3083)) OR (NOT FIREABLE(t1186) AND NOT FIREABLE(t3957)) OR (FIREABLE(t1759) AND FIREABLE(t122) AND (FIREABLE(t3491) OR FIREABLE(t1599))))))
lola: processed formula length: 208
lola: 2 rewrites
lola: closed formula file RwMutex-PT-r0010w2000-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(t2769) AND (FIREABLE(t3488) OR FIREABLE(t3083)) AND (FIREABLE(t1186) OR FIREABLE(t3957)) AND (NOT FIREABLE(t1759) OR NOT FIREABLE(t122) OR (NOT FIREABLE(t3491) AND NOT FIREABLE(t1599))))
lola: state equation: Generated DNF with 372 literals and 72 conjunctive subformulas
lola: state equation: write sara problem file to RwMutex-PT-r0010w2000-ReachabilityFireability-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RwMutex-PT-r0010w2000-ReachabilityFireability-13-0.sara.
lola: sara is running 0 secs || 914 markings, 1825 edges, 183 markings/sec, 0 secs
lola: sara is running 5 secs || 1825 markings, 3647 edges, 182 markings/sec, 5 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 2011 markings, 4020 edges
lola: ========================================

FORMULA RwMutex-PT-r0010w2000-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1706 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t3080) AND (FIREABLE(t1449) OR FIREABLE(t412)) AND (NOT FIREABLE(t3795) OR NOT FIREABLE(t551)) AND NOT FIREABLE(t3463) AND NOT FIREABLE(t58) AND FIREABLE(t3766) AND FIREABLE(t2997) AND FIREABLE(t2284))))
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(t3080) AND (FIREABLE(t1449) OR FIREABLE(t412)) AND (NOT FIREABLE(t3795) OR NOT FIREABLE(t551)) AND NOT FIREABLE(t3463) AND NOT FIREABLE(t58) AND FIREABLE(t3766) AND FIREABLE(t2997) AND FIREABLE(t2284))))
lola: processed formula length: 225
lola: 1 rewrites
lola: closed formula file RwMutex-PT-r0010w2000-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(t3080) AND (FIREABLE(t1449) OR FIREABLE(t412)) AND (NOT FIREABLE(t3795) OR NOT FIREABLE(t551)) AND NOT FIREABLE(t3463) AND NOT FIREABLE(t58) AND FIREABLE(t3766) AND FIREABLE(t2997) AND FIREABLE(t2284))
lola: state equation: Generated DNF with 72 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to RwMutex-PT-r0010w2000-ReachabilityFireability-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RwMutex-PT-r0010w2000-ReachabilityFireability-14-0.sara.
lola: sara is running 0 secs || 914 markings, 1825 edges, 183 markings/sec, 0 secs
lola: sara is running 5 secs || 1823 markings, 3643 edges, 182 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 2011 markings, 4020 edges
lola: ========================================

FORMULA RwMutex-PT-r0010w2000-ReachabilityFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3402 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t1979) OR (FIREABLE(t2390) AND FIREABLE(t679)) OR (FIREABLE(t1421) AND FIREABLE(t938) AND NOT FIREABLE(t2414)) OR NOT FIREABLE(t160) OR NOT FIREABLE(t2797) OR FIREABLE(t1670) OR (FIREABLE(t368) AND FIREABLE(t3293)))))
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(t1979) OR (FIREABLE(t2390) AND FIREABLE(t679)) OR (FIREABLE(t1421) AND FIREABLE(t938) AND NOT FIREABLE(t2414)) OR NOT FIREABLE(t160) OR NOT FIREABLE(t2797) OR FIREABLE(t1670) OR (FIREABLE(t368) AND FIREABLE(t3293)))))
lola: processed formula length: 239
lola: 2 rewrites
lola: closed formula file RwMutex-PT-r0010w2000-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(t1979) AND (NOT FIREABLE(t2390) OR NOT FIREABLE(t679)) AND (NOT FIREABLE(t1421) OR NOT FIREABLE(t938) OR FIREABLE(t2414)) AND FIREABLE(t160) AND FIREABLE(t2797) AND NOT FIREABLE(t1670) AND (NOT FIREABLE(t368) OR NOT FIREABLE(t3293)))
lola: state equation: Generated DNF with 204 literals and 12 conjunctive subformulas
lola: state equation: write sara problem file to RwMutex-PT-r0010w2000-ReachabilityFireability-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RwMutex-PT-r0010w2000-ReachabilityFireability-15-0.sara.
lola: sara is running 0 secs || 852 markings, 1701 edges, 170 markings/sec, 0 secs
lola: sara is running 5 secs || 1756 markings, 3509 edges, 181 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 2011 markings, 4020 edges
lola: ========================================

FORMULA RwMutex-PT-r0010w2000-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes no no no yes yes no yes no yes yes yes yes yes no
lola:
preliminary result: no yes no no no yes yes no yes no yes yes yes yes yes no
lola: memory consumption: 22016 KB
lola: time consumption: 179 seconds

BK_STOP 1526951920963

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