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

--------------------
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 1717352095055

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-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 18:14:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-06-02 18:14:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:14:58] [INFO ] Load time of PNML (sax parser for PT used): 210 ms
[2024-06-02 18:14:58] [INFO ] Transformed 149 places.
[2024-06-02 18:14:58] [INFO ] Transformed 340 transitions.
[2024-06-02 18:14:58] [INFO ] Found NUPN structural information;
[2024-06-02 18:14:58] [INFO ] Parsed PT model containing 149 places and 340 transitions and 1721 arcs in 469 ms.
Structural test allowed to assert that 32 places are NOT stable. Took 20 ms.
RANDOM walk for 40000 steps (1748 resets) in 3316 ms. (12 steps per ms) remains 54/117 properties
BEST_FIRST walk for 4002 steps (39 resets) in 170 ms. (23 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (40 resets) in 45 ms. (87 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (40 resets) in 87 ms. (45 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (42 resets) in 93 ms. (42 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (42 resets) in 36 ms. (108 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (40 resets) in 44 ms. (88 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (40 resets) in 27 ms. (142 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (42 resets) in 36 ms. (108 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (42 resets) in 38 ms. (102 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (40 resets) in 31 ms. (125 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (44 resets) in 36 ms. (108 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (40 resets) in 30 ms. (129 steps per ms) remains 52/54 properties
BEST_FIRST walk for 4002 steps (42 resets) in 33 ms. (117 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (39 resets) in 36 ms. (108 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (43 resets) in 36 ms. (108 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (40 resets) in 32 ms. (121 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (39 resets) in 23 ms. (166 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (42 resets) in 24 ms. (160 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (39 resets) in 28 ms. (138 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (45 resets) in 30 ms. (129 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (42 resets) in 19 ms. (200 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (45 resets) in 22 ms. (174 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (41 resets) in 23 ms. (166 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (41 resets) in 20 ms. (190 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (42 resets) in 22 ms. (174 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (42 resets) in 21 ms. (182 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (38 resets) in 22 ms. (174 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (37 resets) in 39 ms. (100 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (41 resets) in 18 ms. (210 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (38 resets) in 24 ms. (160 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (40 resets) in 19 ms. (200 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (40 resets) in 21 ms. (181 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (40 resets) in 20 ms. (190 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (40 resets) in 21 ms. (181 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (35 resets) in 18 ms. (210 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (41 resets) in 22 ms. (174 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (43 resets) in 28 ms. (138 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (38 resets) in 22 ms. (174 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (42 resets) in 18 ms. (210 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (42 resets) in 35 ms. (111 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (43 resets) in 19 ms. (200 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (42 resets) in 18 ms. (210 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (41 resets) in 20 ms. (190 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (41 resets) in 37 ms. (105 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (43 resets) in 22 ms. (174 steps per ms) remains 51/52 properties
BEST_FIRST walk for 4003 steps (43 resets) in 21 ms. (181 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (38 resets) in 20 ms. (190 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4001 steps (39 resets) in 21 ms. (181 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (42 resets) in 23 ms. (166 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (40 resets) in 23 ms. (166 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (39 resets) in 32 ms. (121 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (38 resets) in 19 ms. (200 steps per ms) remains 51/51 properties
// Phase 1: matrix 340 rows 149 cols
[2024-06-02 18:15:00] [INFO ] Computed 12 invariants in 24 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (OVERLAPS) 46/97 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 46/101 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (OVERLAPS) 23/120 variables, 3/104 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 23/127 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 8 (OVERLAPS) 29/149 variables, 5/132 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/149 variables, 29/161 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/149 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 11 (OVERLAPS) 340/489 variables, 149/310 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/489 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 13 (OVERLAPS) 0/489 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Real declared 489/489 variables, and 310 constraints, problems are : Problem set: 0 solved, 51 unsolved in 3391 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: 51/51 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 51 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (OVERLAPS) 46/97 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 46/101 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (OVERLAPS) 23/120 variables, 3/104 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 23/127 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 8 (OVERLAPS) 29/149 variables, 5/132 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/149 variables, 29/161 constraints. Problems are: Problem set: 0 solved, 51 unsolved
[2024-06-02 18:15:05] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 17 ms to minimize.
[2024-06-02 18:15:05] [INFO ] Deduced a trap composed of 35 places in 144 ms of which 4 ms to minimize.
[2024-06-02 18:15:05] [INFO ] Deduced a trap composed of 38 places in 148 ms of which 2 ms to minimize.
[2024-06-02 18:15:05] [INFO ] Deduced a trap composed of 33 places in 140 ms of which 2 ms to minimize.
[2024-06-02 18:15:05] [INFO ] Deduced a trap composed of 44 places in 166 ms of which 3 ms to minimize.
[2024-06-02 18:15:05] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 2 ms to minimize.
[2024-06-02 18:15:06] [INFO ] Deduced a trap composed of 35 places in 71 ms of which 2 ms to minimize.
[2024-06-02 18:15:06] [INFO ] Deduced a trap composed of 35 places in 151 ms of which 2 ms to minimize.
[2024-06-02 18:15:06] [INFO ] Deduced a trap composed of 48 places in 138 ms of which 2 ms to minimize.
[2024-06-02 18:15:06] [INFO ] Deduced a trap composed of 28 places in 121 ms of which 2 ms to minimize.
[2024-06-02 18:15:06] [INFO ] Deduced a trap composed of 35 places in 112 ms of which 2 ms to minimize.
[2024-06-02 18:15:06] [INFO ] Deduced a trap composed of 47 places in 115 ms of which 2 ms to minimize.
[2024-06-02 18:15:06] [INFO ] Deduced a trap composed of 46 places in 110 ms of which 2 ms to minimize.
[2024-06-02 18:15:07] [INFO ] Deduced a trap composed of 48 places in 149 ms of which 2 ms to minimize.
[2024-06-02 18:15:07] [INFO ] Deduced a trap composed of 41 places in 159 ms of which 2 ms to minimize.
[2024-06-02 18:15:07] [INFO ] Deduced a trap composed of 57 places in 146 ms of which 2 ms to minimize.
[2024-06-02 18:15:07] [INFO ] Deduced a trap composed of 38 places in 149 ms of which 2 ms to minimize.
[2024-06-02 18:15:07] [INFO ] Deduced a trap composed of 37 places in 136 ms of which 2 ms to minimize.
[2024-06-02 18:15:07] [INFO ] Deduced a trap composed of 50 places in 126 ms of which 2 ms to minimize.
[2024-06-02 18:15:07] [INFO ] Deduced a trap composed of 54 places in 141 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/149 variables, 20/181 constraints. Problems are: Problem set: 0 solved, 51 unsolved
[2024-06-02 18:15:08] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2024-06-02 18:15:08] [INFO ] Deduced a trap composed of 49 places in 153 ms of which 3 ms to minimize.
[2024-06-02 18:15:08] [INFO ] Deduced a trap composed of 52 places in 163 ms of which 3 ms to minimize.
[2024-06-02 18:15:08] [INFO ] Deduced a trap composed of 52 places in 167 ms of which 3 ms to minimize.
[2024-06-02 18:15:08] [INFO ] Deduced a trap composed of 50 places in 159 ms of which 2 ms to minimize.
[2024-06-02 18:15:08] [INFO ] Deduced a trap composed of 48 places in 138 ms of which 2 ms to minimize.
[2024-06-02 18:15:08] [INFO ] Deduced a trap composed of 42 places in 117 ms of which 2 ms to minimize.
[2024-06-02 18:15:09] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 2 ms to minimize.
SMT process timed out in 8624ms, After SMT, problems are : Problem set: 0 solved, 51 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 51 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 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 144 transition count 321
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 36 place count 128 transition count 319
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 36 place count 128 transition count 316
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 42 place count 125 transition count 316
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 54 place count 113 transition count 302
Iterating global reduction 2 with 12 rules applied. Total rules applied 66 place count 113 transition count 302
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 68 place count 111 transition count 300
Iterating global reduction 2 with 2 rules applied. Total rules applied 70 place count 111 transition count 300
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 98 place count 97 transition count 286
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 100 place count 95 transition count 284
Iterating global reduction 2 with 2 rules applied. Total rules applied 102 place count 95 transition count 284
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 110 place count 91 transition count 307
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 116 place count 91 transition count 301
Free-agglomeration rule applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 120 place count 91 transition count 297
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 124 place count 87 transition count 297
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 126 place count 87 transition count 299
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 128 place count 85 transition count 299
Applied a total of 128 rules in 179 ms. Remains 85 /149 variables (removed 64) and now considering 299/340 (removed 41) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 197 ms. Remains : 85/149 places, 299/340 transitions.
RANDOM walk for 194580 steps (42220 resets) in 3435 ms. (56 steps per ms) remains 0/51 properties
Able to resolve query StableMarking after proving 118 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 12555 ms.
ITS solved all properties within timeout

BK_STOP 1717352110423

--------------------
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="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-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 r590-smll-171734924800048"
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 ;