Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 7.1K May 30 14:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 30 14:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 30 14:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K May 30 14:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 25 13:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 25 13:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 25 13:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 25 13:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 29 12:20 NewModel
-rw-r--r-- 1 mcc users 14K May 30 14:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K May 30 14:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K May 30 14:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K May 30 14:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 25 13:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 25 13:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 12:20 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 12:20 instance
-rw-r--r-- 1 mcc users 6 May 29 12:20 iscolored
-rw-r--r-- 1 mcc users 71K May 29 12:20 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 StigmergyElection-PT-02b-UpperBounds-00
FORMULA_NAME StigmergyElection-PT-02b-UpperBounds-01
FORMULA_NAME StigmergyElection-PT-02b-UpperBounds-02
FORMULA_NAME StigmergyElection-PT-02b-UpperBounds-03
FORMULA_NAME StigmergyElection-PT-02b-UpperBounds-04
FORMULA_NAME StigmergyElection-PT-02b-UpperBounds-05
FORMULA_NAME StigmergyElection-PT-02b-UpperBounds-06
FORMULA_NAME StigmergyElection-PT-02b-UpperBounds-07
FORMULA_NAME StigmergyElection-PT-02b-UpperBounds-08
FORMULA_NAME StigmergyElection-PT-02b-UpperBounds-09
FORMULA_NAME StigmergyElection-PT-02b-UpperBounds-10
FORMULA_NAME StigmergyElection-PT-02b-UpperBounds-11
FORMULA_NAME StigmergyElection-PT-02b-UpperBounds-12
FORMULA_NAME StigmergyElection-PT-02b-UpperBounds-13
FORMULA_NAME StigmergyElection-PT-02b-UpperBounds-14
FORMULA_NAME StigmergyElection-PT-02b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1654840620512

