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 ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-qhx2-152673578700070
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526924203143

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 ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ QuasiCertifProtocol-PT-06 @ 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: 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-ReachabilityFireability.task
lola: E (F ((FIREABLE(AgetTS) AND (FIREABLE(SreqTS_6) OR FIREABLE(SreqTS_2) OR FIREABLE(SreqTS_3) OR FIREABLE(SreqTS_4) OR FIREABLE(SreqTS_5) OR FIREABLE(SreqTS_0) OR FIREABLE(SreqTS_1)) AND (((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(AreqCS)) OR NOT FIREABLE(AendCS) OR FIREABLE(AreqTS))))) : E (F ((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 (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 NOT FIREABLE(SgetTS_4) AND NOT FIREABLE(SgetTS_3) AND NOT FIREABLE(SgetTS_6) AND NOT FIREABLE(SgetTS_5) AND NOT FIREABLE(SgetTS_0) AND NOT FIREABLE(SgetTS_2) AND NOT FIREABLE(SgetTS_1)))) : E (F ((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) AND (FIREABLE(SackCS_3) OR FIREABLE(SackCS_2) OR FIREABLE(SackCS_1) OR FIREABLE(SackCS_0) OR FIREABLE(SackCS_4) OR FIREABLE(SackCS_5) OR FIREABLE(SackCS_6) OR FIREABLE(malS3_4) OR FIREABLE(malS3_3) OR FIREABLE(malS3_6) OR FIREABLE(malS3_5) OR FIREABLE(malS3_0) OR FIREABLE(malS3_1) OR FIREABLE(malS3_2))))) : A (G ((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(AreqTS) OR FIREABLE(AackCS) OR FIREABLE(AreqTS) OR ((FIREABLE(SreqTS_6) OR FIREABLE(SreqTS_2) OR FIREABLE(SreqTS_3) OR FIREABLE(SreqTS_4) OR FIREABLE(SreqTS_5) OR FIREABLE(SreqTS_0) OR FIREABLE(SreqTS_1)) 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))) OR (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))))) : A (G (((NOT FIREABLE(CsendTS1_6) AND NOT FIREABLE(CsendTS1_5) AND NOT FIREABLE(CsendTS1_4) AND NOT FIREABLE(CsendTS1_3) AND NOT FIREABLE(CsendTS1_2) AND NOT FIREABLE(CsendTS1_0) AND NOT FIREABLE(CsendTS1_1)) 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 (FIREABLE(SreqTS_6) OR FIREABLE(SreqTS_2) OR FIREABLE(SreqTS_3) OR FIREABLE(SreqTS_4) OR FIREABLE(SreqTS_5) OR FIREABLE(SreqTS_0) OR FIREABLE(SreqTS_1) OR FIREABLE(malA3)) AND (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) OR ((FIREABLE(malS2_1) OR FIREABLE(malS2_0) OR FIREABLE(malS2_3) OR FIREABLE(malS2_2) OR FIREABLE(malS2_5) OR FIREABLE(malS2_4) OR FIREABLE(malS2_6)) AND FIREABLE(malA4))))))) : E (F ((FIREABLE(AackCS) AND (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(malS5_0) OR FIREABLE(malS5_1) OR FIREABLE(malS5_2) OR FIREABLE(malS5_3) OR FIREABLE(malS5_4) OR FIREABLE(malS5_5) OR FIREABLE(malS5_6))))) : E (F (FIREABLE(malA4))) : E (F (((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 NOT FIREABLE(malA4) AND (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))) OR ((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(AackCS) 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) OR FIREABLE(AgetTS)) AND (FIREABLE(malS3_4) OR FIREABLE(malS3_3) OR FIREABLE(malS3_6) OR FIREABLE(malS3_5) OR FIREABLE(malS3_0) OR FIREABLE(malS3_1) OR FIREABLE(malS3_2)))))) : E (F (FIREABLE(SackCS_6))) : E (F ((FIREABLE(SreqTS_6) OR FIREABLE(ScertCS_2) OR ((FIREABLE(malS5_1) OR FIREABLE(malC1_3)) AND FIREABLE(SsendTS_2)) OR FIREABLE(malA2) OR (FIREABLE(CsendTS1_4) AND FIREABLE(malS4_2)) OR FIREABLE(malS5_5)))) : E (F ((FIREABLE(malS4_6) AND FIREABLE(SreqTS_5) AND FIREABLE(malC1_3)))) : E (F (((FIREABLE(Sperform_4) OR FIREABLE(SgetTS_6)) AND (FIREABLE(CsendTS1_6) OR FIREABLE(CgenCertif_0))))) : A (G ((NOT FIREABLE(malS2_2) OR (FIREABLE(CsendTS1_4) AND FIREABLE(malC1_3)) OR FIREABLE(ScertCS_0) OR ((NOT FIREABLE(malS6_1) OR NOT FIREABLE(malS3_6)) AND NOT FIREABLE(malS5_1))))) : E (F ((NOT FIREABLE(AstartCS) AND NOT FIREABLE(malS6_6) AND FIREABLE(malC1_4) AND (((FIREABLE(SackCS_0) OR FIREABLE(malS3_6)) AND (FIREABLE(Sperform_3) OR FIREABLE(malS1_4))) OR FIREABLE(SreqTS_3))))) : E (F (((FIREABLE(malS5_6) OR (FIREABLE(CsendTS1_3) AND FIREABLE(CgenCertif_0)) OR FIREABLE(AreqCS)) AND ((FIREABLE(SgetTS_4) AND FIREABLE(Sperform_6) AND FIREABLE(malS2_0) AND FIREABLE(malS4_5)) OR (NOT FIREABLE(SreqTS_0) AND NOT FIREABLE(SreqTS_2)))))) : A (G (NOT FIREABLE(malC1_2)))
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(malA4)))
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(malA4)))
lola: processed formula length: 23
lola: 1 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-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(malA4)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-06-ReachabilityFireability-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 19 markings, 18 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-06-ReachabilityFireability-6 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(SackCS_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(SackCS_6)))
lola: processed formula length: 26
lola: 1 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-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(SackCS_6)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-06-ReachabilityFireability-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: 11 markings, 10 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-06-ReachabilityFireability-8 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: A (G (NOT FIREABLE(malC1_2)))
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(malC1_2)))
lola: processed formula length: 29
lola: 2 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-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(malC1_2)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 35 markings, 34 edges
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-06-ReachabilityFireability-2-0.sara

