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.r511-tall-167912735700119.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 gold2022
Input is UtahNoC-PT-none, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r511-tall-167912735700119
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 632K
-rw-r--r-- 1 mcc users 5.9K Feb 26 04:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 04:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 04:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 04:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 17:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K Feb 26 04:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Feb 26 04:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 04:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Feb 26 04:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 205K Mar 5 18:23 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 UtahNoC-PT-none-UpperBounds-00
FORMULA_NAME UtahNoC-PT-none-UpperBounds-01
FORMULA_NAME UtahNoC-PT-none-UpperBounds-02
FORMULA_NAME UtahNoC-PT-none-UpperBounds-03
FORMULA_NAME UtahNoC-PT-none-UpperBounds-04
FORMULA_NAME UtahNoC-PT-none-UpperBounds-05
FORMULA_NAME UtahNoC-PT-none-UpperBounds-06
FORMULA_NAME UtahNoC-PT-none-UpperBounds-07
FORMULA_NAME UtahNoC-PT-none-UpperBounds-08
FORMULA_NAME UtahNoC-PT-none-UpperBounds-09
FORMULA_NAME UtahNoC-PT-none-UpperBounds-10
FORMULA_NAME UtahNoC-PT-none-UpperBounds-11
FORMULA_NAME UtahNoC-PT-none-UpperBounds-12
FORMULA_NAME UtahNoC-PT-none-UpperBounds-13
FORMULA_NAME UtahNoC-PT-none-UpperBounds-14
FORMULA_NAME UtahNoC-PT-none-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679323546325

