fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r136-qhx2-152673578800084
Last Updated
June 26, 2018

About the Execution of LoLA for QuasiCertifProtocol-PT-18

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
676.020 285938.00 552013.00 570.40 TTTTTTFTFFFTFTTF 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 1.2M
-rw-r--r-- 1 mcc users 27K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 110K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 26K 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 12K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 43K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 27K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K 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 6.7K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 30K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 6.2K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 17K 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 686K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is QuasiCertifProtocol-PT-18, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-qhx2-152673578800084
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526931422035

info: Time: 3600 - MCC
===========================================================================================
prep: translating QuasiCertifProtocol-PT-18 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating QuasiCertifProtocol-PT-18 formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ QuasiCertifProtocol-PT-18 @ 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: 1694/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 44736
lola: finding significant places
lola: 1398 places, 296 transitions, 295 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 391 transition conflict sets
lola: TASK
lola: reading formula from QuasiCertifProtocol-PT-18-ReachabilityFireability.task
lola: E (F (FIREABLE(malA5))) : A (G (((NOT FIREABLE(CgenCertif_9) AND NOT FIREABLE(CgenCertif_10) AND NOT FIREABLE(CgenCertif_11) AND NOT FIREABLE(CgenCertif_12) AND NOT FIREABLE(CgenCertif_5) AND NOT FIREABLE(CgenCertif_6) AND NOT FIREABLE(CgenCertif_7) AND NOT FIREABLE(CgenCertif_8) AND NOT FIREABLE(CgenCertif_1) AND NOT FIREABLE(CgenCertif_2) AND NOT FIREABLE(CgenCertif_3) AND NOT FIREABLE(CgenCertif_4) AND NOT FIREABLE(CgenCertif_0) AND NOT FIREABLE(CgenCertif_18) AND NOT FIREABLE(CgenCertif_17) AND NOT FIREABLE(CgenCertif_14) AND NOT FIREABLE(CgenCertif_13) AND NOT FIREABLE(CgenCertif_16) AND NOT FIREABLE(CgenCertif_15)) OR NOT FIREABLE(AreqTS) OR FIREABLE(malA3) OR (FIREABLE(malA5) AND NOT FIREABLE(malA2))))) : E (F (FIREABLE(AackCS))) : E (F ((FIREABLE(SgetTS_6) OR FIREABLE(SgetTS_5) OR FIREABLE(SgetTS_4) OR FIREABLE(SgetTS_3) OR FIREABLE(SgetTS_10) OR FIREABLE(SgetTS_9) OR FIREABLE(SgetTS_8) OR FIREABLE(SgetTS_7) OR FIREABLE(SgetTS_2) OR FIREABLE(SgetTS_1) OR FIREABLE(SgetTS_0) OR FIREABLE(SgetTS_16) OR FIREABLE(SgetTS_15) OR FIREABLE(SgetTS_18) OR FIREABLE(SgetTS_17) OR FIREABLE(SgetTS_12) OR FIREABLE(SgetTS_11) OR FIREABLE(SgetTS_14) OR FIREABLE(SgetTS_13) OR FIREABLE(CsendTS1_18) OR FIREABLE(CsendTS1_16) OR FIREABLE(CsendTS1_17) OR FIREABLE(CsendTS1_14) OR FIREABLE(CsendTS1_15) OR FIREABLE(CsendTS1_12) OR FIREABLE(CsendTS1_13) OR FIREABLE(CsendTS1_10) OR FIREABLE(CsendTS1_11) OR FIREABLE(CsendTS1_7) OR FIREABLE(CsendTS1_6) OR FIREABLE(CsendTS1_9) OR FIREABLE(CsendTS1_8) OR FIREABLE(CsendTS1_3) OR FIREABLE(CsendTS1_2) OR FIREABLE(CsendTS1_5) OR FIREABLE(CsendTS1_4) OR FIREABLE(CsendTS1_1) OR FIREABLE(CsendTS1_0) OR FIREABLE(SgetTS_6) OR FIREABLE(SgetTS_5) OR FIREABLE(SgetTS_4) OR FIREABLE(SgetTS_3) OR FIREABLE(SgetTS_10) OR FIREABLE(SgetTS_9) OR FIREABLE(SgetTS_8) OR FIREABLE(SgetTS_7) OR FIREABLE(SgetTS_2) OR FIREABLE(SgetTS_1) OR FIREABLE(SgetTS_0) OR FIREABLE(SgetTS_16) OR FIREABLE(SgetTS_15) OR FIREABLE(SgetTS_18) OR FIREABLE(SgetTS_17) OR FIREABLE(SgetTS_12) OR FIREABLE(SgetTS_11) OR FIREABLE(SgetTS_14) OR FIREABLE(SgetTS_13) OR ((FIREABLE(SgetTS_6) OR FIREABLE(SgetTS_5) OR FIREABLE(SgetTS_4) OR FIREABLE(SgetTS_3) OR FIREABLE(SgetTS_10) OR FIREABLE(SgetTS_9) OR FIREABLE(SgetTS_8) OR FIREABLE(SgetTS_7) OR FIREABLE(SgetTS_2) OR FIREABLE(SgetTS_1) OR FIREABLE(SgetTS_0) OR FIREABLE(SgetTS_16) OR FIREABLE(SgetTS_15) OR FIREABLE(SgetTS_18) OR FIREABLE(SgetTS_17) OR FIREABLE(SgetTS_12) OR FIREABLE(SgetTS_11) OR FIREABLE(SgetTS_14) OR FIREABLE(SgetTS_13)) AND FIREABLE(AendCS)) OR (NOT FIREABLE(malS1_9) AND NOT FIREABLE(malS1_10) AND NOT FIREABLE(malS1_11) AND NOT FIREABLE(malS1_12) AND NOT FIREABLE(malS1_5) AND NOT FIREABLE(malS1_6) AND NOT FIREABLE(malS1_7) AND NOT FIREABLE(malS1_8) AND NOT FIREABLE(malS1_17) AND NOT FIREABLE(malS1_18) AND NOT FIREABLE(malS1_13) AND NOT FIREABLE(malS1_14) AND NOT FIREABLE(malS1_15) AND NOT FIREABLE(malS1_16) AND NOT FIREABLE(malS1_2) AND NOT FIREABLE(malS1_1) AND NOT FIREABLE(malS1_4) AND NOT FIREABLE(malS1_3) AND NOT FIREABLE(malS1_0) AND NOT FIREABLE(malS4_18) AND NOT FIREABLE(malS4_17) AND NOT FIREABLE(malS4_16) AND NOT FIREABLE(malS4_15) AND NOT FIREABLE(malS4_14) AND 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(malS4_7) AND NOT FIREABLE(malS4_8) AND NOT FIREABLE(malS4_9) AND NOT FIREABLE(malS4_10) AND NOT FIREABLE(malS4_11) AND NOT FIREABLE(malS4_12) AND NOT FIREABLE(malS4_13) AND (NOT FIREABLE(AendCS) OR NOT FIREABLE(AgetTS)))))) : E (F (((FIREABLE(CgenCertif_9) OR FIREABLE(CgenCertif_10) OR FIREABLE(CgenCertif_11) OR FIREABLE(CgenCertif_12) OR FIREABLE(CgenCertif_5) OR FIREABLE(CgenCertif_6) OR FIREABLE(CgenCertif_7) OR FIREABLE(CgenCertif_8) OR FIREABLE(CgenCertif_1) OR FIREABLE(CgenCertif_2) OR FIREABLE(CgenCertif_3) OR FIREABLE(CgenCertif_4) OR FIREABLE(CgenCertif_0) OR FIREABLE(CgenCertif_18) OR FIREABLE(CgenCertif_17) OR FIREABLE(CgenCertif_14) OR FIREABLE(CgenCertif_13) OR FIREABLE(CgenCertif_16) OR FIREABLE(CgenCertif_15) OR FIREABLE(ScertCS_5) OR FIREABLE(ScertCS_4) OR FIREABLE(ScertCS_7) OR FIREABLE(ScertCS_6) OR FIREABLE(ScertCS_1) OR FIREABLE(ScertCS_0) OR FIREABLE(ScertCS_3) OR FIREABLE(ScertCS_2) OR FIREABLE(ScertCS_12) OR FIREABLE(ScertCS_13) OR FIREABLE(ScertCS_14) OR FIREABLE(ScertCS_15) OR FIREABLE(ScertCS_8) OR FIREABLE(ScertCS_9) OR FIREABLE(ScertCS_10) OR FIREABLE(ScertCS_11) OR FIREABLE(ScertCS_16) OR FIREABLE(ScertCS_17) OR FIREABLE(ScertCS_18)) AND (FIREABLE(malS5_0) OR FIREABLE(malS5_17) OR FIREABLE(malS5_18) OR FIREABLE(malS5_2) OR FIREABLE(malS5_1) OR FIREABLE(malS5_4) OR FIREABLE(malS5_3) OR FIREABLE(malS5_6) OR FIREABLE(malS5_5) OR FIREABLE(malS5_8) OR FIREABLE(malS5_7) OR FIREABLE(malS5_10) OR FIREABLE(malS5_9) OR FIREABLE(malS5_12) OR FIREABLE(malS5_11) OR FIREABLE(malS5_14) OR FIREABLE(malS5_13) OR FIREABLE(malS5_16) OR FIREABLE(malS5_15))))) : A (G (((NOT FIREABLE(SreqTS_8) AND NOT FIREABLE(SreqTS_9) AND NOT FIREABLE(SreqTS_6) AND NOT FIREABLE(SreqTS_7) AND NOT FIREABLE(SreqTS_12) AND NOT FIREABLE(SreqTS_13) AND NOT FIREABLE(SreqTS_10) AND NOT FIREABLE(SreqTS_11) AND NOT FIREABLE(SreqTS_0) AND NOT FIREABLE(SreqTS_1) AND NOT FIREABLE(SreqTS_4) AND NOT FIREABLE(SreqTS_5) AND NOT FIREABLE(SreqTS_2) AND NOT FIREABLE(SreqTS_3) AND NOT FIREABLE(SreqTS_17) AND NOT FIREABLE(SreqTS_16) AND NOT FIREABLE(SreqTS_15) AND NOT FIREABLE(SreqTS_14) AND NOT FIREABLE(SreqTS_18)) OR NOT FIREABLE(malA3) OR FIREABLE(malA1) OR (NOT FIREABLE(malS5_0) AND NOT FIREABLE(malS5_17) AND NOT FIREABLE(malS5_18) AND NOT FIREABLE(malS5_2) AND NOT FIREABLE(malS5_1) AND NOT FIREABLE(malS5_4) AND NOT FIREABLE(malS5_3) AND NOT FIREABLE(malS5_6) AND NOT FIREABLE(malS5_5) AND NOT FIREABLE(malS5_8) AND NOT FIREABLE(malS5_7) AND NOT FIREABLE(malS5_10) AND NOT FIREABLE(malS5_9) AND NOT FIREABLE(malS5_12) AND NOT FIREABLE(malS5_11) AND NOT FIREABLE(malS5_14) AND NOT FIREABLE(malS5_13) AND NOT FIREABLE(malS5_16) AND NOT FIREABLE(malS5_15))))) : A (G (((NOT FIREABLE(Sperform_17) AND NOT FIREABLE(Sperform_18) AND NOT FIREABLE(Sperform_0) AND NOT FIREABLE(Sperform_10) AND NOT FIREABLE(Sperform_9) AND NOT FIREABLE(Sperform_12) AND NOT FIREABLE(Sperform_11) AND NOT FIREABLE(Sperform_14) AND NOT FIREABLE(Sperform_13) AND NOT FIREABLE(Sperform_16) AND NOT FIREABLE(Sperform_15) AND NOT FIREABLE(Sperform_2) AND NOT FIREABLE(Sperform_1) AND NOT FIREABLE(Sperform_4) AND NOT FIREABLE(Sperform_3) AND NOT FIREABLE(Sperform_6) AND NOT FIREABLE(Sperform_5) AND NOT FIREABLE(Sperform_8) AND NOT FIREABLE(Sperform_7)) OR ((FIREABLE(malS1_9) OR FIREABLE(malS1_10) OR FIREABLE(malS1_11) OR FIREABLE(malS1_12) OR FIREABLE(malS1_5) OR FIREABLE(malS1_6) OR FIREABLE(malS1_7) OR FIREABLE(malS1_8) OR FIREABLE(malS1_17) OR FIREABLE(malS1_18) OR FIREABLE(malS1_13) OR FIREABLE(malS1_14) OR FIREABLE(malS1_15) OR FIREABLE(malS1_16) OR FIREABLE(malS1_2) OR FIREABLE(malS1_1) OR FIREABLE(malS1_4) OR FIREABLE(malS1_3) OR FIREABLE(malS1_0)) AND (FIREABLE(malS6_6) OR FIREABLE(malS6_7) OR FIREABLE(malS6_4) OR FIREABLE(malS6_5) OR FIREABLE(malS6_10) OR FIREABLE(malS6_11) OR FIREABLE(malS6_8) OR FIREABLE(malS6_9) OR FIREABLE(malS6_14) OR FIREABLE(malS6_15) OR FIREABLE(malS6_12) OR FIREABLE(malS6_13) OR FIREABLE(malS6_18) OR FIREABLE(malS6_16) OR FIREABLE(malS6_17) OR FIREABLE(malS6_3) OR FIREABLE(malS6_2) OR FIREABLE(malS6_1) OR FIREABLE(malS6_0) OR FIREABLE(malS6_6) OR FIREABLE(malS6_7) OR FIREABLE(malS6_4) OR FIREABLE(malS6_5) OR FIREABLE(malS6_10) OR FIREABLE(malS6_11) OR FIREABLE(malS6_8) OR FIREABLE(malS6_9) OR FIREABLE(malS6_14) OR FIREABLE(malS6_15) OR FIREABLE(malS6_12) OR FIREABLE(malS6_13) OR FIREABLE(malS6_18) OR FIREABLE(malS6_16) OR FIREABLE(malS6_17) OR FIREABLE(malS6_3) OR FIREABLE(malS6_2) OR FIREABLE(malS6_1) OR FIREABLE(malS6_0) OR FIREABLE(malS5_0) OR FIREABLE(malS5_17) OR FIREABLE(malS5_18) OR FIREABLE(malS5_2) OR FIREABLE(malS5_1) OR FIREABLE(malS5_4) OR FIREABLE(malS5_3) OR FIREABLE(malS5_6) OR FIREABLE(malS5_5) OR FIREABLE(malS5_8) OR FIREABLE(malS5_7) OR FIREABLE(malS5_10) OR FIREABLE(malS5_9) OR FIREABLE(malS5_12) OR FIREABLE(malS5_11) OR FIREABLE(malS5_14) OR FIREABLE(malS5_13) OR FIREABLE(malS5_16) OR FIREABLE(malS5_15)))))) : E (F (FIREABLE(AreqCS))) : E (F ((NOT FIREABLE(ScertCS_8) AND NOT FIREABLE(CsendTS1_10) AND NOT FIREABLE(SgetTS_4) AND FIREABLE(malS1_9) AND FIREABLE(malS6_0) AND FIREABLE(Sperform_11) AND ((FIREABLE(CgenCertif_18) AND FIREABLE(SsendTS_16)) OR (FIREABLE(ScertCS_15) AND FIREABLE(malS5_8)))))) : E (F ((FIREABLE(malS1_0) AND FIREABLE(malS3_0) AND (NOT FIREABLE(malS1_17) OR NOT FIREABLE(malS6_8) OR (NOT FIREABLE(SsendTS_16) AND NOT FIREABLE(malS3_6)))))) : A (G (NOT FIREABLE(SackCS_5))) : E (F (FIREABLE(malS5_0))) : A (G (((FIREABLE(malS4_2) AND FIREABLE(ScertCS_17) AND NOT FIREABLE(CgenCertif_4)) OR NOT FIREABLE(AstartCS)))) : E (F (FIREABLE(Sperform_18))) : E (F (FIREABLE(malS5_6))) : E (F ((((FIREABLE(malS4_5) AND FIREABLE(malS5_0) AND FIREABLE(SgetTS_16)) OR FIREABLE(Sperform_0)) AND FIREABLE(CsendTS1_6))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(malA5)))
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(malA5)))
lola: processed formula length: 23
lola: 1 rewrites
lola: closed formula file QuasiCertifProtocol-PT-18-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: FIREABLE(malA5)
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: 44 markings, 43 edges
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-18-ReachabilityFireability-0.sara
lola: ========================================

