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.r223-smll-167840362200032.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2022
Input is HealthRecord-PT-03, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r223-smll-167840362200032
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 8.5K Feb 26 17:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 26 17:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 17:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 17:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 17:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 160K Feb 26 17:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 26 17:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 26 17:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:13 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 49K 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 HealthRecord-PT-03-UpperBounds-00
FORMULA_NAME HealthRecord-PT-03-UpperBounds-01
FORMULA_NAME HealthRecord-PT-03-UpperBounds-02
FORMULA_NAME HealthRecord-PT-03-UpperBounds-03
FORMULA_NAME HealthRecord-PT-03-UpperBounds-04
FORMULA_NAME HealthRecord-PT-03-UpperBounds-05
FORMULA_NAME HealthRecord-PT-03-UpperBounds-06
FORMULA_NAME HealthRecord-PT-03-UpperBounds-07
FORMULA_NAME HealthRecord-PT-03-UpperBounds-08
FORMULA_NAME HealthRecord-PT-03-UpperBounds-09
FORMULA_NAME HealthRecord-PT-03-UpperBounds-10
FORMULA_NAME HealthRecord-PT-03-UpperBounds-11
FORMULA_NAME HealthRecord-PT-03-UpperBounds-12
FORMULA_NAME HealthRecord-PT-03-UpperBounds-13
FORMULA_NAME HealthRecord-PT-03-UpperBounds-14
FORMULA_NAME HealthRecord-PT-03-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678578625842

