Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r043-tajo-167813697200661.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is CANConstruction-PT-060, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-tajo-167813697200661
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.9M
-rw-r--r-- 1 mcc users 9.0K Feb 25 22:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 25 22:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 25 22:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 25 22:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 15:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 15:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 26K Feb 25 22:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 219K Feb 25 22:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 25 22:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 22:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:40 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 5.4M 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 CANConstruction-PT-060-UpperBounds-00
FORMULA_NAME CANConstruction-PT-060-UpperBounds-01
FORMULA_NAME CANConstruction-PT-060-UpperBounds-02
FORMULA_NAME CANConstruction-PT-060-UpperBounds-03
FORMULA_NAME CANConstruction-PT-060-UpperBounds-04
FORMULA_NAME CANConstruction-PT-060-UpperBounds-05
FORMULA_NAME CANConstruction-PT-060-UpperBounds-06
FORMULA_NAME CANConstruction-PT-060-UpperBounds-07
FORMULA_NAME CANConstruction-PT-060-UpperBounds-08
FORMULA_NAME CANConstruction-PT-060-UpperBounds-09
FORMULA_NAME CANConstruction-PT-060-UpperBounds-10
FORMULA_NAME CANConstruction-PT-060-UpperBounds-11
FORMULA_NAME CANConstruction-PT-060-UpperBounds-12
FORMULA_NAME CANConstruction-PT-060-UpperBounds-13
FORMULA_NAME CANConstruction-PT-060-UpperBounds-14
FORMULA_NAME CANConstruction-PT-060-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678798477630

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=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-060
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-14 12:54:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-14 12:54:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 12:54:39] [INFO ] Load time of PNML (sax parser for PT used): 371 ms
[2023-03-14 12:54:39] [INFO ] Transformed 7922 places.
[2023-03-14 12:54:40] [INFO ] Transformed 14880 transitions.
[2023-03-14 12:54:40] [INFO ] Parsed PT model containing 7922 places and 14880 transitions and 44400 arcs in 541 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 14880 rows 7922 cols
[2023-03-14 12:54:40] [INFO ] Computed 121 place invariants in 214 ms
FORMULA CANConstruction-PT-060-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 9 resets, run finished after 256 ms. (steps per millisecond=39 ) properties (out of 15) seen :3
FORMULA CANConstruction-PT-060-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-060-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-060-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 12) seen :0
[2023-03-14 12:54:40] [INFO ] Invariant cache hit.
[2023-03-14 12:54:42] [INFO ] [Real]Absence check using 61 positive place invariants in 264 ms returned sat
[2023-03-14 12:54:42] [INFO ] [Real]Absence check using 61 positive and 60 generalized place invariants in 38 ms returned sat
[2023-03-14 12:54:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 12:54:46] [INFO ] [Real]Absence check using state equation in 3698 ms returned unknown
[2023-03-14 12:54:46] [INFO ] [Real]Absence check using 61 positive place invariants in 193 ms returned sat
[2023-03-14 12:54:46] [INFO ] [Real]Absence check using 61 positive and 60 generalized place invariants in 52 ms returned sat
[2023-03-14 12:54:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 12:54:51] [INFO ] [Real]Absence check using state equation in 4042 ms returned unknown
[2023-03-14 12:54:51] [INFO ] [Real]Absence check using 61 positive place invariants in 178 ms returned sat
[2023-03-14 12:54:51] [INFO ] [Real]Absence check using 61 positive and 60 generalized place invariants in 37 ms returned sat
[2023-03-14 12:54:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 12:54:56] [INFO ] [Real]Absence check using state equation in 4057 ms returned unknown
[2023-03-14 12:54:57] [INFO ] [Real]Absence check using 61 positive place invariants in 365 ms returned sat
[2023-03-14 12:54:57] [INFO ] [Real]Absence check using 61 positive and 60 generalized place invariants in 74 ms returned sat
[2023-03-14 12:54:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 12:55:01] [INFO ] [Real]Absence check using state equation in 3971 ms returned unknown
[2023-03-14 12:55:01] [INFO ] [Real]Absence check using 61 positive place invariants in 167 ms returned sat
[2023-03-14 12:55:01] [INFO ] [Real]Absence check using 61 positive and 60 generalized place invariants in 37 ms returned sat
[2023-03-14 12:55:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 12:55:06] [INFO ] [Real]Absence check using state equation in 4115 ms returned unknown
[2023-03-14 12:55:07] [INFO ] [Real]Absence check using 61 positive place invariants in 179 ms returned sat
[2023-03-14 12:55:07] [INFO ] [Real]Absence check using 61 positive and 60 generalized place invariants in 80 ms returned sat
[2023-03-14 12:55:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 12:55:11] [INFO ] [Real]Absence check using state equation in 3912 ms returned unknown
[2023-03-14 12:55:11] [INFO ] [Real]Absence check using 61 positive place invariants in 166 ms returned sat
[2023-03-14 12:55:11] [INFO ] [Real]Absence check using 61 positive and 60 generalized place invariants in 38 ms returned sat
[2023-03-14 12:55:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 12:55:16] [INFO ] [Real]Absence check using state equation in 4224 ms returned unknown
[2023-03-14 12:55:16] [INFO ] [Real]Absence check using 61 positive place invariants in 164 ms returned sat
[2023-03-14 12:55:16] [INFO ] [Real]Absence check using 61 positive and 60 generalized place invariants in 38 ms returned sat
[2023-03-14 12:55:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 12:55:21] [INFO ] [Real]Absence check using state equation in 4235 ms returned unknown
[2023-03-14 12:55:21] [INFO ] [Real]Absence check using 61 positive place invariants in 154 ms returned sat
[2023-03-14 12:55:21] [INFO ] [Real]Absence check using 61 positive and 60 generalized place invariants in 36 ms returned sat
[2023-03-14 12:55:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 12:55:26] [INFO ] [Real]Absence check using state equation in 4235 ms returned unknown
[2023-03-14 12:55:27] [INFO ] [Real]Absence check using 61 positive place invariants in 188 ms returned sat
[2023-03-14 12:55:27] [INFO ] [Real]Absence check using 61 positive and 60 generalized place invariants in 46 ms returned sat
[2023-03-14 12:55:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 12:55:31] [INFO ] [Real]Absence check using state equation in 3971 ms returned unknown
[2023-03-14 12:55:32] [INFO ] [Real]Absence check using 61 positive place invariants in 191 ms returned sat
[2023-03-14 12:55:32] [INFO ] [Real]Absence check using 61 positive and 60 generalized place invariants in 53 ms returned sat
[2023-03-14 12:55:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 12:55:36] [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: Broken pipe ... while checking expression at index 10
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
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)
[2023-03-14 12:55:37] [INFO ] [Real]Absence check using 61 positive place invariants in 216 ms returned sat
[2023-03-14 12:55:37] [INFO ] [Real]Absence check using 61 positive and 60 generalized place invariants in 78 ms returned sat
[2023-03-14 12:55:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 12:55:41] [INFO ] [Real]Absence check using state equation in 3803 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 12 out of 7922 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7922/7922 places, 14880/14880 transitions.
Drop transitions removed 417 transitions
Trivial Post-agglo rules discarded 417 transitions
Performed 417 trivial Post agglomeration. Transition count delta: 417
Iterating post reduction 0 with 417 rules applied. Total rules applied 417 place count 7922 transition count 14463
Reduce places removed 417 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 418 rules applied. Total rules applied 835 place count 7505 transition count 14462
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 836 place count 7504 transition count 14462
Discarding 3473 places :
Symmetric choice reduction at 3 with 3473 rule applications. Total rules 4309 place count 4031 transition count 7516
Iterating global reduction 3 with 3473 rules applied. Total rules applied 7782 place count 4031 transition count 7516
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 10 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 7902 place count 3971 transition count 7456
Free-agglomeration rule applied 106 times.
Iterating global reduction 3 with 106 rules applied. Total rules applied 8008 place count 3971 transition count 7350
Reduce places removed 106 places and 0 transitions.
Iterating post reduction 3 with 106 rules applied. Total rules applied 8114 place count 3865 transition count 7350
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 8115 place count 3865 transition count 7349
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 8116 place count 3864 transition count 7349
Partial Free-agglomeration rule applied 14 times.
Drop transitions removed 14 transitions
Iterating global reduction 5 with 14 rules applied. Total rules applied 8130 place count 3864 transition count 7349
Applied a total of 8130 rules in 4588 ms. Remains 3864 /7922 variables (removed 4058) and now considering 7349/14880 (removed 7531) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4589 ms. Remains : 3864/7922 places, 7349/14880 transitions.
// Phase 1: matrix 7349 rows 3864 cols
[2023-03-14 12:55:45] [INFO ] Computed 121 place invariants in 72 ms
Incomplete random walk after 1000000 steps, including 2404 resets, run finished after 14048 ms. (steps per millisecond=71 ) properties (out of 12) seen :12
FORMULA CANConstruction-PT-060-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-060-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-060-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-060-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-060-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-060-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-060-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-060-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-060-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-060-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-060-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-060-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 80515 ms.
ITS solved all properties within timeout

BK_STOP 1678798560193

--------------------
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 UpperBounds -timeout 360 -rebuildPNML

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="CANConstruction-PT-060"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is CANConstruction-PT-060, 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 r043-tajo-167813697200661"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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