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)
..............
=====================================================================
Generated by BenchKit 2-3253
Executing tool marcie
Input is Diffusion2D-PT-D05N010, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r011-ebro-149436297300358
=====================================================================

--------------------
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 Diffusion2D-PT-D05N010-ReachabilityCardinality-0
FORMULA_NAME Diffusion2D-PT-D05N010-ReachabilityCardinality-1
FORMULA_NAME Diffusion2D-PT-D05N010-ReachabilityCardinality-10
FORMULA_NAME Diffusion2D-PT-D05N010-ReachabilityCardinality-11
FORMULA_NAME Diffusion2D-PT-D05N010-ReachabilityCardinality-12
FORMULA_NAME Diffusion2D-PT-D05N010-ReachabilityCardinality-13
FORMULA_NAME Diffusion2D-PT-D05N010-ReachabilityCardinality-14
FORMULA_NAME Diffusion2D-PT-D05N010-ReachabilityCardinality-15
FORMULA_NAME Diffusion2D-PT-D05N010-ReachabilityCardinality-2
FORMULA_NAME Diffusion2D-PT-D05N010-ReachabilityCardinality-3
FORMULA_NAME Diffusion2D-PT-D05N010-ReachabilityCardinality-4
FORMULA_NAME Diffusion2D-PT-D05N010-ReachabilityCardinality-5
FORMULA_NAME Diffusion2D-PT-D05N010-ReachabilityCardinality-6
FORMULA_NAME Diffusion2D-PT-D05N010-ReachabilityCardinality-7
FORMULA_NAME Diffusion2D-PT-D05N010-ReachabilityCardinality-8
FORMULA_NAME Diffusion2D-PT-D05N010-ReachabilityCardinality-9

=== Now, execution of the tool begins

BK_START 1494456493638

timeout --kill-after=10s --signal=SIGINT 1m for testing only

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=ReachabilityCardinality.xml --memory=6

parse successfull
net created successfully

Net: Diffusion2D_PT_D05N010
(NrP: 25 NrTr: 144 NrArc: 288)

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

net check time: 0m 0.000sec

init dd package: 0m 2.314sec

parse successfull
net created successfully

Net: Diffusion2D_PT_D05N010
(NrP: 25 NrTr: 144 NrArc: 288)

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

net check time: 0m 0.000sec

init dd package: 0m 7.960sec


RS generation: 0m 0.090sec


-> reachability set: #nodes 265 (2.6e+02) #states 131,128,140 (8)



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

checking: AG [1<=cAMP__3_3_]
normalized: ~ [E [true U ~ [1<=cAMP__3_3_]]]

abstracting: (1<=cAMP__3_3_)
states: 38,567,100 (7)
-> the formula is FALSE

FORMULA Diffusion2D-PT-D05N010-ReachabilityCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.054sec

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

abstracting: (2<=cAMP__1_3_)
states: 10,518,300 (7)
-> the formula is FALSE

FORMULA Diffusion2D-PT-D05N010-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.155sec

checking: EF [~ [~ [[3<=cAMP__2_2_ & 2<=cAMP__4_1_]]]]
normalized: E [true U [3<=cAMP__2_2_ & 2<=cAMP__4_1_]]

abstracting: (2<=cAMP__4_1_)
states: 10,518,300 (7)
abstracting: (3<=cAMP__2_2_)
states: 2,629,575 (6)
-> the formula is TRUE

FORMULA Diffusion2D-PT-D05N010-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.227sec

checking: AG [[2<=cAMP__3_3_ | cAMP__3_1_<=cAMP__1_2_]]
normalized: ~ [E [true U ~ [[2<=cAMP__3_3_ | cAMP__3_1_<=cAMP__1_2_]]]]

abstracting: (cAMP__3_1_<=cAMP__1_2_)
states: 100,942,636 (8)
abstracting: (2<=cAMP__3_3_)
states: 10,518,300 (7)
-> the formula is FALSE

FORMULA Diffusion2D-PT-D05N010-ReachabilityCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.123sec

checking: EF [~ [[cAMP__5_5_<=cAMP__3_1_ | [3<=cAMP__3_3_ | 3<=cAMP__1_1_]]]]
normalized: E [true U ~ [[[3<=cAMP__3_3_ | 3<=cAMP__1_1_] | cAMP__5_5_<=cAMP__3_1_]]]

abstracting: (cAMP__5_5_<=cAMP__3_1_)
states: 100,942,636 (8)
abstracting: (3<=cAMP__1_1_)
states: 2,629,575 (6)
abstracting: (3<=cAMP__3_3_)
states: 2,629,575 (6)
-> the formula is TRUE

FORMULA Diffusion2D-PT-D05N010-ReachabilityCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.116sec

