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.r265-tall-174931349700029.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 CopsAndRobbers-PT-HRL023X006, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-tall-174931349700029
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 684K
-rw-r--r-- 1 mcc users 8.3K Jun 6 08:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Jun 6 08:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Jun 6 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Jun 6 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.6K Jun 6 11:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 6 11:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Jun 6 11:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 6 11:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 15K Jun 6 09:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Jun 6 09:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Jun 6 09:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Jun 6 09:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Jun 6 11:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Jun 6 11:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 11 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 236K Jun 5 20:08 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 CopsAndRobbers-PT-HRL023X006-UpperBounds-00
FORMULA_NAME CopsAndRobbers-PT-HRL023X006-UpperBounds-01
FORMULA_NAME CopsAndRobbers-PT-HRL023X006-UpperBounds-02
FORMULA_NAME CopsAndRobbers-PT-HRL023X006-UpperBounds-03
FORMULA_NAME CopsAndRobbers-PT-HRL023X006-UpperBounds-04
FORMULA_NAME CopsAndRobbers-PT-HRL023X006-UpperBounds-05
FORMULA_NAME CopsAndRobbers-PT-HRL023X006-UpperBounds-06
FORMULA_NAME CopsAndRobbers-PT-HRL023X006-UpperBounds-07
FORMULA_NAME CopsAndRobbers-PT-HRL023X006-UpperBounds-08
FORMULA_NAME CopsAndRobbers-PT-HRL023X006-UpperBounds-09
FORMULA_NAME CopsAndRobbers-PT-HRL023X006-UpperBounds-10
FORMULA_NAME CopsAndRobbers-PT-HRL023X006-UpperBounds-11
FORMULA_NAME CopsAndRobbers-PT-HRL023X006-UpperBounds-12
FORMULA_NAME CopsAndRobbers-PT-HRL023X006-UpperBounds-13
FORMULA_NAME CopsAndRobbers-PT-HRL023X006-UpperBounds-14
FORMULA_NAME CopsAndRobbers-PT-HRL023X006-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1749318833110

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CopsAndRobbers-PT-HRL023X006
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-07 17:53:54] [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-07 17:53:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 17:53:54] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2025-06-07 17:53:54] [INFO ] Transformed 125 places.
[2025-06-07 17:53:54] [INFO ] Transformed 287 transitions.
[2025-06-07 17:53:54] [INFO ] Parsed PT model containing 125 places and 287 transitions and 1500 arcs in 176 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, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 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, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 287 rows 125 cols
[2025-06-07 17:53:54] [INFO ] Computed 27 invariants in 27 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[6, 1, 1, 6, 1, 6, 1, 1, 6, 1, 6, 6, 6, 6, 6, 1]
FORMULA CopsAndRobbers-PT-HRL023X006-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CopsAndRobbers-PT-HRL023X006-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10001 steps (45 resets) in 32 ms. (303 steps per ms)
FORMULA CopsAndRobbers-PT-HRL023X006-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CopsAndRobbers-PT-HRL023X006-UpperBounds-14 6 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CopsAndRobbers-PT-HRL023X006-UpperBounds-12 6 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CopsAndRobbers-PT-HRL023X006-UpperBounds-11 6 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CopsAndRobbers-PT-HRL023X006-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CopsAndRobbers-PT-HRL023X006-UpperBounds-08 6 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CopsAndRobbers-PT-HRL023X006-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CopsAndRobbers-PT-HRL023X006-UpperBounds-03 6 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CopsAndRobbers-PT-HRL023X006-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CopsAndRobbers-PT-HRL023X006-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CopsAndRobbers-PT-HRL023X006-UpperBounds-00 6 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 30002 steps (64 resets) in 44 ms. (666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5, 5, 1] Max Struct:[6, 6, 6]
[2025-06-07 17:53:54] [INFO ] Invariant cache hit.
[2025-06-07 17:53:54] [INFO ] [Real]Absence check using 26 positive place invariants in 8 ms returned sat
[2025-06-07 17:53:54] [INFO ] [Real]Absence check using 26 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-07 17:53:55] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2025-06-07 17:53:55] [INFO ] State equation strengthened by 54 read => feed constraints.
[2025-06-07 17:53:55] [INFO ] [Real]Added 54 Read/Feed constraints in 9 ms returned sat
[2025-06-07 17:53:55] [INFO ] Solution in real domain found non-integer solution.
[2025-06-07 17:53:55] [INFO ] [Nat]Absence check using 26 positive place invariants in 6 ms returned sat
[2025-06-07 17:53:55] [INFO ] [Nat]Absence check using 26 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-07 17:53:55] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2025-06-07 17:53:55] [INFO ] [Nat]Added 54 Read/Feed constraints in 15 ms returned sat
[2025-06-07 17:53:55] [INFO ] Computed and/alt/rep : 229/1251/229 causal constraints (skipped 12 transitions) in 26 ms.
[2025-06-07 17:53:55] [INFO ] Deduced a trap composed of 50 places in 159 ms of which 84 ms to minimize.
[2025-06-07 17:53:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 244 ms
[2025-06-07 17:53:55] [INFO ] Added : 14 causal constraints over 5 iterations in 443 ms. Result :sat
Minimization took 117 ms.
[2025-06-07 17:53:55] [INFO ] [Real]Absence check using 26 positive place invariants in 4 ms returned sat
[2025-06-07 17:53:55] [INFO ] [Real]Absence check using 26 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-07 17:53:55] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2025-06-07 17:53:55] [INFO ] [Real]Added 54 Read/Feed constraints in 10 ms returned sat
[2025-06-07 17:53:55] [INFO ] Computed and/alt/rep : 229/1251/229 causal constraints (skipped 12 transitions) in 20 ms.
[2025-06-07 17:53:56] [INFO ] Added : 6 causal constraints over 2 iterations in 78 ms. Result :sat
Minimization took 135 ms.
[2025-06-07 17:53:56] [INFO ] [Real]Absence check using 26 positive place invariants in 5 ms returned sat
[2025-06-07 17:53:56] [INFO ] [Real]Absence check using 26 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-07 17:53:56] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2025-06-07 17:53:56] [INFO ] Solution in real domain found non-integer solution.
[2025-06-07 17:53:56] [INFO ] [Nat]Absence check using 26 positive place invariants in 5 ms returned sat
[2025-06-07 17:53:56] [INFO ] [Nat]Absence check using 26 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-07 17:53:56] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2025-06-07 17:53:56] [INFO ] [Nat]Added 54 Read/Feed constraints in 7 ms returned sat
[2025-06-07 17:53:56] [INFO ] Computed and/alt/rep : 229/1251/229 causal constraints (skipped 12 transitions) in 19 ms.
[2025-06-07 17:53:56] [INFO ] Added : 6 causal constraints over 2 iterations in 80 ms. Result :sat
Minimization took 128 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5, 5, 1] Max Struct:[6, 6, 6]
FORMULA CopsAndRobbers-PT-HRL023X006-UpperBounds-13 6 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CopsAndRobbers-PT-HRL023X006-UpperBounds-10 6 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5] Max Struct:[6]
Support contains 1 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 287/287 transitions.
Graph (complete) has 806 edges and 125 vertex of which 103 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.3 ms
Discarding 22 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 102 transition count 286
Applied a total of 3 rules in 40 ms. Remains 102 /125 variables (removed 23) and now considering 286/287 (removed 1) transitions.
Running 240 sub problems to find dead transitions.
// Phase 1: matrix 286 rows 102 cols
[2025-06-07 17:53:56] [INFO ] Computed 26 invariants in 5 ms
[2025-06-07 17:53:56] [INFO ] State equation strengthened by 54 read => feed constraints.
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 23/23 constraints. Problems are: Problem set: 16 solved, 224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 1/24 constraints. Problems are: Problem set: 16 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/24 constraints. Problems are: Problem set: 16 solved, 224 unsolved
At refinement iteration 3 (OVERLAPS) 2/101 variables, 2/26 constraints. Problems are: Problem set: 16 solved, 224 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/26 constraints. Problems are: Problem set: 16 solved, 224 unsolved
At refinement iteration 5 (OVERLAPS) 286/387 variables, 101/127 constraints. Problems are: Problem set: 16 solved, 224 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 54/181 constraints. Problems are: Problem set: 16 solved, 224 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 0/181 constraints. Problems are: Problem set: 16 solved, 224 unsolved
At refinement iteration 8 (OVERLAPS) 1/388 variables, 1/182 constraints. Problems are: Problem set: 16 solved, 224 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/388 variables, 0/182 constraints. Problems are: Problem set: 16 solved, 224 unsolved
At refinement iteration 10 (OVERLAPS) 0/388 variables, 0/182 constraints. Problems are: Problem set: 16 solved, 224 unsolved
No progress, stopping.
After SMT solving in domain Real declared 388/388 variables, and 182 constraints, problems are : Problem set: 16 solved, 224 unsolved in 8805 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 102/102 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 16 solved, 224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 23/23 constraints. Problems are: Problem set: 16 solved, 224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 1/24 constraints. Problems are: Problem set: 16 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/24 constraints. Problems are: Problem set: 16 solved, 224 unsolved
At refinement iteration 3 (OVERLAPS) 2/101 variables, 2/26 constraints. Problems are: Problem set: 16 solved, 224 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/26 constraints. Problems are: Problem set: 16 solved, 224 unsolved
At refinement iteration 5 (OVERLAPS) 286/387 variables, 101/127 constraints. Problems are: Problem set: 16 solved, 224 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 54/181 constraints. Problems are: Problem set: 16 solved, 224 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 218/399 constraints. Problems are: Problem set: 16 solved, 224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 387/388 variables, and 399 constraints, problems are : Problem set: 16 solved, 224 unsolved in 20014 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 101/102 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 218/240 constraints, Known Traps: 0/0 constraints]
After SMT, in 29338ms problems are : Problem set: 16 solved, 224 unsolved
Search for dead transitions found 16 dead transitions in 29353ms
Found 16 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 16 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 16 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 102/125 places, 270/287 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 102 transition count 269
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 101 transition count 269
Applied a total of 2 rules in 16 ms. Remains 101 /102 variables (removed 1) and now considering 269/270 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 29424 ms. Remains : 101/125 places, 269/287 transitions.
// Phase 1: matrix 269 rows 101 cols
[2025-06-07 17:54:26] [INFO ] Computed 26 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[5] Max Struct:[6]
RANDOM walk for 1000000 steps (3986 resets) in 1292 ms. (773 steps per ms)
FORMULA CopsAndRobbers-PT-HRL023X006-UpperBounds-05 6 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2137 resets) in 788 ms. (1267 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-07 17:54:28] [INFO ] Flatten gal took : 52 ms
[2025-06-07 17:54:28] [INFO ] Flatten gal took : 20 ms
[2025-06-07 17:54:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12169842821043925558.gal : 13 ms
[2025-06-07 17:54:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4769492521691793469.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12169842821043925558.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4769492521691793469.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
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 34198 ms.

BK_STOP 1749318868630

--------------------
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="CopsAndRobbers-PT-HRL023X006"
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 CopsAndRobbers-PT-HRL023X006, 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 r265-tall-174931349700029"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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