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.r590-smll-171734924900113.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 ltsminxred
Input is MedleyA-PT-23, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r590-smll-171734924900113
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 8.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K 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.2K 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 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K 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 150K 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 1717353029077

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=MedleyA-PT-23
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 18:30:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-06-02 18:30:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:30:32] [INFO ] Load time of PNML (sax parser for PT used): 386 ms
[2024-06-02 18:30:32] [INFO ] Transformed 378 places.
[2024-06-02 18:30:32] [INFO ] Transformed 614 transitions.
[2024-06-02 18:30:32] [INFO ] Found NUPN structural information;
[2024-06-02 18:30:32] [INFO ] Parsed PT model containing 378 places and 614 transitions and 1969 arcs in 703 ms.
Graph (trivial) has 338 edges and 378 vertex of which 39 / 378 are part of one of the 3 SCC in 11 ms
Free SCC test removed 36 places
Structural test allowed to assert that 123 places are NOT stable. Took 72 ms.
Ensure Unique test removed 45 transitions
Reduce redundant transitions removed 45 transitions.
RANDOM walk for 40000 steps (72 resets) in 4377 ms. (9 steps per ms) remains 81/255 properties
BEST_FIRST walk for 4003 steps (15 resets) in 45 ms. (87 steps per ms) remains 76/81 properties
BEST_FIRST walk for 4002 steps (13 resets) in 34 ms. (114 steps per ms) remains 73/76 properties
BEST_FIRST walk for 4002 steps (18 resets) in 52 ms. (75 steps per ms) remains 68/73 properties
BEST_FIRST walk for 4004 steps (18 resets) in 101 ms. (39 steps per ms) remains 67/68 properties
BEST_FIRST walk for 4003 steps (15 resets) in 73 ms. (54 steps per ms) remains 63/67 properties
BEST_FIRST walk for 4004 steps (16 resets) in 100 ms. (39 steps per ms) remains 62/63 properties
BEST_FIRST walk for 4003 steps (16 resets) in 73 ms. (54 steps per ms) remains 60/62 properties
BEST_FIRST walk for 4004 steps (11 resets) in 85 ms. (46 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (15 resets) in 46 ms. (85 steps per ms) remains 59/60 properties
BEST_FIRST walk for 4003 steps (15 resets) in 34 ms. (114 steps per ms) remains 58/59 properties
BEST_FIRST walk for 4003 steps (17 resets) in 23 ms. (166 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (15 resets) in 19 ms. (200 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (19 resets) in 21 ms. (182 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (12 resets) in 24 ms. (160 steps per ms) remains 57/58 properties
BEST_FIRST walk for 4003 steps (12 resets) in 18 ms. (210 steps per ms) remains 56/57 properties
BEST_FIRST walk for 4003 steps (15 resets) in 15 ms. (250 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (14 resets) in 20 ms. (190 steps per ms) remains 52/56 properties
BEST_FIRST walk for 4003 steps (14 resets) in 17 ms. (222 steps per ms) remains 48/52 properties
BEST_FIRST walk for 4003 steps (13 resets) in 21 ms. (181 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (15 resets) in 22 ms. (174 steps per ms) remains 43/48 properties
BEST_FIRST walk for 4002 steps (19 resets) in 19 ms. (200 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (16 resets) in 18 ms. (210 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (14 resets) in 17 ms. (222 steps per ms) remains 42/43 properties
BEST_FIRST walk for 4002 steps (16 resets) in 20 ms. (190 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (16 resets) in 16 ms. (235 steps per ms) remains 38/42 properties
BEST_FIRST walk for 4003 steps (12 resets) in 13 ms. (285 steps per ms) remains 36/38 properties
BEST_FIRST walk for 4003 steps (12 resets) in 18 ms. (210 steps per ms) remains 34/36 properties
BEST_FIRST walk for 4002 steps (14 resets) in 13 ms. (285 steps per ms) remains 32/34 properties
BEST_FIRST walk for 4004 steps (14 resets) in 11 ms. (333 steps per ms) remains 29/32 properties
BEST_FIRST walk for 4002 steps (16 resets) in 12 ms. (307 steps per ms) remains 28/29 properties
BEST_FIRST walk for 4003 steps (15 resets) in 11 ms. (333 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (14 resets) in 12 ms. (307 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (15 resets) in 12 ms. (308 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (15 resets) in 12 ms. (308 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (13 resets) in 33 ms. (117 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (17 resets) in 11 ms. (333 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (18 resets) in 11 ms. (333 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (20 resets) in 12 ms. (308 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (13 resets) in 13 ms. (286 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (15 resets) in 32 ms. (121 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (13 resets) in 12 ms. (307 steps per ms) remains 28/28 properties
[2024-06-02 18:30:35] [INFO ] Flow matrix only has 567 transitions (discarded 2 similar events)
// Phase 1: matrix 567 rows 342 cols
[2024-06-02 18:30:35] [INFO ] Computed 11 invariants in 38 ms
[2024-06-02 18:30:35] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 163/191 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 163/193 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 75/266 variables, 8/201 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 75/276 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/266 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (OVERLAPS) 76/342 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/342 variables, 76/353 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/342 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 11 (OVERLAPS) 566/908 variables, 342/695 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/908 variables, 0/695 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 13 (OVERLAPS) 1/909 variables, 1/696 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/909 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 15 (OVERLAPS) 0/909 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 909/909 variables, and 696 constraints, problems are : Problem set: 0 solved, 28 unsolved in 3928 ms.
Refiners :[Domain max(s): 342/342 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 342/342 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 163/191 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 163/193 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 75/266 variables, 8/201 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 75/276 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/266 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (OVERLAPS) 76/342 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/342 variables, 76/353 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2024-06-02 18:30:40] [INFO ] Deduced a trap composed of 226 places in 320 ms of which 45 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/342 variables, 1/354 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/342 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 12 (OVERLAPS) 566/908 variables, 342/696 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/908 variables, 28/724 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2024-06-02 18:30:41] [INFO ] Deduced a trap composed of 232 places in 293 ms of which 6 ms to minimize.
[2024-06-02 18:30:42] [INFO ] Deduced a trap composed of 217 places in 274 ms of which 6 ms to minimize.
[2024-06-02 18:30:42] [INFO ] Deduced a trap composed of 217 places in 209 ms of which 4 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/908 variables, 3/727 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2024-06-02 18:30:44] [INFO ] Deduced a trap composed of 160 places in 379 ms of which 7 ms to minimize.
SMT process timed out in 9147ms, After SMT, problems are : Problem set: 0 solved, 28 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 28 out of 342 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 342/342 places, 569/569 transitions.
Graph (complete) has 1035 edges and 342 vertex of which 339 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.5 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 103 rules applied. Total rules applied 104 place count 339 transition count 466
Reduce places removed 97 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 204 place count 242 transition count 463
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 204 place count 242 transition count 461
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 208 place count 240 transition count 461
Discarding 60 places :
Symmetric choice reduction at 2 with 60 rule applications. Total rules 268 place count 180 transition count 401
Iterating global reduction 2 with 60 rules applied. Total rules applied 328 place count 180 transition count 401
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 328 place count 180 transition count 391
Deduced a syphon composed of 10 places in 3 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 348 place count 170 transition count 391
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 351 place count 170 transition count 388
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 376 place count 145 transition count 313
Iterating global reduction 3 with 25 rules applied. Total rules applied 401 place count 145 transition count 313
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 410 place count 145 transition count 304
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 411 place count 144 transition count 302
Iterating global reduction 4 with 1 rules applied. Total rules applied 412 place count 144 transition count 302
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 413 place count 143 transition count 299
Iterating global reduction 4 with 1 rules applied. Total rules applied 414 place count 143 transition count 299
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 415 place count 143 transition count 298
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 449 place count 126 transition count 281
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 452 place count 126 transition count 278
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 472 place count 116 transition count 294
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 478 place count 116 transition count 288
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 479 place count 115 transition count 285
Iterating global reduction 6 with 1 rules applied. Total rules applied 480 place count 115 transition count 285
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 481 place count 115 transition count 284
Free-agglomeration rule applied 26 times.
Iterating global reduction 7 with 26 rules applied. Total rules applied 507 place count 115 transition count 258
Reduce places removed 26 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 7 with 38 rules applied. Total rules applied 545 place count 89 transition count 246
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 551 place count 86 transition count 243
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 554 place count 86 transition count 240
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 555 place count 85 transition count 239
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 556 place count 84 transition count 239
Applied a total of 556 rules in 339 ms. Remains 84 /342 variables (removed 258) and now considering 239/569 (removed 330) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 363 ms. Remains : 84/342 places, 239/569 transitions.
RANDOM walk for 3706 steps (48 resets) in 128 ms. (28 steps per ms) remains 0/28 properties
Able to resolve query StableMarking after proving 257 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 12596 ms.
ITS solved all properties within timeout

BK_STOP 1717353044706

--------------------
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-23"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is MedleyA-PT-23, 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 r590-smll-171734924900113"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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