checking: EF [[2<=cAMP__5_4_ & [3<=cAMP__2_5_ & [1<=cAMP__2_4_ & 3<=cAMP__3_2_]]]]
normalized: E [true U [2<=cAMP__5_4_ & [[1<=cAMP__2_4_ & 3<=cAMP__3_2_] & 3<=cAMP__2_5_]]]

abstracting: (3<=cAMP__2_5_)
states: 2,629,575 (6)
abstracting: (3<=cAMP__3_2_)
states: 2,629,575 (6)
abstracting: (1<=cAMP__2_4_)
states: 38,567,100 (7)
abstracting: (2<=cAMP__5_4_)
states: 10,518,300 (7)
-> the formula is TRUE

FORMULA Diffusion2D-PT-D05N010-ReachabilityCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.128sec

checking: AG [~ [[[cAMP__1_1_<=cAMP__5_3_ | 3<=cAMP__4_4_] & [3<=cAMP__1_4_ & 3<=cAMP__4_1_]]]]
normalized: ~ [E [true U [[3<=cAMP__1_4_ & 3<=cAMP__4_1_] & [cAMP__1_1_<=cAMP__5_3_ | 3<=cAMP__4_4_]]]]

abstracting: (3<=cAMP__4_4_)
states: 2,629,575 (6)
abstracting: (cAMP__1_1_<=cAMP__5_3_)
states: 100,942,636 (8)
abstracting: (3<=cAMP__4_1_)
states: 2,629,575 (6)
abstracting: (3<=cAMP__1_4_)
states: 2,629,575 (6)
-> the formula is FALSE

FORMULA Diffusion2D-PT-D05N010-ReachabilityCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.199sec

checking: AG [[~ [[3<=cAMP__4_3_ & cAMP__3_3_<=cAMP__4_1_]] | ~ [~ [cAMP__2_5_<=cAMP__2_3_]]]]
normalized: ~ [E [true U ~ [[cAMP__2_5_<=cAMP__2_3_ | ~ [[3<=cAMP__4_3_ & cAMP__3_3_<=cAMP__4_1_]]]]]]

abstracting: (cAMP__3_3_<=cAMP__4_1_)
states: 100,942,636 (8)
abstracting: (3<=cAMP__4_3_)
states: 2,629,575 (6)
abstracting: (cAMP__2_5_<=cAMP__2_3_)
states: 100,942,636 (8)
-> the formula is FALSE

FORMULA Diffusion2D-PT-D05N010-ReachabilityCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.133sec

checking: AG [[[2<=cAMP__3_3_ | cAMP__4_4_<=cAMP__5_4_] | cAMP__2_2_<=cAMP__1_5_]]
normalized: ~ [E [true U ~ [[[2<=cAMP__3_3_ | cAMP__4_4_<=cAMP__5_4_] | cAMP__2_2_<=cAMP__1_5_]]]]

abstracting: (cAMP__2_2_<=cAMP__1_5_)
states: 100,942,636 (8)
abstracting: (cAMP__4_4_<=cAMP__5_4_)
states: 100,942,636 (8)
abstracting: (2<=cAMP__3_3_)
states: 10,518,300 (7)
-> the formula is FALSE

FORMULA Diffusion2D-PT-D05N010-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.185sec

checking: EF [[[[3<=cAMP__1_2_ & cAMP__2_4_<=cAMP__1_1_] | 3<=cAMP__1_3_] & cAMP__1_5_<=cAMP__3_3_]]
normalized: E [true U [cAMP__1_5_<=cAMP__3_3_ & [3<=cAMP__1_3_ | [3<=cAMP__1_2_ & cAMP__2_4_<=cAMP__1_1_]]]]

abstracting: (cAMP__2_4_<=cAMP__1_1_)
states: 100,942,636 (8)
abstracting: (3<=cAMP__1_2_)
states: 2,629,575 (6)
abstracting: (3<=cAMP__1_3_)
states: 2,629,575 (6)
abstracting: (cAMP__1_5_<=cAMP__3_3_)
states: 100,942,636 (8)
-> the formula is TRUE

FORMULA Diffusion2D-PT-D05N010-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.183sec

checking: EF [[[[cAMP__3_2_<=cAMP__3_5_ & cAMP__1_1_<=cAMP__3_4_] & 3<=cAMP__4_1_] & cAMP__2_1_<=cAMP__3_5_]]
normalized: E [true U [cAMP__2_1_<=cAMP__3_5_ & [3<=cAMP__4_1_ & [cAMP__3_2_<=cAMP__3_5_ & cAMP__1_1_<=cAMP__3_4_]]]]

