Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2022-input.r006-tajo-165245689300430.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is AutoFlight-PT-04b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r006-tajo-165245689300430
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 6.2K Apr 30 01:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 30 01:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 30 01:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 30 01:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 07:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 9 07:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 30 01:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Apr 30 01:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 30 01:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K Apr 30 01:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 91K May 10 09:33 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-04b-ReachabilityCardinality-00
FORMULA_NAME AutoFlight-PT-04b-ReachabilityCardinality-01
FORMULA_NAME AutoFlight-PT-04b-ReachabilityCardinality-02
FORMULA_NAME AutoFlight-PT-04b-ReachabilityCardinality-03
FORMULA_NAME AutoFlight-PT-04b-ReachabilityCardinality-04
FORMULA_NAME AutoFlight-PT-04b-ReachabilityCardinality-05
FORMULA_NAME AutoFlight-PT-04b-ReachabilityCardinality-06
FORMULA_NAME AutoFlight-PT-04b-ReachabilityCardinality-07
FORMULA_NAME AutoFlight-PT-04b-ReachabilityCardinality-08
FORMULA_NAME AutoFlight-PT-04b-ReachabilityCardinality-09
FORMULA_NAME AutoFlight-PT-04b-ReachabilityCardinality-10
FORMULA_NAME AutoFlight-PT-04b-ReachabilityCardinality-11
FORMULA_NAME AutoFlight-PT-04b-ReachabilityCardinality-12
FORMULA_NAME AutoFlight-PT-04b-ReachabilityCardinality-13
FORMULA_NAME AutoFlight-PT-04b-ReachabilityCardinality-14
FORMULA_NAME AutoFlight-PT-04b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654266919043