FORMULA QuasiCertifProtocol-PT-18-ReachabilityFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(AackCS)))
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(AackCS)))
lola: processed formula length: 24
lola: 1 rewrites
lola: closed formula file QuasiCertifProtocol-PT-18-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: FIREABLE(AackCS)
lola: state equation: Generated DNF with 20 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 42 markings, 41 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-18-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(AreqCS)))
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(AreqCS)))
lola: processed formula length: 24
lola: 1 rewrites
lola: closed formula file QuasiCertifProtocol-PT-18-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 22 markings, 21 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-18-ReachabilityFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(SackCS_5)))
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(SackCS_5)))
lola: processed formula length: 30
lola: 2 rewrites
lola: closed formula file QuasiCertifProtocol-PT-18-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: FIREABLE(SackCS_5)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-18-ReachabilityFireability-3-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 23 markings, 22 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-18-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(malS5_0)))
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(malS5_0)))
lola: processed formula length: 25
lola: 1 rewrites
lola: closed formula file QuasiCertifProtocol-PT-18-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: FIREABLE(malS5_0)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-18-ReachabilityFireability-4-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 46 markings, 45 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-18-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(Sperform_18)))
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(Sperform_18)))
lola: processed formula length: 29
lola: 1 rewrites
lola: closed formula file QuasiCertifProtocol-PT-18-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: FIREABLE(Sperform_18)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-18-ReachabilityFireability-5-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 44 markings, 43 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-18-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(malS5_6)))
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(malS5_6)))
lola: processed formula length: 25
lola: 1 rewrites
lola: closed formula file QuasiCertifProtocol-PT-18-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: FIREABLE(malS5_6)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-18-ReachabilityFireability-6-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 46 markings, 45 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-18-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(malS4_2) AND FIREABLE(ScertCS_17) AND NOT FIREABLE(CgenCertif_4)) OR NOT FIREABLE(AstartCS))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((FIREABLE(malS4_2) AND FIREABLE(ScertCS_17) AND NOT FIREABLE(CgenCertif_4)) OR NOT FIREABLE(AstartCS))))
lola: processed formula length: 112
lola: 2 rewrites
lola: closed formula file QuasiCertifProtocol-PT-18-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((NOT FIREABLE(malS4_2) OR NOT FIREABLE(ScertCS_17) OR FIREABLE(CgenCertif_4)) AND FIREABLE(AstartCS))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 43 markings, 42 edges
lola:
FORMULA QuasiCertifProtocol-PT-18-ReachabilityFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
state equation: Generated DNF with 27 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-18-ReachabilityFireability-7-0.sara
lola: ========================================
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((FIREABLE(malS4_5) AND FIREABLE(malS5_0) AND FIREABLE(SgetTS_16)) OR FIREABLE(Sperform_0)) AND FIREABLE(CsendTS1_6))))
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(malS4_5) AND FIREABLE(malS5_0) AND FIREABLE(SgetTS_16)) OR FIREABLE(Sperform_0)) AND FIREABLE(CsendTS1_6))))
lola: processed formula length: 127
lola: 1 rewrites
lola: closed formula file QuasiCertifProtocol-PT-18-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (((FIREABLE(malS4_5) AND FIREABLE(malS5_0) AND FIREABLE(SgetTS_16)) OR FIREABLE(Sperform_0)) AND FIREABLE(CsendTS1_6))
lola: state equation: Generated DNF with 66 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-18-ReachabilityFireability-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-PT-18-ReachabilityFireability-8-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.

