fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r106-tall-167814483100710
Last Updated
May 14, 2023

About the Execution of Marcie+red for DLCround-PT-08b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
9672.451 3600000.00 3651452.00 9233.70 TTTFFTTFTTFTTFFT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r106-tall-167814483100710.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is DLCround-PT-08b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r106-tall-167814483100710
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 5.8K Feb 25 18:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Feb 25 18:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 25 18:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 25 18:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 18:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 25 18:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 18:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 18:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.1M 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 DLCround-PT-08b-ReachabilityCardinality-00
FORMULA_NAME DLCround-PT-08b-ReachabilityCardinality-01
FORMULA_NAME DLCround-PT-08b-ReachabilityCardinality-02
FORMULA_NAME DLCround-PT-08b-ReachabilityCardinality-03
FORMULA_NAME DLCround-PT-08b-ReachabilityCardinality-04
FORMULA_NAME DLCround-PT-08b-ReachabilityCardinality-05
FORMULA_NAME DLCround-PT-08b-ReachabilityCardinality-06
FORMULA_NAME DLCround-PT-08b-ReachabilityCardinality-07
FORMULA_NAME DLCround-PT-08b-ReachabilityCardinality-08
FORMULA_NAME DLCround-PT-08b-ReachabilityCardinality-09
FORMULA_NAME DLCround-PT-08b-ReachabilityCardinality-10
FORMULA_NAME DLCround-PT-08b-ReachabilityCardinality-11
FORMULA_NAME DLCround-PT-08b-ReachabilityCardinality-12
FORMULA_NAME DLCround-PT-08b-ReachabilityCardinality-13
FORMULA_NAME DLCround-PT-08b-ReachabilityCardinality-14
FORMULA_NAME DLCround-PT-08b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678459023078

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=DLCround-PT-08b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-10 14:37:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-10 14:37:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 14:37:04] [INFO ] Load time of PNML (sax parser for PT used): 168 ms
[2023-03-10 14:37:04] [INFO ] Transformed 3088 places.
[2023-03-10 14:37:04] [INFO ] Transformed 4732 transitions.
[2023-03-10 14:37:04] [INFO ] Found NUPN structural information;
[2023-03-10 14:37:04] [INFO ] Parsed PT model containing 3088 places and 4732 transitions and 13004 arcs in 348 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 574 ms. (steps per millisecond=17 ) properties (out of 16) seen :8
FORMULA DLCround-PT-08b-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-08b-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-08b-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-08b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-08b-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-08b-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-08b-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-08b-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 8) seen :1
FORMULA DLCround-PT-08b-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 4732 rows 3088 cols
[2023-03-10 14:37:05] [INFO ] Computed 157 place invariants in 45 ms
[2023-03-10 14:37:07] [INFO ] After 1033ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-10 14:37:08] [INFO ] [Nat]Absence check using 157 positive place invariants in 136 ms returned sat
[2023-03-10 14:37:10] [INFO ] After 2451ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :6
[2023-03-10 14:37:11] [INFO ] Deduced a trap composed of 198 places in 729 ms of which 10 ms to minimize.
[2023-03-10 14:37:12] [INFO ] Deduced a trap composed of 205 places in 651 ms of which 1 ms to minimize.
[2023-03-10 14:37:13] [INFO ] Deduced a trap composed of 224 places in 580 ms of which 1 ms to minimize.
[2023-03-10 14:37:13] [INFO ] Deduced a trap composed of 227 places in 485 ms of which 1 ms to minimize.
[2023-03-10 14:37:14] [INFO ] Deduced a trap composed of 228 places in 506 ms of which 2 ms to minimize.
[2023-03-10 14:37:14] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3735 ms
[2023-03-10 14:37:16] [INFO ] After 7646ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :6
Attempting to minimize the solution found.
Minimization took 764 ms.
[2023-03-10 14:37:16] [INFO ] After 9731ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :6
FORMULA DLCround-PT-08b-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 6 different solutions.
FORMULA DLCround-PT-08b-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DLCround-PT-08b-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DLCround-PT-08b-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DLCround-PT-08b-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 4 properties in 194 ms.
Support contains 18 out of 3088 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3088/3088 places, 4732/4732 transitions.
Graph (trivial) has 2855 edges and 3088 vertex of which 539 / 3088 are part of one of the 40 SCC in 11 ms
Free SCC test removed 499 places
Drop transitions removed 559 transitions
Reduce isomorphic transitions removed 559 transitions.
Drop transitions removed 1124 transitions
Trivial Post-agglo rules discarded 1124 transitions
Performed 1124 trivial Post agglomeration. Transition count delta: 1124
Iterating post reduction 0 with 1124 rules applied. Total rules applied 1125 place count 2589 transition count 3049
Reduce places removed 1124 places and 0 transitions.
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 1 with 1193 rules applied. Total rules applied 2318 place count 1465 transition count 2980
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 38 rules applied. Total rules applied 2356 place count 1435 transition count 2972
Reduce places removed 4 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 3 with 11 rules applied. Total rules applied 2367 place count 1431 transition count 2965
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 2374 place count 1424 transition count 2965
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 2374 place count 1424 transition count 2958
Deduced a syphon composed of 7 places in 10 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 2388 place count 1417 transition count 2958
Discarding 391 places :
Symmetric choice reduction at 5 with 391 rule applications. Total rules 2779 place count 1026 transition count 2567
Iterating global reduction 5 with 391 rules applied. Total rules applied 3170 place count 1026 transition count 2567
Performed 169 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 169 Pre rules applied. Total rules applied 3170 place count 1026 transition count 2398
Deduced a syphon composed of 169 places in 18 ms
Reduce places removed 169 places and 0 transitions.
Iterating global reduction 5 with 338 rules applied. Total rules applied 3508 place count 857 transition count 2398
Discarding 65 places :
Symmetric choice reduction at 5 with 65 rule applications. Total rules 3573 place count 792 transition count 1636
Iterating global reduction 5 with 65 rules applied. Total rules applied 3638 place count 792 transition count 1636
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 5 with 22 rules applied. Total rules applied 3660 place count 792 transition count 1614
Performed 208 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 208 places in 1 ms
Reduce places removed 208 places and 0 transitions.
Iterating global reduction 6 with 416 rules applied. Total rules applied 4076 place count 584 transition count 1398
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 4084 place count 584 transition count 1390
Renaming transitions due to excessive name length > 1024 char.
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -385
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 7 with 82 rules applied. Total rules applied 4166 place count 543 transition count 1775
Drop transitions removed 18 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 7 with 22 rules applied. Total rules applied 4188 place count 543 transition count 1753
Discarding 18 places :
Symmetric choice reduction at 8 with 18 rule applications. Total rules 4206 place count 525 transition count 1338
Iterating global reduction 8 with 18 rules applied. Total rules applied 4224 place count 525 transition count 1338
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 8 with 16 rules applied. Total rules applied 4240 place count 525 transition count 1322
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 4248 place count 521 transition count 1352
Drop transitions removed 147 transitions
Redundant transition composition rules discarded 147 transitions
Iterating global reduction 9 with 147 rules applied. Total rules applied 4395 place count 521 transition count 1205
Discarding 9 places :
Symmetric choice reduction at 9 with 9 rule applications. Total rules 4404 place count 512 transition count 1095
Iterating global reduction 9 with 9 rules applied. Total rules applied 4413 place count 512 transition count 1095
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 9 with 8 rules applied. Total rules applied 4421 place count 512 transition count 1087
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 4425 place count 510 transition count 1105
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 4426 place count 510 transition count 1104
Free-agglomeration rule applied 305 times with reduction of 168 identical transitions.
Iterating global reduction 10 with 305 rules applied. Total rules applied 4731 place count 510 transition count 631
Reduce places removed 305 places and 0 transitions.
Drop transitions removed 327 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 331 transitions.
Graph (complete) has 460 edges and 205 vertex of which 161 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.1 ms
Discarding 44 places :
Also discarding 12 output transitions
Drop transitions removed 12 transitions
Iterating post reduction 10 with 637 rules applied. Total rules applied 5368 place count 161 transition count 288
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 5374 place count 161 transition count 282
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 5374 place count 161 transition count 281
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 5376 place count 160 transition count 281
Discarding 62 places :
Symmetric choice reduction at 12 with 62 rule applications. Total rules 5438 place count 98 transition count 189
Iterating global reduction 12 with 62 rules applied. Total rules applied 5500 place count 98 transition count 189
Drop transitions removed 31 transitions
Redundant transition composition rules discarded 31 transitions
Iterating global reduction 12 with 31 rules applied. Total rules applied 5531 place count 98 transition count 158
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 5532 place count 97 transition count 158
Discarding 7 places :
Symmetric choice reduction at 13 with 7 rule applications. Total rules 5539 place count 90 transition count 150
Iterating global reduction 13 with 7 rules applied. Total rules applied 5546 place count 90 transition count 150
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 5548 place count 89 transition count 153
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 5552 place count 89 transition count 149
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 14 with 1 rules applied. Total rules applied 5553 place count 89 transition count 152
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 14 with 5 rules applied. Total rules applied 5558 place count 88 transition count 148
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 5559 place count 88 transition count 148
Applied a total of 5559 rules in 773 ms. Remains 88 /3088 variables (removed 3000) and now considering 148/4732 (removed 4584) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 774 ms. Remains : 88/3088 places, 148/4732 transitions.
Finished random walk after 646 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=129 )
FORMULA DLCround-PT-08b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-08b-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 13252 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: DLCround_PT_08b
(NrP: 3088 NrTr: 4732 NrArc: 13004)

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

net check time: 0m 0.007sec

init dd package: 0m 2.770sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 6479124 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16100076 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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
ok
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.082sec

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="DLCround-PT-08b"
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 DLCround-PT-08b, 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 r106-tall-167814483100710"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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