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.r523-tall-167987247900327.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 smartxred
Input is Murphy-COL-D4N050, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r523-tall-167987247900327
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 396K
-rw-r--r-- 1 mcc users 5.7K Mar 23 15:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Mar 23 15:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K Mar 23 15:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 33K Mar 23 15:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 12K Mar 23 15:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Mar 23 15:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Mar 23 15:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K Mar 23 15:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 20K Mar 31 16:48 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 Murphy-COL-D4N050-ReachabilityFireability-00
FORMULA_NAME Murphy-COL-D4N050-ReachabilityFireability-01
FORMULA_NAME Murphy-COL-D4N050-ReachabilityFireability-02
FORMULA_NAME Murphy-COL-D4N050-ReachabilityFireability-03
FORMULA_NAME Murphy-COL-D4N050-ReachabilityFireability-04
FORMULA_NAME Murphy-COL-D4N050-ReachabilityFireability-05
FORMULA_NAME Murphy-COL-D4N050-ReachabilityFireability-06
FORMULA_NAME Murphy-COL-D4N050-ReachabilityFireability-07
FORMULA_NAME Murphy-COL-D4N050-ReachabilityFireability-08
FORMULA_NAME Murphy-COL-D4N050-ReachabilityFireability-09
FORMULA_NAME Murphy-COL-D4N050-ReachabilityFireability-10
FORMULA_NAME Murphy-COL-D4N050-ReachabilityFireability-11
FORMULA_NAME Murphy-COL-D4N050-ReachabilityFireability-12
FORMULA_NAME Murphy-COL-D4N050-ReachabilityFireability-13
FORMULA_NAME Murphy-COL-D4N050-ReachabilityFireability-14
FORMULA_NAME Murphy-COL-D4N050-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1680837238338

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=smartxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Murphy-COL-D4N050
Applying reductions before tool smart
Invoking reducer
Running Version 202304061127
[2023-04-07 03:14:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-04-07 03:14:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 03:14:00] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-04-07 03:14:00] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-04-07 03:14:00] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 530 ms
[2023-04-07 03:14:00] [INFO ] Imported 6 HL places and 7 HL transitions for a total of 30 PT places and 35.0 transition bindings in 28 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
FORMULA Murphy-COL-D4N050-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-COL-D4N050-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-COL-D4N050-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-04-07 03:14:00] [INFO ] Built PT skeleton of HLPN with 6 places and 7 transitions 27 arcs in 8 ms.
[2023-04-07 03:14:00] [INFO ] Skeletonized 13 HLPN properties in 0 ms.
Remains 5 properties that can be checked using skeleton over-approximation.
Initial state reduction rules removed 2 formulas.
FORMULA Murphy-COL-D4N050-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-COL-D4N050-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 100175 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=936 ) properties (out of 8) seen :6
Running SMT prover for 2 properties.
// Phase 1: matrix 7 rows 6 cols
[2023-04-07 03:14:01] [INFO ] Computed 2 invariants in 4 ms
[2023-04-07 03:14:01] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-04-07 03:14:01] [INFO ] After 146ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Successfully simplified 2 atomic propositions for a total of 3 simplifications.
[2023-04-07 03:14:01] [INFO ] Flatten gal took : 15 ms
[2023-04-07 03:14:01] [INFO ] Flatten gal took : 1 ms
Arc [2:1*[(MOD (ADD $x 1) 5)]] contains successor/predecessor on variables of sort CD
[2023-04-07 03:14:01] [INFO ] Unfolded HLPN to a Petri net with 30 places and 35 transitions 135 arcs in 6 ms.
[2023-04-07 03:14:01] [INFO ] Unfolded 11 HLPN properties in 0 ms.
Initial state reduction rules removed 4 formulas.
FORMULA Murphy-COL-D4N050-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-COL-D4N050-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-COL-D4N050-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-COL-D4N050-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10038 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 7) seen :5
FORMULA Murphy-COL-D4N050-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Murphy-COL-D4N050-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Murphy-COL-D4N050-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Murphy-COL-D4N050-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Murphy-COL-D4N050-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 35 rows 30 cols
[2023-04-07 03:14:01] [INFO ] Computed 6 invariants in 3 ms
[2023-04-07 03:14:01] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 03:14:01] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-07 03:14:01] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 03:14:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-04-07 03:14:01] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-07 03:14:01] [INFO ] After 25ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-07 03:14:01] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 03:14:01] [INFO ] After 19ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-07 03:14:01] [INFO ] After 34ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-04-07 03:14:01] [INFO ] After 121ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 38 ms.
Support contains 25 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 9 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 03:14:01] [INFO ] Invariant cache hit.
[2023-04-07 03:14:01] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 30/30 places, 35/35 transitions.
Incomplete random walk after 10017 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 522704 steps, run timeout after 3001 ms. (steps per millisecond=174 ) properties seen :{}
Probabilistic random walk after 522704 steps, saw 358323 distinct states, run finished after 3002 ms. (steps per millisecond=174 ) properties seen :0
Running SMT prover for 2 properties.
[2023-04-07 03:14:04] [INFO ] Invariant cache hit.
[2023-04-07 03:14:04] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 03:14:04] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-07 03:14:04] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 03:14:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 03:14:04] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-07 03:14:04] [INFO ] After 21ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-07 03:14:04] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 03:14:04] [INFO ] After 14ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-07 03:14:05] [INFO ] After 28ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-04-07 03:14:05] [INFO ] After 90ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 21 ms.
Support contains 25 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 30/30 places, 35/35 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 03:14:05] [INFO ] Invariant cache hit.
[2023-04-07 03:14:05] [INFO ] Implicit Places using invariants in 30 ms returned [10, 11, 12, 13, 14]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 32 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 25/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 35 ms. Remains : 25/30 places, 35/35 transitions.
Incomplete random walk after 10023 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=417 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 553535 steps, run timeout after 3001 ms. (steps per millisecond=184 ) properties seen :{}
Probabilistic random walk after 553535 steps, saw 382053 distinct states, run finished after 3001 ms. (steps per millisecond=184 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 35 rows 25 cols
[2023-04-07 03:14:08] [INFO ] Computed 1 invariants in 2 ms
[2023-04-07 03:14:08] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-07 03:14:08] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 03:14:08] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-07 03:14:08] [INFO ] After 25ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-07 03:14:08] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 03:14:08] [INFO ] After 22ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-07 03:14:08] [INFO ] After 40ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-04-07 03:14:08] [INFO ] After 111ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 25 ms.
Support contains 25 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 25/25 places, 35/35 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 03:14:08] [INFO ] Invariant cache hit.
[2023-04-07 03:14:08] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-04-07 03:14:08] [INFO ] Invariant cache hit.
[2023-04-07 03:14:08] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 03:14:08] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2023-04-07 03:14:08] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 03:14:08] [INFO ] Invariant cache hit.
[2023-04-07 03:14:08] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108 ms. Remains : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-04-07 03:14:08] [INFO ] Invariant cache hit.
[2023-04-07 03:14:08] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-07 03:14:08] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 03:14:08] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-07 03:14:08] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-07 03:14:08] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 03:14:08] [INFO ] After 10ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-07 03:14:08] [INFO ] After 22ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-04-07 03:14:08] [INFO ] After 76ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-04-07 03:14:08] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 14 ms.
[2023-04-07 03:14:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 25 places, 35 transitions and 115 arcs took 1 ms.
[2023-04-07 03:14:08] [INFO ] Flatten gal took : 6 ms
Total runtime 8314 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running Murphy (COL), instance D4N050
Examination ReachabilityFireability
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Fireability.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 25 places, 35 transitions, 115 arcs.
Final Score: 102.123
Took : 0 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS

BK_STOP 1680837250751

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
ERROR in file model.sm near line 196:
syntax error

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="Murphy-COL-D4N050"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is Murphy-COL-D4N050, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r523-tall-167987247900327"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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