abstracting: (cAMP__1_1_<=cAMP__3_4_)
states: 100,942,636 (8)
abstracting: (cAMP__3_2_<=cAMP__3_5_)
states: 100,942,636 (8)
abstracting: (3<=cAMP__4_1_)
states: 2,629,575 (6)
abstracting: (cAMP__2_1_<=cAMP__3_5_)
states: 100,942,636 (8)
-> the formula is TRUE

FORMULA Diffusion2D-PT-D05N010-ReachabilityCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.231sec

checking: AG [[[[cAMP__4_3_<=cAMP__3_1_ | 1<=cAMP__5_1_] | ~ [2<=cAMP__5_3_]] | [[2<=cAMP__4_4_ & cAMP__4_2_<=cAMP__3_2_] & 1<=cAMP__5_5_]]]
normalized: ~ [E [true U ~ [[[1<=cAMP__5_5_ & [2<=cAMP__4_4_ & cAMP__4_2_<=cAMP__3_2_]] | [~ [2<=cAMP__5_3_] | [cAMP__4_3_<=cAMP__3_1_ | 1<=cAMP__5_1_]]]]]]

abstracting: (1<=cAMP__5_1_)
states: 38,567,100 (7)
abstracting: (cAMP__4_3_<=cAMP__3_1_)
states: 100,942,636 (8)
abstracting: (2<=cAMP__5_3_)
states: 10,518,300 (7)
abstracting: (cAMP__4_2_<=cAMP__3_2_)
states: 100,942,636 (8)
abstracting: (2<=cAMP__4_4_)
states: 10,518,300 (7)
abstracting: (1<=cAMP__5_5_)
states: 38,567,100 (7)
-> the formula is FALSE

FORMULA Diffusion2D-PT-D05N010-ReachabilityCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.187sec

checking: EF [[[[1<=cAMP__1_5_ & 3<=cAMP__3_4_] & [cAMP__2_5_<=cAMP__1_2_ & cAMP__5_4_<=cAMP__1_1_]] & ~ [[2<=cAMP__1_4_ & 3<=cAMP__2_1_]]]]
normalized: E [true U [~ [[2<=cAMP__1_4_ & 3<=cAMP__2_1_]] & [[cAMP__2_5_<=cAMP__1_2_ & cAMP__5_4_<=cAMP__1_1_] & [1<=cAMP__1_5_ & 3<=cAMP__3_4_]]]]

abstracting: (3<=cAMP__3_4_)
states: 2,629,575 (6)
abstracting: (1<=cAMP__1_5_)
states: 38,567,100 (7)
abstracting: (cAMP__5_4_<=cAMP__1_1_)
states: 100,942,636 (8)
abstracting: (cAMP__2_5_<=cAMP__1_2_)
states: 100,942,636 (8)
abstracting: (3<=cAMP__2_1_)
states: 2,629,575 (6)
abstracting: (2<=cAMP__1_4_)
states: 10,518,300 (7)
-> the formula is TRUE

FORMULA Diffusion2D-PT-D05N010-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.473sec

checking: EF [[[3<=cAMP__5_2_ & [cAMP__1_3_<=cAMP__1_5_ & cAMP__1_1_<=cAMP__1_5_]] & [[cAMP__3_5_<=cAMP__4_5_ | 3<=cAMP__1_4_] & [2<=cAMP__3_4_ & cAMP__3_4_<=cAMP__3_2_]]]]
normalized: E [true U [[[2<=cAMP__3_4_ & cAMP__3_4_<=cAMP__3_2_] & [cAMP__3_5_<=cAMP__4_5_ | 3<=cAMP__1_4_]] & [3<=cAMP__5_2_ & [cAMP__1_3_<=cAMP__1_5_ & cAMP__1_1_<=cAMP__1_5_]]]]

abstracting: (cAMP__1_1_<=cAMP__1_5_)
states: 100,942,636 (8)
abstracting: (cAMP__1_3_<=cAMP__1_5_)
states: 100,942,636 (8)
abstracting: (3<=cAMP__5_2_)
states: 2,629,575 (6)
abstracting: (3<=cAMP__1_4_)
states: 2,629,575 (6)
abstracting: (cAMP__3_5_<=cAMP__4_5_)
states: 100,942,636 (8)
abstracting: (cAMP__3_4_<=cAMP__3_2_)
states: 100,942,636 (8)
abstracting: (2<=cAMP__3_4_)
states: 10,518,300 (7)
-> the formula is TRUE

FORMULA Diffusion2D-PT-D05N010-ReachabilityCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.199sec

