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 216K
-rw-r--r-- 1 mcc users 5.2K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K 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.2K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K 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 7 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 21K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is Philosophers-PT-000005, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r118-csrt-152666478900760
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527300989837


BK_STOP 1527301033012

--------------------
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 Philosophers-PT-000005 as instance name.
Using Philosophers as model name.
Using algorithm or tool voting-classifier.
Model characteristics are: {'Examination': 'CTLFireability', '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': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': True, 'Deadlock': True, 'Reversible': False, 'Quasi Live': None, 'Live': False}.
/usr/local/lib/python3.6/dist-packages/sklearn/preprocessing/label.py:151: DeprecationWarning: The truth value of an empty array is ambiguous. Returning False, but in future this will result in an error. Use `array.size > 0` to check that an array is not empty.
if diff:
Known tools are: [{'Time': 82, 'Memory': 100.91, 'Tool': 'gspn'}, {'Time': 193, 'Memory': 112.38, 'Tool': 'lola'}, {'Time': 316, 'Memory': 106.88, 'Tool': 'lola'}, {'Time': 1981, 'Memory': 1604.02, 'Tool': 'marcie'}, {'Time': 2027, 'Memory': 1551, 'Tool': 'marcie'}, {'Time': 2237, 'Memory': 152.06, 'Tool': 'gspn'}, {'Time': 3189, 'Memory': 243.57, 'Tool': 'itstools'}, {'Time': 3596, 'Memory': 226.86, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 2.3536585365853657x far from the best tool gspn.
CTLFireability lola Philosophers-PT-000005...

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


checking for too many tokens
===========================================================================================
Philosophers-PT-000005: translating PT formula CTLFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
CTLFireability @ Philosophers-PT-000005 @ 3540 seconds
----- Start make result stdout -----
----- Start make result stderr -----
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: 50/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 25 places, 25 transitions, 15 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 35 transition conflict sets
lola: TASK
lola: reading formula from Philosophers-PT-000005-CTLFireability.task
lola: E (X (E (X ((FIREABLE(FF2a_1) OR FIREABLE(FF2a_2) OR FIREABLE(FF2a_5) OR FIREABLE(FF2a_3) OR FIREABLE(FF2a_4) OR FIREABLE(FF1a_2) OR FIREABLE(FF1a_1) OR FIREABLE(FF1a_4) OR FIREABLE(FF1a_3) OR FIREABLE(FF1a_5) OR ((FIREABLE(FF2a_1) OR FIREABLE(FF2a_2) OR FIREABLE(FF2a_5) OR FIREABLE(FF2a_3) OR FIREABLE(FF2a_4)) AND (FIREABLE(FF2b_1) OR FIREABLE(FF2b_4) OR FIREABLE(FF2b_5) OR FIREABLE(FF2b_2) OR FIREABLE(FF2b_3)))))))) : E (G (E (((NOT FIREABLE(FF1b_2) AND NOT FIREABLE(FF1b_3) AND NOT FIREABLE(FF1b_1) AND NOT FIREABLE(FF1b_4) AND NOT FIREABLE(FF1b_5)) U (NOT FIREABLE(FF1a_2) AND NOT FIREABLE(FF1a_1) AND NOT FIREABLE(FF1a_4) AND NOT FIREABLE(FF1a_3) AND NOT FIREABLE(FF1a_5)))))) : (A (X (A (G ((FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_1) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_5) OR FIREABLE(FF2a_1) OR FIREABLE(FF2a_2) OR FIREABLE(FF2a_5) OR FIREABLE(FF2a_3) OR FIREABLE(FF2a_4)))))) AND NOT((E (G ((FIREABLE(End_4) OR FIREABLE(End_3) OR FIREABLE(End_2) OR FIREABLE(End_1) OR FIREABLE(End_5)))) OR NOT(A (G ((FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_1) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_5)))))))) : E (F (NOT(NOT(E (G ((FIREABLE(End_4) OR FIREABLE(End_3) OR FIREABLE(End_2) OR FIREABLE(End_1) OR FIREABLE(End_5)))))))) : (NOT FIREABLE(FF1b_2) AND NOT FIREABLE(FF1b_3) AND NOT FIREABLE(FF1b_1) AND NOT FIREABLE(FF1b_4) AND NOT FIREABLE(FF1b_5)) : A (G (A (F ((FIREABLE(FF1a_2) OR FIREABLE(FF1a_1) OR FIREABLE(FF1a_4) OR FIREABLE(FF1a_3) OR FIREABLE(FF1a_5) OR FIREABLE(FF2a_1) OR FIREABLE(FF2a_2) OR FIREABLE(FF2a_5) OR FIREABLE(FF2a_3) OR FIREABLE(FF2a_4) OR FIREABLE(FF2a_1) OR FIREABLE(FF2a_2) OR FIREABLE(FF2a_5) OR FIREABLE(FF2a_3) OR FIREABLE(FF2a_4)))))) : (A (X ((NOT FIREABLE(FF1b_2) AND NOT FIREABLE(FF1b_3) AND NOT FIREABLE(FF1b_1) AND NOT FIREABLE(FF1b_4) AND NOT FIREABLE(FF1b_5) AND NOT FIREABLE(FF1a_2) AND NOT FIREABLE(FF1a_1) AND NOT FIREABLE(FF1a_4) AND NOT FIREABLE(FF1a_3) AND NOT FIREABLE(FF1a_5) AND (FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_1) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_5))))) AND (FIREABLE(End_4) OR FIREABLE(End_3) OR FIREABLE(End_2) OR FIREABLE(End_1) OR FIREABLE(End_5))) : (A (F (NOT(A (G ((FIREABLE(End_4) OR FIREABLE(End_3) OR FIREABLE(End_2) OR FIREABLE(End_1) OR FIREABLE(End_5))))))) OR (E (((NOT FIREABLE(FF1a_2) AND NOT FIREABLE(FF1a_1) AND NOT FIREABLE(FF1a_4) AND NOT FIREABLE(FF1a_3) AND NOT FIREABLE(FF1a_5)) U ((FIREABLE(FF2a_1) OR FIREABLE(FF2a_2) OR FIREABLE(FF2a_5) OR FIREABLE(FF2a_3) OR FIREABLE(FF2a_4)) AND (FIREABLE(FF2a_1) OR FIREABLE(FF2a_2) OR FIREABLE(FF2a_5) OR FIREABLE(FF2a_3) OR FIREABLE(FF2a_4))))) OR ((E (X ((FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_1) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_5)))) AND (FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_1) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_5) OR FIREABLE(FF2a_1) OR FIREABLE(FF2a_2) OR FIREABLE(FF2a_5) OR FIREABLE(FF2a_3) OR FIREABLE(FF2a_4))) AND E (G ((FIREABLE(FF1a_2) OR FIREABLE(FF1a_1) OR FIREABLE(FF1a_4) OR FIREABLE(FF1a_3) OR FIREABLE(FF1a_5))))))) : FIREABLE(FF1a_4) : (A (X (A (F (NOT FIREABLE(FF2b_3))))) AND ((((NOT FIREABLE(FF2a_5) OR (FIREABLE(FF2b_4) AND FIREABLE(FF1b_5))) AND FIREABLE(FF2a_1)) OR (FIREABLE(End_1) AND NOT FIREABLE(FF2a_3))) OR NOT(NOT(A (F (FIREABLE(FF2b_5))))))) : NOT(NOT((FIREABLE(End_2) AND A (F ((FIREABLE(FF1a_3))))))) : FIREABLE(FF1a_4) : E (X ((E (F ((FIREABLE(FF2a_4) OR FIREABLE(FF2b_1)))) OR E (F (FIREABLE(FF2a_3)))))) : (E (X ((((FIREABLE(FF1b_1) AND FIREABLE(End_5)) OR (FIREABLE(End_4))) AND E (X (FIREABLE(FF1a_4)))))) AND (NOT(A ((FIREABLE(FF2a_2) U FIREABLE(FF2b_1)))) AND A (G (E (X (FIREABLE(FF2a_3))))))) : A (X (NOT(E (G (NOT FIREABLE(FF2a_2)))))) : FIREABLE(End_5)
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 (X (E (X ((FIREABLE(FF2a_1) OR FIREABLE(FF2a_2) OR FIREABLE(FF2a_5) OR FIREABLE(FF2a_3) OR FIREABLE(FF2a_4) OR FIREABLE(FF1a_2) OR FIREABLE(FF1a_1) OR FIREABLE(FF1a_4) OR FIREABLE(FF1a_3) OR FIREABLE(FF1a_5) OR ((FIREABLE(FF2a_1) OR FIREABLE(FF2a_2) OR FIREABLE(FF2a_5) OR FIREABLE(FF2a_3) OR FIREABLE(FF2a_4)) AND (FIREABLE(FF2b_1) OR FIREABLE(FF2b_4) OR FIREABLE(FF2b_5) OR FIREA... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(EX((FIREABLE(FF2a_1) OR FIREABLE(FF2a_2) OR FIREABLE(FF2a_5) OR FIREABLE(FF2a_3) OR FIREABLE(FF2a_4) OR FIREABLE(FF1a_2) OR FIREABLE(FF1a_1) OR FIREABLE(FF1a_4) OR FIREABLE(FF1a_3) OR FIREABLE(FF1a_5) OR ((FIREABLE(FF2a_1) OR FIREABLE(FF2a_2) OR FIREABLE(FF2a_5) OR FIREABLE(FF2a_3) OR FIREABLE(FF2a_4)) AND (FIREABLE(FF2b_1) OR FIREABLE(FF2b_4) OR FIREABLE(FF2b_5) OR FIREABLE(FF... (shortened)
lola: processed formula length: 431
lola: 2 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Philosophers-PT-000005-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 17 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (((NOT FIREABLE(FF1b_2) AND NOT FIREABLE(FF1b_3) AND NOT FIREABLE(FF1b_1) AND NOT FIREABLE(FF1b_4) AND NOT FIREABLE(FF1b_5)) U (NOT FIREABLE(FF1a_2) AND NOT FIREABLE(FF1a_1) AND NOT FIREABLE(FF1a_4) AND NOT FIREABLE(FF1a_3) AND NOT FIREABLE(FF1a_5))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E((NOT FIREABLE(FF1b_2) AND NOT FIREABLE(FF1b_3) AND NOT FIREABLE(FF1b_1) AND NOT FIREABLE(FF1b_4) AND NOT FIREABLE(FF1b_5)) U (NOT FIREABLE(FF1a_2) AND NOT FIREABLE(FF1a_1) AND NOT FIREABLE(FF1a_4) AND NOT FIREABLE(FF1a_3) AND NOT FIREABLE(FF1a_5))))))
lola: processed formula length: 270
lola: 2 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Philosophers-PT-000005-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 17 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1 markings, 1 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (X (A (G ((FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_1) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_5) OR FIREABLE(FF2a_1) OR FIREABLE(FF2a_2) OR FIREABLE(FF2a_5) OR FIREABLE(FF2a_3) OR FIREABLE(FF2a_4)))))) AND NOT((E (G ((FIREABLE(End_4) OR FIREABLE(End_3) OR FIREABLE(End_2) OR FIREABLE(End_1) OR FIREABLE(End_5)))) OR NOT(A (G ((FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIRE... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (A (G ((FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_1) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_5) OR FIREABLE(FF2a_1) OR FIREABLE(FF2a_2) OR FIREABLE(FF2a_5) OR FIREABLE(FF2a_3) OR FIREABLE(FF2a_4))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (A (G ((FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_1) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_5) OR FIREABLE(FF2a_1) OR FIREABLE(FF2a_2) OR FIREABLE(FF2a_5) OR FIREABLE(FF2a_3) OR FIREABLE(FF2a_4))))))
lola: processed formula: A (X (A (G ((FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_1) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_5) OR FIREABLE(FF2a_1) OR FIREABLE(FF2a_2) OR FIREABLE(FF2a_5) OR FIREABLE(FF2a_3) OR FIREABLE(FF2a_4))))))
lola: processed formula length: 223
lola: 10 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Philosophers-PT-000005-CTLFireability.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 15 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 7 markings, 7 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (NOT(NOT(E (G ((FIREABLE(End_4) OR FIREABLE(End_3) OR FIREABLE(End_2) OR FIREABLE(End_1) OR FIREABLE(End_5))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U NOT(A(TRUE U (NOT FIREABLE(End_4) AND NOT FIREABLE(End_3) AND NOT FIREABLE(End_2) AND NOT FIREABLE(End_1) AND NOT FIREABLE(End_5)))))
lola: processed formula length: 142
lola: 9 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Philosophers-PT-000005-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 17 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 45 markings, 116 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT FIREABLE(FF1b_2) AND NOT FIREABLE(FF1b_3) AND NOT FIREABLE(FF1b_1) AND NOT FIREABLE(FF1b_4) AND NOT FIREABLE(FF1b_5))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (NOT FIREABLE(FF1b_2) AND NOT FIREABLE(FF1b_3) AND NOT FIREABLE(FF1b_1) AND NOT FIREABLE(FF1b_4) AND NOT FIREABLE(FF1b_5))
lola: processed formula length: 122
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Philosophers-PT-000005-CTLFireability.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 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((FIREABLE(FF1a_2) OR FIREABLE(FF1a_1) OR FIREABLE(FF1a_4) OR FIREABLE(FF1a_3) OR FIREABLE(FF1a_5) OR FIREABLE(FF2a_1) OR FIREABLE(FF2a_2) OR FIREABLE(FF2a_5) OR FIREABLE(FF2a_3) OR FIREABLE(FF2a_4) OR FIREABLE(FF2a_1) OR FIREABLE(FF2a_2) OR FIREABLE(FF2a_5) OR FIREABLE(FF2a_3) OR FIREABLE(FF2a_4))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U (FIREABLE(FF1a_2) OR FIREABLE(FF1a_1) OR FIREABLE(FF1a_4) OR FIREABLE(FF1a_3) OR FIREABLE(FF1a_5) OR FIREABLE(FF2a_1) OR FIREABLE(FF2a_2) OR FIREABLE(FF2a_5) OR FIREABLE(FF2a_3) OR FIREABLE(FF2a_4) OR FIREABLE(FF2a_1) OR FIREABLE(FF2a_2) OR FIREABLE(FF2a_5) OR FIREABLE(FF2a_3) OR FIREABLE(FF2a_4))))))
lola: processed formula length: 342
lola: 2 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Philosophers-PT-000005-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 17 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 6 markings, 10 edges
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (X ((NOT FIREABLE(FF1b_2) AND NOT FIREABLE(FF1b_3) AND NOT FIREABLE(FF1b_1) AND NOT FIREABLE(FF1b_4) AND NOT FIREABLE(FF1b_5) AND NOT FIREABLE(FF1a_2) AND NOT FIREABLE(FF1a_1) AND NOT FIREABLE(FF1a_4) AND NOT FIREABLE(FF1a_3) AND NOT FIREABLE(FF1a_5) AND (FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_1) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_5))))) AND (FIREABLE(End_4) OR FIREABLE(En... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((NOT FIREABLE(FF1b_2) AND NOT FIREABLE(FF1b_3) AND NOT FIREABLE(FF1b_1) AND NOT FIREABLE(FF1b_4) AND NOT FIREABLE(FF1b_5) AND NOT FIREABLE(FF1a_2) AND NOT FIREABLE(FF1a_1) AND NOT FIREABLE(FF1a_4) AND NOT FIREABLE(FF1a_3) AND NOT FIREABLE(FF1a_5) AND (FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_1) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_5)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((NOT FIREABLE(FF1b_2) AND NOT FIREABLE(FF1b_3) AND NOT FIREABLE(FF1b_1) AND NOT FIREABLE(FF1b_4) AND NOT FIREABLE(FF1b_5) AND NOT FIREABLE(FF1a_2) AND NOT FIREABLE(FF1a_1) AND NOT FIREABLE(FF1a_4) AND NOT FIREABLE(FF1a_3) AND NOT FIREABLE(FF1a_5) AND (FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_1) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_5)))))
lola: processed formula: A (X ((NOT FIREABLE(FF1b_2) AND NOT FIREABLE(FF1b_3) AND NOT FIREABLE(FF1b_1) AND NOT FIREABLE(FF1b_4) AND NOT FIREABLE(FF1b_5) AND NOT FIREABLE(FF1a_2) AND NOT FIREABLE(FF1a_1) AND NOT FIREABLE(FF1a_4) AND NOT FIREABLE(FF1a_3) AND NOT FIREABLE(FF1a_5) AND (FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_1) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_5)))))
lola: processed formula length: 362
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Philosophers-PT-000005-CTLFireability.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 15 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6 markings, 6 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F (NOT(A (G ((FIREABLE(End_4) OR FIREABLE(End_3) OR FIREABLE(End_2) OR FIREABLE(End_1) OR FIREABLE(End_5))))))) OR (E (((NOT FIREABLE(FF1a_2) AND NOT FIREABLE(FF1a_1) AND NOT FIREABLE(FF1a_4) AND NOT FIREABLE(FF1a_3) AND NOT FIREABLE(FF1a_5)) U ((FIREABLE(FF2a_1) OR FIREABLE(FF2a_2) OR FIREABLE(FF2a_5) OR FIREABLE(FF2a_3) OR FIREABLE(FF2a_4)) AND (FIREABLE(FF2a_1) OR FIREABLE(FF2a_2) ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (F ((NOT FIREABLE(End_4) AND NOT FIREABLE(End_3) AND NOT FIREABLE(End_2) AND NOT FIREABLE(End_1) AND NOT FIREABLE(End_5))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U E(TRUE U (NOT FIREABLE(End_4) AND NOT FIREABLE(End_3) AND NOT FIREABLE(End_2) AND NOT FIREABLE(End_1) AND NOT FIREABLE(End_5))))
lola: processed formula length: 137
lola: 6 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Philosophers-PT-000005-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 17 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 1 markings, 1 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(FF1a_4)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(FF1a_4)
lola: processed formula length: 16
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Philosophers-PT-000005-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (X (A (F (NOT FIREABLE(FF2b_3))))) AND ((((NOT FIREABLE(FF2a_5) OR (FIREABLE(FF2b_4) AND FIREABLE(FF1b_5))) AND FIREABLE(FF2a_1)) OR (FIREABLE(End_1) AND NOT FIREABLE(FF2a_3))) OR NOT(NOT(A (F (FIREABLE(FF2b_5)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (A (F (NOT FIREABLE(FF2b_3)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(A(TRUE U NOT FIREABLE(FF2b_3)))
lola: processed formula length: 34
lola: 8 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Philosophers-PT-000005-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 17 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 19 markings, 20 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(NOT((FIREABLE(End_2) AND A (F ((FIREABLE(FF1a_3)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(End_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(End_2)
lola: processed formula length: 15
lola: 10 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Philosophers-PT-000005-CTLFireability.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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(FF1a_4)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(FF1a_4)
lola: processed formula length: 16
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Philosophers-PT-000005-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((E (F ((FIREABLE(FF2a_4) OR FIREABLE(FF2b_1)))) OR E (F (FIREABLE(FF2a_3))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (E (F ((FIREABLE(FF2a_4) OR FIREABLE(FF2b_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(E(TRUE U (FIREABLE(FF2a_4) OR FIREABLE(FF2b_1))))
lola: processed formula length: 53
lola: 3 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Philosophers-PT-000005-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 17 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 15 markings, 20 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (X ((((FIREABLE(FF1b_1) AND FIREABLE(End_5)) OR (FIREABLE(End_4))) AND E (X (FIREABLE(FF1a_4)))))) AND (NOT(A ((FIREABLE(FF2a_2) U FIREABLE(FF2b_1)))) AND A (G (E (X (FIREABLE(FF2a_3)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((((FIREABLE(FF1b_1) AND FIREABLE(End_5)) OR (FIREABLE(End_4))) AND E (X (FIREABLE(FF1a_4))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((((FIREABLE(FF1b_1) AND FIREABLE(End_5)) OR (FIREABLE(End_4))) AND EX(FIREABLE(FF1a_4))))
lola: processed formula length: 93
lola: 6 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Philosophers-PT-000005-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 17 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (NOT(E (G (NOT FIREABLE(FF2a_2))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(A(TRUE U FIREABLE(FF2a_2)))
lola: processed formula length: 30
lola: 5 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Philosophers-PT-000005-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 17 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(End_5)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(End_5)
lola: processed formula length: 15
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Philosophers-PT-000005-CTLFireability.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: RESULT
lola:
SUMMARY: yes no no yes no no no yes yes no no yes yes no no no
FORMULA Philosophers-PT-000005-CTLFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Philosophers-PT-000005-CTLFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Philosophers-PT-000005-CTLFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Philosophers-PT-000005-CTLFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Philosophers-PT-000005-CTLFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Philosophers-PT-000005-CTLFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Philosophers-PT-000005-CTLFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Philosophers-PT-000005-CTLFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Philosophers-PT-000005-CTLFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Philosophers-PT-000005-CTLFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Philosophers-PT-000005-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Philosophers-PT-000005-CTLFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Philosophers-PT-000005-CTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Philosophers-PT-000005-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Philosophers-PT-000005-CTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Philosophers-PT-000005-CTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- 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="Philosophers-PT-000005"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="mcc4mcc-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/Philosophers-PT-000005.tgz
mv Philosophers-PT-000005 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 mcc4mcc-full"
echo " Input is Philosophers-PT-000005, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r118-csrt-152666478900760"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.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 ;