fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r586-smll-171734923700048
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for MedleyA-PT-10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
466.943 19922.00 48609.00 132.90 F normal

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.r586-smll-171734923700048.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 MedleyA-PT-10, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r586-smll-171734923700048
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 6.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.9K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 107K Jun 2 16:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1717352030891

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=MedleyA-PT-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 18:13:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-06-02 18:13:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:13:53] [INFO ] Load time of PNML (sax parser for PT used): 197 ms
[2024-06-02 18:13:53] [INFO ] Transformed 149 places.
[2024-06-02 18:13:53] [INFO ] Transformed 340 transitions.
[2024-06-02 18:13:53] [INFO ] Found NUPN structural information;
[2024-06-02 18:13:53] [INFO ] Parsed PT model containing 149 places and 340 transitions and 1721 arcs in 453 ms.
Structural test allowed to assert that 32 places are NOT stable. Took 15 ms.
RANDOM walk for 40000 steps (1757 resets) in 4244 ms. (9 steps per ms) remains 57/117 properties
BEST_FIRST walk for 4003 steps (40 resets) in 43 ms. (90 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (42 resets) in 51 ms. (76 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (42 resets) in 38 ms. (102 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (43 resets) in 56 ms. (70 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (45 resets) in 61 ms. (64 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (41 resets) in 66 ms. (59 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4001 steps (40 resets) in 28 ms. (137 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (43 resets) in 59 ms. (66 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (43 resets) in 53 ms. (74 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (41 resets) in 36 ms. (108 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (38 resets) in 39 ms. (100 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (44 resets) in 30 ms. (129 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (42 resets) in 43 ms. (90 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4001 steps (42 resets) in 38 ms. (102 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (42 resets) in 21 ms. (182 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (42 resets) in 38 ms. (102 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (44 resets) in 25 ms. (153 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (38 resets) in 43 ms. (90 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (43 resets) in 49 ms. (80 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (41 resets) in 18 ms. (210 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (42 resets) in 18 ms. (210 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (42 resets) in 13 ms. (285 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (41 resets) in 24 ms. (160 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (41 resets) in 22 ms. (174 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (38 resets) in 24 ms. (160 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (43 resets) in 27 ms. (143 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (42 resets) in 32 ms. (121 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (44 resets) in 16 ms. (235 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (42 resets) in 38 ms. (102 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (42 resets) in 24 ms. (160 steps per ms) remains 56/57 properties
BEST_FIRST walk for 4002 steps (42 resets) in 54 ms. (72 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4001 steps (43 resets) in 18 ms. (210 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (42 resets) in 69 ms. (57 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (43 resets) in 29 ms. (133 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (40 resets) in 28 ms. (138 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (38 resets) in 20 ms. (190 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (41 resets) in 20 ms. (190 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (42 resets) in 20 ms. (190 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4001 steps (44 resets) in 16 ms. (235 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (42 resets) in 19 ms. (200 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (41 resets) in 38 ms. (102 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (42 resets) in 20 ms. (190 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (39 resets) in 22 ms. (174 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4001 steps (41 resets) in 17 ms. (222 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (40 resets) in 33 ms. (117 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (41 resets) in 20 ms. (190 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (43 resets) in 26 ms. (148 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (46 resets) in 41 ms. (95 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (39 resets) in 23 ms. (166 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (38 resets) in 31 ms. (125 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (45 resets) in 62 ms. (63 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (42 resets) in 20 ms. (190 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4001 steps (41 resets) in 26 ms. (148 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (43 resets) in 26 ms. (148 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (39 resets) in 40 ms. (97 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (40 resets) in 26 ms. (148 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (44 resets) in 18 ms. (210 steps per ms) remains 56/56 properties
// Phase 1: matrix 340 rows 149 cols
[2024-06-02 18:13:56] [INFO ] Computed 12 invariants in 36 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 44/100 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 44/104 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 23/123 variables, 3/107 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 23/130 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (OVERLAPS) 26/149 variables, 5/135 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/149 variables, 26/161 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/149 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 11 (OVERLAPS) 340/489 variables, 149/310 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/489 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 13 (OVERLAPS) 0/489 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 489/489 variables, and 310 constraints, problems are : Problem set: 0 solved, 56 unsolved in 4204 ms.
Refiners :[Domain max(s): 149/149 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 149/149 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 56 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 44/100 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 44/104 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 23/123 variables, 3/107 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 23/130 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (OVERLAPS) 26/149 variables, 5/135 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/149 variables, 26/161 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-06-02 18:14:02] [INFO ] Deduced a trap composed of 21 places in 223 ms of which 31 ms to minimize.
[2024-06-02 18:14:02] [INFO ] Deduced a trap composed of 33 places in 131 ms of which 2 ms to minimize.
[2024-06-02 18:14:02] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 2 ms to minimize.
[2024-06-02 18:14:02] [INFO ] Deduced a trap composed of 45 places in 109 ms of which 2 ms to minimize.
[2024-06-02 18:14:02] [INFO ] Deduced a trap composed of 29 places in 119 ms of which 2 ms to minimize.
[2024-06-02 18:14:02] [INFO ] Deduced a trap composed of 35 places in 114 ms of which 2 ms to minimize.
[2024-06-02 18:14:02] [INFO ] Deduced a trap composed of 46 places in 178 ms of which 3 ms to minimize.
[2024-06-02 18:14:03] [INFO ] Deduced a trap composed of 58 places in 202 ms of which 3 ms to minimize.
[2024-06-02 18:14:03] [INFO ] Deduced a trap composed of 35 places in 183 ms of which 3 ms to minimize.
[2024-06-02 18:14:03] [INFO ] Deduced a trap composed of 27 places in 114 ms of which 2 ms to minimize.
[2024-06-02 18:14:03] [INFO ] Deduced a trap composed of 28 places in 148 ms of which 2 ms to minimize.
[2024-06-02 18:14:03] [INFO ] Deduced a trap composed of 33 places in 105 ms of which 1 ms to minimize.
[2024-06-02 18:14:03] [INFO ] Deduced a trap composed of 24 places in 137 ms of which 2 ms to minimize.
[2024-06-02 18:14:04] [INFO ] Deduced a trap composed of 35 places in 100 ms of which 2 ms to minimize.
[2024-06-02 18:14:04] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 2 ms to minimize.
[2024-06-02 18:14:04] [INFO ] Deduced a trap composed of 32 places in 108 ms of which 3 ms to minimize.
[2024-06-02 18:14:04] [INFO ] Deduced a trap composed of 25 places in 150 ms of which 2 ms to minimize.
[2024-06-02 18:14:04] [INFO ] Deduced a trap composed of 31 places in 147 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/149 variables, 18/179 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-06-02 18:14:04] [INFO ] Deduced a trap composed of 28 places in 125 ms of which 2 ms to minimize.
[2024-06-02 18:14:05] [INFO ] Deduced a trap composed of 28 places in 162 ms of which 3 ms to minimize.
[2024-06-02 18:14:05] [INFO ] Deduced a trap composed of 21 places in 178 ms of which 3 ms to minimize.
SMT process timed out in 9574ms, After SMT, problems are : Problem set: 0 solved, 56 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 56 out of 149 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 149/149 places, 340/340 transitions.
Graph (complete) has 543 edges and 149 vertex of which 144 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Discarding 5 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 144 transition count 322
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 129 transition count 320
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 34 place count 129 transition count 317
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 40 place count 126 transition count 317
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 51 place count 115 transition count 304
Iterating global reduction 2 with 11 rules applied. Total rules applied 62 place count 115 transition count 304
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 2 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 90 place count 101 transition count 290
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 92 place count 99 transition count 288
Iterating global reduction 2 with 2 rules applied. Total rules applied 94 place count 99 transition count 288
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 98 place count 97 transition count 295
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 104 place count 97 transition count 289
Free-agglomeration rule applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 109 place count 97 transition count 284
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 114 place count 92 transition count 284
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 115 place count 92 transition count 286
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 116 place count 91 transition count 286
Applied a total of 116 rules in 219 ms. Remains 91 /149 variables (removed 58) and now considering 286/340 (removed 54) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 244 ms. Remains : 91/149 places, 286/340 transitions.
RANDOM walk for 1266830 steps (221135 resets) in 13242 ms. (95 steps per ms) remains 0/56 properties
Able to resolve query StableMarking after proving 118 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 17674 ms.
ITS solved all properties within timeout

BK_STOP 1717352050813

--------------------
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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ 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 StableMarking -timeout 180 -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="MedleyA-PT-10"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 MedleyA-PT-10, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r586-smll-171734923700048"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-10.tgz
mv MedleyA-PT-10 execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.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 '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;