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.r399-tall-171690530000277.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 greatspnxred
Input is StigmergyElection-PT-03b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r399-tall-171690530000277
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 18:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Apr 11 18:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Apr 11 18:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 11 18:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 117K May 18 16:43 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-03b-UpperBounds-00
FORMULA_NAME StigmergyElection-PT-03b-UpperBounds-01
FORMULA_NAME StigmergyElection-PT-03b-UpperBounds-02
FORMULA_NAME StigmergyElection-PT-03b-UpperBounds-03
FORMULA_NAME StigmergyElection-PT-03b-UpperBounds-04
FORMULA_NAME StigmergyElection-PT-03b-UpperBounds-05
FORMULA_NAME StigmergyElection-PT-03b-UpperBounds-06
FORMULA_NAME StigmergyElection-PT-03b-UpperBounds-07
FORMULA_NAME StigmergyElection-PT-03b-UpperBounds-08
FORMULA_NAME StigmergyElection-PT-03b-UpperBounds-09
FORMULA_NAME StigmergyElection-PT-03b-UpperBounds-10
FORMULA_NAME StigmergyElection-PT-03b-UpperBounds-11
FORMULA_NAME StigmergyElection-PT-03b-UpperBounds-12
FORMULA_NAME StigmergyElection-PT-03b-UpperBounds-13
FORMULA_NAME StigmergyElection-PT-03b-UpperBounds-14
FORMULA_NAME StigmergyElection-PT-03b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717009056218

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-03b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 18:57:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-29 18:57:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 18:57:37] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2024-05-29 18:57:37] [INFO ] Transformed 427 places.
[2024-05-29 18:57:37] [INFO ] Transformed 518 transitions.
[2024-05-29 18:57:37] [INFO ] Found NUPN structural information;
[2024-05-29 18:57:37] [INFO ] Parsed PT model containing 427 places and 518 transitions and 1323 arcs in 186 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
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:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 518 rows 427 cols
[2024-05-29 18:57:37] [INFO ] Computed 4 invariants in 14 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (173 resets) in 29 ms. (333 steps per ms)
FORMULA StigmergyElection-PT-03b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyElection-PT-03b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyElection-PT-03b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyElection-PT-03b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyElection-PT-03b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyElection-PT-03b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyElection-PT-03b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyElection-PT-03b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyElection-PT-03b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyElection-PT-03b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyElection-PT-03b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyElection-PT-03b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50003 steps (205 resets) in 43 ms. (1136 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2024-05-29 18:57:37] [INFO ] Invariant cache hit.
[2024-05-29 18:57:37] [INFO ] [Real]Absence check using 4 positive place invariants in 9 ms returned sat
[2024-05-29 18:57:38] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2024-05-29 18:57:38] [INFO ] Deduced a trap composed of 195 places in 170 ms of which 12 ms to minimize.
[2024-05-29 18:57:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 18:57:38] [INFO ] [Nat]Absence check using 4 positive place invariants in 7 ms returned sat
[2024-05-29 18:57:38] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2024-05-29 18:57:38] [INFO ] Deduced a trap composed of 195 places in 126 ms of which 3 ms to minimize.
[2024-05-29 18:57:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 185 ms
[2024-05-29 18:57:38] [INFO ] Computed and/alt/rep : 477/791/477 causal constraints (skipped 40 transitions) in 31 ms.
[2024-05-29 18:57:41] [INFO ] Deduced a trap composed of 190 places in 137 ms of which 3 ms to minimize.
[2024-05-29 18:57:41] [INFO ] Deduced a trap composed of 189 places in 118 ms of which 2 ms to minimize.
[2024-05-29 18:57:41] [INFO ] Deduced a trap composed of 190 places in 134 ms of which 11 ms to minimize.
[2024-05-29 18:57:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 528 ms
[2024-05-29 18:57:42] [INFO ] Added : 377 causal constraints over 76 iterations in 3240 ms. Result :sat
Minimization took 208 ms.
[2024-05-29 18:57:42] [INFO ] [Real]Absence check using 4 positive place invariants in 7 ms returned sat
[2024-05-29 18:57:42] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2024-05-29 18:57:42] [INFO ] Deduced a trap composed of 189 places in 129 ms of which 3 ms to minimize.
[2024-05-29 18:57:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 18:57:42] [INFO ] [Nat]Absence check using 4 positive place invariants in 8 ms returned sat
[2024-05-29 18:57:42] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2024-05-29 18:57:43] [INFO ] Deduced a trap composed of 189 places in 125 ms of which 3 ms to minimize.
[2024-05-29 18:57:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 166 ms
[2024-05-29 18:57:43] [INFO ] Computed and/alt/rep : 477/791/477 causal constraints (skipped 40 transitions) in 33 ms.
[2024-05-29 18:57:45] [INFO ] Deduced a trap composed of 190 places in 145 ms of which 3 ms to minimize.
[2024-05-29 18:57:45] [INFO ] Deduced a trap composed of 325 places in 125 ms of which 3 ms to minimize.
[2024-05-29 18:57:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 382 ms
[2024-05-29 18:57:46] [INFO ] Added : 378 causal constraints over 77 iterations in 3044 ms. Result :sat
Minimization took 209 ms.
[2024-05-29 18:57:46] [INFO ] [Real]Absence check using 4 positive place invariants in 6 ms returned sat
[2024-05-29 18:57:46] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2024-05-29 18:57:46] [INFO ] Computed and/alt/rep : 477/791/477 causal constraints (skipped 40 transitions) in 32 ms.
[2024-05-29 18:57:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 18:57:46] [INFO ] [Nat]Absence check using 4 positive place invariants in 7 ms returned sat
[2024-05-29 18:57:46] [INFO ] [Nat]Absence check using state equation in 116 ms returned sat
[2024-05-29 18:57:47] [INFO ] Computed and/alt/rep : 477/791/477 causal constraints (skipped 40 transitions) in 30 ms.
[2024-05-29 18:57:48] [INFO ] Deduced a trap composed of 190 places in 112 ms of which 3 ms to minimize.
[2024-05-29 18:57:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 160 ms
[2024-05-29 18:57:48] [INFO ] Added : 240 causal constraints over 48 iterations in 1642 ms. Result :sat
Minimization took 180 ms.
[2024-05-29 18:57:48] [INFO ] [Real]Absence check using 4 positive place invariants in 6 ms returned sat
[2024-05-29 18:57:49] [INFO ] [Real]Absence check using state equation in 112 ms returned sat
[2024-05-29 18:57:49] [INFO ] Deduced a trap composed of 189 places in 118 ms of which 2 ms to minimize.
[2024-05-29 18:57:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 18:57:49] [INFO ] [Nat]Absence check using 4 positive place invariants in 7 ms returned sat
[2024-05-29 18:57:49] [INFO ] [Nat]Absence check using state equation in 121 ms returned sat
[2024-05-29 18:57:49] [INFO ] Deduced a trap composed of 189 places in 131 ms of which 3 ms to minimize.
[2024-05-29 18:57:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 171 ms
[2024-05-29 18:57:49] [INFO ] Computed and/alt/rep : 477/791/477 causal constraints (skipped 40 transitions) in 33 ms.
[2024-05-29 18:57:51] [INFO ] Deduced a trap composed of 310 places in 135 ms of which 3 ms to minimize.
[2024-05-29 18:57:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 190 ms
[2024-05-29 18:57:51] [INFO ] Added : 310 causal constraints over 62 iterations in 2260 ms. Result :sat
Minimization took 197 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
FORMULA StigmergyElection-PT-03b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 427 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 427/427 places, 518/518 transitions.
Graph (trivial) has 429 edges and 427 vertex of which 63 / 427 are part of one of the 9 SCC in 12 ms
Free SCC test removed 54 places
Drop transitions (Empty/Sink Transition effects.) removed 69 transitions
Reduce isomorphic transitions removed 69 transitions.
Graph (complete) has 579 edges and 373 vertex of which 367 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.6 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 266 transitions
Trivial Post-agglo rules discarded 266 transitions
Performed 266 trivial Post agglomeration. Transition count delta: 266
Iterating post reduction 0 with 269 rules applied. Total rules applied 271 place count 367 transition count 177
Reduce places removed 266 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 284 rules applied. Total rules applied 555 place count 101 transition count 159
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 10 rules applied. Total rules applied 565 place count 92 transition count 158
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 566 place count 91 transition count 158
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 566 place count 91 transition count 150
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 582 place count 83 transition count 150
Discarding 25 places :
Symmetric choice reduction at 4 with 25 rule applications. Total rules 607 place count 58 transition count 125
Iterating global reduction 4 with 25 rules applied. Total rules applied 632 place count 58 transition count 125
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 632 place count 58 transition count 123
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 636 place count 56 transition count 123
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 646 place count 46 transition count 76
Iterating global reduction 4 with 10 rules applied. Total rules applied 656 place count 46 transition count 76
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 663 place count 46 transition count 69
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 679 place count 38 transition count 61
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 680 place count 38 transition count 60
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 681 place count 37 transition count 59
Iterating global reduction 6 with 1 rules applied. Total rules applied 682 place count 37 transition count 59
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 686 place count 35 transition count 61
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 690 place count 35 transition count 57
Free-agglomeration rule applied 16 times.
Iterating global reduction 6 with 16 rules applied. Total rules applied 706 place count 35 transition count 41
Reduce places removed 16 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 25 rules applied. Total rules applied 731 place count 19 transition count 32
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 734 place count 16 transition count 29
Iterating global reduction 7 with 3 rules applied. Total rules applied 737 place count 16 transition count 29
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 738 place count 16 transition count 28
Applied a total of 738 rules in 92 ms. Remains 16 /427 variables (removed 411) and now considering 28/518 (removed 490) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 16/427 places, 28/518 transitions.
// Phase 1: matrix 28 rows 16 cols
[2024-05-29 18:57:52] [INFO ] Computed 4 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 772 ms. (1293 steps per ms)
FORMULA StigmergyElection-PT-03b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyElection-PT-03b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyElection-PT-03b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 255 ms. (3906 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 5 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 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 16604 ms.
ITS solved all properties within timeout

BK_STOP 1717009073978

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

+ 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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-03b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is StigmergyElection-PT-03b, 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 r399-tall-171690530000277"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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