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 932K
-rw-r--r-- 1 mcc users 32K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:49 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 15 18:49 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 16K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 20K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 27K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 71K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 110 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 348 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 38K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 121K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.2K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:49 equiv_col
-rw-r--r-- 1 mcc users 3 May 15 18:49 instance
-rw-r--r-- 1 mcc users 6 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 279K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is CSRepetitions-PT-05, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r030-ebro-152646308600460
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526776640292


BK_STOP 1526776685299

--------------------
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 CSRepetitions-PT-05 as instance name.
Using CSRepetitions 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': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': True, 'Loop Free': False, 'Conservative': False, 'Sub-Conservative': True, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 506, 'Memory': 108.04, 'Tool': 'lola'}, {'Time': 770, 'Memory': 106.7, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
ReachabilityCardinality lola CSRepetitions-PT-05...

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


checking for too many tokens
===========================================================================================
CSRepetitions-PT-05: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
ReachabilityCardinality @ CSRepetitions-PT-05 @ 3540 seconds
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 531/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 206 places, 325 transitions, 176 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 501 transition conflict sets
lola: TASK
lola: reading formula from CSRepetitions-PT-05-ReachabilityCardinality.task
lola: A (G ((RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4 + RequestBuffer_5 + RequestBuffer_6 + RequestBuffer_7 + RequestBuffer_8 + RequestBuffer_9 + RequestBuffer_10 + RequestBuffer_11 + RequestBuffer_12 + RequestBuffer_13 + RequestBuffer_14 + RequestBuffer_15 + RequestBuffer_16 + RequestBuffer_17 + RequestBuffer_18 + RequestBuffer_19 + RequestBuffer_20 + RequestBuffer_21 + RequestBuffer_22 + RequestBuffer_23 + RequestBuffer_24 + RequestBuffer_25 <= RequestBufferSlots))) : E (F (((Server_Waiting_5 + Server_Waiting_4 + Server_Waiting_3 + Server_Waiting_2 + Server_Waiting_1 <= 2) AND ((RequestBufferSlots + 1 <= Client_Waiting_1 + Client_Waiting_2 + Client_Waiting_3 + Client_Waiting_4 + Client_Waiting_5 + Client_Waiting_6 + Client_Waiting_7 + Client_Waiting_8 + Client_Waiting_9 + Client_Waiting_25 + Client_Waiting_24 + Client_Waiting_23 + Client_Waiting_22 + Client_Waiting_21 + Client_Waiting_20 + Client_Waiting_19 + Client_Waiting_18 + Client_Waiting_17 + Client_Waiting_16 + Client_Waiting_15 + Client_Waiting_14 + Client_Waiting_13 + Client_Waiting_12 + Client_Waiting_11 + Client_Waiting_10) OR (Server_Waiting_5 + Server_Waiting_4 + Server_Waiting_3 + Server_Waiting_2 + Server_Waiting_1 + 1 <= Client_Waiting_1 + Client_Waiting_2 + Client_Waiting_3 + Client_Waiting_4 + Client_Waiting_5 + Client_Waiting_6 + Client_Waiting_7 + Client_Waiting_8 + Client_Waiting_9 + Client_Waiting_25 + Client_Waiting_24 + Client_Waiting_23 + Client_Waiting_22 + Client_Waiting_21 + Client_Waiting_20 + Client_Waiting_19 + Client_Waiting_18 + Client_Waiting_17 + Client_Waiting_16 + Client_Waiting_15 + Client_Waiting_14 + Client_Waiting_13 + Client_Waiting_12 + Client_Waiting_11 + Client_Waiting_10))))) : A (G ((((3 <= Client_Waiting_1 + Client_Waiting_2 + Client_Waiting_3 + Client_Waiting_4 + Client_Waiting_5 + Client_Waiting_6 + Client_Waiting_7 + Client_Waiting_8 + Client_Waiting_9 + Client_Waiting_25 + Client_Waiting_24 + Client_Waiting_23 + Client_Waiting_22 + Client_Waiting_21 + Client_Waiting_20 + Client_Waiting_19 + Client_Waiting_18 + Client_Waiting_17 + Client_Waiting_16 + Client_Waiting_15 + Client_Waiting_14 + Client_Waiting_13 + Client_Waiting_12 + Client_Waiting_11 + Client_Waiting_10) AND (2 <= RequestBufferSlots)) OR (((2 <= Server_Anwering_4_1 + Server_Anwering_4_2 + Server_Anwering_4_3 + Server_Anwering_4_4 + Server_Anwering_4_5 + Server_Anwering_23_1 + Server_Anwering_23_2 + Server_Anwering_23_3 + Server_Anwering_23_4 + Server_Anwering_23_5 + Server_Anwering_10_1 + Server_Anwering_10_2 + Server_Anwering_10_3 + Server_Anwering_10_4 + Server_Anwering_10_5 + Server_Anwering_5_1 + Server_Anwering_5_2 + Server_Anwering_5_3 + Server_Anwering_5_4 + Server_Anwering_5_5 + Server_Anwering_24_1 + Server_Anwering_24_2 + Server_Anwering_24_3 + Server_Anwering_24_4 + Server_Anwering_24_5 + Server_Anwering_11_1 + Server_Anwering_11_2 + Server_Anwering_11_3 + Server_Anwering_11_4 + Server_Anwering_11_5 + Server_Anwering_6_1 + Server_Anwering_6_2 + Server_Anwering_6_3 + Server_Anwering_6_4 + Server_Anwering_6_5 + Server_Anwering_25_1 + Server_Anwering_25_2 + Server_Anwering_25_3 + Server_Anwering_25_4 + Server_Anwering_25_5 + Server_Anwering_12_1 + Server_Anwering_12_2 + Server_Anwering_12_3 + Server_Anwering_12_4 + Server_Anwering_12_5 + Server_Anwering_7_1 + Server_Anwering_7_2 + Server_Anwering_7_3 + Server_Anwering_7_4 + Server_Anwering_7_5 + Server_Anwering_13_1 + Server_Anwering_13_2 + Server_Anwering_13_3 + Server_Anwering_13_4 + Server_Anwering_13_5 + Server_Anwering_8_1 + Server_Anwering_8_2 + Server_Anwering_8_3 + Server_Anwering_8_4 + Server_Anwering_8_5 + Server_Anwering_14_1 + Server_Anwering_14_2 + Server_Anwering_14_3 + Server_Anwering_14_4 + Server_Anwering_14_5 + Server_Anwering_9_1 + Server_Anwering_9_2 + Server_Anwering_9_3 + Server_Anwering_9_4 + Server_Anwering_9_5 + Server_Anwering_15_1 + Server_Anwering_15_2 + Server_Anwering_15_3 + Server_Anwering_15_4 + Server_Anwering_15_5 + Server_Anwering_16_1 + Server_Anwering_16_2 + Server_Anwering_16_3 + Server_Anwering_16_4 + Server_Anwering_16_5 + Server_Anwering_3_5 + Server_Anwering_3_4 + Server_Anwering_3_3 + Server_Anwering_3_2 + Server_Anwering_3_1 + Server_Anwering_17_1 + Server_Anwering_17_2 + Server_Anwering_17_3 + Server_Anwering_17_4 + Server_Anwering_17_5 + Server_Anwering_18_1 + Server_Anwering_18_2 + Server_Anwering_18_3 + Server_Anwering_18_4 + Server_Anwering_18_5 + Server_Anwering_19_1 + Server_Anwering_19_2 + Server_Anwering_19_3 + Server_Anwering_19_4 + Server_Anwering_19_5 + Server_Anwering_21_5 + Server_Anwering_21_4 + Server_Anwering_21_3 + Server_Anwering_21_2 + Server_Anwering_21_1 + Server_Anwering_2_5 + Server_Anwering_2_4 + Server_Anwering_2_3 + Server_Anwering_2_2 + Server_Anwering_2_1 + Server_Anwering_20_5 + Server_Anwering_20_4 + Server_Anwering_20_3 + Server_Anwering_20_2 + Server_Anwering_20_1 + Server_Anwering_1_1 + Server_Anwering_1_2 + Server_Anwering_1_3 + Server_Anwering_1_4 + Server_Anwering_1_5 + Server_Anwering_22_1 + Server_Anwering_22_2 + Server_Anwering_22_3 + Server_Anwering_22_4 + Server_Anwering_22_5) OR (3 <= Server_Waiting_5 + Server_Waiting_4 + Server_Waiting_3 + Server_Waiting_2 + Server_Waiting_1)) AND (1 <= Client_Waiting_1 + Client_Waiting_2 + Client_Waiting_3 + Client_Waiting_4 + Client_Waiting_5 + Client_Waiting_6 + Client_Waiting_7 + Client_Waiting_8 + Client_Waiting_9 + Client_Waiting_25 + Client_Waiting_24 + Client_Waiting_23 + Client_Waiting_22 + Client_Waiting_21 + Client_Waiting_20 + Client_Waiting_19 + Client_Waiting_18 + Client_Waiting_17 + Client_Waiting_16 + Client_Waiting_15 + Client_Waiting_14 + Client_Waiting_13 + Client_Waiting_12 + Client_Waiting_11 + Client_Waiting_10))))) : E (F ((((RequestBufferSlots <= Client_Waiting_1 + Client_Waiting_2 + Client_Waiting_3 + Client_Waiting_4 + Client_Waiting_5 + Client_Waiting_6 + Client_Waiting_7 + Client_Waiting_8 + Client_Waiting_9 + Client_Waiting_25 + Client_Waiting_24 + Client_Waiting_23 + Client_Waiting_22 + Client_Waiting_21 + Client_Waiting_20 + Client_Waiting_19 + Client_Waiting_18 + Client_Waiting_17 + Client_Waiting_16 + Client_Waiting_15 + Client_Waiting_14 + Client_Waiting_13 + Client_Waiting_12 + Client_Waiting_11 + Client_Waiting_10) OR (3 <= Client_Waiting_1 + Client_Waiting_2 + Client_Waiting_3 + Client_Waiting_4 + Client_Waiting_5 + Client_Waiting_6 + Client_Waiting_7 + Client_Waiting_8 + Client_Waiting_9 + Client_Waiting_25 + Client_Waiting_24 + Client_Waiting_23 + Client_Waiting_22 + Client_Waiting_21 + Client_Waiting_20 + Client_Waiting_19 + Client_Waiting_18 + Client_Waiting_17 + Client_Waiting_16 + Client_Waiting_15 + Client_Waiting_14 + Client_Waiting_13 + Client_Waiting_12 + Client_Waiting_11 + Client_Waiting_10)) AND (2 <= Server_Anwering_4_1 + Server_Anwering_4_2 + Server_Anwering_4_3 + Server_Anwering_4_4 + Server_Anwering_4_5 + Server_Anwering_23_1 + Server_Anwering_23_2 + Server_Anwering_23_3 + Server_Anwering_23_4 + Server_Anwering_23_5 + Server_Anwering_10_1 + Server_Anwering_10_2 + Server_Anwering_10_3 + Server_Anwering_10_4 + Server_Anwering_10_5 + Server_Anwering_5_1 + Server_Anwering_5_2 + Server_Anwering_5_3 + Server_Anwering_5_4 + Server_Anwering_5_5 + Server_Anwering_24_1 + Server_Anwering_24_2 + Server_Anwering_24_3 + Server_Anwering_24_4 + Server_Anwering_24_5 + Server_Anwering_11_1 + Server_Anwering_11_2 + Server_Anwering_11_3 + Server_Anwering_11_4 + Server_Anwering_11_5 + Server_Anwering_6_1 + Server_Anwering_6_2 + Server_Anwering_6_3 + Server_Anwering_6_4 + Server_Anwering_6_5 + Server_Anwering_25_1 + Server_Anwering_25_2 + Server_Anwering_25_3 + Server_Anwering_25_4 + Server_Anwering_25_5 + Server_Anwering_12_1 + Server_Anwering_12_2 + Server_Anwering_12_3 + Server_Anwering_12_4 + Server_Anwering_12_5 + Server_Anwering_7_1 + Server_Anwering_7_2 + Server_Anwering_7_3 + Server_Anwering_7_4 + Server_Anwering_7_5 + Server_Anwering_13_1 + Server_Anwering_13_2 + Server_Anwering_13_3 + Server_Anwering_13_4 + Server_Anwering_13_5 + Server_Anwering_8_1 + Server_Anwering_8_2 + Server_Anwering_8_3 + Server_Anwering_8_4 + Server_Anwering_8_5 + Server_Anwering_14_1 + Server_Anwering_14_2 + Server_Anwering_14_3 + Server_Anwering_14_4 + Server_Anwering_14_5 + Server_Anwering_9_1 + Server_Anwering_9_2 + Server_Anwering_9_3 + Server_Anwering_9_4 + Server_Anwering_9_5 + Server_Anwering_15_1 + Server_Anwering_15_2 + Server_Anwering_15_3 + Server_Anwering_15_4 + Server_Anwering_15_5 + Server_Anwering_16_1 + Server_Anwering_16_2 + Server_Anwering_16_3 + Server_Anwering_16_4 + Server_Anwering_16_5 + Server_Anwering_3_5 + Server_Anwering_3_4 + Server_Anwering_3_3 + Server_Anwering_3_2 + Server_Anwering_3_1 + Server_Anwering_17_1 + Server_Anwering_17_2 + Server_Anwering_17_3 + Server_Anwering_17_4 + Server_Anwering_17_5 + Server_Anwering_18_1 + Server_Anwering_18_2 + Server_Anwering_18_3 + Server_Anwering_18_4 + Server_Anwering_18_5 + Server_Anwering_19_1 + Server_Anwering_19_2 + Server_Anwering_19_3 + Server_Anwering_19_4 + Server_Anwering_19_5 + Server_Anwering_21_5 + Server_Anwering_21_4 + Server_Anwering_21_3 + Server_Anwering_21_2 + Server_Anwering_21_1 + Server_Anwering_2_5 + Server_Anwering_2_4 + Server_Anwering_2_3 + Server_Anwering_2_2 + Server_Anwering_2_1 + Server_Anwering_20_5 + Server_Anwering_20_4 + Server_Anwering_20_3 + Server_Anwering_20_2 + Server_Anwering_20_1 + Server_Anwering_1_1 + Server_Anwering_1_2 + Server_Anwering_1_3 + Server_Anwering_1_4 + Server_Anwering_1_5 + Server_Anwering_22_1 + Server_Anwering_22_2 + Server_Anwering_22_3 + Server_Anwering_22_4 + Server_Anwering_22_5) AND (RequestBufferSlots <= 2)))) : E (F (((RequestBufferSlots <= 1) OR (Server_Waiting_5 + Server_Waiting_4 + Server_Waiting_3 + Server_Waiting_2 + Server_Waiting_1 <= 1) OR (Client_Waiting_1 + Client_Waiting_2 + Client_Waiting_3 + Client_Waiting_4 + Client_Waiting_5 + Client_Waiting_6 + Client_Waiting_7 + Client_Waiting_8 + Client_Waiting_9 + Client_Waiting_25 + Client_Waiting_24 + Client_Waiting_23 + Client_Waiting_22 + Client_Waiting_21 + Client_Waiting_20 + Client_Waiting_19 + Client_Waiting_18 + Client_Waiting_17 + Client_Waiting_16 + Client_Waiting_15 + Client_Waiting_14 + Client_Waiting_13 + Client_Waiting_12 + Client_Waiting_11 + Client_Waiting_10 <= RequestBufferSlots)))) : A (G ((1 <= RequestBufferSlots))) : A (G ((((2 <= RequestBufferSlots) OR (2 <= RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4 + RequestBuffer_5 + RequestBuffer_6 + RequestBuffer_7 + RequestBuffer_8 + RequestBuffer_9 + RequestBuffer_10 + RequestBuffer_11 + RequestBuffer_12 + RequestBuffer_13 + RequestBuffer_14 + RequestBuffer_15 + RequestBuffer_16 + RequestBuffer_17 + RequestBuffer_18 + RequestBuffer_19 + RequestBuffer_20 + RequestBuffer_21 + RequestBuffer_22 + RequestBuffer_23 + RequestBuffer_24 + RequestBuffer_25) OR (RequestBufferSlots <= RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4 + RequestBuffer_5 + RequestBuffer_6 + RequestBuffer_7 + RequestBuffer_8 + RequestBuffer_9 + RequestBuffer_10 + RequestBuffer_11 + RequestBuffer_12 + RequestBuffer_13 + RequestBuffer_14 + RequestBuffer_15 + RequestBuffer_16 + RequestBuffer_17 + RequestBuffer_18 + RequestBuffer_19 + RequestBuffer_20 + RequestBuffer_21 + RequestBuffer_22 + RequestBuffer_23 + RequestBuffer_24 + RequestBuffer_25))))) : A (G (((1 <= Server_Waiting_5 + Server_Waiting_4 + Server_Waiting_3 + Server_Waiting_2 + Server_Waiting_1) OR (Client_Sending_10 + Client_Sending_11 + Client_Sending_12 + Client_Sending_13 + Client_Sending_14 + Client_Sending_15 + Client_Sending_16 + Client_Sending_17 + Client_Sending_18 + Client_Sending_19 + Client_Sending_20 + Client_Sending_21 + Client_Sending_22 + Client_Sending_23 + Client_Sending_24 + Client_Sending_25 + Client_Sending_9 + Client_Sending_8 + Client_Sending_7 + Client_Sending_6 + Client_Sending_5 + Client_Sending_4 + Client_Sending_3 + Client_Sending_2 + Client_Sending_1 <= 1)))) : A (G (((Server_Waiting_2 <= 2) OR (Server_Anwering_14_3 <= 2) OR (1 <= Client_Waiting_23)))) : E (F ((3 <= Client_Waiting_8))) : E (F ((3 <= Server_Anwering_19_2))) : E (F (((Server_Anwering_7_4 <= 2) AND (Server_Anwering_4_1 + 1 <= Server_Anwering_13_2) AND (2 <= Client_Waiting_25)))) : A (G ((Server_Waiting_3 <= 1))) : E (F ((((Server_Anwering_21_4 <= Client_Waiting_16) OR (Server_Anwering_14_1 <= Server_Anwering_12_1)) AND ((1 <= Server_Anwering_24_1) OR (2 <= Server_Anwering_19_1)) AND (((Server_Anwering_20_3 <= Server_Anwering_5_4) AND (Server_Anwering_1_3 <= Server_Anwering_16_5)) OR (Client_Waiting_11 + 1 <= Server_Anwering_14_1))))) : E (F ((1 <= Server_Anwering_25_2))) : A (G ((Server_Anwering_8_5 <= 2)))
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 ((RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4 + RequestBuffer_5 + RequestBuffer_6 + RequestBuffer_7 + RequestBuffer_8 + RequestBuffer_9 + RequestBuffer_10 + RequestBuffer_11 + RequestBuffer_12 + RequestBuffer_13 + RequestBuffer_14 + RequestBuffer_15 + RequestBuffer_16 + RequestBuffer_17 + RequestBuffer_18 + RequestBuffer_19 + RequestBuffer_20 + RequestBuffer_21 + Req... (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 704 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((Server_Waiting_5 + Server_Waiting_4 + Server_Waiting_3 + Server_Waiting_2 + Server_Waiting_1 <= 2) AND ((RequestBufferSlots + 1 <= Client_Waiting_1 + Client_Waiting_2 + Client_Waiting_3 + Client_Waiting_4 + Client_Waiting_5 + Client_Waiting_6 + Client_Waiting_7 + Client_Waiting_8 + Client_Waiting_9 + Client_Waiting_25 + Client_Waiting_24 + Client_Waiting_23 + Client_Waiting_22 + Client_Wai... (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 704 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 2 conjunctive subformulas
lola: state equation: write sara problem file to CSRepetitions-PT-05-ReachabilityCardinality.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 12 markings, 13 edges
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((3 <= Client_Waiting_1 + Client_Waiting_2 + Client_Waiting_3 + Client_Waiting_4 + Client_Waiting_5 + Client_Waiting_6 + Client_Waiting_7 + Client_Waiting_8 + Client_Waiting_9 + Client_Waiting_25 + Client_Waiting_24 + Client_Waiting_23 + Client_Waiting_22 + Client_Waiting_21 + Client_Waiting_20 + Client_Waiting_19 + Client_Waiting_18 + Client_Waiting_17 + Client_Waiting_16 + Client_Waiting_... (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 704 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 4 conjunctive subformulas
lola: state equation: write sara problem file to CSRepetitions-PT-05-ReachabilityCardinality-2.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 26 markings, 25 edges
lola: lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
========================================
lola: state equation: calling and running sara
lola: ========================================
lola: ...considering subproblem: E (F ((((RequestBufferSlots <= Client_Waiting_1 + Client_Waiting_2 + Client_Waiting_3 + Client_Waiting_4 + Client_Waiting_5 + Client_Waiting_6 + Client_Waiting_7 + Client_Waiting_8 + Client_Waiting_9 + Client_Waiting_25 + Client_Waiting_24 + Client_Waiting_23 + Client_Waiting_22 + Client_Waiting_21 + Client_Waiting_20 + Client_Waiting_19 + Client_Waiting_18 + Client_Waiting_17 + Client_Waiting_16 ... (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 704 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)
sara: try reading problem file CSRepetitions-PT-05-ReachabilityCardinality.sara.
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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 9 markings, 9 edges
lola: state equation: write sara problem file to CSRepetitions-PT-05-ReachabilityCardinality-3.sara
lola: ========================================
sara: try reading problem file CSRepetitions-PT-05-ReachabilityCardinality-2.sara.
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((RequestBufferSlots <= 1) OR (Server_Waiting_5 + Server_Waiting_4 + Server_Waiting_3 + Server_Waiting_2 + Server_Waiting_1 <= 1) OR (Client_Waiting_1 + Client_Waiting_2 + Client_Waiting_3 + Client_Waiting_4 + Client_Waiting_5 + Client_Waiting_6 + Client_Waiting_7 + Client_Waiting_8 + Client_Waiting_9 + Client_Waiting_25 + Client_Waiting_24 + Client_Waiting_23 + Client_Waiting_22 + Client_... (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 704 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 3 conjunctive subformulas
lola: state equation: write sara problem file to CSRepetitions-PT-05-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file CSRepetitions-PT-05-ReachabilityCardinality-4.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6 markings, 5 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= RequestBufferSlots)))
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 704 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 7 markings, 6 edges
lola: state equation: write sara problem file to CSRepetitions-PT-05-ReachabilityCardinality-5.sara
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((2 <= RequestBufferSlots) OR (2 <= RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4 + RequestBuffer_5 + RequestBuffer_6 + RequestBuffer_7 + RequestBuffer_8 + RequestBuffer_9 + RequestBuffer_10 + RequestBuffer_11 + RequestBuffer_12 + RequestBuffer_13 + RequestBuffer_14 + RequestBuffer_15 + RequestBuffer_16 + RequestBuffer_17 + RequestBuffer_18 + RequestBuffer_19 + Requ... (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 704 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 CSRepetitions-PT-05-ReachabilityCardinality-6.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 20 markings, 19 edges
lola: ========================================
lola: state equation: calling and running sara
sara: try reading problem file CSRepetitions-PT-05-ReachabilityCardinality-6.sara.
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= Server_Waiting_5 + Server_Waiting_4 + Server_Waiting_3 + Server_Waiting_2 + Server_Waiting_1) OR (Client_Sending_10 + Client_Sending_11 + Client_Sending_12 + Client_Sending_13 + Client_Sending_14 + Client_Sending_15 + Client_Sending_16 + Client_Sending_17 + Client_Sending_18 + Client_Sending_19 + Client_Sending_20 + Client_Sending_21 + Client_Sending_22 + Client_Sending_23 + Client_S... (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 704 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 CSRepetitions-PT-05-ReachabilityCardinality-7.sara
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 29 markings, 34 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((Server_Waiting_2 <= 2) OR (Server_Anwering_14_3 <= 2) OR (1 <= Client_Waiting_23))))
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 704 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)
sara: place or transition ordering is non-deterministic
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 CSRepetitions-PT-05-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file CSRepetitions-PT-05-ReachabilityCardinality-8.sara.


sara: place or transition ordering is non-deterministic

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 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= Client_Waiting_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 704 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 CSRepetitions-PT-05-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file CSRepetitions-PT-05-ReachabilityCardinality-9.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= Server_Anwering_19_2)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 704 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 CSRepetitions-PT-05-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file CSRepetitions-PT-05-ReachabilityCardinality-10.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 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((Server_Anwering_7_4 <= 2) AND (Server_Anwering_4_1 + 1 <= Server_Anwering_13_2) AND (2 <= Client_Waiting_25))))
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 704 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 CSRepetitions-PT-05-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file CSRepetitions-PT-05-ReachabilityCardinality-11.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 12 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((Server_Waiting_3 <= 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 704 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 CSRepetitions-PT-05-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file CSRepetitions-PT-05-ReachabilityCardinality-12.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 13 will run for 1179 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((Server_Anwering_21_4 <= Client_Waiting_16) OR (Server_Anwering_14_1 <= Server_Anwering_12_1)) AND ((1 <= Server_Anwering_24_1) OR (2 <= Server_Anwering_19_1)) AND (((Server_Anwering_20_3 <= Server_Anwering_5_4) AND (Server_Anwering_1_3 <= Server_Anwering_16_5)) OR (Client_Waiting_11 + 1 <= Server_Anwering_14_1)))))
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 704 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 28 literals and 8 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: write sara problem file to CSRepetitions-PT-05-ReachabilityCardinality-13.sara
lola: The predicate is reachable.
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 14 will run for 1769 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= Server_Anwering_25_2)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 704 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 CSRepetitions-PT-05-ReachabilityCardinality-14.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: lola: state equation: calling and running sara4 markings, 3 edges

lola: ========================================
lola: subprocess 15 will run for 3539 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((Server_Anwering_8_5 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 704 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 CSRepetitions-PT-05-ReachabilityCardinality-15.sara
sara: try reading problem file CSRepetitions-PT-05-ReachabilityCardinality-14.sara.
lola: state equation: calling and running sara
sara: try reading problem file CSRepetitions-PT-05-ReachabilityCardinality-15.sara.
sara: place or transition ordering is non-deterministic
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: RESULT
lola:
SUMMARY: no yes no yes yes no no no yes no no no yes yes yes yes
FORMULA CSRepetitions-PT-05-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CSRepetitions-PT-05-ReachabilityCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CSRepetitions-PT-05-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CSRepetitions-PT-05-ReachabilityCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CSRepetitions-PT-05-ReachabilityCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CSRepetitions-PT-05-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CSRepetitions-PT-05-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CSRepetitions-PT-05-ReachabilityCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CSRepetitions-PT-05-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CSRepetitions-PT-05-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CSRepetitions-PT-05-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CSRepetitions-PT-05-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CSRepetitions-PT-05-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CSRepetitions-PT-05-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CSRepetitions-PT-05-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CSRepetitions-PT-05-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished stderr -----
----- Finished stdout -----

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CSRepetitions-PT-05"
export BK_EXAMINATION="ReachabilityCardinality"
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/CSRepetitions-PT-05.tgz
mv CSRepetitions-PT-05 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 CSRepetitions-PT-05, 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 r030-ebro-152646308600460"
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 ;