Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r240-tall-174915589200101.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is Szymanski-PT-a06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r240-tall-174915589200101
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 688K
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 243K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 101K May 29 14:33 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 Szymanski-PT-a06-UpperBounds-00
FORMULA_NAME Szymanski-PT-a06-UpperBounds-01
FORMULA_NAME Szymanski-PT-a06-UpperBounds-02
FORMULA_NAME Szymanski-PT-a06-UpperBounds-03
FORMULA_NAME Szymanski-PT-a06-UpperBounds-04
FORMULA_NAME Szymanski-PT-a06-UpperBounds-05
FORMULA_NAME Szymanski-PT-a06-UpperBounds-06
FORMULA_NAME Szymanski-PT-a06-UpperBounds-07
FORMULA_NAME Szymanski-PT-a06-UpperBounds-08
FORMULA_NAME Szymanski-PT-a06-UpperBounds-09
FORMULA_NAME Szymanski-PT-a06-UpperBounds-10
FORMULA_NAME Szymanski-PT-a06-UpperBounds-11
FORMULA_NAME Szymanski-PT-a06-UpperBounds-12
FORMULA_NAME Szymanski-PT-a06-UpperBounds-13
FORMULA_NAME Szymanski-PT-a06-UpperBounds-14
FORMULA_NAME Szymanski-PT-a06-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1749170579361

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Szymanski-PT-a06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2025-06-06 00:43:00] [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]
[2025-06-06 00:43:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 00:43:01] [INFO ] Load time of PNML (sax parser for PT used): 83 ms
[2025-06-06 00:43:01] [INFO ] Transformed 61 places.
[2025-06-06 00:43:01] [INFO ] Transformed 224 transitions.
[2025-06-06 00:43:01] [INFO ] Parsed PT model containing 61 places and 224 transitions and 900 arcs in 200 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 8 transitions.
FORMULA Szymanski-PT-a06-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-a06-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-a06-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 6] Max Struct:[+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, 6] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-06 00:43:01] [INFO ] Flow matrix only has 79 transitions (discarded 137 similar events)
// Phase 1: matrix 79 rows 49 cols
[2025-06-06 00:43:01] [INFO ] Computed 3 invariants in 10 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 6] Max Struct:[1, 13, 13, 13, 6, 1, 13, 1, 13, 1, 13, 13, 6]
FORMULA Szymanski-PT-a06-UpperBounds-15 6 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (11 resets) in 30 ms. (322 steps per ms)
FORMULA Szymanski-PT-a06-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Szymanski-PT-a06-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Szymanski-PT-a06-UpperBounds-05 6 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Szymanski-PT-a06-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Szymanski-PT-a06-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70007 steps (19 resets) in 97 ms. (714 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5, 6, 6, 6, 6, 6, 6] Max Struct:[13, 13, 13, 13, 13, 13, 13]
[2025-06-06 00:43:01] [INFO ] Flow matrix only has 79 transitions (discarded 137 similar events)
[2025-06-06 00:43:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 00:43:01] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2025-06-06 00:43:01] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 3 ms returned sat
[2025-06-06 00:43:01] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2025-06-06 00:43:01] [INFO ] State equation strengthened by 9 read => feed constraints.
[2025-06-06 00:43:01] [INFO ] [Real]Added 9 Read/Feed constraints in 7 ms returned sat
[2025-06-06 00:43:01] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 00:43:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-06 00:43:01] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-06 00:43:01] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2025-06-06 00:43:01] [INFO ] [Nat]Added 9 Read/Feed constraints in 9 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:43:01] [INFO ] Deduced a trap composed of 6 places in 76 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:43:01] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:43:01] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 3 ms to minimize.
[2025-06-06 00:43:01] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 228 ms
[2025-06-06 00:43:01] [INFO ] Computed and/alt/rep : 21/107/21 causal constraints (skipped 56 transitions) in 17 ms.
[2025-06-06 00:43:01] [INFO ] Added : 13 causal constraints over 3 iterations in 70 ms. Result :sat
Minimization took 19 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 00:43:01] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-06 00:43:01] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-06 00:43:01] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-06 00:43:01] [INFO ] [Real]Added 9 Read/Feed constraints in 4 ms returned sat
[2025-06-06 00:43:01] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 00:43:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-06 00:43:02] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-06 00:43:02] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2025-06-06 00:43:02] [INFO ] [Nat]Added 9 Read/Feed constraints in 1 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:43:02] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 4 ms to minimize.
[2025-06-06 00:43:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 57 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 00:43:02] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-06 00:43:02] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-06 00:43:02] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-06-06 00:43:02] [INFO ] [Real]Added 9 Read/Feed constraints in 1 ms returned sat
[2025-06-06 00:43:02] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 00:43:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-06 00:43:02] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-06 00:43:02] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2025-06-06 00:43:02] [INFO ] [Nat]Added 9 Read/Feed constraints in 2 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:43:02] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 3 ms to minimize.
[2025-06-06 00:43:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 53 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 00:43:02] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-06 00:43:02] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-06 00:43:02] [INFO ] [Real]Absence check using state equation in 17 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 00:43:02] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-06 00:43:02] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-06 00:43:02] [INFO ] [Real]Absence check using state equation in 17 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 00:43:02] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-06 00:43:02] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-06 00:43:02] [INFO ] [Real]Absence check using state equation in 17 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 00:43:02] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-06 00:43:02] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-06 00:43:02] [INFO ] [Real]Absence check using state equation in 16 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[5, 6, 6, 6, 6, 6, 6] Max Struct:[13, 6, 6, 6, 6, 6, 6]
FORMULA Szymanski-PT-a06-UpperBounds-14 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Szymanski-PT-a06-UpperBounds-13 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Szymanski-PT-a06-UpperBounds-10 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Szymanski-PT-a06-UpperBounds-07 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Szymanski-PT-a06-UpperBounds-04 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Szymanski-PT-a06-UpperBounds-03 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5] Max Struct:[13]
Support contains 1 out of 49 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 216/216 transitions.
Graph (complete) has 251 edges and 49 vertex of which 47 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 47 transition count 212
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 9 place count 43 transition count 196
Iterating global reduction 1 with 4 rules applied. Total rules applied 13 place count 43 transition count 196
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 1 with 16 rules applied. Total rules applied 29 place count 43 transition count 180
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 31 place count 41 transition count 172
Iterating global reduction 1 with 2 rules applied. Total rules applied 33 place count 41 transition count 172
Applied a total of 33 rules in 36 ms. Remains 41 /49 variables (removed 8) and now considering 172/216 (removed 44) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 41/49 places, 172/216 transitions.
[2025-06-06 00:43:02] [INFO ] Flow matrix only has 65 transitions (discarded 107 similar events)
// Phase 1: matrix 65 rows 41 cols
[2025-06-06 00:43:02] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[5] Max Struct:[6]
RANDOM walk for 1000001 steps (2 resets) in 631 ms. (1582 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 432 ms. (2309 steps per ms)
FORMULA Szymanski-PT-a06-UpperBounds-02 6 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2025-06-06 00:43:03] [INFO ] Flatten gal took : 42 ms
[2025-06-06 00:43:03] [INFO ] Flatten gal took : 14 ms
[2025-06-06 00:43:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality275993590825328322.gal : 10 ms
[2025-06-06 00:43:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2808893582542146911.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/ReachabilityCardinality275993590825328322.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2808893582542146911.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 3124 ms.

BK_STOP 1749170583953

--------------------
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="Szymanski-PT-a06"
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-5832"
echo " Executing tool itstools"
echo " Input is Szymanski-PT-a06, 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 r240-tall-174915589200101"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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