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

About the Execution of Smart+red for DiscoveryGPU-PT-06b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
318.680 15879.00 29679.00 423.30 TTTFTTTTTT?TTTFT 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.r139-smll-167819422500295.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 DiscoveryGPU-PT-06b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r139-smll-167819422500295
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 6.3K Feb 25 13:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Feb 25 13:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 13:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Feb 25 13:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 25 13:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 13:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:59 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 46K 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 DiscoveryGPU-PT-06b-ReachabilityFireability-00
FORMULA_NAME DiscoveryGPU-PT-06b-ReachabilityFireability-01
FORMULA_NAME DiscoveryGPU-PT-06b-ReachabilityFireability-02
FORMULA_NAME DiscoveryGPU-PT-06b-ReachabilityFireability-03
FORMULA_NAME DiscoveryGPU-PT-06b-ReachabilityFireability-04
FORMULA_NAME DiscoveryGPU-PT-06b-ReachabilityFireability-05
FORMULA_NAME DiscoveryGPU-PT-06b-ReachabilityFireability-06
FORMULA_NAME DiscoveryGPU-PT-06b-ReachabilityFireability-07
FORMULA_NAME DiscoveryGPU-PT-06b-ReachabilityFireability-08
FORMULA_NAME DiscoveryGPU-PT-06b-ReachabilityFireability-09
FORMULA_NAME DiscoveryGPU-PT-06b-ReachabilityFireability-10
FORMULA_NAME DiscoveryGPU-PT-06b-ReachabilityFireability-11
FORMULA_NAME DiscoveryGPU-PT-06b-ReachabilityFireability-12
FORMULA_NAME DiscoveryGPU-PT-06b-ReachabilityFireability-13
FORMULA_NAME DiscoveryGPU-PT-06b-ReachabilityFireability-14
FORMULA_NAME DiscoveryGPU-PT-06b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678360003811

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=DiscoveryGPU-PT-06b
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-09 11:06:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-09 11:06:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 11:06:46] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2023-03-09 11:06:46] [INFO ] Transformed 184 places.
[2023-03-09 11:06:46] [INFO ] Transformed 194 transitions.
[2023-03-09 11:06:46] [INFO ] Found NUPN structural information;
[2023-03-09 11:06:46] [INFO ] Parsed PT model containing 184 places and 194 transitions and 503 arcs in 201 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 50 resets, run finished after 746 ms. (steps per millisecond=13 ) properties (out of 16) seen :11
FORMULA DiscoveryGPU-PT-06b-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DiscoveryGPU-PT-06b-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DiscoveryGPU-PT-06b-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DiscoveryGPU-PT-06b-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DiscoveryGPU-PT-06b-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DiscoveryGPU-PT-06b-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DiscoveryGPU-PT-06b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DiscoveryGPU-PT-06b-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DiscoveryGPU-PT-06b-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DiscoveryGPU-PT-06b-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DiscoveryGPU-PT-06b-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 194 rows 184 cols
[2023-03-09 11:06:48] [INFO ] Computed 8 place invariants in 14 ms
[2023-03-09 11:06:48] [INFO ] After 306ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-09 11:06:48] [INFO ] [Nat]Absence check using 8 positive place invariants in 16 ms returned sat
[2023-03-09 11:06:49] [INFO ] After 322ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :2
[2023-03-09 11:06:49] [INFO ] Deduced a trap composed of 10 places in 167 ms of which 11 ms to minimize.
[2023-03-09 11:06:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 188 ms
[2023-03-09 11:06:49] [INFO ] After 639ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :1
Attempting to minimize the solution found.
Minimization took 60 ms.
[2023-03-09 11:06:49] [INFO ] After 910ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :1
FORMULA DiscoveryGPU-PT-06b-ReachabilityFireability-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DiscoveryGPU-PT-06b-ReachabilityFireability-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DiscoveryGPU-PT-06b-ReachabilityFireability-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DiscoveryGPU-PT-06b-ReachabilityFireability-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 22 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 194/194 transitions.
Graph (complete) has 314 edges and 184 vertex of which 162 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.2 ms
Discarding 22 places :
Also discarding 10 output transitions
Drop transitions removed 10 transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 162 transition count 155
Reduce places removed 26 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 31 rules applied. Total rules applied 61 place count 136 transition count 150
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 66 place count 131 transition count 150
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 66 place count 131 transition count 138
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 90 place count 119 transition count 138
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 96 place count 113 transition count 132
Iterating global reduction 3 with 6 rules applied. Total rules applied 102 place count 113 transition count 132
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 106 place count 109 transition count 128
Iterating global reduction 3 with 4 rules applied. Total rules applied 110 place count 109 transition count 128
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 114 place count 105 transition count 124
Iterating global reduction 3 with 4 rules applied. Total rules applied 118 place count 105 transition count 124
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 122 place count 101 transition count 116
Iterating global reduction 3 with 4 rules applied. Total rules applied 126 place count 101 transition count 116
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 129 place count 98 transition count 113
Iterating global reduction 3 with 3 rules applied. Total rules applied 132 place count 98 transition count 113
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 186 place count 71 transition count 86
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 188 place count 70 transition count 86
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 189 place count 70 transition count 85
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 190 place count 69 transition count 85
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 191 place count 69 transition count 85
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 192 place count 68 transition count 84
Applied a total of 192 rules in 146 ms. Remains 68 /184 variables (removed 116) and now considering 84/194 (removed 110) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 147 ms. Remains : 68/184 places, 84/194 transitions.
Incomplete random walk after 10000 steps, including 73 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2877994 steps, run timeout after 3001 ms. (steps per millisecond=959 ) properties seen :{}
Probabilistic random walk after 2877994 steps, saw 495913 distinct states, run finished after 3003 ms. (steps per millisecond=958 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 11:06:52] [INFO ] Flow matrix only has 77 transitions (discarded 7 similar events)
// Phase 1: matrix 77 rows 68 cols
[2023-03-09 11:06:52] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-09 11:06:52] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 11:06:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 11:06:52] [INFO ] After 78ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 11:06:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 11:06:52] [INFO ] After 30ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 11:06:52] [INFO ] After 71ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-09 11:06:52] [INFO ] After 225ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 22 out of 68 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 84/84 transitions.
Applied a total of 0 rules in 5 ms. Remains 68 /68 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 68/68 places, 84/84 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 84/84 transitions.
Applied a total of 0 rules in 4 ms. Remains 68 /68 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-09 11:06:52] [INFO ] Flow matrix only has 77 transitions (discarded 7 similar events)
[2023-03-09 11:06:52] [INFO ] Invariant cache hit.
[2023-03-09 11:06:53] [INFO ] Implicit Places using invariants in 81 ms returned []
[2023-03-09 11:06:53] [INFO ] Flow matrix only has 77 transitions (discarded 7 similar events)
[2023-03-09 11:06:53] [INFO ] Invariant cache hit.
[2023-03-09 11:06:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 11:06:53] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
[2023-03-09 11:06:53] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 11:06:53] [INFO ] Flow matrix only has 77 transitions (discarded 7 similar events)
[2023-03-09 11:06:53] [INFO ] Invariant cache hit.
[2023-03-09 11:06:53] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 325 ms. Remains : 68/68 places, 84/84 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 68 transition count 77
Applied a total of 7 rules in 5 ms. Remains 68 /68 variables (removed 0) and now considering 77/84 (removed 7) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 77 rows 68 cols
[2023-03-09 11:06:53] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-09 11:06:53] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 11:06:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-09 11:06:53] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 11:06:53] [INFO ] After 72ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-09 11:06:53] [INFO ] After 133ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-09 11:06:53] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 30 ms.
[2023-03-09 11:06:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 68 places, 84 transitions and 271 arcs took 1 ms.
[2023-03-09 11:06:53] [INFO ] Flatten gal took : 45 ms
Total runtime 7336 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running DiscoveryGPU (PT), instance 06b
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: 68 places, 84 transitions, 271 arcs.
Final Score: 537.64
Took : 4 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS

BK_STOP 1678360019690

--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
ERROR in file model.sm near line 437:
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="DiscoveryGPU-PT-06b"
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 DiscoveryGPU-PT-06b, 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 r139-smll-167819422500295"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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