Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
.............................
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 15K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K 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 16K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 23K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 58K 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 5.5K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 23K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 8.5K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 23K 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 949K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is QuasiCertifProtocol-PT-22, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r139-qhx2-152673581200089
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527788519069


BK_STOP 1527788587530

--------------------
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-22 as instance name.
Using QuasiCertifProtocol as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'ReachabilityCardinality', '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': 11858, 'Memory': 666.92, 'Tool': 'lola'}, {'Time': 12173, 'Memory': 704, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
ReachabilityCardinality lola QuasiCertifProtocol-PT-22...

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


checking for too many tokens
===========================================================================================
QuasiCertifProtocol-PT-22: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
ReachabilityCardinality @ QuasiCertifProtocol-PT-22 @ 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: 2322/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 1966 places, 356 transitions, 355 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 471 transition conflict sets
lola: TASK
lola: reading formula from QuasiCertifProtocol-PT-22-ReachabilityCardinality.task
lola: A (G ((s4_0 + s4_1 + s4_2 + s4_3 + s4_4 + s4_5 + s4_6 + s4_7 + s4_8 + s4_9 + s4_22 + s4_21 + s4_20 + s4_19 + s4_18 + s4_17 + s4_16 + s4_15 + s4_14 + s4_13 + s4_12 + s4_11 + s4_10 <= n6_0 + n6_1 + n6_2 + n6_3 + n6_4 + n6_5 + n6_6 + n6_7 + n6_8 + n6_9 + n6_22 + n6_21 + n6_20 + n6_19 + n6_18 + n6_17 + n6_16 + n6_15 + n6_14 + n6_13 + n6_12 + n6_11 + n6_10))) : A (G ((CstopAbort <= s6_22 + s6_21 + s6_20 + s6_19 + s6_18 + s6_17 + s6_16 + s6_15 + s6_14 + s6_13 + s6_12 + s6_11 + s6_10 + s6_0 + s6_1 + s6_2 + s6_3 + s6_4 + s6_5 + s6_6 + s6_7 + s6_8 + s6_9))) : E (F (((3 <= a3) AND (Sstart_9 + Sstart_8 + Sstart_7 + Sstart_6 + Sstart_5 + Sstart_4 + Sstart_3 + Sstart_2 + Sstart_1 + Sstart_0 + Sstart_10 + Sstart_11 + Sstart_12 + Sstart_13 + Sstart_14 + Sstart_15 + Sstart_16 + Sstart_17 + Sstart_18 + Sstart_19 + Sstart_20 + Sstart_21 + Sstart_22 <= n3_9 + n3_8 + n3_7 + n3_6 + n3_5 + n3_4 + n3_3 + n3_2 + n3_1 + n3_0 + n3_10 + n3_11 + n3_12 + n3_13 + n3_14 + n3_15 + n3_16 + n3_17 + n3_18 + n3_19 + n3_20 + n3_21 + n3_22)))) : E (F (((2 <= a4) OR (((n4_10 + n4_11 + n4_12 + n4_13 + n4_14 + n4_15 + n4_16 + n4_17 + n4_18 + n4_19 + n4_20 + n4_21 + n4_22 + n4_0 + n4_1 + n4_2 + n4_3 + n4_4 + n4_5 + n4_6 + n4_7 + n4_8 + n4_9 <= a2) OR (2 <= SstopAbort)) AND ((1 <= n4_10 + n4_11 + n4_12 + n4_13 + n4_14 + n4_15 + n4_16 + n4_17 + n4_18 + n4_19 + n4_20 + n4_21 + n4_22 + n4_0 + n4_1 + n4_2 + n4_3 + n4_4 + n4_5 + n4_6 + n4_7 + n4_8 + n4_9) OR (1 <= n3_9 + n3_8 + n3_7 + n3_6 + n3_5 + n3_4 + n3_3 + n3_2 + n3_1 + n3_0 + n3_10 + n3_11 + n3_12 + n3_13 + n3_14 + n3_15 + n3_16 + n3_17 + n3_18 + n3_19 + n3_20 + n3_21 + n3_22)))))) : A (G (((n5_10 + n5_11 + n5_12 + n5_13 + n5_14 + n5_15 + n5_16 + n5_17 + n5_18 + n5_19 + n5_20 + n5_21 + n5_22 + n5_0 + n5_1 + n5_2 + n5_3 + n5_4 + n5_5 + n5_6 + n5_7 + n5_8 + n5_9 + 1 <= Cstart_10 + Cstart_11 + Cstart_12 + Cstart_13 + Cstart_14 + Cstart_15 + Cstart_16 + Cstart_17 + Cstart_18 + Cstart_19 + Cstart_20 + Cstart_21 + Cstart_22 + Cstart_0 + Cstart_1 + Cstart_2 + Cstart_3 + Cstart_4 + Cstart_5 + Cstart_6 + Cstart_7 + Cstart_8 + Cstart_9) OR (a1 <= 0) OR (((n7_17_0 + n7_17_1 + n7_17_2 + n7_17_3 + n7_17_4 + n7_17_5 + n7_17_6 + n7_17_7 + n7_17_8 + n7_17_9 + n7_21_10 + n7_21_11 + n7_21_12 + n7_21_13 + n7_21_14 + n7_21_15 + n7_21_16 + n7_21_17 + n7_21_18 + n7_21_19 + n7_21_20 + n7_21_21 + n7_21_22 + n7_3_10 + n7_6_0 + n7_15_0 + n7_4_10 + n7_16_10 + n7_18_0 + n7_7_0 + n7_5_10 + n7_11_10 + n7_10_0 + n7_0_10 + n7_22_0 + n7_14_10 + n7_8_10 + n7_12_10 + n7_1_10 + n7_19_0 + n7_13_10 + n7_9_0 + n7_2_10 + n7_20_10 + n7_8_0 + n7_8_9 + n7_8_8 + n7_8_7 + n7_8_6 + n7_8_5 + n7_8_4 + n7_8_3 + n7_8_2 + n7_8_1 + n7_19_10 + n7_19_11 + n7_19_12 + n7_19_13 + n7_19_14 + n7_19_15 + n7_19_16 + n7_19_17 + n7_19_18 + n7_19_19 + n7_19_20 + n7_19_21 + n7_19_22 + n7_20_11 + n7_20_12 + n7_20_13 + n7_20_14 + n7_20_15 + n7_20_16 + n7_20_17 + n7_20_18 + n7_20_19 + n7_20_20 + n7_20_21 + n7_20_22 + n7_2_11 + n7_2_12 + n7_2_13 + n7_2_14 + n7_2_15 + n7_2_16 + n7_2_17 + n7_2_18 + n7_2_19 + n7_2_20 + n7_2_21 + n7_2_22 + n7_9_1 + n7_9_2 + n7_9_3 + n7_9_4 + n7_9_5 + n7_9_6 + n7_9_7 + n7_9_8 + n7_9_9 + n7_19_9 + n7_19_8 + n7_13_11 + n7_13_12 + n7_13_13 + n7_13_14 + n7_13_15 + n7_13_16 + n7_13_17 + n7_13_18 + n7_13_19 + n7_13_20 + n7_13_21 + n7_13_22 + n7_7_10 + n7_7_11 + n7_7_12 + n7_7_13 + n7_7_14 + n7_7_15 + n7_7_16 + n7_7_17 + n7_7_18 + n7_7_19 + n7_7_20 + n7_7_21 + n7_7_22 + n7_19_7 + n7_19_6 + n7_19_5 + n7_19_4 + n7_19_3 + n7_19_2 + n7_19_1 + n7_18_10 + n7_18_11 + n7_18_12 + n7_18_13 + n7_18_14 + n7_18_15 + n7_18_16 + n7_18_17 + n7_18_18 + n7_18_19 + n7_18_20 + n7_18_21 + n7_18_22 + n7_1_11 + n7_1_12 + n7_1_13 + n7_1_14 + n7_1_15 + n7_1_16 + n7_1_17 + n7_1_18 + n7_1_19 + n7_1_20 + n7_1_21 + n7_1_22 + n7_8_22 + n7_8_21 + n7_8_20 + n7_8_19 + n7_8_18 + n7_8_17 + n7_20_0 + n7_20_1 + n7_20_2 + n7_20_3 + n7_20_4 + n7_20_5 + n7_20_6 + n7_20_7 + n7_20_8 + n7_20_9 + n7_8_16 + n7_8_15 + n7_12_11 + n7_12_12 + n7_12_13 + n7_12_14 + n7_12_15 + n7_12_16 + n7_12_17 + n7_12_18 + n7_12_19 + n7_21_0 + n7_21_1 + n7_21_2 + n7_21_3 + n7_21_4 + n7_21_5 + n7_21_6 + n7_21_7 + n7_21_8 + n7_21_9 + n7_12_20 + n7_12_21 + n7_12_22 + n7_6_10 + n7_6_11 + n7_6_12 + n7_6_13 + n7_6_14 + n7_6_15 + n7_6_16 + n7_6_17 + n7_6_18 + n7_6_19 + n7_6_20 + n7_6_21 + n7_6_22 + n7_8_14 + n7_8_13 + n7_8_12 + n7_8_11 + n7_14_22 + n7_14_21 + n7_14_20 + n7_14_19 + n7_14_18 + n7_14_17 + n7_14_16 + n7_14_15 + n7_14_14 + n7_14_13 + n7_14_12 + n7_14_11 + n7_22_1 + n7_22_2 + n7_22_3 + n7_22_4 + n7_22_5 + n7_22_6 + n7_22_7 + n7_22_8 + n7_22_9 + n7_17_10 + n7_17_11 + n7_17_12 + n7_17_13 + n7_17_14 + n7_17_15 + n7_17_16 + n7_17_17 + n7_17_18 + n7_17_19 + n7_17_20 + n7_17_21 + n7_17_22 + n7_0_11 + n7_0_12 + n7_0_13 + n7_0_14 + n7_0_15 + n7_0_16 + n7_0_17 + n7_0_18 + n7_0_19 + n7_0_20 + n7_0_21 + n7_0_22 + n7_10_1 + n7_10_2 + n7_10_3 + n7_10_4 + n7_10_5 + n7_10_6 + n7_10_7 + n7_10_8 + n7_10_9 + n7_11_11 + n7_11_12 + n7_11_13 + n7_11_14 + n7_11_15 + n7_11_16 + n7_11_17 + n7_11_18 + n7_11_19 + n7_11_0 + n7_11_1 + n7_11_2 + n7_11_3 + n7_11_4 + n7_11_5 + n7_11_6 + n7_11_7 + n7_11_8 + n7_11_9 + n7_11_20 + n7_11_21 + n7_11_22 + n7_5_11 + n7_5_12 + n7_5_13 + n7_5_14 + n7_5_15 + n7_5_16 + n7_5_17 + n7_5_18 + n7_5_19 + n7_5_20 + n7_5_21 + n7_5_22 + n7_7_9 + n7_7_8 + n7_7_7 + n7_7_6 + n7_7_5 + n7_7_4 + n7_7_3 + n7_7_2 + n7_7_1 + n7_18_9 + n7_18_8 + n7_18_7 + n7_18_6 + n7_0_0 + n7_0_1 + n7_0_2 + n7_0_3 + n7_0_4 + n7_0_5 + n7_0_6 + n7_0_7 + n7_0_8 + n7_0_9 + n7_18_5 + n7_18_4 + n7_18_3 + n7_18_2 + n7_18_1 + n7_12_0 + n7_12_1 + n7_12_2 + n7_12_3 + n7_12_4 + n7_12_5 + n7_12_6 + n7_12_7 + n7_12_8 + n7_12_9 + n7_1_0 + n7_1_1 + n7_1_2 + n7_1_3 + n7_1_4 + n7_1_5 + n7_1_6 + n7_1_7 + n7_1_8 + n7_1_9 + n7_16_11 + n7_16_12 + n7_16_13 + n7_16_14 + n7_16_15 + n7_16_16 + n7_16_17 + n7_16_18 + n7_16_19 + n7_16_20 + n7_16_21 + n7_16_22 + n7_13_0 + n7_13_1 + n7_13_2 + n7_13_3 + n7_13_4 + n7_13_5 + n7_13_6 + n7_13_7 + n7_13_8 + n7_13_9 + n7_2_0 + n7_2_1 + n7_2_2 + n7_2_3 + n7_2_4 + n7_2_5 + n7_2_6 + n7_2_7 + n7_2_8 + n7_2_9 + n7_14_0 + n7_14_1 + n7_14_2 + n7_14_3 + n7_14_4 + n7_14_5 + n7_14_6 + n7_14_7 + n7_14_8 + n7_14_9 + n7_10_10 + n7_10_11 + n7_10_12 + n7_10_13 + n7_10_14 + n7_10_15 + n7_10_16 + n7_10_17 + n7_10_18 + n7_10_19 + n7_10_20 + n7_10_21 + n7_10_22 + n7_22_10 + n7_22_11 + n7_22_12 + n7_22_13 + n7_22_14 + n7_22_15 + n7_22_16 + n7_22_17 + n7_22_18 + n7_22_19 + n7_22_20 + n7_22_21 + n7_22_22 + n7_4_11 + n7_4_12 + n7_4_13 + n7_4_14 + n7_4_15 + n7_4_16 + n7_4_17 + n7_4_18 + n7_4_19 + n7_4_20 + n7_4_21 + n7_4_22 + n7_3_0 + n7_3_1 + n7_3_2 + n7_3_3 + n7_3_4 + n7_3_5 + n7_3_6 + n7_3_7 + n7_3_8 + n7_3_9 + n7_6_9 + n7_15_1 + n7_15_2 + n7_15_3 + n7_15_4 + n7_15_5 + n7_15_6 + n7_15_7 + n7_15_8 + n7_15_9 + n7_6_8 + n7_6_7 + n7_6_6 + n7_6_5 + n7_6_4 + n7_6_3 + n7_6_2 + n7_6_1 + n7_4_0 + n7_4_1 + n7_4_2 + n7_4_3 + n7_4_4 + n7_4_5 + n7_4_6 + n7_4_7 + n7_4_8 + n7_4_9 + n7_3_22 + n7_3_21 + n7_3_20 + n7_15_10 + n7_15_11 + n7_15_12 + n7_15_13 + n7_15_14 + n7_15_15 + n7_15_16 + n7_15_17 + n7_15_18 + n7_15_19 + n7_15_20 + n7_15_21 + n7_15_22 + n7_9_10 + n7_9_11 + n7_9_12 + n7_9_13 + n7_9_14 + n7_9_15 + n7_9_16 + n7_9_17 + n7_9_18 + n7_9_19 + n7_9_20 + n7_9_21 + n7_9_22 + n7_16_0 + n7_16_1 + n7_16_2 + n7_16_3 + n7_16_4 + n7_16_5 + n7_16_6 + n7_16_7 + n7_16_8 + n7_16_9 + n7_3_19 + n7_3_18 + n7_3_17 + n7_3_16 + n7_3_15 + n7_3_14 + n7_3_13 + n7_3_12 + n7_3_11 + n7_5_0 + n7_5_1 + n7_5_2 + n7_5_3 + n7_5_4 + n7_5_5 + n7_5_6 + n7_5_7 + n7_5_8 + n7_5_9 <= n3_9 + n3_8 + n3_7 + n3_6 + n3_5 + n3_4 + n3_3 + n3_2 + n3_1 + n3_0 + n3_10 + n3_11 + n3_12 + n3_13 + n3_14 + n3_15 + n3_16 + n3_17 + n3_18 + n3_19 + n3_20 + n3_21 + n3_22) OR (2 <= n1_9 + n1_8 + n1_7 + n1_6 + n1_5 + n1_4 + n1_3 + n1_2 + n1_1 + n1_0 + n1_10 + n1_11 + n1_12 + n1_13 + n1_14 + n1_15 + n1_16 + n1_17 + n1_18 + n1_19 + n1_20 + n1_21 + n1_22)) AND (s6_22 + s6_21 + s6_20 + s6_19 + s6_18 + s6_17 + s6_16 + s6_15 + s6_14 + s6_13 + s6_12 + s6_11 + s6_10 + s6_0 + s6_1 + s6_2 + s6_3 + s6_4 + s6_5 + s6_6 + s6_7 + s6_8 + s6_9 <= s2_9 + s2_8 + s2_7 + s2_6 + s2_5 + s2_4 + s2_3 + s2_2 + s2_1 + s2_0 + s2_22 + s2_21 + s2_20 + s2_19 + s2_18 + s2_17 + s2_16 + s2_15 + s2_14 + s2_13 + s2_12 + s2_11 + s2_10))))) : A (G ((CstopOK_0 + CstopOK_1 + CstopOK_2 + CstopOK_3 + CstopOK_4 + CstopOK_5 + CstopOK_6 + CstopOK_7 + CstopOK_8 + CstopOK_9 + CstopOK_10 + CstopOK_11 + CstopOK_12 + CstopOK_13 + CstopOK_14 + CstopOK_15 + CstopOK_16 + CstopOK_17 + CstopOK_18 + CstopOK_19 + CstopOK_20 + CstopOK_21 + CstopOK_22 <= a4))) : E (F (((a2 <= SstopAbort) AND (1 <= CstopAbort)))) : A (G (((CstopOK_0 + CstopOK_1 + CstopOK_2 + CstopOK_3 + CstopOK_4 + CstopOK_5 + CstopOK_6 + CstopOK_7 + CstopOK_8 + CstopOK_9 + CstopOK_10 + CstopOK_11 + CstopOK_12 + CstopOK_13 + CstopOK_14 + CstopOK_15 + CstopOK_16 + CstopOK_17 + CstopOK_18 + CstopOK_19 + CstopOK_20 + CstopOK_21 + CstopOK_22 + 1 <= Sstart_9 + Sstart_8 + Sstart_7 + Sstart_6 + Sstart_5 + Sstart_4 + Sstart_3 + Sstart_2 + Sstart_1 + Sstart_0 + Sstart_10 + Sstart_11 + Sstart_12 + Sstart_13 + Sstart_14 + Sstart_15 + Sstart_16 + Sstart_17 + Sstart_18 + Sstart_19 + Sstart_20 + Sstart_21 + Sstart_22) AND (AstopOK + 1 <= Cstart_10 + Cstart_11 + Cstart_12 + Cstart_13 + Cstart_14 + Cstart_15 + Cstart_16 + Cstart_17 + Cstart_18 + Cstart_19 + Cstart_20 + Cstart_21 + Cstart_22 + Cstart_0 + Cstart_1 + Cstart_2 + Cstart_3 + Cstart_4 + Cstart_5 + Cstart_6 + Cstart_7 + Cstart_8 + Cstart_9) AND ((c1_8 + c1_7 + c1_6 + c1_5 + c1_4 + c1_3 + c1_2 + c1_1 + c1_0 + c1_22 + c1_21 + c1_20 + c1_19 + c1_18 + c1_17 + c1_16 + c1_15 + c1_14 + c1_13 + c1_12 + c1_11 + c1_10 + c1_9 <= 1) OR (SstopAbort + 1 <= CstopOK_0 + CstopOK_1 + CstopOK_2 + CstopOK_3 + CstopOK_4 + CstopOK_5 + CstopOK_6 + CstopOK_7 + CstopOK_8 + CstopOK_9 + CstopOK_10 + CstopOK_11 + CstopOK_12 + CstopOK_13 + CstopOK_14 + CstopOK_15 + CstopOK_16 + CstopOK_17 + CstopOK_18 + CstopOK_19 + CstopOK_20 + CstopOK_21 + CstopOK_22))))) : E (F ((((n9_10_8 <= n9_0_10) OR (2 <= n9_16_12)) AND (s3_13 <= 0) AND (n8_11_8 <= n8_19_17) AND (2 <= n7_2_19) AND (n8_22_0 + 1 <= Cstart_10)))) : E (F (((s4_12 <= 0) AND (n8_11_15 <= 1) AND (n8_21_20 + 1 <= s4_5)))) : A (G (((n7_15_10 <= 2) OR (n9_21_19 + 1 <= s2_19) OR ((n9_14_5 <= 2) AND (n1_5 + 1 <= n8_2_0))))) : A (G (((3 <= n8_16_15) OR (2 <= n8_14_15) OR (n8_22_15 <= CstopOK_22)))) : A (G ((n9_19_13 <= n7_9_1))) : A (G (((1 <= n9_1_1) OR (n9_15_0 <= n8_13_7) OR (n9_2_19 <= 2) OR (n7_12_3 <= n9_13_1)))) : E (F (((n9_14_6 <= 0) AND (Sstart_21 + 1 <= n8_22_7) AND ((n8_20_21 <= 1) OR (n8_10_0 + 1 <= n9_21_0))))) : E (F ((n7_20_16 + 1 <= n3_19)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((s4_0 + s4_1 + s4_2 + s4_3 + s4_4 + s4_5 + s4_6 + s4_7 + s4_8 + s4_9 + s4_22 + s4_21 + s4_20 + s4_19 + s4_18 + s4_17 + s4_16 + s4_15 + s4_14 + s4_13 + s4_12 + s4_11 + s4_10 <= n6_0 + n6_1 + n6_2 + n6_3 + n6_4 + n6_5 + n6_6 + n6_7 + n6_8 + n6_9 + n6_22 + n6_21 + n6_20 + n6_19 + n6_18 + n6_17 + n6_16 + n6_15 + n6_14 + n6_13 + n6_12 + n6_11 + n6_10)))
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 1420 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-22-ReachabilityCardinality.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 76 markings, 75 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((CstopAbort <= s6_22 + s6_21 + s6_20 + s6_19 + s6_18 + s6_17 + s6_16 + s6_15 + s6_14 + s6_13 + s6_12 + s6_11 + s6_10 + s6_0 + s6_1 + s6_2 + s6_3 + s6_4 + s6_5 + s6_6 + s6_7 + s6_8 + s6_9)))
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 1420 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-22-ReachabilityCardinality.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 100 markings, 99 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= a3) AND (Sstart_9 + Sstart_8 + Sstart_7 + Sstart_6 + Sstart_5 + Sstart_4 + Sstart_3 + Sstart_2 + Sstart_1 + Sstart_0 + Sstart_10 + Sstart_11 + Sstart_12 + Sstart_13 + Sstart_14 + Sstart_15 + Sstart_16 + Sstart_17 + Sstart_18 + Sstart_19 + Sstart_20 + Sstart_21 + Sstart_22 <= n3_9 + n3_8 + n3_7 + n3_6 + n3_5 + n3_4 + n3_3 + n3_2 + n3_1 + n3_0 + n3_10 + n3_11 + n3_12 + n3_13 + n3_14 + n... (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 1420 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-22-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-PT-22-ReachabilityCardinality-2.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 3 will run for 271 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= a4) OR (((n4_10 + n4_11 + n4_12 + n4_13 + n4_14 + n4_15 + n4_16 + n4_17 + n4_18 + n4_19 + n4_20 + n4_21 + n4_22 + n4_0 + n4_1 + n4_2 + n4_3 + n4_4 + n4_5 + n4_6 + n4_7 + n4_8 + n4_9 <= a2) OR (2 <= SstopAbort)) AND ((1 <= n4_10 + n4_11 + n4_12 + n4_13 + n4_14 + n4_15 + n4_16 + n4_17 + n4_18 + n4_19 + n4_20 + n4_21 + n4_22 + n4_0 + n4_1 + n4_2 + n4_3 + n4_4 + n4_5 + n4_6 + n4_7 + n4_... (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 1420 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 9 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-22-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 27 markings, 26 edges
lola: ========================================lola:
subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((n5_10 + n5_11 + n5_12 + n5_13 + n5_14 + n5_15 + n5_16 + n5_17 + n5_18 + n5_19 + n5_20 + n5_21 + n5_22 + n5_0 + n5_1 + n5_2 + n5_3 + n5_4 + n5_5 + n5_6 + n5_7 + n5_8 + n5_9 + 1 <= Cstart_10 + Cstart_11 + Cstart_12 + Cstart_13 + Cstart_14 + Cstart_15 + Cstart_16 + Cstart_17 + Cstart_18 + Cstart_19 + Cstart_20 + Cstart_21 + Cstart_22 + Cstart_0 + Cstart_1 + Cstart_2 + Cstart_3 + Cstart_4 + Cs... (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 1420 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 7 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-22-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-PT-22-ReachabilityCardinality-4.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 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((CstopOK_0 + CstopOK_1 + CstopOK_2 + CstopOK_3 + CstopOK_4 + CstopOK_5 + CstopOK_6 + CstopOK_7 + CstopOK_8 + CstopOK_9 + CstopOK_10 + CstopOK_11 + CstopOK_12 + CstopOK_13 + CstopOK_14 + CstopOK_15 + CstopOK_16 + CstopOK_17 + CstopOK_18 + CstopOK_19 + CstopOK_20 + CstopOK_21 + CstopOK_22 <= a4)))
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 1420 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-22-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 169 markings, 168 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((a2 <= SstopAbort) AND (1 <= CstopAbort))))
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 1420 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-22-ReachabilityCardinality-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: 101 markings, 100 edges
lola: ========================================
lola: subprocess 7 will run for 392 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((CstopOK_0 + CstopOK_1 + CstopOK_2 + CstopOK_3 + CstopOK_4 + CstopOK_5 + CstopOK_6 + CstopOK_7 + CstopOK_8 + CstopOK_9 + CstopOK_10 + CstopOK_11 + CstopOK_12 + CstopOK_13 + CstopOK_14 + CstopOK_15 + CstopOK_16 + CstopOK_17 + CstopOK_18 + CstopOK_19 + CstopOK_20 + CstopOK_21 + CstopOK_22 + 1 <= Sstart_9 + Sstart_8 + Sstart_7 + Sstart_6 + Sstart_5 + Sstart_4 + Sstart_3 + Sstart_2 + Sstart_1 +... (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 1420 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 4 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-22-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 25 markings, 24 edges
lola: ========================================
lola: subprocess 8 will run for 441 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((n9_10_8 <= n9_0_10) OR (2 <= n9_16_12)) AND (s3_13 <= 0) AND (n8_11_8 <= n8_19_17) AND (2 <= n7_2_19) AND (n8_22_0 + 1 <= Cstart_10))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1420 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 10 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-22-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-PT-22-ReachabilityCardinality-8.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 9 will run for 504 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((s4_12 <= 0) AND (n8_11_15 <= 1) AND (n8_21_20 + 1 <= s4_5))))
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 1420 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 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-22-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-PT-22-ReachabilityCardinality-9.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 53 markings, 52 edges
lola: ========================================
lola: subprocess 10 will run for 588 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((n7_15_10 <= 2) OR (n9_21_19 + 1 <= s2_19) OR ((n9_14_5 <= 2) AND (n1_5 + 1 <= n8_2_0)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1420 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 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-22-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-PT-22-ReachabilityCardinality-10.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 11 will run for 705 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((3 <= n8_16_15) OR (2 <= n8_14_15) OR (n8_22_15 <= CstopOK_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 1420 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 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-22-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 99 markings, 98 edges
lola: ========================================
lola: subprocess 12 will run for 882 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((n9_19_13 <= n7_9_1)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1420 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-22-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-PT-22-ReachabilityCardinality-12.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 123 markings, 122 edges
lola: subprocess 13 will run for 1176 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= n9_1_1) OR (n9_15_0 <= n8_13_7) OR (n9_2_19 <= 2) OR (n7_12_3 <= n9_13_1))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1420 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 4 literals and 1 conjunctive subformulas
lola: lola: ========================================
state equation: write sara problem file to QuasiCertifProtocol-PT-22-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-PT-22-ReachabilityCardinality-13.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 14 will run for 1763 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((n9_14_6 <= 0) AND (Sstart_21 + 1 <= n8_22_7) AND ((n8_20_21 <= 1) OR (n8_10_0 + 1 <= n9_21_0)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1420 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 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-22-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-PT-22-ReachabilityCardinality-14.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 15 will run for 3525 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((n7_20_16 + 1 <= n3_19)))
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 1420 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-22-ReachabilityCardinality-15.sara
lola: state equation: calling and running saralola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 27 markings, 26 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no yes yes no yes no no yes yes no no yes yes yes
FORMULA QuasiCertifProtocol-PT-22-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-22-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-22-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-22-ReachabilityCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-22-ReachabilityCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-22-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-22-ReachabilityCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-22-ReachabilityCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-22-ReachabilityCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-22-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-22-ReachabilityCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-22-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-22-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-22-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-22-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-22-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stdout -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="QuasiCertifProtocol-PT-22"
export BK_EXAMINATION="ReachabilityCardinality"
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-22.tgz
mv QuasiCertifProtocol-PT-22 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-22, examination is ReachabilityCardinality"
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-152673581200089"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.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 ;