fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r194-tall-177969914000357
Last Updated
Jun 17, 2026

About the Execution of ITS-Tools for NoC3x3-PT-7A

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
462.731 12358.00 19890.00 233.30 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.r194-tall-177969914000357.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 itstools
Input is NoC3x3-PT-7A, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r194-tall-177969914000357
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 768K
-rw-r--r-- 1 mcc users 6.9K Mar 8 06:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Mar 8 06:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Mar 8 06:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Mar 8 06:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Mar 16 08:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 16 08:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 16 08:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 16 08:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 8 06:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Mar 8 06:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Mar 8 06:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K Mar 8 06:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 16 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 16 08:16 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 355K 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 NoC3x3-PT-7A-UpperBounds-00
FORMULA_NAME NoC3x3-PT-7A-UpperBounds-01
FORMULA_NAME NoC3x3-PT-7A-UpperBounds-02
FORMULA_NAME NoC3x3-PT-7A-UpperBounds-03
FORMULA_NAME NoC3x3-PT-7A-UpperBounds-04
FORMULA_NAME NoC3x3-PT-7A-UpperBounds-05
FORMULA_NAME NoC3x3-PT-7A-UpperBounds-06
FORMULA_NAME NoC3x3-PT-7A-UpperBounds-07
FORMULA_NAME NoC3x3-PT-7A-UpperBounds-08
FORMULA_NAME NoC3x3-PT-7A-UpperBounds-09
FORMULA_NAME NoC3x3-PT-7A-UpperBounds-10
FORMULA_NAME NoC3x3-PT-7A-UpperBounds-11
FORMULA_NAME NoC3x3-PT-7A-UpperBounds-12
FORMULA_NAME NoC3x3-PT-7A-UpperBounds-13
FORMULA_NAME NoC3x3-PT-7A-UpperBounds-14
FORMULA_NAME NoC3x3-PT-7A-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779763607280

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-7A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-26 02:46:48] [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-26 02:46:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 02:46:48] [INFO ] Load time of PNML (sax parser for PT used): 114 ms
[2026-05-26 02:46:48] [INFO ] Transformed 801 places.
[2026-05-26 02:46:48] [INFO ] Transformed 1544 transitions.
[2026-05-26 02:46:48] [INFO ] Found NUPN structural information;
[2026-05-26 02:46:48] [INFO ] Parsed PT model containing 801 places and 1544 transitions and 4519 arcs in 218 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Ensure Unique test removed 107 transitions
Reduce redundant transitions removed 107 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]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4136968827541704958.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4209957706696959161.kers'
[2026-05-26 02:46:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4136968827541704958.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4209957706696959161.kers]
Normalized transition count is 1355 out of 1437 initially.
Culling duplicate invariants (modulo rational): removing 9 columns.
Culled 9 columns in 0 ms.
// Phase 1: matrix 1355 rows 792 cols 3892 entries
Finished phase 1 with 550 SingleSign rule and 140 generalized
[2026-05-26 02:46:48] [INFO ] Computed 111 invariants in 6 ms
Computed 111 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-4209957706696959161.kers
Total runtime 9 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 87 ms. (113 steps per ms)
FORMULA NoC3x3-PT-7A-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-7A-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-7A-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-7A-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-7A-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-7A-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-7A-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-7A-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-7A-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-7A-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-7A-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-7A-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-7A-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-7A-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-7A-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 10001 steps (2 resets) in 17 ms. (555 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-26 02:46:48] [INFO ] Flow matrix only has 1355 transitions (discarded 82 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15861147052292616424.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6148904073304979755.kers'
[2026-05-26 02:46:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15861147052292616424.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6148904073304979755.kers]
Culling duplicate invariants (modulo rational): removing 9 columns.
Culled 9 columns in 4 ms.
// Phase 1: matrix 1355 rows 792 cols 3892 entries
Finished phase 1 with 550 SingleSign rule and 140 generalized
[2026-05-26 02:46:48] [INFO ] Computed 111 invariants in 9 ms
Computed 111 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-6148904073304979755.kers
Total runtime 13 ms.
[2026-05-26 02:46:49] [INFO ] [Real]Absence check using 72 positive place invariants in 31 ms returned sat
[2026-05-26 02:46:49] [INFO ] [Real]Absence check using 72 positive and 39 generalized place invariants in 9 ms returned sat
[2026-05-26 02:46:49] [INFO ] [Real]Absence check using state equation in 328 ms returned sat
[2026-05-26 02:46:49] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-26 02:46:49] [INFO ] [Real]Added 38 Read/Feed constraints in 11 ms returned sat
[2026-05-26 02:46:49] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 02:46:49] [INFO ] [Nat]Absence check using 72 positive place invariants in 30 ms returned sat
[2026-05-26 02:46:49] [INFO ] [Nat]Absence check using 72 positive and 39 generalized place invariants in 18 ms returned sat
[2026-05-26 02:46:50] [INFO ] [Nat]Absence check using state equation in 329 ms returned sat
[2026-05-26 02:46:50] [INFO ] [Nat]Added 38 Read/Feed constraints in 11 ms returned sat
[2026-05-26 02:46:50] [INFO ] Computed and/alt/rep : 1239/4104/1238 causal constraints (skipped 116 transitions) in 72 ms.
Maximisation of solution failed !
Minimization took 3 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 801 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p522) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 801/801 places, 1436/1436 transitions.
Graph (trivial) has 753 edges and 801 vertex of which 110 / 801 are part of one of the 9 SCC in 11 ms
Free SCC test removed 101 places
Drop transitions (Empty/Sink Transition effects.) removed 204 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 222 transitions.
Discarding 179 places :
Symmetric choice reduction at 0 with 179 rule applications. Total rules 180 place count 521 transition count 951
Ensure Unique test removed 45 places
Iterating global reduction 0 with 224 rules applied. Total rules applied 404 place count 476 transition count 951
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 76 rules applied. Total rules applied 480 place count 476 transition count 875
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 494 place count 462 transition count 875
Performed 139 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 139 places in 1 ms
Reduce places removed 139 places and 0 transitions.
Iterating global reduction 2 with 278 rules applied. Total rules applied 772 place count 323 transition count 712
Ensure Unique test removed 84 transitions
Reduce isomorphic transitions removed 84 transitions.
Iterating post reduction 2 with 84 rules applied. Total rules applied 856 place count 323 transition count 628
Performed 15 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 886 place count 308 transition count 607
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 897 place count 308 transition count 596
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 925 place count 294 transition count 604
Drop transitions (Redundant composition of simpler transitions.) removed 100 transitions
Redundant transition composition rules discarded 100 transitions
Iterating global reduction 4 with 100 rules applied. Total rules applied 1025 place count 294 transition count 504
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 1034 place count 285 transition count 504
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 1034 place count 285 transition count 497
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 1048 place count 278 transition count 497
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1052 place count 276 transition count 495
Free-agglomeration rule applied 41 times with reduction of 25 identical transitions.
Iterating global reduction 5 with 41 rules applied. Total rules applied 1093 place count 276 transition count 429
Reduce places removed 41 places and 0 transitions.
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 5 with 71 rules applied. Total rules applied 1164 place count 235 transition count 399
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 6 with 7 rules applied. Total rules applied 1171 place count 235 transition count 392
Free-agglomeration rule applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1173 place count 235 transition count 390
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1177 place count 233 transition count 388
Free-agglomeration rule (complex) applied 16 times with reduction of 2 identical transitions.
Iterating global reduction 7 with 16 rules applied. Total rules applied 1193 place count 233 transition count 427
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 23 rules applied. Total rules applied 1216 place count 217 transition count 420
Drop transitions (Redundant composition of simpler transitions.) removed 34 transitions
Redundant transition composition rules discarded 34 transitions
Iterating global reduction 8 with 34 rules applied. Total rules applied 1250 place count 217 transition count 386
Partial Free-agglomeration rule applied 36 times.
Drop transitions (Partial Free agglomeration) removed 36 transitions
Iterating global reduction 8 with 36 rules applied. Total rules applied 1286 place count 217 transition count 386
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1287 place count 216 transition count 385
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 1290 place count 213 transition count 385
Applied a total of 1290 rules in 270 ms. Remains 213 /801 variables (removed 588) and now considering 385/1436 (removed 1051) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 278 ms. Remains : 213/801 places, 385/1436 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18228734627005534201.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11443034307998693241.kers'
[2026-05-26 02:46:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18228734627005534201.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11443034307998693241.kers]
Culling duplicate invariants (modulo rational): removing 20 columns.
Culled 20 columns in 0 ms.
// Phase 1: matrix 385 rows 193 cols 1168 entries
Finished phase 1 with 159 SingleSign rule and 0 generalized
[2026-05-26 02:46:55] [INFO ] Computed 54 invariants in 1 ms
Computed 54 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11443034307998693241.kers
Total runtime 2 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (2 resets) in 3586 ms. (278 steps per ms)
FORMULA NoC3x3-PT-7A-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 913 ms. (1094 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 11197 ms.

BK_STOP 1779763619638

--------------------
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.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /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="NoC3x3-PT-7A"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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 itstools"
echo " Input is NoC3x3-PT-7A, 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 r194-tall-177969914000357"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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