Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2022-input.r016-tajo-165245743500278.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is AutoFlight-PT-05b, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r016-tajo-165245743500278
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 364K
-rw-r--r-- 1 mcc users 7.6K Apr 30 01:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Apr 30 01:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Apr 30 01:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 30 01:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K May 9 07:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 07:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 07:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 9 07:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 113K May 10 09: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 1652772765883

Running Version 202205111006
[2022-05-17 07:32:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2022-05-17 07:32:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 07:32:47] [INFO ] Load time of PNML (sax parser for PT used): 99 ms
[2022-05-17 07:32:47] [INFO ] Transformed 482 places.
[2022-05-17 07:32:47] [INFO ] Transformed 480 transitions.
[2022-05-17 07:32:47] [INFO ] Found NUPN structural information;
[2022-05-17 07:32:47] [INFO ] Parsed PT model containing 482 places and 480 transitions in 204 ms.
Structural test allowed to assert that 286 places are NOT stable. Took 9 ms.
Incomplete random walk after 10000 steps, including 40 resets, run finished after 600 ms. (steps per millisecond=16 ) properties (out of 196) seen :92
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=5 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 104) seen :0
Running SMT prover for 104 properties.
// Phase 1: matrix 480 rows 482 cols
[2022-05-17 07:32:48] [INFO ] Computed 34 place invariants in 18 ms
[2022-05-17 07:32:49] [INFO ] After 1014ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:104
[2022-05-17 07:32:49] [INFO ] [Nat]Absence check using 33 positive place invariants in 14 ms returned sat
[2022-05-17 07:32:49] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 4 ms returned sat
[2022-05-17 07:32:52] [INFO ] After 1531ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :104
[2022-05-17 07:32:52] [INFO ] Deduced a trap composed of 59 places in 125 ms of which 6 ms to minimize.
[2022-05-17 07:32:52] [INFO ] Deduced a trap composed of 30 places in 123 ms of which 1 ms to minimize.
[2022-05-17 07:32:52] [INFO ] Deduced a trap composed of 74 places in 110 ms of which 1 ms to minimize.
[2022-05-17 07:32:52] [INFO ] Deduced a trap composed of 75 places in 107 ms of which 1 ms to minimize.
[2022-05-17 07:32:52] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 573 ms
[2022-05-17 07:32:52] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 0 ms to minimize.
[2022-05-17 07:32:52] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 0 ms to minimize.
[2022-05-17 07:32:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 145 ms
[2022-05-17 07:32:52] [INFO ] Deduced a trap composed of 65 places in 120 ms of which 1 ms to minimize.
[2022-05-17 07:32:53] [INFO ] Deduced a trap composed of 70 places in 113 ms of which 0 ms to minimize.
[2022-05-17 07:32:53] [INFO ] Deduced a trap composed of 62 places in 95 ms of which 1 ms to minimize.
[2022-05-17 07:32:53] [INFO ] Deduced a trap composed of 87 places in 90 ms of which 1 ms to minimize.
[2022-05-17 07:32:53] [INFO ] Deduced a trap composed of 55 places in 137 ms of which 0 ms to minimize.
[2022-05-17 07:32:53] [INFO ] Deduced a trap composed of 71 places in 111 ms of which 1 ms to minimize.
[2022-05-17 07:32:53] [INFO ] Deduced a trap composed of 58 places in 108 ms of which 0 ms to minimize.
[2022-05-17 07:32:53] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 973 ms
[2022-05-17 07:32:54] [INFO ] Deduced a trap composed of 76 places in 113 ms of which 1 ms to minimize.
[2022-05-17 07:32:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 164 ms
[2022-05-17 07:32:54] [INFO ] Deduced a trap composed of 61 places in 84 ms of which 0 ms to minimize.
[2022-05-17 07:32:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2022-05-17 07:32:55] [INFO ] Deduced a trap composed of 79 places in 97 ms of which 0 ms to minimize.
[2022-05-17 07:32:55] [INFO ] Deduced a trap composed of 72 places in 100 ms of which 0 ms to minimize.
[2022-05-17 07:32:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 274 ms
[2022-05-17 07:32:55] [INFO ] Deduced a trap composed of 73 places in 86 ms of which 1 ms to minimize.
[2022-05-17 07:32:55] [INFO ] Deduced a trap composed of 97 places in 70 ms of which 0 ms to minimize.
[2022-05-17 07:32:55] [INFO ] Deduced a trap composed of 80 places in 77 ms of which 1 ms to minimize.
[2022-05-17 07:32:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 323 ms
[2022-05-17 07:32:55] [INFO ] Deduced a trap composed of 46 places in 71 ms of which 1 ms to minimize.
[2022-05-17 07:32:55] [INFO ] Deduced a trap composed of 52 places in 63 ms of which 0 ms to minimize.
[2022-05-17 07:32:55] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 1 ms to minimize.
[2022-05-17 07:32:56] [INFO ] Deduced a trap composed of 50 places in 51 ms of which 0 ms to minimize.
[2022-05-17 07:32:56] [INFO ] Deduced a trap composed of 53 places in 55 ms of which 0 ms to minimize.
[2022-05-17 07:32:56] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 457 ms
[2022-05-17 07:32:56] [INFO ] Deduced a trap composed of 73 places in 116 ms of which 1 ms to minimize.
[2022-05-17 07:32:56] [INFO ] Deduced a trap composed of 85 places in 82 ms of which 1 ms to minimize.
[2022-05-17 07:32:56] [INFO ] Deduced a trap composed of 69 places in 78 ms of which 0 ms to minimize.
[2022-05-17 07:32:56] [INFO ] Deduced a trap composed of 74 places in 79 ms of which 1 ms to minimize.
[2022-05-17 07:32:56] [INFO ] Deduced a trap composed of 71 places in 78 ms of which 1 ms to minimize.
[2022-05-17 07:32:56] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 579 ms
[2022-05-17 07:32:57] [INFO ] Deduced a trap composed of 48 places in 67 ms of which 0 ms to minimize.
[2022-05-17 07:32:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2022-05-17 07:32:57] [INFO ] Deduced a trap composed of 70 places in 72 ms of which 0 ms to minimize.
[2022-05-17 07:32:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2022-05-17 07:32:58] [INFO ] After 8047ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :104
Attempting to minimize the solution found.
Minimization took 1369 ms.
[2022-05-17 07:32:59] [INFO ] After 10745ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :104
Fused 104 Parikh solutions to 103 different solutions.
Parikh walk visited 100 properties in 30199 ms.
Support contains 4 out of 482 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 482/482 places, 480/480 transitions.
Drop transitions removed 183 transitions
Trivial Post-agglo rules discarded 183 transitions
Performed 183 trivial Post agglomeration. Transition count delta: 183
Iterating post reduction 0 with 183 rules applied. Total rules applied 183 place count 482 transition count 297
Reduce places removed 183 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 218 rules applied. Total rules applied 401 place count 299 transition count 262
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 411 place count 289 transition count 262
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 66 Pre rules applied. Total rules applied 411 place count 289 transition count 196
Deduced a syphon composed of 66 places in 1 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 132 rules applied. Total rules applied 543 place count 223 transition count 196
Discarding 43 places :
Symmetric choice reduction at 3 with 43 rule applications. Total rules 586 place count 180 transition count 153
Iterating global reduction 3 with 43 rules applied. Total rules applied 629 place count 180 transition count 153
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 629 place count 180 transition count 138
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 659 place count 165 transition count 138
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 741 place count 124 transition count 97
Free-agglomeration rule applied 20 times.
Iterating global reduction 3 with 20 rules applied. Total rules applied 761 place count 124 transition count 77
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 781 place count 104 transition count 77
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 782 place count 103 transition count 76
Reduce places removed 17 places and 0 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 4 with 36 rules applied. Total rules applied 818 place count 86 transition count 57
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 5 with 19 rules applied. Total rules applied 837 place count 67 transition count 57
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 14 Pre rules applied. Total rules applied 837 place count 67 transition count 43
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 865 place count 53 transition count 43
Applied a total of 865 rules in 92 ms. Remains 53 /482 variables (removed 429) and now considering 43/480 (removed 437) transitions.
Finished structural reductions, in 1 iterations. Remains : 53/482 places, 43/480 transitions.
Finished random walk after 41 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=20 )
Able to resolve query StableMarking after proving 197 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK MARKED_SUFFIX_TEST TOPOLOGICAL
Total runtime 43166 ms.

BK_STOP 1652772810281

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ StableMarking = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination StableMarking -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="AutoFlight-PT-05b"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is AutoFlight-PT-05b, 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 r016-tajo-165245743500278"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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