About the Execution of M4M.struct for CircadianClock-PT-001000
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15911.540 | 220096.00 | 225647.00 | 842.80 | ???????????????? | normal |
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 180K
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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.2K May 15 18:49 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.3K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 115 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 353 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 23K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:49 equiv_col
-rw-r--r-- 1 mcc users 7 May 15 18:49 instance
-rw-r--r-- 1 mcc users 6 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 11K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-structural
Input is CircadianClock-PT-001000, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r035-ebro-152646315600500
=====================================================================
--------------------
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 CircadianClock-PT-001000-CTLCardinality-00
FORMULA_NAME CircadianClock-PT-001000-CTLCardinality-01
FORMULA_NAME CircadianClock-PT-001000-CTLCardinality-02
FORMULA_NAME CircadianClock-PT-001000-CTLCardinality-03
FORMULA_NAME CircadianClock-PT-001000-CTLCardinality-04
FORMULA_NAME CircadianClock-PT-001000-CTLCardinality-05
FORMULA_NAME CircadianClock-PT-001000-CTLCardinality-06
FORMULA_NAME CircadianClock-PT-001000-CTLCardinality-07
FORMULA_NAME CircadianClock-PT-001000-CTLCardinality-08
FORMULA_NAME CircadianClock-PT-001000-CTLCardinality-09
FORMULA_NAME CircadianClock-PT-001000-CTLCardinality-10
FORMULA_NAME CircadianClock-PT-001000-CTLCardinality-11
FORMULA_NAME CircadianClock-PT-001000-CTLCardinality-12
FORMULA_NAME CircadianClock-PT-001000-CTLCardinality-13
FORMULA_NAME CircadianClock-PT-001000-CTLCardinality-14
FORMULA_NAME CircadianClock-PT-001000-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1527146908989
BK_STOP 1527147129085
--------------------
content from stderr:
Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using CircadianClock-PT-001000 as instance name.
Using CircadianClock as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', 'Place/Transition': True, 'Colored': False, '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': None, 'Quasi Live': True, 'Live': True}.
Known tools are: [{'Time': 616189, 'Memory': 15951.75, 'Tool': 'lola'}, {'Time': 638390, 'Memory': 15951.13, 'Tool': 'lola'}, {'Time': 987148, 'Memory': 6765.91, 'Tool': 'itstools'}, {'Time': 1132234, 'Memory': 6730.34, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola CircadianClock-PT-001000...
Time: 3600 - MCC
----- Start make prepare stderr -----
----- Start make prepare stdout -----
===========================================================================================
CircadianClock-PT-001000: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
CircadianClock-PT-001000: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ CircadianClock-PT-001000 @ 3540 seconds
make: [verify] Error 134 (ignored)
----- Start make result stderr -----
Makefile:222: recipe for target 'verify' failed
----- 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: 30/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 14 places, 16 transitions, 7 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 26 transition conflict sets
lola: TASK
lola: reading formula from CircadianClock-PT-001000-CTLCardinality.task
lola: A (G (((r <= ma_cap) OR E (G ((c_cap <= da)))))) : A (G (A (G ((c <= 2))))) : (A (((a <= mr_cap) U ((2 <= r) OR (1 <= ma)))) OR E (X (A (G ((2 <= a_cap)))))) : A (((3 <= mr) U E (F ((3 <= da_a))))) : ((da_a <= a_cap) AND E (F (E (X ((r_cap <= r)))))) : (A (F (A (X ((3 <= mr))))) OR E (F (E (X ((c_cap <= dr_a)))))) : (E (F ((3 <= dr_a))) OR E (X (E (X ((2 <= dr)))))) : A (G ((ma + 1 <= c_cap))) : ((E (F ((r_cap <= a))) AND E (F ((a_cap + 1 <= c)))) AND (ma <= 2)) : NOT(NOT((A (G (TRUE)) OR A (G ((dr <= a_cap)))))) : A (G (A (G (((3 <= a_cap) OR (2 <= ma_cap)))))) : A ((((da <= 2) AND (ma_cap + 1 <= mr)) U A (G ((da_a <= mr_cap))))) : A (G (A (G ((r + 1 <= ma_cap))))) : A (G (A (F ((1 <= mr_cap))))) : NOT(A (G (E (X ((3 <= ma_cap)))))) : (((ma <= da) OR (da_a <= r_cap)) AND A (G (((r_cap <= c) OR ((2 <= r_cap) AND (ma <= a_cap))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((r <= ma_cap) OR E (G ((c_cap <= da))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U ((ma_cap + 1 <= r) AND A(TRUE U (da + 1 <= c_cap)))))
lola: processed formula length: 66
lola: 6 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-001000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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 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: 1002002 markings, 1502502 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (G ((c <= 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 28 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: 12 markings, 13 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (((a <= mr_cap) U ((2 <= r) OR (1 <= ma)))) OR E (X (A (G ((2 <= a_cap))))))
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 (((a <= mr_cap) U ((2 <= r) OR (1 <= ma))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((a <= mr_cap) U ((2 <= r) OR (1 <= ma))))
lola: processed formula: A (((a <= mr_cap) U ((2 <= r) OR (1 <= ma))))
lola: processed formula length: 46
lola: 0 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-001000-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
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: 4 markings, 4 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (A (G ((2 <= a_cap)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(NOT(E(TRUE U (a_cap <= 1))))
lola: processed formula length: 31
lola: 3 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-001000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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 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: 1004000 markings, 1504499 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: A (((3 <= mr) U E (F ((3 <= da_a)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((3 <= mr) U E(TRUE U (3 <= da_a)))
lola: processed formula length: 36
lola: 2 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-001000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 2768478 markings, 5034573 edges, 3689329903141912576 markings/sec, 0 secs
lola: 5060596 markings, 9616176 edges, 458424 markings/sec, 5 secs
lola: 7249341 markings, 13992860 edges, 437749 markings/sec, 10 secs
lola: 9473761 markings, 18441448 edges, 444884 markings/sec, 15 secs
lola: 11601372 markings, 22695463 edges, 425522 markings/sec, 20 secs
lola: 13696889 markings, 26885410 edges, 419103 markings/sec, 25 secs
lola: 15736420 markings, 30964001 edges, 407906 markings/sec, 30 secs
lola: 17978979 markings, 35447918 edges, 448512 markings/sec, 35 secs
lola: 20137762 markings, 39762935 edges, 431757 markings/sec, 40 secs
lola: 22264601 markings, 44016088 edges, 425368 markings/sec, 45 secs
lola: 24312805 markings, 48111765 edges, 409641 markings/sec, 50 secs
lola: 26456410 markings, 52397788 edges, 428721 markings/sec, 55 secs
lola: 28516492 markings, 56517112 edges, 412016 markings/sec, 60 secs
lola: 30534309 markings, 60551581 edges, 403563 markings/sec, 65 secs
lola: 32571283 markings, 64625089 edges, 407395 markings/sec, 70 secs
lola: 34842190 markings, 69165666 edges, 454181 markings/sec, 75 secs
lola: 36886782 markings, 73254499 edges, 408918 markings/sec, 80 secs
lola: 38952411 markings, 77384475 edges, 413126 markings/sec, 85 secs
lola: 41037013 markings, 81553395 edges, 416920 markings/sec, 90 secs
lola: 43109220 markings, 85694112 edges, 414441 markings/sec, 95 secs
lola: 45113862 markings, 89703037 edges, 400928 markings/sec, 100 secs
lola: 46862573 markings, 93200787 edges, 349742 markings/sec, 105 secs
lola: 48668860 markings, 96812349 edges, 361257 markings/sec, 110 secs
lola: 50667155 markings, 100808078 edges, 399659 markings/sec, 115 secs
lola: 52576728 markings, 104625792 edges, 381915 markings/sec, 120 secs
lola: 54459312 markings, 108389919 edges, 376517 markings/sec, 125 secs
lola: 56299008 markings, 112068199 edges, 367939 markings/sec, 130 secs
lola: 58251041 markings, 115971213 edges, 390407 markings/sec, 135 secs
lola: 60114599 markings, 119696675 edges, 372712 markings/sec, 140 secs
lola: 61971749 markings, 123411905 edges, 371430 markings/sec, 145 secs
lola: 63752387 markings, 126971920 edges, 356128 markings/sec, 150 secs
lola: 65874092 markings, 131214769 edges, 424341 markings/sec, 155 secs
lola: 68007516 markings, 135480230 edges, 426685 markings/sec, 160 secs
lola: 70104759 markings, 139673811 edges, 419449 markings/sec, 165 secs
lola: 72081207 markings, 143625399 edges, 395290 markings/sec, 170 secs
lola: 74165215 markings, 147791349 edges, 416802 markings/sec, 175 secs
lola: 76142899 markings, 151745540 edges, 395537 markings/sec, 180 secs
lola: 78122581 markings, 155705646 edges, 395936 markings/sec, 185 secs
lola: 80008031 markings, 159475718 edges, 377090 markings/sec, 190 secs
lola: 82062053 markings, 163582858 edges, 410804 markings/sec, 195 secs
lola: 83991811 markings, 167441018 edges, 385952 markings/sec, 200 secs
lola: Child process aborted or communication problem between parent and child process
terminate called after throwing an instance of 'std::runtime_error'
what(): parse error at position 0: unexpected character, last read: '
'
Aborted (core dumped)
FORMULA CircadianClock-PT-001000-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-001000-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-001000-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-001000-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-001000-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-001000-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-001000-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-001000-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-001000-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-001000-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-001000-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-001000-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-001000-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-001000-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-001000-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-001000-CTLCardinality-15 CANNOT_COMPUTE 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="CircadianClock-PT-001000"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="mcc4mcc-structural"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
tar xzf /home/mcc/BenchKit/INPUTS/CircadianClock-PT-001000.tgz
mv CircadianClock-PT-001000 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-structural"
echo " Input is CircadianClock-PT-001000, 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 r035-ebro-152646315600500"
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 '
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 ;