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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
410.600 16094.00 40314.00 197.80 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-171734923700038.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-08, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r586-smll-171734923700038
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 6.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 6.6K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 108K 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 90K 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 1717351922592

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-08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 18:12:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-06-02 18:12:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:12:05] [INFO ] Load time of PNML (sax parser for PT used): 290 ms
[2024-06-02 18:12:05] [INFO ] Transformed 147 places.
[2024-06-02 18:12:05] [INFO ] Transformed 312 transitions.
[2024-06-02 18:12:05] [INFO ] Found NUPN structural information;
[2024-06-02 18:12:05] [INFO ] Parsed PT model containing 147 places and 312 transitions and 1378 arcs in 628 ms.
Structural test allowed to assert that 34 places are NOT stable. Took 16 ms.
RANDOM walk for 40000 steps (1992 resets) in 3943 ms. (10 steps per ms) remains 71/113 properties
BEST_FIRST walk for 4003 steps (47 resets) in 90 ms. (43 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4002 steps (53 resets) in 82 ms. (48 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4003 steps (49 resets) in 77 ms. (51 steps per ms) remains 66/71 properties
BEST_FIRST walk for 4001 steps (51 resets) in 111 ms. (35 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (52 resets) in 102 ms. (38 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (51 resets) in 57 ms. (69 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (49 resets) in 56 ms. (70 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (48 resets) in 51 ms. (77 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (52 resets) in 43 ms. (90 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (53 resets) in 68 ms. (57 steps per ms) remains 64/66 properties
BEST_FIRST walk for 4003 steps (49 resets) in 53 ms. (74 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (51 resets) in 73 ms. (54 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (52 resets) in 60 ms. (65 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (53 resets) in 42 ms. (93 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (49 resets) in 54 ms. (72 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (54 resets) in 50 ms. (78 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (55 resets) in 54 ms. (72 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (49 resets) in 49 ms. (80 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (50 resets) in 40 ms. (97 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (50 resets) in 68 ms. (58 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (48 resets) in 53 ms. (74 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (50 resets) in 51 ms. (76 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (48 resets) in 55 ms. (71 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (51 resets) in 55 ms. (71 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (53 resets) in 67 ms. (58 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (50 resets) in 55 ms. (71 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (52 resets) in 74 ms. (53 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (49 resets) in 58 ms. (67 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (54 resets) in 55 ms. (71 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (54 resets) in 52 ms. (75 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (53 resets) in 41 ms. (95 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (52 resets) in 16 ms. (235 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (52 resets) in 22 ms. (174 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (44 resets) in 14 ms. (266 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (52 resets) in 37 ms. (105 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4001 steps (52 resets) in 20 ms. (190 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (48 resets) in 17 ms. (222 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (54 resets) in 15 ms. (250 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (51 resets) in 15 ms. (250 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (47 resets) in 16 ms. (235 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (54 resets) in 17 ms. (222 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (51 resets) in 38 ms. (102 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (52 resets) in 37 ms. (105 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (52 resets) in 17 ms. (222 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (50 resets) in 25 ms. (153 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (49 resets) in 26 ms. (148 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (54 resets) in 15 ms. (250 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (55 resets) in 16 ms. (235 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (48 resets) in 32 ms. (121 steps per ms) remains 62/64 properties
BEST_FIRST walk for 4003 steps (45 resets) in 19 ms. (200 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (52 resets) in 25 ms. (153 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4002 steps (53 resets) in 44 ms. (88 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4002 steps (49 resets) in 45 ms. (87 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (51 resets) in 31 ms. (125 steps per ms) remains 50/62 properties
BEST_FIRST walk for 4003 steps (55 resets) in 28 ms. (138 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (50 resets) in 15 ms. (250 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (50 resets) in 16 ms. (235 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (50 resets) in 28 ms. (138 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (53 resets) in 16 ms. (235 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (51 resets) in 18 ms. (210 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4001 steps (53 resets) in 16 ms. (235 steps per ms) remains 50/50 properties
// Phase 1: matrix 312 rows 147 cols
[2024-06-02 18:12:07] [INFO ] Computed 11 invariants in 32 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 63/113 variables, 6/56 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 63/119 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (OVERLAPS) 34/147 variables, 5/124 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 34/158 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 8 (OVERLAPS) 312/459 variables, 147/305 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/459 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 10 (OVERLAPS) 0/459 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Real declared 459/459 variables, and 305 constraints, problems are : Problem set: 0 solved, 50 unsolved in 3580 ms.
Refiners :[Domain max(s): 147/147 constraints, Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 50 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 63/113 variables, 6/56 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 63/119 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (OVERLAPS) 34/147 variables, 5/124 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 34/158 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-06-02 18:12:12] [INFO ] Deduced a trap composed of 20 places in 265 ms of which 41 ms to minimize.
[2024-06-02 18:12:12] [INFO ] Deduced a trap composed of 26 places in 210 ms of which 3 ms to minimize.
[2024-06-02 18:12:13] [INFO ] Deduced a trap composed of 26 places in 198 ms of which 3 ms to minimize.
[2024-06-02 18:12:13] [INFO ] Deduced a trap composed of 25 places in 207 ms of which 4 ms to minimize.
[2024-06-02 18:12:13] [INFO ] Deduced a trap composed of 39 places in 168 ms of which 3 ms to minimize.
[2024-06-02 18:12:13] [INFO ] Deduced a trap composed of 39 places in 185 ms of which 4 ms to minimize.
[2024-06-02 18:12:13] [INFO ] Deduced a trap composed of 38 places in 137 ms of which 2 ms to minimize.
[2024-06-02 18:12:14] [INFO ] Deduced a trap composed of 33 places in 121 ms of which 2 ms to minimize.
[2024-06-02 18:12:14] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 2 ms to minimize.
[2024-06-02 18:12:14] [INFO ] Deduced a trap composed of 32 places in 137 ms of which 3 ms to minimize.
[2024-06-02 18:12:14] [INFO ] Deduced a trap composed of 32 places in 177 ms of which 3 ms to minimize.
[2024-06-02 18:12:14] [INFO ] Deduced a trap composed of 45 places in 183 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 12/170 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-06-02 18:12:15] [INFO ] Deduced a trap composed of 33 places in 165 ms of which 3 ms to minimize.
[2024-06-02 18:12:15] [INFO ] Deduced a trap composed of 31 places in 165 ms of which 2 ms to minimize.
[2024-06-02 18:12:15] [INFO ] Deduced a trap composed of 39 places in 134 ms of which 2 ms to minimize.
[2024-06-02 18:12:15] [INFO ] Deduced a trap composed of 26 places in 142 ms of which 2 ms to minimize.
[2024-06-02 18:12:15] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 2 ms to minimize.
[2024-06-02 18:12:15] [INFO ] Deduced a trap composed of 28 places in 128 ms of which 2 ms to minimize.
[2024-06-02 18:12:16] [INFO ] Deduced a trap composed of 32 places in 108 ms of which 1 ms to minimize.
[2024-06-02 18:12:16] [INFO ] Deduced a trap composed of 28 places in 133 ms of which 2 ms to minimize.
[2024-06-02 18:12:16] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 1 ms to minimize.
[2024-06-02 18:12:16] [INFO ] Deduced a trap composed of 39 places in 109 ms of which 2 ms to minimize.
[2024-06-02 18:12:16] [INFO ] Deduced a trap composed of 29 places in 150 ms of which 3 ms to minimize.
SMT process timed out in 8793ms, After SMT, problems are : Problem set: 0 solved, 50 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 50 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 312/312 transitions.
Graph (complete) has 508 edges and 147 vertex of which 140 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.4 ms
Discarding 7 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 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 25 rules applied. Total rules applied 26 place count 140 transition count 284
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 43 place count 125 transition count 282
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 43 place count 125 transition count 280
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 47 place count 123 transition count 280
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 57 place count 113 transition count 268
Iterating global reduction 2 with 10 rules applied. Total rules applied 67 place count 113 transition count 268
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 91 place count 101 transition count 256
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 93 place count 99 transition count 254
Iterating global reduction 2 with 2 rules applied. Total rules applied 95 place count 99 transition count 254
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -59
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 111 place count 91 transition count 313
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 135 place count 91 transition count 289
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 141 place count 91 transition count 283
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 141 place count 91 transition count 282
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 143 place count 90 transition count 282
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 144 place count 90 transition count 281
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 145 place count 89 transition count 281
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 147 place count 89 transition count 285
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 149 place count 87 transition count 285
Applied a total of 149 rules in 253 ms. Remains 87 /147 variables (removed 60) and now considering 285/312 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 276 ms. Remains : 87/147 places, 285/312 transitions.
RANDOM walk for 557992 steps (120446 resets) in 5320 ms. (104 steps per ms) remains 0/50 properties
Able to resolve query StableMarking after proving 114 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 14078 ms.
ITS solved all properties within timeout

BK_STOP 1717351938686

--------------------
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 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-08"
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-08, 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-171734923700038"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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