Running Version 202205111006
[2023-03-11 23:50:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -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]
[2023-03-11 23:50:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 23:50:28] [INFO ] Load time of PNML (sax parser for PT used): 127 ms
[2023-03-11 23:50:28] [INFO ] Transformed 121 places.
[2023-03-11 23:50:28] [INFO ] Transformed 232 transitions.
[2023-03-11 23:50:28] [INFO ] Found NUPN structural information;
[2023-03-11 23:50:28] [INFO ] Parsed PT model containing 121 places and 232 transitions in 300 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
Ensure Unique test removed 7 transitions
Reduce redundant transitions removed 7 transitions.
Normalized transition count is 217 out of 225 initially.
// Phase 1: matrix 217 rows 121 cols
[2023-03-11 23:50:28] [INFO ] Computed 14 place invariants in 17 ms
Incomplete random walk after 10000 steps, including 669 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 16) seen :10
FORMULA HealthRecord-PT-03-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-03-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-03-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-03-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-03-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-03-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-03-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-03-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-03-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-03-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 101 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 102 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 6) seen :2
FORMULA HealthRecord-PT-03-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-03-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 102 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 4) seen :0
[2023-03-11 23:50:28] [INFO ] Flow matrix only has 217 transitions (discarded 8 similar events)
// Phase 1: matrix 217 rows 121 cols
[2023-03-11 23:50:28] [INFO ] Computed 14 place invariants in 12 ms
[2023-03-11 23:50:28] [INFO ] [Real]Absence check using 8 positive place invariants in 13 ms returned sat
[2023-03-11 23:50:28] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 7 ms returned sat
[2023-03-11 23:50:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 23:50:28] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2023-03-11 23:50:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 23:50:29] [INFO ] [Nat]Absence check using 8 positive place invariants in 11 ms returned sat
[2023-03-11 23:50:29] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 7 ms returned sat
[2023-03-11 23:50:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 23:50:29] [INFO ] [Nat]Absence check using state equation in 113 ms returned sat
[2023-03-11 23:50:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 23:50:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2023-03-11 23:50:29] [INFO ] Computed and/alt/rep : 170/183/170 causal constraints (skipped 46 transitions) in 84 ms.
[2023-03-11 23:50:29] [INFO ] Added : 8 causal constraints over 2 iterations in 195 ms. Result :sat
Minimization took 28 ms.
[2023-03-11 23:50:29] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2023-03-11 23:50:29] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-11 23:50:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 23:50:29] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2023-03-11 23:50:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 23:50:29] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2023-03-11 23:50:29] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 5 ms returned sat
[2023-03-11 23:50:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 23:50:29] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2023-03-11 23:50:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-11 23:50:29] [INFO ] Computed and/alt/rep : 170/183/170 causal constraints (skipped 46 transitions) in 29 ms.
[2023-03-11 23:50:29] [INFO ] Added : 9 causal constraints over 2 iterations in 89 ms. Result :sat
Minimization took 25 ms.
[2023-03-11 23:50:30] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2023-03-11 23:50:30] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 4 ms returned sat
[2023-03-11 23:50:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 23:50:30] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2023-03-11 23:50:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 23:50:30] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2023-03-11 23:50:30] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 4 ms returned sat
[2023-03-11 23:50:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 23:50:30] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2023-03-11 23:50:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-11 23:50:30] [INFO ] Computed and/alt/rep : 170/183/170 causal constraints (skipped 46 transitions) in 25 ms.
[2023-03-11 23:50:30] [INFO ] Added : 17 causal constraints over 4 iterations in 113 ms. Result :sat
Minimization took 27 ms.
[2023-03-11 23:50:30] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2023-03-11 23:50:30] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 5 ms returned sat
[2023-03-11 23:50:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 23:50:30] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2023-03-11 23:50:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 23:50:30] [INFO ] [Nat]Absence check using 8 positive place invariants in 12 ms returned sat
[2023-03-11 23:50:30] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 4 ms returned sat
[2023-03-11 23:50:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 23:50:30] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2023-03-11 23:50:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-11 23:50:30] [INFO ] Computed and/alt/rep : 170/183/170 causal constraints (skipped 46 transitions) in 26 ms.
[2023-03-11 23:50:30] [INFO ] Added : 7 causal constraints over 2 iterations in 78 ms. Result :sat
Minimization took 35 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
Support contains 4 out of 121 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 121/121 places, 225/225 transitions.
Graph (trivial) has 171 edges and 121 vertex of which 10 / 121 are part of one of the 5 SCC in 6 ms
Free SCC test removed 5 places
Drop transitions removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Graph (complete) has 429 edges and 116 vertex of which 108 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.3 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 6 place count 108 transition count 202
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 10 rules applied. Total rules applied 16 place count 104 transition count 196
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 20 place count 102 transition count 194
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 22 place count 101 transition count 193
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 22 place count 101 transition count 191
Deduced a syphon composed of 2 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 5 rules applied. Total rules applied 27 place count 98 transition count 191
Discarding 49 places :
Symmetric choice reduction at 4 with 49 rule applications. Total rules 76 place count 49 transition count 93
Iterating global reduction 4 with 49 rules applied. Total rules applied 125 place count 49 transition count 93
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 134 place count 40 transition count 75
Iterating global reduction 4 with 9 rules applied. Total rules applied 143 place count 40 transition count 75
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 147 place count 40 transition count 71
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 148 place count 39 transition count 68
Iterating global reduction 5 with 1 rules applied. Total rules applied 149 place count 39 transition count 68
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 150 place count 38 transition count 66
Iterating global reduction 5 with 1 rules applied. Total rules applied 151 place count 38 transition count 66
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 152 place count 38 transition count 65
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 162 place count 33 transition count 94
Partial Free-agglomeration rule applied 15 times.
Drop transitions removed 15 transitions
Iterating global reduction 6 with 15 rules applied. Total rules applied 177 place count 33 transition count 94
Partial Free-agglomeration rule applied 14 times.
Drop transitions removed 14 transitions
Iterating global reduction 6 with 14 rules applied. Total rules applied 191 place count 33 transition count 94
Applied a total of 191 rules in 82 ms. Remains 33 /121 variables (removed 88) and now considering 94/225 (removed 131) transitions.
[2023-03-11 23:50:31] [INFO ] Flow matrix only has 87 transitions (discarded 7 similar events)
// Phase 1: matrix 87 rows 33 cols
[2023-03-11 23:50:31] [INFO ] Computed 5 place invariants in 6 ms
[2023-03-11 23:50:31] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 33/121 places, 94/225 transitions.
Normalized transition count is 87 out of 94 initially.
// Phase 1: matrix 87 rows 33 cols
[2023-03-11 23:50:31] [INFO ] Computed 5 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 186240 resets, run finished after 2235 ms. (steps per millisecond=447 ) properties (out of 4) seen :4
FORMULA HealthRecord-PT-03-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-03-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-03-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-03-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 5535 ms.

BK_STOP 1678578633526

--------------------
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
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -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
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ 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 UpperBounds -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="HealthRecord-PT-03"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
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 gold2022"
echo " Input is HealthRecord-PT-03, 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 r223-smll-167840362200032"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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