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 2.5M
-rw-r--r-- 1 mcc users 34K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 128K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K 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 30K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 107K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 27K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 43K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 166K 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 8.3K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 38K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 11K 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 1.8M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is QuasiCertifProtocol-PT-32, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r139-qhx2-152673581200105
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527790134257


BK_STOP 1527790967080

--------------------
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-32 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': 1327995, 'Memory': 15946.66, 'Tool': 'lola'}, {'Time': 1380904, 'Memory': 15816.4, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
ReachabilityFireability lola QuasiCertifProtocol-PT-32...
----- Start make prepare stderr -----

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


checking for too many tokens
===========================================================================================
QuasiCertifProtocol-PT-32: translating PT formula ReachabilityFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
ReachabilityFireability @ QuasiCertifProtocol-PT-32 @ 3538 seconds
----- Start make result stderr -----
----- Start make result stdout -----
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: 4312/65536 symbol table entries, 134 collisions
lola: preprocessing...
lola: finding significant places
lola: 3806 places, 506 transitions, 505 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 671 transition conflict sets
lola: TASK
lola: reading formula from QuasiCertifProtocol-PT-32-ReachabilityFireability.task
lola: E (F (((FIREABLE(CsendTS1_19) OR FIREABLE(CsendTS1_18) OR FIREABLE(CsendTS1_21) OR FIREABLE(CsendTS1_20) OR FIREABLE(CsendTS1_23) OR FIREABLE(CsendTS1_22) OR FIREABLE(CsendTS1_25) OR FIREABLE(CsendTS1_24) OR FIREABLE(CsendTS1_27) OR FIREABLE(CsendTS1_26) OR FIREABLE(CsendTS1_29) OR FIREABLE(CsendTS1_28) OR FIREABLE(CsendTS1_31) OR FIREABLE(CsendTS1_30) OR FIREABLE(CsendTS1_32) OR FIREABLE(CsendTS1_1) OR FIREABLE(CsendTS1_0) OR FIREABLE(CsendTS1_2) OR FIREABLE(CsendTS1_3) OR FIREABLE(CsendTS1_4) OR FIREABLE(CsendTS1_5) OR FIREABLE(CsendTS1_6) OR FIREABLE(CsendTS1_7) OR FIREABLE(CsendTS1_8) OR FIREABLE(CsendTS1_9) OR FIREABLE(CsendTS1_10) OR FIREABLE(CsendTS1_11) OR FIREABLE(CsendTS1_12) OR FIREABLE(CsendTS1_13) OR FIREABLE(CsendTS1_14) OR FIREABLE(CsendTS1_15) OR FIREABLE(CsendTS1_16) OR FIREABLE(CsendTS1_17))))) : E (F ((FIREABLE(malA1) AND (FIREABLE(SackCS_2) OR FIREABLE(SackCS_3) OR FIREABLE(SackCS_0) OR FIREABLE(SackCS_1) OR FIREABLE(SackCS_6) OR FIREABLE(SackCS_7) OR FIREABLE(SackCS_4) OR FIREABLE(SackCS_5) OR FIREABLE(SackCS_10) OR FIREABLE(SackCS_11) OR FIREABLE(SackCS_8) OR FIREABLE(SackCS_9) OR FIREABLE(SackCS_14) OR FIREABLE(SackCS_15) OR FIREABLE(SackCS_12) OR FIREABLE(SackCS_13) OR FIREABLE(SackCS_21) OR FIREABLE(SackCS_20) OR FIREABLE(SackCS_23) OR FIREABLE(SackCS_22) OR FIREABLE(SackCS_17) OR FIREABLE(SackCS_16) OR FIREABLE(SackCS_19) OR FIREABLE(SackCS_18) OR FIREABLE(SackCS_29) OR FIREABLE(SackCS_28) OR FIREABLE(SackCS_31) OR FIREABLE(SackCS_30) OR FIREABLE(SackCS_25) OR FIREABLE(SackCS_24) OR FIREABLE(SackCS_27) OR FIREABLE(SackCS_26) OR FIREABLE(SackCS_32) OR FIREABLE(AreqCS))))) : A (G ((FIREABLE(SackCS_2) OR FIREABLE(SackCS_3) OR FIREABLE(SackCS_0) OR FIREABLE(SackCS_1) OR FIREABLE(SackCS_6) OR FIREABLE(SackCS_7) OR FIREABLE(SackCS_4) OR FIREABLE(SackCS_5) OR FIREABLE(SackCS_10) OR FIREABLE(SackCS_11) OR FIREABLE(SackCS_8) OR FIREABLE(SackCS_9) OR FIREABLE(SackCS_14) OR FIREABLE(SackCS_15) OR FIREABLE(SackCS_12) OR FIREABLE(SackCS_13) OR FIREABLE(SackCS_21) OR FIREABLE(SackCS_20) OR FIREABLE(SackCS_23) OR FIREABLE(SackCS_22) OR FIREABLE(SackCS_17) OR FIREABLE(SackCS_16) OR FIREABLE(SackCS_19) OR FIREABLE(SackCS_18) OR FIREABLE(SackCS_29) OR FIREABLE(SackCS_28) OR FIREABLE(SackCS_31) OR FIREABLE(SackCS_30) OR FIREABLE(SackCS_25) OR FIREABLE(SackCS_24) OR FIREABLE(SackCS_27) OR FIREABLE(SackCS_26) OR FIREABLE(SackCS_32) OR NOT FIREABLE(AgetTS)))) : A (G (((NOT FIREABLE(SsendTS_20) AND NOT FIREABLE(SsendTS_19) AND NOT FIREABLE(SsendTS_18) AND NOT FIREABLE(SsendTS_17) AND NOT FIREABLE(SsendTS_24) AND NOT FIREABLE(SsendTS_23) AND NOT FIREABLE(SsendTS_22) AND NOT FIREABLE(SsendTS_21) AND NOT FIREABLE(SsendTS_28) AND NOT FIREABLE(SsendTS_27) AND NOT FIREABLE(SsendTS_26) AND NOT FIREABLE(SsendTS_25) AND NOT FIREABLE(SsendTS_32) AND NOT FIREABLE(SsendTS_31) AND NOT FIREABLE(SsendTS_30) AND NOT FIREABLE(SsendTS_29) AND NOT FIREABLE(SsendTS_0) AND NOT FIREABLE(SsendTS_1) AND NOT FIREABLE(SsendTS_2) AND NOT FIREABLE(SsendTS_3) AND NOT FIREABLE(SsendTS_4) AND NOT FIREABLE(SsendTS_5) AND NOT FIREABLE(SsendTS_6) AND NOT FIREABLE(SsendTS_7) AND NOT FIREABLE(SsendTS_8) AND NOT FIREABLE(SsendTS_9) AND NOT FIREABLE(SsendTS_10) AND NOT FIREABLE(SsendTS_11) AND NOT FIREABLE(SsendTS_12) AND NOT FIREABLE(SsendTS_13) AND NOT FIREABLE(SsendTS_14) AND NOT FIREABLE(SsendTS_15) AND NOT FIREABLE(SsendTS_16)) OR NOT FIREABLE(AackCS) OR (NOT FIREABLE(CsendTS1_19) AND NOT FIREABLE(CsendTS1_18) AND NOT FIREABLE(CsendTS1_21) AND NOT FIREABLE(CsendTS1_20) AND NOT FIREABLE(CsendTS1_23) AND NOT FIREABLE(CsendTS1_22) AND NOT FIREABLE(CsendTS1_25) AND NOT FIREABLE(CsendTS1_24) AND NOT FIREABLE(CsendTS1_27) AND NOT FIREABLE(CsendTS1_26) AND NOT FIREABLE(CsendTS1_29) AND NOT FIREABLE(CsendTS1_28) AND NOT FIREABLE(CsendTS1_31) AND NOT FIREABLE(CsendTS1_30) AND NOT FIREABLE(CsendTS1_32) AND NOT FIREABLE(CsendTS1_1) AND NOT FIREABLE(CsendTS1_0) AND NOT FIREABLE(CsendTS1_2) AND NOT FIREABLE(CsendTS1_3) AND NOT FIREABLE(CsendTS1_4) AND NOT FIREABLE(CsendTS1_5) AND NOT FIREABLE(CsendTS1_6) AND NOT FIREABLE(CsendTS1_7) AND NOT FIREABLE(CsendTS1_8) AND NOT FIREABLE(CsendTS1_9) AND NOT FIREABLE(CsendTS1_10) AND NOT FIREABLE(CsendTS1_11) AND NOT FIREABLE(CsendTS1_12) AND NOT FIREABLE(CsendTS1_13) AND NOT FIREABLE(CsendTS1_14) AND NOT FIREABLE(CsendTS1_15) AND NOT FIREABLE(CsendTS1_16) AND NOT FIREABLE(CsendTS1_17) AND NOT FIREABLE(malA3)) OR (((NOT FIREABLE(ScertCS_7) AND NOT FIREABLE(ScertCS_6) AND NOT FIREABLE(ScertCS_5) AND NOT FIREABLE(ScertCS_4) AND NOT FIREABLE(ScertCS_11) AND NOT FIREABLE(ScertCS_10) AND NOT FIREABLE(ScertCS_9) AND NOT FIREABLE(ScertCS_8) AND NOT FIREABLE(ScertCS_3) AND NOT FIREABLE(ScertCS_2) AND NOT FIREABLE(ScertCS_1) AND NOT FIREABLE(ScertCS_0) AND NOT FIREABLE(ScertCS_24) AND NOT FIREABLE(ScertCS_25) AND NOT FIREABLE(ScertCS_26) AND NOT FIREABLE(ScertCS_27) AND NOT FIREABLE(ScertCS_20) AND NOT FIREABLE(ScertCS_21) AND NOT FIREABLE(ScertCS_22) AND NOT FIREABLE(ScertCS_23) AND NOT FIREABLE(ScertCS_16) AND NOT FIREABLE(ScertCS_17) AND NOT FIREABLE(ScertCS_18) AND NOT FIREABLE(ScertCS_19) AND NOT FIREABLE(ScertCS_12) AND NOT FIREABLE(ScertCS_13) AND NOT FIREABLE(ScertCS_14) AND NOT FIREABLE(ScertCS_15) AND NOT FIREABLE(ScertCS_32) AND NOT FIREABLE(ScertCS_29) AND NOT FIREABLE(ScertCS_28) AND NOT FIREABLE(ScertCS_31) AND NOT FIREABLE(ScertCS_30)) OR NOT FIREABLE(AreqTS)) AND (FIREABLE(malC1_17) OR FIREABLE(malC1_18) OR FIREABLE(malC1_15) OR FIREABLE(malC1_16) OR FIREABLE(malC1_21) OR FIREABLE(malC1_22) OR FIREABLE(malC1_19) OR FIREABLE(malC1_20) OR FIREABLE(malC1_25) OR FIREABLE(malC1_26) OR FIREABLE(malC1_23) OR FIREABLE(malC1_24) OR FIREABLE(malC1_29) OR FIREABLE(malC1_30) OR FIREABLE(malC1_27) OR FIREABLE(malC1_28) OR FIREABLE(malC1_2) OR FIREABLE(malC1_1) OR FIREABLE(malC1_0) OR FIREABLE(malC1_6) OR FIREABLE(malC1_5) OR FIREABLE(malC1_4) OR FIREABLE(malC1_3) OR FIREABLE(malC1_10) OR FIREABLE(malC1_9) OR FIREABLE(malC1_8) OR FIREABLE(malC1_7) OR FIREABLE(malC1_14) OR FIREABLE(malC1_13) OR FIREABLE(malC1_12) OR FIREABLE(malC1_11) OR FIREABLE(malC1_31) OR FIREABLE(malC1_32)))))) : E (F ((FIREABLE(SgetTS_23) OR FIREABLE(SgetTS_24) OR FIREABLE(SgetTS_21) OR FIREABLE(SgetTS_22) OR FIREABLE(SgetTS_27) OR FIREABLE(SgetTS_28) OR FIREABLE(SgetTS_25) OR FIREABLE(SgetTS_26) OR FIREABLE(SgetTS_15) OR FIREABLE(SgetTS_16) OR FIREABLE(SgetTS_13) OR FIREABLE(SgetTS_14) OR FIREABLE(SgetTS_19) OR FIREABLE(SgetTS_20) OR FIREABLE(SgetTS_17) OR FIREABLE(SgetTS_18) OR FIREABLE(SgetTS_32) OR FIREABLE(SgetTS_31) OR FIREABLE(SgetTS_30) OR FIREABLE(SgetTS_29) 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(SgetTS_12) OR FIREABLE(SgetTS_11) OR FIREABLE(SgetTS_0) OR FIREABLE(SgetTS_2) OR FIREABLE(SgetTS_1) OR FIREABLE(SgetTS_4) OR FIREABLE(SgetTS_3)))) : E (F (FIREABLE(malA4))) : E (F (FIREABLE(AstartCS))) : E (F (((FIREABLE(SreqTS_4) OR FIREABLE(SreqTS_5) OR FIREABLE(SreqTS_2) OR FIREABLE(SreqTS_3) OR FIREABLE(SreqTS_0) OR FIREABLE(SreqTS_1) OR FIREABLE(SreqTS_12) OR FIREABLE(SreqTS_13) OR FIREABLE(SreqTS_10) OR FIREABLE(SreqTS_11) OR FIREABLE(SreqTS_8) OR FIREABLE(SreqTS_9) OR FIREABLE(SreqTS_6) OR FIREABLE(SreqTS_7) OR FIREABLE(SreqTS_22) OR FIREABLE(SreqTS_23) OR FIREABLE(SreqTS_24) OR FIREABLE(SreqTS_25) OR FIREABLE(SreqTS_26) OR FIREABLE(SreqTS_27) OR FIREABLE(SreqTS_28) OR FIREABLE(SreqTS_29) OR FIREABLE(SreqTS_14) OR FIREABLE(SreqTS_15) OR FIREABLE(SreqTS_16) OR FIREABLE(SreqTS_17) OR FIREABLE(SreqTS_18) OR FIREABLE(SreqTS_19) OR FIREABLE(SreqTS_20) OR FIREABLE(SreqTS_21) OR FIREABLE(SreqTS_31) OR FIREABLE(SreqTS_30) OR FIREABLE(SreqTS_32)) AND (FIREABLE(malS5_31) OR FIREABLE(malS5_32) OR FIREABLE(malS5_29) OR FIREABLE(malS5_30) OR FIREABLE(malS5_9) OR FIREABLE(malS5_10) OR FIREABLE(malS5_11) OR FIREABLE(malS5_12) OR FIREABLE(malS5_5) OR FIREABLE(malS5_6) OR FIREABLE(malS5_7) OR FIREABLE(malS5_8) OR FIREABLE(malS5_1) OR FIREABLE(malS5_2) OR FIREABLE(malS5_3) OR FIREABLE(malS5_4) OR FIREABLE(malS5_0) OR FIREABLE(malS5_26) OR FIREABLE(malS5_25) OR FIREABLE(malS5_28) OR FIREABLE(malS5_27) OR FIREABLE(malS5_22) OR FIREABLE(malS5_21) OR FIREABLE(malS5_24) OR FIREABLE(malS5_23) OR FIREABLE(malS5_18) OR FIREABLE(malS5_17) OR FIREABLE(malS5_20) OR FIREABLE(malS5_19) OR FIREABLE(malS5_14) OR FIREABLE(malS5_13) OR FIREABLE(malS5_16) OR FIREABLE(malS5_15)) AND ((NOT FIREABLE(malS4_28) AND NOT FIREABLE(malS4_29) AND NOT FIREABLE(malS4_30) AND NOT FIREABLE(malS4_31) AND NOT FIREABLE(malS4_32) AND NOT FIREABLE(malS4_6) AND NOT FIREABLE(malS4_7) AND NOT FIREABLE(malS4_4) AND NOT FIREABLE(malS4_5) AND NOT FIREABLE(malS4_10) AND NOT FIREABLE(malS4_11) AND NOT FIREABLE(malS4_8) AND NOT FIREABLE(malS4_9) AND NOT FIREABLE(malS4_2) AND NOT FIREABLE(malS4_3) AND NOT FIREABLE(malS4_0) AND NOT FIREABLE(malS4_1) AND NOT FIREABLE(malS4_23) AND NOT FIREABLE(malS4_22) AND NOT FIREABLE(malS4_21) AND NOT FIREABLE(malS4_20) AND NOT FIREABLE(malS4_27) AND NOT FIREABLE(malS4_26) AND NOT FIREABLE(malS4_25) AND NOT FIREABLE(malS4_24) AND NOT FIREABLE(malS4_15) AND NOT FIREABLE(malS4_14) AND NOT FIREABLE(malS4_13) AND NOT FIREABLE(malS4_12) AND NOT FIREABLE(malS4_19) AND NOT FIREABLE(malS4_18) AND NOT FIREABLE(malS4_17) AND NOT FIREABLE(malS4_16)) OR (NOT FIREABLE(malS2_31) AND NOT FIREABLE(malS2_30) AND NOT FIREABLE(malS2_32) AND NOT FIREABLE(malS2_27) AND NOT FIREABLE(malS2_26) AND NOT FIREABLE(malS2_29) AND NOT FIREABLE(malS2_28) AND NOT FIREABLE(malS2_1) AND NOT FIREABLE(malS2_0) AND NOT FIREABLE(malS2_9) AND NOT FIREABLE(malS2_8) AND NOT FIREABLE(malS2_7) AND NOT FIREABLE(malS2_6) AND NOT FIREABLE(malS2_5) AND NOT FIREABLE(malS2_4) AND NOT FIREABLE(malS2_3) AND NOT FIREABLE(malS2_2) AND NOT FIREABLE(malS2_16) AND NOT FIREABLE(malS2_17) AND NOT FIREABLE(malS2_14) AND NOT FIREABLE(malS2_15) AND NOT FIREABLE(malS2_12) AND NOT FIREABLE(malS2_13) AND NOT FIREABLE(malS2_10) AND NOT FIREABLE(malS2_11) AND NOT FIREABLE(malS2_24) AND NOT FIREABLE(malS2_25) AND NOT FIREABLE(malS2_22) AND NOT FIREABLE(malS2_23) AND NOT FIREABLE(malS2_20) AND NOT FIREABLE(malS2_21) AND NOT FIREABLE(malS2_18) AND NOT FIREABLE(malS2_19)) OR (NOT FIREABLE(malS1_28) AND NOT FIREABLE(malS1_27) AND NOT FIREABLE(malS1_26) AND NOT FIREABLE(malS1_25) AND NOT FIREABLE(malS1_32) AND NOT FIREABLE(malS1_31) AND NOT FIREABLE(malS1_30) AND NOT FIREABLE(malS1_29) AND NOT FIREABLE(malS1_0) AND NOT FIREABLE(malS1_6) AND NOT FIREABLE(malS1_5) AND NOT FIREABLE(malS1_8) AND NOT FIREABLE(malS1_7) AND NOT FIREABLE(malS1_2) AND NOT FIREABLE(malS1_1) AND NOT FIREABLE(malS1_4) AND NOT FIREABLE(malS1_3) AND NOT FIREABLE(malS1_13) AND NOT FIREABLE(malS1_14) AND NOT FIREABLE(malS1_15) AND NOT FIREABLE(malS1_16) AND NOT FIREABLE(malS1_9) AND NOT FIREABLE(malS1_10) AND NOT FIREABLE(malS1_11) AND NOT FIREABLE(malS1_12) AND NOT FIREABLE(malS1_21) AND NOT FIREABLE(malS1_22) AND NOT FIREABLE(malS1_23) AND NOT FIREABLE(malS1_24) AND NOT FIREABLE(malS1_17) AND NOT FIREABLE(malS1_18) AND NOT FIREABLE(malS1_19) AND NOT FIREABLE(malS1_20) AND NOT FIREABLE(malA3)))))) : E (F ((FIREABLE(CgenCertif_7) OR (FIREABLE(malS6_27) AND (FIREABLE(SreqTS_27) OR FIREABLE(SreqTS_23) OR NOT FIREABLE(malS3_20)))))) : A (G ((NOT FIREABLE(malS2_32) OR NOT FIREABLE(ScertCS_16) OR NOT FIREABLE(CgenCertif_7) OR NOT FIREABLE(malS5_31)))) : E (F ((FIREABLE(SgetTS_0) AND FIREABLE(SreqTS_1) AND NOT FIREABLE(SgetTS_32) AND (FIREABLE(malC1_29) OR FIREABLE(malS5_22)) AND FIREABLE(SsendTS_8)))) : E (F (FIREABLE(malC1_15))) : A (G (((NOT FIREABLE(malS4_15) AND NOT FIREABLE(ScertCS_0)) OR (NOT FIREABLE(malS6_24) AND NOT FIREABLE(SreqTS_19)) OR (FIREABLE(malS2_24) AND (FIREABLE(malS4_12) OR FIREABLE(SsendTS_29) OR FIREABLE(SsendTS_14)))))) : E (F ((FIREABLE(malS5_24) AND FIREABLE(SsendTS_15) AND FIREABLE(SgetTS_9) AND (FIREABLE(CgenCertif_7) OR FIREABLE(CsendTS1_25) OR FIREABLE(malC1_32)) AND ((NOT FIREABLE(Sperform_4) AND NOT FIREABLE(SackCS_7)) OR (NOT FIREABLE(SreqTS_25) AND NOT FIREABLE(malS2_22)))))) : A (G ((NOT FIREABLE(SackCS_26) OR NOT FIREABLE(CgenCertif_21) OR NOT FIREABLE(SreqTS_26) OR NOT FIREABLE(malS2_9) OR NOT FIREABLE(malS3_5) OR NOT FIREABLE(SgetTS_29) OR (FIREABLE(SsendTS_22) AND FIREABLE(malS1_3)) OR FIREABLE(CsendTS1_22)))) : E (F ((FIREABLE(malC1_17) AND NOT FIREABLE(SgetTS_27) AND FIREABLE(malS6_25) AND FIREABLE(SackCS_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(CsendTS1_19) OR FIREABLE(CsendTS1_18) OR FIREABLE(CsendTS1_21) OR FIREABLE(CsendTS1_20) OR FIREABLE(CsendTS1_23) OR FIREABLE(CsendTS1_22) OR FIREABLE(CsendTS1_25) OR FIREABLE(CsendTS1_24) OR FIREABLE(CsendTS1_27) OR FIREABLE(CsendTS1_26) OR FIREABLE(CsendTS1_29) OR FIREABLE(CsendTS1_28) OR FIREABLE(CsendTS1_31) OR FIREABLE(CsendTS1_30) OR FIREABLE(CsendTS1_32) OR FI... (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 2020 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 1122 literals and 33 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-32-ReachabilityFireability.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 138 markings, 137 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(malA1) AND (FIREABLE(SackCS_2) OR FIREABLE(SackCS_3) OR FIREABLE(SackCS_0) OR FIREABLE(SackCS_1) OR FIREABLE(SackCS_6) OR FIREABLE(SackCS_7) OR FIREABLE(SackCS_4) OR FIREABLE(SackCS_5) OR FIREABLE(SackCS_10) OR FIREABLE(SackCS_11) OR FIREABLE(SackCS_8) OR FIREABLE(SackCS_9) OR FIREABLE(SackCS_14) OR FIREABLE(SackCS_15) OR FIREABLE(SackCS_12) OR FIREABLE(SackCS_13) 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 2020 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 101 literals and 34 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-32-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-PT-32-ReachabilityFireability.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 274727 markings, 546408 edges, 54945 markings/sec, 0 secs
lola: sara is running 5 secs || 539263 markings, 1148454 edges, 52907 markings/sec, 5 secs
lola: sara is running 10 secs || 785755 markings, 1707917 edges, 49298 markings/sec, 10 secs
lola: sara is running 15 secs || 1027827 markings, 2294267 edges, 48414 markings/sec, 15 secs
lola: sara is running 20 secs || 1268830 markings, 2850553 edges, 48201 markings/sec, 20 secs
lola: sara is running 25 secs || 1501950 markings, 3447716 edges, 46624 markings/sec, 25 secs
lola: sara is running 30 secs || 1743527 markings, 4097839 edges, 48315 markings/sec, 30 secs
lola: sara is running 35 secs || 2001928 markings, 4706085 edges, 51680 markings/sec, 35 secs
lola: sara is running 40 secs || 2250910 markings, 5308807 edges, 49796 markings/sec, 40 secs
lola: sara is running 45 secs || 2498551 markings, 5900261 edges, 49528 markings/sec, 45 secs
lola: sara is running 50 secs || 2727399 markings, 6470342 edges, 45770 markings/sec, 50 secs
lola: sara is running 55 secs || 2954192 markings, 7097486 edges, 45359 markings/sec, 55 secs

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 2 will run for 248 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(SackCS_2) OR FIREABLE(SackCS_3) OR FIREABLE(SackCS_0) OR FIREABLE(SackCS_1) OR FIREABLE(SackCS_6) OR FIREABLE(SackCS_7) OR FIREABLE(SackCS_4) OR FIREABLE(SackCS_5) OR FIREABLE(SackCS_10) OR FIREABLE(SackCS_11) OR FIREABLE(SackCS_8) OR FIREABLE(SackCS_9) OR FIREABLE(SackCS_14) OR FIREABLE(SackCS_15) OR FIREABLE(SackCS_12) OR FIREABLE(SackCS_13) OR FIREABLE(SackCS_21)... (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 2020 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: 35 markings, 34 edges
lola: ========================================
lola: subprocess 3 will run for 267 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(SsendTS_20) AND NOT FIREABLE(SsendTS_19) AND NOT FIREABLE(SsendTS_18) AND NOT FIREABLE(SsendTS_17) AND NOT FIREABLE(SsendTS_24) AND NOT FIREABLE(SsendTS_23) AND NOT FIREABLE(SsendTS_22) AND NOT FIREABLE(SsendTS_21) AND NOT FIREABLE(SsendTS_28) AND NOT FIREABLE(SsendTS_27) AND NOT FIREABLE(SsendTS_26) AND NOT FIREABLE(SsendTS_25) AND NOT FIREABLE(SsendTS_32) AND NOT FIREABLE(Ss... (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 2020 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) || 120664 markings, 339902 edges, 24133 markings/sec, 0 secs
lola: sara not yet started (preprocessing) || 256539 markings, 765651 edges, 27175 markings/sec, 5 secs
lola: sara not yet started (preprocessing) || 429481 markings, 1349198 edges, 34588 markings/sec, 10 secs
lola: state equation: Could not create input for sara: DNF too long or DEADLOCK predicate contained
lola: sara not yet started (preprocessing) || 633737 markings, 2050960 edges, 40851 markings/sec, 15 secs
lola: sara not yet started (preprocessing) || 836201 markings, 2795939 edges, 40493 markings/sec, 20 secs
lola: sara not yet started (preprocessing) || 1032005 markings, 3574915 edges, 39161 markings/sec, 25 secs
lola: sara not yet started (preprocessing) || 1232515 markings, 4260815 edges, 40102 markings/sec, 30 secs
lola: sara not yet started (preprocessing) || 1438251 markings, 4972057 edges, 41147 markings/sec, 35 secs
lola: sara not yet started (preprocessing) || 1627328 markings, 5721592 edges, 37815 markings/sec, 40 secs
lola: sara not yet started (preprocessing) || 1824760 markings, 6466063 edges, 39486 markings/sec, 45 secs
lola: sara not yet started (preprocessing) || 2018454 markings, 7188724 edges, 38739 markings/sec, 50 secs
lola: sara not yet started (preprocessing) || 2202464 markings, 7932457 edges, 36802 markings/sec, 55 secs
lola: sara not yet started (preprocessing) || 2385007 markings, 8690283 edges, 36509 markings/sec, 60 secs
lola: sara not yet started (preprocessing) || 2566672 markings, 9448754 edges, 36333 markings/sec, 65 secs
lola: sara not yet started (preprocessing) || 2741838 markings, 10248235 edges, 35033 markings/sec, 70 secs
lola: sara not yet started (preprocessing) || 2947170 markings, 11002585 edges, 41066 markings/sec, 75 secs
lola: sara not yet started (preprocessing) || 3153919 markings, 11728046 edges, 41350 markings/sec, 80 secs
lola: sara not yet started (preprocessing) || 3348089 markings, 12461323 edges, 38834 markings/sec, 85 secs
lola: sara not yet started (preprocessing) || 3534725 markings, 13190260 edges, 37327 markings/sec, 90 secs
lola: sara not yet started (preprocessing) || 3723167 markings, 13893380 edges, 37688 markings/sec, 95 secs
lola: sara not yet started (preprocessing) || 3899300 markings, 14622790 edges, 35227 markings/sec, 100 secs
lola: sara not yet started (preprocessing) || 4086747 markings, 15325115 edges, 37489 markings/sec, 105 secs
lola: sara not yet started (preprocessing) || 4262148 markings, 16056126 edges, 35080 markings/sec, 110 secs
lola: sara not yet started (preprocessing) || 4433378 markings, 16809272 edges, 34246 markings/sec, 115 secs
lola: sara not yet started (preprocessing) || 4592716 markings, 17589709 edges, 31868 markings/sec, 120 secs
lola: sara not yet started (preprocessing) || 4782351 markings, 18247302 edges, 37927 markings/sec, 125 secs
lola: sara not yet started (preprocessing) || 4958997 markings, 18933468 edges, 35329 markings/sec, 130 secs
lola: sara not yet started (preprocessing) || 5128175 markings, 19615363 edges, 33836 markings/sec, 135 secs
lola: sara not yet started (preprocessing) || 5314141 markings, 20378712 edges, 37193 markings/sec, 140 secs
lola: sara not yet started (preprocessing) || 5499891 markings, 21156901 edges, 37150 markings/sec, 145 secs
lola: sara not yet started (preprocessing) || 5673278 markings, 21963132 edges, 34677 markings/sec, 150 secs
lola: sara not yet started (preprocessing) || 5862155 markings, 22727106 edges, 37775 markings/sec, 155 secs
lola: sara not yet started (preprocessing) || 6046654 markings, 23494642 edges, 36900 markings/sec, 160 secs
lola: sara not yet started (preprocessing) || 6228558 markings, 24274277 edges, 36381 markings/sec, 165 secs
lola: sara not yet started (preprocessing) || 6395845 markings, 25080023 edges, 33457 markings/sec, 170 secs
lola: sara not yet started (preprocessing) || 6578566 markings, 25861368 edges, 36544 markings/sec, 175 secs
lola: sara not yet started (preprocessing) || 6756216 markings, 26659329 edges, 35530 markings/sec, 180 secs
lola: sara not yet started (preprocessing) || 6928644 markings, 27470767 edges, 34486 markings/sec, 185 secs
lola: sara not yet started (preprocessing) || 7098233 markings, 28290214 edges, 33918 markings/sec, 190 secs
lola: sara not yet started (preprocessing) || 7263391 markings, 29116366 edges, 33032 markings/sec, 195 secs
lola: sara not yet started (preprocessing) || 7439854 markings, 29948775 edges, 35293 markings/sec, 200 secs
lola: sara not yet started (preprocessing) || 7677718 markings, 30757876 edges, 47573 markings/sec, 205 secs
lola: sara not yet started (preprocessing) || 7895318 markings, 31555639 edges, 43520 markings/sec, 210 secs
lola: sara not yet started (preprocessing) || 8100623 markings, 32375392 edges, 41061 markings/sec, 215 secs
lola: sara not yet started (preprocessing) || 8308569 markings, 33135192 edges, 41589 markings/sec, 220 secs
lola: sara not yet started (preprocessing) || 8501011 markings, 33917223 edges, 38488 markings/sec, 225 secs
lola: sara not yet started (preprocessing) || 8686694 markings, 34628378 edges, 37137 markings/sec, 230 secs
lola: sara not yet started (preprocessing) || 8860262 markings, 35353810 edges, 34714 markings/sec, 235 secs
lola: sara not yet started (preprocessing) || 9030476 markings, 36111304 edges, 34043 markings/sec, 240 secs
lola: sara not yet started (preprocessing) || 9191626 markings, 36873461 edges, 32230 markings/sec, 245 secs
lola: sara not yet started (preprocessing) || 9379555 markings, 37530810 edges, 37586 markings/sec, 250 secs
lola: sara not yet started (preprocessing) || 9552882 markings, 38212223 edges, 34665 markings/sec, 255 secs
lola: sara not yet started (preprocessing) || 9730860 markings, 38915850 edges, 35596 markings/sec, 260 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 267 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(SgetTS_23) OR FIREABLE(SgetTS_24) OR FIREABLE(SgetTS_21) OR FIREABLE(SgetTS_22) OR FIREABLE(SgetTS_27) OR FIREABLE(SgetTS_28) OR FIREABLE(SgetTS_25) OR FIREABLE(SgetTS_26) OR FIREABLE(SgetTS_15) OR FIREABLE(SgetTS_16) OR FIREABLE(SgetTS_13) OR FIREABLE(SgetTS_14) OR FIREABLE(SgetTS_19) OR FIREABLE(SgetTS_20) OR FIREABLE(SgetTS_17) OR FIREABLE(SgetTS_18) OR FIREABLE(... (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 2020 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 1122 literals and 33 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-32-ReachabilityFireability-4.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 171 markings, 170 edges
lola: ========================================
lola: subprocess 5 will run for 291 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(malA4)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2020 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-32-ReachabilityFireability-5.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 71 markings, 70 edges
lola: ========================================
lola: subprocess 6 will run for 320 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 2020 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-32-ReachabilityFireability-6.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 71 markings, 70 edges
lola: ========================================
lola: subprocess 7 will run for 356 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(SreqTS_4) OR FIREABLE(SreqTS_5) OR FIREABLE(SreqTS_2) OR FIREABLE(SreqTS_3) OR FIREABLE(SreqTS_0) OR FIREABLE(SreqTS_1) OR FIREABLE(SreqTS_12) OR FIREABLE(SreqTS_13) OR FIREABLE(SreqTS_10) OR FIREABLE(SreqTS_11) OR FIREABLE(SreqTS_8) OR FIREABLE(SreqTS_9) OR FIREABLE(SreqTS_6) OR FIREABLE(SreqTS_7) OR FIREABLE(SreqTS_22) OR FIREABLE(SreqTS_23) OR FIREABLE(SreqTS_24... (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 2020 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: 75 markings, 74 edges
lola: ========================================
lola: subprocess 8 will run for 401 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(CgenCertif_7) OR (FIREABLE(malS6_27) AND (FIREABLE(SreqTS_27) OR FIREABLE(SreqTS_23) OR NOT FIREABLE(malS3_20))))))
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 2020 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 43 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-32-ReachabilityFireability-8.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-PT-32-ReachabilityFireability-8.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 112055 markings, 317306 edges, 22411 markings/sec, 0 secs

lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 9 will run for 457 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(malS2_32) OR NOT FIREABLE(ScertCS_16) OR NOT FIREABLE(CgenCertif_7) OR NOT FIREABLE(malS5_31))))
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 2020 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 39 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-32-ReachabilityFireability-9.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-PT-32-ReachabilityFireability-9.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 10 will run for 533 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(SgetTS_0) AND FIREABLE(SreqTS_1) AND NOT FIREABLE(SgetTS_32) AND (FIREABLE(malC1_29) OR FIREABLE(malS5_22)) AND FIREABLE(SsendTS_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 2020 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 2720 literals and 68 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-32-ReachabilityFireability-10.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-PT-32-ReachabilityFireability-10.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 248142 markings, 291599 edges, 49628 markings/sec, 0 secs
lola: sara is running 5 secs || 516670 markings, 615780 edges, 53706 markings/sec, 5 secs
lola: sara is running 10 secs || 835479 markings, 995252 edges, 63762 markings/sec, 10 secs
lola: sara is running 15 secs || 1117784 markings, 1341070 edges, 56461 markings/sec, 15 secs
lola: sara is running 20 secs || 1425774 markings, 1727669 edges, 61598 markings/sec, 20 secs
lola: sara is running 25 secs || 1734276 markings, 2111291 edges, 61700 markings/sec, 25 secs
lola: sara is running 30 secs || 2039777 markings, 2502715 edges, 61100 markings/sec, 30 secs
lola: sara is running 35 secs || 2354938 markings, 2917317 edges, 63032 markings/sec, 35 secs
lola: sara is running 40 secs || 2670833 markings, 3326556 edges, 63179 markings/sec, 40 secs
lola: sara is running 45 secs || 2986647 markings, 3751389 edges, 63163 markings/sec, 45 secs
lola: sara is running 50 secs || 3292971 markings, 4173972 edges, 61265 markings/sec, 50 secs
lola: sara is running 55 secs || 3597693 markings, 4607804 edges, 60944 markings/sec, 55 secs
lola: sara is running 60 secs || 3910961 markings, 5047318 edges, 62654 markings/sec, 60 secs
lola: sara is running 65 secs || 4222115 markings, 5500759 edges, 62231 markings/sec, 65 secs
lola: sara is running 70 secs || 4529529 markings, 5965213 edges, 61483 markings/sec, 70 secs
lola: sara is running 75 secs || 4840685 markings, 6445294 edges, 62231 markings/sec, 75 secs
lola: sara is running 80 secs || 5148496 markings, 6936301 edges, 61562 markings/sec, 80 secs
lola: sara is running 85 secs || 5450579 markings, 7436572 edges, 60417 markings/sec, 85 secs
lola: sara is running 90 secs || 5750883 markings, 7954305 edges, 60061 markings/sec, 90 secs
lola: sara is running 95 secs || 6033699 markings, 8453679 edges, 56563 markings/sec, 95 secs
lola: sara is running 100 secs || 6303825 markings, 8951583 edges, 54025 markings/sec, 100 secs
lola: sara is running 105 secs || 6526864 markings, 9527829 edges, 44608 markings/sec, 105 secs
lola: sara is running 110 secs || 6725764 markings, 10169412 edges, 39780 markings/sec, 110 secs
lola: sara is running 115 secs || 6938743 markings, 10766217 edges, 42596 markings/sec, 115 secs

lola: sara is running 120 secs || 7025153 markings, 11052603 edges, 17282 markings/sec, 120 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 11 will run for 614 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(malC1_15)))
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 2020 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-32-ReachabilityFireability-11.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 139 markings, 138 edges
lola: subprocess 12 will run for 768 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(malS4_15) AND NOT FIREABLE(ScertCS_0)) OR (NOT FIREABLE(malS6_24) AND NOT FIREABLE(SreqTS_19)) OR (FIREABLE(malS2_24) AND (FIREABLE(malS4_12) OR FIREABLE(SsendTS_29) OR FIREABLE(SsendTS_14))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: ========================================
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2020 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 135 literals and 25 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-32-ReachabilityFireability-12.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-PT-32-ReachabilityFireability-12.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 180258 markings, 607243 edges, 36052 markings/sec, 0 secs
lola: sara is running 5 secs || 371699 markings, 1389688 edges, 38288 markings/sec, 5 secs
lola: sara is running 10 secs || 546907 markings, 2181763 edges, 35042 markings/sec, 10 secs
lola: sara is running 15 secs || 734806 markings, 2992100 edges, 37580 markings/sec, 15 secs
lola: sara is running 20 secs || 901465 markings, 3846395 edges, 33332 markings/sec, 20 secs

lola: state equation: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 13 will run for 1014 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(malS5_24) AND FIREABLE(SsendTS_15) AND FIREABLE(SgetTS_9) AND (FIREABLE(CgenCertif_7) OR FIREABLE(CsendTS1_25) OR FIREABLE(malC1_32)) AND ((NOT FIREABLE(Sperform_4) AND NOT FIREABLE(SackCS_7)) OR (NOT FIREABLE(SreqTS_25) AND NOT FIREABLE(malS2_22))))))
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 2020 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 950 literals and 15 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-32-ReachabilityFireability-13.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-PT-32-ReachabilityFireability-13.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 259478 markings, 305136 edges, 51896 markings/sec, 0 secs
lola: sara is running 5 secs || 542491 markings, 645144 edges, 56603 markings/sec, 5 secs
lola: sara is running 10 secs || 854523 markings, 1019117 edges, 62406 markings/sec, 10 secs
lola: sara is running 15 secs || 1144995 markings, 1373757 edges, 58094 markings/sec, 15 secs
lola: sara is running 20 secs || 1446041 markings, 1754878 edges, 60209 markings/sec, 20 secs

lola: sara is running 25 secs || 1765059 markings, 2149246 edges, 63804 markings/sec, 25 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 14 will run for 1506 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(SackCS_26) OR NOT FIREABLE(CgenCertif_21) OR NOT FIREABLE(SreqTS_26) OR NOT FIREABLE(malS2_9) OR NOT FIREABLE(malS3_5) OR NOT FIREABLE(SgetTS_29) OR (FIREABLE(SsendTS_22) AND FIREABLE(malS1_3)) OR FIREABLE(CsendTS1_22))))
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 2020 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 7854 literals and 102 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-32-ReachabilityFireability-14.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-PT-32-ReachabilityFireability-14.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 212311 markings, 278217 edges, 42462 markings/sec, 0 secs
lola: sara is running 5 secs || 523040 markings, 735953 edges, 62146 markings/sec, 5 secs
lola: sara is running 10 secs || 809851 markings, 1242792 edges, 57362 markings/sec, 10 secs
lola: sara is running 15 secs || 1004004 markings, 1716416 edges, 38831 markings/sec, 15 secs
lola: sara is running 20 secs || 1196137 markings, 2253633 edges, 38427 markings/sec, 20 secs
lola: sara is running 25 secs || 1403074 markings, 2749255 edges, 41387 markings/sec, 25 secs
lola: sara is running 30 secs || 1702565 markings, 3175243 edges, 59898 markings/sec, 30 secs
lola: sara is running 35 secs || 1999502 markings, 3678083 edges, 59387 markings/sec, 35 secs
lola: sara is running 40 secs || 2210466 markings, 4147859 edges, 42193 markings/sec, 40 secs
----- Kill lola and sara stderr -----
lola: sara is running 45 secs || 2411698 markings, 4696794 edges, 40246 markings/sec, 45 secs
lola: sara is running 50 secs || 2653218 markings, 5303746 edges, 48304 markings/sec, 50 secs
lola: sara is running 55 secs || 2945419 markings, 5732587 edges, 58440 markings/sec, 55 secs
lola: sara is running 60 secs || 3231665 markings, 6236706 edges, 57249 markings/sec, 60 secs
lola: sara is running 65 secs || 3440667 markings, 6738505 edges, 41800 markings/sec, 65 secs
lola: sara is running 70 secs || 3685273 markings, 7423033 edges, 48921 markings/sec, 70 secs
lola: sara is running 75 secs || 3954349 markings, 7942111 edges, 53815 markings/sec, 75 secs
lola: sara is running 80 secs || 4247662 markings, 8424325 edges, 58663 markings/sec, 80 secs
lola: sara is running 85 secs || 4493790 markings, 8944985 edges, 49226 markings/sec, 85 secs
lola: sara is running 90 secs || 4736311 markings, 9616280 edges, 48504 markings/sec, 90 secs
lola: sara is running 95 secs || 4988271 markings, 10198684 edges, 50392 markings/sec, 95 secs
lola: sara is running 100 secs || 5277437 markings, 10669316 edges, 57833 markings/sec, 100 secs
lola: sara is running 105 secs || 5535949 markings, 11211366 edges, 51702 markings/sec, 105 secs
lola: sara is running 110 secs || 5780404 markings, 11888567 edges, 48891 markings/sec, 110 secs
lola: sara is running 115 secs || 6034066 markings, 12479550 edges, 50732 markings/sec, 115 secs
lola: sara is running 120 secs || 6314628 markings, 12955590 edges, 56112 markings/sec, 120 secs
lola: sara is running 125 secs || 6564372 markings, 13528020 edges, 49949 markings/sec, 125 secs
lola: sara is running 130 secs || 6798139 markings, 14182490 edges, 46753 markings/sec, 130 secs
lola: sara is running 135 secs || 7058501 markings, 14738094 edges, 52072 markings/sec, 135 secs
lola: sara is running 140 secs || 7334919 markings, 15242704 edges, 55284 markings/sec, 140 secs
lola: sara is running 145 secs || 7571419 markings, 15884322 edges, 47300 markings/sec, 145 secs
lola: sara is running 150 secs || 7807644 markings, 16551738 edges, 47245 markings/sec, 150 secs
lola: sara is running 155 secs || 8088816 markings, 17041204 edges, 56234 markings/sec, 155 secs
lola: sara is running 160 secs || 8343593 markings, 17627860 edges, 50955 markings/sec, 160 secs
lola: sara is running 165 secs || 8579131 markings, 18284760 edges, 47108 markings/sec, 165 secs
lola: sara is running 170 secs || 8816379 markings, 18812434 edges, 47450 markings/sec, 170 secs
lola: sara is running 175 secs || 9060997 markings, 19314773 edges, 48924 markings/sec, 175 secs
lola: sara is running 180 secs || 9294576 markings, 19955658 edges, 46716 markings/sec, 180 secs
lola: sara is running 185 secs || 9524150 markings, 20564042 edges, 45915 markings/sec, 185 secs

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 15 will run for 2822 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(malC1_17) AND NOT FIREABLE(SgetTS_27) AND FIREABLE(malS6_25) AND FIREABLE(SackCS_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 2020 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 238 literals and 34 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-32-ReachabilityFireability-15.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-PT-32-ReachabilityFireability-15.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 172323 markings, 227782 edges, 34465 markings/sec, 0 secs
lola: sara is running 5 secs || 374772 markings, 501579 edges, 40490 markings/sec, 5 secs
lola: sara is running 10 secs || 628653 markings, 857352 edges, 50776 markings/sec, 10 secs
lola: sara is running 15 secs || 925312 markings, 1287832 edges, 59332 markings/sec, 15 secs
lola: sara is running 20 secs || 1221790 markings, 1734558 edges, 59296 markings/sec, 20 secs
lola: sara is running 25 secs || 1502408 markings, 2176914 edges, 56124 markings/sec, 25 secs
lola: sara is running 30 secs || 1785185 markings, 2647279 edges, 56555 markings/sec, 30 secs
lola: sara is running 35 secs || 2076918 markings, 3137660 edges, 58347 markings/sec, 35 secs
lola: sara is running 40 secs || 2351085 markings, 3632186 edges, 54833 markings/sec, 40 secs
lola: sara is running 45 secs || 2607709 markings, 4129997 edges, 51325 markings/sec, 45 secs
lola: sara is running 50 secs || 2875133 markings, 4659357 edges, 53485 markings/sec, 50 secs
lola: sara is running 55 secs || 3126472 markings, 5202187 edges, 50268 markings/sec, 55 secs

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no unknown yes yes yes yes yes yes no yes no no yes no
FORMULA QuasiCertifProtocol-PT-32-ReachabilityFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-32-ReachabilityFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-32-ReachabilityFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-32-ReachabilityFireability-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-32-ReachabilityFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-32-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-32-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-32-ReachabilityFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-32-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-32-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-32-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-32-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-32-ReachabilityFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-32-ReachabilityFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-32-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-32-ReachabilityFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- 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-32"
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-32.tgz
mv QuasiCertifProtocol-PT-32 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-32, 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-152673581200105"
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 ;