Execution Chart

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

Trace from the execution

Formatting '/data/sdalzilio/mcc2026-input.r191-oct2-177969025600032.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/sdalzilio/mcc2026-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................
=====================================================================
Generated by BenchKit 2-5973
Executing tool gold2025
Input is MedleyA-PT-20, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r191-oct2-177969025600032
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 6.3K Mar 7 18:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Mar 7 18:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Mar 7 18:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Mar 7 18:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 15 11:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 11:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 11:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 11:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Mar 7 18:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Mar 7 18:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Mar 7 18:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Mar 7 18:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 130K Mar 3 18:30 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 MedleyA-PT-20-UpperBounds-00
FORMULA_NAME MedleyA-PT-20-UpperBounds-01
FORMULA_NAME MedleyA-PT-20-UpperBounds-02
FORMULA_NAME MedleyA-PT-20-UpperBounds-03
FORMULA_NAME MedleyA-PT-20-UpperBounds-04
FORMULA_NAME MedleyA-PT-20-UpperBounds-05
FORMULA_NAME MedleyA-PT-20-UpperBounds-06
FORMULA_NAME MedleyA-PT-20-UpperBounds-07
FORMULA_NAME MedleyA-PT-20-UpperBounds-08
FORMULA_NAME MedleyA-PT-20-UpperBounds-09
FORMULA_NAME MedleyA-PT-20-UpperBounds-10
FORMULA_NAME MedleyA-PT-20-UpperBounds-11
FORMULA_NAME MedleyA-PT-20-UpperBounds-12
FORMULA_NAME MedleyA-PT-20-UpperBounds-13
FORMULA_NAME MedleyA-PT-20-UpperBounds-14
FORMULA_NAME MedleyA-PT-20-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779942890497

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-20
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-28 04:34: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]
[2026-05-28 04:34:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-28 04:34:52] [INFO ] Load time of PNML (sax parser for PT used): 127 ms
[2026-05-28 04:34:52] [INFO ] Transformed 273 places.
[2026-05-28 04:34:52] [INFO ] Transformed 518 transitions.
[2026-05-28 04:34:52] [INFO ] Found NUPN structural information;
[2026-05-28 04:34:52] [INFO ] Parsed PT model containing 273 places and 518 transitions and 1795 arcs in 284 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 518 rows 273 cols
[2026-05-28 04:34:52] [INFO ] Computed 11 invariants in 22 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 (18 resets) in 80 ms. (123 steps per ms)
FORMULA MedleyA-PT-20-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-20-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-20-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-20-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-20-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-20-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-20-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-20-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-20-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-20-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-20-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50004 steps (47 resets) in 110 ms. (450 steps per ms)
FORMULA MedleyA-PT-20-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2026-05-28 04:34:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:34:52] [INFO ] [Real]Absence check using 9 positive place invariants in 10 ms returned sat
[2026-05-28 04:34:52] [INFO ] [Real]Absence check using 9 positive and 2 generalized place invariants in 8 ms returned sat
[2026-05-28 04:34:53] [INFO ] [Real]Absence check using state equation in 187 ms returned sat
[2026-05-28 04:34:53] [INFO ] Computed and/alt/rep : 410/1785/410 causal constraints (skipped 107 transitions) in 50 ms.
[2026-05-28 04:34:53] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:34:53] [INFO ] [Nat]Absence check using 9 positive place invariants in 7 ms returned sat
[2026-05-28 04:34:53] [INFO ] [Nat]Absence check using 9 positive and 2 generalized place invariants in 4 ms returned sat
[2026-05-28 04:34:53] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2026-05-28 04:34:53] [INFO ] Computed and/alt/rep : 410/1785/410 causal constraints (skipped 107 transitions) in 34 ms.
[2026-05-28 04:34:55] [INFO ] Added : 127 causal constraints over 26 iterations in 1680 ms. Result :sat
Minimization took 225 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:34:55] [INFO ] [Real]Absence check using 9 positive place invariants in 8 ms returned sat
[2026-05-28 04:34:55] [INFO ] [Real]Absence check using 9 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-28 04:34:55] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2026-05-28 04:34:56] [INFO ] Computed and/alt/rep : 410/1785/410 causal constraints (skipped 107 transitions) in 38 ms.
[2026-05-28 04:34:56] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:34:56] [INFO ] [Nat]Absence check using 9 positive place invariants in 7 ms returned sat
[2026-05-28 04:34:56] [INFO ] [Nat]Absence check using 9 positive and 2 generalized place invariants in 5 ms returned sat
[2026-05-28 04:34:56] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2026-05-28 04:34:56] [INFO ] Computed and/alt/rep : 410/1785/410 causal constraints (skipped 107 transitions) in 50 ms.
[2026-05-28 04:34:57] [INFO ] Added : 118 causal constraints over 24 iterations in 1143 ms. Result :sat
Minimization took 229 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:34:57] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2026-05-28 04:34:57] [INFO ] [Real]Absence check using 9 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-28 04:34:57] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2026-05-28 04:34:58] [INFO ] Computed and/alt/rep : 410/1785/410 causal constraints (skipped 107 transitions) in 38 ms.
[2026-05-28 04:34:58] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:34:58] [INFO ] [Nat]Absence check using 9 positive place invariants in 6 ms returned sat
[2026-05-28 04:34:58] [INFO ] [Nat]Absence check using 9 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-28 04:34:58] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2026-05-28 04:34:58] [INFO ] Computed and/alt/rep : 410/1785/410 causal constraints (skipped 107 transitions) in 26 ms.
[2026-05-28 04:34:59] [INFO ] Added : 123 causal constraints over 25 iterations in 1141 ms. Result :sat
Minimization took 248 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:34:59] [INFO ] [Real]Absence check using 9 positive place invariants in 7 ms returned sat
[2026-05-28 04:34:59] [INFO ] [Real]Absence check using 9 positive and 2 generalized place invariants in 7 ms returned sat
[2026-05-28 04:34:59] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2026-05-28 04:35:00] [INFO ] Computed and/alt/rep : 410/1785/410 causal constraints (skipped 107 transitions) in 43 ms.
[2026-05-28 04:35:00] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:35:00] [INFO ] [Nat]Absence check using 9 positive place invariants in 7 ms returned sat
[2026-05-28 04:35:00] [INFO ] [Nat]Absence check using 9 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-28 04:35:00] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2026-05-28 04:35:00] [INFO ] Computed and/alt/rep : 410/1785/410 causal constraints (skipped 107 transitions) in 51 ms.
[2026-05-28 04:35:02] [INFO ] Added : 159 causal constraints over 32 iterations in 2039 ms. Result :sat
Minimization took 444 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
FORMULA MedleyA-PT-20-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-20-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 273 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 273/273 places, 518/518 transitions.
Graph (trivial) has 230 edges and 273 vertex of which 30 / 273 are part of one of the 3 SCC in 3 ms
Free SCC test removed 27 places
Drop transitions (Empty/Sink Transition effects.) removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 246 transition count 463
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 37 place count 230 transition count 459
Discarding 77 places :
Symmetric choice reduction at 2 with 77 rule applications. Total rules 114 place count 153 transition count 382
Iterating global reduction 2 with 77 rules applied. Total rules applied 191 place count 153 transition count 382
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 191 place count 153 transition count 372
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 211 place count 143 transition count 372
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 214 place count 143 transition count 369
Discarding 38 places :
Symmetric choice reduction at 3 with 38 rule applications. Total rules 252 place count 105 transition count 255
Iterating global reduction 3 with 38 rules applied. Total rules applied 290 place count 105 transition count 255
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 18 rules applied. Total rules applied 308 place count 105 transition count 237
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 314 place count 102 transition count 234
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 315 place count 101 transition count 232
Iterating global reduction 5 with 1 rules applied. Total rules applied 316 place count 101 transition count 232
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 317 place count 100 transition count 229
Iterating global reduction 5 with 1 rules applied. Total rules applied 318 place count 100 transition count 229
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 319 place count 100 transition count 228
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 347 place count 86 transition count 214
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 367 place count 76 transition count 230
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 376 place count 76 transition count 221
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 379 place count 73 transition count 212
Iterating global reduction 6 with 3 rules applied. Total rules applied 382 place count 73 transition count 212
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 385 place count 73 transition count 209
Free-agglomeration rule applied 21 times.
Iterating global reduction 7 with 21 rules applied. Total rules applied 406 place count 73 transition count 188
Reduce places removed 21 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 7 with 30 rules applied. Total rules applied 436 place count 52 transition count 179
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 442 place count 49 transition count 176
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 443 place count 48 transition count 175
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 444 place count 47 transition count 175
Applied a total of 444 rules in 130 ms. Remains 47 /273 variables (removed 226) and now considering 175/518 (removed 343) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 140 ms. Remains : 47/273 places, 175/518 transitions.
[2026-05-28 04:35:03] [INFO ] Flow matrix only has 169 transitions (discarded 6 similar events)
// Phase 1: matrix 169 rows 47 cols
[2026-05-28 04:35:03] [INFO ] Computed 10 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (12971 resets) in 2357 ms. (424 steps per ms)
FORMULA MedleyA-PT-20-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-20-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (1322 resets) in 436 ms. (2288 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 )
[2026-05-28 04:35:06] [INFO ] Flatten gal took : 46 ms
[2026-05-28 04:35:06] [INFO ] Flatten gal took : 15 ms
[2026-05-28 04:35:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17593696549639755368.gal : 12 ms
[2026-05-28 04:35:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1369493323669025144.prop : 1 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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17593696549639755368.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1369493323669025144.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 14458 ms.

BK_STOP 1779942906582

--------------------
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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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="MedleyA-PT-20"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2025"
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-5973"
echo " Executing tool gold2025"
echo " Input is MedleyA-PT-20, 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 r191-oct2-177969025600032"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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