fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r251-smll-165303245000101
Last Updated
Jun 22, 2022

About the Execution of 2021-gold for SmartHome-PT-10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
228.296 10941.00 24286.00 437.00 TTFTFTTFFTTFTTTF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r251-smll-165303245000101.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is SmartHome-PT-10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r251-smll-165303245000101
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 5.6K Apr 29 15:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Apr 29 15:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 29 15:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 29 15:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 9 09:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 09:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 09:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 09:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 29 15:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K Apr 29 15:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 29 15:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 29 15:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 09:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 09:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 68K May 10 09:34 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-10-ReachabilityCardinality-00
FORMULA_NAME SmartHome-PT-10-ReachabilityCardinality-01
FORMULA_NAME SmartHome-PT-10-ReachabilityCardinality-02
FORMULA_NAME SmartHome-PT-10-ReachabilityCardinality-03
FORMULA_NAME SmartHome-PT-10-ReachabilityCardinality-04
FORMULA_NAME SmartHome-PT-10-ReachabilityCardinality-05
FORMULA_NAME SmartHome-PT-10-ReachabilityCardinality-06
FORMULA_NAME SmartHome-PT-10-ReachabilityCardinality-07
FORMULA_NAME SmartHome-PT-10-ReachabilityCardinality-08
FORMULA_NAME SmartHome-PT-10-ReachabilityCardinality-09
FORMULA_NAME SmartHome-PT-10-ReachabilityCardinality-10
FORMULA_NAME SmartHome-PT-10-ReachabilityCardinality-11
FORMULA_NAME SmartHome-PT-10-ReachabilityCardinality-12
FORMULA_NAME SmartHome-PT-10-ReachabilityCardinality-13
FORMULA_NAME SmartHome-PT-10-ReachabilityCardinality-14
FORMULA_NAME SmartHome-PT-10-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1655069176224