Running Version 202205111006
[2023-03-20 14:45:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-20 14:45:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 14:45:47] [INFO ] Load time of PNML (sax parser for PT used): 110 ms
[2023-03-20 14:45:47] [INFO ] Transformed 216 places.
[2023-03-20 14:45:47] [INFO ] Transformed 977 transitions.
[2023-03-20 14:45:47] [INFO ] Found NUPN structural information;
[2023-03-20 14:45:47] [INFO ] Parsed PT model containing 216 places and 977 transitions in 213 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Ensure Unique test removed 148 transitions
Reduce redundant transitions removed 148 transitions.
Normalized transition count is 427 out of 829 initially.
// Phase 1: matrix 427 rows 216 cols
[2023-03-20 14:45:47] [INFO ] Computed 8 place invariants in 23 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 16) seen :10
FORMULA UtahNoC-PT-none-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA UtahNoC-PT-none-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA UtahNoC-PT-none-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA UtahNoC-PT-none-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA UtahNoC-PT-none-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA UtahNoC-PT-none-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA UtahNoC-PT-none-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA UtahNoC-PT-none-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA UtahNoC-PT-none-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA UtahNoC-PT-none-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 6) seen :1
FORMULA UtahNoC-PT-none-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 5) seen :0
[2023-03-20 14:45:47] [INFO ] Flow matrix only has 427 transitions (discarded 402 similar events)
// Phase 1: matrix 427 rows 216 cols
[2023-03-20 14:45:47] [INFO ] Computed 8 place invariants in 4 ms
[2023-03-20 14:45:48] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-20 14:45:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 14:45:48] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2023-03-20 14:45:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 14:45:48] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-20 14:45:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 14:45:48] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2023-03-20 14:45:48] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-20 14:45:48] [INFO ] [Nat]Added 43 Read/Feed constraints in 12 ms returned sat
[2023-03-20 14:45:48] [INFO ] Computed and/alt/rep : 374/1166/374 causal constraints (skipped 52 transitions) in 36 ms.
[2023-03-20 14:45:49] [INFO ] Added : 239 causal constraints over 49 iterations in 1463 ms. Result :sat
Minimization took 108 ms.
[2023-03-20 14:45:50] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-20 14:45:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 14:45:50] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2023-03-20 14:45:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 14:45:50] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-20 14:45:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 14:45:50] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2023-03-20 14:45:50] [INFO ] [Nat]Added 43 Read/Feed constraints in 7 ms returned sat
[2023-03-20 14:45:50] [INFO ] Computed and/alt/rep : 374/1166/374 causal constraints (skipped 52 transitions) in 32 ms.
[2023-03-20 14:45:51] [INFO ] Added : 277 causal constraints over 59 iterations in 1604 ms. Result :sat
Minimization took 125 ms.
[2023-03-20 14:45:52] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-20 14:45:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 14:45:52] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2023-03-20 14:45:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 14:45:52] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-20 14:45:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 14:45:52] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2023-03-20 14:45:52] [INFO ] [Nat]Added 43 Read/Feed constraints in 7 ms returned sat
[2023-03-20 14:45:52] [INFO ] Computed and/alt/rep : 374/1166/374 causal constraints (skipped 52 transitions) in 32 ms.
[2023-03-20 14:45:54] [INFO ] Added : 323 causal constraints over 65 iterations in 1944 ms. Result :sat
Minimization took 145 ms.
[2023-03-20 14:45:54] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-20 14:45:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 14:45:54] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2023-03-20 14:45:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 14:45:54] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-20 14:45:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 14:45:54] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2023-03-20 14:45:54] [INFO ] [Nat]Added 43 Read/Feed constraints in 7 ms returned sat
[2023-03-20 14:45:54] [INFO ] Computed and/alt/rep : 374/1166/374 causal constraints (skipped 52 transitions) in 31 ms.
[2023-03-20 14:45:55] [INFO ] Added : 177 causal constraints over 39 iterations in 1040 ms. Result :sat
Minimization took 78 ms.
[2023-03-20 14:45:55] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-20 14:45:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 14:45:55] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2023-03-20 14:45:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 14:45:55] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2023-03-20 14:45:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 14:45:56] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2023-03-20 14:45:56] [INFO ] [Nat]Added 43 Read/Feed constraints in 8 ms returned sat
[2023-03-20 14:45:56] [INFO ] Computed and/alt/rep : 374/1166/374 causal constraints (skipped 52 transitions) in 27 ms.
[2023-03-20 14:45:57] [INFO ] Added : 219 causal constraints over 44 iterations in 1215 ms. Result :sat
Minimization took 95 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
FORMULA UtahNoC-PT-none-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA UtahNoC-PT-none-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA UtahNoC-PT-none-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA UtahNoC-PT-none-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 216 places. Attempting structural reductions.
Drop transitions removed 4 transitions
Starting structural reductions in SAFETY mode, iteration 0 : 216/216 places, 825/825 transitions.
Graph (trivial) has 357 edges and 216 vertex of which 93 / 216 are part of one of the 14 SCC in 4 ms
Free SCC test removed 79 places
Drop transitions removed 252 transitions
Ensure Unique test removed 78 transitions
Reduce isomorphic transitions removed 330 transitions.
Reduce places removed 1 places and 4 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 136 transition count 491
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 37 place count 101 transition count 357
Iterating global reduction 1 with 35 rules applied. Total rules applied 72 place count 101 transition count 357
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 120 place count 101 transition count 309
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 129 place count 92 transition count 289
Iterating global reduction 2 with 9 rules applied. Total rules applied 138 place count 92 transition count 289
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 150 place count 92 transition count 277
Performed 4 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 158 place count 88 transition count 270
Drop transitions removed 9 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 15 rules applied. Total rules applied 173 place count 88 transition count 255
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 178 place count 85 transition count 253
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 192 place count 78 transition count 274
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 193 place count 78 transition count 273
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 194 place count 78 transition count 272
Free-agglomeration rule applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 196 place count 78 transition count 270
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 200 place count 76 transition count 268
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 202 place count 76 transition count 266
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 206 place count 76 transition count 266
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 207 place count 76 transition count 265
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 208 place count 75 transition count 264
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 73 edges and 73 vertex of which 16 / 73 are part of one of the 3 SCC in 1 ms
Free SCC test removed 13 places
Iterating post reduction 8 with 3 rules applied. Total rules applied 211 place count 60 transition count 264
Drop transitions removed 23 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 53 transitions.
Iterating post reduction 9 with 53 rules applied. Total rules applied 264 place count 60 transition count 211
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 267 place count 57 transition count 199
Iterating global reduction 10 with 3 rules applied. Total rules applied 270 place count 57 transition count 199
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 10 with 6 rules applied. Total rules applied 276 place count 54 transition count 205
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 280 place count 54 transition count 201
Free-agglomeration rule applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 281 place count 54 transition count 200
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 283 place count 53 transition count 199
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 284 place count 53 transition count 198
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 285 place count 52 transition count 197
Applied a total of 285 rules in 130 ms. Remains 52 /216 variables (removed 164) and now considering 197/825 (removed 628) transitions.
Finished structural reductions, in 1 iterations. Remains : 52/216 places, 197/825 transitions.
Normalized transition count is 116 out of 197 initially.
// Phase 1: matrix 116 rows 52 cols
[2023-03-20 14:45:57] [INFO ] Computed 6 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1244 ms. (steps per millisecond=803 ) properties (out of 1) seen :1
FORMULA UtahNoC-PT-none-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 11724 ms.

BK_STOP 1679323559282

--------------------
content from stderr:

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="UtahNoC-PT-none"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
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 gold2022"
echo " Input is UtahNoC-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 r511-tall-167912735700119"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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