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.r125-tall-174876435700048.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 IOTPpurchase-PT-C05M04P03D02, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r125-tall-174876435700048
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 11K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 106K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K 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 4.2K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 73K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 23K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 155K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K 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 13 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rwxr-xr-x 1 mcc users 60K 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 IOTPpurchase-PT-C05M04P03D02-UpperBounds-00
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-UpperBounds-01
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-UpperBounds-02
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-UpperBounds-03
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-UpperBounds-04
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-UpperBounds-05
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-UpperBounds-06
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-UpperBounds-07
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-UpperBounds-08
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-UpperBounds-09
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-UpperBounds-10
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-UpperBounds-11
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-UpperBounds-12
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-UpperBounds-13
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-UpperBounds-14
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748774271167

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=IOTPpurchase-PT-C05M04P03D02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-01 10:37: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-06-01 10:37:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 10:37:52] [INFO ] Load time of PNML (sax parser for PT used): 54 ms
[2025-06-01 10:37:52] [INFO ] Transformed 111 places.
[2025-06-01 10:37:52] [INFO ] Transformed 45 transitions.
[2025-06-01 10:37:52] [INFO ] Parsed PT model containing 111 places and 45 transitions and 224 arcs in 151 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 45 rows 111 cols
[2025-06-01 10:37:52] [INFO ] Computed 67 invariants in 16 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0] Max Struct:[5, 5, 2, 5, 1, 16, 5, 11, 5, 3, 1, 5, 10, 41, 12, 5]
RANDOM walk for 10000 steps (2 resets) in 52 ms. (188 steps per ms)
FORMULA IOTPpurchase-PT-C05M04P03D02-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA IOTPpurchase-PT-C05M04P03D02-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA IOTPpurchase-PT-C05M04P03D02-UpperBounds-02 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA IOTPpurchase-PT-C05M04P03D02-UpperBounds-09 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 120007 steps (24 resets) in 220 ms. (543 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 4, 4, 1, 4, 1, 4, 4, 3, 4, 1, 4] Max Struct:[5, 5, 5, 16, 5, 11, 5, 5, 10, 41, 12, 5]
[2025-06-01 10:37:52] [INFO ] Invariant cache hit.
[2025-06-01 10:37:53] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-01 10:37:53] [INFO ] [Real]Absence check using 8 positive and 59 generalized place invariants in 18 ms returned unsat
[2025-06-01 10:37:53] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-06-01 10:37:53] [INFO ] [Real]Absence check using 8 positive and 59 generalized place invariants in 6 ms returned unsat
[2025-06-01 10:37:53] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-06-01 10:37:53] [INFO ] [Real]Absence check using 8 positive and 59 generalized place invariants in 6 ms returned unsat
[2025-06-01 10:37:53] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-06-01 10:37:53] [INFO ] [Real]Absence check using 8 positive and 59 generalized place invariants in 5 ms returned unsat
[2025-06-01 10:37:53] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2025-06-01 10:37:53] [INFO ] [Real]Absence check using 8 positive and 59 generalized place invariants in 11 ms returned unsat
[2025-06-01 10:37:53] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2025-06-01 10:37:53] [INFO ] [Real]Absence check using 8 positive and 59 generalized place invariants in 3 ms returned unsat
[2025-06-01 10:37:53] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-06-01 10:37:53] [INFO ] [Real]Absence check using 8 positive and 59 generalized place invariants in 11 ms returned unsat
[2025-06-01 10:37:53] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2025-06-01 10:37:53] [INFO ] [Real]Absence check using 8 positive and 59 generalized place invariants in 6 ms returned unsat
[2025-06-01 10:37:53] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2025-06-01 10:37:53] [INFO ] [Real]Absence check using 8 positive and 59 generalized place invariants in 7 ms returned sat
[2025-06-01 10:37:53] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-01 10:37:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 10:37:53] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-01 10:37:53] [INFO ] Computed and/alt/rep : 44/95/44 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-01 10:37:53] [INFO ] Added : 35 causal constraints over 7 iterations in 59 ms. Result :sat
Minimization took 27 ms.
[2025-06-01 10:37:53] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2025-06-01 10:37:53] [INFO ] [Real]Absence check using 8 positive and 59 generalized place invariants in 5 ms returned unsat
[2025-06-01 10:37:53] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2025-06-01 10:37:53] [INFO ] [Real]Absence check using 8 positive and 59 generalized place invariants in 8 ms returned unsat
[2025-06-01 10:37:53] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-06-01 10:37:53] [INFO ] [Real]Absence check using 8 positive and 59 generalized place invariants in 5 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[4, 4, 4, 1, 4, 1, 4, 4, 3, 4, 1, 4] Max Struct:[4, 4, 4, 1, 4, 1, 4, 4, 10, 4, 1, 4]
FORMULA IOTPpurchase-PT-C05M04P03D02-UpperBounds-15 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IOTPpurchase-PT-C05M04P03D02-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IOTPpurchase-PT-C05M04P03D02-UpperBounds-13 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IOTPpurchase-PT-C05M04P03D02-UpperBounds-11 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IOTPpurchase-PT-C05M04P03D02-UpperBounds-08 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IOTPpurchase-PT-C05M04P03D02-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IOTPpurchase-PT-C05M04P03D02-UpperBounds-06 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IOTPpurchase-PT-C05M04P03D02-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IOTPpurchase-PT-C05M04P03D02-UpperBounds-03 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IOTPpurchase-PT-C05M04P03D02-UpperBounds-01 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IOTPpurchase-PT-C05M04P03D02-UpperBounds-00 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5] Max Struct:[10]
Support contains 1 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 45/45 transitions.
Ensure Unique test removed 36 places
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 67 transition count 38
Reduce places removed 11 places and 0 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 19 rules applied. Total rules applied 70 place count 56 transition count 30
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 78 place count 48 transition count 30
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 78 place count 48 transition count 20
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 104 place count 32 transition count 20
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 104 place count 32 transition count 17
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 110 place count 29 transition count 17
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 17 rules applied. Total rules applied 127 place count 19 transition count 10
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 128 place count 18 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 128 place count 18 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 131 place count 16 transition count 9
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 132 place count 16 transition count 8
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 134 place count 14 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 134 place count 14 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 137 place count 12 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 137 place count 12 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 140 place count 10 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 140 place count 10 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 143 place count 8 transition count 5
Applied a total of 143 rules in 331 ms. Remains 8 /111 variables (removed 103) and now considering 5/45 (removed 40) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 340 ms. Remains : 8/111 places, 5/45 transitions.
// Phase 1: matrix 5 rows 8 cols
[2025-06-01 10:37:54] [INFO ] Computed 4 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[5] Max Struct:[5]
FORMULA IOTPpurchase-PT-C05M04P03D02-UpperBounds-12 5 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (2 resets) in 435 ms. (2293 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-06-01 10:37:54] [INFO ] Flatten gal took : 15 ms
[2025-06-01 10:37:54] [INFO ] Flatten gal took : 2 ms
[2025-06-01 10:37:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15864855779848684090.gal : 3 ms
[2025-06-01 10:37:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1420459368793297088.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/ReachabilityCardinality15864855779848684090.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1420459368793297088.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality1420459368793297088.prop.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,5,0.00931,3412,2,29,5,59,6,0,40,23,0
ITS tools runner thread asked to quit. Dying gracefully.
Total reachable state count : 5

java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:168)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:334)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:270)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:313)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:188)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:177)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:162)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:329)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:396)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:840)
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 2388 ms.

BK_STOP 1748774274849

--------------------
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.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="IOTPpurchase-PT-C05M04P03D02"
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 IOTPpurchase-PT-C05M04P03D02, 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 r125-tall-174876435700048"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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