checking: AG [[[~ [1<=cAMP__1_4_] | [cAMP__4_1_<=cAMP__1_2_ & cAMP__2_4_<=cAMP__1_5_]] | [[cAMP__4_4_<=cAMP__1_1_ & cAMP__3_4_<=cAMP__2_1_] | [1<=cAMP__1_1_ & 1<=cAMP__5_1_]]]]
normalized: ~ [E [true U ~ [[[[1<=cAMP__1_1_ & 1<=cAMP__5_1_] | [cAMP__4_4_<=cAMP__1_1_ & cAMP__3_4_<=cAMP__2_1_]] | [[cAMP__4_1_<=cAMP__1_2_ & cAMP__2_4_<=cAMP__1_5_] | ~ [1<=cAMP__1_4_]]]]]]

abstracting: (1<=cAMP__1_4_)
states: 38,567,100 (7)
abstracting: (cAMP__2_4_<=cAMP__1_5_)
states: 100,942,636 (8)
abstracting: (cAMP__4_1_<=cAMP__1_2_)
states: 100,942,636 (8)
abstracting: (cAMP__3_4_<=cAMP__2_1_)
states: 100,942,636 (8)
abstracting: (cAMP__4_4_<=cAMP__1_1_)
states: 100,942,636 (8)
abstracting: (1<=cAMP__5_1_)
states: 38,567,100 (7)
abstracting: (1<=cAMP__1_1_)
states: 38,567,100 (7)
-> the formula is FALSE

FORMULA Diffusion2D-PT-D05N010-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.036sec

checking: EF [[[[2<=cAMP__5_1_ & 3<=cAMP__5_3_] | [3<=cAMP__2_5_ & cAMP__4_5_<=cAMP__4_3_]] & [[1<=cAMP__4_3_ | cAMP__4_5_<=cAMP__5_2_] & [cAMP__3_4_<=cAMP__2_5_ | cAMP__3_2_<=cAMP__4_5_]]]]
normalized: E [true U [[[cAMP__3_4_<=cAMP__2_5_ | cAMP__3_2_<=cAMP__4_5_] & [1<=cAMP__4_3_ | cAMP__4_5_<=cAMP__5_2_]] & [[3<=cAMP__2_5_ & cAMP__4_5_<=cAMP__4_3_] | [2<=cAMP__5_1_ & 3<=cAMP__5_3_]]]]

abstracting: (3<=cAMP__5_3_)
states: 2,629,575 (6)
abstracting: (2<=cAMP__5_1_)
states: 10,518,300 (7)
abstracting: (cAMP__4_5_<=cAMP__4_3_)
states: 100,942,636 (8)
abstracting: (3<=cAMP__2_5_)
states: 2,629,575 (6)
abstracting: (cAMP__4_5_<=cAMP__5_2_)
states: 100,942,636 (8)
abstracting: (1<=cAMP__4_3_)
states: 38,567,100 (7)
abstracting: (cAMP__3_2_<=cAMP__4_5_)
states: 100,942,636 (8)
abstracting: (cAMP__3_4_<=cAMP__2_5_)
states: 100,942,636 (8)
-> the formula is TRUE

FORMULA Diffusion2D-PT-D05N010-ReachabilityCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.472sec

totally nodes used: 156190 (1.6e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 10054473 3235965 13290438
used/not used/entry size/cache size: 3285103 63823761 16 1024MB
basic ops cache: hits/miss/sum: 581716 173800 755516
used/not used/entry size/cache size: 343853 16433363 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: 43586 9608 53194
used/not used/entry size/cache size: 9607 8379001 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 66958327
1 148174
2 1852
3 238
4 52
5 35
6 6
7 8
8 32
9 13
>= 10 127

Total processing time: 0m21.945sec


BK_STOP 1494456515783

--------------------
content from stderr:

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

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

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


initing FirstDep: 0m 0.001sec


iterations count:8704 (60), effective:240 (1)

initing FirstDep: 0m 0.000sec


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

iterations count:1868 (12), effective:48 (0)

iterations count:4447 (30), effective:120 (0)

iterations count:1317 (9), effective:41 (0)

iterations count:1395 (9), effective:47 (0)

iterations count:7884 (54), effective:216 (1)

iterations count:5362 (37), effective:148 (1)

iterations count:3695 (25), effective:117 (0)

iterations count:5234 (36), effective:155 (1)

iterations count:2716 (18), effective:82 (0)

iterations count:4029 (27), effective:138 (0)

iterations count:3915 (27), effective:109 (0)

iterations count:6161 (42), effective:173 (1)

iterations count:6528 (45), effective:185 (1)

iterations count:3328 (23), effective:117 (0)

iterations count:8700 (60), effective:275 (1)

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="Diffusion2D-PT-D05N010"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marcie"
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/Diffusion2D-PT-D05N010.tgz
mv Diffusion2D-PT-D05N010 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3253"
echo " Executing tool marcie"
echo " Input is Diffusion2D-PT-D05N010, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r011-ebro-149436297300358"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.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 ;