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.r207-tall-177969919700068.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 Parking-PT-832, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r207-tall-177969919700068
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 644K
-rw-r--r-- 1 mcc users 6.2K Mar 8 08:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Mar 8 08:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Mar 8 08:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 8 08:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Mar 16 08:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 16 08:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 16 08:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 16 08:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Mar 8 08:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Mar 8 08:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Mar 8 08:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Mar 8 08:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 16 08:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 16 08:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 251K 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 Parking-PT-832-UpperBounds-00
FORMULA_NAME Parking-PT-832-UpperBounds-01
FORMULA_NAME Parking-PT-832-UpperBounds-02
FORMULA_NAME Parking-PT-832-UpperBounds-03
FORMULA_NAME Parking-PT-832-UpperBounds-04
FORMULA_NAME Parking-PT-832-UpperBounds-05
FORMULA_NAME Parking-PT-832-UpperBounds-06
FORMULA_NAME Parking-PT-832-UpperBounds-07
FORMULA_NAME Parking-PT-832-UpperBounds-08
FORMULA_NAME Parking-PT-832-UpperBounds-09
FORMULA_NAME Parking-PT-832-UpperBounds-10
FORMULA_NAME Parking-PT-832-UpperBounds-11
FORMULA_NAME Parking-PT-832-UpperBounds-12
FORMULA_NAME Parking-PT-832-UpperBounds-13
FORMULA_NAME Parking-PT-832-UpperBounds-14
FORMULA_NAME Parking-PT-832-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779719625940

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Parking-PT-832
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-25 14:33:47] [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-25 14:33:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 14:33:47] [INFO ] Load time of PNML (sax parser for PT used): 110 ms
[2026-05-25 14:33:47] [INFO ] Transformed 737 places.
[2026-05-25 14:33:47] [INFO ] Transformed 993 transitions.
[2026-05-25 14:33:47] [INFO ] Found NUPN structural information;
[2026-05-25 14:33:47] [INFO ] Parsed PT model containing 737 places and 993 transitions and 2993 arcs in 214 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Ensure Unique test removed 384 transitions
Reduce redundant transitions removed 384 transitions.
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 609 rows 737 cols
[2026-05-25 14:33:47] [INFO ] Computed 184 invariants in 31 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (49 resets) in 120 ms. (82 steps per ms)
FORMULA Parking-PT-832-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Parking-PT-832-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Parking-PT-832-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Parking-PT-832-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Parking-PT-832-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Parking-PT-832-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Parking-PT-832-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Parking-PT-832-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Parking-PT-832-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Parking-PT-832-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Parking-PT-832-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Parking-PT-832-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Parking-PT-832-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 30003 steps (6 resets) in 90 ms. (329 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2026-05-25 14:33:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 14:33:48] [INFO ] [Real]Absence check using 176 positive place invariants in 57 ms returned sat
[2026-05-25 14:33:48] [INFO ] [Real]Absence check using 176 positive and 8 generalized place invariants in 4 ms returned sat
[2026-05-25 14:33:48] [INFO ] [Real]Absence check using state equation in 205 ms returned sat
[2026-05-25 14:33:48] [INFO ] State equation strengthened by 152 read => feed constraints.
[2026-05-25 14:33:48] [INFO ] [Real]Added 152 Read/Feed constraints in 202 ms returned sat
[2026-05-25 14:33:48] [INFO ] Computed and/alt/rep : 608/1920/608 causal constraints (skipped 0 transitions) in 84 ms.
[2026-05-25 14:33:48] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 14:33:49] [INFO ] [Nat]Absence check using 176 positive place invariants in 112 ms returned sat
[2026-05-25 14:33:49] [INFO ] [Nat]Absence check using 176 positive and 8 generalized place invariants in 2 ms returned sat
[2026-05-25 14:33:49] [INFO ] [Nat]Absence check using state equation in 188 ms returned sat
[2026-05-25 14:33:49] [INFO ] [Nat]Added 152 Read/Feed constraints in 158 ms returned sat
[2026-05-25 14:33:49] [INFO ] Computed and/alt/rep : 608/1920/608 causal constraints (skipped 0 transitions) in 29 ms.
[2026-05-25 14:33:53] [INFO ] Added : 291 causal constraints over 59 iterations in 3369 ms. Result :sat
Minimization took 231 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 14:33:53] [INFO ] [Real]Absence check using 176 positive place invariants in 40 ms returned sat
[2026-05-25 14:33:53] [INFO ] [Real]Absence check using 176 positive and 8 generalized place invariants in 17 ms returned sat
[2026-05-25 14:33:53] [INFO ] [Real]Absence check using state equation in 211 ms returned sat
[2026-05-25 14:33:54] [INFO ] [Real]Added 152 Read/Feed constraints in 437 ms returned sat
[2026-05-25 14:33:54] [INFO ] Computed and/alt/rep : 608/1920/608 causal constraints (skipped 0 transitions) in 41 ms.
[2026-05-25 14:33:54] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 14:33:54] [INFO ] [Nat]Absence check using 176 positive place invariants in 44 ms returned sat
[2026-05-25 14:33:54] [INFO ] [Nat]Absence check using 176 positive and 8 generalized place invariants in 3 ms returned sat
[2026-05-25 14:33:54] [INFO ] [Nat]Absence check using state equation in 190 ms returned sat
[2026-05-25 14:33:55] [INFO ] [Nat]Added 152 Read/Feed constraints in 218 ms returned sat
[2026-05-25 14:33:55] [INFO ] Computed and/alt/rep : 608/1920/608 causal constraints (skipped 0 transitions) in 45 ms.
[2026-05-25 14:33:59] [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.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1140)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:878)
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-25 14:33:59] [INFO ] [Real]Absence check using 176 positive place invariants in 43 ms returned sat
[2026-05-25 14:33:59] [INFO ] [Real]Absence check using 176 positive and 8 generalized place invariants in 3 ms returned sat
[2026-05-25 14:33:59] [INFO ] [Real]Absence check using state equation in 192 ms returned sat
[2026-05-25 14:34:00] [INFO ] [Real]Added 152 Read/Feed constraints in 157 ms returned sat
[2026-05-25 14:34:00] [INFO ] Computed and/alt/rep : 608/1920/608 causal constraints (skipped 0 transitions) in 30 ms.
[2026-05-25 14:34: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-25 14:34:00] [INFO ] [Nat]Absence check using 176 positive place invariants in 43 ms returned sat
[2026-05-25 14:34:00] [INFO ] [Nat]Absence check using 176 positive and 8 generalized place invariants in 3 ms returned sat
[2026-05-25 14:34:00] [INFO ] [Nat]Absence check using state equation in 188 ms returned sat
[2026-05-25 14:34:00] [INFO ] [Nat]Added 152 Read/Feed constraints in 142 ms returned sat
[2026-05-25 14:34:00] [INFO ] Computed and/alt/rep : 608/1920/608 causal constraints (skipped 0 transitions) in 28 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:34:03] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 6 ms to minimize.
[2026-05-25 14:34:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 162 ms
[2026-05-25 14:34:03] [INFO ] Added : 253 causal constraints over 51 iterations in 2811 ms. Result :sat
Minimization took 207 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 737 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 737/737 places, 609/609 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 16 place count 737 transition count 593
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 721 transition count 593
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 32 place count 721 transition count 577
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 64 place count 705 transition count 577
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 72 place count 697 transition count 569
Iterating global reduction 2 with 8 rules applied. Total rules applied 80 place count 697 transition count 569
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 128 place count 673 transition count 545
Free-agglomeration rule applied 128 times.
Iterating global reduction 2 with 128 rules applied. Total rules applied 256 place count 673 transition count 417
Reduce places removed 128 places and 0 transitions.
Graph (complete) has 1104 edges and 545 vertex of which 149 are kept as prefixes of interest. Removing 396 places using SCC suffix rule.1 ms
Discarding 396 places :
Also discarding 288 output transitions
Drop transitions (Output transitions of discarded places.) removed 288 transitions
Iterating post reduction 2 with 129 rules applied. Total rules applied 385 place count 149 transition count 129
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 409 place count 149 transition count 105
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 410 place count 148 transition count 104
Reduce places removed 44 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 4 with 99 rules applied. Total rules applied 509 place count 104 transition count 49
Reduce places removed 55 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 5 with 67 rules applied. Total rules applied 576 place count 49 transition count 37
Reduce places removed 8 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 6 with 10 rules applied. Total rules applied 586 place count 41 transition count 35
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 588 place count 39 transition count 35
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 10 Pre rules applied. Total rules applied 588 place count 39 transition count 25
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 8 with 20 rules applied. Total rules applied 608 place count 29 transition count 25
Applied a total of 608 rules in 243 ms. Remains 29 /737 variables (removed 708) and now considering 25/609 (removed 584) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 250 ms. Remains : 29/737 places, 25/609 transitions.
// Phase 1: matrix 25 rows 29 cols
[2026-05-25 14:34:04] [INFO ] Computed 14 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 982 ms. (1017 steps per ms)
FORMULA Parking-PT-832-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Parking-PT-832-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Parking-PT-832-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 352 ms. (2832 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-25 14:34:05] [INFO ] Flatten gal took : 23 ms
[2026-05-25 14:34:05] [INFO ] Flatten gal took : 9 ms
[2026-05-25 14:34:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9879146160023673651.gal : 4 ms
[2026-05-25 14:34:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17528899600354614714.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/ReachabilityCardinality9879146160023673651.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17528899600354614714.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 18706 ms.

BK_STOP 1779719646063

--------------------
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="Parking-PT-832"
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 Parking-PT-832, 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 r207-tall-177969919700068"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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