FORMULA QuasiCertifProtocol-PT-18-ReachabilityFireability-15 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 (F ((FIREABLE(malS1_0) AND FIREABLE(malS3_0) AND (NOT FIREABLE(malS1_17) OR NOT FIREABLE(malS6_8) OR (NOT FIREABLE(SsendTS_16) AND NOT FIREABLE(malS3_6))))))
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(malS1_0) AND FIREABLE(malS3_0) AND (NOT FIREABLE(malS1_17) OR NOT FIREABLE(malS6_8) OR (NOT FIREABLE(SsendTS_16) AND NOT FIREABLE(malS3_6))))))
lola: processed formula length: 161
lola: 1 rewrites
lola: closed formula file QuasiCertifProtocol-PT-18-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (FIREABLE(malS1_0) AND FIREABLE(malS3_0) AND (NOT FIREABLE(malS1_17) OR NOT FIREABLE(malS6_8) OR (NOT FIREABLE(SsendTS_16) AND NOT FIREABLE(malS3_6))))
lola: state equation: Generated DNF with 22 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-18-ReachabilityFireability-9-0.sara
lola: state equation: calling and running sara
lola: ========================================
sara: try reading problem file QuasiCertifProtocol-PT-18-ReachabilityFireability-9-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================

FORMULA QuasiCertifProtocol-PT-18-ReachabilityFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(ScertCS_8) AND NOT FIREABLE(CsendTS1_10) AND NOT FIREABLE(SgetTS_4) AND FIREABLE(malS1_9) AND FIREABLE(malS6_0) AND FIREABLE(Sperform_11) AND ((FIREABLE(CgenCertif_18) AND FIREABLE(SsendTS_16)) OR (FIREABLE(ScertCS_15) AND FIREABLE(malS5_8))))))
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(ScertCS_8) AND NOT FIREABLE(CsendTS1_10) AND NOT FIREABLE(SgetTS_4) AND FIREABLE(malS1_9) AND FIREABLE(malS6_0) AND FIREABLE(Sperform_11) AND ((FIREABLE(CgenCertif_18) AND FIREABLE(SsendTS_16)) OR (FIREABLE(ScertCS_15) AND FIREABLE(malS5_8))))))
lola: processed formula length: 266
lola: 1 rewrites
lola: closed formula file QuasiCertifProtocol-PT-18-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (NOT FIREABLE(ScertCS_8) AND NOT FIREABLE(CsendTS1_10) AND NOT FIREABLE(SgetTS_4) AND FIREABLE(malS1_9) AND FIREABLE(malS6_0) AND FIREABLE(Sperform_11) AND ((FIREABLE(CgenCertif_18) AND FIREABLE(SsendTS_16)) OR (FIREABLE(ScertCS_15) AND FIREABLE(malS5_8))))
lola: state equation: Generated DNF with 17200 literals and 800 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-18-ReachabilityFireability-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-PT-18-ReachabilityFireability-10-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 465075 markings, 1128228 edges, 93015 markings/sec, 0 secs
lola: sara is running 5 secs || 808900 markings, 2283203 edges, 68765 markings/sec, 5 secs
lola: sara is running 10 secs || 1229218 markings, 3408652 edges, 84064 markings/sec, 10 secs
lola: sara is running 15 secs || 1592087 markings, 4564160 edges, 72574 markings/sec, 15 secs
lola: sara is running 20 secs || 1954206 markings, 5710187 edges, 72424 markings/sec, 20 secs
lola: sara is running 25 secs || 2340981 markings, 6857159 edges, 77355 markings/sec, 25 secs
lola: sara is running 30 secs || 2690314 markings, 8018637 edges, 69867 markings/sec, 30 secs
lola: sara is running 35 secs || 3023170 markings, 9175922 edges, 66571 markings/sec, 35 secs
lola: sara is running 40 secs || 3371040 markings, 10298545 edges, 69574 markings/sec, 40 secs
lola: sara is running 45 secs || 3703670 markings, 11433735 edges, 66526 markings/sec, 45 secs
lola: sara is running 50 secs || 4023904 markings, 12571698 edges, 64047 markings/sec, 50 secs
lola: sara is running 55 secs || 4328989 markings, 13705956 edges, 61017 markings/sec, 55 secs
lola: sara is running 60 secs || 4630684 markings, 14837118 edges, 60339 markings/sec, 60 secs
lola: sara is running 65 secs || 4920048 markings, 15992121 edges, 57873 markings/sec, 65 secs
lola: sara is running 70 secs || 5206786 markings, 17157255 edges, 57348 markings/sec, 70 secs
lola: sara is running 75 secs || 5456410 markings, 18323587 edges, 49925 markings/sec, 75 secs
lola: sara is running 80 secs || 5685430 markings, 19458773 edges, 45804 markings/sec, 80 secs
lola: sara is running 85 secs || 6111573 markings, 20581795 edges, 85229 markings/sec, 85 secs
lola: sara is running 90 secs || 6462998 markings, 21743669 edges, 70285 markings/sec, 90 secs
lola: sara is running 95 secs || 6852960 markings, 22872945 edges, 77992 markings/sec, 95 secs
lola: sara is running 100 secs || 7211655 markings, 23994185 edges, 71739 markings/sec, 100 secs
lola: sara is running 105 secs || 7548702 markings, 25158902 edges, 67409 markings/sec, 105 secs
lola: sara is running 110 secs || 7908401 markings, 26299040 edges, 71940 markings/sec, 110 secs
lola: sara is running 115 secs || 8258523 markings, 27421034 edges, 70024 markings/sec, 115 secs
lola: sara is running 120 secs || 8586286 markings, 28545468 edges, 65553 markings/sec, 120 secs
lola: sara is running 125 secs || 8908671 markings, 29686522 edges, 64477 markings/sec, 125 secs
lola: sara is running 130 secs || 9213051 markings, 30808448 edges, 60876 markings/sec, 130 secs
lola: sara is running 135 secs || 9507235 markings, 31942601 edges, 58837 markings/sec, 135 secs
lola: sara is running 140 secs || 9801020 markings, 33080661 edges, 58757 markings/sec, 140 secs
lola: sara is running 145 secs || 10086449 markings, 34240329 edges, 57086 markings/sec, 145 secs
lola: sara is running 150 secs || 10341094 markings, 35409209 edges, 50929 markings/sec, 150 secs
lola: sara is running 155 secs || 10589248 markings, 36585298 edges, 49631 markings/sec, 155 secs
lola: sara is running 160 secs || 10963897 markings, 37721142 edges, 74930 markings/sec, 160 secs
lola: sara is running 165 secs || 11297409 markings, 38864590 edges, 66702 markings/sec, 165 secs
lola: sara is running 170 secs || 11669382 markings, 39957600 edges, 74395 markings/sec, 170 secs
lola: sara is running 175 secs || 12025655 markings, 41097297 edges, 71255 markings/sec, 175 secs
lola: sara is running 180 secs || 12354717 markings, 42225393 edges, 65812 markings/sec, 180 secs

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.

