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.r175-smll-177961111800064.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 LeafsetExtension-PT-S32C3, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r175-smll-177961111800064
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.9M
-rw-r--r-- 1 mcc users 13K Mar 7 16:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Mar 7 16:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 7 16:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Mar 7 16:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.5K Mar 15 11:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 11:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Mar 15 11:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 11:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Mar 7 16:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Mar 7 16:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 18K Mar 7 16:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Mar 7 16:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 11:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Mar 15 11:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 3.4M 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 LeafsetExtension-PT-S32C3-UpperBounds-00
FORMULA_NAME LeafsetExtension-PT-S32C3-UpperBounds-01
FORMULA_NAME LeafsetExtension-PT-S32C3-UpperBounds-02
FORMULA_NAME LeafsetExtension-PT-S32C3-UpperBounds-03
FORMULA_NAME LeafsetExtension-PT-S32C3-UpperBounds-04
FORMULA_NAME LeafsetExtension-PT-S32C3-UpperBounds-05
FORMULA_NAME LeafsetExtension-PT-S32C3-UpperBounds-06
FORMULA_NAME LeafsetExtension-PT-S32C3-UpperBounds-07
FORMULA_NAME LeafsetExtension-PT-S32C3-UpperBounds-08
FORMULA_NAME LeafsetExtension-PT-S32C3-UpperBounds-09
FORMULA_NAME LeafsetExtension-PT-S32C3-UpperBounds-10
FORMULA_NAME LeafsetExtension-PT-S32C3-UpperBounds-11
FORMULA_NAME LeafsetExtension-PT-S32C3-UpperBounds-12
FORMULA_NAME LeafsetExtension-PT-S32C3-UpperBounds-13
FORMULA_NAME LeafsetExtension-PT-S32C3-UpperBounds-14
FORMULA_NAME LeafsetExtension-PT-S32C3-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779753530317

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LeafsetExtension-PT-S32C3
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-25 23:58:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 23:58:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 23:58:53] [INFO ] Load time of PNML (sax parser for PT used): 493 ms
[2026-05-25 23:58:53] [INFO ] Transformed 5622 places.
[2026-05-25 23:58:53] [INFO ] Transformed 5449 transitions.
[2026-05-25 23:58:53] [INFO ] Parsed PT model containing 5622 places and 5449 transitions and 17500 arcs in 702 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 13 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 5449 rows 5622 cols
[2026-05-25 23:58:54] [INFO ] Computed 173 invariants in 671 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, +inf, +inf, 1, 1, 1, 1, 1, +inf, +inf, 1, 33, 1, 1, 1]
RANDOM walk for 10000 steps (386 resets) in 152 ms. (65 steps per ms)
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 60005 steps (152 resets) in 148 ms. (402 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 0, 0, 1] Max Struct:[+inf, +inf, +inf, +inf, 33]
[2026-05-25 23:58:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 23:58:56] [INFO ] [Real]Absence check using 35 positive place invariants in 133 ms returned sat
[2026-05-25 23:58:56] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 229 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 23:58:57] [INFO ] [Real]Absence check using 35 positive place invariants in 111 ms returned sat
[2026-05-25 23:58:57] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 86 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 23:58:59] [INFO ] [Real]Absence check using 35 positive place invariants in 151 ms returned sat
[2026-05-25 23:58:59] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 271 ms returned sat
[2026-05-25 23:59:02] [INFO ] [Real]Absence check using state equation in 3384 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 23:59:03] [INFO ] [Real]Absence check using 35 positive place invariants in 119 ms returned sat
[2026-05-25 23:59:04] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 222 ms returned sat
[2026-05-25 23:59:07] [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 3
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.verifyPossible(DeadlockTester.java:854)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2252)
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 23:59:09] [INFO ] [Real]Absence check using 35 positive place invariants in 113 ms returned sat
[2026-05-25 23:59:09] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 195 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 0, 0, 1] Max Struct:[1, 1, +inf, +inf, 1]
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[+inf, +inf]
Support contains 2 out of 5622 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5622/5622 places, 5449/5449 transitions.
Graph (complete) has 11001 edges and 5622 vertex of which 93 are kept as prefixes of interest. Removing 5529 places using SCC suffix rule.14 ms
Discarding 5529 places :
Also discarding 3958 output transitions
Drop transitions (Output transitions of discarded places.) removed 3958 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1131 transitions
Reduce isomorphic transitions removed 1131 transitions.
Discarding 17 places :
Implicit places reduction removed 17 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 1163 rules applied. Total rules applied 1164 place count 76 transition count 345
Reduce places removed 18 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 1 with 52 rules applied. Total rules applied 1216 place count 58 transition count 311
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 1233 place count 41 transition count 311
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1233 place count 41 transition count 310
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1235 place count 40 transition count 310
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1237 place count 40 transition count 308
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1239 place count 38 transition count 308
Drop transitions (Redundant composition of simpler transitions.) removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 4 with 32 rules applied. Total rules applied 1271 place count 38 transition count 276
Free-agglomeration rule (complex) applied 17 times.
Iterating global reduction 4 with 17 rules applied. Total rules applied 1288 place count 38 transition count 259
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 4 with 17 rules applied. Total rules applied 1305 place count 21 transition count 259
Partial Free-agglomeration rule applied 15 times.
Drop transitions (Partial Free agglomeration) removed 15 transitions
Iterating global reduction 5 with 15 rules applied. Total rules applied 1320 place count 21 transition count 259
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 5 with 1 rules applied. Total rules applied 1321 place count 20 transition count 259
Applied a total of 1321 rules in 153 ms. Remains 20 /5622 variables (removed 5602) and now considering 259/5449 (removed 5190) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 169 ms. Remains : 20/5622 places, 259/5449 transitions.
[2026-05-25 23:59:09] [INFO ] Flow matrix only has 34 transitions (discarded 225 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
When looking for a positive semi flow solution, solver replied unsat
[2026-05-25 23:59:09] [INFO ] Flow matrix only has 34 transitions (discarded 225 similar events)
// Phase 1: matrix 34 rows 20 cols
[2026-05-25 23:59:09] [INFO ] Computed 1 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[+inf, +inf]
RANDOM walk for 1000000 steps (233769 resets) in 2854 ms. (350 steps per ms)
BEST_FIRST walk for 2000002 steps (29575 resets) in 1280 ms. (1561 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1] Max Struct:[+inf, +inf]
[2026-05-25 23:59:13] [INFO ] Flow matrix only has 34 transitions (discarded 225 similar events)
[2026-05-25 23:59:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 23:59:13] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-25 23:59:13] [INFO ] [Real]Absence check using state equation in 12 ms returned unsat
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 23:59:13] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-25 23:59:13] [INFO ] [Real]Absence check using state equation in 13 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1] Max Struct:[1, 1]
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided 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-25 23:59:14] [INFO ] Flatten gal took : 93 ms
[2026-05-25 23:59:14] [INFO ] Flatten gal took : 38 ms
[2026-05-25 23:59:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17787079648284610887.gal : 22 ms
[2026-05-25 23:59:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9565133857766256688.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/ReachabilityCardinality17787079648284610887.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9565133857766256688.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 21816 ms.

BK_STOP 1779753554321

--------------------
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="LeafsetExtension-PT-S32C3"
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 LeafsetExtension-PT-S32C3, 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 r175-smll-177961111800064"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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