fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r058-smll-149440926300261
Last Updated
June 27, 2017

About the Execution of LoLA for QuasiCertifProtocol-PT-10

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2390.240 435063.00 531130.00 900.60 FTTFTTTTTFFTFTTT 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)
...................
=====================================================================
Generated by BenchKit 2-3254
Executing tool lola
Input is QuasiCertifProtocol-PT-10, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r058-smll-149440926300261
=====================================================================

--------------------
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-COL-10-ReachabilityFireability-0
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityFireability-1
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityFireability-10
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityFireability-11
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityFireability-12
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityFireability-13
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityFireability-14
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityFireability-15
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityFireability-2
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityFireability-3
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityFireability-4
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityFireability-5
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityFireability-6
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityFireability-7
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityFireability-8
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityFireability-9

=== Now, execution of the tool begins

BK_START 1494771726516


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
ReachabilityFireability @ QuasiCertifProtocol-PT-10 @ 3540 seconds
----- Start make result stdout -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 726/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 550 places, 176 transitions, 175 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 231 transition conflict sets
lola: TASK
lola: reading formula from QuasiCertifProtocol-COL-10-ReachabilityFireability.task
lola: A (G ((NOT FIREABLE(SreqTS_10) AND NOT FIREABLE(SreqTS_8) AND NOT FIREABLE(SreqTS_9) AND NOT FIREABLE(SreqTS_6) AND NOT FIREABLE(SreqTS_7) AND NOT FIREABLE(SreqTS_4) AND NOT FIREABLE(SreqTS_5) AND NOT FIREABLE(SreqTS_2) AND NOT FIREABLE(SreqTS_3) AND NOT FIREABLE(SreqTS_0) AND NOT FIREABLE(SreqTS_1)))) : E (F ((FIREABLE(malS4_0) OR FIREABLE(malS4_1) OR FIREABLE(malS4_2) OR FIREABLE(malS4_3) OR FIREABLE(malS4_4) OR FIREABLE(malS4_5) OR FIREABLE(malS4_7) OR FIREABLE(malS4_6) OR FIREABLE(malS4_9) OR FIREABLE(malS4_8) OR FIREABLE(malS4_10)))) : A (G ((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_7) OR FIREABLE(malS4_6) OR FIREABLE(malS4_9) OR FIREABLE(malS4_8) OR FIREABLE(malS4_10) OR 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_7) OR FIREABLE(malS4_6) OR FIREABLE(malS4_9) OR FIREABLE(malS4_8) OR FIREABLE(malS4_10) OR NOT FIREABLE(AackCS) OR (NOT FIREABLE(SackCS_10) AND NOT FIREABLE(SackCS_9) AND NOT FIREABLE(SackCS_8) AND NOT FIREABLE(SackCS_7) AND NOT FIREABLE(SackCS_6) AND NOT FIREABLE(SackCS_5) AND NOT FIREABLE(SackCS_4) AND NOT FIREABLE(SackCS_0) AND NOT FIREABLE(SackCS_1) AND NOT FIREABLE(SackCS_2) AND NOT FIREABLE(SackCS_3) AND NOT FIREABLE(AendCS))))) : E (F ((NOT FIREABLE(CsendTS1_7) AND NOT FIREABLE(CsendTS1_6) AND NOT FIREABLE(CsendTS1_9) AND NOT FIREABLE(CsendTS1_8) AND NOT FIREABLE(CsendTS1_3) AND NOT FIREABLE(CsendTS1_2) AND NOT FIREABLE(CsendTS1_5) AND NOT FIREABLE(CsendTS1_4) AND NOT FIREABLE(CsendTS1_1) AND NOT FIREABLE(CsendTS1_0) AND NOT FIREABLE(CsendTS1_10) AND NOT FIREABLE(malA4) AND (FIREABLE(AackCS) OR (FIREABLE(malA3) AND (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) OR FIREABLE(malS5_7) OR FIREABLE(malS5_8) OR FIREABLE(malS5_9) OR FIREABLE(malS5_10)))) AND (FIREABLE(malC1_5) OR FIREABLE(malC1_6) OR FIREABLE(malC1_3) OR FIREABLE(malC1_4) OR FIREABLE(malC1_1) OR FIREABLE(malC1_2) OR FIREABLE(malC1_0) OR FIREABLE(malC1_10) OR FIREABLE(malC1_9) OR FIREABLE(malC1_8) OR FIREABLE(malC1_7))))) : E (F (((FIREABLE(Sperform_8) OR FIREABLE(Sperform_7) OR FIREABLE(Sperform_6) OR FIREABLE(Sperform_5) OR FIREABLE(Sperform_4) OR FIREABLE(Sperform_3) OR FIREABLE(Sperform_2) OR FIREABLE(Sperform_1) OR FIREABLE(Sperform_0) OR FIREABLE(Sperform_9) OR FIREABLE(Sperform_10)) AND FIREABLE(malA5) AND FIREABLE(malA4) AND NOT FIREABLE(malA3)))) : E (F (FIREABLE(AstartCS))) : A (G ((((NOT FIREABLE(malS1_0) AND NOT FIREABLE(malS1_3) AND NOT FIREABLE(malS1_4) AND NOT FIREABLE(malS1_1) AND NOT FIREABLE(malS1_2) AND NOT FIREABLE(malS1_8) AND NOT FIREABLE(malS1_7) AND NOT FIREABLE(malS1_6) AND NOT FIREABLE(malS1_5) AND NOT FIREABLE(malS1_10) AND NOT FIREABLE(malS1_9)) OR (NOT FIREABLE(malC1_5) AND NOT FIREABLE(malC1_6) AND NOT FIREABLE(malC1_3) AND NOT FIREABLE(malC1_4) AND NOT FIREABLE(malC1_1) AND NOT FIREABLE(malC1_2) AND NOT FIREABLE(malC1_0) AND NOT FIREABLE(malC1_10) AND NOT FIREABLE(malC1_9) AND NOT FIREABLE(malC1_8) AND NOT FIREABLE(malC1_7)) OR NOT FIREABLE(AgetTS)) AND NOT FIREABLE(AgetTS)))) : E (F (FIREABLE(AackCS))) : E (F ((FIREABLE(SgetTS_1) OR FIREABLE(SgetTS_2) OR FIREABLE(SgetTS_0) OR FIREABLE(SgetTS_4) OR FIREABLE(SgetTS_3) OR FIREABLE(SgetTS_6) OR FIREABLE(SgetTS_5) OR FIREABLE(SgetTS_8) OR FIREABLE(SgetTS_7) OR FIREABLE(SgetTS_10) OR FIREABLE(SgetTS_9)))) : A (G (((NOT FIREABLE(SgetTS_1) AND NOT FIREABLE(SgetTS_2) AND NOT FIREABLE(SgetTS_0) AND NOT FIREABLE(SgetTS_4) AND NOT FIREABLE(SgetTS_3) AND NOT FIREABLE(SgetTS_6) AND NOT FIREABLE(SgetTS_5) AND NOT FIREABLE(SgetTS_8) AND NOT FIREABLE(SgetTS_7) AND NOT FIREABLE(SgetTS_10) AND NOT FIREABLE(SgetTS_9)) OR (NOT FIREABLE(SackCS_10) AND NOT FIREABLE(SackCS_9) AND NOT FIREABLE(SackCS_8) AND NOT FIREABLE(SackCS_7) AND NOT FIREABLE(SackCS_6) AND NOT FIREABLE(SackCS_5) AND NOT FIREABLE(SackCS_4) AND NOT FIREABLE(SackCS_0) AND NOT FIREABLE(SackCS_1) AND NOT FIREABLE(SackCS_2) AND NOT FIREABLE(SackCS_3)) OR ((FIREABLE(malS3_0) OR FIREABLE(malS3_2) OR FIREABLE(malS3_1) OR FIREABLE(malS3_4) OR FIREABLE(malS3_3) OR FIREABLE(malS3_6) OR FIREABLE(malS3_5) OR FIREABLE(malS3_8) OR FIREABLE(malS3_7) OR FIREABLE(malS3_10) OR FIREABLE(malS3_9)) AND (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) OR FIREABLE(malS5_7) OR FIREABLE(malS5_8) OR FIREABLE(malS5_9) OR FIREABLE(malS5_10))) OR ((FIREABLE(CgenCertif_0) OR FIREABLE(CgenCertif_4) OR FIREABLE(CgenCertif_3) OR FIREABLE(CgenCertif_2) OR FIREABLE(CgenCertif_1) OR FIREABLE(CgenCertif_10) OR FIREABLE(CgenCertif_9) OR FIREABLE(CgenCertif_6) OR FIREABLE(CgenCertif_5) OR FIREABLE(CgenCertif_8) OR FIREABLE(CgenCertif_7)) AND (FIREABLE(malC1_5) OR FIREABLE(malC1_6) OR FIREABLE(malC1_3) OR FIREABLE(malC1_4) OR FIREABLE(malC1_1) OR FIREABLE(malC1_2) OR FIREABLE(malC1_0) OR FIREABLE(malC1_10) OR FIREABLE(malC1_9) OR FIREABLE(malC1_8) OR FIREABLE(malC1_7))) OR ((FIREABLE(malA2) OR FIREABLE(AgetTS)) AND (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) OR FIREABLE(malS5_7) OR FIREABLE(malS5_8) OR FIREABLE(malS5_9) OR FIREABLE(malS5_10))) OR FIREABLE(malA1)))) : A (G ((NOT FIREABLE(AstartCS) OR NOT FIREABLE(AgetTS) OR FIREABLE(AendCS) OR (FIREABLE(AgetTS) AND FIREABLE(AstartCS) AND (FIREABLE(malS6_3) OR FIREABLE(malS6_2) OR FIREABLE(malS6_1) OR FIREABLE(malS6_0) OR FIREABLE(malS6_10) OR FIREABLE(malS6_9) OR FIREABLE(malS6_8) OR FIREABLE(malS6_7) OR FIREABLE(malS6_6) OR FIREABLE(malS6_5) OR FIREABLE(malS6_4) OR FIREABLE(SgetTS_1) OR FIREABLE(SgetTS_2) OR FIREABLE(SgetTS_0) OR FIREABLE(SgetTS_4) OR FIREABLE(SgetTS_3) OR FIREABLE(SgetTS_6) OR FIREABLE(SgetTS_5) OR FIREABLE(SgetTS_8) OR FIREABLE(SgetTS_7) OR FIREABLE(SgetTS_10) OR FIREABLE(SgetTS_9))) OR NOT FIREABLE(malA3)))) : A (G ((((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_7) OR FIREABLE(malS4_6) OR FIREABLE(malS4_9) OR FIREABLE(malS4_8) OR FIREABLE(malS4_10)) AND FIREABLE(malA1) AND (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) OR FIREABLE(malS5_7) OR FIREABLE(malS5_8) OR FIREABLE(malS5_9) OR FIREABLE(malS5_10)) AND (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(CsendTS1_10))) OR (FIREABLE(AreqCS) AND FIREABLE(malA3) AND (FIREABLE(malS6_3) OR FIREABLE(malS6_2) OR FIREABLE(malS6_1) OR FIREABLE(malS6_0) OR FIREABLE(malS6_10) OR FIREABLE(malS6_9) OR FIREABLE(malS6_8) OR FIREABLE(malS6_7) OR FIREABLE(malS6_6) OR FIREABLE(malS6_5) OR FIREABLE(malS6_4) OR FIREABLE(SackCS_10) OR FIREABLE(SackCS_9) OR FIREABLE(SackCS_8) OR FIREABLE(SackCS_7) OR FIREABLE(SackCS_6) OR FIREABLE(SackCS_5) OR FIREABLE(SackCS_4) OR FIREABLE(SackCS_0) OR FIREABLE(SackCS_1) OR FIREABLE(SackCS_2) OR FIREABLE(SackCS_3))) OR 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_7) OR FIREABLE(malS4_6) OR FIREABLE(malS4_9) OR FIREABLE(malS4_8) OR FIREABLE(malS4_10) OR FIREABLE(malS6_3) OR FIREABLE(malS6_2) OR FIREABLE(malS6_1) OR FIREABLE(malS6_0) OR FIREABLE(malS6_10) OR FIREABLE(malS6_9) OR FIREABLE(malS6_8) OR FIREABLE(malS6_7) OR FIREABLE(malS6_6) OR FIREABLE(malS6_5) OR FIREABLE(malS6_4) OR (NOT FIREABLE(Sperform_8) AND NOT FIREABLE(Sperform_7) AND NOT FIREABLE(Sperform_6) AND NOT FIREABLE(Sperform_5) AND NOT FIREABLE(Sperform_4) AND NOT FIREABLE(Sperform_3) AND NOT FIREABLE(Sperform_2) AND NOT FIREABLE(Sperform_1) AND NOT FIREABLE(Sperform_0) AND NOT FIREABLE(Sperform_9) AND NOT FIREABLE(Sperform_10) AND NOT FIREABLE(SackCS_10) AND NOT FIREABLE(SackCS_9) AND NOT FIREABLE(SackCS_8) AND NOT FIREABLE(SackCS_7) AND NOT FIREABLE(SackCS_6) AND NOT FIREABLE(SackCS_5) AND NOT FIREABLE(SackCS_4) AND NOT FIREABLE(SackCS_0) AND NOT FIREABLE(SackCS_1) AND NOT FIREABLE(SackCS_2) AND NOT FIREABLE(SackCS_3))))) : A (G (((NOT FIREABLE(malC1_5) AND NOT FIREABLE(malC1_6) AND NOT FIREABLE(malC1_3) AND NOT FIREABLE(malC1_4) AND NOT FIREABLE(malC1_1) AND NOT FIREABLE(malC1_2) AND NOT FIREABLE(malC1_0) AND NOT FIREABLE(malC1_10) AND NOT FIREABLE(malC1_9) AND NOT FIREABLE(malC1_8) AND NOT FIREABLE(malC1_7)) OR NOT FIREABLE(malA2) OR (NOT FIREABLE(malS6_3) AND NOT FIREABLE(malS6_2) AND NOT FIREABLE(malS6_1) AND NOT FIREABLE(malS6_0) AND NOT FIREABLE(malS6_10) AND NOT FIREABLE(malS6_9) AND NOT FIREABLE(malS6_8) AND NOT FIREABLE(malS6_7) AND NOT FIREABLE(malS6_6) AND NOT FIREABLE(malS6_5) AND NOT FIREABLE(malS6_4)) OR NOT FIREABLE(AreqTS)))) : E (F ((NOT FIREABLE(malC1_5) AND NOT FIREABLE(malC1_6) AND NOT FIREABLE(malC1_3) AND NOT FIREABLE(malC1_4) AND NOT FIREABLE(malC1_1) AND NOT FIREABLE(malC1_2) AND NOT FIREABLE(malC1_0) AND NOT FIREABLE(malC1_10) AND NOT FIREABLE(malC1_9) AND NOT FIREABLE(malC1_8) AND NOT FIREABLE(malC1_7) AND NOT FIREABLE(malS2_2) AND NOT FIREABLE(malS2_3) AND NOT FIREABLE(malS2_0) AND NOT FIREABLE(malS2_1) AND NOT FIREABLE(malS2_6) AND NOT FIREABLE(malS2_7) AND NOT FIREABLE(malS2_4) AND NOT FIREABLE(malS2_5) AND NOT FIREABLE(malS2_10) AND NOT FIREABLE(malS2_8) AND NOT FIREABLE(malS2_9) AND (FIREABLE(malC1_5) OR FIREABLE(malC1_6) OR FIREABLE(malC1_3) OR FIREABLE(malC1_4) OR FIREABLE(malC1_1) OR FIREABLE(malC1_2) OR FIREABLE(malC1_0) OR FIREABLE(malC1_10) OR FIREABLE(malC1_9) OR FIREABLE(malC1_8) OR FIREABLE(malC1_7) OR FIREABLE(SreqTS_10) OR FIREABLE(SreqTS_8) OR FIREABLE(SreqTS_9) OR FIREABLE(SreqTS_6) OR FIREABLE(SreqTS_7) OR FIREABLE(SreqTS_4) OR FIREABLE(SreqTS_5) OR FIREABLE(SreqTS_2) OR FIREABLE(SreqTS_3) OR FIREABLE(SreqTS_0) OR FIREABLE(SreqTS_1))))) : A (G ((NOT FIREABLE(AstartCS) OR NOT FIREABLE(malA5) OR ((FIREABLE(malC1_5) OR FIREABLE(malC1_6) OR FIREABLE(malC1_3) OR FIREABLE(malC1_4) OR FIREABLE(malC1_1) OR FIREABLE(malC1_2) OR FIREABLE(malC1_0) OR FIREABLE(malC1_10) OR FIREABLE(malC1_9) OR FIREABLE(malC1_8) OR FIREABLE(malC1_7)) AND (FIREABLE(malS1_0) OR FIREABLE(malS1_3) OR FIREABLE(malS1_4) OR FIREABLE(malS1_1) OR FIREABLE(malS1_2) OR FIREABLE(malS1_8) OR FIREABLE(malS1_7) OR FIREABLE(malS1_6) OR FIREABLE(malS1_5) OR FIREABLE(malS1_10) OR FIREABLE(malS1_9)) AND FIREABLE(AreqCS)) OR ((FIREABLE(SreqTS_10) OR FIREABLE(SreqTS_8) OR FIREABLE(SreqTS_9) OR FIREABLE(SreqTS_6) OR FIREABLE(SreqTS_7) OR FIREABLE(SreqTS_4) OR FIREABLE(SreqTS_5) OR FIREABLE(SreqTS_2) OR FIREABLE(SreqTS_3) OR FIREABLE(SreqTS_0) OR FIREABLE(SreqTS_1)) AND FIREABLE(malA3))))) : E (F (((FIREABLE(SgetTS_1) OR FIREABLE(SgetTS_2) OR FIREABLE(SgetTS_0) OR FIREABLE(SgetTS_4) OR FIREABLE(SgetTS_3) OR FIREABLE(SgetTS_6) OR FIREABLE(SgetTS_5) OR FIREABLE(SgetTS_8) OR FIREABLE(SgetTS_7) OR FIREABLE(SgetTS_10) OR FIREABLE(SgetTS_9) OR FIREABLE(AackCS) OR FIREABLE(AgetTS) OR ((FIREABLE(CgenCertif_0) OR FIREABLE(CgenCertif_4) OR FIREABLE(CgenCertif_3) OR FIREABLE(CgenCertif_2) OR FIREABLE(CgenCertif_1) OR FIREABLE(CgenCertif_10) OR FIREABLE(CgenCertif_9) OR FIREABLE(CgenCertif_6) OR FIREABLE(CgenCertif_5) OR FIREABLE(CgenCertif_8) OR FIREABLE(CgenCertif_7)) AND FIREABLE(AreqCS))) AND (FIREABLE(malS2_2) OR FIREABLE(malS2_3) OR FIREABLE(malS2_0) OR FIREABLE(malS2_1) OR FIREABLE(malS2_6) OR FIREABLE(malS2_7) OR FIREABLE(malS2_4) OR FIREABLE(malS2_5) OR FIREABLE(malS2_10) OR FIREABLE(malS2_8) OR FIREABLE(malS2_9)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(SreqTS_10) AND NOT FIREABLE(SreqTS_8) AND NOT FIREABLE(SreqTS_9) AND NOT FIREABLE(SreqTS_6) AND NOT FIREABLE(SreqTS_7) AND NOT FIREABLE(SreqTS_4) AND NOT FIREABLE(SreqTS_5) AND NOT FIREABLE(SreqTS_2) AND NOT FIREABLE(SreqTS_3) AND NOT FIREABLE(SreqTS_0) AND NOT FIREABLE(SreqTS_1))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 11 literals and 11 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-10-ReachabilityFireability.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(malS4_0) OR FIREABLE(malS4_1) OR FIREABLE(malS4_2) OR FIREABLE(malS4_3) OR FIREABLE(malS4_4) OR FIREABLE(malS4_5) OR FIREABLE(malS4_7) OR FIREABLE(malS4_6) OR FIREABLE(malS4_9) OR FIREABLE(malS4_8) OR FIREABLE(malS4_10))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 22 literals and 11 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-10-ReachabilityFireability.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((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_7) OR FIREABLE(malS4_6) OR FIREABLE(malS4_9) OR FIREABLE(malS4_8) OR FIREABLE(malS4_10) OR 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_7) ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 bytes per marking, with 0 unused bits
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
sara: try reading problem file QuasiCertifProtocol-COL-10-ReachabilityFireability.sara.
sara: place or transition ordering is non-deterministic

lola: sara not yet started (preprocessing) || 517250 markings, 2205335 edges, 103450 markings/sec, 0 secs
lola: sara not yet started (preprocessing) || 986297 markings, 4341682 edges, 93809 markings/sec, 5 secs
lola: state equation: Could not create input for sara: DNF too long or DEADLOCK predicate contained
lola: sara not yet started (preprocessing) || 1430949 markings, 6460829 edges, 88930 markings/sec, 10 secs
lola: sara not yet started (preprocessing) || 1876112 markings, 8540254 edges, 89033 markings/sec, 15 secs
lola: sara not yet started (preprocessing) || 2313992 markings, 10572486 edges, 87576 markings/sec, 20 secs
lola: sara not yet started (preprocessing) || 2719157 markings, 12561791 edges, 81033 markings/sec, 25 secs
lola: sara not yet started (preprocessing) || 3085733 markings, 14528584 edges, 73315 markings/sec, 30 secs
lola: sara not yet started (preprocessing) || 3611121 markings, 17002973 edges, 105078 markings/sec, 35 secs
lola: sara not yet started (preprocessing) || 4096224 markings, 19294839 edges, 97021 markings/sec, 40 secs
lola: sara not yet started (preprocessing) || 4444923 markings, 21706264 edges, 69740 markings/sec, 45 secs
lola: sara not yet started (preprocessing) || 4962634 markings, 23806411 edges, 103542 markings/sec, 50 secs
lola: sara not yet started (preprocessing) || 5381467 markings, 26091418 edges, 83767 markings/sec, 55 secs
lola: sara not yet started (preprocessing) || 5701541 markings, 28377727 edges, 64015 markings/sec, 60 secs
lola: sara not yet started (preprocessing) || 5979052 markings, 30592003 edges, 55502 markings/sec, 65 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 3 will run for 266 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(CsendTS1_7) AND NOT FIREABLE(CsendTS1_6) AND NOT FIREABLE(CsendTS1_9) AND NOT FIREABLE(CsendTS1_8) AND NOT FIREABLE(CsendTS1_3) AND NOT FIREABLE(CsendTS1_2) AND NOT FIREABLE(CsendTS1_5) AND NOT FIREABLE(CsendTS1_4) AND NOT FIREABLE(CsendTS1_1) AND NOT FIREABLE(CsendTS1_0) AND NOT FIREABLE(CsendTS1_10) AND NOT FIREABLE(malA4) AND (FIREABLE(AackCS) OR (FIREABLE(malA3) AND (FIREA... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 bytes per marking, with 0 unused bits
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: state equation: Could not create input for sara: DNF too long or DEADLOCK predicate contained
lola: sara not yet started (preprocessing) || 507202 markings, 2160687 edges, 101440 markings/sec, 0 secs
lola: sara not yet started (preprocessing) || 950859 markings, 4195779 edges, 88731 markings/sec, 5 secs
lola: sara not yet started (preprocessing) || 1369560 markings, 6145087 edges, 83740 markings/sec, 10 secs
lola: sara not yet started (preprocessing) || 1787972 markings, 8113548 edges, 83682 markings/sec, 15 secs
lola: sara not yet started (preprocessing) || 2218011 markings, 10096500 edges, 86008 markings/sec, 20 secs
lola: sara not yet started (preprocessing) || 2611467 markings, 12021928 edges, 78691 markings/sec, 25 secs
lola: sara not yet started (preprocessing) || 2967453 markings, 13889771 edges, 71197 markings/sec, 30 secs
lola: sara not yet started (preprocessing) || 3454176 markings, 16122101 edges, 97345 markings/sec, 35 secs
lola: sara not yet started (preprocessing) || 3946412 markings, 18344366 edges, 98447 markings/sec, 40 secs
lola: sara not yet started (preprocessing) || 4404614 markings, 20473062 edges, 91640 markings/sec, 45 secs
lola: sara not yet started (preprocessing) || 4852137 markings, 22583347 edges, 89505 markings/sec, 50 secs
lola: sara not yet started (preprocessing) || 5303047 markings, 24656812 edges, 90182 markings/sec, 55 secs
lola: sara not yet started (preprocessing) || 5712167 markings, 26660033 edges, 81824 markings/sec, 60 secs
lola: sara not yet started (preprocessing) || 6064514 markings, 28574029 edges, 70469 markings/sec, 65 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 4 will run for 283 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(Sperform_8) OR FIREABLE(Sperform_7) OR FIREABLE(Sperform_6) OR FIREABLE(Sperform_5) OR FIREABLE(Sperform_4) OR FIREABLE(Sperform_3) OR FIREABLE(Sperform_2) OR FIREABLE(Sperform_1) OR FIREABLE(Sperform_0) OR FIREABLE(Sperform_9) OR FIREABLE(Sperform_10)) AND FIREABLE(malA5) AND FIREABLE(malA4) AND NOT FIREABLE(malA3))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 55 literals and 11 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-10-ReachabilityFireability-4.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-COL-10-ReachabilityFireability-4.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: ========================================
lola: subprocess 5 will run for 308 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(AstartCS)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 bytes per marking, with 0 unused bits
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: 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: state equation: write sara problem file to QuasiCertifProtocol-COL-10-ReachabilityFireability-5.sara
lola: ========================================
lola: subprocess 6 will run for 339 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((NOT FIREABLE(malS1_0) AND NOT FIREABLE(malS1_3) AND NOT FIREABLE(malS1_4) AND NOT FIREABLE(malS1_1) AND NOT FIREABLE(malS1_2) AND NOT FIREABLE(malS1_8) AND NOT FIREABLE(malS1_7) AND NOT FIREABLE(malS1_6) AND NOT FIREABLE(malS1_5) AND NOT FIREABLE(malS1_10) AND NOT FIREABLE(malS1_9)) OR (NOT FIREABLE(malC1_5) AND NOT FIREABLE(malC1_6) AND NOT FIREABLE(malC1_3) AND NOT FIREABLE(malC1_4) AN... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: subprocess 7 will run for 377 seconds at most (--localtimelimit=-1)
lola: ========================================
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: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 12 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-10-ReachabilityFireability-7.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 8 will run for 424 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(SgetTS_1) OR FIREABLE(SgetTS_2) OR FIREABLE(SgetTS_0) OR FIREABLE(SgetTS_4) OR FIREABLE(SgetTS_3) OR FIREABLE(SgetTS_6) OR FIREABLE(SgetTS_5) OR FIREABLE(SgetTS_8) OR FIREABLE(SgetTS_7) OR FIREABLE(SgetTS_10) OR FIREABLE(SgetTS_9))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 132 literals and 11 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-10-ReachabilityFireability-8.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 9 will run for 485 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(SgetTS_1) AND NOT FIREABLE(SgetTS_2) AND NOT FIREABLE(SgetTS_0) AND NOT FIREABLE(SgetTS_4) AND NOT FIREABLE(SgetTS_3) AND NOT FIREABLE(SgetTS_6) AND NOT FIREABLE(SgetTS_5) AND NOT FIREABLE(SgetTS_8) AND NOT FIREABLE(SgetTS_7) AND NOT FIREABLE(SgetTS_10) AND NOT FIREABLE(SgetTS_9)) OR (NOT FIREABLE(SackCS_10) AND NOT FIREABLE(SackCS_9) AND NOT FIREABLE(SackCS_8) AND NOT FIREAB... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 bytes per marking, with 0 unused bits
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: state equation: Could not create input for sara: DNF too long or DEADLOCK predicate contained
lola: sara not yet started (preprocessing) || 485964 markings, 2081973 edges, 97193 markings/sec, 0 secs
lola: sara not yet started (preprocessing) || 918879 markings, 4070087 edges, 86583 markings/sec, 5 secs
lola: sara not yet started (preprocessing) || 1340438 markings, 6008358 edges, 84312 markings/sec, 10 secs
lola: sara not yet started (preprocessing) || 1722122 markings, 7796396 edges, 76337 markings/sec, 15 secs
lola: sara not yet started (preprocessing) || 2117239 markings, 9506558 edges, 79023 markings/sec, 20 secs
lola: sara not yet started (preprocessing) || 2427902 markings, 11681340 edges, 62133 markings/sec, 25 secs
lola: sara not yet started (preprocessing) || 2693686 markings, 13859383 edges, 53157 markings/sec, 30 secs
lola: sara not yet started (preprocessing) || 2924710 markings, 15974474 edges, 46205 markings/sec, 35 secs
lola: sara not yet started (preprocessing) || 3231489 markings, 18073700 edges, 61356 markings/sec, 40 secs
lola: sara not yet started (preprocessing) || 3674387 markings, 20020142 edges, 88580 markings/sec, 45 secs
lola: sara not yet started (preprocessing) || 4080448 markings, 21874472 edges, 81212 markings/sec, 50 secs
lola: sara not yet started (preprocessing) || 4455594 markings, 23664338 edges, 75029 markings/sec, 55 secs
lola: sara not yet started (preprocessing) || 4848140 markings, 25497502 edges, 78509 markings/sec, 60 secs
lola: sara not yet started (preprocessing) || 5245141 markings, 27319744 edges, 79400 markings/sec, 65 secs
lola: sara not yet started (preprocessing) || 5615312 markings, 29107568 edges, 74034 markings/sec, 70 secs
lola: sara not yet started (preprocessing) || 5951333 markings, 30859466 edges, 67204 markings/sec, 75 secs
lola: sara not yet started (preprocessing) || 6323924 markings, 32883750 edges, 74518 markings/sec, 80 secs
lola: sara not yet started (preprocessing) || 6718914 markings, 35028344 edges, 78998 markings/sec, 85 secs
lola: sara not yet started (preprocessing) || 7090886 markings, 37095006 edges, 74394 markings/sec, 90 secs
lola: sara not yet started (preprocessing) || 7437844 markings, 39073578 edges, 69392 markings/sec, 95 secs
lola: sara not yet started (preprocessing) || 7781972 markings, 41058807 edges, 68826 markings/sec, 100 secs
lola: sara not yet started (preprocessing) || 8137841 markings, 43037646 edges, 71174 markings/sec, 105 secs
lola: sara not yet started (preprocessing) || 8480543 markings, 44998998 edges, 68540 markings/sec, 110 secs
lola: sara not yet started (preprocessing) || 8799631 markings, 46918446 edges, 63818 markings/sec, 115 secs
lola: sara not yet started (preprocessing) || 9087546 markings, 48757719 edges, 57583 markings/sec, 120 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 10 will run for 545 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(AstartCS) OR NOT FIREABLE(AgetTS) OR FIREABLE(AendCS) OR (FIREABLE(AgetTS) AND FIREABLE(AstartCS) AND (FIREABLE(malS6_3) OR FIREABLE(malS6_2) OR FIREABLE(malS6_1) OR FIREABLE(malS6_0) OR FIREABLE(malS6_10) OR FIREABLE(malS6_9) OR FIREABLE(malS6_8) OR FIREABLE(malS6_7) OR FIREABLE(malS6_6) OR FIREABLE(malS6_5) OR FIREABLE(malS6_4) OR FIREABLE(SgetTS_1) OR FIREABLE... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 bytes per marking, with 0 unused bits
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: state equation: Could not create input for sara: DNF too long or DEADLOCK predicate contained
lola: sara not yet started (preprocessing) || 588085 markings, 2524786 edges, 117617 markings/sec, 0 secs
lola: sara not yet started (preprocessing) || 1103674 markings, 4873081 edges, 103118 markings/sec, 5 secs
lola: sara not yet started (preprocessing) || 1550881 markings, 7087430 edges, 89441 markings/sec, 10 secs
lola: sara not yet started (preprocessing) || 2064346 markings, 9379777 edges, 102693 markings/sec, 15 secs
lola: sara not yet started (preprocessing) || 2523550 markings, 11572395 edges, 91841 markings/sec, 20 secs
lola: sara not yet started (preprocessing) || 2925939 markings, 13657005 edges, 80478 markings/sec, 25 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 11 will run for 647 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((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_7) OR FIREABLE(malS4_6) OR FIREABLE(malS4_9) OR FIREABLE(malS4_8) OR FIREABLE(malS4_10)) AND FIREABLE(malA1) AND (FIREABLE(malS5_0) OR FIREABLE(malS5_1) OR FIREABLE(malS5_2) OR FIREABLE(malS5_3) OR FIREABLE(malS5_4) OR FIREABLE(malS5_5... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 12 will run for 809 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(malC1_5) AND NOT FIREABLE(malC1_6) AND NOT FIREABLE(malC1_3) AND NOT FIREABLE(malC1_4) AND NOT FIREABLE(malC1_1) AND NOT FIREABLE(malC1_2) AND NOT FIREABLE(malC1_0) AND NOT FIREABLE(malC1_10) AND NOT FIREABLE(malC1_9) AND NOT FIREABLE(malC1_8) AND NOT FIREABLE(malC1_7)) OR NOT FIREABLE(malA2) OR (NOT FIREABLE(malS6_3) AND NOT FIREABLE(malS6_2) AND NOT FIREABLE(malS6_1) AND N... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 bytes per marking, with 0 unused bits
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 invariant.
lola: ========================================
lola: subprocess 13 will run for 1079 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(malC1_5) AND NOT FIREABLE(malC1_6) AND NOT FIREABLE(malC1_3) AND NOT FIREABLE(malC1_4) AND NOT FIREABLE(malC1_1) AND NOT FIREABLE(malC1_2) AND NOT FIREABLE(malC1_0) AND NOT FIREABLE(malC1_10) AND NOT FIREABLE(malC1_9) AND NOT FIREABLE(malC1_8) AND NOT FIREABLE(malC1_7) AND NOT FIREABLE(malS2_2) AND NOT FIREABLE(malS2_3) AND NOT FIREABLE(malS2_0) AND NOT FIREABLE(malS2_1) AND NO... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 bytes per marking, with 0 unused bits
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: sara not yet started (preprocessing) || 425031 markings, 2484452 edges, 85006 markings/sec, 0 secs
lola: sara not yet started (preprocessing) || 787493 markings, 4870139 edges, 72492 markings/sec, 5 secs
lola: state equation: Could not create input for sara: DNF too long or DEADLOCK predicate contained
lola: sara not yet started (preprocessing) || 1125152 markings, 7215929 edges, 67532 markings/sec, 10 secs
lola: sara not yet started (preprocessing) || 1444364 markings, 9504149 edges, 63842 markings/sec, 15 secs
lola: sara not yet started (preprocessing) || 1861638 markings, 11879496 edges, 83455 markings/sec, 20 secs
lola: sara not yet started (preprocessing) || 2172870 markings, 14199332 edges, 62246 markings/sec, 25 secs
lola: sara not yet started (preprocessing) || 2546397 markings, 16515180 edges, 74705 markings/sec, 30 secs
lola: sara not yet started (preprocessing) || 2872180 markings, 18768901 edges, 65157 markings/sec, 35 secs
lola: sara not yet started (preprocessing) || 3185349 markings, 20994218 edges, 62634 markings/sec, 40 secs
lola: sara not yet started (preprocessing) || 3494670 markings, 23230886 edges, 61864 markings/sec, 45 secs
lola: sara not yet started (preprocessing) || 3791220 markings, 25448319 edges, 59310 markings/sec, 50 secs
lola: sara not yet started (preprocessing) || 4058034 markings, 27631240 edges, 53363 markings/sec, 55 secs
lola: sara not yet started (preprocessing) || 4309224 markings, 29801145 edges, 50238 markings/sec, 60 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 1586 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(AstartCS) OR NOT FIREABLE(malA5) OR ((FIREABLE(malC1_5) OR FIREABLE(malC1_6) OR FIREABLE(malC1_3) OR FIREABLE(malC1_4) OR FIREABLE(malC1_1) OR FIREABLE(malC1_2) OR FIREABLE(malC1_0) OR FIREABLE(malC1_10) OR FIREABLE(malC1_9) OR FIREABLE(malC1_8) OR FIREABLE(malC1_7)) AND (FIREABLE(malS1_0) OR FIREABLE(malS1_3) OR FIREABLE(malS1_4) OR FIREABLE(malS1_1) OR FIREABL... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 155666 literals and 8194 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-10-ReachabilityFireability-14.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-COL-10-ReachabilityFireability-14.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 562077 markings, 2393046 edges, 112415 markings/sec, 0 secs
lola: sara is running 5 secs || 1038219 markings, 4565370 edges, 95228 markings/sec, 5 secs
lola: sara is running 10 secs || 1465457 markings, 6630026 edges, 85448 markings/sec, 10 secs
lola: sara is running 15 secs || 1938299 markings, 8792355 edges, 94568 markings/sec, 15 secs
lola: sara is running 20 secs || 2385302 markings, 10887704 edges, 89401 markings/sec, 20 secs
lola: sara is running 25 secs || 2791031 markings, 12920857 edges, 81146 markings/sec, 25 secs
lola: sara is running 30 secs || 3208931 markings, 15022344 edges, 83580 markings/sec, 30 secs
lola: sara is running 35 secs || 3730783 markings, 17346433 edges, 104370 markings/sec, 35 secs
lola: sara is running 40 secs || 4213448 markings, 19550838 edges, 96533 markings/sec, 40 secs
lola: sara is running 45 secs || 4646810 markings, 21667779 edges, 86672 markings/sec, 45 secs
lola: sara is running 50 secs || 5122436 markings, 23806604 edges, 95125 markings/sec, 50 secs
lola: sara is running 55 secs || 5553934 markings, 25868613 edges, 86300 markings/sec, 55 secs
lola: sara is running 60 secs || 5942169 markings, 27857493 edges, 77647 markings/sec, 60 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 15 will run for 3105 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(SgetTS_1) OR FIREABLE(SgetTS_2) OR FIREABLE(SgetTS_0) OR FIREABLE(SgetTS_4) OR FIREABLE(SgetTS_3) OR FIREABLE(SgetTS_6) OR FIREABLE(SgetTS_5) OR FIREABLE(SgetTS_8) OR FIREABLE(SgetTS_7) OR FIREABLE(SgetTS_10) OR FIREABLE(SgetTS_9) OR FIREABLE(AackCS) OR FIREABLE(AgetTS) OR ((FIREABLE(CgenCertif_0) OR FIREABLE(CgenCertif_4) OR FIREABLE(CgenCertif_3) OR FIREABLE(Cgen... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 bytes per marking, with 0 unused bits
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: ========================================
lola: RESULT
lola:
SUMMARY: no yes yes no no yes no yes yes yes yes no yes yes yes yes
FORMULA QuasiCertifProtocol-COL-10-ReachabilityFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494772161579

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

----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- Finished 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-10"
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-10.tgz
mv QuasiCertifProtocol-PT-10 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool lola"
echo " Input is QuasiCertifProtocol-PT-10, 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 r058-smll-149440926300261"
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 ;