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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 8.9K Mar 7 16:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Mar 7 16:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 7 16:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 71K Mar 7 16:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.1K Mar 15 11:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 33K Mar 15 11:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Mar 15 11:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 23K Mar 15 11:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K Mar 7 16:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Mar 7 16:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 19K Mar 7 16:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Mar 7 16:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K 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 905K 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-S16C4-UpperBounds-00
FORMULA_NAME LeafsetExtension-PT-S16C4-UpperBounds-01
FORMULA_NAME LeafsetExtension-PT-S16C4-UpperBounds-02
FORMULA_NAME LeafsetExtension-PT-S16C4-UpperBounds-03
FORMULA_NAME LeafsetExtension-PT-S16C4-UpperBounds-04
FORMULA_NAME LeafsetExtension-PT-S16C4-UpperBounds-05
FORMULA_NAME LeafsetExtension-PT-S16C4-UpperBounds-06
FORMULA_NAME LeafsetExtension-PT-S16C4-UpperBounds-07
FORMULA_NAME LeafsetExtension-PT-S16C4-UpperBounds-08
FORMULA_NAME LeafsetExtension-PT-S16C4-UpperBounds-09
FORMULA_NAME LeafsetExtension-PT-S16C4-UpperBounds-10
FORMULA_NAME LeafsetExtension-PT-S16C4-UpperBounds-11
FORMULA_NAME LeafsetExtension-PT-S16C4-UpperBounds-12
FORMULA_NAME LeafsetExtension-PT-S16C4-UpperBounds-13
FORMULA_NAME LeafsetExtension-PT-S16C4-UpperBounds-14
FORMULA_NAME LeafsetExtension-PT-S16C4-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779921103322

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LeafsetExtension-PT-S16C4
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-27 22:31:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-27 22:31:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-27 22:31:45] [INFO ] Load time of PNML (sax parser for PT used): 251 ms
[2026-05-27 22:31:45] [INFO ] Transformed 1542 places.
[2026-05-27 22:31:45] [INFO ] Transformed 1449 transitions.
[2026-05-27 22:31:45] [INFO ] Parsed PT model containing 1542 places and 1449 transitions and 4668 arcs in 470 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13733438343560980563.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6112437446684225953.kers'
[2026-05-27 22:31:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13733438343560980563.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6112437446684225953.kers]
Culling duplicate invariants (modulo rational): removing 20 columns.
Culled 20 columns in 1 ms.
// Phase 1: matrix 1449 rows 1522 cols 4036 entries
Finished phase 1 with 879 SingleSign rule and 570 generalized
[2026-05-27 22:31:46] [INFO ] Computed 93 invariants in 14 ms
Computed 93 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-6112437446684225953.kers
Total runtime 18 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, 11, 1, 1, 11, 1, 1, 1, 1, 1, 17, 1, 1, 1, 1]
RANDOM walk for 10000 steps (298 resets) in 91 ms. (108 steps per ms)
FORMULA LeafsetExtension-PT-S16C4-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S16C4-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S16C4-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S16C4-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S16C4-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S16C4-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S16C4-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S16C4-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S16C4-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S16C4-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S16C4-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S16C4-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S16C4-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 30003 steps (87 resets) in 83 ms. (357 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 2, 1] Max Struct:[11, 11, 17]
[2026-05-27 22:31:46] [INFO ] Invariant cache hit.
[2026-05-27 22:31:47] [INFO ] [Real]Absence check using 36 positive place invariants in 71 ms returned sat
[2026-05-27 22:31:47] [INFO ] [Real]Absence check using 36 positive and 57 generalized place invariants in 63 ms returned sat
[2026-05-27 22:31:48] [INFO ] [Real]Absence check using state equation in 1238 ms returned sat
[2026-05-27 22:31:49] [INFO ] Computed and/alt/rep : 1430/2224/1430 causal constraints (skipped 2 transitions) in 184 ms.
[2026-05-27 22:31:49] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 22:31:50] [INFO ] [Nat]Absence check using 36 positive place invariants in 62 ms returned sat
[2026-05-27 22:31:50] [INFO ] [Nat]Absence check using 36 positive and 57 generalized place invariants in 49 ms returned sat
[2026-05-27 22:31:51] [INFO ] [Nat]Absence check using state equation in 1209 ms returned sat
[2026-05-27 22:31:51] [INFO ] Computed and/alt/rep : 1430/2224/1430 causal constraints (skipped 2 transitions) in 167 ms.
[2026-05-27 22:31:52] [INFO ] Added : 18 causal constraints over 5 iterations in 1184 ms. Result :sat
Minimization took 587 ms.
[2026-05-27 22:31:53] [INFO ] [Real]Absence check using 36 positive place invariants in 62 ms returned sat
[2026-05-27 22:31:54] [INFO ] [Real]Absence check using 36 positive and 57 generalized place invariants in 52 ms returned sat
[2026-05-27 22:31:54] [INFO ] [Real]Absence check using state equation in 976 ms returned sat
[2026-05-27 22:31:55] [INFO ] Computed and/alt/rep : 1430/2224/1430 causal constraints (skipped 2 transitions) in 139 ms.
[2026-05-27 22:31:55] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 22:31:56] [INFO ] [Nat]Absence check using 36 positive place invariants in 58 ms returned sat
[2026-05-27 22:31:56] [INFO ] [Nat]Absence check using 36 positive and 57 generalized place invariants in 50 ms returned sat
[2026-05-27 22:31:57] [INFO ] [Nat]Absence check using state equation in 1067 ms returned sat
[2026-05-27 22:31:57] [INFO ] Computed and/alt/rep : 1430/2224/1430 causal constraints (skipped 2 transitions) in 156 ms.
[2026-05-27 22:31:58] [INFO ] Added : 20 causal constraints over 5 iterations in 1077 ms. Result :sat
Minimization took 584 ms.
[2026-05-27 22:31:59] [INFO ] [Real]Absence check using 36 positive place invariants in 54 ms returned sat
[2026-05-27 22:31:59] [INFO ] [Real]Absence check using 36 positive and 57 generalized place invariants in 3 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[2, 2, 1] Max Struct:[11, 11, 1]
FORMULA LeafsetExtension-PT-S16C4-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 2] Max Struct:[11, 11]
Support contains 2 out of 1542 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1542/1542 places, 1449/1449 transitions.
Graph (complete) has 2953 edges and 1542 vertex of which 75 are kept as prefixes of interest. Removing 1467 places using SCC suffix rule.8 ms
Discarding 1467 places :
Also discarding 1028 output transitions
Drop transitions (Output transitions of discarded places.) removed 1028 transitions
Drop transitions (Empty/Sink Transition effects.) removed 296 transitions
Reduce isomorphic transitions removed 296 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
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 314 rules applied. Total rules applied 315 place count 73 transition count 109
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 332 place count 56 transition count 109
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 332 place count 56 transition count 108
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 334 place count 55 transition count 108
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 341 place count 48 transition count 101
Iterating global reduction 2 with 7 rules applied. Total rules applied 348 place count 48 transition count 101
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 2 with 4 rules applied. Total rules applied 352 place count 46 transition count 99
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 354 place count 46 transition count 97
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 356 place count 44 transition count 97
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 363 place count 44 transition count 97
Applied a total of 363 rules in 124 ms. Remains 44 /1542 variables (removed 1498) and now considering 97/1449 (removed 1352) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 140 ms. Remains : 44/1542 places, 97/1449 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16649990918867555105.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17013571831681934981.kers'
[2026-05-27 22:31:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16649990918867555105.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17013571831681934981.kers]
Normalized transition count is 50 out of 97 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 50 rows 43 cols 130 entries
Finished phase 1 with 38 SingleSign rule and 3 generalized
[2026-05-27 22:31:59] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17013571831681934981.kers
Total runtime 1 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[2, 2] Max Struct:[11, 11]
RANDOM walk for 1000000 steps (78676 resets) in 1551 ms. (644 steps per ms)
BEST_FIRST walk for 2000001 steps (23464 resets) in 984 ms. (2030 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 4] Max Struct:[11, 11]
[2026-05-27 22:32:02] [INFO ] Flow matrix only has 50 transitions (discarded 47 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10627927859944291548.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17841695638508546678.kers'
[2026-05-27 22:32:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10627927859944291548.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17841695638508546678.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 50 rows 43 cols 130 entries
Finished phase 1 with 38 SingleSign rule and 3 generalized
[2026-05-27 22:32:02] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17841695638508546678.kers
Total runtime 1 ms.
[2026-05-27 22:32:02] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 2 ms returned sat
[2026-05-27 22:32:02] [INFO ] [Real]Absence check using state equation in 21 ms returned unsat
[2026-05-27 22:32:02] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 2 ms returned sat
[2026-05-27 22:32:02] [INFO ] [Real]Absence check using state equation in 21 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[4, 4] Max Struct:[4, 4]
FORMULA LeafsetExtension-PT-S16C4-UpperBounds-05 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LeafsetExtension-PT-S16C4-UpperBounds-02 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 16980 ms.

BK_STOP 1779921122392

--------------------
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="LeafsetExtension-PT-S16C4"
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 LeafsetExtension-PT-S16C4, 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 r162-smll-177961107900493"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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