Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r024-tall-165251918500406.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BusinessProcesses-PT-11, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918500406
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 6.5K Apr 29 23:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 29 23:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 29 23:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 29 23:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 30 00:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Apr 30 00:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Apr 29 23:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Apr 29 23:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 141K 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

here is the order used to build the result vector(from text file)
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654200605813

Running Version 202205111006
[2022-06-02 20:10:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -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, 3600]
[2022-06-02 20:10:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-02 20:10:07] [INFO ] Load time of PNML (sax parser for PT used): 124 ms
[2022-06-02 20:10:07] [INFO ] Transformed 567 places.
[2022-06-02 20:10:07] [INFO ] Transformed 508 transitions.
[2022-06-02 20:10:07] [INFO ] Found NUPN structural information;
[2022-06-02 20:10:07] [INFO ] Parsed PT model containing 567 places and 508 transitions in 245 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 7 places in 14 ms
Reduce places removed 7 places and 7 transitions.
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 76 resets, run finished after 626 ms. (steps per millisecond=15 ) properties (out of 14) seen :4
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 501 rows 560 cols
[2022-06-02 20:10:08] [INFO ] Computed 95 place invariants in 47 ms
[2022-06-02 20:10:09] [INFO ] [Real]Absence check using 53 positive place invariants in 21 ms returned sat
[2022-06-02 20:10:09] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 14 ms returned sat
[2022-06-02 20:10:09] [INFO ] After 452ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:9
[2022-06-02 20:10:09] [INFO ] [Nat]Absence check using 53 positive place invariants in 21 ms returned sat
[2022-06-02 20:10:09] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 13 ms returned sat
[2022-06-02 20:10:10] [INFO ] After 633ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :5
[2022-06-02 20:10:10] [INFO ] Deduced a trap composed of 34 places in 111 ms of which 7 ms to minimize.
[2022-06-02 20:10:10] [INFO ] Deduced a trap composed of 8 places in 118 ms of which 1 ms to minimize.
[2022-06-02 20:10:10] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 1 ms to minimize.
[2022-06-02 20:10:11] [INFO ] Deduced a trap composed of 12 places in 167 ms of which 1 ms to minimize.
[2022-06-02 20:10:11] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 1 ms to minimize.
[2022-06-02 20:10:11] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 1 ms to minimize.
[2022-06-02 20:10:11] [INFO ] Deduced a trap composed of 24 places in 121 ms of which 1 ms to minimize.
[2022-06-02 20:10:11] [INFO ] Deduced a trap composed of 46 places in 116 ms of which 1 ms to minimize.
[2022-06-02 20:10:11] [INFO ] Deduced a trap composed of 47 places in 82 ms of which 0 ms to minimize.
[2022-06-02 20:10:11] [INFO ] Deduced a trap composed of 49 places in 62 ms of which 0 ms to minimize.
[2022-06-02 20:10:11] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 1 ms to minimize.
[2022-06-02 20:10:11] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1481 ms
[2022-06-02 20:10:12] [INFO ] Deduced a trap composed of 128 places in 136 ms of which 1 ms to minimize.
[2022-06-02 20:10:12] [INFO ] Deduced a trap composed of 32 places in 141 ms of which 0 ms to minimize.
[2022-06-02 20:10:12] [INFO ] Deduced a trap composed of 31 places in 144 ms of which 0 ms to minimize.
[2022-06-02 20:10:12] [INFO ] Deduced a trap composed of 28 places in 164 ms of which 0 ms to minimize.
[2022-06-02 20:10:13] [INFO ] Deduced a trap composed of 27 places in 157 ms of which 1 ms to minimize.
[2022-06-02 20:10:13] [INFO ] Deduced a trap composed of 27 places in 150 ms of which 1 ms to minimize.
[2022-06-02 20:10:13] [INFO ] Deduced a trap composed of 128 places in 154 ms of which 1 ms to minimize.
[2022-06-02 20:10:13] [INFO ] Deduced a trap composed of 130 places in 160 ms of which 1 ms to minimize.
[2022-06-02 20:10:13] [INFO ] Deduced a trap composed of 51 places in 131 ms of which 1 ms to minimize.
[2022-06-02 20:10:14] [INFO ] Deduced a trap composed of 135 places in 207 ms of which 1 ms to minimize.
[2022-06-02 20:10:14] [INFO ] Deduced a trap composed of 134 places in 137 ms of which 0 ms to minimize.
[2022-06-02 20:10:14] [INFO ] Deduced a trap composed of 135 places in 139 ms of which 0 ms to minimize.
[2022-06-02 20:10:14] [INFO ] Deduced a trap composed of 132 places in 134 ms of which 1 ms to minimize.
[2022-06-02 20:10:14] [INFO ] Deduced a trap composed of 129 places in 138 ms of which 1 ms to minimize.
[2022-06-02 20:10:14] [INFO ] Deduced a trap composed of 127 places in 134 ms of which 0 ms to minimize.
[2022-06-02 20:10:15] [INFO ] Deduced a trap composed of 134 places in 135 ms of which 1 ms to minimize.
[2022-06-02 20:10:15] [INFO ] Deduced a trap composed of 121 places in 128 ms of which 0 ms to minimize.
[2022-06-02 20:10:15] [INFO ] Deduced a trap composed of 116 places in 128 ms of which 1 ms to minimize.
[2022-06-02 20:10:15] [INFO ] Deduced a trap composed of 138 places in 129 ms of which 1 ms to minimize.
[2022-06-02 20:10:15] [INFO ] Deduced a trap composed of 135 places in 131 ms of which 1 ms to minimize.
[2022-06-02 20:10:15] [INFO ] Deduced a trap composed of 127 places in 133 ms of which 0 ms to minimize.
[2022-06-02 20:10:15] [INFO ] Deduced a trap composed of 126 places in 131 ms of which 1 ms to minimize.
[2022-06-02 20:10:16] [INFO ] Deduced a trap composed of 130 places in 130 ms of which 1 ms to minimize.
[2022-06-02 20:10:16] [INFO ] Deduced a trap composed of 37 places in 137 ms of which 2 ms to minimize.
[2022-06-02 20:10:16] [INFO ] Deduced a trap composed of 46 places in 129 ms of which 0 ms to minimize.
[2022-06-02 20:10:16] [INFO ] Deduced a trap composed of 125 places in 125 ms of which 0 ms to minimize.
[2022-06-02 20:10:16] [INFO ] Deduced a trap composed of 139 places in 132 ms of which 1 ms to minimize.
[2022-06-02 20:10:17] [INFO ] Deduced a trap composed of 116 places in 128 ms of which 0 ms to minimize.
[2022-06-02 20:10:17] [INFO ] Deduced a trap composed of 125 places in 124 ms of which 2 ms to minimize.
[2022-06-02 20:10:17] [INFO ] Deduced a trap composed of 127 places in 128 ms of which 1 ms to minimize.
[2022-06-02 20:10:17] [INFO ] Deduced a trap composed of 143 places in 125 ms of which 0 ms to minimize.
[2022-06-02 20:10:17] [INFO ] Deduced a trap composed of 126 places in 128 ms of which 0 ms to minimize.
[2022-06-02 20:10:17] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 5742 ms
[2022-06-02 20:10:17] [INFO ] Deduced a trap composed of 28 places in 121 ms of which 1 ms to minimize.
[2022-06-02 20:10:18] [INFO ] Deduced a trap composed of 37 places in 125 ms of which 1 ms to minimize.
[2022-06-02 20:10:18] [INFO ] Deduced a trap composed of 118 places in 124 ms of which 0 ms to minimize.
[2022-06-02 20:10:18] [INFO ] Deduced a trap composed of 38 places in 124 ms of which 0 ms to minimize.
[2022-06-02 20:10:18] [INFO ] Deduced a trap composed of 35 places in 131 ms of which 0 ms to minimize.
[2022-06-02 20:10:18] [INFO ] Deduced a trap composed of 113 places in 125 ms of which 0 ms to minimize.
[2022-06-02 20:10:18] [INFO ] Deduced a trap composed of 37 places in 83 ms of which 1 ms to minimize.
[2022-06-02 20:10:19] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 1 ms to minimize.
[2022-06-02 20:10:19] [INFO ] Deduced a trap composed of 47 places in 83 ms of which 0 ms to minimize.
[2022-06-02 20:10:19] [INFO ] Deduced a trap composed of 46 places in 81 ms of which 0 ms to minimize.
[2022-06-02 20:10:19] [INFO ] Deduced a trap composed of 48 places in 80 ms of which 1 ms to minimize.
[2022-06-02 20:10:19] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 0 ms to minimize.
[2022-06-02 20:10:19] [INFO ] Deduced a trap composed of 42 places in 50 ms of which 1 ms to minimize.
[2022-06-02 20:10:19] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1742 ms
[2022-06-02 20:10:19] [INFO ] After 10089ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :5
Attempting to minimize the solution found.
Minimization took 474 ms.
[2022-06-02 20:10:20] [INFO ] After 10845ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :5
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 5 different solutions.
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 1805 ms.
Support contains 15 out of 560 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 560/560 places, 501/501 transitions.
Graph (trivial) has 301 edges and 560 vertex of which 7 / 560 are part of one of the 1 SCC in 7 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1132 edges and 554 vertex of which 549 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Discarding 5 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 112 transitions
Trivial Post-agglo rules discarded 112 transitions
Performed 112 trivial Post agglomeration. Transition count delta: 112
Iterating post reduction 0 with 112 rules applied. Total rules applied 114 place count 549 transition count 380
Reduce places removed 112 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 118 rules applied. Total rules applied 232 place count 437 transition count 374
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 238 place count 431 transition count 374
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 85 Pre rules applied. Total rules applied 238 place count 431 transition count 289
Deduced a syphon composed of 85 places in 3 ms
Ensure Unique test removed 17 places
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 3 with 187 rules applied. Total rules applied 425 place count 329 transition count 289
Discarding 60 places :
Symmetric choice reduction at 3 with 60 rule applications. Total rules 485 place count 269 transition count 229
Iterating global reduction 3 with 60 rules applied. Total rules applied 545 place count 269 transition count 229
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 545 place count 269 transition count 227
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 549 place count 267 transition count 227
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 175 rules applied. Total rules applied 724 place count 178 transition count 141
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 726 place count 177 transition count 145
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 728 place count 177 transition count 143
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 730 place count 175 transition count 143
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 735 place count 175 transition count 143
Applied a total of 735 rules in 142 ms. Remains 175 /560 variables (removed 385) and now considering 143/501 (removed 358) transitions.
Finished structural reductions, in 1 iterations. Remains : 175/560 places, 143/501 transitions.
Finished random walk after 2208 steps, including 65 resets, run visited all 3 properties in 36 ms. (steps per millisecond=61 )
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 15244 ms.

BK_STOP 1654200622526

--------------------
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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 ReachabilityCardinality -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 3600 -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="BusinessProcesses-PT-11"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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 BusinessProcesses-PT-11, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r024-tall-165251918500406"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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