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-167813695900542.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-12, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813695900542
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 6.4K Feb 25 16:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Feb 25 16:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 16:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 16:48 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 17K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.5K Feb 25 16:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 25 16:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 25 16:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 16:49 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 146K 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-12-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678731852159

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-12
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 18:24:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 18:24:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 18:24:13] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2023-03-13 18:24:13] [INFO ] Transformed 586 places.
[2023-03-13 18:24:13] [INFO ] Transformed 525 transitions.
[2023-03-13 18:24:13] [INFO ] Found NUPN structural information;
[2023-03-13 18:24:13] [INFO ] Parsed PT model containing 586 places and 525 transitions and 1560 arcs in 124 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 4 places in 9 ms
Reduce places removed 4 places and 4 transitions.
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 73 resets, run finished after 410 ms. (steps per millisecond=24 ) properties (out of 13) seen :2
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 11) seen :2
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 9) seen :1
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 521 rows 582 cols
[2023-03-13 18:24:14] [INFO ] Computed 98 place invariants in 22 ms
[2023-03-13 18:24:15] [INFO ] [Real]Absence check using 55 positive place invariants in 16 ms returned sat
[2023-03-13 18:24:15] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 10 ms returned sat
[2023-03-13 18:24:15] [INFO ] After 398ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-13 18:24:15] [INFO ] [Nat]Absence check using 55 positive place invariants in 27 ms returned sat
[2023-03-13 18:24:15] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 18 ms returned sat
[2023-03-13 18:24:16] [INFO ] After 433ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :7
[2023-03-13 18:24:16] [INFO ] Deduced a trap composed of 14 places in 140 ms of which 6 ms to minimize.
[2023-03-13 18:24:16] [INFO ] Deduced a trap composed of 27 places in 104 ms of which 1 ms to minimize.
[2023-03-13 18:24:16] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 1 ms to minimize.
[2023-03-13 18:24:16] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 1 ms to minimize.
[2023-03-13 18:24:16] [INFO ] Deduced a trap composed of 30 places in 88 ms of which 1 ms to minimize.
[2023-03-13 18:24:16] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 0 ms to minimize.
[2023-03-13 18:24:16] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 1 ms to minimize.
[2023-03-13 18:24:17] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2023-03-13 18:24:17] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2023-03-13 18:24:17] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1028 ms
[2023-03-13 18:24:17] [INFO ] Deduced a trap composed of 87 places in 114 ms of which 1 ms to minimize.
[2023-03-13 18:24:17] [INFO ] Deduced a trap composed of 123 places in 109 ms of which 1 ms to minimize.
[2023-03-13 18:24:17] [INFO ] Deduced a trap composed of 121 places in 159 ms of which 1 ms to minimize.
[2023-03-13 18:24:17] [INFO ] Deduced a trap composed of 126 places in 162 ms of which 0 ms to minimize.
[2023-03-13 18:24:17] [INFO ] Deduced a trap composed of 130 places in 176 ms of which 0 ms to minimize.
[2023-03-13 18:24:18] [INFO ] Deduced a trap composed of 136 places in 132 ms of which 0 ms to minimize.
[2023-03-13 18:24:18] [INFO ] Deduced a trap composed of 134 places in 120 ms of which 1 ms to minimize.
[2023-03-13 18:24:18] [INFO ] Deduced a trap composed of 133 places in 94 ms of which 1 ms to minimize.
[2023-03-13 18:24:18] [INFO ] Deduced a trap composed of 132 places in 150 ms of which 0 ms to minimize.
[2023-03-13 18:24:18] [INFO ] Deduced a trap composed of 132 places in 131 ms of which 1 ms to minimize.
[2023-03-13 18:24:18] [INFO ] Deduced a trap composed of 139 places in 144 ms of which 1 ms to minimize.
[2023-03-13 18:24:19] [INFO ] Deduced a trap composed of 128 places in 130 ms of which 1 ms to minimize.
[2023-03-13 18:24:19] [INFO ] Deduced a trap composed of 130 places in 124 ms of which 1 ms to minimize.
[2023-03-13 18:24:19] [INFO ] Deduced a trap composed of 130 places in 123 ms of which 1 ms to minimize.
[2023-03-13 18:24:19] [INFO ] Deduced a trap composed of 122 places in 152 ms of which 1 ms to minimize.
[2023-03-13 18:24:19] [INFO ] Deduced a trap composed of 129 places in 155 ms of which 1 ms to minimize.
[2023-03-13 18:24:19] [INFO ] Deduced a trap composed of 135 places in 140 ms of which 1 ms to minimize.
[2023-03-13 18:24:20] [INFO ] Deduced a trap composed of 133 places in 127 ms of which 1 ms to minimize.
[2023-03-13 18:24:20] [INFO ] Deduced a trap composed of 132 places in 132 ms of which 1 ms to minimize.
[2023-03-13 18:24:20] [INFO ] Deduced a trap composed of 135 places in 129 ms of which 0 ms to minimize.
[2023-03-13 18:24:20] [INFO ] Deduced a trap composed of 129 places in 177 ms of which 0 ms to minimize.
[2023-03-13 18:24:20] [INFO ] Deduced a trap composed of 124 places in 166 ms of which 1 ms to minimize.
[2023-03-13 18:24:20] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 3805 ms
[2023-03-13 18:24:21] [INFO ] Deduced a trap composed of 132 places in 184 ms of which 1 ms to minimize.
[2023-03-13 18:24:21] [INFO ] Deduced a trap composed of 129 places in 174 ms of which 1 ms to minimize.
[2023-03-13 18:24:21] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 3 ms to minimize.
[2023-03-13 18:24:21] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 0 ms to minimize.
[2023-03-13 18:24:21] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 760 ms
[2023-03-13 18:24:22] [INFO ] Deduced a trap composed of 118 places in 166 ms of which 1 ms to minimize.
[2023-03-13 18:24:22] [INFO ] Deduced a trap composed of 24 places in 164 ms of which 1 ms to minimize.
[2023-03-13 18:24:22] [INFO ] Deduced a trap composed of 31 places in 163 ms of which 1 ms to minimize.
[2023-03-13 18:24:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 726 ms
[2023-03-13 18:24:22] [INFO ] After 7175ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :7
Attempting to minimize the solution found.
Minimization took 540 ms.
[2023-03-13 18:24:23] [INFO ] After 8003ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :7
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 6 different solutions.
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 182 ms.
Support contains 25 out of 582 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 582/582 places, 521/521 transitions.
Graph (trivial) has 304 edges and 582 vertex of which 7 / 582 are part of one of the 1 SCC in 11 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1178 edges and 576 vertex of which 572 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 113 transitions
Trivial Post-agglo rules discarded 113 transitions
Performed 113 trivial Post agglomeration. Transition count delta: 113
Iterating post reduction 0 with 113 rules applied. Total rules applied 115 place count 572 transition count 399
Reduce places removed 113 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 121 rules applied. Total rules applied 236 place count 459 transition count 391
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 244 place count 451 transition count 391
Performed 82 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 82 Pre rules applied. Total rules applied 244 place count 451 transition count 309
Deduced a syphon composed of 82 places in 1 ms
Ensure Unique test removed 14 places
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 422 place count 355 transition count 309
Discarding 65 places :
Symmetric choice reduction at 3 with 65 rule applications. Total rules 487 place count 290 transition count 244
Iterating global reduction 3 with 65 rules applied. Total rules applied 552 place count 290 transition count 244
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 552 place count 290 transition count 239
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 562 place count 285 transition count 239
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 1 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 3 with 174 rules applied. Total rules applied 736 place count 198 transition count 152
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 738 place count 197 transition count 156
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 740 place count 197 transition count 154
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 742 place count 195 transition count 154
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 743 place count 195 transition count 154
Applied a total of 743 rules in 154 ms. Remains 195 /582 variables (removed 387) and now considering 154/521 (removed 367) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 154 ms. Remains : 195/582 places, 154/521 transitions.
Incomplete random walk after 10000 steps, including 253 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 6) seen :5
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Finished Best-First random walk after 8551 steps, including 85 resets, run visited all 1 properties in 24 ms. (steps per millisecond=356 )
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 10000 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_12
(NrP: 586 NrTr: 525 NrArc: 1560)

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

net check time: 0m 0.000sec

init dd package: 0m 3.140sec


before gc: list nodes free: 1085825

after gc: idd nodes used:57304926, unused:6695074; list nodes free:28877795

RS generation: 44m22.837sec


-> last computed set: #nodes 57304352 (5.7e+07) #states 20,120,611,353,577 (13)


CANNOT_COMPUTE


BK_STOP 1678734568077

--------------------
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:
p282
p234
p233
p232

The net has transition(s) that can never fire:
t259
t258
t413
t244

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.001sec

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-12"
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-12, 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-167813695900542"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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