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 224K
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 13K 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.9K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.0K 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 111 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 349 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K 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: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
-rwxr-xr-x 1 mcc users 55K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is SquareGrid-PT-020102, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r162-smll-152705514100178
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527070712158


BK_STOP 1527070738023

--------------------
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 SquareGrid-PT-020102 as instance name.
Using SquareGrid 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': True, 'Conservative': True, 'Sub-Conservative': True, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': False, 'Quasi Live': True, 'Live': False}.
Known tools are: [{'Time': 46246, 'Memory': 7676.13, 'Tool': 'marcie'}, {'Time': 50407, 'Memory': 7676.16, 'Tool': 'marcie'}, {'Time': 2130333, 'Memory': 5671, 'Tool': 'lola'}, {'Time': 2130712, 'Memory': 6070.77, 'Tool': 'lola'}, {'Time': 3512343, 'Memory': 11814.62, 'Tool': 'itstools'}, {'Time': 3512413, 'Memory': 11833, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 46.06523807464429x far from the best tool marcie.
CTLCardinality marcie SquareGrid-PT-020102...
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: SquareGrid_PT_020102
(NrP: 68 NrTr: 72 NrArc: 288)

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

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

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

net check time: 0m 0.000sec

init dd package: 0m 1.803sec

check for maximal unmarked siphon
parse successfull
net created successfully

Net: SquareGrid_PT_020102
(NrP: 68 NrTr: 72 NrArc: 288)

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

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


initing FirstDep: 0m 0.000sec

net check time: 0m 0.000sec

init dd package: 0m 4.794sec


iterations count:11383 (158), effective:1118 (15)


RS generation: 0m 0.590sec


-> reachability set: #nodes 2034 (2.0e+03) #states 2,085,423,232,578 (12)



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

initing FirstDep: 0m 0.000sec

checking: ~ [EF [EG [2<=p2ol_2_2]]]
normalized: ~ [E [true U EG [2<=p2ol_2_2]]]

abstracting: (2<=p2ol_2_2)
states: 0
.
EG iterations: 1
-> the formula is TRUE

FORMULA SquareGrid-PT-020102-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.087sec

checking: ~ [AG [[~ [3<=p4il_1_2] | ~ [3<=p4il_2_1]]]]
normalized: E [true U ~ [[~ [3<=p4il_2_1] | ~ [3<=p4il_1_2]]]]

abstracting: (3<=p4il_1_2)
states: 0
abstracting: (3<=p4il_2_1)
states: 0
-> the formula is FALSE

FORMULA SquareGrid-PT-020102-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AF [AG [pb1_2_2<=p4ol_1_1]]
normalized: ~ [EG [E [true U ~ [pb1_2_2<=p4ol_1_1]]]]

abstracting: (pb1_2_2<=p4ol_1_1)
states: 1,661,424,281,626 (12)

iterations count:3053 (42), effective:246 (3)
....
EG iterations: 4
-> the formula is FALSE

FORMULA SquareGrid-PT-020102-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.948sec

checking: EG [AX [[1<=p1o_1_2 | 2<=pbl_2_1]]]
normalized: EG [~ [EX [~ [[1<=p1o_1_2 | 2<=pbl_2_1]]]]]

abstracting: (2<=pbl_2_1)
states: 1,878,473,281,986 (12)
abstracting: (1<=p1o_1_2)
states: 592,360,675,452 (11)
.......
EG iterations: 6
-> the formula is TRUE

FORMULA SquareGrid-PT-020102-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.831sec

checking: ~ [AF [pb1_1_2<=p4o_1_1]]
normalized: EG [~ [pb1_1_2<=p4o_1_1]]

abstracting: (pb1_1_2<=p4o_1_1)
states: 1,434,418,752,922 (12)
.....
EG iterations: 5
-> the formula is TRUE

FORMULA SquareGrid-PT-020102-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.318sec

checking: AX [AF [[3<=p2i_2_2 & 1<=p4ol_1_1]]]
normalized: ~ [EX [EG [~ [[3<=p2i_2_2 & 1<=p4ol_1_1]]]]]

abstracting: (1<=p4ol_1_1)
states: 1,493,062,557,126 (12)
abstracting: (3<=p2i_2_2)
states: 0

EG iterations: 0
.-> the formula is FALSE

FORMULA SquareGrid-PT-020102-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: ~ [EF [[3<=p4il_1_1 & [3<=pbl_1_2 | 3<=p3il_2_2]]]]
normalized: ~ [E [true U [3<=p4il_1_1 & [3<=pbl_1_2 | 3<=p3il_2_2]]]]

abstracting: (3<=p3il_2_2)
states: 0
abstracting: (3<=pbl_1_2)
states: 1,621,450,643,386 (12)
abstracting: (3<=p4il_1_1)
states: 0
-> the formula is TRUE

FORMULA SquareGrid-PT-020102-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AF [AG [[1<=p1ol_2_1 & p2i_1_2<=p1i_1_2]]]
normalized: ~ [EG [E [true U ~ [[1<=p1ol_2_1 & p2i_1_2<=p1i_1_2]]]]]

abstracting: (p2i_1_2<=p1i_1_2)
states: 1,656,051,315,618 (12)
abstracting: (1<=p1ol_2_1)
states: 1,493,062,557,126 (12)

iterations count:1249 (17), effective:92 (1)
....
EG iterations: 4
-> the formula is FALSE

FORMULA SquareGrid-PT-020102-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.628sec

checking: ~ [EF [[[1<=p1o_2_1 & pb2_1_2<=p1ol_1_1] & 2<=p4o_1_1]]]
normalized: ~ [E [true U [[1<=p1o_2_1 & pb2_1_2<=p1ol_1_1] & 2<=p4o_1_1]]]

abstracting: (2<=p4o_1_1)
states: 0
abstracting: (pb2_1_2<=p1ol_1_1)
states: 1,661,424,281,626 (12)
abstracting: (1<=p1o_2_1)
states: 592,360,675,452 (11)
-> the formula is TRUE

FORMULA SquareGrid-PT-020102-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.012sec

checking: EG [[EX [p4i_1_1<=pb3_2_2] | AG [pb1_2_2<=p4ol_1_1]]]
normalized: EG [[~ [E [true U ~ [pb1_2_2<=p4ol_1_1]]] | EX [p4i_1_1<=pb3_2_2]]]

abstracting: (p4i_1_1<=pb3_2_2)
states: 1,710,070,304,850 (12)
.abstracting: (pb1_2_2<=p4ol_1_1)
states: 1,661,424,281,626 (12)

iterations count:3053 (42), effective:246 (3)
.....
EG iterations: 5
-> the formula is TRUE

FORMULA SquareGrid-PT-020102-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.430sec

checking: E [[~ [2<=pbl_2_2] & ~ [p1o_2_2<=p1ol_1_1]] U AF [p4il_2_1<=p1o_2_1]]
normalized: E [[~ [p1o_2_2<=p1ol_1_1] & ~ [2<=pbl_2_2]] U ~ [EG [~ [p4il_2_1<=p1o_2_1]]]]

abstracting: (p4il_2_1<=p1o_2_1)
states: 1,021,732,592,412 (12)
......................................
EG iterations: 38
abstracting: (2<=pbl_2_2)
states: 1,878,473,281,986 (12)
abstracting: (p1o_2_2<=p1ol_1_1)
states: 1,922,434,474,086 (12)

iterations count:955 (13), effective:69 (0)
-> the formula is FALSE

FORMULA SquareGrid-PT-020102-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.519sec

checking: [[p1il_2_1<=p4o_2_1 | EG [1<=p4ol_2_2]] & [EX [~ [2<=pbl_2_2]] | ~ [AX [3<=pb1_2_2]]]]
normalized: [[EX [~ [2<=pbl_2_2]] | EX [~ [3<=pb1_2_2]]] & [p1il_2_1<=p4o_2_1 | EG [1<=p4ol_2_2]]]

abstracting: (1<=p4ol_2_2)
states: 1,493,062,557,126 (12)
......
EG iterations: 6
abstracting: (p1il_2_1<=p4o_2_1)
states: 1,021,732,592,412 (12)
abstracting: (3<=pb1_2_2)
states: 90,137,146,432 (10)
.abstracting: (2<=pbl_2_2)
states: 1,878,473,281,986 (12)
.-> the formula is TRUE

FORMULA SquareGrid-PT-020102-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.297sec

checking: EG [[~ [~ [p1il_2_1<=p4il_1_2]] | [[p3il_2_1<=p2ol_1_2 | p1i_2_2<=pb2_2_1] | ~ [2<=p1ol_2_1]]]]
normalized: EG [[p1il_2_1<=p4il_1_2 | [~ [2<=p1ol_2_1] | [p3il_2_1<=p2ol_1_2 | p1i_2_2<=pb2_2_1]]]]

abstracting: (p1i_2_2<=pb2_2_1)
states: 1,710,070,304,850 (12)
abstracting: (p3il_2_1<=p2ol_1_2)
states: 1,656,051,315,618 (12)
abstracting: (2<=p1ol_2_1)
states: 0
abstracting: (p1il_2_1<=p4il_1_2)
states: 1,656,051,315,618 (12)

EG iterations: 0
-> the formula is TRUE

FORMULA SquareGrid-PT-020102-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.014sec

checking: [E [[1<=pb1_2_2 & 1<=pb1_2_2] U ~ [p4il_1_1<=pbl_2_1]] & ~ [AG [[p3ol_2_1<=pbl_2_2 | 2<=p4i_2_1]]]]
normalized: [E [true U ~ [[p3ol_2_1<=pbl_2_2 | 2<=p4i_2_1]]] & E [[1<=pb1_2_2 & 1<=pb1_2_2] U ~ [p4il_1_1<=pbl_2_1]]]

abstracting: (p4il_1_1<=pbl_2_1)
states: 2,034,138,849,834 (12)
abstracting: (1<=pb1_2_2)
states: 794,343,606,432 (11)
abstracting: (1<=pb1_2_2)
states: 794,343,606,432 (11)

iterations count:7254 (100), effective:556 (7)
abstracting: (2<=p4i_2_1)
states: 0
abstracting: (p3ol_2_1<=pbl_2_2)
states: 2,034,138,849,834 (12)

iterations count:4805 (66), effective:449 (6)
-> the formula is TRUE

FORMULA SquareGrid-PT-020102-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.536sec

checking: ~ [[EG [[p3i_2_1<=pb3_2_1 & p3i_2_2<=p4i_1_1]] | EG [[p4ol_1_2<=p2i_1_2 | p1ol_1_2<=p3ol_2_2]]]]
normalized: ~ [[EG [[p4ol_1_2<=p2i_1_2 | p1ol_1_2<=p3ol_2_2]] | EG [[p3i_2_1<=pb3_2_1 & p3i_2_2<=p4i_1_1]]]]

abstracting: (p3i_2_2<=p4i_1_1)
states: 1,656,051,315,618 (12)
abstracting: (p3i_2_1<=pb3_2_1)
states: 1,710,070,304,850 (12)
.......
EG iterations: 7
abstracting: (p1ol_1_2<=p3ol_2_2)
states: 1,656,051,315,618 (12)
abstracting: (p4ol_1_2<=p2i_1_2)
states: 1,021,732,592,412 (12)
......
EG iterations: 6
-> the formula is FALSE

FORMULA SquareGrid-PT-020102-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.942sec

checking: [[[EX [3<=p1o_1_1] | [pb3_2_2<=p1ol_1_1 | p1il_0<=p4il_1_2]] | EG [[2<=pb1_1_2 & 2<=p4il_2_1]]] & [[EF [3<=p1ol_2_2] | AG [p1ol_2_2<=pb4_1_1]] & EX [~ [1<=p1o_2_2]]]]
normalized: [[EX [~ [1<=p1o_2_2]] & [~ [E [true U ~ [p1ol_2_2<=pb4_1_1]]] | E [true U 3<=p1ol_2_2]]] & [EG [[2<=pb1_1_2 & 2<=p4il_2_1]] | [[pb3_2_2<=p1ol_1_1 | p1il_0<=p4il_1_2] | EX [3<=p1o_1_1]]]]

abstracting: (3<=p1o_1_1)
states: 0
.abstracting: (p1il_0<=p4il_1_2)
states: 1,656,051,315,618 (12)
abstracting: (pb3_2_2<=p1ol_1_1)
states: 1,661,424,281,626 (12)
abstracting: (2<=p4il_2_1)
states: 0
abstracting: (2<=pb1_1_2)
states: 280,659,824,176 (11)
.
EG iterations: 1
abstracting: (3<=p1ol_2_2)
states: 0
abstracting: (p1ol_2_2<=pb4_1_1)
states: 1,169,696,534,160 (12)

iterations count:674 (9), effective:63 (0)
abstracting: (1<=p1o_2_2)
states: 592,360,675,452 (11)
.-> the formula is FALSE

FORMULA SquareGrid-PT-020102-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.344sec

totally nodes used: 2506958 (2.5e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 23687066 15566085 39253151
used/not used/entry size/cache size: 16178817 50930047 16 1024MB
basic ops cache: hits/miss/sum: 2275808 1746986 4022794
used/not used/entry size/cache size: 2665814 14111402 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: 48661 35778 84439
used/not used/entry size/cache size: 35716 8352892 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 64811140
1 2178107
2 94739
3 12164
4 4393
5 2701
6 1869
7 950
8 486
9 358
>= 10 1957

Total processing time: 0m20.336sec

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="SquareGrid-PT-020102"
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/SquareGrid-PT-020102.tgz
mv SquareGrid-PT-020102 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 SquareGrid-PT-020102, 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 r162-smll-152705514100178"
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 ;