Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r265-tall-162106800300108.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is SmartHome-PT-08, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-tall-162106800300108
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 424K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 95K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 16:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 27 13:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 13:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 25 19:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 11K Mar 25 19:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 64K May 5 16:52 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 SmartHome-PT-08-ReachabilityFireability-00
FORMULA_NAME SmartHome-PT-08-ReachabilityFireability-01
FORMULA_NAME SmartHome-PT-08-ReachabilityFireability-02
FORMULA_NAME SmartHome-PT-08-ReachabilityFireability-03
FORMULA_NAME SmartHome-PT-08-ReachabilityFireability-04
FORMULA_NAME SmartHome-PT-08-ReachabilityFireability-05
FORMULA_NAME SmartHome-PT-08-ReachabilityFireability-06
FORMULA_NAME SmartHome-PT-08-ReachabilityFireability-07
FORMULA_NAME SmartHome-PT-08-ReachabilityFireability-08
FORMULA_NAME SmartHome-PT-08-ReachabilityFireability-09
FORMULA_NAME SmartHome-PT-08-ReachabilityFireability-10
FORMULA_NAME SmartHome-PT-08-ReachabilityFireability-11
FORMULA_NAME SmartHome-PT-08-ReachabilityFireability-12
FORMULA_NAME SmartHome-PT-08-ReachabilityFireability-13
FORMULA_NAME SmartHome-PT-08-ReachabilityFireability-14
FORMULA_NAME SmartHome-PT-08-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1621197879144

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-16 20:44:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-16 20:44:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 20:44:40] [INFO ] Load time of PNML (sax parser for PT used): 56 ms
[2021-05-16 20:44:40] [INFO ] Transformed 252 places.
[2021-05-16 20:44:40] [INFO ] Transformed 291 transitions.
[2021-05-16 20:44:40] [INFO ] Found NUPN structural information;
[2021-05-16 20:44:40] [INFO ] Parsed PT model containing 252 places and 291 transitions in 98 ms.
Deduced a syphon composed of 20 places in 3 ms
Reduce places removed 20 places and 21 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 59 resets, run finished after 54 ms. (steps per millisecond=185 ) properties seen :[0, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1]
FORMULA SmartHome-PT-08-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-08-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-08-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-08-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-08-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-08-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-08-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-08-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-08-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-08-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0, 0, 0]
// Phase 1: matrix 270 rows 232 cols
[2021-05-16 20:44:41] [INFO ] Computed 11 place invariants in 10 ms
[2021-05-16 20:44:41] [INFO ] [Real]Absence check using 11 positive place invariants in 21 ms returned sat
[2021-05-16 20:44:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 20:44:41] [INFO ] [Real]Absence check using state equation in 184 ms returned sat
[2021-05-16 20:44:41] [INFO ] Deduced a trap composed of 50 places in 122 ms
[2021-05-16 20:44:41] [INFO ] Deduced a trap composed of 70 places in 96 ms
[2021-05-16 20:44:41] [INFO ] Deduced a trap composed of 52 places in 57 ms
[2021-05-16 20:44:41] [INFO ] Deduced a trap composed of 56 places in 45 ms
[2021-05-16 20:44:41] [INFO ] Deduced a trap composed of 53 places in 36 ms
[2021-05-16 20:44:41] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 430 ms
[2021-05-16 20:44:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 20:44:42] [INFO ] [Nat]Absence check using 11 positive place invariants in 430 ms returned sat
[2021-05-16 20:44:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 20:44:42] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2021-05-16 20:44:42] [INFO ] Deduced a trap composed of 33 places in 65 ms
[2021-05-16 20:44:42] [INFO ] Deduced a trap composed of 52 places in 76 ms
[2021-05-16 20:44:42] [INFO ] Deduced a trap composed of 53 places in 58 ms
[2021-05-16 20:44:42] [INFO ] Deduced a trap composed of 52 places in 49 ms
[2021-05-16 20:44:42] [INFO ] Deduced a trap composed of 72 places in 45 ms
[2021-05-16 20:44:42] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 366 ms
[2021-05-16 20:44:42] [INFO ] Computed and/alt/rep : 269/819/269 causal constraints in 19 ms.
[2021-05-16 20:44:43] [INFO ] Added : 269 causal constraints over 54 iterations in 856 ms. Result :sat
[2021-05-16 20:44:43] [INFO ] Deduced a trap composed of 46 places in 43 ms
[2021-05-16 20:44:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
Attempting to minimize the solution found.
Minimization took 16 ms.
[2021-05-16 20:44:43] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned unsat
[2021-05-16 20:44:43] [INFO ] [Real]Absence check using 11 positive place invariants in 12 ms returned sat
[2021-05-16 20:44:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 20:44:44] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2021-05-16 20:44:44] [INFO ] Computed and/alt/rep : 269/819/269 causal constraints in 18 ms.
[2021-05-16 20:44:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 20:44:44] [INFO ] [Nat]Absence check using 11 positive place invariants in 135 ms returned sat
[2021-05-16 20:44:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 20:44:44] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2021-05-16 20:44:44] [INFO ] Computed and/alt/rep : 269/819/269 causal constraints in 18 ms.
[2021-05-16 20:44:45] [INFO ] Added : 266 causal constraints over 54 iterations in 867 ms. Result :sat
[2021-05-16 20:44:45] [INFO ] Deduced a trap composed of 51 places in 54 ms
[2021-05-16 20:44:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
Attempting to minimize the solution found.
Minimization took 11 ms.
[2021-05-16 20:44:45] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2021-05-16 20:44:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 20:44:45] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2021-05-16 20:44:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 20:44:46] [INFO ] [Nat]Absence check using 11 positive place invariants in 396 ms returned sat
[2021-05-16 20:44:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 20:44:46] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2021-05-16 20:44:46] [INFO ] Deduced a trap composed of 33 places in 83 ms
[2021-05-16 20:44:46] [INFO ] Deduced a trap composed of 35 places in 86 ms
[2021-05-16 20:44:46] [INFO ] Deduced a trap composed of 32 places in 60 ms
[2021-05-16 20:44:46] [INFO ] Deduced a trap composed of 27 places in 47 ms
[2021-05-16 20:44:46] [INFO ] Deduced a trap composed of 46 places in 44 ms
[2021-05-16 20:44:46] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 383 ms
[2021-05-16 20:44:46] [INFO ] Computed and/alt/rep : 269/819/269 causal constraints in 14 ms.
[2021-05-16 20:44:47] [INFO ] Added : 268 causal constraints over 54 iterations in 827 ms. Result :sat
[2021-05-16 20:44:47] [INFO ] Deduced a trap composed of 29 places in 63 ms
[2021-05-16 20:44:47] [INFO ] Deduced a trap composed of 77 places in 39 ms
[2021-05-16 20:44:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 160 ms
Attempting to minimize the solution found.
Minimization took 13 ms.
[2021-05-16 20:44:47] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned unsat
[2021-05-16 20:44:47] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2021-05-16 20:44:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 20:44:47] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2021-05-16 20:44:47] [INFO ] Deduced a trap composed of 73 places in 90 ms
[2021-05-16 20:44:48] [INFO ] Deduced a trap composed of 33 places in 72 ms
[2021-05-16 20:44:48] [INFO ] Deduced a trap composed of 74 places in 74 ms
[2021-05-16 20:44:48] [INFO ] Deduced a trap composed of 50 places in 69 ms
[2021-05-16 20:44:48] [INFO ] Deduced a trap composed of 73 places in 63 ms
[2021-05-16 20:44:48] [INFO ] Deduced a trap composed of 36 places in 48 ms
[2021-05-16 20:44:48] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 474 ms
[2021-05-16 20:44:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 20:44:48] [INFO ] [Nat]Absence check using 11 positive place invariants in 118 ms returned sat
[2021-05-16 20:44:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 20:44:48] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2021-05-16 20:44:48] [INFO ] Deduced a trap composed of 32 places in 74 ms
[2021-05-16 20:44:48] [INFO ] Deduced a trap composed of 31 places in 70 ms
[2021-05-16 20:44:48] [INFO ] Deduced a trap composed of 35 places in 58 ms
[2021-05-16 20:44:48] [INFO ] Deduced a trap composed of 74 places in 55 ms
[2021-05-16 20:44:49] [INFO ] Deduced a trap composed of 72 places in 40 ms
[2021-05-16 20:44:49] [INFO ] Deduced a trap composed of 75 places in 32 ms
[2021-05-16 20:44:49] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 385 ms
[2021-05-16 20:44:49] [INFO ] Computed and/alt/rep : 269/819/269 causal constraints in 16 ms.
[2021-05-16 20:44:49] [INFO ] Added : 268 causal constraints over 54 iterations in 810 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 11 ms.
FORMULA SmartHome-PT-08-ReachabilityFireability-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SmartHome-PT-08-ReachabilityFireability-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 35600 steps, including 349 resets, run finished after 131 ms. (steps per millisecond=271 ) properties seen :[0, 0, 1, 0] could not realise parikh vector
FORMULA SmartHome-PT-08-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 33200 steps, including 313 resets, run finished after 78 ms. (steps per millisecond=425 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 30800 steps, including 170 resets, run finished after 70 ms. (steps per millisecond=440 ) properties seen :[0, 1, 0] could not realise parikh vector
FORMULA SmartHome-PT-08-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 38800 steps, including 365 resets, run finished after 89 ms. (steps per millisecond=435 ) properties seen :[0, 0] could not realise parikh vector
Support contains 5 out of 232 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 232/232 places, 270/270 transitions.
Graph (trivial) has 222 edges and 232 vertex of which 90 / 232 are part of one of the 6 SCC in 4 ms
Free SCC test removed 84 places
Drop transitions removed 110 transitions
Reduce isomorphic transitions removed 110 transitions.
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Iterating post reduction 0 with 165 rules applied. Total rules applied 166 place count 148 transition count 105
Reduce places removed 55 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 66 rules applied. Total rules applied 232 place count 93 transition count 94
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 237 place count 88 transition count 94
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 237 place count 88 transition count 89
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 247 place count 83 transition count 89
Symmetric choice reduction at 3 with 28 rule applications. Total rules 275 place count 83 transition count 89
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 28 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 331 place count 55 transition count 61
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 337 place count 55 transition count 55
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 337 place count 55 transition count 53
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 341 place count 53 transition count 53
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 371 place count 38 transition count 38
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Discarding 1 places :
Also discarding 0 output transitions
Graph (complete) has 105 edges and 38 vertex of which 37 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Iterating post reduction 4 with 10 rules applied. Total rules applied 381 place count 37 transition count 29
Free-agglomeration rule applied 6 times.
Iterating global reduction 5 with 6 rules applied. Total rules applied 387 place count 37 transition count 23
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 393 place count 31 transition count 23
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 394 place count 30 transition count 22
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 395 place count 29 transition count 22
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 395 place count 29 transition count 21
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 397 place count 28 transition count 21
Applied a total of 397 rules in 44 ms. Remains 28 /232 variables (removed 204) and now considering 21/270 (removed 249) transitions.
Finished structural reductions, in 1 iterations. Remains : 28/232 places, 21/270 transitions.
Finished random walk after 32 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=32 )
FORMULA SmartHome-PT-08-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-08-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

--------------------
content from stderr:

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="SmartHome-PT-08"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="gold2020"
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-4028"
echo " Executing tool gold2020"
echo " Input is SmartHome-PT-08, 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 r265-tall-162106800300108"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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