Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
.....................
/home/mcc/execution
total 212K
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.7K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.2K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 112 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 350 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 11 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 43K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is RwMutex-PT-r0020w0010, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r148-smll-152685547100144
=====================================================================

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME RwMutex-PT-r0020w0010-CTLFireability-00
FORMULA_NAME RwMutex-PT-r0020w0010-CTLFireability-01
FORMULA_NAME RwMutex-PT-r0020w0010-CTLFireability-02
FORMULA_NAME RwMutex-PT-r0020w0010-CTLFireability-03
FORMULA_NAME RwMutex-PT-r0020w0010-CTLFireability-04
FORMULA_NAME RwMutex-PT-r0020w0010-CTLFireability-05
FORMULA_NAME RwMutex-PT-r0020w0010-CTLFireability-06
FORMULA_NAME RwMutex-PT-r0020w0010-CTLFireability-07
FORMULA_NAME RwMutex-PT-r0020w0010-CTLFireability-08
FORMULA_NAME RwMutex-PT-r0020w0010-CTLFireability-09
FORMULA_NAME RwMutex-PT-r0020w0010-CTLFireability-10
FORMULA_NAME RwMutex-PT-r0020w0010-CTLFireability-11
FORMULA_NAME RwMutex-PT-r0020w0010-CTLFireability-12
FORMULA_NAME RwMutex-PT-r0020w0010-CTLFireability-13
FORMULA_NAME RwMutex-PT-r0020w0010-CTLFireability-14
FORMULA_NAME RwMutex-PT-r0020w0010-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1526952026457

