About the Execution of LoLA for S_QuasiCertifProtocol-PT-10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2392.640 | 429844.00 | 523209.00 | 943.10 | 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 S_QuasiCertifProtocol-PT-10, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r138-smll-149479231800261
=====================================================================
--------------------
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 1496383914828
Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_QuasiCertifProtocol-PT-10: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
S_QuasiCertifProtocol-PT-10: translating PT formula ReachabilityFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
ReachabilityFireability @ S_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: lola: ========================================state equation: calling and running sara
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: 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: could not read problem information -- aborting [#01]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: sara not yet started (preprocessing) || 552896 markings, 2363048 edges, 110579 markings/sec, 0 secs
lola: sara not yet started (preprocessing) || 1027309 markings, 4526970 edges, 94883 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) || 1453969 markings, 6578092 edges, 85332 markings/sec, 10 secs
lola: sara not yet started (preprocessing) || 1915276 markings, 8707333 edges, 92261 markings/sec, 15 secs
lola: sara not yet started (preprocessing) || 2359337 markings, 10779774 edges, 88812 markings/sec, 20 secs
lola: sara not yet started (preprocessing) || 2766607 markings, 12797079 edges, 81454 markings/sec, 25 secs
lola: sara not yet started (preprocessing) || 3146078 markings, 14850892 edges, 75894 markings/sec, 30 secs
lola: sara not yet started (preprocessing) || 3638607 markings, 17176725 edges, 98506 markings/sec, 35 secs
lola: sara not yet started (preprocessing) || 4106199 markings, 19347965 edges, 93518 markings/sec, 40 secs
lola: sara not yet started (preprocessing) || 4432652 markings, 21629406 edges, 65291 markings/sec, 45 secs
lola: sara not yet started (preprocessing) || 4903079 markings, 23638778 edges, 94085 markings/sec, 50 secs
lola: sara not yet started (preprocessing) || 5324342 markings, 25764591 edges, 84253 markings/sec, 55 secs
lola: sara not yet started (preprocessing) || 5634181 markings, 27939739 edges, 61968 markings/sec, 60 secs
lola: sara not yet started (preprocessing) || 5917596 markings, 30075851 edges, 56683 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) || 533466 markings, 2283711 edges, 106693 markings/sec, 0 secs
lola: sara not yet started (preprocessing) || 997584 markings, 4391739 edges, 92824 markings/sec, 5 secs
lola: sara not yet started (preprocessing) || 1419936 markings, 6401518 edges, 84470 markings/sec, 10 secs
lola: sara not yet started (preprocessing) || 1852442 markings, 8452175 edges, 86501 markings/sec, 15 secs
lola: sara not yet started (preprocessing) || 2299544 markings, 10490038 edges, 89420 markings/sec, 20 secs
lola: sara not yet started (preprocessing) || 2702365 markings, 12469912 edges, 80564 markings/sec, 25 secs
lola: sara not yet started (preprocessing) || 3044557 markings, 14371093 edges, 68438 markings/sec, 30 secs
lola: sara not yet started (preprocessing) || 3607318 markings, 16780329 edges, 112552 markings/sec, 35 secs
lola: sara not yet started (preprocessing) || 4097762 markings, 19026750 edges, 98089 markings/sec, 40 secs
lola: sara not yet started (preprocessing) || 4538956 markings, 21177632 edges, 88239 markings/sec, 45 secs
lola: sara not yet started (preprocessing) || 5028354 markings, 23378245 edges, 97880 markings/sec, 50 secs
lola: sara not yet started (preprocessing) || 5473640 markings, 25476405 edges, 89057 markings/sec, 55 secs
lola: sara not yet started (preprocessing) || 5871657 markings, 27486820 edges, 79603 markings/sec, 60 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) || 491460 markings, 2103096 edges, 98292 markings/sec, 0 secs
lola: sara not yet started (preprocessing) || 934315 markings, 4137413 edges, 88571 markings/sec, 5 secs
lola: sara not yet started (preprocessing) || 1359815 markings, 6110058 edges, 85100 markings/sec, 10 secs
lola: sara not yet started (preprocessing) || 1755072 markings, 7927851 edges, 79051 markings/sec, 15 secs
lola: sara not yet started (preprocessing) || 2165670 markings, 9756073 edges, 82120 markings/sec, 20 secs
lola: sara not yet started (preprocessing) || 2489365 markings, 12160119 edges, 64739 markings/sec, 25 secs
lola: sara not yet started (preprocessing) || 2763004 markings, 14469885 edges, 54728 markings/sec, 30 secs
lola: sara not yet started (preprocessing) || 2994173 markings, 16689626 edges, 46234 markings/sec, 35 secs
lola: sara not yet started (preprocessing) || 3415176 markings, 18885969 edges, 84201 markings/sec, 40 secs
lola: sara not yet started (preprocessing) || 3861236 markings, 20906164 edges, 89212 markings/sec, 45 secs
lola: sara not yet started (preprocessing) || 4292022 markings, 22857277 edges, 86157 markings/sec, 50 secs
lola: sara not yet started (preprocessing) || 4686927 markings, 24773974 edges, 78981 markings/sec, 55 secs
lola: sara not yet started (preprocessing) || 5116546 markings, 26726125 edges, 85924 markings/sec, 60 secs
lola: sara not yet started (preprocessing) || 5516434 markings, 28634242 edges, 79978 markings/sec, 65 secs
lola: sara not yet started (preprocessing) || 5878135 markings, 30460863 edges, 72340 markings/sec, 70 secs
lola: sara not yet started (preprocessing) || 6238725 markings, 32425435 edges, 72118 markings/sec, 75 secs
lola: sara not yet started (preprocessing) || 6651893 markings, 34652320 edges, 82634 markings/sec, 80 secs
lola: sara not yet started (preprocessing) || 7030687 markings, 36780585 edges, 75759 markings/sec, 85 secs
lola: sara not yet started (preprocessing) || 7395951 markings, 38831263 edges, 73053 markings/sec, 90 secs
lola: sara not yet started (preprocessing) || 7742389 markings, 40847814 edges, 69288 markings/sec, 95 secs
lola: sara not yet started (preprocessing) || 8108093 markings, 42865314 edges, 73141 markings/sec, 100 secs
lola: sara not yet started (preprocessing) || 8449087 markings, 44825502 edges, 68199 markings/sec, 105 secs
lola: sara not yet started (preprocessing) || 8772439 markings, 46734778 edges, 64670 markings/sec, 110 secs
lola: sara not yet started (preprocessing) || 9059337 markings, 48562430 edges, 57380 markings/sec, 115 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) || 563893 markings, 2411132 edges, 112779 markings/sec, 0 secs
lola: sara not yet started (preprocessing) || 1068392 markings, 4723421 edges, 100900 markings/sec, 5 secs
lola: sara not yet started (preprocessing) || 1509177 markings, 6894505 edges, 88157 markings/sec, 10 secs
lola: sara not yet started (preprocessing) || 2019100 markings, 9163425 edges, 101985 markings/sec, 15 secs
lola: sara not yet started (preprocessing) || 2466802 markings, 11294736 edges, 89540 markings/sec, 20 secs
lola: sara not yet started (preprocessing) || 2871509 markings, 13355995 edges, 80941 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 648 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 810 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 1081 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) || 401089 markings, 2335481 edges, 80218 markings/sec, 0 secs
lola: sara not yet started (preprocessing) || 764867 markings, 4672782 edges, 72756 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) || 1092348 markings, 7007181 edges, 65496 markings/sec, 10 secs
lola: sara not yet started (preprocessing) || 1398892 markings, 9295578 edges, 61309 markings/sec, 15 secs
lola: sara not yet started (preprocessing) || 1825364 markings, 11643460 edges, 85294 markings/sec, 20 secs
lola: sara not yet started (preprocessing) || 2139133 markings, 14033044 edges, 62754 markings/sec, 25 secs
lola: sara not yet started (preprocessing) || 2529191 markings, 16405322 edges, 78012 markings/sec, 30 secs
lola: sara not yet started (preprocessing) || 2866090 markings, 18719004 edges, 67380 markings/sec, 35 secs
lola: sara not yet started (preprocessing) || 3181450 markings, 20971736 edges, 63072 markings/sec, 40 secs
lola: sara not yet started (preprocessing) || 3501005 markings, 23271107 edges, 63911 markings/sec, 45 secs
lola: sara not yet started (preprocessing) || 3803512 markings, 25548569 edges, 60501 markings/sec, 50 secs
lola: sara not yet started (preprocessing) || 4080319 markings, 27796260 edges, 55361 markings/sec, 55 secs
lola: sara not yet started (preprocessing) || 4334946 markings, 30024863 edges, 50925 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 1588 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 || 541933 markings, 2308393 edges, 108387 markings/sec, 0 secs
lola: sara is running 5 secs || 1026766 markings, 4512362 edges, 96967 markings/sec, 5 secs
lola: sara is running 10 secs || 1459659 markings, 6596294 edges, 86579 markings/sec, 10 secs
lola: sara is running 15 secs || 1931870 markings, 8764333 edges, 94442 markings/sec, 15 secs
lola: sara is running 20 secs || 2382324 markings, 10872131 edges, 90091 markings/sec, 20 secs
lola: sara is running 25 secs || 2790582 markings, 12918079 edges, 81652 markings/sec, 25 secs
lola: sara is running 30 secs || 3209960 markings, 15026062 edges, 83876 markings/sec, 30 secs
lola: sara is running 35 secs || 3735027 markings, 17365503 edges, 105013 markings/sec, 35 secs
lola: sara is running 40 secs || 4225470 markings, 19599752 edges, 98089 markings/sec, 40 secs
lola: sara is running 45 secs || 4665727 markings, 21740226 edges, 88051 markings/sec, 45 secs
lola: sara is running 50 secs || 5138298 markings, 23888390 edges, 94514 markings/sec, 50 secs
lola: sara is running 55 secs || 5576231 markings, 25971565 edges, 87587 markings/sec, 55 secs
lola: sara is running 60 secs || 5961556 markings, 27963342 edges, 77065 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 3110 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 1496384344672
--------------------
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="S_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/S_QuasiCertifProtocol-PT-10.tgz
mv S_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 S_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 r138-smll-149479231800261"
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 '
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 ;