fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r114-csrt-152666472500339
Last Updated
June 26, 2018

About the Execution of Irma.full for PaceMaker-PT-none

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
8283.410 32230.00 34296.00 133.20 FFFTTTFFTTTTTTTF 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 316K
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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 5.5K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.2K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 108 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 346 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K 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.7K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 5 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 158K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is PaceMaker-PT-none, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-csrt-152666472500339
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1527140796756


BK_STOP 1527140828986

--------------------
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 PaceMaker-PT-none as instance name.
Using PaceMaker 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': False, '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': False, 'Deadlock': False, 'Reversible': True, 'Quasi Live': True, 'Live': True}.
Known tools are: [{'Time': 26146, 'Memory': 7871.72, 'Tool': 'marcie'}, {'Time': 27045, 'Memory': 7871.94, 'Tool': 'marcie'}, {'Time': 1326285, 'Memory': 9697.13, 'Tool': 'itstools'}, {'Time': 1474764, 'Memory': 9688.37, 'Tool': 'itstools'}, {'Time': 3350081, 'Memory': 2496.19, 'Tool': 'gspn'}, {'Time': 3368907, 'Memory': 2524.26, 'Tool': 'gspn'}, {'Time': 3540128, 'Memory': 15307.32, 'Tool': 'lola'}, {'Time': 3540234, 'Memory': 15306.49, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 135.3984548305668x far from the best tool marcie.
CTLCardinality marcie PaceMaker-PT-none...
timeout --kill-after=10s --signal=SIGINT 1m for testing only
check for maximal unmarked siphon

Marcie rev. 8852M (built: crohr on 2017-05-03)
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: marcie --net-file=model.pnml --mcc-file=CTLCardinality.xml --memory=6

parse successfull
net created successfully

Net: PaceMaker_PT_none
(NrP: 70 NrTr: 164 NrArc: 954)

ok
check for constant places
ok
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.002sec

check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok

net check time: 0m 0.000sec

init dd package: 0m 1.638sec

ptnet_zbdd.cc:255: Boundedness exception: net is not 1-bounded!

parse successfull
net created successfully

Net: PaceMaker_PT_none
(NrP: 70 NrTr: 164 NrArc: 954)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.002sec

check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


net check time: 0m 0.000sec

init dd package: 0m 5.094sec

initing FirstDep: 0m 0.000sec


iterations count:22234 (135), effective:1515 (9)

RS generation: 0m 0.491sec


-> reachability set: #nodes 776 (7.8e+02) #states 368,026,085,700,403,200 (17)



starting MCC model checker
--------------------------


initing FirstDep: 0m 0.000sec


iterations count:4999 (30), effective:351 (2)
checking: AG [A_SIG_Clk0<=A_SIG_VPOut]
normalized: ~ [E [true U ~ [A_SIG_Clk0<=A_SIG_VPOut]]]

abstracting: (A_SIG_Clk0<=A_SIG_VPOut)
states: 276,043,420,296,806,400 (17)
-> the formula is FALSE

FORMULA PaceMaker-PT-none-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.822sec

checking: AG [EF [~ [A_VRP<=SANodeEctopic]]]
normalized: ~ [E [true U ~ [E [true U ~ [A_VRP<=SANodeEctopic]]]]]

abstracting: (A_VRP<=SANodeEctopic)
states: 257,618,259,990,282,240 (17)

iterations count:1093 (6), effective:68 (0)

iterations count:1640 (10), effective:125 (0)
-> the formula is FALSE

FORMULA PaceMaker-PT-none-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.345sec

checking: E [2<=A_AVJ U 1<=SIG_VP]
normalized: E [2<=A_AVJ U 1<=SIG_VP]

abstracting: (1<=SIG_VP)
states: 184,013,042,850,201,600 (17)
abstracting: (2<=A_AVJ)
states: 368,026,085,700,403,200 (17)

iterations count:2204 (13), effective:50 (0)
-> the formula is TRUE

FORMULA PaceMaker-PT-none-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.326sec

checking: AF [[AF [1<=URI] & AG [1<=A_SIG_State]]]
normalized: ~ [EG [~ [[~ [E [true U ~ [1<=A_SIG_State]]] & ~ [EG [~ [1<=URI]]]]]]]

abstracting: (1<=URI)
states: 368,026,085,700,403,200 (17)
.
EG iterations: 1
abstracting: (1<=A_SIG_State)
states: 184,013,042,850,201,600 (17)

iterations count:2698 (16), effective:55 (0)
.
EG iterations: 1
-> the formula is FALSE

FORMULA PaceMaker-PT-none-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.489sec

checking: AX [EF [A_AVJOut<=A_SIG_VPOut]]
normalized: ~ [EX [~ [E [true U A_AVJOut<=A_SIG_VPOut]]]]

abstracting: (A_AVJOut<=A_SIG_VPOut)
states: 0
.-> the formula is FALSE

FORMULA PaceMaker-PT-none-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.012sec

checking: AG [EG [[2<=VRG | AtrNoiseGenerator<=A_PVARP]]]
normalized: ~ [E [true U ~ [EG [[2<=VRG | AtrNoiseGenerator<=A_PVARP]]]]]

abstracting: (AtrNoiseGenerator<=A_PVARP)
states: 184,013,042,850,201,600 (17)
abstracting: (2<=VRG)
states: 368,026,085,700,403,200 (17)

EG iterations: 0
-> the formula is TRUE

FORMULA PaceMaker-PT-none-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.023sec

checking: EF [E [2<=SIG_AgetOut U A_AtrNoiseGenerator<=SIG_State]]
normalized: E [true U E [2<=SIG_AgetOut U A_AtrNoiseGenerator<=SIG_State]]

abstracting: (A_AtrNoiseGenerator<=SIG_State)
states: 0
abstracting: (2<=SIG_AgetOut)
states: 0
-> the formula is FALSE

FORMULA PaceMaker-PT-none-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.024sec

checking: AG [[AF [3<=A_PVARP] | EF [A_SIG_VS<=A_LRI]]]
normalized: ~ [E [true U ~ [[E [true U A_SIG_VS<=A_LRI] | ~ [EG [~ [3<=A_PVARP]]]]]]]

abstracting: (3<=A_PVARP)
states: 368,026,085,700,403,200 (17)
.
EG iterations: 1
abstracting: (A_SIG_VS<=A_LRI)
states: 368,026,085,700,403,200 (17)

iterations count:164 (1), effective:0 (0)

iterations count:164 (1), effective:0 (0)
-> the formula is TRUE

FORMULA PaceMaker-PT-none-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.042sec

checking: AG [E [A_URI<=A_URI U 2<=URI]]
normalized: ~ [E [true U ~ [E [A_URI<=A_URI U 2<=URI]]]]

abstracting: (2<=URI)
states: 368,026,085,700,403,200 (17)
abstracting: (A_URI<=A_URI)
states: 368,026,085,700,403,200 (17)
-> the formula is TRUE

FORMULA PaceMaker-PT-none-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT


iterations count:164 (1), effective:0 (0)
MC time: 0m 0.003sec

checking: [EX [AG [1<=A_RVConductor]] | ~ [AG [[3<=AtrNoiseGenerator | 3<=A_SANode]]]]
normalized: [E [true U ~ [[3<=AtrNoiseGenerator | 3<=A_SANode]]] | EX [~ [E [true U ~ [1<=A_RVConductor]]]]]

abstracting: (1<=A_RVConductor)
states: 368,026,085,700,403,200 (17)
.abstracting: (3<=A_SANode)
states: 368,026,085,700,403,200 (17)
abstracting: (3<=AtrNoiseGenerator)
states: 368,026,085,700,403,200 (17)
-> the formula is TRUE

FORMULA PaceMaker-PT-none-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: E [EX [1<=A_SIG_Aget] U AG [SIG_AS<=A_SANode]]
normalized: E [EX [1<=A_SIG_Aget] U ~ [E [true U ~ [SIG_AS<=A_SANode]]]]

abstracting: (SIG_AS<=A_SANode)
states: 368,026,085,700,403,200 (17)
abstracting: (1<=A_SIG_Aget)
states: 184,013,042,850,201,600 (17)

iterations count:7271 (44), effective:593 (3)
.-> the formula is TRUE

FORMULA PaceMaker-PT-none-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.120sec

checking: EF [[[SIG_VP<=A_SIG_APOut | 1<=A_VRP] & ~ [[1<=A_PVARP | 2<=A_dV]]]]
normalized: E [true U [~ [[1<=A_PVARP | 2<=A_dV]] & [SIG_VP<=A_SIG_APOut | 1<=A_VRP]]]

abstracting: (1<=A_VRP)
states: 368,026,085,700,403,200 (17)
abstracting: (SIG_VP<=A_SIG_APOut)
states: 276,077,933,494,272,000 (17)
abstracting: (2<=A_dV)
states: 368,026,085,700,403,200 (17)
abstracting: (1<=A_PVARP)
states: 368,026,085,700,403,200 (17)
-> the formula is FALSE

FORMULA PaceMaker-PT-none-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: E [~ [[1<=SIG_VPOut & A_AVJOut<=SANodeEctopic]] U EF [A_RVConductor<=VRGEctopic]]
normalized: E [~ [[1<=SIG_VPOut & A_AVJOut<=SANodeEctopic]] U E [true U A_RVConductor<=VRGEctopic]]

abstracting: (A_RVConductor<=VRGEctopic)
states: 140,751,061,961,932,800 (17)

iterations count:164 (1), effective:0 (0)
abstracting: (A_AVJOut<=SANodeEctopic)
states: 66,699,117,409,075,200 (16)
abstracting: (1<=SIG_VPOut)
states: 183,965,330,807,193,600 (17)
-> the formula is TRUE

FORMULA PaceMaker-PT-none-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.479sec

checking: ~ [[EF [[2<=AVI & A_Ventricle<=A_SIG_VPOut]] | A [AVJ<=A_dV U 2<=A_SIG_Vget]]]
normalized: ~ [[[~ [EG [~ [2<=A_SIG_Vget]]] & ~ [E [~ [2<=A_SIG_Vget] U [~ [AVJ<=A_dV] & ~ [2<=A_SIG_Vget]]]]] | E [true U [2<=AVI & A_Ventricle<=A_SIG_VPOut]]]]

abstracting: (A_Ventricle<=A_SIG_VPOut)
states: 0
abstracting: (2<=AVI)
states: 368,026,085,700,403,200 (17)
abstracting: (2<=A_SIG_Vget)
states: 0
abstracting: (AVJ<=A_dV)
states: 208,319,162,823,475,200 (17)
abstracting: (2<=A_SIG_Vget)
states: 0

iterations count:6915 (42), effective:486 (2)
abstracting: (2<=A_SIG_Vget)
states: 0

EG iterations: 0
-> the formula is TRUE

FORMULA PaceMaker-PT-none-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.668sec

checking: [AF [EF [A_RAConductor<=A_SANodeEctopic]] | AF [[[1<=SIG_AS & 1<=A_SANodeEctopic] | [3<=A_SANode & A_dV<=A_AVJ]]]]
normalized: [~ [EG [~ [[[3<=A_SANode & A_dV<=A_AVJ] | [1<=SIG_AS & 1<=A_SANodeEctopic]]]]] | ~ [EG [~ [E [true U A_RAConductor<=A_SANodeEctopic]]]]]

abstracting: (A_RAConductor<=A_SANodeEctopic)
states: 69,122,978,375,270,400 (16)

iterations count:5810 (35), effective:272 (1)
.
EG iterations: 1
abstracting: (1<=A_SANodeEctopic)
states: 368,026,085,700,403,200 (17)
abstracting: (1<=SIG_AS)
states: 184,013,042,850,201,600 (17)
abstracting: (A_dV<=A_AVJ)
states: 0
abstracting: (3<=A_SANode)
states: 368,026,085,700,403,200 (17)
.
EG iterations: 1
-> the formula is TRUE

FORMULA PaceMaker-PT-none-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.995sec

checking: AG [[[[2<=A_AVJOut | A_AVJOut<=SIG_VgetOut] | [RAConductor<=SIG_AP & 1<=PVARP]] | ~ [[SIG_AgetOut<=URI & 1<=SIG_Aget]]]]
normalized: ~ [E [true U ~ [[~ [[SIG_AgetOut<=URI & 1<=SIG_Aget]] | [[RAConductor<=SIG_AP & 1<=PVARP] | [2<=A_AVJOut | A_AVJOut<=SIG_VgetOut]]]]]]

abstracting: (A_AVJOut<=SIG_VgetOut)
states: 0
abstracting: (2<=A_AVJOut)
states: 368,026,085,700,403,200 (17)
abstracting: (1<=PVARP)
states: 368,026,085,700,403,200 (17)
abstracting: (RAConductor<=SIG_AP)
states: 0
abstracting: (1<=SIG_Aget)
states: 184,013,042,850,201,600 (17)
abstracting: (SIG_AgetOut<=URI)
states: 368,026,085,700,403,200 (17)
-> the formula is TRUE

FORMULA PaceMaker-PT-none-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.733sec

totally nodes used: 4223824 (4.2e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 6294322 6868340 13162662
used/not used/entry size/cache size: 8003780 59105084 16 1024MB
basic ops cache: hits/miss/sum: 2179078 4322476 6501554
used/not used/entry size/cache size: 6915239 9861977 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 5875 7260 13135
used/not used/entry size/cache size: 7259 8381349 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 65304932
1 1747612
2 43950
3 3437
4 2019
5 599
6 614
7 555
8 343
9 218
>= 10 4585

Total processing time: 0m29.484sec

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="PaceMaker-PT-none"
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/PaceMaker-PT-none.tgz
mv PaceMaker-PT-none 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 PaceMaker-PT-none, 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 r114-csrt-152666472500339"
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 ;