FORMULA QuasiCertifProtocol-PT-06-ReachabilityFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(malS4_6) AND FIREABLE(SreqTS_5) AND FIREABLE(malC1_3))))
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_6) AND FIREABLE(SreqTS_5) AND FIREABLE(malC1_3))))
lola: processed formula length: 72
lola: 1 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-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_6) AND FIREABLE(SreqTS_5) AND FIREABLE(malC1_3))
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-06-ReachabilityFireability-3-0.sara
sara: try reading problem file QuasiCertifProtocol-PT-06-ReachabilityFireability-2-0.sara.
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-PT-06-ReachabilityFireability-3-0.sara.
sara: place or transition ordering is non-deterministic

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-06-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(Sperform_4) OR FIREABLE(SgetTS_6)) AND (FIREABLE(CsendTS1_6) OR FIREABLE(CgenCertif_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(Sperform_4) OR FIREABLE(SgetTS_6)) AND (FIREABLE(CsendTS1_6) OR FIREABLE(CgenCertif_0)))))
lola: processed formula length: 109
lola: 1 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-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_4) OR FIREABLE(SgetTS_6)) AND (FIREABLE(CsendTS1_6) OR FIREABLE(CgenCertif_0)))
lola: state equation: Generated DNF with 52 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-06-ReachabilityFireability-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-PT-06-ReachabilityFireability-4-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-06-ReachabilityFireability-11 FALSE 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 (G ((NOT FIREABLE(malS2_2) OR (FIREABLE(CsendTS1_4) AND FIREABLE(malC1_3)) OR FIREABLE(ScertCS_0) OR ((NOT FIREABLE(malS6_1) OR NOT FIREABLE(malS3_6)) AND NOT FIREABLE(malS5_1)))))
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(malS2_2) OR (FIREABLE(CsendTS1_4) AND FIREABLE(malC1_3)) OR FIREABLE(ScertCS_0) OR ((NOT FIREABLE(malS6_1) OR NOT FIREABLE(malS3_6)) AND NOT FIREABLE(malS5_1)))))
lola: processed formula length: 186
lola: 2 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-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(malS2_2) AND (NOT FIREABLE(CsendTS1_4) OR NOT FIREABLE(malC1_3)) AND NOT FIREABLE(ScertCS_0) AND ((FIREABLE(malS6_1) AND FIREABLE(malS3_6)) OR FIREABLE(malS5_1)))
lola: state equation: Generated DNF with 126 literals and 18 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-06-ReachabilityFireability-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-PT-06-ReachabilityFireability-5-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 12643 markings, 30481 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-06-ReachabilityFireability-12 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 ((NOT FIREABLE(AstartCS) AND NOT FIREABLE(malS6_6) AND FIREABLE(malC1_4) AND (((FIREABLE(SackCS_0) OR FIREABLE(malS3_6)) AND (FIREABLE(Sperform_3) OR FIREABLE(malS1_4))) OR FIREABLE(SreqTS_3)))))
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(AstartCS) AND NOT FIREABLE(malS6_6) AND FIREABLE(malC1_4) AND (((FIREABLE(SackCS_0) OR FIREABLE(malS3_6)) AND (FIREABLE(Sperform_3) OR FIREABLE(malS1_4))) OR FIREABLE(SreqTS_3)))))
lola: processed formula length: 203
lola: 1 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-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(AstartCS) AND NOT FIREABLE(malS6_6) AND FIREABLE(malC1_4) AND (((FIREABLE(SackCS_0) OR FIREABLE(malS3_6)) AND (FIREABLE(Sperform_3) OR FIREABLE(malS1_4))) OR FIREABLE(SreqTS_3)))
lola: state equation: Generated DNF with 37 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-06-ReachabilityFireability-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-PT-06-ReachabilityFireability-6-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-06-ReachabilityFireability-13 FALSE 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: E (F ((FIREABLE(SreqTS_6) OR FIREABLE(ScertCS_2) OR ((FIREABLE(malS5_1) OR FIREABLE(malC1_3)) AND FIREABLE(SsendTS_2)) OR FIREABLE(malA2) OR (FIREABLE(CsendTS1_4) AND FIREABLE(malS4_2)) OR FIREABLE(malS5_5))))
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_6) OR FIREABLE(ScertCS_2) OR ((FIREABLE(malS5_1) OR FIREABLE(malC1_3)) AND FIREABLE(SsendTS_2)) OR FIREABLE(malA2) OR (FIREABLE(CsendTS1_4) AND FIREABLE(malS4_2)) OR FIREABLE(malS5_5))))
lola: processed formula length: 215
lola: 1 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-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(SreqTS_6) OR FIREABLE(ScertCS_2) OR ((FIREABLE(malS5_1) OR FIREABLE(malC1_3)) AND FIREABLE(SsendTS_2)) OR FIREABLE(malA2) OR (FIREABLE(CsendTS1_4) AND FIREABLE(malS4_2)) OR FIREABLE(malS5_5))
lola: state equation: Generated DNF with 23 literals and 7 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 10 markings, 9 edges
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-06-ReachabilityFireability-7-0.sara
lola: ========================================

