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.4M
-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 18K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 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-full
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 r138-qhx2-152673580500105
=====================================================================

--------------------
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 1527148746846


BK_STOP 1527149585450

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

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-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...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
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 @ 3537 seconds
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3537 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: 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: ========================================
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 || 276965 markings, 550894 edges, 55393 markings/sec, 0 secs
lola: sara is running 5 secs || 553711 markings, 1182280 edges, 55349 markings/sec, 5 secs
lola: sara is running 10 secs || 826990 markings, 1797505 edges, 54656 markings/sec, 10 secs
lola: sara is running 15 secs || 1093266 markings, 2433316 edges, 53255 markings/sec, 15 secs
lola: sara is running 20 secs || 1359772 markings, 3078453 edges, 53301 markings/sec, 20 secs
lola: sara is running 25 secs || 1618776 markings, 3748275 edges, 51801 markings/sec, 25 secs
lola: sara is running 30 secs || 1850445 markings, 4384347 edges, 46334 markings/sec, 30 secs
lola: sara is running 35 secs || 2097881 markings, 4926093 edges, 49487 markings/sec, 35 secs
lola: sara is running 40 secs || 2328823 markings, 5484469 edges, 46188 markings/sec, 40 secs
lola: sara is running 45 secs || 2556965 markings, 6038369 edges, 45628 markings/sec, 45 secs
lola: sara is running 50 secs || 2788219 markings, 6627996 edges, 46251 markings/sec, 50 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) || 111202 markings, 315567 edges, 22240 markings/sec, 0 secs
lola: sara not yet started (preprocessing) || 248605 markings, 740043 edges, 27481 markings/sec, 5 secs
lola: sara not yet started (preprocessing) || 430895 markings, 1353043 edges, 36458 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) || 658279 markings, 2137152 edges, 45477 markings/sec, 15 secs
lola: sara not yet started (preprocessing) || 884231 markings, 2975709 edges, 45190 markings/sec, 20 secs
lola: sara not yet started (preprocessing) || 1104691 markings, 3800326 edges, 44092 markings/sec, 25 secs
lola: sara not yet started (preprocessing) || 1320450 markings, 4543883 edges, 43152 markings/sec, 30 secs
lola: sara not yet started (preprocessing) || 1525681 markings, 5304045 edges, 41046 markings/sec, 35 secs
lola: sara not yet started (preprocessing) || 1731366 markings, 6116660 edges, 41137 markings/sec, 40 secs
lola: sara not yet started (preprocessing) || 1937792 markings, 6876266 edges, 41285 markings/sec, 45 secs
lola: sara not yet started (preprocessing) || 2132404 markings, 7666037 edges, 38922 markings/sec, 50 secs
lola: sara not yet started (preprocessing) || 2335052 markings, 8459871 edges, 40530 markings/sec, 55 secs
lola: sara not yet started (preprocessing) || 2521141 markings, 9242133 edges, 37218 markings/sec, 60 secs
lola: sara not yet started (preprocessing) || 2697568 markings, 10034411 edges, 35285 markings/sec, 65 secs
lola: sara not yet started (preprocessing) || 2900945 markings, 10850878 edges, 40675 markings/sec, 70 secs
lola: sara not yet started (preprocessing) || 3133217 markings, 11651983 edges, 46454 markings/sec, 75 secs
lola: sara not yet started (preprocessing) || 3345649 markings, 12449761 edges, 42486 markings/sec, 80 secs
lola: sara not yet started (preprocessing) || 3547422 markings, 13234459 edges, 40355 markings/sec, 85 secs
lola: sara not yet started (preprocessing) || 3747555 markings, 13977723 edges, 40027 markings/sec, 90 secs
lola: sara not yet started (preprocessing) || 3939749 markings, 14757116 edges, 38439 markings/sec, 95 secs
lola: sara not yet started (preprocessing) || 4133163 markings, 15523346 edges, 38683 markings/sec, 100 secs
lola: sara not yet started (preprocessing) || 4311382 markings, 16270226 edges, 35644 markings/sec, 105 secs
lola: sara not yet started (preprocessing) || 4495522 markings, 17095871 edges, 36828 markings/sec, 110 secs
lola: sara not yet started (preprocessing) || 4677660 markings, 17863634 edges, 36428 markings/sec, 115 secs
lola: sara not yet started (preprocessing) || 4866914 markings, 18563393 edges, 37851 markings/sec, 120 secs
lola: sara not yet started (preprocessing) || 5040042 markings, 19280634 edges, 34626 markings/sec, 125 secs
lola: sara not yet started (preprocessing) || 5221301 markings, 19971549 edges, 36252 markings/sec, 130 secs
lola: sara not yet started (preprocessing) || 5404028 markings, 20735288 edges, 36545 markings/sec, 135 secs
lola: sara not yet started (preprocessing) || 5578204 markings, 21515869 edges, 34835 markings/sec, 140 secs
lola: sara not yet started (preprocessing) || 5750810 markings, 22308659 edges, 34521 markings/sec, 145 secs
lola: sara not yet started (preprocessing) || 5942048 markings, 23055840 edges, 38248 markings/sec, 150 secs
lola: sara not yet started (preprocessing) || 6122392 markings, 23808751 edges, 36069 markings/sec, 155 secs
lola: sara not yet started (preprocessing) || 6296624 markings, 24590479 edges, 34846 markings/sec, 160 secs
lola: sara not yet started (preprocessing) || 6469735 markings, 25387162 edges, 34622 markings/sec, 165 secs
lola: sara not yet started (preprocessing) || 6636791 markings, 26104331 edges, 33411 markings/sec, 170 secs
lola: sara not yet started (preprocessing) || 6804435 markings, 26901406 edges, 33529 markings/sec, 175 secs
lola: sara not yet started (preprocessing) || 6979353 markings, 27699462 edges, 34984 markings/sec, 180 secs
lola: sara not yet started (preprocessing) || 7138191 markings, 28483122 edges, 31768 markings/sec, 185 secs
lola: sara not yet started (preprocessing) || 7286586 markings, 29244122 edges, 29679 markings/sec, 190 secs
lola: sara not yet started (preprocessing) || 7471353 markings, 30051053 edges, 36953 markings/sec, 195 secs
lola: sara not yet started (preprocessing) || 7701952 markings, 30840296 edges, 46120 markings/sec, 200 secs
lola: sara not yet started (preprocessing) || 7913135 markings, 31621520 edges, 42237 markings/sec, 205 secs
lola: sara not yet started (preprocessing) || 8115910 markings, 32421841 edges, 40555 markings/sec, 210 secs
lola: sara not yet started (preprocessing) || 8319227 markings, 33171306 edges, 40663 markings/sec, 215 secs
lola: sara not yet started (preprocessing) || 8514337 markings, 33963517 edges, 39022 markings/sec, 220 secs
lola: sara not yet started (preprocessing) || 8709939 markings, 34728297 edges, 39120 markings/sec, 225 secs
lola: sara not yet started (preprocessing) || 8897687 markings, 35517461 edges, 37550 markings/sec, 230 secs
lola: sara not yet started (preprocessing) || 9080197 markings, 36335286 edges, 36502 markings/sec, 235 secs
lola: sara not yet started (preprocessing) || 9265092 markings, 37116147 edges, 36979 markings/sec, 240 secs
lola: sara not yet started (preprocessing) || 9459784 markings, 37835750 edges, 38938 markings/sec, 245 secs
lola: sara not yet started (preprocessing) || 9630064 markings, 38541327 edges, 34056 markings/sec, 250 secs
lola: sara not yet started (preprocessing) || 9806332 markings, 39213236 edges, 35254 markings/sec, 255 secs
lola: sara not yet started (preprocessing) || 9972887 markings, 39910455 edges, 33311 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: 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 321 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 || 110948 markings, 314801 edges, 22190 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 || 286312 markings, 336528 edges, 57262 markings/sec, 0 secs
lola: sara is running 5 secs || 575695 markings, 683676 edges, 57877 markings/sec, 5 secs
lola: sara is running 10 secs || 871311 markings, 1040411 edges, 59123 markings/sec, 10 secs
lola: sara is running 15 secs || 1171033 markings, 1405774 edges, 59944 markings/sec, 15 secs
lola: sara is running 20 secs || 1462691 markings, 1777427 edges, 58332 markings/sec, 20 secs
lola: sara is running 25 secs || 1780092 markings, 2168320 edges, 63480 markings/sec, 25 secs
lola: sara is running 30 secs || 2068308 markings, 2538264 edges, 57643 markings/sec, 30 secs
lola: sara is running 35 secs || 2359035 markings, 2923433 edges, 58145 markings/sec, 35 secs
lola: sara is running 40 secs || 2678993 markings, 3337979 edges, 63992 markings/sec, 40 secs
lola: sara is running 45 secs || 2995694 markings, 3764219 edges, 63340 markings/sec, 45 secs
lola: sara is running 50 secs || 3308423 markings, 4194704 edges, 62546 markings/sec, 50 secs
lola: sara is running 55 secs || 3618437 markings, 4636649 edges, 62003 markings/sec, 55 secs
lola: sara is running 60 secs || 3930943 markings, 5077638 edges, 62501 markings/sec, 60 secs
lola: sara is running 65 secs || 4249499 markings, 5542483 edges, 63711 markings/sec, 65 secs
lola: sara is running 70 secs || 4561592 markings, 6011859 edges, 62419 markings/sec, 70 secs
lola: sara is running 75 secs || 4863717 markings, 6483390 edges, 60425 markings/sec, 75 secs
lola: sara is running 80 secs || 5168255 markings, 6969999 edges, 60908 markings/sec, 80 secs
lola: sara is running 85 secs || 5464328 markings, 7460753 edges, 59215 markings/sec, 85 secs
lola: sara is running 90 secs || 5765494 markings, 7982927 edges, 60233 markings/sec, 90 secs
lola: sara is running 95 secs || 6055537 markings, 8493330 edges, 58009 markings/sec, 95 secs
lola: sara is running 100 secs || 6324369 markings, 8988813 edges, 53766 markings/sec, 100 secs
lola: sara is running 105 secs || 6538554 markings, 9571143 edges, 42837 markings/sec, 105 secs
lola: sara is running 110 secs || 6727946 markings, 10174643 edges, 37878 markings/sec, 110 secs
lola: sara is running 115 secs || 6939818 markings, 10769286 edges, 42374 markings/sec, 115 secs
lola: sara is running 120 secs || 7134924 markings, 11407644 edges, 39021 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: ========================================
lola: subprocess 12 will run for 767 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: 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 || 181150 markings, 613220 edges, 36230 markings/sec, 0 secs
lola: sara is running 5 secs || 364962 markings, 1361472 edges, 36762 markings/sec, 5 secs
lola: sara is running 10 secs || 542772 markings, 2140747 edges, 35562 markings/sec, 10 secs
lola: sara is running 15 secs || 719308 markings, 2913563 edges, 35307 markings/sec, 15 secs
lola: sara is running 20 secs || 888086 markings, 3761589 edges, 33756 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 1013 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 || 258402 markings, 303926 edges, 51680 markings/sec, 0 secs
lola: sara is running 5 secs || 533014 markings, 634255 edges, 54922 markings/sec, 5 secs
lola: sara is running 10 secs || 844870 markings, 1006935 edges, 62371 markings/sec, 10 secs
lola: sara is running 15 secs || 1136019 markings, 1362928 edges, 58230 markings/sec, 15 secs
lola: sara is running 20 secs || 1444309 markings, 1752467 edges, 61658 markings/sec, 20 secs
lola: sara is running 25 secs || 1765428 markings, 2149699 edges, 64224 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: subprocess 14 will run for 1505 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: ========================================
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 || 198926 markings, 258360 edges, 39785 markings/sec, 0 secs
lola: sara is running 5 secs || 493811 markings, 688805 edges, 58977 markings/sec, 5 secs
lola: sara is running 10 secs || 783643 markings, 1191774 edges, 57966 markings/sec, 10 secs
lola: sara is running 15 secs || 988736 markings, 1679412 edges, 41019 markings/sec, 15 secs
lola: sara is running 20 secs || 1173951 markings, 2188326 edges, 37043 markings/sec, 20 secs
lola: sara is running 25 secs || 1361525 markings, 2692809 edges, 37515 markings/sec, 25 secs
lola: sara is running 30 secs || 1643677 markings, 3086136 edges, 56430 markings/sec, 30 secs
lola: sara is running 35 secs || 1928560 markings, 3547619 edges, 56977 markings/sec, 35 secs
lola: sara is running 40 secs || 2154380 markings, 3988274 edges, 45164 markings/sec, 40 secs
lola: sara is running 45 secs || 2333325 markings, 4499259 edges, 35789 markings/sec, 45 secs
lola: sara is running 50 secs || 2565294 markings, 5152395 edges, 46394 markings/sec, 50 secs
lola: sara is running 55 secs || 2840280 markings, 5571349 edges, 54997 markings/sec, 55 secs
lola: sara is running 60 secs || 3127501 markings, 6041060 edges, 57444 markings/sec, 60 secs
lola: sara is running 65 secs || 3362690 markings, 6526889 edges, 47038 markings/sec, 65 secs
lola: sara is running 70 secs || 3593773 markings, 7159816 edges, 46217 markings/sec, 70 secs
lola: sara is running 75 secs || 3833034 markings, 7765643 edges, 47852 markings/sec, 75 secs
lola: sara is running 80 secs || 4130923 markings, 8220926 edges, 59578 markings/sec, 80 secs
lola: sara is running 85 secs || 4408086 markings, 8727757 edges, 55433 markings/sec, 85 secs
lola: sara is running 90 secs || 4638033 markings, 9360972 edges, 45989 markings/sec, 90 secs
lola: sara is running 95 secs || 4887711 markings, 10052021 edges, 49936 markings/sec, 95 secs
lola: sara is running 100 secs || 5176457 markings, 10496008 edges, 57749 markings/sec, 100 secs
lola: sara is running 105 secs || 5447853 markings, 10991631 edges, 54279 markings/sec, 105 secs
lola: sara is running 110 secs || 5683235 markings, 11635471 edges, 47076 markings/sec, 110 secs
lola: sara is running 115 secs || 5919835 markings, 12309706 edges, 47320 markings/sec, 115 secs
lola: sara is running 120 secs || 6216120 markings, 12780051 edges, 59257 markings/sec, 120 secs
lola: sara is running 125 secs || 6485960 markings, 13309722 edges, 53968 markings/sec, 125 secs
lola: sara is running 130 secs || 6725656 markings, 13968302 edges, 47939 markings/sec, 130 secs
lola: sara is running 135 secs || 6964920 markings, 14589174 edges, 47853 markings/sec, 135 secs
lola: sara is running 140 secs || 7249602 markings, 15076343 edges, 56936 markings/sec, 140 secs
lola: sara is running 145 secs || 7504584 markings, 15682905 edges, 50996 markings/sec, 145 secs
lola: sara is running 150 secs || 7747850 markings, 16363177 edges, 48653 markings/sec, 150 secs
lola: sara is running 155 secs || 8016337 markings, 16906572 edges, 53697 markings/sec, 155 secs
lola: sara is running 160 secs || 8280303 markings, 17453985 edges, 52793 markings/sec, 160 secs
lola: sara is running 165 secs || 8508100 markings, 18084854 edges, 45559 markings/sec, 165 secs
lola: sara is running 170 secs || 8743679 markings, 18686346 edges, 47116 markings/sec, 170 secs
lola: sara is running 175 secs || 9011807 markings, 19184895 edges, 53626 markings/sec, 175 secs
lola: sara is running 180 secs || 9242188 markings, 19818899 edges, 46076 markings/sec, 180 secs

