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 268K
-rw-r--r-- 1 mcc users 5.4K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 27K 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 4.0K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 14K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.1K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 9.4K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.1K 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 26K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is CSRepetitions-PT-02, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r030-ebro-152646308600441
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526776513382


BK_STOP 1526776558728

--------------------
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-02 as instance name.
Using CSRepetitions 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': 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': 602, 'Memory': 106.21, 'Tool': 'lola'}, {'Time': 718, 'Memory': 101.04, 'Tool': 'gspn'}, {'Time': 780, 'Memory': 106.39, 'Tool': 'lola'}, {'Time': 4237, 'Memory': 163.36, 'Tool': 'gspn'}, {'Time': 4571, 'Memory': 262.24, 'Tool': 'itstools'}, {'Time': 4766, 'Memory': 266.63, 'Tool': 'itstools'}, {'Time': 15343, 'Memory': 7483.93, 'Tool': 'marcie'}, {'Time': 18274, 'Memory': 7483.66, 'Tool': 'marcie'}].
Learned tools are: [{'Tool': 'itstools'}].
Learned tool itstools is 7.593023255813954x far from the best tool lola.
ReachabilityFireability lola CSRepetitions-PT-02...
----- Start make prepare stderr -----

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


checking for too many tokens
===========================================================================================
CSRepetitions-PT-02: translating PT formula ReachabilityFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
ReachabilityFireability @ CSRepetitions-PT-02 @ 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: 51/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 23 places, 28 transitions, 17 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 45 transition conflict sets
lola: TASK
lola: reading formula from CSRepetitions-PT-02-ReachabilityFireability.task
lola: E (F ((NOT FIREABLE(Send_Answer_3_2) AND NOT FIREABLE(Send_Answer_4_2) AND NOT FIREABLE(Send_Answer_1_1) AND NOT FIREABLE(Send_Answer_3_1) AND NOT FIREABLE(Send_Answer_2_1) AND NOT FIREABLE(Send_Answer_4_1) AND NOT FIREABLE(Send_Answer_1_2) AND NOT FIREABLE(Send_Answer_2_2) AND (FIREABLE(Send_Answer_3_2) OR FIREABLE(Send_Answer_4_2) OR FIREABLE(Send_Answer_1_1) OR FIREABLE(Send_Answer_3_1) OR FIREABLE(Send_Answer_2_1) OR FIREABLE(Send_Answer_4_1) OR FIREABLE(Send_Answer_1_2) OR FIREABLE(Send_Answer_2_2)) AND (FIREABLE(Lose_Request_4) OR FIREABLE(Lose_Request_2) OR FIREABLE(Lose_Request_3) OR FIREABLE(Lose_Request_1) OR FIREABLE(Read_Request_4_2) OR FIREABLE(Read_Request_3_2) OR FIREABLE(Read_Request_1_1) OR FIREABLE(Read_Request_2_2) OR FIREABLE(Read_Request_1_2) OR FIREABLE(Read_Request_4_1) OR FIREABLE(Read_Request_3_1) OR FIREABLE(Read_Request_2_1) OR FIREABLE(Send_Request_2) OR FIREABLE(Send_Request_4) OR FIREABLE(Send_Request_1) OR FIREABLE(Send_Request_3)) AND ((NOT FIREABLE(Send_Answer_3_2) AND NOT FIREABLE(Send_Answer_4_2) AND NOT FIREABLE(Send_Answer_1_1) AND NOT FIREABLE(Send_Answer_3_1) AND NOT FIREABLE(Send_Answer_2_1) AND NOT FIREABLE(Send_Answer_4_1) AND NOT FIREABLE(Send_Answer_1_2) AND NOT FIREABLE(Send_Answer_2_2)) OR (NOT FIREABLE(Prepare_Request_2) AND NOT FIREABLE(Prepare_Request_3) AND NOT FIREABLE(Prepare_Request_1) AND NOT FIREABLE(Prepare_Request_4) AND NOT FIREABLE(Send_Request_2) AND NOT FIREABLE(Send_Request_4) AND NOT FIREABLE(Send_Request_1) AND NOT FIREABLE(Send_Request_3)))))) : E (F (((FIREABLE(Prepare_Request_2) OR FIREABLE(Prepare_Request_3) OR FIREABLE(Prepare_Request_1) OR FIREABLE(Prepare_Request_4) OR FIREABLE(Read_Request_4_2) OR FIREABLE(Read_Request_3_2) OR FIREABLE(Read_Request_1_1) OR FIREABLE(Read_Request_2_2) OR FIREABLE(Read_Request_1_2) OR FIREABLE(Read_Request_4_1) OR FIREABLE(Read_Request_3_1) OR FIREABLE(Read_Request_2_1) OR ((FIREABLE(Lose_Request_4) OR FIREABLE(Lose_Request_2) OR FIREABLE(Lose_Request_3) OR FIREABLE(Lose_Request_1)) AND (FIREABLE(Lose_Request_4) OR FIREABLE(Lose_Request_2) OR FIREABLE(Lose_Request_3) OR FIREABLE(Lose_Request_1)))) AND (FIREABLE(Prepare_Request_2) OR FIREABLE(Prepare_Request_3) OR FIREABLE(Prepare_Request_1) OR FIREABLE(Prepare_Request_4) OR FIREABLE(Lose_Request_4) OR FIREABLE(Lose_Request_2) OR FIREABLE(Lose_Request_3) OR FIREABLE(Lose_Request_1) OR (NOT FIREABLE(Send_Answer_3_2) AND NOT FIREABLE(Send_Answer_4_2) AND NOT FIREABLE(Send_Answer_1_1) AND NOT FIREABLE(Send_Answer_3_1) AND NOT FIREABLE(Send_Answer_2_1) AND NOT FIREABLE(Send_Answer_4_1) AND NOT FIREABLE(Send_Answer_1_2) AND NOT FIREABLE(Send_Answer_2_2))) AND NOT FIREABLE(Send_Answer_3_2) AND NOT FIREABLE(Send_Answer_4_2) AND NOT FIREABLE(Send_Answer_1_1) AND NOT FIREABLE(Send_Answer_3_1) AND NOT FIREABLE(Send_Answer_2_1) AND NOT FIREABLE(Send_Answer_4_1) AND NOT FIREABLE(Send_Answer_1_2) AND NOT FIREABLE(Send_Answer_2_2) AND NOT FIREABLE(Send_Request_2) AND NOT FIREABLE(Send_Request_4) AND NOT FIREABLE(Send_Request_1) AND NOT FIREABLE(Send_Request_3) AND (FIREABLE(Send_Request_2) OR FIREABLE(Send_Request_4) OR FIREABLE(Send_Request_1) OR FIREABLE(Send_Request_3) OR ((FIREABLE(Send_Answer_3_2) OR FIREABLE(Send_Answer_4_2) OR FIREABLE(Send_Answer_1_1) OR FIREABLE(Send_Answer_3_1) OR FIREABLE(Send_Answer_2_1) OR FIREABLE(Send_Answer_4_1) OR FIREABLE(Send_Answer_1_2) OR FIREABLE(Send_Answer_2_2)) AND (FIREABLE(Prepare_Request_2) OR FIREABLE(Prepare_Request_3) OR FIREABLE(Prepare_Request_1) OR FIREABLE(Prepare_Request_4))))))) : E (F (((FIREABLE(Lose_Request_4) OR FIREABLE(Lose_Request_2) OR FIREABLE(Lose_Request_3) OR FIREABLE(Lose_Request_1)) AND (FIREABLE(Send_Request_2) OR FIREABLE(Send_Request_4) OR FIREABLE(Send_Request_1) OR FIREABLE(Send_Request_3)) AND (FIREABLE(Send_Request_2) OR FIREABLE(Send_Request_4) OR FIREABLE(Send_Request_1) OR FIREABLE(Send_Request_3)) AND NOT FIREABLE(Send_Request_2) AND NOT FIREABLE(Send_Request_4) AND NOT FIREABLE(Send_Request_1) AND NOT FIREABLE(Send_Request_3) AND (FIREABLE(Prepare_Request_2) OR FIREABLE(Prepare_Request_3) OR FIREABLE(Prepare_Request_1) OR FIREABLE(Prepare_Request_4)) AND ((NOT FIREABLE(Prepare_Request_2) AND NOT FIREABLE(Prepare_Request_3) AND NOT FIREABLE(Prepare_Request_1) AND NOT FIREABLE(Prepare_Request_4)) OR (NOT FIREABLE(Send_Answer_3_2) AND NOT FIREABLE(Send_Answer_4_2) AND NOT FIREABLE(Send_Answer_1_1) AND NOT FIREABLE(Send_Answer_3_1) AND NOT FIREABLE(Send_Answer_2_1) AND NOT FIREABLE(Send_Answer_4_1) AND NOT FIREABLE(Send_Answer_1_2) AND NOT FIREABLE(Send_Answer_2_2)) OR (NOT FIREABLE(Read_Request_4_2) AND NOT FIREABLE(Read_Request_3_2) AND NOT FIREABLE(Read_Request_1_1) AND NOT FIREABLE(Read_Request_2_2) AND NOT FIREABLE(Read_Request_1_2) AND NOT FIREABLE(Read_Request_4_1) AND NOT FIREABLE(Read_Request_3_1) AND NOT FIREABLE(Read_Request_2_1)))))) : A (G ((FIREABLE(Lose_Request_4) OR FIREABLE(Lose_Request_2) OR FIREABLE(Lose_Request_3) OR FIREABLE(Lose_Request_1) OR (NOT FIREABLE(Prepare_Request_2) AND NOT FIREABLE(Prepare_Request_3) AND NOT FIREABLE(Prepare_Request_1) AND NOT FIREABLE(Prepare_Request_4)) OR (NOT FIREABLE(Read_Request_4_2) AND NOT FIREABLE(Read_Request_3_2) AND NOT FIREABLE(Read_Request_1_1) AND NOT FIREABLE(Read_Request_2_2) AND NOT FIREABLE(Read_Request_1_2) AND NOT FIREABLE(Read_Request_4_1) AND NOT FIREABLE(Read_Request_3_1) AND NOT FIREABLE(Read_Request_2_1)) OR (NOT FIREABLE(Send_Request_2) AND NOT FIREABLE(Send_Request_4) AND NOT FIREABLE(Send_Request_1) AND NOT FIREABLE(Send_Request_3) AND NOT FIREABLE(Prepare_Request_2) AND NOT FIREABLE(Prepare_Request_3) AND NOT FIREABLE(Prepare_Request_1) AND NOT FIREABLE(Prepare_Request_4))))) : A (G ((FIREABLE(Lose_Request_4) OR FIREABLE(Lose_Request_2) OR FIREABLE(Lose_Request_3) OR FIREABLE(Lose_Request_1) OR FIREABLE(Send_Answer_3_2) OR FIREABLE(Send_Answer_4_2) OR FIREABLE(Send_Answer_1_1) OR FIREABLE(Send_Answer_3_1) OR FIREABLE(Send_Answer_2_1) OR FIREABLE(Send_Answer_4_1) OR FIREABLE(Send_Answer_1_2) OR FIREABLE(Send_Answer_2_2) OR ((FIREABLE(Send_Answer_3_2) OR FIREABLE(Send_Answer_4_2) OR FIREABLE(Send_Answer_1_1) OR FIREABLE(Send_Answer_3_1) OR FIREABLE(Send_Answer_2_1) OR FIREABLE(Send_Answer_4_1) OR FIREABLE(Send_Answer_1_2) OR FIREABLE(Send_Answer_2_2)) AND (FIREABLE(Send_Answer_3_2) OR FIREABLE(Send_Answer_4_2) OR FIREABLE(Send_Answer_1_1) OR FIREABLE(Send_Answer_3_1) OR FIREABLE(Send_Answer_2_1) OR FIREABLE(Send_Answer_4_1) OR FIREABLE(Send_Answer_1_2) OR FIREABLE(Send_Answer_2_2))) OR (NOT FIREABLE(Prepare_Request_2) AND NOT FIREABLE(Prepare_Request_3) AND NOT FIREABLE(Prepare_Request_1) AND NOT FIREABLE(Prepare_Request_4)) OR (NOT FIREABLE(Read_Request_4_2) AND NOT FIREABLE(Read_Request_3_2) AND NOT FIREABLE(Read_Request_1_1) AND NOT FIREABLE(Read_Request_2_2) AND NOT FIREABLE(Read_Request_1_2) AND NOT FIREABLE(Read_Request_4_1) AND NOT FIREABLE(Read_Request_3_1) AND NOT FIREABLE(Read_Request_2_1)) OR FIREABLE(Lose_Request_4) OR FIREABLE(Lose_Request_2) OR FIREABLE(Lose_Request_3) OR FIREABLE(Lose_Request_1) OR FIREABLE(Prepare_Request_2) OR FIREABLE(Prepare_Request_3) OR FIREABLE(Prepare_Request_1) OR FIREABLE(Prepare_Request_4)))) : A (G (((NOT FIREABLE(Lose_Request_4) AND NOT FIREABLE(Lose_Request_2) AND NOT FIREABLE(Lose_Request_3) AND NOT FIREABLE(Lose_Request_1)) OR (NOT FIREABLE(Prepare_Request_2) AND NOT FIREABLE(Prepare_Request_3) AND NOT FIREABLE(Prepare_Request_1) AND NOT FIREABLE(Prepare_Request_4)) OR (NOT FIREABLE(Prepare_Request_2) AND NOT FIREABLE(Prepare_Request_3) AND NOT FIREABLE(Prepare_Request_1) AND NOT FIREABLE(Prepare_Request_4)) OR FIREABLE(Send_Answer_3_2) OR FIREABLE(Send_Answer_4_2) OR FIREABLE(Send_Answer_1_1) OR FIREABLE(Send_Answer_3_1) OR FIREABLE(Send_Answer_2_1) OR FIREABLE(Send_Answer_4_1) OR FIREABLE(Send_Answer_1_2) OR FIREABLE(Send_Answer_2_2) OR FIREABLE(Read_Request_4_2) OR FIREABLE(Read_Request_3_2) OR FIREABLE(Read_Request_1_1) OR FIREABLE(Read_Request_2_2) OR FIREABLE(Read_Request_1_2) OR FIREABLE(Read_Request_4_1) OR FIREABLE(Read_Request_3_1) OR FIREABLE(Read_Request_2_1) OR FIREABLE(Read_Request_4_2) OR FIREABLE(Read_Request_3_2) OR FIREABLE(Read_Request_1_1) OR FIREABLE(Read_Request_2_2) OR FIREABLE(Read_Request_1_2) OR FIREABLE(Read_Request_4_1) OR FIREABLE(Read_Request_3_1) OR FIREABLE(Read_Request_2_1) OR FIREABLE(Send_Answer_3_2) OR FIREABLE(Send_Answer_4_2) OR FIREABLE(Send_Answer_1_1) OR FIREABLE(Send_Answer_3_1) OR FIREABLE(Send_Answer_2_1) OR FIREABLE(Send_Answer_4_1) OR FIREABLE(Send_Answer_1_2) OR FIREABLE(Send_Answer_2_2) OR FIREABLE(Lose_Request_4) OR FIREABLE(Lose_Request_2) OR FIREABLE(Lose_Request_3) OR FIREABLE(Lose_Request_1) OR (NOT FIREABLE(Lose_Request_4) AND NOT FIREABLE(Lose_Request_2) AND NOT FIREABLE(Lose_Request_3) AND NOT FIREABLE(Lose_Request_1))))) : E (F ((((NOT FIREABLE(Send_Request_2) AND NOT FIREABLE(Send_Request_4) AND NOT FIREABLE(Send_Request_1) AND NOT FIREABLE(Send_Request_3)) OR (NOT FIREABLE(Prepare_Request_2) AND NOT FIREABLE(Prepare_Request_3) AND NOT FIREABLE(Prepare_Request_1) AND NOT FIREABLE(Prepare_Request_4))) AND (FIREABLE(Lose_Request_4) OR FIREABLE(Lose_Request_2) OR FIREABLE(Lose_Request_3) OR FIREABLE(Lose_Request_1)) AND NOT FIREABLE(Read_Request_4_2) AND NOT FIREABLE(Read_Request_3_2) AND NOT FIREABLE(Read_Request_1_1) AND NOT FIREABLE(Read_Request_2_2) AND NOT FIREABLE(Read_Request_1_2) AND NOT FIREABLE(Read_Request_4_1) AND NOT FIREABLE(Read_Request_3_1) AND NOT FIREABLE(Read_Request_2_1) AND NOT FIREABLE(Lose_Request_4) AND NOT FIREABLE(Lose_Request_2) AND NOT FIREABLE(Lose_Request_3) AND NOT FIREABLE(Lose_Request_1) AND NOT FIREABLE(Send_Answer_3_2) AND NOT FIREABLE(Send_Answer_4_2) AND NOT FIREABLE(Send_Answer_1_1) AND NOT FIREABLE(Send_Answer_3_1) AND NOT FIREABLE(Send_Answer_2_1) AND NOT FIREABLE(Send_Answer_4_1) AND NOT FIREABLE(Send_Answer_1_2) AND NOT FIREABLE(Send_Answer_2_2)))) : E (F ((NOT FIREABLE(Lose_Request_4) AND NOT FIREABLE(Lose_Request_2) AND NOT FIREABLE(Lose_Request_3) AND NOT FIREABLE(Lose_Request_1) AND NOT FIREABLE(Send_Request_2) AND NOT FIREABLE(Send_Request_4) AND NOT FIREABLE(Send_Request_1) AND NOT FIREABLE(Send_Request_3) AND ((NOT FIREABLE(Send_Request_2) AND NOT FIREABLE(Send_Request_4) AND NOT FIREABLE(Send_Request_1) AND NOT FIREABLE(Send_Request_3)) OR (NOT FIREABLE(Send_Request_2) AND NOT FIREABLE(Send_Request_4) AND NOT FIREABLE(Send_Request_1) AND NOT FIREABLE(Send_Request_3))) AND (FIREABLE(Lose_Request_4) OR FIREABLE(Lose_Request_2) OR FIREABLE(Lose_Request_3) OR FIREABLE(Lose_Request_1))))) : E (F ((NOT FIREABLE(Lose_Request_3) AND (FIREABLE(Lose_Request_4) OR FIREABLE(Read_Request_1_2)) AND FIREABLE(Send_Request_2) AND FIREABLE(Send_Request_3)))) : E (F (())) : A (G ((FIREABLE(Read_Request_2_2) OR NOT FIREABLE(Read_Request_1_1) OR NOT FIREABLE(Send_Request_3) OR NOT FIREABLE(Read_Request_4_2) OR NOT FIREABLE(Send_Answer_4_2)))) : E (F ((FIREABLE(Send_Answer_2_2) AND FIREABLE(Send_Answer_1_2)))) : A (G ((NOT FIREABLE(Read_Request_1_1) OR FIREABLE(Lose_Request_3) OR NOT FIREABLE(Read_Request_3_1)))) : E (F ((FIREABLE(Send_Answer_2_1) AND FIREABLE(Send_Answer_3_2) AND NOT FIREABLE(Prepare_Request_1) AND FIREABLE(Send_Answer_3_1) AND ((FIREABLE(Send_Request_2) AND FIREABLE(Send_Request_1) AND NOT FIREABLE(Prepare_Request_3)) OR NOT FIREABLE(Send_Answer_2_2))))) : A (G ((NOT FIREABLE(Lose_Request_1) OR NOT FIREABLE(Send_Request_1) OR NOT FIREABLE(Lose_Request_4)))) : E (F ((FIREABLE(Send_Answer_4_2) AND FIREABLE(Read_Request_1_2) AND (FIREABLE(Send_Request_3)) AND NOT FIREABLE(Send_Request_1) AND (NOT FIREABLE(Send_Answer_3_1) OR NOT FIREABLE(Read_Request_3_1)))))
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 ((NOT FIREABLE(Send_Answer_3_2) AND NOT FIREABLE(Send_Answer_4_2) AND NOT FIREABLE(Send_Answer_1_1) AND NOT FIREABLE(Send_Answer_3_1) AND NOT FIREABLE(Send_Answer_2_1) AND NOT FIREABLE(Send_Answer_4_1) AND NOT FIREABLE(Send_Answer_1_2) AND NOT FIREABLE(Send_Answer_2_2) AND (FIREABLE(Send_Answer_3_2) OR FIREABLE(Send_Answer_4_2) OR FIREABLE(Send_Answer_1_1) OR FIREABLE(Send_Answer_3_1) 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 68 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: State predicate is contradiction.
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(Prepare_Request_2) OR FIREABLE(Prepare_Request_3) OR FIREABLE(Prepare_Request_1) OR FIREABLE(Prepare_Request_4) OR FIREABLE(Read_Request_4_2) OR FIREABLE(Read_Request_3_2) OR FIREABLE(Read_Request_1_1) OR FIREABLE(Read_Request_2_2) OR FIREABLE(Read_Request_1_2) OR FIREABLE(Read_Request_4_1) OR FIREABLE(Read_Request_3_1) OR FIREABLE(Read_Request_2_1) OR ((FIREABLE(Lose_... (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 68 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 unreachable.
lola: 6642 markings, 27827 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(Lose_Request_4) OR FIREABLE(Lose_Request_2) OR FIREABLE(Lose_Request_3) OR FIREABLE(Lose_Request_1)) AND (FIREABLE(Send_Request_2) OR FIREABLE(Send_Request_4) OR FIREABLE(Send_Request_1) OR FIREABLE(Send_Request_3)) AND (FIREABLE(Send_Request_2) OR FIREABLE(Send_Request_4) OR FIREABLE(Send_Request_1) OR FIREABLE(Send_Request_3)) AND NOT FIREABLE(Send_Request_2) AND NOT 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 68 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: State predicate is contradiction.
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(Lose_Request_4) OR FIREABLE(Lose_Request_2) OR FIREABLE(Lose_Request_3) OR FIREABLE(Lose_Request_1) OR (NOT FIREABLE(Prepare_Request_2) AND NOT FIREABLE(Prepare_Request_3) AND NOT FIREABLE(Prepare_Request_1) AND NOT FIREABLE(Prepare_Request_4)) OR (NOT FIREABLE(Read_Request_4_2) AND NOT FIREABLE(Read_Request_3_2) AND NOT FIREABLE(Read_Request_1_1) AND NOT FIREABLE(Read_Request... (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 68 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: State predicate is contradiction.
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(Lose_Request_4) OR FIREABLE(Lose_Request_2) OR FIREABLE(Lose_Request_3) OR FIREABLE(Lose_Request_1) OR FIREABLE(Send_Answer_3_2) OR FIREABLE(Send_Answer_4_2) OR FIREABLE(Send_Answer_1_1) OR FIREABLE(Send_Answer_3_1) OR FIREABLE(Send_Answer_2_1) OR FIREABLE(Send_Answer_4_1) OR FIREABLE(Send_Answer_1_2) OR FIREABLE(Send_Answer_2_2) OR ((FIREABLE(Send_Answer_3_2) OR FIREA... (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 68 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 invariant.
lola: 1289 markings, 2833 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(Lose_Request_4) AND NOT FIREABLE(Lose_Request_2) AND NOT FIREABLE(Lose_Request_3) AND NOT FIREABLE(Lose_Request_1)) OR (NOT FIREABLE(Prepare_Request_2) AND NOT FIREABLE(Prepare_Request_3) AND NOT FIREABLE(Prepare_Request_1) AND NOT FIREABLE(Prepare_Request_4)) OR (NOT FIREABLE(Prepare_Request_2) AND NOT FIREABLE(Prepare_Request_3) AND NOT FIREABLE(Prepare_Request_1) AND NOT ... (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 68 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 invariant.
lola: 6837 markings, 29796 edges
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((NOT FIREABLE(Send_Request_2) AND NOT FIREABLE(Send_Request_4) AND NOT FIREABLE(Send_Request_1) AND NOT FIREABLE(Send_Request_3)) OR (NOT FIREABLE(Prepare_Request_2) AND NOT FIREABLE(Prepare_Request_3) AND NOT FIREABLE(Prepare_Request_1) AND NOT FIREABLE(Prepare_Request_4))) AND (FIREABLE(Lose_Request_4) OR FIREABLE(Lose_Request_2) OR FIREABLE(Lose_Request_3) OR FIREABLE(Lose_Request_1... (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 68 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 unreachable.
lola: 7227 markings, 30856 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(Lose_Request_4) AND NOT FIREABLE(Lose_Request_2) AND NOT FIREABLE(Lose_Request_3) AND NOT FIREABLE(Lose_Request_1) AND NOT FIREABLE(Send_Request_2) AND NOT FIREABLE(Send_Request_4) AND NOT FIREABLE(Send_Request_1) AND NOT FIREABLE(Send_Request_3) AND ((NOT FIREABLE(Send_Request_2) AND NOT FIREABLE(Send_Request_4) AND NOT FIREABLE(Send_Request_1) AND NOT FIREABLE(Send_Request_3)... (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 68 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: State predicate is contradiction.
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(Lose_Request_3) AND (FIREABLE(Lose_Request_4) OR FIREABLE(Read_Request_1_2)) AND FIREABLE(Send_Request_2) AND FIREABLE(Send_Request_3))))
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 68 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 13 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (()))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 3 rewrites
lola: formula mentions 0 of 23 places; total mentions: 0
lola: closed formula file CSRepetitions-PT-02-ReachabilityFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(Read_Request_2_2) OR NOT FIREABLE(Read_Request_1_1) OR NOT FIREABLE(Send_Request_3) OR NOT FIREABLE(Read_Request_4_2) OR NOT FIREABLE(Send_Answer_4_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 68 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 1 conjunctive subformulas
lola: state equation: write sara problem file to CSRepetitions-PT-02-ReachabilityFireability-10.sara
lola: state equation: calling and running sara
sara: try reading problem file CSRepetitions-PT-02-ReachabilityFireability-10.sara.
sara: place or transition ordering is non-deterministic

lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 5037 markings, 16350 edges
lola: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(Send_Answer_2_2) AND FIREABLE(Send_Answer_1_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 68 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: state equation: write sara problem file to CSRepetitions-PT-02-ReachabilityFireability-11.sara
lola: state equation: calling and running sara
sara: try reading problem file CSRepetitions-PT-02-ReachabilityFireability-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 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(Read_Request_1_1) OR FIREABLE(Lose_Request_3) OR NOT FIREABLE(Read_Request_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 68 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: State predicate is contradiction.
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(Send_Answer_2_1) AND FIREABLE(Send_Answer_3_2) AND NOT FIREABLE(Prepare_Request_1) AND FIREABLE(Send_Answer_3_1) AND ((FIREABLE(Send_Request_2) AND FIREABLE(Send_Request_1) AND NOT FIREABLE(Prepare_Request_3)) OR NOT FIREABLE(Send_Answer_2_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 68 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 20 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CSRepetitions-PT-02-ReachabilityFireability-13.sara
lola: state equation: calling and running sara
sara: try reading problem file CSRepetitions-PT-02-ReachabilityFireability-13.sara.
sara: place or transition ordering is non-deterministic

lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 3674 markings, 10096 edges
lola: ========================================
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(Lose_Request_1) OR NOT FIREABLE(Send_Request_1) OR NOT FIREABLE(Lose_Request_4))))
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 68 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: state equation: write sara problem file to CSRepetitions-PT-02-ReachabilityFireability-14.sara
lola: state equation: calling and running sara
sara: try reading problem file CSRepetitions-PT-02-ReachabilityFireability-14.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 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(Send_Answer_4_2) AND FIREABLE(Read_Request_1_2) AND (FIREABLE(Send_Request_3)) AND NOT FIREABLE(Send_Request_1) AND (NOT FIREABLE(Send_Answer_3_1) OR NOT FIREABLE(Read_Request_3_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 68 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 24 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to CSRepetitions-PT-02-ReachabilityFireability-15.sara
lola: state equation: calling and running sara
sara: try reading problem file CSRepetitions-PT-02-ReachabilityFireability-15.sara.
sara: place or transition ordering is non-deterministic

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