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 1020K
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 73K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 209K 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 6.3K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 16K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 73K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 107 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 345 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 67K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 198K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.2K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 13K 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 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 118K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is TokenRing-PT-005, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r174-smll-152708745100311
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527176628835


BK_STOP 1527176675241

--------------------
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 TokenRing-PT-005 as instance name.
Using TokenRing as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', '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': False, 'Conservative': True, 'Sub-Conservative': True, 'Nested Units': False, 'Safe': None, 'Deadlock': False, 'Reversible': False, 'Quasi Live': True, 'Live': True}.
Known tools are: [{'Time': 288, 'Memory': 105.81, 'Tool': 'lola'}, {'Time': 389, 'Memory': 106.01, 'Tool': 'lola'}, {'Time': 503, 'Memory': 100.03, 'Tool': 'gspn'}, {'Time': 6038, 'Memory': 167.82, 'Tool': 'gspn'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola TokenRing-PT-005...

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


checking for too many tokens
===========================================================================================
TokenRing-PT-005: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
CTLCardinality @ TokenRing-PT-005 @ 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: 192/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 36 places, 156 transitions, 30 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 192 transition conflict sets
lola: TASK
lola: reading formula from TokenRing-PT-005-CTLCardinality.task
lola: ((State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_5_4 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_5_3 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_5_2 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_5_1 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_5_0 + State_4_5 + State_3_5 + State_2_5 + State_1_5 + State_0_5 + State_5_5 <= 0) OR (((1 <= State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_5_4 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_5_3 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_5_2 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_5_1 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_5_0 + State_4_5 + State_3_5 + State_2_5 + State_1_5 + State_0_5 + State_5_5)) AND (State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_5_4 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_5_3 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_5_2 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_5_1 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_5_0 + State_4_5 + State_3_5 + State_2_5 + State_1_5 + State_0_5 + State_5_5 <= 0))) : E (G (A (G (FALSE)))) : FALSE : (3 <= State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_5_4 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_5_3 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_5_2 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_5_1 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_5_0 + State_4_5 + State_3_5 + State_2_5 + State_1_5 + State_0_5 + State_5_5) : TRUE : NOT(A ((((1 <= State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_5_4 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_5_3 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_5_2 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_5_1 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_5_0 + State_4_5 + State_3_5 + State_2_5 + State_1_5 + State_0_5 + State_5_5) AND (1 <= State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_5_4 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_5_3 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_5_2 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_5_1 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_5_0 + State_4_5 + State_3_5 + State_2_5 + State_1_5 + State_0_5 + State_5_5)) U (2 <= State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_5_4 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_5_3 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_5_2 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_5_1 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_5_0 + State_4_5 + State_3_5 + State_2_5 + State_1_5 + State_0_5 + State_5_5)))) : (NOT(E (F (()))) OR A (X (((1 <= State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_5_4 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_5_3 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_5_2 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_5_1 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_5_0 + State_4_5 + State_3_5 + State_2_5 + State_1_5 + State_0_5 + State_5_5))))) : E ((E (F (TRUE)) U (1 <= State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_5_4 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_5_3 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_5_2 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_5_1 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_5_0 + State_4_5 + State_3_5 + State_2_5 + State_1_5 + State_0_5 + State_5_5))) : ((((State_2_3 + 1 <= State_3_1) AND (State_5_0 + 1 <= State_3_4)) OR ((State_2_4 + 1 <= State_3_1) AND (State_4_0 + 1 <= State_2_4) AND (2 <= State_0_3))) OR (A (G ((3 <= State_0_2))) OR (((State_4_1 <= 1) OR (2 <= State_0_1)) AND E (G ((3 <= State_1_5)))))) : (A (G ((State_2_5 <= State_1_1))) OR TRUE) : (((State_2_5 + 1 <= State_4_5) OR ((State_0_5 <= State_3_5) OR E (G ((3 <= State_5_4))))) AND (E (X ((State_5_0 + 1 <= State_3_0))) OR (2 <= State_3_1))) : A (G (((State_5_1 + 1 <= State_5_5) AND (State_3_3 <= 2) AND (State_0_4 <= State_3_2)))) : (E (((2 <= State_1_0) U (State_0_4 <= 0))) OR (State_0_4 <= State_3_2)) : (State_0_5 <= State_0_2) : NOT(A (X (((2 <= State_5_0) AND (3 <= State_3_2) AND ((1 <= State_4_0) OR (1 <= State_5_4)))))) : ((A (G (((State_3_3 <= State_1_1) AND (State_3_4 <= State_5_3)))) OR A (G ((3 <= State_1_5)))) OR ((State_1_0 <= State_3_3) OR A (((State_4_1 <= State_1_2) U (State_0_2 <= State_3_3)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_5_4 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_5_3 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_5_2 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_5_1 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_5_0 + State_4_5 + State_3_5 + State_2_5 + St... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_5_4 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_5_3 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_5_2 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_5_1 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_5_0 + State_4_5 + State_3_5 + State_2_5 + St... (shortened)
lola: processed formula length: 1324
lola: 0 rewrites
lola: formula mentions 0 of 36 places; total mentions: 0
lola: closed formula file TokenRing-PT-005-CTLCardinality.task
lola: processed formula with 3 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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (G (FALSE))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 5 rewrites
lola: formula mentions 0 of 36 places; total mentions: 0
lola: closed formula file TokenRing-PT-005-CTLCardinality.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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 1 rewrites
lola: formula mentions 0 of 36 places; total mentions: 0
lola: closed formula file TokenRing-PT-005-CTLCardinality.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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (3 <= State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_5_4 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_5_3 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_5_2 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_5_1 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_5_0 + State_4_5 + State_3_5 + State_2_5 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_5_4 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_5_3 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_5_2 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_5_1 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_5_0 + State_4_5 + State_3_5 + State_2_5 ... (shortened)
lola: processed formula length: 436
lola: 0 rewrites
lola: formula mentions 0 of 36 places; total mentions: 0
lola: closed formula file TokenRing-PT-005-CTLCardinality.task
lola: processed formula with 1 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 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 1 rewrites
lola: formula mentions 0 of 36 places; total mentions: 0
lola: closed formula file TokenRing-PT-005-CTLCardinality.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 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A ((((1 <= State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_5_4 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_5_3 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_5_2 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_5_1 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_5_0 + State_4_5 + State_3_5 + S... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(((1 <= State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_5_4 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_5_3 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_5_2 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_5_1 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_5_0 + State_4_5 + State_3_5 + Sta... (shortened)
lola: processed formula length: 1326
lola: 7 rewrites
lola: formula mentions 0 of 36 places; total mentions: 0
lola: closed formula file TokenRing-PT-005-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 120 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(E (F (()))) OR A (X (((1 <= State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_5_4 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_5_3 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_5_2 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_5_1 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_5_0 + State_4... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (((1 <= State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_5_4 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_5_3 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_5_2 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_5_1 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_5_0 + State_4_5 + State_3_5 + State_2_5 + State_1_5 + State_0_5 + State_5_5))))
lola: processed formula: A (X (((1 <= State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_5_4 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_5_3 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_5_2 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_5_1 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_5_0 + State_4_5 + State_3_5 + Sta... (shortened)
lola: processed formula length: 446
lola: 5 rewrites
lola: formula mentions 0 of 36 places; total mentions: 0
lola: closed formula file TokenRing-PT-005-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 bytes per marking, with 30 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 6 markings, 5 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((E (F (TRUE)) U (1 <= State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_5_4 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_5_3 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_5_2 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_5_1 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_5_0 + State_4_5 + Sta... (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 120 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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((State_2_3 + 1 <= State_3_1) AND (State_5_0 + 1 <= State_3_4)) OR ((State_2_4 + 1 <= State_3_1) AND (State_4_0 + 1 <= State_2_4) AND (2 <= State_0_3))) OR (A (G ((3 <= State_0_2))) OR (((State_4_1 <= 1) OR (2 <= State_0_1)) AND E (G ((3 <= State_1_5))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((State_2_3 + 1 <= State_3_1) AND (State_5_0 + 1 <= State_3_4)) OR ((State_2_4 + 1 <= State_3_1) AND (State_4_0 + 1 <= State_2_4) AND (2 <= State_0_3)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((State_2_3 + 1 <= State_3_1) AND (State_5_0 + 1 <= State_3_4)) OR ((State_2_4 + 1 <= State_3_1) AND (State_4_0 + 1 <= State_2_4) AND (2 <= State_0_3)))
lola: processed formula length: 154
lola: 0 rewrites
lola: formula mentions 0 of 36 places; total mentions: 0
lola: closed formula file TokenRing-PT-005-CTLCardinality.task
lola: processed formula with 5 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 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= State_0_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 120 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: 0 markings, 0 edges
lola: state equation: write sara problem file to TokenRing-PT-005-CTLCardinality-9.sara
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((State_4_1 <= 1) OR (2 <= State_0_1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((State_4_1 <= 1) OR (2 <= State_0_1))
lola: processed formula length: 39
lola: 0 rewrites
lola: lola: formula mentions 0 of 36 places; total mentions: 0
lola: state equation: calling and running sara
closed formula file TokenRing-PT-005-CTLCardinality.task
lola: processed formula with 2 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 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((3 <= State_1_5)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (State_1_5 <= 2)))
lola: processed formula length: 31
lola: 2 rewrites
lola: formula mentions 0 of 36 places; total mentions: 0
lola: closed formula file TokenRing-PT-005-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 120 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
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: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G ((State_2_5 <= State_1_1))) OR TRUE)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
sara: try reading problem file TokenRing-PT-005-CTLCardinality-9.sara.
lola: 2 rewrites
lola: formula mentions 0 of 36 places; total mentions: 0
lola: closed formula file TokenRing-PT-005-CTLCardinality.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 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((State_2_5 + 1 <= State_4_5) OR ((State_0_5 <= State_3_5) OR E (G ((3 <= State_5_4))))) AND (E (X ((State_5_0 + 1 <= State_3_0))) OR (2 <= State_3_1)))
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: (State_2_5 + 1 <= State_4_5)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (State_2_5 + 1 <= State_4_5)
lola: processed formula length: 28
lola: 0 rewrites
lola: formula mentions 0 of 36 places; total mentions: 0
lola: closed formula file TokenRing-PT-005-CTLCardinality.task
lola: processed formula with 1 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 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (State_0_5 <= State_3_5)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (State_0_5 <= State_3_5)
lola: processed formula length: 24
lola: 0 rewrites
lola: formula mentions 0 of 36 places; total mentions: 0
lola: closed formula file TokenRing-PT-005-CTLCardinality.task
lola: processed formula with 1 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 ((State_5_0 + 1 <= State_3_0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((State_5_0 + 1 <= State_3_0))
lola: processed formula length: 32
lola: 1 rewrites
lola: formula mentions 0 of 36 places; total mentions: 0
lola: closed formula file TokenRing-PT-005-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 120 bytes per marking, with 0 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: subprocess 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (2 <= State_3_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= State_3_1)
lola: processed formula length: 16
lola: 0 rewrites
lola: formula mentions 0 of 36 places; total mentions: 0
lola: closed formula file TokenRing-PT-005-CTLCardinality.task
lola: processed formula with 1 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
sara: place or transition ordering is non-deterministic
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: A (G (((State_5_1 + 1 <= State_5_5) AND (State_3_3 <= 2) AND (State_0_4 <= State_3_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 120 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 TokenRing-PT-005-CTLCardinality-11.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2 markings, 1 edges

lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (((2 <= State_1_0) U (State_0_4 <= 0))) OR (State_0_4 <= State_3_2))
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 (((2 <= State_1_0) U (State_0_4 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
sara: try reading problem file TokenRing-PT-005-CTLCardinality-11.sara.
lola: processed formula: E((2 <= State_1_0) U (State_0_4 <= 0))
lola: processed formula length: 38
lola: 1 rewrites
lola: formula mentions 0 of 36 places; total mentions: 0
lola: closed formula file TokenRing-PT-005-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 120 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
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: 1 markings, 0 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: (State_0_5 <= State_0_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (State_0_5 <= State_0_2)
lola: processed formula length: 24
lola: 0 rewrites
lola: formula mentions 0 of 36 places; total mentions: 0
lola: closed formula file TokenRing-PT-005-CTLCardinality.task
lola: processed formula with 1 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 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (X (((2 <= State_5_0) AND (3 <= State_3_2) AND ((1 <= State_4_0) OR (1 <= State_5_4))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(((State_5_0 <= 1) OR (State_3_2 <= 2) OR ((State_4_0 <= 0) AND (State_5_4 <= 0))))
lola: processed formula length: 87
lola: 4 rewrites
lola: formula mentions 0 of 36 places; total mentions: 0
lola: closed formula file TokenRing-PT-005-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 120 bytes per marking, with 0 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 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (G (((State_3_3 <= State_1_1) AND (State_3_4 <= State_5_3)))) OR A (G ((3 <= State_1_5)))) OR ((State_1_0 <= State_3_3) OR A (((State_4_1 <= State_1_2) U (State_0_2 <= State_3_3)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((State_3_3 <= State_1_1) AND (State_3_4 <= State_5_3))))
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 120 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 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: write sara problem file to TokenRing-PT-005-CTLCardinality-15.sara
lola: The predicate is not invariant.
lola: 2 markings, 1 edges
lola: ========================================
lola: state equation: calling and running sara
sara: place or transition ordering is non-deterministic
lola: Child process aborted or communication problem between parent and child process
lola: sara: try reading problem file TokenRing-PT-005-CTLCardinality-15.sara.
subprocess 17 will run for 1 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (State_1_0 <= State_3_3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (State_1_0 <= State_3_3)
lola: processed formula length: 24
lola: 1 rewrites
lola: formula mentions 0 of 36 places; total mentions: 0
lola: closed formula file TokenRing-PT-005-CTLCardinality.task
lola: processed formula with 1 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no yes yes no yes yes no yes no no yes yes yes yes
sara: place or transition ordering is non-deterministic
sara: warning, failure of lp_solve (at job 824)
FORMULA TokenRing-PT-005-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TokenRing-PT-005-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TokenRing-PT-005-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TokenRing-PT-005-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TokenRing-PT-005-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TokenRing-PT-005-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TokenRing-PT-005-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TokenRing-PT-005-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TokenRing-PT-005-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TokenRing-PT-005-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TokenRing-PT-005-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TokenRing-PT-005-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TokenRing-PT-005-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TokenRing-PT-005-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TokenRing-PT-005-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TokenRing-PT-005-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stderr -----
----- Finished stdout -----

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="TokenRing-PT-005"
export BK_EXAMINATION="CTLCardinality"
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/TokenRing-PT-005.tgz
mv TokenRing-PT-005 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 TokenRing-PT-005, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r174-smll-152708745100311"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.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 ;