lola: sara is running 185 secs || 9468570 markings, 20468989 edges, 45276 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 2818 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 || 174110 markings, 230373 edges, 34822 markings/sec, 0 secs
lola: sara is running 5 secs || 375969 markings, 503152 edges, 40372 markings/sec, 5 secs
lola: sara is running 10 secs || 637196 markings, 869362 edges, 52245 markings/sec, 10 secs
lola: sara is running 15 secs || 952543 markings, 1328830 edges, 63069 markings/sec, 15 secs
lola: sara is running 20 secs || 1260312 markings, 1796110 edges, 61554 markings/sec, 20 secs
lola: sara is running 25 secs || 1551391 markings, 2264551 edges, 58216 markings/sec, 25 secs
lola: sara is running 30 secs || 1846290 markings, 2741101 edges, 58980 markings/sec, 30 secs
lola: sara is running 35 secs || 2128729 markings, 3229294 edges, 56488 markings/sec, 35 secs
lola: sara is running 40 secs || 2397126 markings, 3723504 edges, 53679 markings/sec, 40 secs
lola: sara is running 45 secs || 2664592 markings, 4235474 edges, 53493 markings/sec, 45 secs
lola: sara is running 50 secs || 2928747 markings, 4770960 edges, 52831 markings/sec, 50 secs
lola: sara is running 55 secs || 3170503 markings, 5304686 edges, 48351 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 -----
----- 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-32"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="irma4mcc-full"
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-full"
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 r138-qhx2-152673580500105"
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 ;