FORMULA QuasiCertifProtocol-PT-18-ReachabilityFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: lola: ========================================
subprocess 11 will run for 675 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(CgenCertif_9) AND NOT FIREABLE(CgenCertif_10) AND NOT FIREABLE(CgenCertif_11) AND NOT FIREABLE(CgenCertif_12) AND NOT FIREABLE(CgenCertif_5) AND NOT FIREABLE(CgenCertif_6) AND NOT FIREABLE(CgenCertif_7) AND NOT FIREABLE(CgenCertif_8) AND NOT FIREABLE(CgenCertif_1) AND NOT FIREABLE(CgenCertif_2) AND NOT FIREABLE(CgenCertif_3) AND NOT FIREABLE(CgenCertif_4) AND NOT FIREABLE(Cgen... (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(CgenCertif_9) AND NOT FIREABLE(CgenCertif_10) AND NOT FIREABLE(CgenCertif_11) AND NOT FIREABLE(CgenCertif_12) AND NOT FIREABLE(CgenCertif_5) AND NOT FIREABLE(CgenCertif_6) AND NOT FIREABLE(CgenCertif_7) AND NOT FIREABLE(CgenCertif_8) AND NOT FIREABLE(CgenCertif_1) AND NOT FIREABLE(CgenCertif_2) AND NOT FIREABLE(CgenCertif_3) AND NOT FIREABLE(CgenCertif_4) AND NOT FIREABLE(Cgen... (shortened)
lola: processed formula length: 696
lola: 2 rewrites
lola: closed formula file QuasiCertifProtocol-PT-18-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((FIREABLE(CgenCertif_9) OR FIREABLE(CgenCertif_10) OR FIREABLE(CgenCertif_11) OR FIREABLE(CgenCertif_12) OR FIREABLE(CgenCertif_5) OR FIREABLE(CgenCertif_6) OR FIREABLE(CgenCertif_7) OR FIREABLE(CgenCertif_8) OR FIREABLE(CgenCertif_1) OR FIREABLE(CgenCertif_2) OR FIREABLE(CgenCertif_3) OR FIREABLE(CgenCertif_4) OR FIREABLE(CgenCertif_0) OR FIREABLE(CgenCertif_18) OR FIREABLE(CgenCertif_17) OR FIREABLE(CgenCertif_14) OR FIREABLE(CgenCertif_13) OR FIREABLE(CgenCertif_16) OR FIREABLE(CgenCertif_15)) AND FIREABLE(AreqTS) AND NOT FIREABLE(malA3) AND (NOT FIREABLE(malA5) OR FIREABLE(malA2)))
lola: state equation: Generated DNF with 874 literals and 38 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-18-ReachabilityFireability-11-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 2 markings, 1 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-18-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 844 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(SreqTS_8) AND NOT FIREABLE(SreqTS_9) AND NOT FIREABLE(SreqTS_6) AND NOT FIREABLE(SreqTS_7) AND NOT FIREABLE(SreqTS_12) AND NOT FIREABLE(SreqTS_13) AND NOT FIREABLE(SreqTS_10) AND NOT FIREABLE(SreqTS_11) AND NOT FIREABLE(SreqTS_0) AND NOT FIREABLE(SreqTS_1) AND NOT FIREABLE(SreqTS_4) AND NOT FIREABLE(SreqTS_5) AND NOT FIREABLE(SreqTS_2) AND NOT FIREABLE(SreqTS_3) AND NOT FIREAB... (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(SreqTS_8) AND NOT FIREABLE(SreqTS_9) AND NOT FIREABLE(SreqTS_6) AND NOT FIREABLE(SreqTS_7) AND NOT FIREABLE(SreqTS_12) AND NOT FIREABLE(SreqTS_13) AND NOT FIREABLE(SreqTS_10) AND NOT FIREABLE(SreqTS_11) AND NOT FIREABLE(SreqTS_0) AND NOT FIREABLE(SreqTS_1) AND NOT FIREABLE(SreqTS_4) AND NOT FIREABLE(SreqTS_5) AND NOT FIREABLE(SreqTS_2) AND NOT FIREABLE(SreqTS_3) AND NOT FIREAB... (shortened)
lola: processed formula length: 1078
lola: 2 rewrites
lola: closed formula file QuasiCertifProtocol-PT-18-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((FIREABLE(SreqTS_8) OR FIREABLE(SreqTS_9) OR FIREABLE(SreqTS_6) OR FIREABLE(SreqTS_7) OR FIREABLE(SreqTS_12) OR FIREABLE(SreqTS_13) OR FIREABLE(SreqTS_10) OR FIREABLE(SreqTS_11) OR FIREABLE(SreqTS_0) OR FIREABLE(SreqTS_1) OR FIREABLE(SreqTS_4) OR FIREABLE(SreqTS_5) OR FIREABLE(SreqTS_2) OR FIREABLE(SreqTS_3) OR FIREABLE(SreqTS_17) OR FIREABLE(SreqTS_16) OR FIREABLE(SreqTS_15) OR FIREABLE(SreqTS_14) OR FIREABLE(SreqTS_18)) AND FIREABLE(malA3) AND NOT FIREABLE(malA1) AND (FIREABLE(malS5_0) OR FIREABLE(malS5_17) OR FIREABLE(malS5_18) OR FIREABLE(malS5_2) OR FIREABLE(malS5_1) OR FIREABLE(malS5_4) OR FIREABLE(malS5_3) OR FIREABLE(malS5_6) OR FIREABLE(malS5_5) OR FIREABLE(malS5_8) OR FIREABLE(malS5_7) OR FIREABLE(malS5_10) OR FIREABLE(malS5_9) OR FIREABLE(malS5_12) OR FIREABLE(malS5_11) OR FIREABLE(malS5_14) OR FIREABLE(malS5_13) OR FIREABLE(malS5_16) OR FIREABLE(malS5_15)))
lola: state equation: Generated DNF with 1805 literals and 361 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-18-ReachabilityFireability-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-PT-18-ReachabilityFireability-12-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 330952 markings, 1103062 edges, 66190 markings/sec, 0 secs
lola: sara is running 5 secs || 609408 markings, 2206327 edges, 55691 markings/sec, 5 secs
lola: sara is running 10 secs || 845828 markings, 3337362 edges, 47284 markings/sec, 10 secs
lola: sara is running 15 secs || 1068976 markings, 4455170 edges, 44630 markings/sec, 15 secs
lola: sara is running 20 secs || 1282224 markings, 5591442 edges, 42650 markings/sec, 20 secs
lola: sara is running 25 secs || 1502465 markings, 6724822 edges, 44048 markings/sec, 25 secs
lola: sara is running 30 secs || 1712970 markings, 7839463 edges, 42101 markings/sec, 30 secs
lola: sara is running 35 secs || 1912071 markings, 8956631 edges, 39820 markings/sec, 35 secs
lola: sara is running 40 secs || 2114525 markings, 10084316 edges, 40491 markings/sec, 40 secs
lola: sara is running 45 secs || 2314363 markings, 11222319 edges, 39968 markings/sec, 45 secs
lola: sara is running 50 secs || 2510030 markings, 12359345 edges, 39133 markings/sec, 50 secs
lola: sara is running 55 secs || 2695661 markings, 13493576 edges, 37126 markings/sec, 55 secs
lola: sara is running 60 secs || 2890034 markings, 14627025 edges, 38875 markings/sec, 60 secs
lola: sara is running 65 secs || 3109031 markings, 15752859 edges, 43799 markings/sec, 65 secs

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================

FORMULA QuasiCertifProtocol-PT-18-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1101 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(CgenCertif_9) OR FIREABLE(CgenCertif_10) OR FIREABLE(CgenCertif_11) OR FIREABLE(CgenCertif_12) OR FIREABLE(CgenCertif_5) OR FIREABLE(CgenCertif_6) OR FIREABLE(CgenCertif_7) OR FIREABLE(CgenCertif_8) OR FIREABLE(CgenCertif_1) OR FIREABLE(CgenCertif_2) OR FIREABLE(CgenCertif_3) OR FIREABLE(CgenCertif_4) OR FIREABLE(CgenCertif_0) OR FIREABLE(CgenCertif_18) OR FIREABLE(C... (shortened)
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(CgenCertif_9) OR FIREABLE(CgenCertif_10) OR FIREABLE(CgenCertif_11) OR FIREABLE(CgenCertif_12) OR FIREABLE(CgenCertif_5) OR FIREABLE(CgenCertif_6) OR FIREABLE(CgenCertif_7) OR FIREABLE(CgenCertif_8) OR FIREABLE(CgenCertif_1) OR FIREABLE(CgenCertif_2) OR FIREABLE(CgenCertif_3) OR FIREABLE(CgenCertif_4) OR FIREABLE(CgenCertif_0) OR FIREABLE(CgenCertif_18) OR FIREABLE(C... (shortened)
lola: processed formula length: 1423
lola: 1 rewrites
lola: closed formula file QuasiCertifProtocol-PT-18-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((FIREABLE(CgenCertif_9) OR FIREABLE(CgenCertif_10) OR FIREABLE(CgenCertif_11) OR FIREABLE(CgenCertif_12) OR FIREABLE(CgenCertif_5) OR FIREABLE(CgenCertif_6) OR FIREABLE(CgenCertif_7) OR FIREABLE(CgenCertif_8) OR FIREABLE(CgenCertif_1) OR FIREABLE(CgenCertif_2) OR FIREABLE(CgenCertif_3) OR FIREABLE(CgenCertif_4) OR FIREABLE(CgenCertif_0) OR FIREABLE(CgenCertif_18) OR FIREABLE(CgenCertif_17) OR FIREABLE(CgenCertif_14) OR FIREABLE(CgenCertif_13) OR FIREABLE(CgenCertif_16) OR FIREABLE(CgenCertif_15) OR FIREABLE(ScertCS_5) OR FIREABLE(ScertCS_4) OR FIREABLE(ScertCS_7) OR FIREABLE(ScertCS_6) OR FIREABLE(ScertCS_1) OR FIREABLE(ScertCS_0) OR FIREABLE(ScertCS_3) OR FIREABLE(ScertCS_2) OR FIREABLE(ScertCS_12) OR FIREABLE(ScertCS_13) OR FIREABLE(ScertCS_14) OR FIREABLE(ScertCS_15) OR FIREABLE(ScertCS_8) OR FIREABLE(ScertCS_9) OR FIREABLE(ScertCS_10) OR FIREABLE(ScertCS_11) OR FIREABLE(ScertCS_16) OR FIREABLE(ScertCS_17) OR FIREABLE(ScertCS_18)) AND (FIREABLE(malS5_0) OR FIREABLE(malS5_17) OR FIREABLE(malS5_18) OR FIREABLE(malS5_2) OR FIREABLE(malS5_1) OR FIREABLE(malS5_4) OR FIREABLE(malS5_3) OR FIREABLE(malS5_6) OR FIREABLE(malS5_5) OR FIREABLE(malS5_8) OR FIREABLE(malS5_7) OR FIREABLE(malS5_10) OR FIREABLE(malS5_9) OR FIREABLE(malS5_12) OR FIREABLE(malS5_11) OR FIREABLE(malS5_14) OR FIREABLE(malS5_13) OR FIREABLE(malS5_16) OR FIREABLE(malS5_15)))
lola: state equation: Generated DNF with 9025 literals and 722 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-18-ReachabilityFireability-13-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 102 markings, 101 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-18-ReachabilityFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1652 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(Sperform_17) AND NOT FIREABLE(Sperform_18) AND NOT FIREABLE(Sperform_0) AND NOT FIREABLE(Sperform_10) AND NOT FIREABLE(Sperform_9) AND NOT FIREABLE(Sperform_12) AND NOT FIREABLE(Sperform_11) AND NOT FIREABLE(Sperform_14) AND NOT FIREABLE(Sperform_13) AND NOT FIREABLE(Sperform_16) AND NOT FIREABLE(Sperform_15) AND NOT FIREABLE(Sperform_2) AND NOT FIREABLE(Sperform_1) AND NOT FI... (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(Sperform_17) AND NOT FIREABLE(Sperform_18) AND NOT FIREABLE(Sperform_0) AND NOT FIREABLE(Sperform_10) AND NOT FIREABLE(Sperform_9) AND NOT FIREABLE(Sperform_12) AND NOT FIREABLE(Sperform_11) AND NOT FIREABLE(Sperform_14) AND NOT FIREABLE(Sperform_13) AND NOT FIREABLE(Sperform_16) AND NOT FIREABLE(Sperform_15) AND NOT FIREABLE(Sperform_2) AND NOT FIREABLE(Sperform_1) AND NOT FI... (shortened)
lola: processed formula length: 2281
lola: 2 rewrites
lola: closed formula file QuasiCertifProtocol-PT-18-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((FIREABLE(Sperform_17) OR FIREABLE(Sperform_18) OR FIREABLE(Sperform_0) OR FIREABLE(Sperform_10) OR FIREABLE(Sperform_9) OR FIREABLE(Sperform_12) OR FIREABLE(Sperform_11) OR FIREABLE(Sperform_14) OR FIREABLE(Sperform_13) OR FIREABLE(Sperform_16) OR FIREABLE(Sperform_15) OR FIREABLE(Sperform_2) OR FIREABLE(Sperform_1) OR FIREABLE(Sperform_4) OR FIREABLE(Sperform_3) OR FIREABLE(Sperform_6) OR FIREABLE(Sperform_5) OR FIREABLE(Sperform_8) OR FIREABLE(Sperform_7)) AND ((NOT FIREABLE(malS1_9) AND NOT FIREABLE(malS1_10) AND NOT FIREABLE(malS1_11) AND NOT FIREABLE(malS1_12) AND NOT FIREABLE(malS1_5) AND NOT FIREABLE(malS1_6) AND NOT FIREABLE(malS1_7) AND NOT FIREABLE(malS1_8) AND NOT FIREABLE(malS1_17) AND NOT FIREABLE(malS1_18) AND NOT FIREABLE(malS1_13) AND NOT FIREABLE(malS1_14) AND NOT FIREABLE(malS1_15) AND NOT FIREABLE(malS1_16) AND NOT FIREABLE(malS1_2) AND NOT FIREABLE(malS1_1) AND NOT FIREABLE(malS1_4) AND NOT FIREABLE(malS1_3) AND NOT FIREABLE(malS1_0)) OR (NOT FIREABLE(malS6_6) AND NOT FIREABLE(malS6_7) AND NOT FIREABLE(malS6_4) AND NOT FIREABLE(malS6_5) AND NOT FIREABLE(malS6_10) AND NOT FIREABLE(malS6_11) AND NOT FIREABLE(malS6_8) AND NOT FIREABLE(malS6_9) AND NOT FIREABLE(malS6_14) AND NOT FIREABLE(malS6_15) AND NOT FIREABLE(malS6_12) AND NOT FIREABLE(malS6_13) AND NOT FIREABLE(malS6_18) AND NOT FIREABLE(malS6_16) AND NOT FIREABLE(malS6_17) 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_7) AND NOT FIREABLE(malS6_4) AND NOT FIREABLE(malS6_5) AND NOT FIREABLE(malS6_10) AND NOT FIREABLE(malS6_11) AND NOT FIREABLE(malS6_8) AND NOT FIREABLE(malS6_9) AND NOT FIREABLE(malS6_14) AND NOT FIREABLE(malS6_15) AND NOT FIREABLE(malS6_12) AND NOT FIREABLE(malS6_13) AND NOT FIREABLE(malS6_18) AND NOT FIREABLE(malS6_16) AND NOT FIREABLE(malS6_17) AND NOT FIREABLE(malS6_3) AND NOT FIREABLE(malS6_2) AND NOT FIREABLE(malS6_1) AND NOT FIREABLE(malS6_0) AND NOT FIREABLE(malS5_0) AND NOT FIREABLE(malS5_17) AND NOT FIREABLE(malS5_18) AND NOT FIREABLE(malS5_2) AND NOT FIREABLE(malS5_1) AND NOT FIREABLE(malS5_4) AND NOT FIREABLE(malS5_3) AND NOT FIREABLE(malS5_6) AND NOT FIREABLE(malS5_5) AND NOT FIREABLE(malS5_8) AND NOT FIREABLE(malS5_7) AND NOT FIREABLE(malS5_10) AND NOT FIREABLE(malS5_9) AND NOT FIREABLE(malS5_12) AND NOT FIREABLE(malS5_11) AND NOT FIREABLE(malS5_14) AND NOT FIREABLE(malS5_13) AND NOT FIREABLE(malS5_16) AND NOT FIREABLE(malS5_15))))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 44 markings, 43 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-18-ReachabilityFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3305 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(SgetTS_6) OR FIREABLE(SgetTS_5) OR FIREABLE(SgetTS_4) OR FIREABLE(SgetTS_3) OR FIREABLE(SgetTS_10) OR FIREABLE(SgetTS_9) OR FIREABLE(SgetTS_8) OR FIREABLE(SgetTS_7) OR FIREABLE(SgetTS_2) OR FIREABLE(SgetTS_1) OR FIREABLE(SgetTS_0) OR FIREABLE(SgetTS_16) OR FIREABLE(SgetTS_15) OR FIREABLE(SgetTS_18) OR FIREABLE(SgetTS_17) OR FIREABLE(SgetTS_12) OR FIREABLE(SgetTS_11)... (shortened)
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(SgetTS_6) OR FIREABLE(SgetTS_5) OR FIREABLE(SgetTS_4) OR FIREABLE(SgetTS_3) OR FIREABLE(SgetTS_10) OR FIREABLE(SgetTS_9) OR FIREABLE(SgetTS_8) OR FIREABLE(SgetTS_7) OR FIREABLE(SgetTS_2) OR FIREABLE(SgetTS_1) OR FIREABLE(SgetTS_0) OR FIREABLE(SgetTS_16) OR FIREABLE(SgetTS_15) OR FIREABLE(SgetTS_18) OR FIREABLE(SgetTS_17) OR FIREABLE(SgetTS_12) OR FIREABLE(SgetTS_11)... (shortened)
lola: processed formula length: 2912
lola: 1 rewrites
lola: closed formula file QuasiCertifProtocol-PT-18-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (FIREABLE(SgetTS_6) OR FIREABLE(SgetTS_5) OR FIREABLE(SgetTS_4) OR FIREABLE(SgetTS_3) OR FIREABLE(SgetTS_10) OR FIREABLE(SgetTS_9) OR FIREABLE(SgetTS_8) OR FIREABLE(SgetTS_7) OR FIREABLE(SgetTS_2) OR FIREABLE(SgetTS_1) OR FIREABLE(SgetTS_0) OR FIREABLE(SgetTS_16) OR FIREABLE(SgetTS_15) OR FIREABLE(SgetTS_18) OR FIREABLE(SgetTS_17) OR FIREABLE(SgetTS_12) OR FIREABLE(SgetTS_11) OR FIREABLE(SgetTS_14) OR FIREABLE(SgetTS_13) OR FIREABLE(CsendTS1_18) OR FIREABLE(CsendTS1_16) OR FIREABLE(CsendTS1_17) OR FIREABLE(CsendTS1_14) OR FIREABLE(CsendTS1_15) OR FIREABLE(CsendTS1_12) OR FIREABLE(CsendTS1_13) OR FIREABLE(CsendTS1_10) OR FIREABLE(CsendTS1_11) OR FIREABLE(CsendTS1_7) OR FIREABLE(CsendTS1_6) OR FIREABLE(CsendTS1_9) OR FIREABLE(CsendTS1_8) OR FIREABLE(CsendTS1_3) OR FIREABLE(CsendTS1_2) OR FIREABLE(CsendTS1_5) OR FIREABLE(CsendTS1_4) OR FIREABLE(CsendTS1_1) OR FIREABLE(CsendTS1_0) OR FIREABLE(SgetTS_6) OR FIREABLE(SgetTS_5) OR FIREABLE(SgetTS_4) OR FIREABLE(SgetTS_3) OR FIREABLE(SgetTS_10) OR FIREABLE(SgetTS_9) OR FIREABLE(SgetTS_8) OR FIREABLE(SgetTS_7) OR FIREABLE(SgetTS_2) OR FIREABLE(SgetTS_1) OR FIREABLE(SgetTS_0) OR FIREABLE(SgetTS_16) OR FIREABLE(SgetTS_15) OR FIREABLE(SgetTS_18) OR FIREABLE(SgetTS_17) OR FIREABLE(SgetTS_12) OR FIREABLE(SgetTS_11) OR FIREABLE(SgetTS_14) OR FIREABLE(SgetTS_13) OR ((FIREABLE(SgetTS_6) OR FIREABLE(SgetTS_5) OR FIREABLE(SgetTS_4) OR FIREABLE(SgetTS_3) OR FIREABLE(SgetTS_10) OR FIREABLE(SgetTS_9) OR FIREABLE(SgetTS_8) OR FIREABLE(SgetTS_7) OR FIREABLE(SgetTS_2) OR FIREABLE(SgetTS_1) OR FIREABLE(SgetTS_0) OR FIREABLE(SgetTS_16) OR FIREABLE(SgetTS_15) OR FIREABLE(SgetTS_18) OR FIREABLE(SgetTS_17) OR FIREABLE(SgetTS_12) OR FIREABLE(SgetTS_11) OR FIREABLE(SgetTS_14) OR FIREABLE(SgetTS_13)) AND FIREABLE(AendCS)) OR (NOT FIREABLE(malS1_9) AND NOT FIREABLE(malS1_10) AND NOT FIREABLE(malS1_11) AND NOT FIREABLE(malS1_12) AND NOT FIREABLE(malS1_5) AND NOT FIREABLE(malS1_6) AND NOT FIREABLE(malS1_7) AND NOT FIREABLE(malS1_8) AND NOT FIREABLE(malS1_17) AND NOT FIREABLE(malS1_18) AND NOT FIREABLE(malS1_13) AND NOT FIREABLE(malS1_14) AND NOT FIREABLE(malS1_15) AND NOT FIREABLE(malS1_16) AND NOT FIREABLE(malS1_2) AND NOT FIREABLE(malS1_1) AND NOT FIREABLE(malS1_4) AND NOT FIREABLE(malS1_3) AND NOT FIREABLE(malS1_0) AND NOT FIREABLE(malS4_18) AND NOT FIREABLE(malS4_17) AND NOT FIREABLE(malS4_16) AND NOT FIREABLE(malS4_15) AND NOT FIREABLE(malS4_14) AND 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(malS4_7) AND NOT FIREABLE(malS4_8) AND NOT FIREABLE(malS4_9) AND NOT FIREABLE(malS4_10) AND NOT FIREABLE(malS4_11) AND NOT FIREABLE(malS4_12) AND NOT FIREABLE(malS4_13) AND (NOT FIREABLE(AendCS) OR NOT FIREABLE(AgetTS))))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 11 markings, 10 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-18-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes yes yes yes yes yes no yes no no no yes no yes yes no
lola:
preliminary result: yes yes yes yes yes yes no yes no no no yes no yes yes no
lola: memory consumption: 15816 KB
lola: time consumption: 265 seconds

BK_STOP 1526931707973

--------------------
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-18"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-PT-18.tgz
mv QuasiCertifProtocol-PT-18 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-18, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r136-qhx2-152673578800084"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;