About the Execution of Marcie for Diffusion2D-PT-D05N050
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
9141.670 | 344295.00 | 344039.00 | 130.20 | TTFTTTFTTFTTFFTT | 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)
............
=====================================================================
Generated by BenchKit 2-2979
Executing tool marcie
Input is Diffusion2D-PT-D05N050, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r029kn-smll-146348014800066
=====================================================================
--------------------
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-D05N050-CTLCardinality-0
FORMULA_NAME Diffusion2D-PT-D05N050-CTLCardinality-1
FORMULA_NAME Diffusion2D-PT-D05N050-CTLCardinality-10
FORMULA_NAME Diffusion2D-PT-D05N050-CTLCardinality-11
FORMULA_NAME Diffusion2D-PT-D05N050-CTLCardinality-12
FORMULA_NAME Diffusion2D-PT-D05N050-CTLCardinality-13
FORMULA_NAME Diffusion2D-PT-D05N050-CTLCardinality-14
FORMULA_NAME Diffusion2D-PT-D05N050-CTLCardinality-15
FORMULA_NAME Diffusion2D-PT-D05N050-CTLCardinality-2
FORMULA_NAME Diffusion2D-PT-D05N050-CTLCardinality-3
FORMULA_NAME Diffusion2D-PT-D05N050-CTLCardinality-4
FORMULA_NAME Diffusion2D-PT-D05N050-CTLCardinality-5
FORMULA_NAME Diffusion2D-PT-D05N050-CTLCardinality-6
FORMULA_NAME Diffusion2D-PT-D05N050-CTLCardinality-7
FORMULA_NAME Diffusion2D-PT-D05N050-CTLCardinality-8
FORMULA_NAME Diffusion2D-PT-D05N050-CTLCardinality-9
=== Now, execution of the tool begins
BK_START 1463506562978
Marcie rev. 8535M (built: crohr on 2016-04-27)
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 --mcc-mode --memory=6 --suppress
parse successfull
net created successfully
Net: Diffusion2D_PT_D05N050
(NrP: 25 NrTr: 144 NrArc: 288)
net check time: 0m 0.000sec
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
init dd package: 0m 4.275sec
RS generation: 0m 0.271sec
-> reachability set: #nodes 1225 (1.2e+03) #states 17,529,515,713,716,297,876 (19)
starting MCC model checker
--------------------------
checking: AG [~ [~ [~ [3<=cAMP__4_1_]]]]
normalized: ~ [E [true U 3<=cAMP__4_1_]]
abstracting: (3<=cAMP__4_1_) states: 5,300,174,441,392,685,400 (18)
-> the formula is FALSE
FORMULA Diffusion2D-PT-D05N050-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.892sec
checking: [EF [2<=cAMP__4_5_] | [EF [1<=cAMP__3_3_] & 3<=cAMP__5_3_]]
normalized: [[3<=cAMP__5_3_ & E [true U 1<=cAMP__3_3_]] | E [true U 2<=cAMP__4_5_]]
abstracting: (2<=cAMP__4_5_) states: 7,950,261,662,089,028,100 (18)
abstracting: (1<=cAMP__3_3_) states: 11,844,267,374,132,633,700 (19)
abstracting: (3<=cAMP__5_3_) states: 5,300,174,441,392,685,400 (18)
-> the formula is TRUE
FORMULA Diffusion2D-PT-D05N050-CTLCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.633sec
checking: AG [[EF [cAMP__3_1_<=cAMP__3_2_] | ~ [[1<=cAMP__1_5_ | 2<=cAMP__5_5_]]]]
normalized: ~ [E [true U ~ [[~ [[1<=cAMP__1_5_ | 2<=cAMP__5_5_]] | E [true U cAMP__3_1_<=cAMP__3_2_]]]]]
abstracting: (cAMP__3_1_<=cAMP__3_2_) states: 10,450,079,192,611,522,356 (19)
abstracting: (2<=cAMP__5_5_) states: 7,950,261,662,089,028,100 (18)
abstracting: (1<=cAMP__1_5_) states: 11,844,267,374,132,633,700 (19)
-> the formula is TRUE
FORMULA Diffusion2D-PT-D05N050-CTLCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.234sec
checking: EF [[~ [1<=cAMP__4_1_] & ~ [[1<=cAMP__2_2_ | cAMP__4_1_<=cAMP__4_4_]]]]
normalized: E [true U [~ [[1<=cAMP__2_2_ | cAMP__4_1_<=cAMP__4_4_]] & ~ [1<=cAMP__4_1_]]]
abstracting: (1<=cAMP__4_1_) states: 11,844,267,374,132,633,700 (19)
abstracting: (cAMP__4_1_<=cAMP__4_4_) states: 10,450,079,192,611,522,356 (19)
abstracting: (1<=cAMP__2_2_) states: 11,844,267,374,132,633,700 (19)
-> the formula is FALSE
FORMULA Diffusion2D-PT-D05N050-CTLCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.144sec
checking: E [[2<=cAMP__3_3_ | ~ [cAMP__2_1_<=cAMP__5_5_]] U 3<=cAMP__1_4_]
normalized: E [[2<=cAMP__3_3_ | ~ [cAMP__2_1_<=cAMP__5_5_]] U 3<=cAMP__1_4_]
abstracting: (3<=cAMP__1_4_) states: 5,300,174,441,392,685,400 (18)
abstracting: (cAMP__2_1_<=cAMP__5_5_) states: 10,450,079,192,611,522,356 (19)
abstracting: (2<=cAMP__3_3_) states: 7,950,261,662,089,028,100 (18)
-> the formula is TRUE
FORMULA Diffusion2D-PT-D05N050-CTLCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m19.622sec
checking: EF [AG [[cAMP__3_4_<=cAMP__4_2_ & cAMP__5_1_<=cAMP__3_4_]]]
normalized: E [true U ~ [E [true U ~ [[cAMP__3_4_<=cAMP__4_2_ & cAMP__5_1_<=cAMP__3_4_]]]]]
abstracting: (cAMP__5_1_<=cAMP__3_4_) states: 10,450,079,192,611,522,356 (19)
abstracting: (cAMP__3_4_<=cAMP__4_2_) states: 10,450,079,192,611,522,356 (19)
-> the formula is FALSE
FORMULA Diffusion2D-PT-D05N050-CTLCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 3m19.610sec
checking: EG [E [cAMP__1_1_<=cAMP__1_1_ U cAMP__3_3_<=cAMP__5_1_]]
normalized: EG [E [cAMP__1_1_<=cAMP__1_1_ U cAMP__3_3_<=cAMP__5_1_]]
abstracting: (cAMP__3_3_<=cAMP__5_1_) states: 10,450,079,192,611,522,356 (19)
abstracting: (cAMP__1_1_<=cAMP__1_1_) states: 17,529,515,713,716,297,876 (19)
EG iterations: 0
-> the formula is TRUE
FORMULA Diffusion2D-PT-D05N050-CTLCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.995sec
checking: [[EF [[3<=cAMP__3_5_ | cAMP__3_3_<=cAMP__1_3_]] | 3<=cAMP__1_1_] | AF [2<=cAMP__2_2_]]
normalized: [~ [EG [~ [2<=cAMP__2_2_]]] | [3<=cAMP__1_1_ | E [true U [3<=cAMP__3_5_ | cAMP__3_3_<=cAMP__1_3_]]]]
abstracting: (cAMP__3_3_<=cAMP__1_3_) states: 10,450,079,192,611,522,356 (19)
abstracting: (3<=cAMP__3_5_) states: 5,300,174,441,392,685,400 (18)
abstracting: (3<=cAMP__1_1_) states: 5,300,174,441,392,685,400 (18)
abstracting: (2<=cAMP__2_2_) states: 7,950,261,662,089,028,100 (18)
.
EG iterations: 1
-> the formula is TRUE
FORMULA Diffusion2D-PT-D05N050-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 3.786sec
checking: [E [1<=cAMP__5_4_ U [2<=cAMP__1_1_ | cAMP__4_2_<=cAMP__4_3_]] & EF [~ [~ [3<=cAMP__2_5_]]]]
normalized: [E [true U 3<=cAMP__2_5_] & E [1<=cAMP__5_4_ U [2<=cAMP__1_1_ | cAMP__4_2_<=cAMP__4_3_]]]
abstracting: (cAMP__4_2_<=cAMP__4_3_) states: 10,450,079,192,611,522,356 (19)
abstracting: (2<=cAMP__1_1_) states: 7,950,261,662,089,028,100 (18)
abstracting: (1<=cAMP__5_4_) states: 11,844,267,374,132,633,700 (19)
abstracting: (3<=cAMP__2_5_) states: 5,300,174,441,392,685,400 (18)
-> the formula is TRUE
FORMULA Diffusion2D-PT-D05N050-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 7.944sec
checking: [~ [E [cAMP__4_1_<=cAMP__1_4_ U 2<=cAMP__5_5_]] & ~ [AX [[cAMP__5_4_<=cAMP__4_4_ & 3<=cAMP__2_2_]]]]
normalized: [EX [~ [[cAMP__5_4_<=cAMP__4_4_ & 3<=cAMP__2_2_]]] & ~ [E [cAMP__4_1_<=cAMP__1_4_ U 2<=cAMP__5_5_]]]
abstracting: (2<=cAMP__5_5_) states: 7,950,261,662,089,028,100 (18)
abstracting: (cAMP__4_1_<=cAMP__1_4_) states: 10,450,079,192,611,522,356 (19)
abstracting: (3<=cAMP__2_2_) states: 5,300,174,441,392,685,400 (18)
abstracting: (cAMP__5_4_<=cAMP__4_4_) states: 10,450,079,192,611,522,356 (19)
.-> the formula is FALSE
FORMULA Diffusion2D-PT-D05N050-CTLCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 4.066sec
checking: [EF [[[3<=cAMP__5_3_ & 1<=cAMP__1_5_] & 2<=cAMP__3_1_]] & [~ [~ [[1<=cAMP__5_4_ | 3<=cAMP__2_4_]]] | cAMP__2_3_<=cAMP__5_5_]]
normalized: [[cAMP__2_3_<=cAMP__5_5_ | [1<=cAMP__5_4_ | 3<=cAMP__2_4_]] & E [true U [2<=cAMP__3_1_ & [3<=cAMP__5_3_ & 1<=cAMP__1_5_]]]]
abstracting: (1<=cAMP__1_5_) states: 11,844,267,374,132,633,700 (19)
abstracting: (3<=cAMP__5_3_) states: 5,300,174,441,392,685,400 (18)
abstracting: (2<=cAMP__3_1_) states: 7,950,261,662,089,028,100 (18)
abstracting: (3<=cAMP__2_4_) states: 5,300,174,441,392,685,400 (18)
abstracting: (1<=cAMP__5_4_) states: 11,844,267,374,132,633,700 (19)
abstracting: (cAMP__2_3_<=cAMP__5_5_) states: 10,450,079,192,611,522,356 (19)
-> the formula is TRUE
FORMULA Diffusion2D-PT-D05N050-CTLCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 3.828sec
checking: E [[[cAMP__2_5_<=cAMP__3_3_ & cAMP__1_2_<=cAMP__5_1_] | [cAMP__3_3_<=cAMP__3_1_ | 2<=cAMP__3_1_]] U 2<=cAMP__1_3_]
normalized: E [[[cAMP__3_3_<=cAMP__3_1_ | 2<=cAMP__3_1_] | [cAMP__2_5_<=cAMP__3_3_ & cAMP__1_2_<=cAMP__5_1_]] U 2<=cAMP__1_3_]
abstracting: (2<=cAMP__1_3_) states: 7,950,261,662,089,028,100 (18)
abstracting: (cAMP__1_2_<=cAMP__5_1_) states: 10,450,079,192,611,522,356 (19)
abstracting: (cAMP__2_5_<=cAMP__3_3_) states: 10,450,079,192,611,522,356 (19)
abstracting: (2<=cAMP__3_1_) states: 7,950,261,662,089,028,100 (18)
abstracting: (cAMP__3_3_<=cAMP__3_1_) states: 10,450,079,192,611,522,356 (19)
-> the formula is TRUE
FORMULA Diffusion2D-PT-D05N050-CTLCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m25.195sec
checking: [EF [[~ [cAMP__3_4_<=cAMP__4_5_] & [cAMP__3_1_<=cAMP__1_4_ & cAMP__3_3_<=cAMP__1_4_]]] | ~ [cAMP__3_1_<=cAMP__5_3_]]
normalized: [~ [cAMP__3_1_<=cAMP__5_3_] | E [true U [[cAMP__3_1_<=cAMP__1_4_ & cAMP__3_3_<=cAMP__1_4_] & ~ [cAMP__3_4_<=cAMP__4_5_]]]]
abstracting: (cAMP__3_4_<=cAMP__4_5_) states: 10,450,079,192,611,522,356 (19)
abstracting: (cAMP__3_3_<=cAMP__1_4_) states: 10,450,079,192,611,522,356 (19)
abstracting: (cAMP__3_1_<=cAMP__1_4_) states: 10,450,079,192,611,522,356 (19)
abstracting: (cAMP__3_1_<=cAMP__5_3_) states: 10,450,079,192,611,522,356 (19)
-> the formula is TRUE
FORMULA Diffusion2D-PT-D05N050-CTLCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m23.858sec
checking: [EF [[[3<=cAMP__5_3_ | 3<=cAMP__4_3_] & [cAMP__3_3_<=cAMP__1_2_ & cAMP__1_2_<=cAMP__5_4_]]] | ~ [cAMP__4_4_<=cAMP__4_4_]]
normalized: [~ [cAMP__4_4_<=cAMP__4_4_] | E [true U [[cAMP__3_3_<=cAMP__1_2_ & cAMP__1_2_<=cAMP__5_4_] & [3<=cAMP__5_3_ | 3<=cAMP__4_3_]]]]
abstracting: (3<=cAMP__4_3_) states: 5,300,174,441,392,685,400 (18)
abstracting: (3<=cAMP__5_3_) states: 5,300,174,441,392,685,400 (18)
abstracting: (cAMP__1_2_<=cAMP__5_4_) states: 10,450,079,192,611,522,356 (19)
abstracting: (cAMP__3_3_<=cAMP__1_2_) states: 10,450,079,192,611,522,356 (19)
abstracting: (cAMP__4_4_<=cAMP__4_4_) states: 17,529,515,713,716,297,876 (19)
-> the formula is TRUE
FORMULA Diffusion2D-PT-D05N050-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m10.943sec
checking: [[~ [[~ [1<=cAMP__2_3_] | [3<=cAMP__5_4_ & cAMP__3_5_<=cAMP__2_5_]]] | EF [[cAMP__3_3_<=cAMP__3_5_ | 3<=cAMP__1_5_]]] | AG [[2<=cAMP__3_3_ | [cAMP__4_3_<=cAMP__1_2_ & 1<=cAMP__5_2_]]]]
normalized: [~ [E [true U ~ [[2<=cAMP__3_3_ | [cAMP__4_3_<=cAMP__1_2_ & 1<=cAMP__5_2_]]]]] | [E [true U [cAMP__3_3_<=cAMP__3_5_ | 3<=cAMP__1_5_]] | ~ [[[3<=cAMP__5_4_ & cAMP__3_5_<=cAMP__2_5_] | ~ [1<=cAMP__2_3_]]]]]
abstracting: (1<=cAMP__2_3_) states: 11,844,267,374,132,633,700 (19)
abstracting: (cAMP__3_5_<=cAMP__2_5_) states: 10,450,079,192,611,522,356 (19)
abstracting: (3<=cAMP__5_4_) states: 5,300,174,441,392,685,400 (18)
abstracting: (3<=cAMP__1_5_) states: 5,300,174,441,392,685,400 (18)
abstracting: (cAMP__3_3_<=cAMP__3_5_) states: 10,450,079,192,611,522,356 (19)
abstracting: (1<=cAMP__5_2_) states: 11,844,267,374,132,633,700 (19)
abstracting: (cAMP__4_3_<=cAMP__1_2_) states: 10,450,079,192,611,522,356 (19)
abstracting: (2<=cAMP__3_3_) states: 7,950,261,662,089,028,100 (18)
-> the formula is TRUE
FORMULA Diffusion2D-PT-D05N050-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 6.516sec
checking: [[AG [[cAMP__3_5_<=cAMP__1_2_ | cAMP__1_4_<=cAMP__4_3_]] | AG [[cAMP__3_2_<=cAMP__2_1_ & cAMP__1_4_<=cAMP__1_1_]]] & EF [[~ [cAMP__1_1_<=cAMP__2_3_] & cAMP__4_4_<=cAMP__5_4_]]]
normalized: [E [true U [cAMP__4_4_<=cAMP__5_4_ & ~ [cAMP__1_1_<=cAMP__2_3_]]] & [~ [E [true U ~ [[cAMP__3_2_<=cAMP__2_1_ & cAMP__1_4_<=cAMP__1_1_]]]] | ~ [E [true U ~ [[cAMP__3_5_<=cAMP__1_2_ | cAMP__1_4_<=cAMP__4_3_]]]]]]
abstracting: (cAMP__1_4_<=cAMP__4_3_) states: 10,450,079,192,611,522,356 (19)
abstracting: (cAMP__3_5_<=cAMP__1_2_) states: 10,450,079,192,611,522,356 (19)
abstracting: (cAMP__1_4_<=cAMP__1_1_) states: 10,450,079,192,611,522,356 (19)
abstracting: (cAMP__3_2_<=cAMP__2_1_) states: 10,450,079,192,611,522,356 (19)
abstracting: (cAMP__1_1_<=cAMP__2_3_) states: 10,450,079,192,611,522,356 (19)
abstracting: (cAMP__4_4_<=cAMP__5_4_) states: 10,450,079,192,611,522,356 (19)
-> the formula is FALSE
FORMULA Diffusion2D-PT-D05N050-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m26.591sec
Total processing time: 5m44.130sec
BK_STOP 1463506907273
--------------------
content from stderr:
check for maximal unmarked siphon
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.000sec
iterations count:921 (6), effective:24 (0)
initing FirstDep: 0m 0.000sec
iterations count:941 (6), effective:24 (0)
iterations count:940 (6), effective:24 (0)
iterations count:942 (6), effective:24 (0)
iterations count:160 (1), effective:1 (0)
14315
iterations count:1464 (10), effective:50 (0)
iterations count:937 (6), effective:24 (0)
iterations count:198 (1), effective:1 (0)
iterations count:404 (2), effective:13 (0)
iterations count:554 (3), effective:16 (0)
iterations count:940 (6), effective:24 (0)
2906
iterations count:1710 (11), effective:57 (0)
2740
iterations count:1744 (12), effective:55 (0)
22556
iterations count:1123 (7), effective:40 (0)
1821
iterations count:1216 (8), effective:38 (0)
1255
iterations count:1792 (12), effective:57 (0)
iterations count:402 (2), effective:13 (0)
iterations count:256 (1), effective:3 (0)
1215
iterations count:1283 (8), effective:40 (0)
iterations count:923 (6), effective:25 (0)
iterations count:944 (6), effective:24 (0)
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-D05N050"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/root/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-D05N050.tgz
mv Diffusion2D-PT-D05N050 execution
# this is for BenchKit: explicit launching of the test
cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2979"
echo " Executing tool marcie"
echo " Input is Diffusion2D-PT-D05N050, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r029kn-smll-146348014800066"
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 ;