Running Version 0
[2022-06-12 21:26:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-12 21:26:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-12 21:26:19] [INFO ] Load time of PNML (sax parser for PT used): 113 ms
[2022-06-12 21:26:19] [INFO ] Transformed 273 places.
[2022-06-12 21:26:19] [INFO ] Transformed 308 transitions.
[2022-06-12 21:26:19] [INFO ] Found NUPN structural information;
[2022-06-12 21:26:19] [INFO ] Parsed PT model containing 273 places and 308 transitions in 197 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 27 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 40 places in 9 ms
Reduce places removed 40 places and 45 transitions.
FORMULA SmartHome-PT-10-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-10-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-10-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-10-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-10-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 69 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 11) seen :7
FORMULA SmartHome-PT-10-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-10-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-10-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-10-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-10-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-10-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-10-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 4) seen :1
FORMULA SmartHome-PT-10-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 263 rows 233 cols
[2022-06-12 21:26:19] [INFO ] Computed 12 place invariants in 35 ms
[2022-06-12 21:26:20] [INFO ] [Real]Absence check using 11 positive place invariants in 21 ms returned sat
[2022-06-12 21:26:20] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-12 21:26:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:26:20] [INFO ] [Real]Absence check using state equation in 229 ms returned sat
[2022-06-12 21:26:20] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:26:21] [INFO ] [Real]Absence check using 11 positive place invariants in 18 ms returned sat
[2022-06-12 21:26:21] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-12 21:26:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:26:21] [INFO ] [Real]Absence check using state equation in 247 ms returned sat
[2022-06-12 21:26:21] [INFO ] Deduced a trap composed of 27 places in 196 ms of which 4 ms to minimize.
[2022-06-12 21:26:21] [INFO ] Deduced a trap composed of 31 places in 160 ms of which 2 ms to minimize.
[2022-06-12 21:26:21] [INFO ] Deduced a trap composed of 56 places in 113 ms of which 2 ms to minimize.
[2022-06-12 21:26:21] [INFO ] Deduced a trap composed of 56 places in 65 ms of which 2 ms to minimize.
[2022-06-12 21:26:22] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 1 ms to minimize.
[2022-06-12 21:26:22] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 1 ms to minimize.
[2022-06-12 21:26:22] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 1 ms to minimize.
[2022-06-12 21:26:22] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 923 ms
[2022-06-12 21:26:22] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:26:22] [INFO ] [Nat]Absence check using 11 positive place invariants in 10 ms returned sat
[2022-06-12 21:26:22] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-12 21:26:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:26:22] [INFO ] [Nat]Absence check using state equation in 167 ms returned sat
[2022-06-12 21:26:22] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 1 ms to minimize.
[2022-06-12 21:26:22] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 0 ms to minimize.
[2022-06-12 21:26:22] [INFO ] Deduced a trap composed of 56 places in 94 ms of which 1 ms to minimize.
[2022-06-12 21:26:23] [INFO ] Deduced a trap composed of 56 places in 79 ms of which 1 ms to minimize.
[2022-06-12 21:26:23] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 0 ms to minimize.
[2022-06-12 21:26:23] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 4 ms to minimize.
[2022-06-12 21:26:23] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 1 ms to minimize.
[2022-06-12 21:26:23] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 785 ms
[2022-06-12 21:26:23] [INFO ] Computed and/alt/rep : 252/543/252 causal constraints (skipped 10 transitions) in 34 ms.
[2022-06-12 21:26:24] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 1 ms to minimize.
[2022-06-12 21:26:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2022-06-12 21:26:24] [INFO ] Added : 251 causal constraints over 51 iterations in 1551 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 7 ms.
[2022-06-12 21:26:24] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2022-06-12 21:26:24] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-12 21:26:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:26:25] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2022-06-12 21:26:25] [INFO ] Solution in real domain found non-integer solution.
FORMULA SmartHome-PT-10-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SmartHome-PT-10-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 3 Parikh solutions to 1 different solutions.
Incomplete Parikh walk after 27800 steps, including 286 resets, run finished after 66 ms. (steps per millisecond=421 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 8 out of 233 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 233/233 places, 263/263 transitions.
Graph (trivial) has 205 edges and 233 vertex of which 58 / 233 are part of one of the 6 SCC in 5 ms
Free SCC test removed 52 places
Drop transitions removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 66 place count 181 transition count 128
Reduce places removed 65 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 77 rules applied. Total rules applied 143 place count 116 transition count 116
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 152 place count 109 transition count 114
Reduce places removed 1 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 3 with 8 rules applied. Total rules applied 160 place count 108 transition count 107
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 168 place count 101 transition count 106
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 168 place count 101 transition count 103
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 174 place count 98 transition count 103
Discarding 27 places :
Symmetric choice reduction at 5 with 27 rule applications. Total rules 201 place count 71 transition count 76
Iterating global reduction 5 with 27 rules applied. Total rules applied 228 place count 71 transition count 76
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 5 rules applied. Total rules applied 233 place count 71 transition count 71
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 234 place count 70 transition count 71
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 3 Pre rules applied. Total rules applied 234 place count 70 transition count 68
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 240 place count 67 transition count 68
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 7 with 34 rules applied. Total rules applied 274 place count 50 transition count 51
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 144 edges and 50 vertex of which 48 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 7 with 7 rules applied. Total rules applied 281 place count 48 transition count 45
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 282 place count 48 transition count 44
Free-agglomeration rule applied 8 times.
Iterating global reduction 8 with 8 rules applied. Total rules applied 290 place count 48 transition count 36
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 298 place count 40 transition count 36
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 299 place count 39 transition count 35
Applied a total of 299 rules in 74 ms. Remains 39 /233 variables (removed 194) and now considering 35/263 (removed 228) transitions.
Finished structural reductions, in 1 iterations. Remains : 39/233 places, 35/263 transitions.
[2022-06-12 21:26:25] [INFO ] Flatten gal took : 35 ms
[2022-06-12 21:26:25] [INFO ] Flatten gal took : 10 ms
[2022-06-12 21:26:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17063080420634916786.gal : 6 ms
[2022-06-12 21:26:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7468621116212403222.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality17063080420634916786.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality7468621116212403222.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality17063080420634916786.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality7468621116212403222.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality7468621116212403222.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 33
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :33 after 193
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :385 after 559
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :559 after 623
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1185 after 1409
Reachability property SmartHome-PT-10-ReachabilityCardinality-12 is true.
FORMULA SmartHome-PT-10-ReachabilityCardinality-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 129 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2657,0.032456,4352,2,523,15,2432,6,0,189,1551,0
Total reachable state count : 2657

Verifying 1 reachability properties.
Reachability property SmartHome-PT-10-ReachabilityCardinality-12 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
SmartHome-PT-10-ReachabilityCardinality-12,6,0.034416,4352,2,76,15,2432,7,0,212,1551,0
All properties solved without resorting to model-checking.

BK_STOP 1655069187165

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-10"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="gold2021"
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 gold2021"
echo " Input is SmartHome-PT-10, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r251-smll-165303245000101"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SmartHome-PT-10.tgz
mv SmartHome-PT-10 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;