About the Execution of Irma.struct for QuasiCertifProtocol-PT-18
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 3001.620 | 406276.00 | 740369.00 | 1827.40 | TTTTTTFTFFFTFTTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 27K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 110K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 26K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 13K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 49K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 27K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 116 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 354 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 6.7K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 30K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 6.2K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 686K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is QuasiCertifProtocol-PT-18, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r139-qhx2-152673581200084
=====================================================================
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityFireability-00
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityFireability-01
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityFireability-02
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityFireability-03
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityFireability-04
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityFireability-05
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityFireability-06
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityFireability-07
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityFireability-08
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityFireability-09
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityFireability-10
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityFireability-11
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityFireability-12
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityFireability-13
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityFireability-14
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1527788033713
BK_STOP 1527788439989
--------------------
content from stderr:
Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using QuasiCertifProtocol-PT-18 as instance name.
Using QuasiCertifProtocol as model name.
Using algorithm or tool decision-tree.
Model characteristics are: {'Examination': 'ReachabilityFireability', 'Place/Transition': True, 'Colored': True, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': True, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': False, 'Quasi Live': None, 'Live': False}.
Known tools are: [{'Time': 2697266, 'Memory': 12142.59, 'Tool': 'lola'}, {'Time': 2701842, 'Memory': 11647.93, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
ReachabilityFireability lola QuasiCertifProtocol-PT-18...
----- Start make prepare stderr -----
Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
QuasiCertifProtocol-PT-18: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
QuasiCertifProtocol-PT-18: translating PT formula ReachabilityFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
ReachabilityFireability @ QuasiCertifProtocol-PT-18 @ 3538 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3538 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 1694/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 1398 places, 296 transitions, 295 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 391 transition conflict sets
lola: TASK
lola: reading formula from QuasiCertifProtocol-PT-18-ReachabilityFireability.task
lola: E (F (FIREABLE(malA5))) : A (G (((NOT FIREABLE(CgenCertif_9) AND NOT FIREABLE(CgenCertif_10) AND NOT FIREABLE(CgenCertif_11) AND NOT FIREABLE(CgenCertif_12) AND NOT FIREABLE(CgenCertif_5) AND NOT FIREABLE(CgenCertif_6) AND NOT FIREABLE(CgenCertif_7) AND NOT FIREABLE(CgenCertif_8) AND NOT FIREABLE(CgenCertif_1) AND NOT FIREABLE(CgenCertif_2) AND NOT FIREABLE(CgenCertif_3) AND NOT FIREABLE(CgenCertif_4) AND NOT FIREABLE(CgenCertif_0) AND NOT FIREABLE(CgenCertif_18) AND NOT FIREABLE(CgenCertif_17) AND NOT FIREABLE(CgenCertif_14) AND NOT FIREABLE(CgenCertif_13) AND NOT FIREABLE(CgenCertif_16) AND NOT FIREABLE(CgenCertif_15)) OR NOT FIREABLE(AreqTS) OR FIREABLE(malA3) OR (FIREABLE(malA5) AND NOT FIREABLE(malA2))))) : E (F (FIREABLE(AackCS))) : E (F ((FIREABLE(SgetTS_6) OR FIREABLE(SgetTS_5) OR FIREABLE(SgetTS_4) OR FIREABLE(SgetTS_3) OR FIREABLE(SgetTS_10) OR FIREABLE(SgetTS_9) OR FIREABLE(SgetTS_8) OR FIREABLE(SgetTS_7) OR FIREABLE(SgetTS_2) OR FIREABLE(SgetTS_1) OR FIREABLE(SgetTS_0) OR FIREABLE(SgetTS_16) OR FIREABLE(SgetTS_15) OR FIREABLE(SgetTS_18) OR FIREABLE(SgetTS_17) OR FIREABLE(SgetTS_12) OR FIREABLE(SgetTS_11) OR FIREABLE(SgetTS_14) OR FIREABLE(SgetTS_13) OR FIREABLE(CsendTS1_18) OR FIREABLE(CsendTS1_16) OR FIREABLE(CsendTS1_17) OR FIREABLE(CsendTS1_14) OR FIREABLE(CsendTS1_15) OR FIREABLE(CsendTS1_12) OR FIREABLE(CsendTS1_13) OR FIREABLE(CsendTS1_10) OR FIREABLE(CsendTS1_11) OR FIREABLE(CsendTS1_7) OR FIREABLE(CsendTS1_6) OR FIREABLE(CsendTS1_9) OR FIREABLE(CsendTS1_8) OR FIREABLE(CsendTS1_3) OR FIREABLE(CsendTS1_2) OR FIREABLE(CsendTS1_5) OR FIREABLE(CsendTS1_4) OR FIREABLE(CsendTS1_1) OR FIREABLE(CsendTS1_0) OR FIREABLE(SgetTS_6) OR FIREABLE(SgetTS_5) OR FIREABLE(SgetTS_4) OR FIREABLE(SgetTS_3) OR FIREABLE(SgetTS_10) OR FIREABLE(SgetTS_9) OR FIREABLE(SgetTS_8) OR FIREABLE(SgetTS_7) OR FIREABLE(SgetTS_2) OR FIREABLE(SgetTS_1) OR FIREABLE(SgetTS_0) OR FIREABLE(SgetTS_16) OR FIREABLE(SgetTS_15) OR FIREABLE(SgetTS_18) OR FIREABLE(SgetTS_17) OR FIREABLE(SgetTS_12) OR FIREABLE(SgetTS_11) OR FIREABLE(SgetTS_14) OR FIREABLE(SgetTS_13) OR ((FIREABLE(SgetTS_6) OR FIREABLE(SgetTS_5) OR FIREABLE(SgetTS_4) OR FIREABLE(SgetTS_3) OR FIREABLE(SgetTS_10) OR FIREABLE(SgetTS_9) OR FIREABLE(SgetTS_8) OR FIREABLE(SgetTS_7) OR FIREABLE(SgetTS_2) OR FIREABLE(SgetTS_1) OR FIREABLE(SgetTS_0) OR FIREABLE(SgetTS_16) OR FIREABLE(SgetTS_15) OR FIREABLE(SgetTS_18) OR FIREABLE(SgetTS_17) OR FIREABLE(SgetTS_12) OR FIREABLE(SgetTS_11) OR FIREABLE(SgetTS_14) OR FIREABLE(SgetTS_13)) AND FIREABLE(AendCS)) OR (NOT FIREABLE(malS1_9) AND NOT FIREABLE(malS1_10) AND NOT FIREABLE(malS1_11) AND NOT FIREABLE(malS1_12) AND NOT FIREABLE(malS1_5) AND NOT FIREABLE(malS1_6) AND NOT FIREABLE(malS1_7) AND NOT FIREABLE(malS1_8) AND NOT FIREABLE(malS1_17) AND NOT FIREABLE(malS1_18) AND NOT FIREABLE(malS1_13) AND NOT FIREABLE(malS1_14) AND NOT FIREABLE(malS1_15) AND NOT FIREABLE(malS1_16) AND NOT FIREABLE(malS1_2) AND NOT FIREABLE(malS1_1) AND NOT FIREABLE(malS1_4) AND NOT FIREABLE(malS1_3) AND NOT FIREABLE(malS1_0) AND NOT FIREABLE(malS4_18) AND NOT FIREABLE(malS4_17) AND NOT FIREABLE(malS4_16) AND NOT FIREABLE(malS4_15) AND NOT FIREABLE(malS4_14) AND NOT FIREABLE(malS4_0) AND NOT FIREABLE(malS4_1) AND NOT FIREABLE(malS4_2) AND NOT FIREABLE(malS4_3) AND NOT FIREABLE(malS4_4) AND NOT FIREABLE(malS4_5) AND NOT FIREABLE(malS4_6) AND NOT FIREABLE(malS4_7) AND NOT FIREABLE(malS4_8) AND NOT FIREABLE(malS4_9) AND NOT FIREABLE(malS4_10) AND NOT FIREABLE(malS4_11) AND NOT FIREABLE(malS4_12) AND NOT FIREABLE(malS4_13) AND (NOT FIREABLE(AendCS) OR NOT FIREABLE(AgetTS)))))) : E (F (((FIREABLE(CgenCertif_9) OR FIREABLE(CgenCertif_10) OR FIREABLE(CgenCertif_11) OR FIREABLE(CgenCertif_12) OR FIREABLE(CgenCertif_5) OR FIREABLE(CgenCertif_6) OR FIREABLE(CgenCertif_7) OR FIREABLE(CgenCertif_8) OR FIREABLE(CgenCertif_1) OR FIREABLE(CgenCertif_2) OR FIREABLE(CgenCertif_3) OR FIREABLE(CgenCertif_4) OR FIREABLE(CgenCertif_0) OR FIREABLE(CgenCertif_18) OR FIREABLE(CgenCertif_17) OR FIREABLE(CgenCertif_14) OR FIREABLE(CgenCertif_13) OR FIREABLE(CgenCertif_16) OR FIREABLE(CgenCertif_15) OR FIREABLE(ScertCS_5) OR FIREABLE(ScertCS_4) OR FIREABLE(ScertCS_7) OR FIREABLE(ScertCS_6) OR FIREABLE(ScertCS_1) OR FIREABLE(ScertCS_0) OR FIREABLE(ScertCS_3) OR FIREABLE(ScertCS_2) OR FIREABLE(ScertCS_12) OR FIREABLE(ScertCS_13) OR FIREABLE(ScertCS_14) OR FIREABLE(ScertCS_15) OR FIREABLE(ScertCS_8) OR FIREABLE(ScertCS_9) OR FIREABLE(ScertCS_10) OR FIREABLE(ScertCS_11) OR FIREABLE(ScertCS_16) OR FIREABLE(ScertCS_17) OR FIREABLE(ScertCS_18)) AND (FIREABLE(malS5_0) OR FIREABLE(malS5_17) OR FIREABLE(malS5_18) OR FIREABLE(malS5_2) OR FIREABLE(malS5_1) OR FIREABLE(malS5_4) OR FIREABLE(malS5_3) OR FIREABLE(malS5_6) OR FIREABLE(malS5_5) OR FIREABLE(malS5_8) OR FIREABLE(malS5_7) OR FIREABLE(malS5_10) OR FIREABLE(malS5_9) OR FIREABLE(malS5_12) OR FIREABLE(malS5_11) OR FIREABLE(malS5_14) OR FIREABLE(malS5_13) OR FIREABLE(malS5_16) OR FIREABLE(malS5_15))))) : A (G (((NOT FIREABLE(SreqTS_8) AND NOT FIREABLE(SreqTS_9) AND NOT FIREABLE(SreqTS_6) AND NOT FIREABLE(SreqTS_7) AND NOT FIREABLE(SreqTS_12) AND NOT FIREABLE(SreqTS_13) AND NOT FIREABLE(SreqTS_10) AND NOT FIREABLE(SreqTS_11) AND NOT FIREABLE(SreqTS_0) AND NOT FIREABLE(SreqTS_1) AND NOT FIREABLE(SreqTS_4) AND NOT FIREABLE(SreqTS_5) AND NOT FIREABLE(SreqTS_2) AND NOT FIREABLE(SreqTS_3) AND NOT FIREABLE(SreqTS_17) AND NOT FIREABLE(SreqTS_16) AND NOT FIREABLE(SreqTS_15) AND NOT FIREABLE(SreqTS_14) AND NOT FIREABLE(SreqTS_18)) OR NOT FIREABLE(malA3) OR FIREABLE(malA1) OR (NOT FIREABLE(malS5_0) AND NOT FIREABLE(malS5_17) AND NOT FIREABLE(malS5_18) AND NOT FIREABLE(malS5_2) AND NOT FIREABLE(malS5_1) AND NOT FIREABLE(malS5_4) AND NOT FIREABLE(malS5_3) AND NOT FIREABLE(malS5_6) AND NOT FIREABLE(malS5_5) AND NOT FIREABLE(malS5_8) AND NOT FIREABLE(malS5_7) AND NOT FIREABLE(malS5_10) AND NOT FIREABLE(malS5_9) AND NOT FIREABLE(malS5_12) AND NOT FIREABLE(malS5_11) AND NOT FIREABLE(malS5_14) AND NOT FIREABLE(malS5_13) AND NOT FIREABLE(malS5_16) AND NOT FIREABLE(malS5_15))))) : A (G (((NOT FIREABLE(Sperform_17) AND NOT FIREABLE(Sperform_18) AND NOT FIREABLE(Sperform_0) AND NOT FIREABLE(Sperform_10) AND NOT FIREABLE(Sperform_9) AND NOT FIREABLE(Sperform_12) AND NOT FIREABLE(Sperform_11) AND NOT FIREABLE(Sperform_14) AND NOT FIREABLE(Sperform_13) AND NOT FIREABLE(Sperform_16) AND NOT FIREABLE(Sperform_15) AND NOT FIREABLE(Sperform_2) AND NOT FIREABLE(Sperform_1) AND NOT FIREABLE(Sperform_4) AND NOT FIREABLE(Sperform_3) AND NOT FIREABLE(Sperform_6) AND NOT FIREABLE(Sperform_5) AND NOT FIREABLE(Sperform_8) AND NOT FIREABLE(Sperform_7)) OR ((FIREABLE(malS1_9) OR FIREABLE(malS1_10) OR FIREABLE(malS1_11) OR FIREABLE(malS1_12) OR FIREABLE(malS1_5) OR FIREABLE(malS1_6) OR FIREABLE(malS1_7) OR FIREABLE(malS1_8) OR FIREABLE(malS1_17) OR FIREABLE(malS1_18) OR FIREABLE(malS1_13) OR FIREABLE(malS1_14) OR FIREABLE(malS1_15) OR FIREABLE(malS1_16) OR FIREABLE(malS1_2) OR FIREABLE(malS1_1) OR FIREABLE(malS1_4) OR FIREABLE(malS1_3) OR FIREABLE(malS1_0)) AND (FIREABLE(malS6_6) OR FIREABLE(malS6_7) OR FIREABLE(malS6_4) OR FIREABLE(malS6_5) OR FIREABLE(malS6_10) OR FIREABLE(malS6_11) OR FIREABLE(malS6_8) OR FIREABLE(malS6_9) OR FIREABLE(malS6_14) OR FIREABLE(malS6_15) OR FIREABLE(malS6_12) OR FIREABLE(malS6_13) OR FIREABLE(malS6_18) OR FIREABLE(malS6_16) OR FIREABLE(malS6_17) OR FIREABLE(malS6_3) OR FIREABLE(malS6_2) OR FIREABLE(malS6_1) OR FIREABLE(malS6_0) OR FIREABLE(malS6_6) OR FIREABLE(malS6_7) OR FIREABLE(malS6_4) OR FIREABLE(malS6_5) OR FIREABLE(malS6_10) OR FIREABLE(malS6_11) OR FIREABLE(malS6_8) OR FIREABLE(malS6_9) OR FIREABLE(malS6_14) OR FIREABLE(malS6_15) OR FIREABLE(malS6_12) OR FIREABLE(malS6_13) OR FIREABLE(malS6_18) OR FIREABLE(malS6_16) OR FIREABLE(malS6_17) OR FIREABLE(malS6_3) OR FIREABLE(malS6_2) OR FIREABLE(malS6_1) OR FIREABLE(malS6_0) OR FIREABLE(malS5_0) OR FIREABLE(malS5_17) OR FIREABLE(malS5_18) OR FIREABLE(malS5_2) OR FIREABLE(malS5_1) OR FIREABLE(malS5_4) OR FIREABLE(malS5_3) OR FIREABLE(malS5_6) OR FIREABLE(malS5_5) OR FIREABLE(malS5_8) OR FIREABLE(malS5_7) OR FIREABLE(malS5_10) OR FIREABLE(malS5_9) OR FIREABLE(malS5_12) OR FIREABLE(malS5_11) OR FIREABLE(malS5_14) OR FIREABLE(malS5_13) OR FIREABLE(malS5_16) OR FIREABLE(malS5_15)))))) : E (F (FIREABLE(AreqCS))) : E (F ((NOT FIREABLE(ScertCS_8) AND NOT FIREABLE(CsendTS1_10) AND NOT FIREABLE(SgetTS_4) AND FIREABLE(malS1_9) AND FIREABLE(malS6_0) AND FIREABLE(Sperform_11) AND ((FIREABLE(CgenCertif_18) AND FIREABLE(SsendTS_16)) OR (FIREABLE(ScertCS_15) AND FIREABLE(malS5_8)))))) : E (F ((FIREABLE(malS1_0) AND FIREABLE(malS3_0) AND (NOT FIREABLE(malS1_17) OR NOT FIREABLE(malS6_8) OR (NOT FIREABLE(SsendTS_16) AND NOT FIREABLE(malS3_6)))))) : A (G (NOT FIREABLE(SackCS_5))) : E (F (FIREABLE(malS5_0))) : A (G (((FIREABLE(malS4_2) AND FIREABLE(ScertCS_17) AND NOT FIREABLE(CgenCertif_4)) OR NOT FIREABLE(AstartCS)))) : E (F (FIREABLE(Sperform_18))) : E (F (FIREABLE(malS5_6))) : E (F ((((FIREABLE(malS4_5) AND FIREABLE(malS5_0) AND FIREABLE(SgetTS_16)) OR FIREABLE(Sperform_0)) AND FIREABLE(CsendTS1_6))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(malA5)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1180 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: state equation: write sara problem file to QuasiCertifProtocol-PT-18-ReachabilityFireability.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 44 markings, 43 edges
lola: lola: state equation: calling and running sara
========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(CgenCertif_9) AND NOT FIREABLE(CgenCertif_10) AND NOT FIREABLE(CgenCertif_11) AND NOT FIREABLE(CgenCertif_12) AND NOT FIREABLE(CgenCertif_5) AND NOT FIREABLE(CgenCertif_6) AND NOT FIREABLE(CgenCertif_7) AND NOT FIREABLE(CgenCertif_8) AND NOT FIREABLE(CgenCertif_1) AND NOT FIREABLE(CgenCertif_2) AND NOT FIREABLE(CgenCertif_3) AND NOT FIREABLE(CgenCertif_4) AND NOT FIREABLE(Cgen... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1180 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 874 literals and 38 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-18-ReachabilityFireability.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 2 markings, 1 edges
lola: ========================================
sara: try reading problem file QuasiCertifProtocol-PT-18-ReachabilityFireability.sara.
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(AackCS)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
sara: 106: error near '': syntax error, unexpected $end, expecting FINALM
sara: error while parsing the sara problem file -- aborting [#05]
sara: see manual for a documentation of this error
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1180 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 20 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-18-ReachabilityFireability-2.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 42 markings, 41 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(SgetTS_6) OR FIREABLE(SgetTS_5) OR FIREABLE(SgetTS_4) OR FIREABLE(SgetTS_3) OR FIREABLE(SgetTS_10) OR FIREABLE(SgetTS_9) OR FIREABLE(SgetTS_8) OR FIREABLE(SgetTS_7) OR FIREABLE(SgetTS_2) OR FIREABLE(SgetTS_1) OR FIREABLE(SgetTS_0) OR FIREABLE(SgetTS_16) OR FIREABLE(SgetTS_15) OR FIREABLE(SgetTS_18) OR FIREABLE(SgetTS_17) OR FIREABLE(SgetTS_12) OR FIREABLE(SgetTS_11)... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1180 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: 11 markings, 10 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(CgenCertif_9) OR FIREABLE(CgenCertif_10) OR FIREABLE(CgenCertif_11) OR FIREABLE(CgenCertif_12) OR FIREABLE(CgenCertif_5) OR FIREABLE(CgenCertif_6) OR FIREABLE(CgenCertif_7) OR FIREABLE(CgenCertif_8) OR FIREABLE(CgenCertif_1) OR FIREABLE(CgenCertif_2) OR FIREABLE(CgenCertif_3) OR FIREABLE(CgenCertif_4) OR FIREABLE(CgenCertif_0) OR FIREABLE(CgenCertif_18) OR FIREABLE(C... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1180 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: 102 markings, 101 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(SreqTS_8) AND NOT FIREABLE(SreqTS_9) AND NOT FIREABLE(SreqTS_6) AND NOT FIREABLE(SreqTS_7) AND NOT FIREABLE(SreqTS_12) AND NOT FIREABLE(SreqTS_13) AND NOT FIREABLE(SreqTS_10) AND NOT FIREABLE(SreqTS_11) AND NOT FIREABLE(SreqTS_0) AND NOT FIREABLE(SreqTS_1) AND NOT FIREABLE(SreqTS_4) AND NOT FIREABLE(SreqTS_5) AND NOT FIREABLE(SreqTS_2) AND NOT FIREABLE(SreqTS_3) AND NOT FIREAB... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1180 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 1805 literals and 361 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-18-ReachabilityFireability-5.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-PT-18-ReachabilityFireability-5.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 322369 markings, 1074010 edges, 64474 markings/sec, 0 secs
lola: sara is running 5 secs || 621475 markings, 2258606 edges, 59821 markings/sec, 5 secs
lola: sara is running 10 secs || 875074 markings, 3489924 edges, 50720 markings/sec, 10 secs
lola: sara is running 15 secs || 1119100 markings, 4721917 edges, 48805 markings/sec, 15 secs
lola: sara is running 20 secs || 1348299 markings, 5975850 edges, 45840 markings/sec, 20 secs
lola: sara is running 25 secs || 1592162 markings, 7206444 edges, 48773 markings/sec, 25 secs
lola: sara is running 30 secs || 1822475 markings, 8448721 edges, 46063 markings/sec, 30 secs
lola: sara is running 35 secs || 2037888 markings, 9675623 edges, 43083 markings/sec, 35 secs
lola: sara is running 40 secs || 2261823 markings, 10911886 edges, 44787 markings/sec, 40 secs
lola: sara is running 45 secs || 2472551 markings, 12136313 edges, 42146 markings/sec, 45 secs
lola: sara is running 50 secs || 2676051 markings, 13372501 edges, 40700 markings/sec, 50 secs
lola: sara is running 55 secs || 2881337 markings, 14576421 edges, 41057 markings/sec, 55 secs
lola: sara is running 60 secs || 3112190 markings, 15768363 edges, 46171 markings/sec, 60 secs
lola: sara is running 65 secs || 3316968 markings, 16936164 edges, 40956 markings/sec, 65 secs
lola: sara is running 70 secs || 3536539 markings, 18123358 edges, 43914 markings/sec, 70 secs
lola: sara is running 75 secs || 3748744 markings, 19348190 edges, 42441 markings/sec, 75 secs
lola: sara is running 80 secs || 3952829 markings, 20585403 edges, 40817 markings/sec, 80 secs
lola: sara is running 85 secs || 4163633 markings, 21822882 edges, 42161 markings/sec, 85 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 6 will run for 344 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(Sperform_17) AND NOT FIREABLE(Sperform_18) AND NOT FIREABLE(Sperform_0) AND NOT FIREABLE(Sperform_10) AND NOT FIREABLE(Sperform_9) AND NOT FIREABLE(Sperform_12) AND NOT FIREABLE(Sperform_11) AND NOT FIREABLE(Sperform_14) AND NOT FIREABLE(Sperform_13) AND NOT FIREABLE(Sperform_16) AND NOT FIREABLE(Sperform_15) AND NOT FIREABLE(Sperform_2) AND NOT FIREABLE(Sperform_1) AND NOT FI... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1180 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: 44 markings, 43 edges
lola: ========================================
lola: subprocess 7 will run for 382 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(AreqCS)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1180 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: state equation: write sara problem file to QuasiCertifProtocol-PT-18-ReachabilityFireability-7.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 22 markings, 21 edges
lola: ========================================
lola: subprocess 8 will run for 430 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(ScertCS_8) AND NOT FIREABLE(CsendTS1_10) AND NOT FIREABLE(SgetTS_4) AND FIREABLE(malS1_9) AND FIREABLE(malS6_0) AND FIREABLE(Sperform_11) AND ((FIREABLE(CgenCertif_18) AND FIREABLE(SsendTS_16)) OR (FIREABLE(ScertCS_15) AND FIREABLE(malS5_8))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1180 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 17200 literals and 800 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-18-ReachabilityFireability-8.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-PT-18-ReachabilityFireability-8.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 326210 markings, 750014 edges, 65242 markings/sec, 0 secs
lola: sara is running 5 secs || 668600 markings, 1813632 edges, 68478 markings/sec, 5 secs
lola: sara is running 10 secs || 1005080 markings, 2771643 edges, 67296 markings/sec, 10 secs
lola: sara is running 15 secs || 1340144 markings, 3813165 edges, 67013 markings/sec, 15 secs
lola: sara is running 20 secs || 1669274 markings, 4771013 edges, 65826 markings/sec, 20 secs
lola: sara is running 25 secs || 1984511 markings, 5835892 edges, 63047 markings/sec, 25 secs
lola: sara is running 30 secs || 2319124 markings, 6787034 edges, 66923 markings/sec, 30 secs
lola: sara is running 35 secs || 2639084 markings, 7877521 edges, 63992 markings/sec, 35 secs
lola: sara is running 40 secs || 2963482 markings, 8939046 edges, 64880 markings/sec, 40 secs
lola: sara is running 45 secs || 3280540 markings, 9943119 edges, 63412 markings/sec, 45 secs
lola: sara is running 50 secs || 3595728 markings, 11033261 edges, 63038 markings/sec, 50 secs
lola: sara is running 55 secs || 3913911 markings, 12159223 edges, 63637 markings/sec, 55 secs
lola: sara is running 60 secs || 4230497 markings, 13298922 edges, 63317 markings/sec, 60 secs
lola: sara is running 65 secs || 4537988 markings, 14476689 edges, 61498 markings/sec, 65 secs
lola: sara is running 70 secs || 4832282 markings, 15622516 edges, 58859 markings/sec, 70 secs
lola: sara is running 75 secs || 5131400 markings, 16842369 edges, 59824 markings/sec, 75 secs
lola: sara is running 80 secs || 5406772 markings, 18119925 edges, 55074 markings/sec, 80 secs
lola: sara is running 85 secs || 5672847 markings, 19387580 edges, 53215 markings/sec, 85 secs
lola: sara is running 90 secs || 6024287 markings, 20333985 edges, 70288 markings/sec, 90 secs
lola: sara is running 95 secs || 6358075 markings, 21478099 edges, 66758 markings/sec, 95 secs
lola: sara is running 100 secs || 6717337 markings, 22430321 edges, 71852 markings/sec, 100 secs
lola: sara is running 105 secs || 7039534 markings, 23535689 edges, 64439 markings/sec, 105 secs
lola: sara is running 110 secs || 7384000 markings, 24547932 edges, 68893 markings/sec, 110 secs
lola: sara is running 115 secs || 7697140 markings, 25567388 edges, 62628 markings/sec, 115 secs
lola: sara is running 120 secs || 8001316 markings, 26632879 edges, 60835 markings/sec, 120 secs
lola: sara is running 125 secs || 8318333 markings, 27667988 edges, 63403 markings/sec, 125 secs
lola: sara is running 130 secs || 8637167 markings, 28739367 edges, 63767 markings/sec, 130 secs
lola: sara is running 135 secs || 8947570 markings, 29839431 edges, 62081 markings/sec, 135 secs
lola: sara is running 140 secs || 9251318 markings, 30966840 edges, 60750 markings/sec, 140 secs
lola: sara is running 145 secs || 9548705 markings, 32113503 edges, 59477 markings/sec, 145 secs
lola: sara is running 150 secs || 9847245 markings, 33269636 edges, 59708 markings/sec, 150 secs
lola: sara is running 155 secs || 10142306 markings, 34475197 edges, 59012 markings/sec, 155 secs
lola: sara is running 160 secs || 10411995 markings, 35727070 edges, 53938 markings/sec, 160 secs
lola: sara is running 165 secs || 10673566 markings, 36971353 edges, 52314 markings/sec, 165 secs
lola: sara is running 170 secs || 11038852 markings, 37950728 edges, 73057 markings/sec, 170 secs
lola: sara is running 175 secs || 11359958 markings, 39026837 edges, 64221 markings/sec, 175 secs
lola: sara is running 180 secs || 11693597 markings, 40058346 edges, 66728 markings/sec, 180 secs
lola: sara is running 185 secs || 12016710 markings, 41075717 edges, 64623 markings/sec, 185 secs
lola: sara is running 190 secs || 12324119 markings, 42136442 edges, 61482 markings/sec, 190 secs
lola: sara is running 195 secs || 12634182 markings, 43209199 edges, 62013 markings/sec, 195 secs
lola: sara is running 200 secs || 12947770 markings, 44255361 edges, 62718 markings/sec, 200 secs
lola: sara is running 205 secs || 13248056 markings, 45316374 edges, 60057 markings/sec, 205 secs
lola: sara is running 210 secs || 13546148 markings, 46412400 edges, 59618 markings/sec, 210 secs
lola: sara is running 215 secs || 13835576 markings, 47526304 edges, 57886 markings/sec, 215 secs
lola: sara is running 220 secs || 14126346 markings, 48654970 edges, 58154 markings/sec, 220 secs
lola: sara is running 225 secs || 14406482 markings, 49796202 edges, 56027 markings/sec, 225 secs
lola: sara is running 230 secs || 14661223 markings, 50979195 edges, 50948 markings/sec, 230 secs
lola: sara is running 235 secs || 14910437 markings, 52188491 edges, 49843 markings/sec, 235 secs
lola: sara is running 240 secs || 15240626 markings, 53147247 edges, 66038 markings/sec, 240 secs
lola: sara is running 245 secs || 15546562 markings, 54192625 edges, 61187 markings/sec, 245 secs
lola: sara is running 250 secs || 15845293 markings, 55139590 edges, 59746 markings/sec, 250 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 9 will run for 455 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(malS1_0) AND FIREABLE(malS3_0) AND (NOT FIREABLE(malS1_17) OR NOT FIREABLE(malS6_8) OR (NOT FIREABLE(SsendTS_16) AND NOT FIREABLE(malS3_6))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1180 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 4 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-18-ReachabilityFireability-9.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-PT-18-ReachabilityFireability-9.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 10 will run for 530 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(SackCS_5)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1180 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 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-18-ReachabilityFireability-10.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 23 markings, 22 edges
lola: ========================================
lola: subprocess 11 will run for 637 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(malS5_0)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1180 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 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-18-ReachabilityFireability-11.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 46 markings, 45 edges
lola: ========================================
lola: subprocess 12 will run for 796 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(malS4_2) AND FIREABLE(ScertCS_17) AND NOT FIREABLE(CgenCertif_4)) OR NOT FIREABLE(AstartCS))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1180 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 27 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-18-ReachabilityFireability-12.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 43 markings, 42 edges
lola: ========================================
lola: subprocess 13 will run for 1061 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(Sperform_18)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1180 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 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-18-ReachabilityFireability-13.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 44 markings, 43 edges
lola: ========================================
lola: subprocess 14 will run for 1592 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(malS5_6)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1180 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 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-18-ReachabilityFireability-14.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 46 markings, 45 edges
lola: ========================================
lola: subprocess 15 will run for 3185 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((FIREABLE(malS4_5) AND FIREABLE(malS5_0) AND FIREABLE(SgetTS_16)) OR FIREABLE(Sperform_0)) AND FIREABLE(CsendTS1_6))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1180 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 66 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-18-ReachabilityFireability-15.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-PT-18-ReachabilityFireability-15.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: RESULT
lola:
SUMMARY: yes yes yes yes yes yes no yes no no no yes no yes yes no
lola: ========================================
FORMULA QuasiCertifProtocol-PT-18-ReachabilityFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-18-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-18-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-18-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-18-ReachabilityFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-18-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-18-ReachabilityFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-18-ReachabilityFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-18-ReachabilityFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-18-ReachabilityFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-18-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-18-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-18-ReachabilityFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-18-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-18-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-18-ReachabilityFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stderr -----
----- Finished stdout -----
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="QuasiCertifProtocol-PT-18"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="irma4mcc-structural"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-PT-18.tgz
mv QuasiCertifProtocol-PT-18 execution
cd execution
pwd
ls -lh
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool irma4mcc-structural"
echo " Input is QuasiCertifProtocol-PT-18, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r139-qhx2-152673581200084"
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 ;