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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 13K Feb 26 06:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 117K Feb 26 06:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 06:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 06:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 15:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 07:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Feb 26 07:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 26 06:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Feb 26 06:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 16M 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 BugTracking-PT-q3m008-ReachabilityCardinality-00
FORMULA_NAME BugTracking-PT-q3m008-ReachabilityCardinality-01
FORMULA_NAME BugTracking-PT-q3m008-ReachabilityCardinality-02
FORMULA_NAME BugTracking-PT-q3m008-ReachabilityCardinality-03
FORMULA_NAME BugTracking-PT-q3m008-ReachabilityCardinality-04
FORMULA_NAME BugTracking-PT-q3m008-ReachabilityCardinality-05
FORMULA_NAME BugTracking-PT-q3m008-ReachabilityCardinality-06
FORMULA_NAME BugTracking-PT-q3m008-ReachabilityCardinality-07
FORMULA_NAME BugTracking-PT-q3m008-ReachabilityCardinality-08
FORMULA_NAME BugTracking-PT-q3m008-ReachabilityCardinality-09
FORMULA_NAME BugTracking-PT-q3m008-ReachabilityCardinality-10
FORMULA_NAME BugTracking-PT-q3m008-ReachabilityCardinality-11
FORMULA_NAME BugTracking-PT-q3m008-ReachabilityCardinality-12
FORMULA_NAME BugTracking-PT-q3m008-ReachabilityCardinality-13
FORMULA_NAME BugTracking-PT-q3m008-ReachabilityCardinality-14
FORMULA_NAME BugTracking-PT-q3m008-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678713180210

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=BugTracking-PT-q3m008
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 13:13:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 13:13:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 13:13:03] [INFO ] Load time of PNML (sax parser for PT used): 872 ms
[2023-03-13 13:13:03] [INFO ] Transformed 754 places.
[2023-03-13 13:13:03] [INFO ] Transformed 27370 transitions.
[2023-03-13 13:13:03] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1099 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 514 places in 129 ms
Reduce places removed 514 places and 24601 transitions.
FORMULA BugTracking-PT-q3m008-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m008-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m008-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m008-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m008-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m008-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m008-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m008-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m008-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m008-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m008-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m008-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 64 resets, run finished after 284 ms. (steps per millisecond=35 ) properties (out of 4) seen :1
FORMULA BugTracking-PT-q3m008-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 30 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-13 13:13:04] [INFO ] Flow matrix only has 2642 transitions (discarded 127 similar events)
// Phase 1: matrix 2642 rows 240 cols
[2023-03-13 13:13:04] [INFO ] Computed 10 place invariants in 31 ms
[2023-03-13 13:13:04] [INFO ] After 229ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 13:13:04] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-13 13:13:05] [INFO ] After 515ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-13 13:13:05] [INFO ] State equation strengthened by 255 read => feed constraints.
[2023-03-13 13:13:05] [INFO ] After 451ms SMT Verify possible using 255 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2023-03-13 13:13:06] [INFO ] Deduced a trap composed of 13 places in 350 ms of which 25 ms to minimize.
[2023-03-13 13:13:06] [INFO ] Deduced a trap composed of 21 places in 172 ms of which 1 ms to minimize.
[2023-03-13 13:13:06] [INFO ] Deduced a trap composed of 12 places in 274 ms of which 2 ms to minimize.
[2023-03-13 13:13:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1120 ms
[2023-03-13 13:13:07] [INFO ] Deduced a trap composed of 18 places in 307 ms of which 2 ms to minimize.
[2023-03-13 13:13:07] [INFO ] Deduced a trap composed of 8 places in 322 ms of which 2 ms to minimize.
[2023-03-13 13:13:08] [INFO ] Deduced a trap composed of 11 places in 397 ms of which 1 ms to minimize.
[2023-03-13 13:13:08] [INFO ] Deduced a trap composed of 9 places in 251 ms of which 1 ms to minimize.
[2023-03-13 13:13:08] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1810 ms
[2023-03-13 13:13:08] [INFO ] After 3793ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 495 ms.
[2023-03-13 13:13:09] [INFO ] After 4951ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
FORMULA BugTracking-PT-q3m008-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 354 ms.
Support contains 9 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 2769/2769 transitions.
Graph (complete) has 3422 edges and 240 vertex of which 238 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.11 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 237 transition count 2750
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 237 transition count 2750
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 16 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 235 transition count 2753
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 235 transition count 2747
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 19 place count 229 transition count 2747
Applied a total of 19 rules in 571 ms. Remains 229 /240 variables (removed 11) and now considering 2747/2769 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 573 ms. Remains : 229/240 places, 2747/2769 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 327 ms. (steps per millisecond=30 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 142446 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :{}
Probabilistic random walk after 142446 steps, saw 60188 distinct states, run finished after 3003 ms. (steps per millisecond=47 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-13 13:13:13] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-13 13:13:14] [INFO ] Computed 8 place invariants in 32 ms
[2023-03-13 13:13:14] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 13:13:14] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-13 13:13:15] [INFO ] After 1088ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 13:13:15] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-13 13:13:15] [INFO ] After 615ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 13:13:16] [INFO ] Deduced a trap composed of 8 places in 177 ms of which 1 ms to minimize.
[2023-03-13 13:13:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 315 ms
[2023-03-13 13:13:17] [INFO ] Deduced a trap composed of 9 places in 320 ms of which 1 ms to minimize.
[2023-03-13 13:13:17] [INFO ] Deduced a trap composed of 10 places in 244 ms of which 1 ms to minimize.
[2023-03-13 13:13:17] [INFO ] Deduced a trap composed of 11 places in 190 ms of which 0 ms to minimize.
[2023-03-13 13:13:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1011 ms
[2023-03-13 13:13:17] [INFO ] After 2402ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 300 ms.
[2023-03-13 13:13:18] [INFO ] After 3944ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 9 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 71 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 76 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2023-03-13 13:13:18] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-13 13:13:18] [INFO ] Invariant cache hit.
[2023-03-13 13:13:18] [INFO ] Implicit Places using invariants in 388 ms returned []
[2023-03-13 13:13:18] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-13 13:13:18] [INFO ] Invariant cache hit.
[2023-03-13 13:13:19] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-13 13:13:19] [INFO ] Implicit Places using invariants and state equation in 1368 ms returned []
Implicit Place search using SMT with State Equation took 1758 ms to find 0 implicit places.
[2023-03-13 13:13:20] [INFO ] Redundant transitions in 217 ms returned []
[2023-03-13 13:13:20] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-13 13:13:20] [INFO ] Invariant cache hit.
[2023-03-13 13:13:21] [INFO ] Dead Transitions using invariants and state equation in 987 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3052 ms. Remains : 229/229 places, 2747/2747 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 130 transitions.
Iterating post reduction 0 with 130 rules applied. Total rules applied 130 place count 229 transition count 2617
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 132 place count 228 transition count 2616
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 133 place count 228 transition count 2615
Free-agglomeration rule applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 138 place count 228 transition count 2610
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 143 place count 223 transition count 2610
Applied a total of 143 rules in 390 ms. Remains 223 /229 variables (removed 6) and now considering 2610/2747 (removed 137) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 2610 rows 223 cols
[2023-03-13 13:13:21] [INFO ] Computed 9 place invariants in 33 ms
[2023-03-13 13:13:21] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 13:13:21] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2023-03-13 13:13:22] [INFO ] After 514ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 13:13:22] [INFO ] After 817ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 164 ms.
[2023-03-13 13:13:22] [INFO ] After 1035ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-13 13:13:22] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 5 ms.
[2023-03-13 13:13:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 229 places, 2747 transitions and 13485 arcs took 20 ms.
[2023-03-13 13:13:23] [INFO ] Flatten gal took : 326 ms
Total runtime 21061 ms.
There are residual formulas that ITS could not solve within timeout
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: BugTracking_PT_q3
(NrP: 229 NrTr: 2747 NrArc: 13485)

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

net check time: 0m 0.003sec

init dd package: 0m 3.166sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 10337948 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16080000 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:
++ 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
++ sed s/.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.041sec

7017 13621 18363 22930 28626 36939 43147 49339 57033 64940 72747 76172 80694 86898 90186 94206 97650 114013 124299 130893 125791 124901 130597 147256 153442 159656 170453 181356 191303 189806 191867 198071 197828 199601 200477 227540 241571 248165 233219 226956 232568 257573 263759 269973

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="BugTracking-PT-q3m008"
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 BugTracking-PT-q3m008, 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-167813695600342"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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