About the Execution of LoLA for QuasiCertifProtocol-PT-06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 336.520 | 95180.00 | 88788.00 | 4803.60 | TFTFFTTFFTTTFTFF | normal |
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 396K
-rw-r--r-- 1 mcc users 5.9K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 31K 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.4K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 14K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.1K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 33K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 116 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 354 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 5.0K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 26K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.3K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 153K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is QuasiCertifProtocol-PT-06, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-qhx2-152673578700067
=====================================================================
--------------------
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 QuasiCertifProtocol-PT-06-CTLFireability-00
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLFireability-01
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLFireability-02
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLFireability-03
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLFireability-04
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLFireability-05
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLFireability-06
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLFireability-07
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLFireability-08
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLFireability-09
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLFireability-10
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLFireability-11
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLFireability-12
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLFireability-13
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLFireability-14
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1526924011821
info: Time: 3600 - MCC
===========================================================================================
prep: translating QuasiCertifProtocol-PT-06 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating QuasiCertifProtocol-PT-06 formula CTLFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLFireability @ QuasiCertifProtocol-PT-06 @ 3568 seconds
lola: LoLA will run for 3568 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 386/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 8640
lola: finding significant places
lola: 270 places, 116 transitions, 115 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 151 transition conflict sets
lola: TASK
lola: reading formula from QuasiCertifProtocol-PT-06-CTLFireability.task
lola: NOT(E ((((NOT FIREABLE(CgenCertif_0) AND NOT FIREABLE(CgenCertif_5) AND NOT FIREABLE(CgenCertif_6) AND NOT FIREABLE(CgenCertif_3) AND NOT FIREABLE(CgenCertif_4) AND NOT FIREABLE(CgenCertif_1) AND NOT FIREABLE(CgenCertif_2)) OR NOT FIREABLE(malA5)) U (NOT FIREABLE(ScertCS_5) AND NOT FIREABLE(ScertCS_4) AND NOT FIREABLE(ScertCS_6) AND NOT FIREABLE(ScertCS_1) AND NOT FIREABLE(ScertCS_0) AND NOT FIREABLE(ScertCS_3) AND NOT FIREABLE(ScertCS_2) AND (FIREABLE(malS4_0) OR FIREABLE(malS4_1) OR FIREABLE(malS4_2) OR FIREABLE(malS4_3) OR FIREABLE(malS4_4) OR FIREABLE(malS4_5) OR FIREABLE(malS4_6)) AND FIREABLE(AstartCS))))) : A ((NOT FIREABLE(AgetTS) U A (G ((FIREABLE(ScertCS_5) OR FIREABLE(ScertCS_4) OR FIREABLE(ScertCS_6) OR FIREABLE(ScertCS_1) OR FIREABLE(ScertCS_0) OR FIREABLE(ScertCS_3) OR FIREABLE(ScertCS_2) OR FIREABLE(malS6_3) OR FIREABLE(malS6_2) OR FIREABLE(malS6_1) OR FIREABLE(malS6_0) OR FIREABLE(malS6_6) OR FIREABLE(malS6_5) OR FIREABLE(malS6_4)))))) : ((((NOT FIREABLE(AgetTS) OR (NOT FIREABLE(Sperform_1) AND NOT FIREABLE(Sperform_2) AND NOT FIREABLE(Sperform_3) AND NOT FIREABLE(Sperform_4) AND NOT FIREABLE(Sperform_0) AND NOT FIREABLE(Sperform_5) AND NOT FIREABLE(Sperform_6))) AND NOT FIREABLE(AendCS) AND (NOT FIREABLE(malA4) OR (NOT FIREABLE(SsendTS_2) AND NOT FIREABLE(SsendTS_1) AND NOT FIREABLE(SsendTS_0) AND NOT FIREABLE(SsendTS_6) AND NOT FIREABLE(SsendTS_5) AND NOT FIREABLE(SsendTS_4) AND NOT FIREABLE(SsendTS_3)) OR (NOT FIREABLE(SsendTS_2) AND NOT FIREABLE(SsendTS_1) AND NOT FIREABLE(SsendTS_0) AND NOT FIREABLE(SsendTS_6) AND NOT FIREABLE(SsendTS_5) AND NOT FIREABLE(SsendTS_4) AND NOT FIREABLE(SsendTS_3)))) AND (A (((FIREABLE(SsendTS_2) OR FIREABLE(SsendTS_1) OR FIREABLE(SsendTS_0) OR FIREABLE(SsendTS_6) OR FIREABLE(SsendTS_5) OR FIREABLE(SsendTS_4) OR FIREABLE(SsendTS_3)) U (FIREABLE(Sperform_1) OR FIREABLE(Sperform_2) OR FIREABLE(Sperform_3) OR FIREABLE(Sperform_4) OR FIREABLE(Sperform_0) OR FIREABLE(Sperform_5) OR FIREABLE(Sperform_6)))) OR ((NOT FIREABLE(malS5_0) AND NOT FIREABLE(malS5_1) AND NOT FIREABLE(malS5_2) AND NOT FIREABLE(malS5_3) AND NOT FIREABLE(malS5_4) AND NOT FIREABLE(malS5_5) AND NOT FIREABLE(malS5_6)) OR (NOT FIREABLE(SreqTS_6) AND NOT FIREABLE(SreqTS_2) AND NOT FIREABLE(SreqTS_3) AND NOT FIREABLE(SreqTS_4) AND NOT FIREABLE(SreqTS_5) AND NOT FIREABLE(SreqTS_0) AND NOT FIREABLE(SreqTS_1)) OR NOT FIREABLE(malA4)))) AND (E (F (A (X (FIREABLE(AreqTS))))) OR E (G ((NOT FIREABLE(malS4_0) AND NOT FIREABLE(malS4_1) AND NOT FIREABLE(malS4_2) AND NOT FIREABLE(malS4_3) AND NOT FIREABLE(malS4_4) AND NOT FIREABLE(malS4_5) AND NOT FIREABLE(malS4_6) AND NOT FIREABLE(malA5)))))) : E ((A (F (((FIREABLE(malS6_3) OR FIREABLE(malS6_2) OR FIREABLE(malS6_1) OR FIREABLE(malS6_0) OR FIREABLE(malS6_6) OR FIREABLE(malS6_5) OR FIREABLE(malS6_4)) AND FIREABLE(malA2)))) U (NOT FIREABLE(malS1_0) AND NOT FIREABLE(malS1_2) AND NOT FIREABLE(malS1_1) AND NOT FIREABLE(malS1_4) AND NOT FIREABLE(malS1_3) AND NOT FIREABLE(malS1_5) AND NOT FIREABLE(malS1_6) AND ((NOT FIREABLE(malS5_0) AND NOT FIREABLE(malS5_1) AND NOT FIREABLE(malS5_2) AND NOT FIREABLE(malS5_3) AND NOT FIREABLE(malS5_4) AND NOT FIREABLE(malS5_5) AND NOT FIREABLE(malS5_6)) OR (NOT FIREABLE(Sperform_1) AND NOT FIREABLE(Sperform_2) AND NOT FIREABLE(Sperform_3) AND NOT FIREABLE(Sperform_4) AND NOT FIREABLE(Sperform_0) AND NOT FIREABLE(Sperform_5) AND NOT FIREABLE(Sperform_6)))))) : (A (G (((NOT FIREABLE(malS4_0) AND NOT FIREABLE(malS4_1) AND NOT FIREABLE(malS4_2) AND NOT FIREABLE(malS4_3) AND NOT FIREABLE(malS4_4) AND NOT FIREABLE(malS4_5) AND NOT FIREABLE(malS4_6) AND NOT FIREABLE(SackCS_3) AND NOT FIREABLE(SackCS_2) AND NOT FIREABLE(SackCS_1) AND NOT FIREABLE(SackCS_0) AND NOT FIREABLE(SackCS_4) AND NOT FIREABLE(SackCS_5) AND NOT FIREABLE(SackCS_6)) OR ((FIREABLE(SgetTS_4) OR FIREABLE(SgetTS_3) OR FIREABLE(SgetTS_6) OR FIREABLE(SgetTS_5) OR FIREABLE(SgetTS_0) OR FIREABLE(SgetTS_2) OR FIREABLE(SgetTS_1) OR FIREABLE(malC1_2) OR FIREABLE(malC1_1) OR FIREABLE(malC1_0) OR FIREABLE(malC1_6) OR FIREABLE(malC1_5) OR FIREABLE(malC1_4) OR FIREABLE(malC1_3)) AND FIREABLE(malA5))))) AND (NOT FIREABLE(malA2) OR ((E (X (FIREABLE(malA1))) OR NOT FIREABLE(AendCS)) OR NOT FIREABLE(AendCS)))) : E (G ((((NOT FIREABLE(AendCS) AND NOT FIREABLE(malA2)) OR A (F ((FIREABLE(malS4_0) OR FIREABLE(malS4_1) OR FIREABLE(malS4_2) OR FIREABLE(malS4_3) OR FIREABLE(malS4_4) OR FIREABLE(malS4_5) OR FIREABLE(malS4_6))))) OR E (((FIREABLE(CgenCertif_0) OR FIREABLE(CgenCertif_5) OR FIREABLE(CgenCertif_6) OR FIREABLE(CgenCertif_3) OR FIREABLE(CgenCertif_4) OR FIREABLE(CgenCertif_1) OR FIREABLE(CgenCertif_2)) U (FIREABLE(malC1_2) OR FIREABLE(malC1_1) OR FIREABLE(malC1_0) OR FIREABLE(malC1_6) OR FIREABLE(malC1_5) OR FIREABLE(malC1_4) OR FIREABLE(malC1_3))))))) : A (G (NOT(E (G (FIREABLE(malA3)))))) : (((A (G (NOT FIREABLE(malA3))) AND E (F ((NOT FIREABLE(malS1_0) AND NOT FIREABLE(malS1_2) AND NOT FIREABLE(malS1_1) AND NOT FIREABLE(malS1_4) AND NOT FIREABLE(malS1_3) AND NOT FIREABLE(malS1_5) AND NOT FIREABLE(malS1_6))))) OR E (X (FIREABLE(AendCS)))) AND E (X ((((NOT FIREABLE(malS1_0) AND NOT FIREABLE(malS1_2) AND NOT FIREABLE(malS1_1) AND NOT FIREABLE(malS1_4) AND NOT FIREABLE(malS1_3) AND NOT FIREABLE(malS1_5) AND NOT FIREABLE(malS1_6)) OR (NOT FIREABLE(malS2_1) AND NOT FIREABLE(malS2_0) AND NOT FIREABLE(malS2_3) AND NOT FIREABLE(malS2_2) AND NOT FIREABLE(malS2_5) AND NOT FIREABLE(malS2_4) AND NOT FIREABLE(malS2_6))) AND ((NOT FIREABLE(CgenCertif_0) AND NOT FIREABLE(CgenCertif_5) AND NOT FIREABLE(CgenCertif_6) AND NOT FIREABLE(CgenCertif_3) AND NOT FIREABLE(CgenCertif_4) AND NOT FIREABLE(CgenCertif_1) AND NOT FIREABLE(CgenCertif_2)) OR ((FIREABLE(malS1_0) OR FIREABLE(malS1_2) OR FIREABLE(malS1_1) OR FIREABLE(malS1_4) OR FIREABLE(malS1_3) OR FIREABLE(malS1_5) OR FIREABLE(malS1_6)) AND FIREABLE(malA5))))))) : E (F (((E (F (FIREABLE(malS1_6))) AND FIREABLE(CgenCertif_4)) AND A ((FIREABLE(malS4_4) U FIREABLE(malA1)))))) : NOT((NOT(E (G (NOT FIREABLE(ScertCS_0)))) OR (FIREABLE(CsendTS1_1) OR (FIREABLE(malS1_2) AND FIREABLE(CgenCertif_6))))) : (E (G ((FIREABLE(CsendTS1_6) OR FIREABLE(malA1) OR FIREABLE(SgetTS_5)))) OR NOT(A (F (E (G (FIREABLE(SsendTS_1))))))) : NOT(E (((FIREABLE(malS3_3) AND (FIREABLE(Sperform_5) OR FIREABLE(malS2_6))) U A (F (FIREABLE(ScertCS_4)))))) : A (G (A ((FIREABLE(malS5_2) U NOT FIREABLE(malS6_3))))) : (NOT(A (X (E (F (FIREABLE(malS4_1)))))) OR (NOT(E (G ((FIREABLE(ScertCS_2) OR FIREABLE(SsendTS_0))))) AND ((FIREABLE(CgenCertif_0) AND FIREABLE(malS5_4)) OR ((FIREABLE(SgetTS_4) OR FIREABLE(malS1_0) OR NOT FIREABLE(malS2_3)) AND E (F (FIREABLE(SreqTS_4))))))) : A (F (FIREABLE(Sperform_5))) : (A (F ((FIREABLE(malS4_2) AND FIREABLE(malC1_2)))) AND NOT(E (F ((FIREABLE(malC1_1) OR FIREABLE(malS6_3) OR FIREABLE(malA3))))))
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:251
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:326
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:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
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:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:323
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: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:329
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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((NOT FIREABLE(AgetTS) OR (NOT FIREABLE(Sperform_1) AND NOT FIREABLE(Sperform_2) AND NOT FIREABLE(Sperform_3) AND NOT FIREABLE(Sperform_4) AND NOT FIREABLE(Sperform_0) AND NOT FIREABLE(Sperform_5) AND NOT FIREABLE(Sperform_6))) AND NOT FIREABLE(AendCS) AND (NOT FIREABLE(malA4) OR (NOT FIREABLE(SsendTS_2) AND NOT FIREABLE(SsendTS_1) AND NOT FIREABLE(SsendTS_0) AND NOT FIREABLE(SsendTS_6) AND NOT... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((NOT FIREABLE(malS4_0) AND NOT FIREABLE(malS4_1) AND NOT FIREABLE(malS4_2) AND NOT FIREABLE(malS4_3) AND NOT FIREABLE(malS4_4) AND NOT FIREABLE(malS4_5) AND NOT FIREABLE(malS4_6) AND NOT FIREABLE(malA5))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((NOT FIREABLE(malS4_0) AND NOT FIREABLE(malS4_1) AND NOT FIREABLE(malS4_2) AND NOT FIREABLE(malS4_3) AND NOT FIREABLE(malS4_4) AND NOT FIREABLE(malS4_5) AND NOT FIREABLE(malS4_6) AND NOT FIREABLE(malA5))))
lola: processed formula length: 211
lola: 41 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-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: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 10 markings, 9 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((NOT FIREABLE(AgetTS) OR (NOT FIREABLE(Sperform_1) AND NOT FIREABLE(Sperform_2) AND NOT FIREABLE(Sperform_3) AND NOT FIREABLE(Sperform_4) AND NOT FIREABLE(Sperform_0) AND NOT FIREABLE(Sperform_5) AND NOT FIREABLE(Sperform_6))) AND NOT FIREABLE(AendCS) AND (NOT FIREABLE(malA4) OR (NOT FIREABLE(SsendTS_2) AND NOT FIREABLE(SsendTS_1) AND NOT FIREABLE(SsendTS_0) AND NOT FIREABLE(SsendTS_6) AND NOT ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((NOT FIREABLE(AgetTS) OR (NOT FIREABLE(Sperform_1) AND NOT FIREABLE(Sperform_2) AND NOT FIREABLE(Sperform_3) AND NOT FIREABLE(Sperform_4) AND NOT FIREABLE(Sperform_0) AND NOT FIREABLE(Sperform_5) AND NOT FIREABLE(Sperform_6))) AND NOT FIREABLE(AendCS) AND (NOT FIREABLE(malA4) OR (NOT FIREABLE(SsendTS_2) AND NOT FIREABLE(SsendTS_1) AND NOT FIREABLE(SsendTS_0) AND NOT FIREABLE(SsendTS_6) AND NOT ... (shortened)
lola: processed formula length: 676
lola: 41 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-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 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((NOT FIREABLE(malS5_0) AND NOT FIREABLE(malS5_1) AND NOT FIREABLE(malS5_2) AND NOT FIREABLE(malS5_3) AND NOT FIREABLE(malS5_4) AND NOT FIREABLE(malS5_5) AND NOT FIREABLE(malS5_6)) OR (NOT FIREABLE(SreqTS_6) AND NOT FIREABLE(SreqTS_2) AND NOT FIREABLE(SreqTS_3) AND NOT FIREABLE(SreqTS_4) AND NOT FIREABLE(SreqTS_5) AND NOT FIREABLE(SreqTS_0) AND NOT FIREABLE(SreqTS_1)) OR NOT FIREABLE(malA4))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((NOT FIREABLE(malS5_0) AND NOT FIREABLE(malS5_1) AND NOT FIREABLE(malS5_2) AND NOT FIREABLE(malS5_3) AND NOT FIREABLE(malS5_4) AND NOT FIREABLE(malS5_5) AND NOT FIREABLE(malS5_6)) OR (NOT FIREABLE(SreqTS_6) AND NOT FIREABLE(SreqTS_2) AND NOT FIREABLE(SreqTS_3) AND NOT FIREABLE(SreqTS_4) AND NOT FIREABLE(SreqTS_5) AND NOT FIREABLE(SreqTS_0) AND NOT FIREABLE(SreqTS_1)) OR NOT FIREABLE(malA4))
lola: processed formula length: 396
lola: 41 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
FORMULA QuasiCertifProtocol-PT-06-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: (A (G (((NOT FIREABLE(malS4_0) AND NOT FIREABLE(malS4_1) AND NOT FIREABLE(malS4_2) AND NOT FIREABLE(malS4_3) AND NOT FIREABLE(malS4_4) AND NOT FIREABLE(malS4_5) AND NOT FIREABLE(malS4_6) AND NOT FIREABLE(SackCS_3) AND NOT FIREABLE(SackCS_2) AND NOT FIREABLE(SackCS_1) AND NOT FIREABLE(SackCS_0) AND NOT FIREABLE(SackCS_4) AND NOT FIREABLE(SackCS_5) AND NOT FIREABLE(SackCS_6)) OR ((FIREABLE(SgetTS_4... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: NOT FIREABLE(malA2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT FIREABLE(malA2)
lola: processed formula length: 19
lola: 41 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-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 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(malS4_0) AND NOT FIREABLE(malS4_1) AND NOT FIREABLE(malS4_2) AND NOT FIREABLE(malS4_3) AND NOT FIREABLE(malS4_4) AND NOT FIREABLE(malS4_5) AND NOT FIREABLE(malS4_6) AND NOT FIREABLE(SackCS_3) AND NOT FIREABLE(SackCS_2) AND NOT FIREABLE(SackCS_1) AND NOT FIREABLE(SackCS_0) AND NOT FIREABLE(SackCS_4) AND NOT FIREABLE(SackCS_5) AND NOT FIREABLE(SackCS_6)) OR ((FIREABLE(SgetTS_4)... (shortened)
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(malS4_0) AND NOT FIREABLE(malS4_1) AND NOT FIREABLE(malS4_2) AND NOT FIREABLE(malS4_3) AND NOT FIREABLE(malS4_4) AND NOT FIREABLE(malS4_5) AND NOT FIREABLE(malS4_6) AND NOT FIREABLE(SackCS_3) AND NOT FIREABLE(SackCS_2) AND NOT FIREABLE(SackCS_1) AND NOT FIREABLE(SackCS_0) AND NOT FIREABLE(SackCS_4) AND NOT FIREABLE(SackCS_5) AND NOT FIREABLE(SackCS_6)) OR ((FIREABLE(SgetTS_4)... (shortened)
lola: processed formula length: 717
lola: 43 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-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: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 11 markings, 10 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
FORMULA QuasiCertifProtocol-PT-06-CTLFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((A (G (NOT FIREABLE(malA3))) AND E (F ((NOT FIREABLE(malS1_0) AND NOT FIREABLE(malS1_2) AND NOT FIREABLE(malS1_1) AND NOT FIREABLE(malS1_4) AND NOT FIREABLE(malS1_3) AND NOT FIREABLE(malS1_5) AND NOT FIREABLE(malS1_6))))) OR E (X (FIREABLE(AendCS)))) AND E (X ((((NOT FIREABLE(malS1_0) AND NOT FIREABLE(malS1_2) AND NOT FIREABLE(malS1_1) AND NOT FIREABLE(malS1_4) AND NOT FIREABLE(malS1_3) AND NOT ... (shortened)
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: A (G (NOT FIREABLE(malA3)))
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(malA3)))
lola: processed formula length: 27
lola: 43 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-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: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 11 markings, 10 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (FIREABLE(AendCS)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: processed formula: EX(FIREABLE(AendCS))
lola: processed formula length: 20
lola: 42 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-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: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
FORMULA QuasiCertifProtocol-PT-06-CTLFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X (A (G (NOT FIREABLE(malS4_1))))) OR (A (F ((NOT FIREABLE(ScertCS_2) AND NOT FIREABLE(SsendTS_0)))) AND ((FIREABLE(CgenCertif_0) AND FIREABLE(malS5_4)) OR ((FIREABLE(SgetTS_4) OR FIREABLE(malS1_0) OR NOT FIREABLE(malS2_3)) AND E (F (FIREABLE(SreqTS_4)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(CgenCertif_0) AND FIREABLE(malS5_4))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(CgenCertif_0) AND FIREABLE(malS5_4))
lola: processed formula length: 46
lola: 41 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-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 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(SgetTS_4) OR FIREABLE(malS1_0) OR NOT FIREABLE(malS2_3))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(SgetTS_4) OR FIREABLE(malS1_0) OR NOT FIREABLE(malS2_3))
lola: processed formula length: 68
lola: 41 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-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 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(SreqTS_4)))
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(SreqTS_4)))
lola: processed formula length: 26
lola: 42 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-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: 21 markings, 20 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((NOT FIREABLE(ScertCS_2) AND NOT FIREABLE(SsendTS_0))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: (FIREABLE(ScertCS_2) OR FIREABLE(SsendTS_0))
lola: processed formula length: 45
lola: 43 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-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: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
FORMULA QuasiCertifProtocol-PT-06-CTLFireability-13 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 (G (A (F (NOT FIREABLE(malA3)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence in all states
lola: rewrite Frontend/Parser/formula_rewrite.k:644
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: FIREABLE(malA3)
lola: processed formula length: 15
lola: 43 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-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: yes
lola: produced by: state space /EFEG
lola: The predicate eventually occurs from all states.
lola: 16950 markings, 59854 edges
FORMULA QuasiCertifProtocol-PT-06-CTLFireability-6 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: A (F (FIREABLE(Sperform_5)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: NOT FIREABLE(Sperform_5)
lola: processed formula length: 24
lola: 43 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-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 does not eventually occur.
lola: 10 markings, 9 edges
lola: ========================================
lola: ========================================
FORMULA QuasiCertifProtocol-PT-06-CTLFireability-14 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: A (G (A ((FIREABLE(malS5_2) U NOT FIREABLE(malS6_3)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:739
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: processed formula: NOT(E(TRUE U NOT(A(FIREABLE(malS5_2) U NOT FIREABLE(malS6_3)))))
lola: processed formula length: 64
lola: 43 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-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: 200583 markings, 1255717 edges
FORMULA QuasiCertifProtocol-PT-06-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 7 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((NOT FIREABLE(malS3_3) OR (NOT FIREABLE(Sperform_5) AND NOT FIREABLE(malS2_6))) R E (G (NOT FIREABLE(ScertCS_4)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:742
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:312
lola: processed formula: NOT(E((FIREABLE(malS3_3) AND (FIREABLE(Sperform_5) OR FIREABLE(malS2_6))) U A(TRUE U FIREABLE(ScertCS_4))))
lola: processed formula length: 108
lola: 46 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-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: 10 markings, 10 edges
lola: ========================================
FORMULA QuasiCertifProtocol-PT-06-CTLFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((NOT FIREABLE(AgetTS) U A (G ((FIREABLE(ScertCS_5) OR FIREABLE(ScertCS_4) OR FIREABLE(ScertCS_6) OR FIREABLE(ScertCS_1) OR FIREABLE(ScertCS_0) OR FIREABLE(ScertCS_3) OR FIREABLE(ScertCS_2) OR FIREABLE(malS6_3) OR FIREABLE(malS6_2) OR FIREABLE(malS6_1) OR FIREABLE(malS6_0) OR FIREABLE(malS6_6) OR FIREABLE(malS6_5) OR FIREABLE(malS6_4))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:739
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: A(NOT FIREABLE(AgetTS) U NOT(E(TRUE U (NOT FIREABLE(ScertCS_5) AND NOT FIREABLE(ScertCS_4) AND NOT FIREABLE(ScertCS_6) AND NOT FIREABLE(ScertCS_1) AND NOT FIREABLE(ScertCS_0) AND NOT FIREABLE(ScertCS_3) AND NOT FIREABLE(ScertCS_2) AND NOT FIREABLE(malS6_3) AND NOT FIREABLE(malS6_2) AND NOT FIREABLE(malS6_1) AND NOT FIREABLE(malS6_0) AND NOT FIREABLE(malS6_6) AND NOT FIREABLE(malS6_5) AND NOT FIREA... (shortened)
lola: processed formula length: 416
lola: 44 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-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: 10 markings, 19 edges
lola: ========================================
FORMULA QuasiCertifProtocol-PT-06-CTLFireability-1 FALSE 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(malS6_3) OR FIREABLE(malS6_2) OR FIREABLE(malS6_1) OR FIREABLE(malS6_0) OR FIREABLE(malS6_6) OR FIREABLE(malS6_5) OR FIREABLE(malS6_4)) AND FIREABLE(malA2)))) U (NOT FIREABLE(malS1_0) AND NOT FIREABLE(malS1_2) AND NOT FIREABLE(malS1_1) AND NOT FIREABLE(malS1_4) AND NOT FIREABLE(malS1_3) AND NOT FIREABLE(malS1_5) AND NOT FIREABLE(malS1_6) AND ((NOT FIREABLE(malS5_0) AND N... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: processed formula: E(A(TRUE U ((FIREABLE(malS6_3) OR FIREABLE(malS6_2) OR FIREABLE(malS6_1) OR FIREABLE(malS6_0) OR FIREABLE(malS6_6) OR FIREABLE(malS6_5) OR FIREABLE(malS6_4)) AND FIREABLE(malA2))) U (NOT FIREABLE(malS1_0) AND NOT FIREABLE(malS1_2) AND NOT FIREABLE(malS1_1) AND NOT FIREABLE(malS1_4) AND NOT FIREABLE(malS1_3) AND NOT FIREABLE(malS1_5) AND NOT FIREABLE(malS1_6) AND ((NOT FIREABLE(malS5_0) AND N... (shortened)
lola: processed formula length: 759
lola: 43 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-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: 10 markings, 10 edges
lola: ========================================
FORMULA QuasiCertifProtocol-PT-06-CTLFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((E (F (FIREABLE(malS1_6))) AND (FIREABLE(CgenCertif_4) AND A ((FIREABLE(malS4_4) U FIREABLE(malA1)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:739
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: processed formula: E(TRUE U (E(TRUE U FIREABLE(malS1_6)) AND (FIREABLE(CgenCertif_4) AND A(FIREABLE(malS4_4) U FIREABLE(malA1)))))
lola: processed formula length: 111
lola: 44 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-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: 465088 markings, 2569948 edges, 93018 markings/sec, 0 secs
lola: 807194 markings, 5020573 edges, 68421 markings/sec, 5 secs
lola: 1187524 markings, 7535675 edges, 76066 markings/sec, 10 secs
lola: 1558668 markings, 10005829 edges, 74229 markings/sec, 15 secs
lola: 1874383 markings, 12478417 edges, 63143 markings/sec, 20 secs
lola: 2130677 markings, 14913772 edges, 51259 markings/sec, 25 secs
lola: 2222894 markings, 17630971 edges, 18443 markings/sec, 30 secs
lola: 2222894 markings, 20197736 edges, 0 markings/sec, 35 secs
lola: 2222894 markings, 22818327 edges, 0 markings/sec, 40 secs
lola: 2222894 markings, 25431734 edges, 0 markings/sec, 45 secs
lola: 2222894 markings, 28059123 edges, 0 markings/sec, 50 secs
lola: 2222894 markings, 30653490 edges, 0 markings/sec, 55 secs
lola: 2222894 markings, 33214581 edges, 0 markings/sec, 60 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 2223612 markings, 33545344 edges
FORMULA QuasiCertifProtocol-PT-06-CTLFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 11 will run for 699 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((NOT FIREABLE(AendCS) AND NOT FIREABLE(malA2)) OR (A (F ((FIREABLE(malS4_0) OR FIREABLE(malS4_1) OR FIREABLE(malS4_2) OR FIREABLE(malS4_3) OR FIREABLE(malS4_4) OR FIREABLE(malS4_5) OR FIREABLE(malS4_6)))) OR E (((FIREABLE(CgenCertif_0) OR FIREABLE(CgenCertif_5) OR FIREABLE(CgenCertif_6) OR FIREABLE(CgenCertif_3) OR FIREABLE(CgenCertif_4) OR FIREABLE(CgenCertif_1) OR FIREABLE(Cge... (shortened)
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:724
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: processed formula: NOT(A(TRUE U ((FIREABLE(AendCS) OR FIREABLE(malA2)) AND (NOT(A(TRUE U (FIREABLE(malS4_0) OR FIREABLE(malS4_1) OR FIREABLE(malS4_2) OR FIREABLE(malS4_3) OR FIREABLE(malS4_4) OR FIREABLE(malS4_5) OR FIREABLE(malS4_6)))) AND NOT(E((FIREABLE(CgenCertif_0) OR FIREABLE(CgenCertif_5) OR FIREABLE(CgenCertif_6) OR FIREABLE(CgenCertif_3) OR FIREABLE(CgenCertif_4) OR FIREABLE(CgenCertif_1) OR FI... (shortened)
lola: processed formula length: 581
lola: 47 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 10 markings, 9 edges
lola: ========================================
FORMULA QuasiCertifProtocol-PT-06-CTLFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 874 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (NOT FIREABLE(ScertCS_0))) AND (NOT FIREABLE(CsendTS1_1) AND (NOT FIREABLE(malS1_2) OR NOT FIREABLE(CgenCertif_6))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 874 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (NOT FIREABLE(CsendTS1_1) AND (NOT FIREABLE(malS1_2) OR NOT FIREABLE(CgenCertif_6)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (NOT FIREABLE(CsendTS1_1) AND (NOT FIREABLE(malS1_2) OR NOT FIREABLE(CgenCertif_6)))
lola: processed formula length: 85
lola: 41 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-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 13 will run for 1165 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (NOT FIREABLE(ScertCS_0)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (NOT FIREABLE(ScertCS_0)))
lola: processed formula length: 31
lola: 41 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-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: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 10 markings, 9 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
FORMULA QuasiCertifProtocol-PT-06-CTLFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1165 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((FIREABLE(CgenCertif_0) OR FIREABLE(CgenCertif_5) OR FIREABLE(CgenCertif_6) OR FIREABLE(CgenCertif_3) OR FIREABLE(CgenCertif_4) OR FIREABLE(CgenCertif_1) OR FIREABLE(CgenCertif_2)) AND FIREABLE(malA5)) R (FIREABLE(ScertCS_5) OR FIREABLE(ScertCS_4) OR FIREABLE(ScertCS_6) OR FIREABLE(ScertCS_1) OR FIREABLE(ScertCS_0) OR FIREABLE(ScertCS_3) OR FIREABLE(ScertCS_2) OR (NOT FIREABLE(ma... (shortened)
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 ((((FIREABLE(CgenCertif_0) OR FIREABLE(CgenCertif_5) OR FIREABLE(CgenCertif_6) OR FIREABLE(CgenCertif_3) OR FIREABLE(CgenCertif_4) OR FIREABLE(CgenCertif_1) OR FIREABLE(CgenCertif_2)) AND FIREABLE(malA5)) R (FIREABLE(ScertCS_5) OR FIREABLE(ScertCS_4) OR FIREABLE(ScertCS_6) OR FIREABLE(ScertCS_1) OR FIREABLE(ScertCS_0) OR FIREABLE(ScertCS_3) OR FIREABLE(ScertCS_2) OR (NOT FIREABLE(ma... (shortened)
lola: processed formula length: 593
lola: 47 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-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: (NOT FIREABLE(ScertCS_5) AND NOT FIREABLE(ScertCS_4) AND NOT FIREABLE(ScertCS_6) AND NOT FIREABLE(ScertCS_1) AND NOT FIREABLE(ScertCS_0) AND NOT FIREABLE(ScertCS_3) AND NOT FIREABLE(ScertCS_2) AND (FIREABLE(malS4_0) OR FIREABLE(malS4_1) OR FIREABLE(malS4_2) OR FIREABLE(malS4_3) OR FIREABLE(malS4_4) OR FIREABLE(malS4_5) OR FIREABLE(malS4_6)) AND FIREABLE(AstartCS))
lola: state equation: Generated DNF with 70 literals and 7 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-06-CTLFireability-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-PT-06-CTLFireability-13-0.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: Predicate Phi releases Predicate Psi on all paths.
FORMULA QuasiCertifProtocol-PT-06-CTLFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1748 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((FIREABLE(malS4_2) AND FIREABLE(malC1_2)))) AND A (G ((NOT FIREABLE(malC1_1) AND NOT FIREABLE(malS6_3) AND NOT FIREABLE(malA3)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1748 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((FIREABLE(malS4_2) AND FIREABLE(malC1_2))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (NOT FIREABLE(malS4_2) OR NOT FIREABLE(malC1_2))
lola: processed formula length: 49
lola: 43 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-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 does not eventually occur.
lola: 10 markings, 9 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ========================================
FORMULA QuasiCertifProtocol-PT-06-CTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3497 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G ((FIREABLE(CsendTS1_6) OR FIREABLE(malA1) OR FIREABLE(SgetTS_5)))) OR E (G (A (F (NOT FIREABLE(SsendTS_1))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3497 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((FIREABLE(CsendTS1_6) OR FIREABLE(malA1) OR FIREABLE(SgetTS_5))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((FIREABLE(CsendTS1_6) OR FIREABLE(malA1) OR FIREABLE(SgetTS_5))))
lola: processed formula length: 73
lola: 41 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-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: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (E (G ((FIREABLE(CsendTS1_6) OR FIREABLE(malA1) OR FIREABLE(SgetTS_5)))) OR E (G (A (F (NOT FIREABLE(SsendTS_1))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (G ((FIREABLE(CsendTS1_6) OR FIREABLE(malA1) OR FIREABLE(SgetTS_5))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((FIREABLE(CsendTS1_6) OR FIREABLE(malA1) OR FIREABLE(SgetTS_5))))
lola: processed formula length: 73
lola: 41 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-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 (G (A (F (NOT FIREABLE(SsendTS_1)))))
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 NOT FIREABLE(SsendTS_1)))))
lola: processed formula length: 53
lola: 43 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-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: 13569 markings, 33171 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
FORMULA QuasiCertifProtocol-PT-06-CTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no yes no no yes yes no no yes yes yes no yes no no
lola:
preliminary result: yes no yes no no yes yes no no yes yes yes no yes no no
lola: ========================================
lola: memory consumption: 14984 KB
lola: time consumption: 71 seconds
BK_STOP 1526924107001
--------------------
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="QuasiCertifProtocol-PT-06"
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/QuasiCertifProtocol-PT-06.tgz
mv QuasiCertifProtocol-PT-06 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 QuasiCertifProtocol-PT-06, 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 r136-qhx2-152673578700067"
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 '
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 ;