Running Version 202205111006
[2022-06-03 14:35:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-03 14:35:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-03 14:35:20] [INFO ] Load time of PNML (sax parser for PT used): 142 ms
[2022-06-03 14:35:20] [INFO ] Transformed 390 places.
[2022-06-03 14:35:21] [INFO ] Transformed 388 transitions.
[2022-06-03 14:35:21] [INFO ] Found NUPN structural information;
[2022-06-03 14:35:21] [INFO ] Parsed PT model containing 390 places and 388 transitions in 315 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 36 ms.
Working with output stream class java.io.PrintStream
FORMULA AutoFlight-PT-04b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 49 resets, run finished after 1047 ms. (steps per millisecond=9 ) properties (out of 15) seen :5
FORMULA AutoFlight-PT-04b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 10) seen :1
FORMULA AutoFlight-PT-04b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 388 rows 390 cols
[2022-06-03 14:35:23] [INFO ] Computed 28 place invariants in 37 ms
[2022-06-03 14:35:24] [INFO ] After 632ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2022-06-03 14:35:24] [INFO ] [Nat]Absence check using 27 positive place invariants in 13 ms returned sat
[2022-06-03 14:35:24] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-03 14:35:24] [INFO ] After 553ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :5
[2022-06-03 14:35:25] [INFO ] Deduced a trap composed of 43 places in 204 ms of which 6 ms to minimize.
[2022-06-03 14:35:29] [INFO ] Deduced a trap composed of 50 places in 3854 ms of which 21 ms to minimize.
[2022-06-03 14:35:29] [INFO ] Deduced a trap composed of 90 places in 147 ms of which 2 ms to minimize.
[2022-06-03 14:35:30] [INFO ] Deduced a trap composed of 37 places in 897 ms of which 2 ms to minimize.
[2022-06-03 14:35:30] [INFO ] Deduced a trap composed of 60 places in 185 ms of which 1 ms to minimize.
[2022-06-03 14:35:30] [INFO ] Deduced a trap composed of 34 places in 111 ms of which 0 ms to minimize.
[2022-06-03 14:35:30] [INFO ] Deduced a trap composed of 35 places in 204 ms of which 1 ms to minimize.
[2022-06-03 14:35:30] [INFO ] Deduced a trap composed of 37 places in 173 ms of which 1 ms to minimize.
[2022-06-03 14:35:31] [INFO ] Deduced a trap composed of 43 places in 143 ms of which 1 ms to minimize.
[2022-06-03 14:35:31] [INFO ] Deduced a trap composed of 34 places in 157 ms of which 1 ms to minimize.
[2022-06-03 14:35:31] [INFO ] Deduced a trap composed of 62 places in 158 ms of which 1 ms to minimize.
[2022-06-03 14:35:31] [INFO ] Deduced a trap composed of 37 places in 163 ms of which 1 ms to minimize.
[2022-06-03 14:35:31] [INFO ] Deduced a trap composed of 75 places in 125 ms of which 1 ms to minimize.
[2022-06-03 14:35:31] [INFO ] Deduced a trap composed of 60 places in 79 ms of which 1 ms to minimize.
[2022-06-03 14:35:32] [INFO ] Deduced a trap composed of 83 places in 131 ms of which 1 ms to minimize.
[2022-06-03 14:35:32] [INFO ] Deduced a trap composed of 41 places in 94 ms of which 1 ms to minimize.
[2022-06-03 14:35:32] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 7327 ms
[2022-06-03 14:35:32] [INFO ] Deduced a trap composed of 39 places in 119 ms of which 1 ms to minimize.
[2022-06-03 14:35:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 170 ms
[2022-06-03 14:35:32] [INFO ] Deduced a trap composed of 73 places in 136 ms of which 1 ms to minimize.
[2022-06-03 14:35:35] [INFO ] Deduced a trap composed of 65 places in 2207 ms of which 0 ms to minimize.
[2022-06-03 14:35:35] [INFO ] Deduced a trap composed of 49 places in 182 ms of which 1 ms to minimize.
[2022-06-03 14:35:35] [INFO ] Deduced a trap composed of 48 places in 160 ms of which 0 ms to minimize.
[2022-06-03 14:35:35] [INFO ] Deduced a trap composed of 38 places in 157 ms of which 1 ms to minimize.
[2022-06-03 14:35:35] [INFO ] Deduced a trap composed of 49 places in 106 ms of which 1 ms to minimize.
[2022-06-03 14:35:36] [INFO ] Deduced a trap composed of 53 places in 129 ms of which 0 ms to minimize.
[2022-06-03 14:35:36] [INFO ] Deduced a trap composed of 53 places in 129 ms of which 0 ms to minimize.
[2022-06-03 14:35:36] [INFO ] Deduced a trap composed of 47 places in 99 ms of which 1 ms to minimize.
[2022-06-03 14:35:36] [INFO ] Deduced a trap composed of 49 places in 99 ms of which 0 ms to minimize.
[2022-06-03 14:35:36] [INFO ] Deduced a trap composed of 45 places in 84 ms of which 1 ms to minimize.
[2022-06-03 14:35:36] [INFO ] Deduced a trap composed of 44 places in 76 ms of which 0 ms to minimize.
[2022-06-03 14:35:36] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 3976 ms
[2022-06-03 14:35:36] [INFO ] After 12324ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :4
Attempting to minimize the solution found.
Minimization took 97 ms.
[2022-06-03 14:35:36] [INFO ] After 12757ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :4
FORMULA AutoFlight-PT-04b-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutoFlight-PT-04b-ReachabilityCardinality-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutoFlight-PT-04b-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutoFlight-PT-04b-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutoFlight-PT-04b-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 4 different solutions.
FORMULA AutoFlight-PT-04b-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA AutoFlight-PT-04b-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA AutoFlight-PT-04b-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 3 properties in 1375 ms.
Support contains 21 out of 390 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 390/390 places, 388/388 transitions.
Drop transitions removed 124 transitions
Trivial Post-agglo rules discarded 124 transitions
Performed 124 trivial Post agglomeration. Transition count delta: 124
Iterating post reduction 0 with 124 rules applied. Total rules applied 124 place count 390 transition count 264
Reduce places removed 124 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 147 rules applied. Total rules applied 271 place count 266 transition count 241
Reduce places removed 6 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 2 with 18 rules applied. Total rules applied 289 place count 260 transition count 229
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 302 place count 248 transition count 228
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 51 Pre rules applied. Total rules applied 302 place count 248 transition count 177
Deduced a syphon composed of 51 places in 2 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 4 with 102 rules applied. Total rules applied 404 place count 197 transition count 177
Discarding 29 places :
Symmetric choice reduction at 4 with 29 rule applications. Total rules 433 place count 168 transition count 148
Iterating global reduction 4 with 29 rules applied. Total rules applied 462 place count 168 transition count 148
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 462 place count 168 transition count 140
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 478 place count 160 transition count 140
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 4 with 70 rules applied. Total rules applied 548 place count 125 transition count 105
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 550 place count 125 transition count 103
Free-agglomeration rule applied 15 times.
Iterating global reduction 4 with 15 rules applied. Total rules applied 565 place count 125 transition count 88
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 4 with 15 rules applied. Total rules applied 580 place count 110 transition count 88
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 581 place count 109 transition count 87
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 584 place count 106 transition count 87
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 584 place count 106 transition count 84
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 590 place count 103 transition count 84
Applied a total of 590 rules in 185 ms. Remains 103 /390 variables (removed 287) and now considering 84/388 (removed 304) transitions.
Finished structural reductions, in 1 iterations. Remains : 103/390 places, 84/388 transitions.
Incomplete random walk after 1000000 steps, including 13438 resets, run finished after 1660 ms. (steps per millisecond=602 ) properties (out of 1) seen :0
Finished Best-First random walk after 344 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=344 )
FORMULA AutoFlight-PT-04b-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 19378 ms.

BK_STOP 1654266940180

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination ReachabilityCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-04b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is AutoFlight-PT-04b, 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 r006-tajo-165245689300430"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-04b.tgz
mv AutoFlight-PT-04b 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 ;