Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r010-oct2-167813599100446.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is AutoFlight-PT-05b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-oct2-167813599100446
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 6.0K Feb 25 18:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 25 18:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 18:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 18:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 18:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 147K Feb 25 18:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 18:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 25 18:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 113K Mar 5 18:22 model.pnml

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

=== Now, execution of the tool begins

BK_START 1678689400820

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-05b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 06:36:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 06:36:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 06:36:44] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2023-03-13 06:36:44] [INFO ] Transformed 482 places.
[2023-03-13 06:36:44] [INFO ] Transformed 480 transitions.
[2023-03-13 06:36:44] [INFO ] Found NUPN structural information;
[2023-03-13 06:36:44] [INFO ] Parsed PT model containing 482 places and 480 transitions and 1120 arcs in 215 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
FORMULA AutoFlight-PT-05b-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-05b-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-05b-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-05b-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-05b-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-05b-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 40 resets, run finished after 242 ms. (steps per millisecond=41 ) properties (out of 10) seen :6
FORMULA AutoFlight-PT-05b-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 480 rows 482 cols
[2023-03-13 06:36:45] [INFO ] Computed 34 place invariants in 31 ms
[2023-03-13 06:36:45] [INFO ] After 754ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 06:36:46] [INFO ] [Nat]Absence check using 33 positive place invariants in 15 ms returned sat
[2023-03-13 06:36:46] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 4 ms returned sat
[2023-03-13 06:36:46] [INFO ] After 228ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-13 06:36:46] [INFO ] Deduced a trap composed of 43 places in 233 ms of which 8 ms to minimize.
[2023-03-13 06:36:46] [INFO ] Deduced a trap composed of 81 places in 153 ms of which 1 ms to minimize.
[2023-03-13 06:36:47] [INFO ] Deduced a trap composed of 84 places in 129 ms of which 1 ms to minimize.
[2023-03-13 06:36:47] [INFO ] Deduced a trap composed of 74 places in 106 ms of which 0 ms to minimize.
[2023-03-13 06:36:47] [INFO ] Deduced a trap composed of 21 places in 105 ms of which 1 ms to minimize.
[2023-03-13 06:36:47] [INFO ] Deduced a trap composed of 57 places in 104 ms of which 2 ms to minimize.
[2023-03-13 06:36:47] [INFO ] Deduced a trap composed of 42 places in 154 ms of which 1 ms to minimize.
[2023-03-13 06:36:47] [INFO ] Deduced a trap composed of 31 places in 159 ms of which 1 ms to minimize.
[2023-03-13 06:36:48] [INFO ] Deduced a trap composed of 61 places in 168 ms of which 1 ms to minimize.
[2023-03-13 06:36:48] [INFO ] Deduced a trap composed of 66 places in 178 ms of which 1 ms to minimize.
[2023-03-13 06:36:48] [INFO ] Deduced a trap composed of 69 places in 141 ms of which 1 ms to minimize.
[2023-03-13 06:36:48] [INFO ] Deduced a trap composed of 53 places in 380 ms of which 1 ms to minimize.
[2023-03-13 06:36:49] [INFO ] Deduced a trap composed of 40 places in 257 ms of which 2 ms to minimize.
[2023-03-13 06:36:49] [INFO ] Deduced a trap composed of 41 places in 181 ms of which 1 ms to minimize.
[2023-03-13 06:36:49] [INFO ] Deduced a trap composed of 59 places in 116 ms of which 0 ms to minimize.
[2023-03-13 06:36:49] [INFO ] Deduced a trap composed of 66 places in 117 ms of which 0 ms to minimize.
[2023-03-13 06:36:49] [INFO ] Deduced a trap composed of 74 places in 249 ms of which 1 ms to minimize.
[2023-03-13 06:36:50] [INFO ] Deduced a trap composed of 61 places in 174 ms of which 0 ms to minimize.
[2023-03-13 06:36:50] [INFO ] Deduced a trap composed of 80 places in 123 ms of which 1 ms to minimize.
[2023-03-13 06:36:50] [INFO ] Deduced a trap composed of 75 places in 159 ms of which 2 ms to minimize.
[2023-03-13 06:36:50] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 3969 ms
[2023-03-13 06:36:50] [INFO ] Deduced a trap composed of 88 places in 191 ms of which 0 ms to minimize.
[2023-03-13 06:36:50] [INFO ] Deduced a trap composed of 27 places in 199 ms of which 13 ms to minimize.
[2023-03-13 06:36:51] [INFO ] Deduced a trap composed of 41 places in 497 ms of which 1 ms to minimize.
[2023-03-13 06:36:51] [INFO ] Deduced a trap composed of 81 places in 115 ms of which 0 ms to minimize.
[2023-03-13 06:36:51] [INFO ] Deduced a trap composed of 28 places in 219 ms of which 1 ms to minimize.
[2023-03-13 06:36:52] [INFO ] Deduced a trap composed of 34 places in 352 ms of which 1 ms to minimize.
[2023-03-13 06:36:52] [INFO ] Deduced a trap composed of 70 places in 311 ms of which 0 ms to minimize.
[2023-03-13 06:36:52] [INFO ] Deduced a trap composed of 78 places in 117 ms of which 0 ms to minimize.
[2023-03-13 06:36:52] [INFO ] Deduced a trap composed of 80 places in 149 ms of which 0 ms to minimize.
[2023-03-13 06:36:53] [INFO ] Deduced a trap composed of 37 places in 172 ms of which 9 ms to minimize.
[2023-03-13 06:36:53] [INFO ] Deduced a trap composed of 88 places in 170 ms of which 1 ms to minimize.
[2023-03-13 06:36:53] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2789 ms
[2023-03-13 06:36:53] [INFO ] After 7111ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 100 ms.
[2023-03-13 06:36:53] [INFO ] After 7507ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
FORMULA AutoFlight-PT-05b-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 3 different solutions.
FORMULA AutoFlight-PT-05b-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA AutoFlight-PT-05b-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 28 ms.
Support contains 2 out of 482 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 482/482 places, 480/480 transitions.
Drop transitions removed 187 transitions
Trivial Post-agglo rules discarded 187 transitions
Performed 187 trivial Post agglomeration. Transition count delta: 187
Iterating post reduction 0 with 187 rules applied. Total rules applied 187 place count 482 transition count 293
Reduce places removed 187 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 222 rules applied. Total rules applied 409 place count 295 transition count 258
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 11 rules applied. Total rules applied 420 place count 285 transition count 257
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 421 place count 284 transition count 257
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 66 Pre rules applied. Total rules applied 421 place count 284 transition count 191
Deduced a syphon composed of 66 places in 0 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 4 with 132 rules applied. Total rules applied 553 place count 218 transition count 191
Discarding 46 places :
Symmetric choice reduction at 4 with 46 rule applications. Total rules 599 place count 172 transition count 145
Iterating global reduction 4 with 46 rules applied. Total rules applied 645 place count 172 transition count 145
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 15 Pre rules applied. Total rules applied 645 place count 172 transition count 130
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 675 place count 157 transition count 130
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 4 with 76 rules applied. Total rules applied 751 place count 119 transition count 92
Free-agglomeration rule applied 20 times.
Iterating global reduction 4 with 20 rules applied. Total rules applied 771 place count 119 transition count 72
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 4 with 20 rules applied. Total rules applied 791 place count 99 transition count 72
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 792 place count 98 transition count 71
Reduce places removed 20 places and 0 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 5 with 50 rules applied. Total rules applied 842 place count 78 transition count 41
Reduce places removed 30 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 31 rules applied. Total rules applied 873 place count 48 transition count 40
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 874 place count 47 transition count 40
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 12 Pre rules applied. Total rules applied 874 place count 47 transition count 28
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 8 with 24 rules applied. Total rules applied 898 place count 35 transition count 28
Applied a total of 898 rules in 156 ms. Remains 35 /482 variables (removed 447) and now considering 28/480 (removed 452) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 157 ms. Remains : 35/482 places, 28/480 transitions.
Finished random walk after 41 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=41 )
FORMULA AutoFlight-PT-05b-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 9425 ms.
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
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: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: AutoFlight_PT_05b
(NrP: 482 NrTr: 480 NrArc: 1120)

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

net check time: 0m 0.013sec

init dd package: 0m 2.886sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 8856868 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16101536 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
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

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="AutoFlight-PT-05b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is AutoFlight-PT-05b, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r010-oct2-167813599100446"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-05b.tgz
mv AutoFlight-PT-05b execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;