info: Time: 3600 - MCC
===========================================================================================
prep: translating RwMutex-PT-r0020w0010 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: added safe information to the net based on GenericPropertiesVerdict
prep: check for too many tokens
===========================================================================================
prep: translating RwMutex-PT-r0020w0010 formula CTLFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLFireability @ RwMutex-PT-r0020w0010 @ 3570 seconds
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 140/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 80
lola: finding significant places
lola: 80 places, 60 transitions, 30 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 51 transition conflict sets
lola: TASK
lola: reading formula from RwMutex-PT-r0020w0010-CTLFireability.task
lola: E (F (E (G ((FIREABLE(t27) AND (FIREABLE(t36) OR FIREABLE(t4))))))) : E ((E (F ((FIREABLE(t12) OR FIREABLE(t60)))) U (FIREABLE(t52) AND FIREABLE(t58) AND FIREABLE(t48) AND FIREABLE(t60) AND (NOT FIREABLE(t34) OR NOT FIREABLE(t50))))) : (A (X (FIREABLE(t37))) OR NOT(E (F (A (G (FIREABLE(t28))))))) : A (G ((((FIREABLE(t26) OR (FIREABLE(t12) AND FIREABLE(t9))) OR A (G (FIREABLE(t60)))) OR NOT(A (G (FIREABLE(t20))))))) : (FIREABLE(t3) AND E ((FIREABLE(t7) U A (X (FIREABLE(t43)))))) : ((((E (F (FIREABLE(t47))) AND ((FIREABLE(t20) AND FIREABLE(t7)) OR (FIREABLE(t21) AND FIREABLE(t30)))) AND ((FIREABLE(t24) AND FIREABLE(t21)) OR (FIREABLE(t7) AND FIREABLE(t35)) OR NOT FIREABLE(t41))) OR FIREABLE(t52)) AND NOT(E (F (A (X (FIREABLE(t50))))))) : (E ((A (F (FIREABLE(t49))) U A (F (FIREABLE(t53))))) OR (E (F (E (G (FIREABLE(t25))))) OR ((FIREABLE(t43) OR NOT FIREABLE(t20)) OR A (X ((FIREABLE(t55) AND FIREABLE(t44))))))) : (E (F (NOT FIREABLE(t22))) AND A (G ((NOT FIREABLE(t21) OR NOT FIREABLE(t36))))) : E (((NOT FIREABLE(t53) AND NOT FIREABLE(t41) AND FIREABLE(t14)) U A (X ((FIREABLE(t18) AND FIREABLE(t55)))))) : E (F (NOT(E (F (NOT FIREABLE(t10)))))) : E (F (E (G (FIREABLE(t58))))) : (E (((NOT FIREABLE(t4) AND NOT FIREABLE(t23)) U A (F (FIREABLE(t15))))) OR E (X (FIREABLE(t60)))) : E (F (A (G (A (G (FIREABLE(t60))))))) : ((FIREABLE(t56) AND E (X (((FIREABLE(t45) AND FIREABLE(t29)) OR FIREABLE(t54))))) AND FIREABLE(t51)) : A (X (FIREABLE(t1))) : (A (X ((NOT FIREABLE(t38) OR NOT FIREABLE(t57) OR NOT FIREABLE(t49) OR NOT FIREABLE(t19)))) AND FIREABLE(t23))
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:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:251
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:335
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:389
lola: rewrite Frontend/Parser/formula_rewrite.k:251
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 (X (FIREABLE(t37))) OR A (G (E (F (NOT FIREABLE(t28))))))
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: A (G (E (F (NOT FIREABLE(t28)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:617
lola: processed formula: NOT FIREABLE(t28)
lola: processed formula length: 17
lola: 21 rewrites
lola: closed formula file RwMutex-PT-r0020w0010-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: 1041095 markings, 6493436 edges, 208219 markings/sec, 0 secs
lola: 1048509 markings, 13523852 edges, 1483 markings/sec, 5 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: tscc_search
lola: The predicate is live.
lola: 1048586 markings, 20971540 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA RwMutex-PT-r0020w0010-CTLFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(t3) AND E ((FIREABLE(t7) U A (X (FIREABLE(t43))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: processed formula: (FIREABLE(t3) AND E(FIREABLE(t7) U AX(FIREABLE(t43))))
lola: processed formula length: 54
lola: 22 rewrites
lola: closed formula file RwMutex-PT-r0020w0010-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: 899125 markings, 4051431 edges, 179825 markings/sec, 0 secs
lola: 1030224 markings, 9662333 edges, 26220 markings/sec, 5 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1048586 markings, 10485770 edges
lola: ========================================

FORMULA RwMutex-PT-r0020w0010-CTLFireability-4 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(t47))) AND (((FIREABLE(t20) AND FIREABLE(t7)) OR (FIREABLE(t21) AND FIREABLE(t30))) AND ((FIREABLE(t24) AND FIREABLE(t21)) OR (FIREABLE(t7) AND FIREABLE(t35)) OR NOT FIREABLE(t41)))) OR FIREABLE(t52)) AND A (G (E (X (NOT FIREABLE(t50))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 253 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (X (NOT FIREABLE(t50)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: processed formula: NOT(E(TRUE U NOT(EX(NOT FIREABLE(t50)))))
lola: processed formula length: 41
lola: 22 rewrites
lola: closed formula file RwMutex-PT-r0020w0010-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: 802694 markings, 4699502 edges, 160539 markings/sec, 0 secs
lola: 1048404 markings, 10255078 edges, 49142 markings/sec, 5 secs
lola: 1048570 markings, 16421298 edges, 33 markings/sec, 10 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 1048586 markings, 20971540 edges
lola: ========================================
lola: subprocess 3 will run for 271 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t52)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t52)
lola: processed formula length: 13
lola: 20 rewrites
lola: closed formula file RwMutex-PT-r0020w0010-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 4 will run for 293 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((FIREABLE(t20) AND FIREABLE(t7)) OR (FIREABLE(t21) AND FIREABLE(t30))) AND ((FIREABLE(t24) AND FIREABLE(t21)) OR (FIREABLE(t7) AND FIREABLE(t35)) OR NOT FIREABLE(t41)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: processed formula: (((FIREABLE(t20) AND FIREABLE(t7)) OR (FIREABLE(t21) AND FIREABLE(t30))) AND ((FIREABLE(t24) AND FIREABLE(t21)) OR (FIREABLE(t7) AND FIREABLE(t35)) OR NOT FIREABLE(t41)))
lola: processed formula length: 173
lola: 21 rewrites
lola: closed formula file RwMutex-PT-r0020w0010-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 5 will run for 320 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t47)))
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(t47)))
lola: processed formula length: 21
lola: 21 rewrites
lola: closed formula file RwMutex-PT-r0020w0010-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(t47)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2 markings, 1 edges
lola: state equation: write sara problem file to RwMutex-PT-r0020w0010-CTLFireability-5-0.sara
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================

FORMULA RwMutex-PT-r0020w0010-CTLFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: calling and running sara
lola: subprocess 3 will run for 271 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E ((A (F (FIREABLE(t49))) U A (F (FIREABLE(t53))))) OR (E (F (E (G (FIREABLE(t25))))) OR ((FIREABLE(t43) OR NOT FIREABLE(t20)) OR A (X ((FIREABLE(t55) AND FIREABLE(t44)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: (E(A(TRUE U FIREABLE(t49)) U A(TRUE U FIREABLE(t53))) OR (E(TRUE U NOT(A(TRUE U NOT FIREABLE(t25)))) OR ((FIREABLE(t43) OR NOT FIREABLE(t20)) OR AX((FIREABLE(t55) AND FIREABLE(t44))))))
lola: processed formula length: 186
lola: 27 rewrites
lola: closed formula file RwMutex-PT-r0020w0010-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 5 significant temporal operators and needs 22 bytes of payload
lola: Ignoring fairness constraints (--fair).
sara: try reading problem file RwMutex-PT-r0020w0010-CTLFireability-5-0.sara.
sara: place or transition ordering is non-deterministic

lola: 920986 markings, 6457111 edges, 184197 markings/sec, 0 secs
lola: 1048459 markings, 12289268 edges, 25495 markings/sec, 5 secs
lola: 1048583 markings, 18468480 edges, 25 markings/sec, 10 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1048586 markings, 22020175 edges
lola: ========================================

FORMULA RwMutex-PT-r0020w0010-CTLFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 292 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((NOT FIREABLE(t53) AND NOT FIREABLE(t41) AND FIREABLE(t14)) U A (X ((FIREABLE(t18) AND FIREABLE(t55))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: processed formula: E((NOT FIREABLE(t53) AND NOT FIREABLE(t41) AND FIREABLE(t14)) U AX((FIREABLE(t18) AND FIREABLE(t55))))
lola: processed formula length: 102
lola: 22 rewrites
lola: closed formula file RwMutex-PT-r0020w0010-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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 786442 markings, 5242890 edges
lola: ========================================

FORMULA RwMutex-PT-r0020w0010-CTLFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 318 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (((NOT FIREABLE(t4) AND NOT FIREABLE(t23)) U A (F (FIREABLE(t15))))) OR E (X (FIREABLE(t60))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: processed formula: (E((NOT FIREABLE(t4) AND NOT FIREABLE(t23)) U A(TRUE U FIREABLE(t15))) OR EX(FIREABLE(t60)))
lola: processed formula length: 92
lola: 23 rewrites
lola: closed formula file RwMutex-PT-r0020w0010-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: 1 markings, 1 edges
lola: ========================================

FORMULA RwMutex-PT-r0020w0010-CTLFireability-11 TRUE 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: (FIREABLE(t56) AND (E (X (((FIREABLE(t45) AND FIREABLE(t29)) OR FIREABLE(t54)))) AND FIREABLE(t51)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 350 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t51)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t51)
lola: processed formula length: 13
lola: 20 rewrites
lola: closed formula file RwMutex-PT-r0020w0010-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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA RwMutex-PT-r0020w0010-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 389 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (FIREABLE(t1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: processed formula: AX(FIREABLE(t1))
lola: processed formula length: 16
lola: 21 rewrites
lola: closed formula file RwMutex-PT-r0020w0010-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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA RwMutex-PT-r0020w0010-CTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 437 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X ((NOT FIREABLE(t38) OR NOT FIREABLE(t57) OR NOT FIREABLE(t49) OR NOT FIREABLE(t19)))) AND FIREABLE(t23))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 437 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t23)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t23)
lola: processed formula length: 13
lola: 20 rewrites
lola: closed formula file RwMutex-PT-r0020w0010-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 9 will run for 500 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((NOT FIREABLE(t38) OR NOT FIREABLE(t57) OR NOT FIREABLE(t49) OR NOT FIREABLE(t19))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: processed formula: AX((NOT FIREABLE(t38) OR NOT FIREABLE(t57) OR NOT FIREABLE(t49) OR NOT FIREABLE(t19)))
lola: processed formula length: 89
lola: 21 rewrites
lola: closed formula file RwMutex-PT-r0020w0010-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-r0020w0010-CTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 500 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G (FIREABLE(t58)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability of possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:640
lola: processed formula: FIREABLE(t58)
lola: processed formula length: 13
lola: 21 rewrites
lola: closed formula file RwMutex-PT-r0020w0010-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EFEG
lola: The predicate is not possibly preserved from any reachable marking.
lola: 31 markings, 60 edges
lola: ========================================

FORMULA RwMutex-PT-r0020w0010-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 583 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (FIREABLE(t10)))))
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:695
lola: processed formula: NOT FIREABLE(t10)
lola: processed formula length: 17
lola: 22 rewrites
lola: closed formula file RwMutex-PT-r0020w0010-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: 910608 markings, 5928655 edges, 182122 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: tscc_search
lola: The predicate is not possibly invariant.
lola: 1048586 markings, 11534374 edges

FORMULA RwMutex-PT-r0020w0010-CTLFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 11 will run for 698 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (FIREABLE(t60)))))
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(t60)
lola: processed formula length: 17
lola: 22 rewrites
lola: closed formula file RwMutex-PT-r0020w0010-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: 1047722 markings, 6838135 edges, 209544 markings/sec, 0 secs
lola: 1048533 markings, 13643307 edges, 162 markings/sec, 5 secs
lola: SUBRESULT
lola: result: no
lola: produced by: tscc_search
lola: The predicate is not possibly invariant.
lola: 1048586 markings, 20971540 edges

FORMULA RwMutex-PT-r0020w0010-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 12 will run for 869 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((FIREABLE(t27) AND (FIREABLE(t36) OR FIREABLE(t4)))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability of possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:640
lola: processed formula: (FIREABLE(t27) AND (FIREABLE(t36) OR FIREABLE(t4)))
lola: processed formula length: 52
lola: 21 rewrites
lola: closed formula file RwMutex-PT-r0020w0010-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EFEG
lola: The predicate is not possibly preserved from any reachable marking.
lola: 32 markings, 62 edges

FORMULA RwMutex-PT-r0020w0010-CTLFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: lola: subprocess 13 will run for 1159 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((E (F ((FIREABLE(t12) OR FIREABLE(t60)))) U (FIREABLE(t52) AND FIREABLE(t58) AND FIREABLE(t48) AND FIREABLE(t60) AND (NOT FIREABLE(t34) OR NOT FIREABLE(t50)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: processed formula: E(E(TRUE U (FIREABLE(t12) OR FIREABLE(t60))) U (FIREABLE(t52) AND FIREABLE(t58) AND FIREABLE(t48) AND FIREABLE(t60) AND (NOT FIREABLE(t34) OR NOT FIREABLE(t50))))
lola: processed formula length: 164
lola: 22 rewrites
lola: closed formula file RwMutex-PT-r0020w0010-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: 196618 markings, 1114407 edges
lola: ========================================

FORMULA RwMutex-PT-r0020w0010-CTLFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1739 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(t26) OR (FIREABLE(t12) AND FIREABLE(t9))) OR (A (G (FIREABLE(t60))) OR E (F (NOT FIREABLE(t20)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:312
lola: processed formula: NOT(E(TRUE U ((NOT FIREABLE(t26) AND (NOT FIREABLE(t12) OR NOT FIREABLE(t9))) AND (E(TRUE U NOT FIREABLE(t60)) AND NOT(E(TRUE U NOT FIREABLE(t20)))))))
lola: processed formula length: 152
lola: 28 rewrites
lola: closed formula file RwMutex-PT-r0020w0010-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: 792784 markings, 5982710 edges, 158557 markings/sec, 0 secs
lola: 1048371 markings, 11678815 edges, 51117 markings/sec, 5 secs
lola: 1048563 markings, 17843959 edges, 38 markings/sec, 10 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 1048586 markings, 22938192 edges
lola: ========================================

FORMULA RwMutex-PT-r0020w0010-CTLFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3459 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (NOT FIREABLE(t22))) AND A (G ((NOT FIREABLE(t21) OR NOT FIREABLE(t36)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3459 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (NOT FIREABLE(t22)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (NOT FIREABLE(t22)))
lola: processed formula length: 25
lola: 21 rewrites
lola: closed formula file RwMutex-PT-r0020w0010-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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2 markings, 1 edges
lola: ========================================
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: ========================================
lola: ...considering subproblem: (E (F (NOT FIREABLE(t22))) AND A (G ((NOT FIREABLE(t21) OR NOT FIREABLE(t36)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (F (NOT FIREABLE(t22)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (NOT FIREABLE(t22)))
lola: processed formula length: 25
lola: 21 rewrites
lola: closed formula file RwMutex-PT-r0020w0010-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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2 markings, 1 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t21) OR NOT FIREABLE(t36))))
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(t21) OR NOT FIREABLE(t36))))
lola: processed formula length: 49
lola: 22 rewrites
lola: closed formula file RwMutex-PT-r0020w0010-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:694
lola: formula 0: (FIREABLE(t21) AND FIREABLE(t36))
lola: state equation: Generated DNF with 22 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RwMutex-PT-r0020w0010-CTLFireability-17-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 31 markings, 60 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA RwMutex-PT-r0020w0010-CTLFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no yes yes no yes no yes no no no yes no no no yes
lola:
preliminary result: no no yes yes no yes no yes no no no yes no no no yes
lola: memory consumption: 14876 KB
lola: time consumption: 111 seconds

BK_STOP 1526952137769

--------------------
content from stderr:

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="RwMutex-PT-r0020w0010"
export BK_EXAMINATION="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-r0020w0010.tgz
mv RwMutex-PT-r0020w0010 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool lola"
echo " Input is RwMutex-PT-r0020w0010, examination is 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-152685547100144"
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 ;