Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r261-smll-167863535800005.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is MultiwaySync-PT-none, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r261-smll-167863535800005
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 7.4K Feb 25 22:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 25 22:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 22:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 22:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 22:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Feb 25 22:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 22:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Feb 25 22:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 111K Mar 5 18:22 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

here is the order used to build the result vector(from text file)
FORMULA_NAME MultiwaySync-PT-none-UpperBounds-00
FORMULA_NAME MultiwaySync-PT-none-UpperBounds-01
FORMULA_NAME MultiwaySync-PT-none-UpperBounds-02
FORMULA_NAME MultiwaySync-PT-none-UpperBounds-03
FORMULA_NAME MultiwaySync-PT-none-UpperBounds-04
FORMULA_NAME MultiwaySync-PT-none-UpperBounds-05
FORMULA_NAME MultiwaySync-PT-none-UpperBounds-06
FORMULA_NAME MultiwaySync-PT-none-UpperBounds-07
FORMULA_NAME MultiwaySync-PT-none-UpperBounds-08
FORMULA_NAME MultiwaySync-PT-none-UpperBounds-09
FORMULA_NAME MultiwaySync-PT-none-UpperBounds-10
FORMULA_NAME MultiwaySync-PT-none-UpperBounds-11
FORMULA_NAME MultiwaySync-PT-none-UpperBounds-12
FORMULA_NAME MultiwaySync-PT-none-UpperBounds-13
FORMULA_NAME MultiwaySync-PT-none-UpperBounds-14
FORMULA_NAME MultiwaySync-PT-none-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678689093739

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiwaySync-PT-none
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-13 06:31:36] [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]
[2023-03-13 06:31:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 06:31:36] [INFO ] Load time of PNML (sax parser for PT used): 110 ms
[2023-03-13 06:31:36] [INFO ] Transformed 222 places.
[2023-03-13 06:31:36] [INFO ] Transformed 472 transitions.
[2023-03-13 06:31:36] [INFO ] Found NUPN structural information;
[2023-03-13 06:31:36] [INFO ] Parsed PT model containing 222 places and 472 transitions and 1496 arcs in 221 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Ensure Unique test removed 83 transitions
Reduce redundant transitions removed 83 transitions.
Normalized transition count is 384 out of 389 initially.
// Phase 1: matrix 384 rows 222 cols
[2023-03-13 06:31:36] [INFO ] Computed 25 place invariants in 28 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 16) seen :13
FORMULA MultiwaySync-PT-none-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiwaySync-PT-none-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiwaySync-PT-none-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiwaySync-PT-none-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiwaySync-PT-none-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiwaySync-PT-none-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiwaySync-PT-none-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiwaySync-PT-none-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiwaySync-PT-none-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiwaySync-PT-none-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiwaySync-PT-none-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiwaySync-PT-none-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiwaySync-PT-none-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :1
FORMULA MultiwaySync-PT-none-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
[2023-03-13 06:31:36] [INFO ] Flow matrix only has 384 transitions (discarded 5 similar events)
// Phase 1: matrix 384 rows 222 cols
[2023-03-13 06:31:36] [INFO ] Computed 25 place invariants in 9 ms
[2023-03-13 06:31:37] [INFO ] [Real]Absence check using 25 positive place invariants in 16 ms returned sat
[2023-03-13 06:31:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 06:31:37] [INFO ] [Real]Absence check using state equation in 239 ms returned sat
[2023-03-13 06:31:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 06:31:37] [INFO ] [Nat]Absence check using 25 positive place invariants in 28 ms returned sat
[2023-03-13 06:31:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 06:31:37] [INFO ] [Nat]Absence check using state equation in 167 ms returned sat
[2023-03-13 06:31:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 06:31:37] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-13 06:31:37] [INFO ] Deduced a trap composed of 22 places in 109 ms of which 7 ms to minimize.
[2023-03-13 06:31:38] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 1 ms to minimize.
[2023-03-13 06:31:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 290 ms
[2023-03-13 06:31:38] [INFO ] Computed and/alt/rep : 364/1019/364 causal constraints (skipped 19 transitions) in 107 ms.
[2023-03-13 06:31:38] [INFO ] Added : 73 causal constraints over 15 iterations in 593 ms. Result :sat
Minimization took 102 ms.
[2023-03-13 06:31:38] [INFO ] [Real]Absence check using 25 positive place invariants in 21 ms returned sat
[2023-03-13 06:31:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 06:31:39] [INFO ] [Real]Absence check using state equation in 359 ms returned sat
[2023-03-13 06:31:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 06:31:39] [INFO ] [Nat]Absence check using 25 positive place invariants in 13 ms returned sat
[2023-03-13 06:31:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 06:31:39] [INFO ] [Nat]Absence check using state equation in 183 ms returned sat
[2023-03-13 06:31:39] [INFO ] [Nat]Added 1 Read/Feed constraints in 12 ms returned sat
[2023-03-13 06:31:39] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 1 ms to minimize.
[2023-03-13 06:31:39] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 0 ms to minimize.
[2023-03-13 06:31:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 181 ms
[2023-03-13 06:31:39] [INFO ] Computed and/alt/rep : 364/1019/364 causal constraints (skipped 19 transitions) in 38 ms.
[2023-03-13 06:31:40] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2023-03-13 06:31:40] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2023-03-13 06:31:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 163 ms
[2023-03-13 06:31:40] [INFO ] Added : 101 causal constraints over 21 iterations in 778 ms. Result :sat
Minimization took 71 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
FORMULA MultiwaySync-PT-none-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 222 places. Attempting structural reductions.
Drop transitions removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 222/222 places, 387/387 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 222 transition count 385
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 220 transition count 385
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 629 edges and 220 vertex of which 43 are kept as prefixes of interest. Removing 177 places using SCC suffix rule.2 ms
Discarding 177 places :
Also discarding 177 output transitions
Drop transitions removed 177 transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 8 rules applied. Total rules applied 12 place count 43 transition count 201
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 123 transitions
Reduce isomorphic transitions removed 123 transitions.
Iterating post reduction 1 with 124 rules applied. Total rules applied 136 place count 42 transition count 78
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 141 place count 37 transition count 73
Iterating global reduction 2 with 5 rules applied. Total rules applied 146 place count 37 transition count 73
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 147 place count 37 transition count 72
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 151 place count 33 transition count 60
Iterating global reduction 3 with 4 rules applied. Total rules applied 155 place count 33 transition count 60
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 157 place count 33 transition count 58
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 4 with 4 rules applied. Total rules applied 161 place count 31 transition count 56
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 169 place count 31 transition count 48
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 169 place count 31 transition count 47
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 171 place count 30 transition count 47
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 172 place count 29 transition count 46
Iterating global reduction 4 with 1 rules applied. Total rules applied 173 place count 29 transition count 46
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 173 place count 29 transition count 45
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 175 place count 28 transition count 45
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 176 place count 28 transition count 44
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 180 place count 26 transition count 42
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 181 place count 26 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 183 place count 25 transition count 40
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 184 place count 25 transition count 39
Free-agglomeration rule applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 186 place count 25 transition count 37
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 188 place count 23 transition count 37
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 189 place count 22 transition count 36
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 9 edges and 21 vertex of which 4 / 21 are part of one of the 1 SCC in 3 ms
Free SCC test removed 3 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 3 rules applied. Total rules applied 192 place count 18 transition count 35
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 198 place count 17 transition count 30
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 199 place count 16 transition count 24
Iterating global reduction 9 with 1 rules applied. Total rules applied 200 place count 16 transition count 24
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 201 place count 16 transition count 23
Free-agglomeration rule applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 202 place count 16 transition count 22
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 203 place count 15 transition count 22
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 11 with 6 rules applied. Total rules applied 209 place count 15 transition count 16
Applied a total of 209 rules in 111 ms. Remains 15 /222 variables (removed 207) and now considering 16/387 (removed 371) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111 ms. Remains : 15/222 places, 16/387 transitions.
// Phase 1: matrix 16 rows 15 cols
[2023-03-13 06:31:40] [INFO ] Computed 2 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 142749 resets, run finished after 486 ms. (steps per millisecond=2057 ) properties (out of 1) seen :1
FORMULA MultiwaySync-PT-none-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 5230 ms.

BK_STOP 1678689102501

--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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="MultiwaySync-PT-none"
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-5348"
echo " Executing tool itstools"
echo " Input is MultiwaySync-PT-none, 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 r261-smll-167863535800005"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MultiwaySync-PT-none.tgz
mv MultiwaySync-PT-none 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;