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-02, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r138-smll-149479231800252
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496381946031


Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_QuasiCertifProtocol-PT-02: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
S_QuasiCertifProtocol-PT-02: translating PT formula ReachabilityFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
ReachabilityFireability @ S_QuasiCertifProtocol-PT-02 @ 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: 142/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 86 places, 56 transitions, 55 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 71 transition conflict sets
lola: TASK
lola: reading formula from QuasiCertifProtocol-COL-02-ReachabilityFireability.task
lola: E (F (((((FIREABLE(malS3_1) OR FIREABLE(malS3_2) OR FIREABLE(malS3_0)) AND FIREABLE(malA3) AND (FIREABLE(SackCS_2) OR FIREABLE(SackCS_1) OR FIREABLE(SackCS_0)) AND (FIREABLE(malS6_1) OR FIREABLE(malS6_0) OR FIREABLE(malS6_2))) OR (FIREABLE(malA4) AND (FIREABLE(malS6_1) OR FIREABLE(malS6_0) OR FIREABLE(malS6_2)) AND (FIREABLE(CgenCertif_2) OR FIREABLE(CgenCertif_1) OR FIREABLE(CgenCertif_0)))) AND (NOT FIREABLE(AreqCS) OR FIREABLE(malA1) OR ((FIREABLE(SgetTS_0) OR FIREABLE(SgetTS_2) OR FIREABLE(SgetTS_1) OR FIREABLE(malS4_2) OR FIREABLE(malS4_0) OR FIREABLE(malS4_1)) AND (FIREABLE(SackCS_2) OR FIREABLE(SackCS_1) OR FIREABLE(SackCS_0) OR FIREABLE(AstartCS))))))) : A (G (((NOT FIREABLE(malS1_1) AND NOT FIREABLE(malS1_2) AND NOT FIREABLE(malS1_0)) OR NOT FIREABLE(malA3) OR FIREABLE(AgetTS) OR (NOT FIREABLE(SackCS_2) AND NOT FIREABLE(SackCS_1) AND NOT FIREABLE(SackCS_0)) OR (NOT FIREABLE(malS4_2) AND NOT FIREABLE(malS4_0) AND NOT FIREABLE(malS4_1)) OR (NOT FIREABLE(ScertCS_1) AND NOT FIREABLE(ScertCS_0) AND NOT FIREABLE(ScertCS_2))))) : E (F ((NOT FIREABLE(AendCS) AND NOT FIREABLE(malA3) AND (FIREABLE(SackCS_2) OR FIREABLE(SackCS_1) OR FIREABLE(SackCS_0)) AND (FIREABLE(malS1_1) OR FIREABLE(malS1_2) OR FIREABLE(malS1_0))))) : A (G ((NOT FIREABLE(malA4) OR NOT FIREABLE(AgetTS) OR FIREABLE(malS5_0) OR FIREABLE(malS5_1) OR FIREABLE(malS5_2) OR FIREABLE(malS4_2) OR FIREABLE(malS4_0) OR FIREABLE(malS4_1) OR FIREABLE(SackCS_2) OR FIREABLE(SackCS_1) OR FIREABLE(SackCS_0) OR (NOT FIREABLE(CsendTS1_1) AND NOT FIREABLE(CsendTS1_0) AND NOT FIREABLE(CsendTS1_2))))) : E (F ((((FIREABLE(ScertCS_1) OR FIREABLE(ScertCS_0) OR FIREABLE(ScertCS_2)) AND (FIREABLE(malS6_1) OR FIREABLE(malS6_0) OR FIREABLE(malS6_2)) AND (FIREABLE(malS2_2) OR FIREABLE(malS2_0) OR FIREABLE(malS2_1) OR FIREABLE(AreqCS)) AND ((NOT FIREABLE(malC1_0) AND NOT FIREABLE(malC1_2) AND NOT FIREABLE(malC1_1)) OR (NOT FIREABLE(malC1_0) AND NOT FIREABLE(malC1_2) AND NOT FIREABLE(malC1_1)))) OR ((FIREABLE(ScertCS_1) OR FIREABLE(ScertCS_0) OR FIREABLE(ScertCS_2)) AND (FIREABLE(SsendTS_2) OR FIREABLE(SsendTS_1) OR FIREABLE(SsendTS_0)) AND FIREABLE(malA4) AND (FIREABLE(CgenCertif_2) OR FIREABLE(CgenCertif_1) OR FIREABLE(CgenCertif_0) OR FIREABLE(malS6_1) OR FIREABLE(malS6_0) OR FIREABLE(malS6_2) OR FIREABLE(AstartCS)))))) : E (F (((FIREABLE(AgetTS) AND (FIREABLE(SreqTS_1) OR FIREABLE(SreqTS_0) OR FIREABLE(SreqTS_2))) OR (FIREABLE(AackCS) AND (FIREABLE(SreqTS_1) OR FIREABLE(SreqTS_0) OR FIREABLE(SreqTS_2)) AND FIREABLE(malA2) AND FIREABLE(malA4) AND (FIREABLE(SgetTS_0) OR FIREABLE(SgetTS_2) OR FIREABLE(SgetTS_1)) AND (FIREABLE(AendCS) OR FIREABLE(AstartCS)))))) : E (F (((FIREABLE(malS2_2) OR FIREABLE(malS2_0) OR FIREABLE(malS2_1)) AND (FIREABLE(SgetTS_0) OR FIREABLE(SgetTS_2) OR FIREABLE(SgetTS_1)) AND (((FIREABLE(malS4_2) OR FIREABLE(malS4_0) OR FIREABLE(malS4_1)) AND (FIREABLE(CsendTS1_1) OR FIREABLE(CsendTS1_0) OR FIREABLE(CsendTS1_2)) AND (FIREABLE(CgenCertif_2) OR FIREABLE(CgenCertif_1) OR FIREABLE(CgenCertif_0))) OR (NOT FIREABLE(CsendTS1_1) AND NOT FIREABLE(CsendTS1_0) AND NOT FIREABLE(CsendTS1_2) AND (FIREABLE(SsendTS_2) OR FIREABLE(SsendTS_1) OR FIREABLE(SsendTS_0) OR FIREABLE(Sperform_2) OR FIREABLE(Sperform_1) OR FIREABLE(Sperform_0))))))) : E (F ((((FIREABLE(malA4) OR FIREABLE(malA3)) AND NOT FIREABLE(malA5) AND (FIREABLE(malC1_0) OR FIREABLE(malC1_2) OR FIREABLE(malC1_1))) OR ((FIREABLE(ScertCS_1) OR FIREABLE(ScertCS_0) OR FIREABLE(ScertCS_2)) AND FIREABLE(AstartCS) AND (FIREABLE(AendCS) OR FIREABLE(AstartCS)) AND (FIREABLE(SackCS_2) OR FIREABLE(SackCS_1) OR FIREABLE(SackCS_0) OR FIREABLE(malA3)))))) : A (G (((NOT FIREABLE(SreqTS_1) AND NOT FIREABLE(SreqTS_0) AND NOT FIREABLE(SreqTS_2)) OR NOT FIREABLE(AreqTS) OR (NOT FIREABLE(CgenCertif_2) AND NOT FIREABLE(CgenCertif_1) AND NOT FIREABLE(CgenCertif_0) AND NOT FIREABLE(CgenCertif_2) AND NOT FIREABLE(CgenCertif_1) AND NOT FIREABLE(CgenCertif_0))))) : E (F ((FIREABLE(malA2) AND (FIREABLE(malA4) OR (FIREABLE(AendCS) AND FIREABLE(malA2) AND (FIREABLE(CsendTS1_1) OR FIREABLE(CsendTS1_0) OR FIREABLE(CsendTS1_2))))))) : E (F ((NOT FIREABLE(malS3_1) AND NOT FIREABLE(malS3_2) AND NOT FIREABLE(malS3_0) AND (FIREABLE(Sperform_2) OR FIREABLE(Sperform_1) OR FIREABLE(Sperform_0) OR FIREABLE(AgetTS)) AND (FIREABLE(ScertCS_1) OR FIREABLE(ScertCS_0) OR FIREABLE(ScertCS_2)) AND (FIREABLE(ScertCS_1) OR FIREABLE(ScertCS_0) OR FIREABLE(ScertCS_2))))) : A (G (())) : A (G (((FIREABLE(malA4) OR ((FIREABLE(malS4_2) OR FIREABLE(malS4_0) OR FIREABLE(malS4_1)) AND (FIREABLE(SreqTS_1) OR FIREABLE(SreqTS_0) OR FIREABLE(SreqTS_2))) OR FIREABLE(AreqCS)) AND ((NOT FIREABLE(SsendTS_2) AND NOT FIREABLE(SsendTS_1) AND NOT FIREABLE(SsendTS_0)) OR (NOT FIREABLE(malS6_1) AND NOT FIREABLE(malS6_0) AND NOT FIREABLE(malS6_2)) OR FIREABLE(malA4))))) : E (F ((NOT FIREABLE(SsendTS_2) AND NOT FIREABLE(SsendTS_1) AND NOT FIREABLE(SsendTS_0) AND NOT FIREABLE(SsendTS_2) AND NOT FIREABLE(SsendTS_1) AND NOT FIREABLE(SsendTS_0) AND (FIREABLE(SsendTS_2) OR FIREABLE(SsendTS_1) OR FIREABLE(SsendTS_0))))) : A (G (((NOT FIREABLE(CsendTS1_1) AND NOT FIREABLE(CsendTS1_0) AND NOT FIREABLE(CsendTS1_2) AND NOT FIREABLE(Sperform_2) AND NOT FIREABLE(Sperform_1) AND NOT FIREABLE(Sperform_0)) OR NOT FIREABLE(malA3) OR NOT FIREABLE(AackCS)))) : E (F ((NOT FIREABLE(malA1) AND NOT FIREABLE(AreqCS) AND (FIREABLE(Sperform_2) OR FIREABLE(Sperform_1) OR FIREABLE(Sperform_0)) AND NOT FIREABLE(SackCS_2) AND NOT FIREABLE(SackCS_1) AND NOT FIREABLE(SackCS_0) AND NOT FIREABLE(malA4) AND (FIREABLE(SackCS_2) OR FIREABLE(SackCS_1) OR FIREABLE(SackCS_0)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((((FIREABLE(malS3_1) OR FIREABLE(malS3_2) OR FIREABLE(malS3_0)) AND FIREABLE(malA3) AND (FIREABLE(SackCS_2) OR FIREABLE(SackCS_1) OR FIREABLE(SackCS_0)) AND (FIREABLE(malS6_1) OR FIREABLE(malS6_0) OR FIREABLE(malS6_2))) OR (FIREABLE(malA4) AND (FIREABLE(malS6_1) OR FIREABLE(malS6_0) OR FIREABLE(malS6_2)) AND (FIREABLE(CgenCertif_2) OR FIREABLE(CgenCertif_1) OR FIREABLE(CgenCertif... (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 220 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 unreachable.
lola: lola: ========================================
subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(malS1_1) AND NOT FIREABLE(malS1_2) AND NOT FIREABLE(malS1_0)) OR NOT FIREABLE(malA3) OR FIREABLE(AgetTS) OR (NOT FIREABLE(SackCS_2) AND NOT FIREABLE(SackCS_1) AND NOT FIREABLE(SackCS_0)) OR (NOT FIREABLE(malS4_2) AND NOT FIREABLE(malS4_0) AND NOT FIREABLE(malS4_1)) OR (NOT FIREABLE(ScertCS_1) AND NOT FIREABLE(ScertCS_0) AND NOT FIREABLE(ScertCS_2)))))
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 220 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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(AendCS) AND NOT FIREABLE(malA3) AND (FIREABLE(SackCS_2) OR FIREABLE(SackCS_1) OR FIREABLE(SackCS_0)) AND (FIREABLE(malS1_1) OR FIREABLE(malS1_2) OR FIREABLE(malS1_0)))))
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 220 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 216 literals and 36 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(malA4) OR NOT FIREABLE(AgetTS) OR FIREABLE(malS5_0) OR FIREABLE(malS5_1) OR FIREABLE(malS5_2) OR FIREABLE(malS4_2) OR FIREABLE(malS4_0) OR FIREABLE(malS4_1) OR FIREABLE(SackCS_2) OR FIREABLE(SackCS_1) OR FIREABLE(SackCS_0) OR (NOT FIREABLE(CsendTS1_1) AND NOT FIREABLE(CsendTS1_0) AND NOT FIREABLE(CsendTS1_2)))))
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 220 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 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((FIREABLE(ScertCS_1) OR FIREABLE(ScertCS_0) OR FIREABLE(ScertCS_2)) AND (FIREABLE(malS6_1) OR FIREABLE(malS6_0) OR FIREABLE(malS6_2)) AND (FIREABLE(malS2_2) OR FIREABLE(malS2_0) OR FIREABLE(malS2_1) OR FIREABLE(AreqCS)) AND ((NOT FIREABLE(malC1_0) AND NOT FIREABLE(malC1_2) AND NOT FIREABLE(malC1_1)) OR (NOT FIREABLE(malC1_0) AND NOT FIREABLE(malC1_2) AND NOT FIREABLE(malC1_1)))) OR... (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 220 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 unreachable.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(AgetTS) AND (FIREABLE(SreqTS_1) OR FIREABLE(SreqTS_0) OR FIREABLE(SreqTS_2))) OR (FIREABLE(AackCS) AND (FIREABLE(SreqTS_1) OR FIREABLE(SreqTS_0) OR FIREABLE(SreqTS_2)) AND FIREABLE(malA2) AND FIREABLE(malA4) AND (FIREABLE(SgetTS_0) OR FIREABLE(SgetTS_2) OR FIREABLE(SgetTS_1)) AND (FIREABLE(AendCS) OR 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 220 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: state equation: Generated DNF with 258 literals and 21 conjunctive subformulas
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(malS2_2) OR FIREABLE(malS2_0) OR FIREABLE(malS2_1)) AND (FIREABLE(SgetTS_0) OR FIREABLE(SgetTS_2) OR FIREABLE(SgetTS_1)) AND (((FIREABLE(malS4_2) OR FIREABLE(malS4_0) OR FIREABLE(malS4_1)) AND (FIREABLE(CsendTS1_1) OR FIREABLE(CsendTS1_0) OR FIREABLE(CsendTS1_2)) AND (FIREABLE(CgenCertif_2) OR FIREABLE(CgenCertif_1) OR FIREABLE(CgenCertif_0))) OR (NOT FIREABLE(CsendTS1_... (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 220 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 unreachable.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((FIREABLE(malA4) OR FIREABLE(malA3)) AND NOT FIREABLE(malA5) AND (FIREABLE(malC1_0) OR FIREABLE(malC1_2) OR FIREABLE(malC1_1))) OR ((FIREABLE(ScertCS_1) OR FIREABLE(ScertCS_0) OR FIREABLE(ScertCS_2)) AND FIREABLE(AstartCS) AND (FIREABLE(AendCS) OR FIREABLE(AstartCS)) AND (FIREABLE(SackCS_2) OR FIREABLE(SackCS_1) OR FIREABLE(SackCS_0) OR 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 220 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 174 literals and 30 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-02-ReachabilityFireability-7.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(SreqTS_1) AND NOT FIREABLE(SreqTS_0) AND NOT FIREABLE(SreqTS_2)) OR NOT FIREABLE(AreqTS) OR (NOT FIREABLE(CgenCertif_2) AND NOT FIREABLE(CgenCertif_1) AND NOT FIREABLE(CgenCertif_0) AND NOT FIREABLE(CgenCertif_2) AND NOT FIREABLE(CgenCertif_1) AND NOT FIREABLE(CgenCertif_0)))))
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 220 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 54 literals and 9 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-02-ReachabilityFireability-8.sara
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(malA2) AND (FIREABLE(malA4) OR (FIREABLE(AendCS) AND FIREABLE(malA2) AND (FIREABLE(CsendTS1_1) OR FIREABLE(CsendTS1_0) OR FIREABLE(CsendTS1_2)))))))
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 220 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 32 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-02-ReachabilityFireability-9.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: lola: lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
state equation: calling and running sara========================================

lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(malS3_1) AND NOT FIREABLE(malS3_2) AND NOT FIREABLE(malS3_0) AND (FIREABLE(Sperform_2) OR FIREABLE(Sperform_1) OR FIREABLE(Sperform_0) OR FIREABLE(AgetTS)) AND (FIREABLE(ScertCS_1) OR FIREABLE(ScertCS_0) OR FIREABLE(ScertCS_2)) AND (FIREABLE(ScertCS_1) OR FIREABLE(ScertCS_0) OR FIREABLE(ScertCS_2)))))
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 220 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 unreachable.
lola: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (()))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 3 rewrites
lola: formula mentions 0 of 86 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-02-ReachabilityFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(malA4) OR ((FIREABLE(malS4_2) OR FIREABLE(malS4_0) OR FIREABLE(malS4_1)) AND (FIREABLE(SreqTS_1) OR FIREABLE(SreqTS_0) OR FIREABLE(SreqTS_2))) OR FIREABLE(AreqCS)) AND ((NOT FIREABLE(SsendTS_2) AND NOT FIREABLE(SsendTS_1) AND NOT FIREABLE(SsendTS_0)) OR (NOT FIREABLE(malS6_1) AND NOT FIREABLE(malS6_0) AND NOT FIREABLE(malS6_2)) OR FIREABLE(malA4)))))
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 220 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: state equation: Generated DNF with 90 literals and 18 conjunctive subformulas
lola: The predicate is not invariant.
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-02-ReachabilityFireability-12.sara
lola: ========================================
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(SsendTS_2) AND NOT FIREABLE(SsendTS_1) AND NOT FIREABLE(SsendTS_0) AND NOT FIREABLE(SsendTS_2) AND NOT FIREABLE(SsendTS_1) AND NOT FIREABLE(SsendTS_0) AND (FIREABLE(SsendTS_2) OR FIREABLE(SsendTS_1) OR FIREABLE(SsendTS_0)))))
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 220 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)
sara: lola: try reading problem file QuasiCertifProtocol-COL-02-ReachabilityFireability-9.sara.
RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(CsendTS1_1) AND NOT FIREABLE(CsendTS1_0) AND NOT FIREABLE(CsendTS1_2) AND NOT FIREABLE(Sperform_2) AND NOT FIREABLE(Sperform_1) AND NOT FIREABLE(Sperform_0)) OR NOT FIREABLE(malA3) OR NOT FIREABLE(AackCS))))
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 220 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 48 literals and 6 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(malA1) AND NOT FIREABLE(AreqCS) AND (FIREABLE(Sperform_2) OR FIREABLE(Sperform_1) OR FIREABLE(Sperform_0)) AND NOT FIREABLE(SackCS_2) AND NOT FIREABLE(SackCS_1) AND NOT FIREABLE(SackCS_0) AND NOT FIREABLE(malA4) AND (FIREABLE(SackCS_2) OR FIREABLE(SackCS_1) OR FIREABLE(SackCS_0)))))
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 220 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: state equation: State predicate is contradiction.
lola: The predicate is unreachable.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no yes no no no no yes no no yes no no yes no
sara: place or transition ordering is non-deterministic
FORMULA QuasiCertifProtocol-COL-02-ReachabilityFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-02-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-02-ReachabilityFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-02-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-02-ReachabilityFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-02-ReachabilityFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-02-ReachabilityFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-02-ReachabilityFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-02-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-02-ReachabilityFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-02-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-02-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-02-ReachabilityFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-02-ReachabilityFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-02-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-02-ReachabilityFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496381946325

--------------------
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-02"
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-02.tgz
mv S_QuasiCertifProtocol-PT-02 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-02, 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-149479231800252"
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 ;