Running Version 202205111006
[2022-06-10 05:57:02] [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]
[2022-06-10 05:57:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-10 05:57:02] [INFO ] Load time of PNML (sax parser for PT used): 162 ms
[2022-06-10 05:57:02] [INFO ] Transformed 291 places.
[2022-06-10 05:57:02] [INFO ] Transformed 332 transitions.
[2022-06-10 05:57:02] [INFO ] Found NUPN structural information;
[2022-06-10 05:57:02] [INFO ] Parsed PT model containing 291 places and 332 transitions in 335 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 16 ms.
// Phase 1: matrix 332 rows 291 cols
[2022-06-10 05:57:02] [INFO ] Computed 3 place invariants in 26 ms
Incomplete random walk after 10000 steps, including 168 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 16) seen :12
FORMULA StigmergyElection-PT-02b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-02b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-02b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-02b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-02b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-02b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-02b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-02b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-02b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-02b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-02b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-02b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 69 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 69 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :0
// Phase 1: matrix 332 rows 291 cols
[2022-06-10 05:57:03] [INFO ] Computed 3 place invariants in 14 ms
[2022-06-10 05:57:03] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2022-06-10 05:57:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 05:57:03] [INFO ] [Real]Absence check using state equation in 261 ms returned sat
[2022-06-10 05:57:03] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 05:57:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2022-06-10 05:57:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 05:57:04] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2022-06-10 05:57:04] [INFO ] Deduced a trap composed of 159 places in 176 ms of which 4 ms to minimize.
[2022-06-10 05:57:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 250 ms
[2022-06-10 05:57:04] [INFO ] Computed and/alt/rep : 314/434/314 causal constraints (skipped 17 transitions) in 52 ms.
[2022-06-10 05:57:05] [INFO ] Added : 219 causal constraints over 44 iterations in 1256 ms. Result :sat
Minimization took 82 ms.
[2022-06-10 05:57:05] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2022-06-10 05:57:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 05:57:06] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2022-06-10 05:57:06] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 05:57:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2022-06-10 05:57:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 05:57:06] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2022-06-10 05:57:06] [INFO ] Deduced a trap composed of 160 places in 139 ms of which 2 ms to minimize.
[2022-06-10 05:57:06] [INFO ] Deduced a trap composed of 190 places in 121 ms of which 1 ms to minimize.
[2022-06-10 05:57:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 332 ms
[2022-06-10 05:57:06] [INFO ] Computed and/alt/rep : 314/434/314 causal constraints (skipped 17 transitions) in 30 ms.
[2022-06-10 05:57:08] [INFO ] Added : 266 causal constraints over 54 iterations in 1572 ms. Result :sat
Minimization took 98 ms.
[2022-06-10 05:57:08] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2022-06-10 05:57:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 05:57:08] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2022-06-10 05:57:08] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 05:57:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2022-06-10 05:57:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 05:57:08] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2022-06-10 05:57:09] [INFO ] Deduced a trap composed of 160 places in 137 ms of which 3 ms to minimize.
[2022-06-10 05:57:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 169 ms
[2022-06-10 05:57:09] [INFO ] Computed and/alt/rep : 314/434/314 causal constraints (skipped 17 transitions) in 27 ms.
[2022-06-10 05:57:10] [INFO ] Added : 238 causal constraints over 48 iterations in 1367 ms. Result :sat
Minimization took 134 ms.
[2022-06-10 05:57:10] [INFO ] [Real]Absence check using 3 positive place invariants in 10 ms returned sat
[2022-06-10 05:57:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 05:57:10] [INFO ] [Real]Absence check using state equation in 171 ms returned sat
[2022-06-10 05:57:10] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 05:57:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2022-06-10 05:57:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 05:57:11] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2022-06-10 05:57:11] [INFO ] Computed and/alt/rep : 314/434/314 causal constraints (skipped 17 transitions) in 36 ms.
[2022-06-10 05:57:11] [INFO ] Added : 147 causal constraints over 30 iterations in 793 ms. Result :sat
Minimization took 71 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
FORMULA StigmergyElection-PT-02b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 3 out of 291 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 291/291 places, 332/332 transitions.
Graph (trivial) has 290 edges and 291 vertex of which 33 / 291 are part of one of the 5 SCC in 9 ms
Free SCC test removed 28 places
Drop transitions removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Graph (complete) has 359 edges and 263 vertex of which 259 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.5 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 185 transitions
Trivial Post-agglo rules discarded 185 transitions
Performed 185 trivial Post agglomeration. Transition count delta: 185
Iterating post reduction 0 with 187 rules applied. Total rules applied 189 place count 259 transition count 107
Reduce places removed 185 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 195 rules applied. Total rules applied 384 place count 74 transition count 97
Reduce places removed 5 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 9 rules applied. Total rules applied 393 place count 69 transition count 93
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 6 rules applied. Total rules applied 399 place count 65 transition count 91
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 400 place count 64 transition count 91
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 400 place count 64 transition count 86
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 410 place count 59 transition count 86
Discarding 17 places :
Symmetric choice reduction at 5 with 17 rule applications. Total rules 427 place count 42 transition count 69
Iterating global reduction 5 with 17 rules applied. Total rules applied 444 place count 42 transition count 69
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 444 place count 42 transition count 68
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 446 place count 41 transition count 68
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 452 place count 35 transition count 53
Iterating global reduction 5 with 6 rules applied. Total rules applied 458 place count 35 transition count 53
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 463 place count 35 transition count 48
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 477 place count 28 transition count 41
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 478 place count 28 transition count 40
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 479 place count 27 transition count 39
Iterating global reduction 7 with 1 rules applied. Total rules applied 480 place count 27 transition count 39
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 482 place count 26 transition count 39
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 485 place count 26 transition count 36
Free-agglomeration rule applied 11 times.
Iterating global reduction 7 with 11 rules applied. Total rules applied 496 place count 26 transition count 25
Reduce places removed 11 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 14 rules applied. Total rules applied 510 place count 15 transition count 22
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 512 place count 13 transition count 20
Iterating global reduction 8 with 2 rules applied. Total rules applied 514 place count 13 transition count 20
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 515 place count 13 transition count 19
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 516 place count 13 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 517 place count 12 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 518 place count 11 transition count 17
Performed 3 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
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 524 place count 8 transition count 12
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 527 place count 8 transition count 9
Applied a total of 527 rules in 89 ms. Remains 8 /291 variables (removed 283) and now considering 9/332 (removed 323) transitions.
Finished structural reductions, in 1 iterations. Remains : 8/291 places, 9/332 transitions.
// Phase 1: matrix 9 rows 8 cols
[2022-06-10 05:57:12] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 631 ms. (steps per millisecond=1584 ) properties (out of 3) seen :3
FORMULA StigmergyElection-PT-02b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-02b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-02b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 10484 ms.

BK_STOP 1654840633038

--------------------
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="StigmergyElection-PT-02b"
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-4028"
echo " Executing tool itstools"
echo " Input is StigmergyElection-PT-02b, 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 r294-smll-165463872700261"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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