Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r224-tall-171649612600365.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool itstools
Input is LeafsetExtension-PT-S32C2, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r224-tall-171649612600365
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.9M
-rw-r--r-- 1 mcc users 15K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.4K Apr 22 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Apr 22 14:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K Apr 12 13:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Apr 12 13:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 12 13:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 12 13:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Apr 22 14:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 3.4M May 18 16:42 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 LeafsetExtension-PT-S32C2-UpperBounds-00
FORMULA_NAME LeafsetExtension-PT-S32C2-UpperBounds-01
FORMULA_NAME LeafsetExtension-PT-S32C2-UpperBounds-02
FORMULA_NAME LeafsetExtension-PT-S32C2-UpperBounds-03
FORMULA_NAME LeafsetExtension-PT-S32C2-UpperBounds-04
FORMULA_NAME LeafsetExtension-PT-S32C2-UpperBounds-05
FORMULA_NAME LeafsetExtension-PT-S32C2-UpperBounds-06
FORMULA_NAME LeafsetExtension-PT-S32C2-UpperBounds-07
FORMULA_NAME LeafsetExtension-PT-S32C2-UpperBounds-08
FORMULA_NAME LeafsetExtension-PT-S32C2-UpperBounds-09
FORMULA_NAME LeafsetExtension-PT-S32C2-UpperBounds-10
FORMULA_NAME LeafsetExtension-PT-S32C2-UpperBounds-11
FORMULA_NAME LeafsetExtension-PT-S32C2-UpperBounds-12
FORMULA_NAME LeafsetExtension-PT-S32C2-UpperBounds-13
FORMULA_NAME LeafsetExtension-PT-S32C2-UpperBounds-14
FORMULA_NAME LeafsetExtension-PT-S32C2-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716582148232

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-S32C2
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-24 20:22:29] [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]
[2024-05-24 20:22:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 20:22:29] [INFO ] Load time of PNML (sax parser for PT used): 277 ms
[2024-05-24 20:22:29] [INFO ] Transformed 5622 places.
[2024-05-24 20:22:29] [INFO ] Transformed 5449 transitions.
[2024-05-24 20:22:29] [INFO ] Parsed PT model containing 5622 places and 5449 transitions and 17500 arcs in 406 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 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]
// Phase 1: matrix 5449 rows 5622 cols
[2024-05-24 20:22:30] [INFO ] Computed 173 invariants in 391 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, +inf, 1, 1, 1, 1, +inf, +inf, 1, 1, 1, 1, 1, 1, 1, +inf]
RANDOM walk for 10000 steps (547 resets) in 88 ms. (112 steps per ms)
FORMULA LeafsetExtension-PT-S32C2-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S32C2-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S32C2-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S32C2-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S32C2-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S32C2-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S32C2-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S32C2-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S32C2-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70006 steps (316 resets) in 127 ms. (546 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0, 0, 1, 1, 0, 0] Max Struct:[+inf, 1, 1, +inf, +inf, 1, +inf]
[2024-05-24 20:22:30] [INFO ] Invariant cache hit.
[2024-05-24 20:22:31] [INFO ] [Real]Absence check using 35 positive place invariants in 113 ms returned sat
[2024-05-24 20:22:31] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 243 ms returned sat
[2024-05-24 20:22:33] [INFO ] [Real]Absence check using state equation in 2336 ms returned sat
[2024-05-24 20:22:34] [INFO ] Computed and/alt/rep : 5346/7458/5346 causal constraints (skipped 70 transitions) in 284 ms.
[2024-05-24 20:22:35] [INFO ] Added : 6 causal constraints over 2 iterations in 1198 ms. Result :unknown
[2024-05-24 20:22:36] [INFO ] [Real]Absence check using 35 positive place invariants in 77 ms returned sat
[2024-05-24 20:22:36] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 150 ms returned sat
[2024-05-24 20:22:38] [INFO ] [Real]Absence check using state equation in 2310 ms returned sat
[2024-05-24 20:22:39] [INFO ] Computed and/alt/rep : 5346/7458/5346 causal constraints (skipped 70 transitions) in 258 ms.
[2024-05-24 20:22:39] [INFO ] Added : 7 causal constraints over 2 iterations in 1099 ms. Result :sat
Minimization took 321 ms.
[2024-05-24 20:22:41] [INFO ] [Real]Absence check using 35 positive place invariants in 81 ms returned sat
[2024-05-24 20:22:41] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 145 ms returned sat
[2024-05-24 20:22:43] [INFO ] [Real]Absence check using state equation in 2519 ms returned sat
[2024-05-24 20:22:44] [INFO ] Computed and/alt/rep : 5346/7458/5346 causal constraints (skipped 70 transitions) in 242 ms.
[2024-05-24 20:22:45] [INFO ] Added : 7 causal constraints over 2 iterations in 1049 ms. Result :sat
Minimization took 165 ms.
[2024-05-24 20:22:46] [INFO ] [Real]Absence check using 35 positive place invariants in 73 ms returned sat
[2024-05-24 20:22:46] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 66 ms returned unsat
[2024-05-24 20:22:46] [INFO ] [Real]Absence check using 35 positive place invariants in 80 ms returned sat
[2024-05-24 20:22:46] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 161 ms returned unsat
[2024-05-24 20:22:47] [INFO ] [Real]Absence check using 35 positive place invariants in 65 ms returned sat
[2024-05-24 20:22:47] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 136 ms returned sat
[2024-05-24 20:22:49] [INFO ] [Real]Absence check using state equation in 2336 ms returned sat
[2024-05-24 20:22:50] [INFO ] Computed and/alt/rep : 5346/7458/5346 causal constraints (skipped 70 transitions) in 234 ms.
[2024-05-24 20:22:51] [INFO ] Added : 6 causal constraints over 2 iterations in 1058 ms. Result :sat
Minimization took 413 ms.
[2024-05-24 20:22:52] [INFO ] [Real]Absence check using 35 positive place invariants in 71 ms returned sat
[2024-05-24 20:22:52] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 146 ms returned sat
[2024-05-24 20:22:54] [INFO ] [Real]Absence check using state equation in 2228 ms returned sat
[2024-05-24 20:22:55] [INFO ] Computed and/alt/rep : 5346/7458/5346 causal constraints (skipped 70 transitions) in 252 ms.
[2024-05-24 20:22:56] [INFO ] Added : 7 causal constraints over 2 iterations in 1083 ms. Result :sat
Minimization took 448 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0, 0, 1, 1, 0, 0] Max Struct:[+inf, 1, 1, 1, 1, 1, +inf]
FORMULA LeafsetExtension-PT-S32C2-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C2-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 1, +inf]
Support contains 5 out of 5622 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5622/5622 places, 5449/5449 transitions.
Graph (complete) has 11001 edges and 5622 vertex of which 285 are kept as prefixes of interest. Removing 5337 places using SCC suffix rule.10 ms
Discarding 5337 places :
Also discarding 3085 output transitions
Drop transitions (Output transitions of discarded places.) removed 3085 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1099 transitions
Reduce isomorphic transitions removed 1099 transitions.
Discarding 16 places :
Implicit places reduction removed 16 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 1178 rules applied. Total rules applied 1179 place count 269 transition count 1202
Reduce places removed 65 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 69 rules applied. Total rules applied 1248 place count 204 transition count 1198
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 1252 place count 200 transition count 1198
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 1252 place count 200 transition count 1176
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 1296 place count 178 transition count 1176
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 1311 place count 163 transition count 1161
Iterating global reduction 3 with 15 rules applied. Total rules applied 1326 place count 163 transition count 1161
Free-agglomeration rule (complex) applied 17 times.
Iterating global reduction 3 with 17 rules applied. Total rules applied 1343 place count 163 transition count 1144
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 3 with 17 rules applied. Total rules applied 1360 place count 146 transition count 1144
Partial Free-agglomeration rule applied 60 times.
Drop transitions (Partial Free agglomeration) removed 60 transitions
Iterating global reduction 4 with 60 rules applied. Total rules applied 1420 place count 146 transition count 1144
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 4 with 4 rules applied. Total rules applied 1424 place count 142 transition count 1144
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 1427 place count 142 transition count 1141
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1430 place count 139 transition count 1141
Applied a total of 1430 rules in 204 ms. Remains 139 /5622 variables (removed 5483) and now considering 1141/5449 (removed 4308) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 213 ms. Remains : 139/5622 places, 1141/5449 transitions.
[2024-05-24 20:22:57] [INFO ] Flow matrix only has 198 transitions (discarded 943 similar events)
When looking for a positive semi flow solution, solver replied unsat
[2024-05-24 20:22:57] [INFO ] Flow matrix only has 198 transitions (discarded 943 similar events)
// Phase 1: matrix 198 rows 139 cols
[2024-05-24 20:22:57] [INFO ] Computed 2 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 1, +inf]
RANDOM walk for 1000000 steps (190985 resets) in 3555 ms. (281 steps per ms)
FORMULA LeafsetExtension-PT-S32C2-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S32C2-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S32C2-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 2000002 steps (17192 resets) in 1475 ms. (1355 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 1] Max Struct:[+inf, +inf]
[2024-05-24 20:23:02] [INFO ] Flow matrix only has 198 transitions (discarded 943 similar events)
[2024-05-24 20:23:02] [INFO ] Invariant cache hit.
[2024-05-24 20:23:02] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-24 20:23:02] [INFO ] [Real]Absence check using state equation in 27 ms returned unsat
[2024-05-24 20:23:02] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-24 20:23:02] [INFO ] [Real]Absence check using state equation in 35 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[2, 1] Max Struct:[2, 1]
FORMULA LeafsetExtension-PT-S32C2-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C2-UpperBounds-01 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided 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 )
[2024-05-24 20:23:02] [INFO ] Flatten gal took : 99 ms
[2024-05-24 20:23:02] [INFO ] Flatten gal took : 53 ms
[2024-05-24 20:23:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13316091967214887698.gal : 25 ms
[2024-05-24 20:23:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8189490507270775786.prop : 1 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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13316091967214887698.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8189490507270775786.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
its-reach command run as :
ITS tools runner thread asked to quit. Dying gracefully.

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:168)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:334)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:270)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:313)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:188)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:177)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:162)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:329)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:396)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:840)
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 33665 ms.

BK_STOP 1716582182982

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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-S32C2"
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-5568"
echo " Executing tool itstools"
echo " Input is LeafsetExtension-PT-S32C2, 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 r224-tall-171649612600365"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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