Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r031-smll-177946790600044.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool gold2025
Input is BlocksWorld-PT-08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r031-smll-177946790600044
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 7.0K Mar 5 16:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Mar 5 16:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Mar 5 16:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K Mar 5 16:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 15 07:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 07:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 15 07:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 07:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Mar 5 16:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Mar 5 16:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Mar 5 16:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Mar 5 16:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 15 07:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 07:27 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 1.9M 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 BlocksWorld-PT-08-UpperBounds-00
FORMULA_NAME BlocksWorld-PT-08-UpperBounds-01
FORMULA_NAME BlocksWorld-PT-08-UpperBounds-02
FORMULA_NAME BlocksWorld-PT-08-UpperBounds-03
FORMULA_NAME BlocksWorld-PT-08-UpperBounds-04
FORMULA_NAME BlocksWorld-PT-08-UpperBounds-05
FORMULA_NAME BlocksWorld-PT-08-UpperBounds-06
FORMULA_NAME BlocksWorld-PT-08-UpperBounds-07
FORMULA_NAME BlocksWorld-PT-08-UpperBounds-08
FORMULA_NAME BlocksWorld-PT-08-UpperBounds-09
FORMULA_NAME BlocksWorld-PT-08-UpperBounds-10
FORMULA_NAME BlocksWorld-PT-08-UpperBounds-11
FORMULA_NAME BlocksWorld-PT-08-UpperBounds-12
FORMULA_NAME BlocksWorld-PT-08-UpperBounds-13
FORMULA_NAME BlocksWorld-PT-08-UpperBounds-14
FORMULA_NAME BlocksWorld-PT-08-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779472782648

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BlocksWorld-PT-08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-22 17:59:45] [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-22 17:59:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 17:59:46] [INFO ] Load time of PNML (sax parser for PT used): 650 ms
[2026-05-22 17:59:46] [INFO ] Transformed 1979 places.
[2026-05-22 17:59:46] [INFO ] Transformed 3785 transitions.
[2026-05-22 17:59:46] [INFO ] Found NUPN structural information;
[2026-05-22 17:59:46] [INFO ] Completing missing partition info from NUPN : creating a component with [pred_on_table_0, pred_arm_empty_0, pred_on_table_1, pred_on_table_2, pred_on_table_3, pred_on_table_4, pred_on_table_5, pred_on_table_6, pred_on_table_7, pred_on_table_8, pred_on_table_9, pred_on_table_10, pred_on_table_11, pred_on_table_12, pred_on_table_13, pred_on_table_14, pred_on_table_15, pred_on_table_16, pred_on_table_17, pred_on_table_18, pred_on_table_19, pred_on_table_20, pred_on_table_21, pred_on_table_22, pred_on_table_23, pred_on_table_24, pred_on_table_25, pred_on_table_26, pred_on_table_27, pred_on_table_28, pred_on_table_29, pred_on_table_30, pred_on_table_31, pred_on_table_32, pred_on_table_33, pred_on_table_34, pred_on_table_35, pred_on_table_36, pred_on_table_37, pred_on_table_38, pred_on_table_39, pred_on_table_40, pred_on_table_41, pred_on_table_42]
[2026-05-22 17:59:46] [INFO ] Parsed PT model containing 1979 places and 3785 transitions and 18910 arcs in 970 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 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, 0, 0, 0, 0, 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 3785 rows 1979 cols
[2026-05-22 17:59:46] [INFO ] Computed 87 invariants in 119 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 (2 resets) in 915 ms. (10 steps per ms)
FORMULA BlocksWorld-PT-08-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BlocksWorld-PT-08-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BlocksWorld-PT-08-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BlocksWorld-PT-08-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BlocksWorld-PT-08-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BlocksWorld-PT-08-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BlocksWorld-PT-08-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BlocksWorld-PT-08-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BlocksWorld-PT-08-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BlocksWorld-PT-08-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BlocksWorld-PT-08-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50003 steps (10 resets) in 444 ms. (112 steps per ms)
FORMULA BlocksWorld-PT-08-UpperBounds-14 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-22 17:59:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-22 17:59:49] [INFO ] [Real]Absence check using 87 positive place invariants in 150 ms returned sat
[2026-05-22 17:59:52] [INFO ] [Real]Absence check using state equation in 3245 ms returned sat
[2026-05-22 17:59:52] [INFO ] State equation strengthened by 75 read => feed constraints.
[2026-05-22 17:59:52] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-22 17:59:52] [INFO ] [Real]Added 75 Read/Feed constraints in 335 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-22 17:59:53] [INFO ] [Real]Absence check using 87 positive place invariants in 119 ms returned sat
[2026-05-22 17:59:55] [INFO ] [Real]Absence check using state equation in 2281 ms returned sat
[2026-05-22 17:59:56] [INFO ] [Real]Added 75 Read/Feed constraints in 362 ms returned sat
[2026-05-22 17:59: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-22 17:59:57] [INFO ] [Nat]Absence check using 87 positive place invariants in 76 ms returned sat
[2026-05-22 18:00:00] [INFO ] [Nat]Absence check using state equation in 2996 ms returned sat
[2026-05-22 18:00:00] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-22 18:00:00] [INFO ] [Nat]Added 75 Read/Feed constraints in 577 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 18:00:02] [INFO ] Deduced a trap composed of 296 places in 1064 ms of which 195 ms to minimize.
[2026-05-22 18:00:02] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:871)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-22 18:00:02] [INFO ] [Real]Absence check using 87 positive place invariants in 93 ms returned sat
[2026-05-22 18:00:04] [INFO ] [Real]Absence check using state equation in 2096 ms returned sat
[2026-05-22 18:00:05] [INFO ] [Real]Added 75 Read/Feed constraints in 226 ms returned sat
[2026-05-22 18:00:05] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-22 18:00:05] [INFO ] [Nat]Absence check using 87 positive place invariants in 98 ms returned sat
[2026-05-22 18:00:07] [INFO ] [Nat]Absence check using state equation in 2105 ms returned sat
[2026-05-22 18:00:08] [INFO ] [Nat]Added 75 Read/Feed constraints in 328 ms returned sat
[2026-05-22 18:00:09] [INFO ] Computed and/alt/rep : 258/258/258 causal constraints (skipped 3521 transitions) in 1189 ms.
[2026-05-22 18:00:10] [INFO ] Added : 0 causal constraints over 0 iterations in 1750 ms. Result :sat
Minimization took 247 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-22 18:00:10] [INFO ] [Real]Absence check using 87 positive place invariants in 126 ms returned sat
[2026-05-22 18:00:14] [INFO ] [Real]Absence check using state equation in 3381 ms returned sat
[2026-05-22 18:00:14] [INFO ] [Real]Added 75 Read/Feed constraints in 159 ms returned sat
[2026-05-22 18:00:14] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-22 18:00:15] [INFO ] [Nat]Absence check using 87 positive place invariants in 121 ms returned sat
[2026-05-22 18:00:17] [INFO ] [Nat]Absence check using state equation in 2295 ms returned sat
[2026-05-22 18:00:18] [INFO ] [Nat]Added 75 Read/Feed constraints in 483 ms returned sat
[2026-05-22 18:00:19] [INFO ] Computed and/alt/rep : 258/258/258 causal constraints (skipped 3521 transitions) in 753 ms.
[2026-05-22 18:00:19] [INFO ] Added : 0 causal constraints over 0 iterations in 1126 ms. Result :sat
Minimization took 320 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 1979 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1979/1979 places, 3785/3785 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1979 transition count 3784
Applied a total of 1 rules in 19842 ms. Remains 1979 /1979 variables (removed 0) and now considering 3784/3785 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19863 ms. Remains : 1979/1979 places, 3784/3785 transitions.
// Phase 1: matrix 3784 rows 1979 cols
[2026-05-22 18:00:40] [INFO ] Computed 87 invariants in 52 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
RANDOM walk for 536430 steps (1 resets) in 30001 ms. (17 steps per ms)
FORMULA BlocksWorld-PT-08-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BlocksWorld-PT-08-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BlocksWorld-PT-08-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BlocksWorld-PT-08-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 635246 steps (1 resets) in 5001 ms. (126 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 5 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-22 18:01:16] [INFO ] Flatten gal took : 706 ms
[2026-05-22 18:01:16] [INFO ] Flatten gal took : 210 ms
[2026-05-22 18:01:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6384259285812758875.gal : 141 ms
[2026-05-22 18:01:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6366122571975443726.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6384259285812758875.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6366122571975443726.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.ensureOpen(BufferedInputStream.java:206)
at java.base/java.io.BufferedInputStream.implRead(BufferedInputStream.java:411)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:405)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:350)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:393)
at java.base/sun.nio.cs.StreamDecoder.lockedRead(StreamDecoder.java:217)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:171)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:188)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:160)
at java.base/java.io.BufferedReader.implReadLine(BufferedReader.java:370)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:347)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:436)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:1583)
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 91517 ms.

BK_STOP 1779472876737

--------------------
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="BlocksWorld-PT-08"
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 BlocksWorld-PT-08, 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 r031-smll-177946790600044"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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