Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r013-tall-174853743000063.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool gold2024
Input is AutoFlight-PT-04b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r013-tall-174853743000063
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 156K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 35K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 91K May 29 14:32 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

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

=== Now, execution of the tool begins

BK_START 1748540871183

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-04b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-29 17:47:52] [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]
[2025-05-29 17:47:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 17:47:52] [INFO ] Load time of PNML (sax parser for PT used): 83 ms
[2025-05-29 17:47:52] [INFO ] Transformed 390 places.
[2025-05-29 17:47:52] [INFO ] Transformed 388 transitions.
[2025-05-29 17:47:52] [INFO ] Found NUPN structural information;
[2025-05-29 17:47:52] [INFO ] Parsed PT model containing 390 places and 388 transitions and 906 arcs in 183 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 388 rows 390 cols
[2025-05-29 17:47:52] [INFO ] Computed 28 invariants in 14 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (49 resets) in 40 ms. (243 steps per ms)
FORMULA AutoFlight-PT-04b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutoFlight-PT-04b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutoFlight-PT-04b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutoFlight-PT-04b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutoFlight-PT-04b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutoFlight-PT-04b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutoFlight-PT-04b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutoFlight-PT-04b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutoFlight-PT-04b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutoFlight-PT-04b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutoFlight-PT-04b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutoFlight-PT-04b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutoFlight-PT-04b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutoFlight-PT-04b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 20002 steps (9 resets) in 18 ms. (1052 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2025-05-29 17:47:52] [INFO ] Invariant cache hit.
[2025-05-29 17:47:53] [INFO ] [Real]Absence check using 27 positive place invariants in 12 ms returned sat
[2025-05-29 17:47:53] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 2 ms returned sat
[2025-05-29 17:47:53] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2025-05-29 17:47:53] [INFO ] Deduced a trap composed of 61 places in 251 ms of which 133 ms to minimize.
[2025-05-29 17:47:53] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:47:53] [INFO ] [Nat]Absence check using 27 positive place invariants in 12 ms returned sat
[2025-05-29 17:47:53] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-29 17:47:53] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2025-05-29 17:47:53] [INFO ] Deduced a trap composed of 61 places in 97 ms of which 13 ms to minimize.
[2025-05-29 17:47:53] [INFO ] Deduced a trap composed of 46 places in 159 ms of which 2 ms to minimize.
[2025-05-29 17:47:54] [INFO ] Deduced a trap composed of 48 places in 77 ms of which 2 ms to minimize.
[2025-05-29 17:47:54] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 2 ms to minimize.
[2025-05-29 17:47:54] [INFO ] Deduced a trap composed of 35 places in 74 ms of which 2 ms to minimize.
[2025-05-29 17:47:54] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 599 ms
[2025-05-29 17:47:54] [INFO ] Computed and/alt/rep : 387/521/387 causal constraints (skipped 0 transitions) in 27 ms.
[2025-05-29 17:47:56] [INFO ] Added : 355 causal constraints over 71 iterations in 1978 ms. Result :sat
Minimization took 157 ms.
[2025-05-29 17:47:56] [INFO ] [Real]Absence check using 27 positive place invariants in 10 ms returned sat
[2025-05-29 17:47:56] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-29 17:47:56] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2025-05-29 17:47:56] [INFO ] Deduced a trap composed of 58 places in 90 ms of which 3 ms to minimize.
[2025-05-29 17:47:56] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:47:56] [INFO ] [Nat]Absence check using 27 positive place invariants in 15 ms returned sat
[2025-05-29 17:47:56] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 3 ms returned sat
[2025-05-29 17:47:56] [INFO ] [Nat]Absence check using state equation in 102 ms returned sat
[2025-05-29 17:47:57] [INFO ] Deduced a trap composed of 44 places in 74 ms of which 1 ms to minimize.
[2025-05-29 17:47:57] [INFO ] Deduced a trap composed of 61 places in 54 ms of which 1 ms to minimize.
[2025-05-29 17:47:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 164 ms
[2025-05-29 17:47:57] [INFO ] Computed and/alt/rep : 387/521/387 causal constraints (skipped 0 transitions) in 21 ms.
[2025-05-29 17:47:59] [INFO ] Deduced a trap composed of 56 places in 78 ms of which 2 ms to minimize.
[2025-05-29 17:47:59] [INFO ] Deduced a trap composed of 59 places in 75 ms of which 2 ms to minimize.
[2025-05-29 17:47:59] [INFO ] Deduced a trap composed of 51 places in 60 ms of which 2 ms to minimize.
[2025-05-29 17:47:59] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 1 ms to minimize.
[2025-05-29 17:47:59] [INFO ] Deduced a trap composed of 53 places in 63 ms of which 2 ms to minimize.
[2025-05-29 17:47:59] [INFO ] Deduced a trap composed of 50 places in 63 ms of which 1 ms to minimize.
[2025-05-29 17:47:59] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 623 ms
[2025-05-29 17:47:59] [INFO ] Added : 376 causal constraints over 76 iterations in 2598 ms. Result :sat
Minimization took 136 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
FORMULA AutoFlight-PT-04b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[1]
Support contains 1 out of 390 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p298) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 390/390 places, 387/387 transitions.
Reduce places removed 2 places and 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 151 transitions
Trivial Post-agglo rules discarded 151 transitions
Performed 151 trivial Post agglomeration. Transition count delta: 151
Iterating post reduction 0 with 153 rules applied. Total rules applied 153 place count 388 transition count 234
Reduce places removed 154 places and 3 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 182 rules applied. Total rules applied 335 place count 234 transition count 203
Reduce places removed 10 places and 2 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 345 place count 224 transition count 201
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 346 place count 223 transition count 200
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 347 place count 222 transition count 199
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 54 Pre rules applied. Total rules applied 347 place count 222 transition count 145
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 5 with 108 rules applied. Total rules applied 455 place count 168 transition count 145
Discarding 34 places :
Symmetric choice reduction at 5 with 34 rule applications. Total rules 489 place count 134 transition count 111
Iterating global reduction 5 with 34 rules applied. Total rules applied 523 place count 134 transition count 111
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 12 Pre rules applied. Total rules applied 523 place count 134 transition count 99
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 547 place count 122 transition count 99
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 5 with 60 rules applied. Total rules applied 607 place count 92 transition count 69
Free-agglomeration rule applied 16 times.
Iterating global reduction 5 with 16 rules applied. Total rules applied 623 place count 92 transition count 53
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 5 with 16 rules applied. Total rules applied 639 place count 76 transition count 53
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 640 place count 75 transition count 52
Reduce places removed 16 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 6 with 38 rules applied. Total rules applied 678 place count 59 transition count 30
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 7 with 22 rules applied. Total rules applied 700 place count 37 transition count 30
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 10 Pre rules applied. Total rules applied 700 place count 37 transition count 20
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 8 with 20 rules applied. Total rules applied 720 place count 27 transition count 20
Applied a total of 720 rules in 78 ms. Remains 27 /390 variables (removed 363) and now considering 20/387 (removed 367) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 27/390 places, 20/387 transitions.
// Phase 1: matrix 20 rows 27 cols
[2025-05-29 17:48:00] [INFO ] Computed 12 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[1]
FORMULA AutoFlight-PT-04b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (58789 resets) in 780 ms. (1280 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2025-05-29 17:48:01] [INFO ] Flatten gal took : 21 ms
[2025-05-29 17:48:01] [INFO ] Flatten gal took : 5 ms
[2025-05-29 17:48:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10875948594564986052.gal : 4 ms
[2025-05-29 17:48:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3139572675667575375.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10875948594564986052.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3139572675667575375.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 8720 ms.

BK_STOP 1748540881181

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="AutoFlight-PT-04b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is AutoFlight-PT-04b, 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 r013-tall-174853743000063"
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 [ "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.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 ;