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 1.9M
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K 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.8K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 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 1.7M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is RwMutex-PT-r0010w1000, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r148-smll-152685547100130
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526949215579

info: Time: 3600 - MCC
===========================================================================================
prep: translating RwMutex-PT-r0010w1000 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-r0010w1000 formula CTLFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLFireability @ RwMutex-PT-r0010w1000 @ 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: 4050/65536 symbol table entries, 6 collisions
lola: preprocessing...
lola: Size of bit vector: 2030
lola: finding significant places
lola: 2030 places, 2020 transitions, 1010 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1021 transition conflict sets
lola: TASK
lola: reading formula from RwMutex-PT-r0010w1000-CTLFireability.task
lola: E ((A (F ((FIREABLE(t1813) OR FIREABLE(t597)))) U A (G (FIREABLE(t350))))) : ((E (F ((FIREABLE(t1388) AND FIREABLE(t1207) AND (FIREABLE(t1873) OR FIREABLE(t1709))))) OR (E (G ((FIREABLE(t87) AND FIREABLE(t884)))) OR FIREABLE(t1068))) OR E ((FIREABLE(t1933) U (FIREABLE(t882) AND FIREABLE(t678) AND FIREABLE(t1023))))) : A (G ((NOT(E (G (FIREABLE(t805)))) OR (FIREABLE(t103) OR FIREABLE(t1329))))) : (FIREABLE(t1322) OR E (F ((A (X (FIREABLE(t398))) AND A (G (FIREABLE(t1692))))))) : E (G (E (F ((FIREABLE(t1668) AND FIREABLE(t1819) AND NOT FIREABLE(t365)))))) : E (F (A (G ((FIREABLE(t1005) OR FIREABLE(t744) OR NOT FIREABLE(t192)))))) : E (F (((FIREABLE(t933) AND E (G (FIREABLE(t231)))) AND (E (F (FIREABLE(t203))) OR FIREABLE(t68))))) : NOT(((((FIREABLE(t856) OR FIREABLE(t1211) OR FIREABLE(t139)) AND FIREABLE(t1912)) OR E (F ((FIREABLE(t388) AND FIREABLE(t1314))))) AND E (F (A (G (FIREABLE(t35))))))) : (E (F (A (G (FIREABLE(t790))))) OR ((A ((FIREABLE(t1880) U FIREABLE(t1743))) AND (FIREABLE(t1683) AND E (G (FIREABLE(t837))))) OR (FIREABLE(t1304) AND A (G (FIREABLE(t1310)))))) : (NOT((E (F ((FIREABLE(t860) AND FIREABLE(t1736)))) OR A (X (FIREABLE(t775))))) OR (FIREABLE(t1850) OR NOT FIREABLE(t702) OR NOT FIREABLE(t563) OR FIREABLE(t1317))) : NOT((E (((FIREABLE(t1785) OR FIREABLE(t435)) U (FIREABLE(t1625) AND FIREABLE(t538)))) OR A (G ((FIREABLE(t1512) AND FIREABLE(t773) AND FIREABLE(t1698) AND FIREABLE(t1655)))))) : E (G (A (F ((FIREABLE(t581) OR FIREABLE(t1575) OR NOT FIREABLE(t1601)))))) : E (G (FIREABLE(t664))) : (E (G (((FIREABLE(t1301) AND FIREABLE(t1075)) AND E (F (FIREABLE(t104)))))) OR E (X (((NOT FIREABLE(t1417) AND NOT FIREABLE(t818)) OR NOT FIREABLE(t1365))))) : NOT(A (F (((NOT FIREABLE(t81) AND NOT FIREABLE(t1616)) OR A (X (FIREABLE(t1266))))))) : A (F (A (X ((FIREABLE(t169) OR FIREABLE(t400) OR NOT FIREABLE(t1354))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(t1322) OR E (F ((A (X (FIREABLE(t398))) AND A (G (FIREABLE(t1692)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t1322)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t1322)
lola: processed formula length: 15
lola: 39 rewrites
lola: closed formula file RwMutex-PT-r0010w1000-CTLFireability.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: ========================================
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((A (X (FIREABLE(t398))) AND A (G (FIREABLE(t1692))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: E(TRUE U (AX(FIREABLE(t398)) AND NOT(E(TRUE U NOT FIREABLE(t1692)))))
lola: processed formula length: 69
lola: 43 rewrites
lola: closed formula file RwMutex-PT-r0010w1000-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 2024 markings, 13241 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA RwMutex-PT-r0010w1000-CTLFireability-3 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: ((A (G ((NOT FIREABLE(t860) OR NOT FIREABLE(t1736)))) AND E (X (NOT FIREABLE(t775)))) OR (FIREABLE(t1850) OR NOT FIREABLE(t702) OR NOT FIREABLE(t563) OR FIREABLE(t1317)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(t1850) OR NOT FIREABLE(t702) OR NOT FIREABLE(t563) OR FIREABLE(t1317))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(t1850) OR NOT FIREABLE(t702) OR NOT FIREABLE(t563) OR FIREABLE(t1317))
lola: processed formula length: 83
lola: 39 rewrites
lola: closed formula file RwMutex-PT-r0010w1000-CTLFireability.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: lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t860) OR NOT FIREABLE(t1736))))
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:695
lola: processed formula: A (G ((NOT FIREABLE(t860) OR NOT FIREABLE(t1736))))
lola: processed formula length: 52
lola: 41 rewrites
lola: closed formula file RwMutex-PT-r0010w1000-CTLFireability.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:695
lola: formula 0: (FIREABLE(t860) AND FIREABLE(t1736))
lola: state equation: Generated DNF with 12 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RwMutex-PT-r0010w1000-CTLFireability-2-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RwMutex-PT-r0010w1000-CTLFireability-2-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 1011 markings, 2020 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (NOT FIREABLE(t775)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: processed formula: EX(NOT FIREABLE(t775))
lola: processed formula length: 22
lola: 40 rewrites
lola: closed formula file RwMutex-PT-r0010w1000-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA RwMutex-PT-r0010w1000-CTLFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (((FIREABLE(t1301) AND FIREABLE(t1075)) AND E (F (FIREABLE(t104)))))) OR E (X (((NOT FIREABLE(t1417) AND NOT FIREABLE(t818)) OR NOT FIREABLE(t1365)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((FIREABLE(t1301) AND FIREABLE(t1075)) AND E (F (FIREABLE(t104))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: NOT(A(TRUE U ((NOT FIREABLE(t1301) OR NOT FIREABLE(t1075)) OR NOT(E(TRUE U FIREABLE(t104))))))
lola: processed formula length: 95
lola: 43 rewrites
lola: closed formula file RwMutex-PT-r0010w1000-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (((NOT FIREABLE(t1417) AND NOT FIREABLE(t818)) OR NOT FIREABLE(t1365))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: processed formula: EX(((NOT FIREABLE(t1417) AND NOT FIREABLE(t818)) OR NOT FIREABLE(t1365)))
lola: processed formula length: 74
lola: 40 rewrites
lola: closed formula file RwMutex-PT-r0010w1000-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA RwMutex-PT-r0010w1000-CTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((FIREABLE(t81) OR FIREABLE(t1616)) AND E (X (NOT FIREABLE(t1266))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: processed formula: NOT(A(TRUE U ((NOT FIREABLE(t81) AND NOT FIREABLE(t1616)) OR NOT(EX(NOT FIREABLE(t1266))))))
lola: processed formula length: 92
lola: 43 rewrites
lola: closed formula file RwMutex-PT-r0010w1000-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 206 markings, 206 edges
lola: ========================================

FORMULA RwMutex-PT-r0010w1000-CTLFireability-14 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: A (F (A (X ((FIREABLE(t169) OR FIREABLE(t400) OR NOT FIREABLE(t1354))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: processed formula: A(TRUE U AX((FIREABLE(t169) OR FIREABLE(t400) OR NOT FIREABLE(t1354))))
lola: processed formula length: 73
lola: 41 rewrites
lola: closed formula file RwMutex-PT-r0010w1000-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 1011 markings, 1010 edges
lola: ========================================

FORMULA RwMutex-PT-r0010w1000-CTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (FIREABLE(t664)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (FIREABLE(t664)))
lola: processed formula length: 22
lola: 39 rewrites
lola: closed formula file RwMutex-PT-r0010w1000-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 1 markings, 0 edges
lola: ========================================

FORMULA RwMutex-PT-r0010w1000-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((FIREABLE(t1005) OR FIREABLE(t744) OR NOT FIREABLE(t192))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:636
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (NOT FIREABLE(t1005) AND NOT FIREABLE(t744) AND FIREABLE(t192))
lola: processed formula length: 63
lola: 41 rewrites
lola: closed formula file RwMutex-PT-r0010w1000-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: tscc_search
lola: The predicate is cwpossibly invariant.
lola: 1011 markings, 2020 edges
lola: ========================================

FORMULA RwMutex-PT-r0010w1000-CTLFireability-5 TRUE 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 ((A (F (NOT FIREABLE(t805))) OR (FIREABLE(t103) OR FIREABLE(t1329)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: NOT(E(TRUE U (NOT(A(TRUE U NOT FIREABLE(t805))) AND (NOT FIREABLE(t103) AND NOT FIREABLE(t1329)))))
lola: processed formula length: 99
lola: 43 rewrites
lola: closed formula file RwMutex-PT-r0010w1000-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 2024 markings, 15274 edges

FORMULA RwMutex-PT-r0010w1000-CTLFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (A (F ((FIREABLE(t581) OR FIREABLE(t1575) OR NOT FIREABLE(t1601))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: processed formula: NOT(A(TRUE U NOT(A(TRUE U (FIREABLE(t581) OR FIREABLE(t1575) OR NOT FIREABLE(t1601))))))
lola: processed formula length: 90
lola: 41 rewrites
lola: closed formula file RwMutex-PT-r0010w1000-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 2 markings, 4 edges
lola: ========================================

FORMULA RwMutex-PT-r0010w1000-CTLFireability-11 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 ((A (F ((FIREABLE(t1813) OR FIREABLE(t597)))) U A (G (FIREABLE(t350)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: E(A(TRUE U (FIREABLE(t1813) OR FIREABLE(t597))) U NOT(E(TRUE U NOT FIREABLE(t350))))
lola: processed formula length: 85
lola: 43 rewrites
lola: closed formula file RwMutex-PT-r0010w1000-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1020 markings, 5061 edges
lola: ========================================

FORMULA RwMutex-PT-r0010w1000-CTLFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t933) AND (E (G (FIREABLE(t231))) AND (E (F (FIREABLE(t203))) OR FIREABLE(t68))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: E(TRUE U (FIREABLE(t933) AND (NOT(A(TRUE U NOT FIREABLE(t231))) AND (E(TRUE U FIREABLE(t203)) OR FIREABLE(t68)))))
lola: processed formula length: 114
lola: 43 rewrites
lola: closed formula file RwMutex-PT-r0010w1000-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 2024 markings, 13251 edges
lola: ========================================

FORMULA RwMutex-PT-r0010w1000-CTLFireability-6 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 (G (E (F ((FIREABLE(t1668) AND FIREABLE(t1819) AND NOT FIREABLE(t365))))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation of reachability
lola: rewrite Frontend/Parser/formula_rewrite.k:641
lola: processed formula: (FIREABLE(t1668) AND FIREABLE(t1819) AND NOT FIREABLE(t365))
lola: processed formula length: 60
lola: 40 rewrites
lola: closed formula file RwMutex-PT-r0010w1000-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EGEF
lola: Reachability of the predicate is not possibly preserved.
lola: 2024 markings, 12240 edges
lola: ========================================

FORMULA RwMutex-PT-r0010w1000-CTLFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (((NOT FIREABLE(t1785) AND NOT FIREABLE(t435)) R (NOT FIREABLE(t1625) OR NOT FIREABLE(t538)))) AND E (F ((NOT FIREABLE(t1512) OR NOT FIREABLE(t773) OR NOT FIREABLE(t1698) OR NOT FIREABLE(t1655)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t1512) OR NOT FIREABLE(t773) OR NOT FIREABLE(t1698) OR NOT FIREABLE(t1655))))
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(t1512) OR NOT FIREABLE(t773) OR NOT FIREABLE(t1698) OR NOT FIREABLE(t1655))))
lola: processed formula length: 100
lola: 40 rewrites
lola: closed formula file RwMutex-PT-r0010w1000-CTLFireability.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(t1512) OR NOT FIREABLE(t773) OR NOT FIREABLE(t1698) OR NOT FIREABLE(t1655))
lola: state equation: Generated DNF with 14 literals and 14 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to RwMutex-PT-r0010w1000-CTLFireability-12-0.sara
lola: ========================================
lola: subprocess 13 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((NOT FIREABLE(t1785) AND NOT FIREABLE(t435)) R (NOT FIREABLE(t1625) OR NOT FIREABLE(t538))))
lola: ========================================
lola: SUBTASK
lola: checking universal release
lola: rewrite Frontend/Parser/formula_rewrite.k:607
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:647
lola: rewrite Frontend/Parser/formula_rewrite.k:607
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: A (((NOT FIREABLE(t1785) AND NOT FIREABLE(t435)) R (NOT FIREABLE(t1625) OR NOT FIREABLE(t538))))
lola: processed formula length: 97
lola: 45 rewrites
lola: closed formula file RwMutex-PT-r0010w1000-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: formula 0: (FIREABLE(t1625) AND FIREABLE(t538))
lola: state equation: Generated DNF with 12 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RwMutex-PT-r0010w1000-CTLFireability-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RwMutex-PT-r0010w1000-CTLFireability-13-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: Predicate Phi releases Predicate Psi on all paths.
lola: 2 markings, 2 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA RwMutex-PT-r0010w1000-CTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((NOT FIREABLE(t856) AND NOT FIREABLE(t1211) AND NOT FIREABLE(t139)) OR NOT FIREABLE(t1912)) AND A (G ((NOT FIREABLE(t388) OR NOT FIREABLE(t1314))))) OR A (G (E (F (NOT FIREABLE(t35))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((NOT FIREABLE(t856) AND NOT FIREABLE(t1211) AND NOT FIREABLE(t139)) OR NOT FIREABLE(t1912))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((NOT FIREABLE(t856) AND NOT FIREABLE(t1211) AND NOT FIREABLE(t139)) OR NOT FIREABLE(t1912))
lola: processed formula length: 93
lola: 39 rewrites
lola: closed formula file RwMutex-PT-r0010w1000-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 14 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t388) OR NOT FIREABLE(t1314))))
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:695
lola: processed formula: A (G ((NOT FIREABLE(t388) OR NOT FIREABLE(t1314))))
lola: processed formula length: 52
lola: 41 rewrites
lola: closed formula file RwMutex-PT-r0010w1000-CTLFireability.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:695
lola: formula 0: (FIREABLE(t388) AND FIREABLE(t1314))
lola: state equation: Generated DNF with 12 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RwMutex-PT-r0010w1000-CTLFireability-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RwMutex-PT-r0010w1000-CTLFireability-14-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 1011 markings, 2020 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA RwMutex-PT-r0010w1000-CTLFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1781 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((FIREABLE(t1388) AND FIREABLE(t1207) AND (FIREABLE(t1873) OR FIREABLE(t1709))))) OR (E (G ((FIREABLE(t87) AND FIREABLE(t884)))) OR (FIREABLE(t1068) OR E ((FIREABLE(t1933) U (FIREABLE(t882) AND FIREABLE(t678) AND FIREABLE(t1023)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1781 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t1068)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t1068)
lola: processed formula length: 15
lola: 39 rewrites
lola: closed formula file RwMutex-PT-r0010w1000-CTLFireability.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: ========================================
lola: subprocess 15 will run for 3563 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((FIREABLE(t87) AND FIREABLE(t884))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((FIREABLE(t87) AND FIREABLE(t884))))
lola: processed formula length: 42
lola: 39 rewrites
lola: closed formula file RwMutex-PT-r0010w1000-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 1 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t1388) AND FIREABLE(t1207) AND (FIREABLE(t1873) OR FIREABLE(t1709)))))
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(t1388) AND FIREABLE(t1207) AND (FIREABLE(t1873) OR FIREABLE(t1709)))))
lola: processed formula length: 87
lola: 40 rewrites
lola: closed formula file RwMutex-PT-r0010w1000-CTLFireability.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(t1388) AND FIREABLE(t1207) AND (FIREABLE(t1873) OR FIREABLE(t1709)))
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to RwMutex-PT-r0010w1000-CTLFireability-17-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RwMutex-PT-r0010w1000-CTLFireability-17-0.sara.
lola: local time limit reached - aborting
lola:
preliminary result: no unknown yes no no yes no yes unknown yes yes yes no yes yes yes
lola: memory consumption: 18576 KB
lola: time consumption: 8 seconds
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 15 will run for 3562 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (A (G (FIREABLE(t790))))) OR ((A ((FIREABLE(t1880) U FIREABLE(t1743))) AND (FIREABLE(t1683) AND E (G (FIREABLE(t837))))) OR (FIREABLE(t1304) AND A (G (FIREABLE(t1310))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3562 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t1304)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t1304)
lola: processed formula length: 15
lola: 39 rewrites
lola: closed formula file RwMutex-PT-r0010w1000-CTLFireability.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: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (FIREABLE(t837)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (FIREABLE(t837)))
lola: processed formula length: 22
lola: 39 rewrites
lola: closed formula file RwMutex-PT-r0010w1000-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 18 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (FIREABLE(t790)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:636
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: NOT FIREABLE(t790)
lola: processed formula length: 18
lola: 41 rewrites
lola: closed formula file RwMutex-PT-r0010w1000-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: tscc_search
lola: The predicate is not possibly invariant.
lola: 2024 markings, 12240 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA RwMutex-PT-r0010w1000-CTLFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: (E (F ((FIREABLE(t1388) AND FIREABLE(t1207) AND (FIREABLE(t1873) OR FIREABLE(t1709))))) OR (E (G ((FIREABLE(t87) AND FIREABLE(t884)))) OR (FIREABLE(t1068) OR E ((FIREABLE(t1933) U (FIREABLE(t882) AND FIREABLE(t678) AND FIREABLE(t1023)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: FIREABLE(t1068)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t1068)
lola: processed formula length: 15
lola: 39 rewrites
lola: closed formula file RwMutex-PT-r0010w1000-CTLFireability.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: ========================================
lola: ========================================
lola: ...considering subproblem: E (G ((FIREABLE(t87) AND FIREABLE(t884))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((FIREABLE(t87) AND FIREABLE(t884))))
lola: processed formula length: 42
lola: 39 rewrites
lola: closed formula file RwMutex-PT-r0010w1000-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 1 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E ((FIREABLE(t1933) U (FIREABLE(t882) AND FIREABLE(t678) AND FIREABLE(t1023))))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: rewrite Frontend/Parser/formula_rewrite.k:648
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: processed formula: E ((FIREABLE(t1933) U (FIREABLE(t882) AND FIREABLE(t678) AND FIREABLE(t1023))))
lola: processed formula length: 79
lola: 42 rewrites
lola: closed formula file RwMutex-PT-r0010w1000-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: formula 0: (FIREABLE(t882) AND FIREABLE(t678) AND FIREABLE(t1023))
lola: result: no
lola: produced by: state space /EU
lola: state equation: Generated DNF with 23 literals and 1 conjunctive subformulas
lola: There is no path where Predicate Phi holds until Predicate Psi.
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to RwMutex-PT-r0010w1000-CTLFireability-18-0.sara
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t1388) AND FIREABLE(t1207) AND (FIREABLE(t1873) OR FIREABLE(t1709)))))
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(t1388) AND FIREABLE(t1207) AND (FIREABLE(t1873) OR FIREABLE(t1709)))))
lola: processed formula length: 87
lola: 40 rewrites
lola: closed formula file RwMutex-PT-r0010w1000-CTLFireability.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(t1388) AND FIREABLE(t1207) AND (FIREABLE(t1873) OR FIREABLE(t1709)))
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to RwMutex-PT-r0010w1000-CTLFireability-19-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RwMutex-PT-r0010w1000-CTLFireability-19-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1011 markings, 2020 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA RwMutex-PT-r0010w1000-CTLFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no yes no no yes no yes no yes yes yes no yes yes yes
lola:
preliminary result: no no yes no no yes no yes no yes yes yes no yes yes yes
lola: memory consumption: 18340 KB
lola: time consumption: 10 seconds

BK_STOP 1526949226700

--------------------
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-r0010w1000"
export BK_EXAMINATION="CTLFireability"
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-r0010w1000.tgz
mv RwMutex-PT-r0010w1000 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-r0010w1000, examination is CTLFireability"
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-152685547100130"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.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 ;