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.r005-oct2-167813593400637.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 itstools
Input is AutonomousCar-PT-07b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r005-oct2-167813593400637
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 780K
-rw-r--r-- 1 mcc users 6.6K Feb 25 12:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 25 12:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 12:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 25 12:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 15:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Feb 25 12:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K Feb 25 12:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:34 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 334K 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 positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME AutonomousCar-PT-07b-UpperBounds-00
FORMULA_NAME AutonomousCar-PT-07b-UpperBounds-01
FORMULA_NAME AutonomousCar-PT-07b-UpperBounds-02
FORMULA_NAME AutonomousCar-PT-07b-UpperBounds-03
FORMULA_NAME AutonomousCar-PT-07b-UpperBounds-04
FORMULA_NAME AutonomousCar-PT-07b-UpperBounds-05
FORMULA_NAME AutonomousCar-PT-07b-UpperBounds-06
FORMULA_NAME AutonomousCar-PT-07b-UpperBounds-07
FORMULA_NAME AutonomousCar-PT-07b-UpperBounds-08
FORMULA_NAME AutonomousCar-PT-07b-UpperBounds-09
FORMULA_NAME AutonomousCar-PT-07b-UpperBounds-10
FORMULA_NAME AutonomousCar-PT-07b-UpperBounds-11
FORMULA_NAME AutonomousCar-PT-07b-UpperBounds-12
FORMULA_NAME AutonomousCar-PT-07b-UpperBounds-13
FORMULA_NAME AutonomousCar-PT-07b-UpperBounds-14
FORMULA_NAME AutonomousCar-PT-07b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678521297616

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=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-07b
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-11 07:55:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-11 07:55:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 07:55:00] [INFO ] Load time of PNML (sax parser for PT used): 104 ms
[2023-03-11 07:55:00] [INFO ] Transformed 323 places.
[2023-03-11 07:55:00] [INFO ] Transformed 846 transitions.
[2023-03-11 07:55:00] [INFO ] Found NUPN structural information;
[2023-03-11 07:55:00] [INFO ] Parsed PT model containing 323 places and 846 transitions and 5865 arcs in 181 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 846 rows 323 cols
[2023-03-11 07:55:00] [INFO ] Computed 12 place invariants in 28 ms
Incomplete random walk after 10000 steps, including 38 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 16) seen :13
FORMULA AutonomousCar-PT-07b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-07b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-07b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-07b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-07b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-07b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-07b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-07b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-07b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-07b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-07b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-07b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-07b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 3) seen :1
FORMULA AutonomousCar-PT-07b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-11 07:55:00] [INFO ] Invariant cache hit.
[2023-03-11 07:55:00] [INFO ] [Real]Absence check using 12 positive place invariants in 19 ms returned sat
[2023-03-11 07:55:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 07:55:01] [INFO ] [Real]Absence check using state equation in 339 ms returned sat
[2023-03-11 07:55:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 07:55:01] [INFO ] [Nat]Absence check using 12 positive place invariants in 8 ms returned sat
[2023-03-11 07:55:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 07:55:01] [INFO ] [Nat]Absence check using state equation in 279 ms returned unsat
[2023-03-11 07:55:01] [INFO ] [Real]Absence check using 12 positive place invariants in 7 ms returned sat
[2023-03-11 07:55:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 07:55:02] [INFO ] [Real]Absence check using state equation in 263 ms returned sat
[2023-03-11 07:55:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 07:55:02] [INFO ] [Nat]Absence check using 12 positive place invariants in 8 ms returned sat
[2023-03-11 07:55:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 07:55:02] [INFO ] [Nat]Absence check using state equation in 240 ms returned sat
[2023-03-11 07:55:02] [INFO ] Deduced a trap composed of 12 places in 421 ms of which 5 ms to minimize.
[2023-03-11 07:55:03] [INFO ] Deduced a trap composed of 12 places in 453 ms of which 2 ms to minimize.
[2023-03-11 07:55:03] [INFO ] Deduced a trap composed of 14 places in 371 ms of which 14 ms to minimize.
[2023-03-11 07:55:04] [INFO ] Deduced a trap composed of 35 places in 287 ms of which 1 ms to minimize.
[2023-03-11 07:55:04] [INFO ] Deduced a trap composed of 35 places in 331 ms of which 1 ms to minimize.
[2023-03-11 07:55:04] [INFO ] Deduced a trap composed of 38 places in 193 ms of which 1 ms to minimize.
[2023-03-11 07:55:04] [INFO ] Deduced a trap composed of 35 places in 214 ms of which 0 ms to minimize.
[2023-03-11 07:55:05] [INFO ] Deduced a trap composed of 35 places in 176 ms of which 14 ms to minimize.
[2023-03-11 07:55:05] [INFO ] Deduced a trap composed of 35 places in 189 ms of which 0 ms to minimize.
[2023-03-11 07:55:05] [INFO ] Deduced a trap composed of 35 places in 214 ms of which 1 ms to minimize.
[2023-03-11 07:55:05] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3172 ms
[2023-03-11 07:55:05] [INFO ] Computed and/alt/rep : 263/303/263 causal constraints (skipped 582 transitions) in 186 ms.
[2023-03-11 07:55:07] [INFO ] Deduced a trap composed of 16 places in 443 ms of which 2 ms to minimize.
[2023-03-11 07:55:07] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [0, 1] Max seen :[0, 0]
FORMULA AutonomousCar-PT-07b-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 323 places. Attempting structural reductions.
Drop transitions removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 323/323 places, 845/845 transitions.
Graph (trivial) has 308 edges and 323 vertex of which 4 / 323 are part of one of the 2 SCC in 7 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1180 edges and 321 vertex of which 314 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.13 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 141 transitions
Trivial Post-agglo rules discarded 141 transitions
Performed 141 trivial Post agglomeration. Transition count delta: 141
Iterating post reduction 0 with 144 rules applied. Total rules applied 146 place count 313 transition count 692
Reduce places removed 142 places and 1 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 184 rules applied. Total rules applied 330 place count 171 transition count 649
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 354 place count 147 transition count 649
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 354 place count 147 transition count 644
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 364 place count 142 transition count 644
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 392 place count 114 transition count 616
Iterating global reduction 3 with 28 rules applied. Total rules applied 420 place count 114 transition count 616
Ensure Unique test removed 196 transitions
Reduce isomorphic transitions removed 196 transitions.
Iterating post reduction 3 with 196 rules applied. Total rules applied 616 place count 114 transition count 420
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 616 place count 114 transition count 418
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 620 place count 112 transition count 418
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 628 place count 104 transition count 368
Iterating global reduction 4 with 8 rules applied. Total rules applied 636 place count 104 transition count 368
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 4 with 14 rules applied. Total rules applied 650 place count 104 transition count 354
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 657 place count 97 transition count 354
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 6 with 70 rules applied. Total rules applied 727 place count 62 transition count 319
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 734 place count 55 transition count 263
Iterating global reduction 6 with 7 rules applied. Total rules applied 741 place count 55 transition count 263
Free-agglomeration rule applied 8 times.
Iterating global reduction 6 with 8 rules applied. Total rules applied 749 place count 55 transition count 255
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 757 place count 47 transition count 255
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 758 place count 47 transition count 255
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 759 place count 46 transition count 254
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 760 place count 45 transition count 254
Applied a total of 760 rules in 191 ms. Remains 45 /323 variables (removed 278) and now considering 254/845 (removed 591) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 192 ms. Remains : 45/323 places, 254/845 transitions.
// Phase 1: matrix 254 rows 45 cols
[2023-03-11 07:55:07] [INFO ] Computed 11 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 8935 resets, run finished after 3016 ms. (steps per millisecond=331 ) properties (out of 1) seen :1
FORMULA AutonomousCar-PT-07b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 10564 ms.

BK_STOP 1678521310852

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="AutonomousCar-PT-07b"
export BK_EXAMINATION="UpperBounds"
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-5348"
echo " Executing tool itstools"
echo " Input is AutonomousCar-PT-07b, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r005-oct2-167813593400637"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-07b.tgz
mv AutonomousCar-PT-07b execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;