fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r143-smll-177955812400040
Last Updated
Jun 17, 2026

About the Execution of 2025-gold for FlexibleBarrier-PT-04b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
327.207 11012.00 21106.00 113.60 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 normal

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.r143-smll-177955812400040.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 FlexibleBarrier-PT-04b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r143-smll-177955812400040
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 7.3K Mar 7 05:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Mar 7 05:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Mar 7 05:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Mar 7 05:26 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 15 10:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 10:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 10:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 10:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 7 05:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Mar 7 05:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Mar 7 05:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Mar 7 05:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 10:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 10:10 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 69K 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 FlexibleBarrier-PT-04b-UpperBounds-00
FORMULA_NAME FlexibleBarrier-PT-04b-UpperBounds-01
FORMULA_NAME FlexibleBarrier-PT-04b-UpperBounds-02
FORMULA_NAME FlexibleBarrier-PT-04b-UpperBounds-03
FORMULA_NAME FlexibleBarrier-PT-04b-UpperBounds-04
FORMULA_NAME FlexibleBarrier-PT-04b-UpperBounds-05
FORMULA_NAME FlexibleBarrier-PT-04b-UpperBounds-06
FORMULA_NAME FlexibleBarrier-PT-04b-UpperBounds-07
FORMULA_NAME FlexibleBarrier-PT-04b-UpperBounds-08
FORMULA_NAME FlexibleBarrier-PT-04b-UpperBounds-09
FORMULA_NAME FlexibleBarrier-PT-04b-UpperBounds-10
FORMULA_NAME FlexibleBarrier-PT-04b-UpperBounds-11
FORMULA_NAME FlexibleBarrier-PT-04b-UpperBounds-12
FORMULA_NAME FlexibleBarrier-PT-04b-UpperBounds-13
FORMULA_NAME FlexibleBarrier-PT-04b-UpperBounds-14
FORMULA_NAME FlexibleBarrier-PT-04b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779626569230

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-04b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-24 12:42:51] [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-24 12:42:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 12:42:52] [INFO ] Load time of PNML (sax parser for PT used): 173 ms
[2026-05-24 12:42:52] [INFO ] Transformed 268 places.
[2026-05-24 12:42:52] [INFO ] Transformed 305 transitions.
[2026-05-24 12:42:52] [INFO ] Found NUPN structural information;
[2026-05-24 12:42:52] [INFO ] Parsed PT model containing 268 places and 305 transitions and 743 arcs in 402 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 15 ms.
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 305 rows 268 cols
[2026-05-24 12:42:52] [INFO ] Computed 6 invariants in 37 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 (245 resets) in 77 ms. (128 steps per ms)
FORMULA FlexibleBarrier-PT-04b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-04b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-04b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-04b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-04b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-04b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-04b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-04b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-04b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-04b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-04b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-04b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-04b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-04b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-04b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 20002 steps (83 resets) in 52 ms. (377 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-24 12:42:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:42:53] [INFO ] [Real]Absence check using 6 positive place invariants in 21 ms returned sat
[2026-05-24 12:42:53] [INFO ] [Real]Absence check using state equation in 336 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:42:53] [INFO ] Deduced a trap composed of 38 places in 422 ms of which 58 ms to minimize.
[2026-05-24 12:42:53] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:42:54] [INFO ] [Nat]Absence check using 6 positive place invariants in 13 ms returned sat
[2026-05-24 12:42:54] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:42:54] [INFO ] Deduced a trap composed of 32 places in 173 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:42:54] [INFO ] Deduced a trap composed of 38 places in 163 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:42:54] [INFO ] Deduced a trap composed of 75 places in 178 ms of which 40 ms to minimize.
[2026-05-24 12:42:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 599 ms
[2026-05-24 12:42:54] [INFO ] Computed and/alt/rep : 287/559/287 causal constraints (skipped 17 transitions) in 55 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:42:57] [INFO ] Deduced a trap composed of 77 places in 376 ms of which 79 ms to minimize.
[2026-05-24 12:42:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 460 ms
[2026-05-24 12:42:57] [INFO ] Added : 264 causal constraints over 53 iterations in 2840 ms. Result :sat
Minimization took 356 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 268 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p185) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 268/268 places, 304/304 transitions.
Graph (trivial) has 253 edges and 268 vertex of which 26 / 268 are part of one of the 4 SCC in 5 ms
Free SCC test removed 22 places
Drop transitions (Empty/Sink Transition effects.) removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 78 rules applied. Total rules applied 79 place count 245 transition count 199
Reduce places removed 78 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 79 rules applied. Total rules applied 158 place count 167 transition count 197
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 159 place count 166 transition count 197
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 159 place count 166 transition count 185
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 183 place count 154 transition count 185
Discarding 68 places :
Symmetric choice reduction at 3 with 68 rule applications. Total rules 251 place count 86 transition count 117
Iterating global reduction 3 with 68 rules applied. Total rules applied 319 place count 86 transition count 117
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 319 place count 86 transition count 112
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 329 place count 81 transition count 112
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 332 place count 81 transition count 109
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 341 place count 72 transition count 100
Iterating global reduction 4 with 9 rules applied. Total rules applied 350 place count 72 transition count 100
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 359 place count 72 transition count 91
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 397 place count 53 transition count 72
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 402 place count 53 transition count 67
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 405 place count 50 transition count 64
Iterating global reduction 6 with 3 rules applied. Total rules applied 408 place count 50 transition count 64
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 410 place count 49 transition count 81
Free-agglomeration rule applied 22 times.
Iterating global reduction 6 with 22 rules applied. Total rules applied 432 place count 49 transition count 59
Reduce places removed 22 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 90 edges and 27 vertex of which 9 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.1 ms
Discarding 18 places :
Also discarding 0 output transitions
Iterating post reduction 6 with 32 rules applied. Total rules applied 464 place count 9 transition count 50
Drop transitions (Empty/Sink Transition effects.) removed 39 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 7 with 42 rules applied. Total rules applied 506 place count 9 transition count 8
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 507 place count 9 transition count 8
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 508 place count 8 transition count 7
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t2.t3.t4.t263.t84.t85.t298.t79 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 4 edges and 5 vertex of which 2 / 5 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 4 rules applied. Total rules applied 512 place count 4 transition count 4
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 515 place count 3 transition count 2
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 515 place count 3 transition count 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 517 place count 2 transition count 1
Applied a total of 517 rules in 176 ms. Remains 2 /268 variables (removed 266) and now considering 1/304 (removed 303) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 194 ms. Remains : 2/268 places, 1/304 transitions.
// Phase 1: matrix 1 rows 2 cols
[2026-05-24 12:42:58] [INFO ] Computed 1 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (500000 resets) in 512 ms. (1949 steps per ms)
FORMULA FlexibleBarrier-PT-04b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (500000 resets) in 314 ms. (3174 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-24 12:43:00] [INFO ] Flatten gal took : 316 ms
[2026-05-24 12:43:00] [INFO ] Flatten gal took : 1 ms
[2026-05-24 12:43:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13928787917499411115.gal : 6 ms
[2026-05-24 12:43:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17591434053221672046.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/ReachabilityCardinality13928787917499411115.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17591434053221672046.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 8508 ms.

BK_STOP 1779626580242

--------------------
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="FlexibleBarrier-PT-04b"
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 FlexibleBarrier-PT-04b, 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 r143-smll-177955812400040"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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