Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r042-tajo-167813696000590.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is BusinessProcesses-PT-18, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813696000590
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 6.3K Feb 25 16:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 25 16:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 29K Feb 25 16:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Feb 25 16:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 16:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 16:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 177K Mar 5 18:22 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-18-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678734910961

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-18
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 19:15:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 19:15:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 19:15:12] [INFO ] Load time of PNML (sax parser for PT used): 62 ms
[2023-03-13 19:15:12] [INFO ] Transformed 717 places.
[2023-03-13 19:15:12] [INFO ] Transformed 642 transitions.
[2023-03-13 19:15:12] [INFO ] Found NUPN structural information;
[2023-03-13 19:15:12] [INFO ] Parsed PT model containing 717 places and 642 transitions and 1860 arcs in 125 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 15 places in 15 ms
Reduce places removed 15 places and 15 transitions.
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 49 resets, run finished after 351 ms. (steps per millisecond=28 ) properties (out of 12) seen :8
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 627 rows 702 cols
[2023-03-13 19:15:13] [INFO ] Computed 114 place invariants in 55 ms
[2023-03-13 19:15:13] [INFO ] After 335ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 19:15:13] [INFO ] [Nat]Absence check using 73 positive place invariants in 21 ms returned sat
[2023-03-13 19:15:13] [INFO ] [Nat]Absence check using 73 positive and 41 generalized place invariants in 8 ms returned sat
[2023-03-13 19:15:14] [INFO ] After 385ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 19:15:14] [INFO ] Deduced a trap composed of 12 places in 130 ms of which 7 ms to minimize.
[2023-03-13 19:15:14] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 1 ms to minimize.
[2023-03-13 19:15:14] [INFO ] Deduced a trap composed of 20 places in 130 ms of which 3 ms to minimize.
[2023-03-13 19:15:14] [INFO ] Deduced a trap composed of 15 places in 175 ms of which 2 ms to minimize.
[2023-03-13 19:15:15] [INFO ] Deduced a trap composed of 17 places in 128 ms of which 0 ms to minimize.
[2023-03-13 19:15:15] [INFO ] Deduced a trap composed of 25 places in 135 ms of which 0 ms to minimize.
[2023-03-13 19:15:15] [INFO ] Deduced a trap composed of 24 places in 134 ms of which 3 ms to minimize.
[2023-03-13 19:15:15] [INFO ] Deduced a trap composed of 38 places in 144 ms of which 1 ms to minimize.
[2023-03-13 19:15:15] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 0 ms to minimize.
[2023-03-13 19:15:15] [INFO ] Deduced a trap composed of 27 places in 108 ms of which 0 ms to minimize.
[2023-03-13 19:15:15] [INFO ] Deduced a trap composed of 29 places in 143 ms of which 1 ms to minimize.
[2023-03-13 19:15:16] [INFO ] Deduced a trap composed of 32 places in 108 ms of which 0 ms to minimize.
[2023-03-13 19:15:16] [INFO ] Deduced a trap composed of 27 places in 117 ms of which 1 ms to minimize.
[2023-03-13 19:15:16] [INFO ] Deduced a trap composed of 36 places in 166 ms of which 1 ms to minimize.
[2023-03-13 19:15:16] [INFO ] Deduced a trap composed of 65 places in 144 ms of which 0 ms to minimize.
[2023-03-13 19:15:16] [INFO ] Deduced a trap composed of 33 places in 182 ms of which 1 ms to minimize.
[2023-03-13 19:15:17] [INFO ] Deduced a trap composed of 40 places in 159 ms of which 0 ms to minimize.
[2023-03-13 19:15:17] [INFO ] Deduced a trap composed of 62 places in 140 ms of which 1 ms to minimize.
[2023-03-13 19:15:17] [INFO ] Deduced a trap composed of 67 places in 118 ms of which 1 ms to minimize.
[2023-03-13 19:15:17] [INFO ] Deduced a trap composed of 60 places in 85 ms of which 0 ms to minimize.
[2023-03-13 19:15:17] [INFO ] Deduced a trap composed of 57 places in 85 ms of which 0 ms to minimize.
[2023-03-13 19:15:17] [INFO ] Deduced a trap composed of 52 places in 86 ms of which 0 ms to minimize.
[2023-03-13 19:15:17] [INFO ] Deduced a trap composed of 68 places in 80 ms of which 1 ms to minimize.
[2023-03-13 19:15:17] [INFO ] Deduced a trap composed of 70 places in 79 ms of which 0 ms to minimize.
[2023-03-13 19:15:17] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 3676 ms
[2023-03-13 19:15:18] [INFO ] Deduced a trap composed of 8 places in 113 ms of which 1 ms to minimize.
[2023-03-13 19:15:18] [INFO ] Deduced a trap composed of 47 places in 111 ms of which 1 ms to minimize.
[2023-03-13 19:15:18] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 1 ms to minimize.
[2023-03-13 19:15:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 414 ms
[2023-03-13 19:15:18] [INFO ] Deduced a trap composed of 11 places in 185 ms of which 0 ms to minimize.
[2023-03-13 19:15:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 218 ms
[2023-03-13 19:15:18] [INFO ] After 4869ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 117 ms.
[2023-03-13 19:15:18] [INFO ] After 5238ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 47 ms.
Support contains 20 out of 702 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 627/627 transitions.
Graph (trivial) has 393 edges and 702 vertex of which 7 / 702 are part of one of the 1 SCC in 9 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1410 edges and 696 vertex of which 688 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.4 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 151 transitions
Trivial Post-agglo rules discarded 151 transitions
Performed 151 trivial Post agglomeration. Transition count delta: 151
Iterating post reduction 0 with 151 rules applied. Total rules applied 153 place count 688 transition count 467
Reduce places removed 151 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 156 rules applied. Total rules applied 309 place count 537 transition count 462
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 314 place count 532 transition count 462
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 99 Pre rules applied. Total rules applied 314 place count 532 transition count 363
Deduced a syphon composed of 99 places in 2 ms
Ensure Unique test removed 22 places
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 3 with 220 rules applied. Total rules applied 534 place count 411 transition count 363
Discarding 86 places :
Symmetric choice reduction at 3 with 86 rule applications. Total rules 620 place count 325 transition count 277
Iterating global reduction 3 with 86 rules applied. Total rules applied 706 place count 325 transition count 277
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 706 place count 325 transition count 267
Deduced a syphon composed of 10 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 23 rules applied. Total rules applied 729 place count 312 transition count 267
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 730 place count 311 transition count 266
Iterating global reduction 3 with 1 rules applied. Total rules applied 731 place count 311 transition count 266
Performed 104 Post agglomeration using F-continuation condition.Transition count delta: 104
Deduced a syphon composed of 104 places in 1 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 3 with 208 rules applied. Total rules applied 939 place count 207 transition count 162
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 941 place count 206 transition count 165
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 942 place count 206 transition count 164
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 943 place count 205 transition count 164
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 947 place count 205 transition count 164
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 948 place count 204 transition count 163
Applied a total of 948 rules in 267 ms. Remains 204 /702 variables (removed 498) and now considering 163/627 (removed 464) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 268 ms. Remains : 204/702 places, 163/627 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 3) seen :2
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 163 rows 204 cols
[2023-03-13 19:15:19] [INFO ] Computed 82 place invariants in 7 ms
[2023-03-13 19:15:19] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 19:15:19] [INFO ] [Nat]Absence check using 65 positive place invariants in 12 ms returned sat
[2023-03-13 19:15:19] [INFO ] [Nat]Absence check using 65 positive and 17 generalized place invariants in 4 ms returned sat
[2023-03-13 19:15:19] [INFO ] After 52ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 19:15:19] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-13 19:15:19] [INFO ] After 9ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 19:15:19] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2023-03-13 19:15:19] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2023-03-13 19:15:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 68 ms
[2023-03-13 19:15:19] [INFO ] After 88ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-13 19:15:19] [INFO ] After 207ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 17 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=17 )
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 0 ms.
All properties solved without resorting to model-checking.
Total runtime 7298 ms.
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: BusinessProcesses_PT_18
(NrP: 717 NrTr: 642 NrArc: 1860)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.036sec

net check time: 0m 0.000sec

init dd package: 0m 3.151sec


before gc: list nodes free: 84169

after gc: idd nodes used:35400431, unused:28599569; list nodes free:119237855

RS generation: 36m32.816sec


-> last computed set: #nodes 35399784 (3.5e+07) #states 107,934,411,767,414,285 (17)


CANNOT_COMPUTE


BK_STOP 1678737143506

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
found
The net has a maximal unmarked siphon:
p69
p279
p275
p282
p284
p361
p278
p280
p331
p276
p366
p283
p351
p274
p70

The net has transition(s) that can never fire:
t513
t514
t515
t466
t467
t282
t286
t294
t309
t316
t317
t319
t320
t322
t323

check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.002sec

idd.cc:820: DD Exception: No free nodes

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-18"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marciexred"
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-5348"
echo " Executing tool marciexred"
echo " Input is BusinessProcesses-PT-18, 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 r042-tajo-167813696000590"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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