FORMULA QuasiCertifProtocol-PT-06-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(malS5_6) OR (FIREABLE(CsendTS1_3) AND FIREABLE(CgenCertif_0)) OR FIREABLE(AreqCS)) AND ((FIREABLE(SgetTS_4) AND FIREABLE(Sperform_6) AND FIREABLE(malS2_0) AND FIREABLE(malS4_5)) OR (NOT FIREABLE(SreqTS_0) AND NOT FIREABLE(SreqTS_2))))))
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) OR (FIREABLE(CsendTS1_3) AND FIREABLE(CgenCertif_0)) OR FIREABLE(AreqCS)) AND ((FIREABLE(SgetTS_4) AND FIREABLE(Sperform_6) AND FIREABLE(malS2_0) AND FIREABLE(malS4_5)) OR (NOT FIREABLE(SreqTS_0) AND NOT FIREABLE(SreqTS_2))))))
lola: processed formula length: 256
lola: 1 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-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) OR (FIREABLE(CsendTS1_3) AND FIREABLE(CgenCertif_0)) OR FIREABLE(AreqCS)) AND ((FIREABLE(SgetTS_4) AND FIREABLE(Sperform_6) AND FIREABLE(malS2_0) AND FIREABLE(malS4_5)) OR (NOT FIREABLE(SreqTS_0) AND NOT FIREABLE(SreqTS_2))))
lola: state equation: Generated DNF with 86 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-06-ReachabilityFireability-8-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 10 markings, 9 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-06-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((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) AND (FIREABLE(SackCS_3) OR FIREABLE(SackCS_2) OR FIREABLE(SackCS_1) OR FIREABLE(SackCS_0) OR FIREABLE(SackCS_4) OR FIREABLE(SackCS_5) OR FIREABLE(SackCS_6) OR FIREABLE(malS3_4) OR FIREABLE(malS3_3) OR... (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 ((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) AND (FIREABLE(SackCS_3) OR FIREABLE(SackCS_2) OR FIREABLE(SackCS_1) OR FIREABLE(SackCS_0) OR FIREABLE(SackCS_4) OR FIREABLE(SackCS_5) OR FIREABLE(SackCS_6) OR FIREABLE(malS3_4) OR FIREABLE(malS3_3) OR... (shortened)
lola: processed formula length: 511
lola: 1 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-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(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) AND (FIREABLE(SackCS_3) OR FIREABLE(SackCS_2) OR FIREABLE(SackCS_1) OR FIREABLE(SackCS_0) OR FIREABLE(SackCS_4) OR FIREABLE(SackCS_5) OR FIREABLE(SackCS_6) OR FIREABLE(malS3_4) OR FIREABLE(malS3_3) OR FIREABLE(malS3_6) OR FIREABLE(malS3_5) OR FIREABLE(malS3_0) OR FIREABLE(malS3_1) OR FIREABLE(malS3_2)))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 18 markings, 17 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-06-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(AackCS) AND (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(malS5_0) OR FIREABLE(malS5_1) OR FIREABLE(malS5_2) OR FIREABLE(malS5_3) OR FIREABLE(malS5_4) OR FIREABLE(malS5_5) OR 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(AackCS) AND (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(malS5_0) OR FIREABLE(malS5_1) OR FIREABLE(malS5_2) OR FIREABLE(malS5_3) OR FIREABLE(malS5_4) OR FIREABLE(malS5_5) OR FIREABLE(malS5_6)))))
lola: processed formula length: 350
lola: 1 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-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) AND (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(malS5_0) OR FIREABLE(malS5_1) OR FIREABLE(malS5_2) OR FIREABLE(malS5_3) OR FIREABLE(malS5_4) OR FIREABLE(malS5_5) OR FIREABLE(malS5_6)))
lola: state equation: Generated DNF with 133 literals and 14 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-06-ReachabilityFireability-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-PT-06-ReachabilityFireability-10-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 16705 markings, 51297 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-06-ReachabilityFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 714 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(AgetTS) AND (FIREABLE(SreqTS_6) OR FIREABLE(SreqTS_2) OR FIREABLE(SreqTS_3) OR FIREABLE(SreqTS_4) OR FIREABLE(SreqTS_5) OR FIREABLE(SreqTS_0) OR FIREABLE(SreqTS_1)) AND (((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(AreqCS)) OR NOT FIREABLE(AendCS) OR FIRE... (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(AgetTS) AND (FIREABLE(SreqTS_6) OR FIREABLE(SreqTS_2) OR FIREABLE(SreqTS_3) OR FIREABLE(SreqTS_4) OR FIREABLE(SreqTS_5) OR FIREABLE(SreqTS_0) OR FIREABLE(SreqTS_1)) AND (((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(AreqCS)) OR NOT FIREABLE(AendCS) OR FIRE... (shortened)
lola: processed formula length: 416
lola: 1 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-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(AgetTS) AND (FIREABLE(SreqTS_6) OR FIREABLE(SreqTS_2) OR FIREABLE(SreqTS_3) OR FIREABLE(SreqTS_4) OR FIREABLE(SreqTS_5) OR FIREABLE(SreqTS_0) OR FIREABLE(SreqTS_1)) AND (((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(AreqCS)) OR NOT FIREABLE(AendCS) OR FIREABLE(AreqTS)))
lola: state equation: Generated DNF with 1218 literals and 112 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-06-ReachabilityFireability-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-PT-06-ReachabilityFireability-11-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 8321 markings, 25585 edges

FORMULA QuasiCertifProtocol-PT-06-ReachabilityFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((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 (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 NOT FIREABLE(SgetTS_4) AND NOT FIREABLE(SgetTS_3) AND N... (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 ((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 (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 NOT FIREABLE(SgetTS_4) AND NOT FIREABLE(SgetTS_3) AND N... (shortened)
lola: processed formula length: 532
lola: 1 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-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(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 (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 NOT FIREABLE(SgetTS_4) AND NOT FIREABLE(SgetTS_3) AND NOT FIREABLE(SgetTS_6) AND NOT FIREABLE(SgetTS_5) AND NOT FIREABLE(SgetTS_0) AND NOT FIREABLE(SgetTS_2) AND NOT FIREABLE(SgetTS_1))
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 10352 markings, 34318 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-06-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((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(AreqTS) OR FIREABLE(AackCS) OR FIREABLE(AreqTS) OR ((FIREABLE(SreqTS_6) OR FIREABLE(SreqTS_2) OR FIREABLE(SreqTS_3) OR FIREABLE(SreqTS_4) OR FIREABLE(SreqTS_5) OR FIREABLE(SreqTS_0) OR FIREABLE(SreqTS_1)) AND (FIRE... (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 ((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(AreqTS) OR FIREABLE(AackCS) OR FIREABLE(AreqTS) OR ((FIREABLE(SreqTS_6) OR FIREABLE(SreqTS_2) OR FIREABLE(SreqTS_3) OR FIREABLE(SreqTS_4) OR FIREABLE(SreqTS_5) OR FIREABLE(SreqTS_0) OR FIREABLE(SreqTS_1)) AND (FIRE... (shortened)
lola: processed formula length: 769
lola: 2 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-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(SgetTS_4) AND NOT FIREABLE(SgetTS_3) AND NOT FIREABLE(SgetTS_6) AND NOT FIREABLE(SgetTS_5) AND NOT FIREABLE(SgetTS_0) AND NOT FIREABLE(SgetTS_2) AND NOT FIREABLE(SgetTS_1) AND NOT FIREABLE(AreqTS) AND NOT FIREABLE(AackCS) AND NOT FIREABLE(AreqTS) AND ((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(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 (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)))
lola: state equation: Could not create input for sara: DNF too long or DEADLOCK predicate contained
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 322372 markings, 1082997 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-06-ReachabilityFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(CsendTS1_6) AND NOT FIREABLE(CsendTS1_5) AND NOT FIREABLE(CsendTS1_4) AND NOT FIREABLE(CsendTS1_3) AND NOT FIREABLE(CsendTS1_2) AND NOT FIREABLE(CsendTS1_0) AND NOT FIREABLE(CsendTS1_1)) 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(SsendT... (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(CsendTS1_6) AND NOT FIREABLE(CsendTS1_5) AND NOT FIREABLE(CsendTS1_4) AND NOT FIREABLE(CsendTS1_3) AND NOT FIREABLE(CsendTS1_2) AND NOT FIREABLE(CsendTS1_0) AND NOT FIREABLE(CsendTS1_1)) 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(SsendT... (shortened)
lola: processed formula length: 925
lola: 2 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-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(CsendTS1_6) OR FIREABLE(CsendTS1_5) OR FIREABLE(CsendTS1_4) OR FIREABLE(CsendTS1_3) OR FIREABLE(CsendTS1_2) OR FIREABLE(CsendTS1_0) OR FIREABLE(CsendTS1_1)) AND (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) 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) AND NOT FIREABLE(malA3)) OR (NOT FIREABLE(malC1_2) AND NOT FIREABLE(malC1_1) AND NOT FIREABLE(malC1_0) AND NOT FIREABLE(malC1_6) AND NOT FIREABLE(malC1_5) AND NOT FIREABLE(malC1_4) AND NOT FIREABLE(malC1_3) AND ((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)) OR NOT FIREABLE(malA4)))))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 34 markings, 33 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-06-ReachabilityFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((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 NOT FIREABLE(malA4) AND (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))) OR ((FIREABLE(Scer... (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 (((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 NOT FIREABLE(malA4) AND (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))) OR ((FIREABLE(Scer... (shortened)
lola: processed formula length: 907
lola: 1 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-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(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 NOT FIREABLE(malA4) AND (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))) OR ((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(AackCS) 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) OR FIREABLE(AgetTS)) AND (FIREABLE(malS3_4) OR FIREABLE(malS3_3) OR FIREABLE(malS3_6) OR FIREABLE(malS3_5) OR FIREABLE(malS3_0) OR FIREABLE(malS3_1) OR FIREABLE(malS3_2))))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 18 markings, 17 edges
lola: state equation: Generated DNF with 9443 literals and 1008 conjunctive subformulas
lola: ========================================

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

BK_TIME_CONFINEMENT_REACHED

--------------------
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="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-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 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-152673578700070"
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 ;