fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r254-tall-162106745700238
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for SmartHome-PT-11

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
237.300 5061.00 10716.00 233.90 TTFFTTTTFFFFFFFF normal

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.r254-tall-162106745700238.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 itstools
Input is SmartHome-PT-11, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-162106745700238
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 364K
-rw-r--r-- 1 mcc users 7.8K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.2K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K 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.4K Mar 28 16:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 16K Mar 28 16:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.8K Mar 27 13:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 13K Mar 27 13:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 19:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 25 19:31 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 71K 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-11-ReachabilityCardinality-00
FORMULA_NAME SmartHome-PT-11-ReachabilityCardinality-01
FORMULA_NAME SmartHome-PT-11-ReachabilityCardinality-02
FORMULA_NAME SmartHome-PT-11-ReachabilityCardinality-03
FORMULA_NAME SmartHome-PT-11-ReachabilityCardinality-04
FORMULA_NAME SmartHome-PT-11-ReachabilityCardinality-05
FORMULA_NAME SmartHome-PT-11-ReachabilityCardinality-06
FORMULA_NAME SmartHome-PT-11-ReachabilityCardinality-07
FORMULA_NAME SmartHome-PT-11-ReachabilityCardinality-08
FORMULA_NAME SmartHome-PT-11-ReachabilityCardinality-09
FORMULA_NAME SmartHome-PT-11-ReachabilityCardinality-10
FORMULA_NAME SmartHome-PT-11-ReachabilityCardinality-11
FORMULA_NAME SmartHome-PT-11-ReachabilityCardinality-12
FORMULA_NAME SmartHome-PT-11-ReachabilityCardinality-13
FORMULA_NAME SmartHome-PT-11-ReachabilityCardinality-14
FORMULA_NAME SmartHome-PT-11-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1621167632055

Running Version 0
[2021-05-16 12:20:33] [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]
[2021-05-16 12:20:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 12:20:33] [INFO ] Load time of PNML (sax parser for PT used): 58 ms
[2021-05-16 12:20:33] [INFO ] Transformed 290 places.
[2021-05-16 12:20:33] [INFO ] Transformed 315 transitions.
[2021-05-16 12:20:33] [INFO ] Found NUPN structural information;
[2021-05-16 12:20:33] [INFO ] Parsed PT model containing 290 places and 315 transitions in 100 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 66 places in 5 ms
Reduce places removed 66 places and 55 transitions.
FORMULA SmartHome-PT-11-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-11-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-11-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-11-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-11-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 61 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 11) seen :7
FORMULA SmartHome-PT-11-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-11-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-11-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-11-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-11-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-11-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-11-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 260 rows 224 cols
[2021-05-16 12:20:33] [INFO ] Computed 12 place invariants in 23 ms
[2021-05-16 12:20:34] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2021-05-16 12:20:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 12:20:34] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2021-05-16 12:20:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 12:20:34] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2021-05-16 12:20:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 12:20:34] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2021-05-16 12:20:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 12:20:34] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2021-05-16 12:20:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 12:20:34] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2021-05-16 12:20:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 12:20:34] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2021-05-16 12:20:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 12:20:34] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2021-05-16 12:20:34] [INFO ] Computed and/alt/rep : 235/392/235 causal constraints (skipped 24 transitions) in 32 ms.
[2021-05-16 12:20:34] [INFO ] Added : 96 causal constraints over 20 iterations in 340 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 13 ms.
[2021-05-16 12:20:35] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2021-05-16 12:20:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 12:20:35] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2021-05-16 12:20:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 12:20:35] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2021-05-16 12:20:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 12:20:35] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2021-05-16 12:20:35] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 1 ms to minimize.
[2021-05-16 12:20:35] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2021-05-16 12:20:35] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 1 ms to minimize.
[2021-05-16 12:20:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 185 ms
[2021-05-16 12:20:35] [INFO ] Computed and/alt/rep : 235/392/235 causal constraints (skipped 24 transitions) in 13 ms.
[2021-05-16 12:20:35] [INFO ] Added : 124 causal constraints over 25 iterations in 351 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 3 ms.
FORMULA SmartHome-PT-11-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SmartHome-PT-11-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 2 different solutions.
Incomplete Parikh walk after 13400 steps, including 144 resets, run finished after 50 ms. (steps per millisecond=268 ) properties (out of 2) seen :1 could not realise parikh vector
FORMULA SmartHome-PT-11-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 11400 steps, including 165 resets, run finished after 44 ms. (steps per millisecond=259 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 2 out of 224 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 224/224 places, 260/260 transitions.
Graph (trivial) has 219 edges and 224 vertex of which 90 / 224 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.
Graph (complete) has 225 edges and 140 vertex of which 132 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 63 rules applied. Total rules applied 65 place count 132 transition count 87
Reduce places removed 57 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 68 rules applied. Total rules applied 133 place count 75 transition count 76
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 138 place count 70 transition count 76
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 138 place count 70 transition count 74
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 142 place count 68 transition count 74
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 168 place count 42 transition count 48
Iterating global reduction 3 with 26 rules applied. Total rules applied 194 place count 42 transition count 48
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 200 place count 42 transition count 42
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 200 place count 42 transition count 36
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 212 place count 36 transition count 36
Graph (complete) has 59 edges and 36 vertex of which 26 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 3 rules applied. Total rules applied 215 place count 26 transition count 32
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 228 place count 24 transition count 21
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 228 place count 24 transition count 20
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 230 place count 23 transition count 20
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 231 place count 22 transition count 19
Iterating global reduction 6 with 1 rules applied. Total rules applied 232 place count 22 transition count 19
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 246 place count 15 transition count 12
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 22 edges and 15 vertex of which 14 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 6 with 4 rules applied. Total rules applied 250 place count 14 transition count 9
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 251 place count 13 transition count 8
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 7 with 8 rules applied. Total rules applied 259 place count 9 transition count 4
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 263 place count 5 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 263 place count 5 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 265 place count 4 transition count 3
Applied a total of 265 rules in 41 ms. Remains 4 /224 variables (removed 220) and now considering 3/260 (removed 257) transitions.
Finished structural reductions, in 1 iterations. Remains : 4/224 places, 3/260 transitions.
[2021-05-16 12:20:36] [INFO ] Flatten gal took : 14 ms
[2021-05-16 12:20:36] [INFO ] Flatten gal took : 1 ms
[2021-05-16 12:20:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16895471375240109476.gal : 3 ms
[2021-05-16 12:20:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2434346029533553231.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/ReachabilityCardinality16895471375240109476.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality2434346029533553231.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/ReachabilityCardinality16895471375240109476.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality2434346029533553231.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality2434346029533553231.prop.
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,4,0.005521,3640,2,7,5,24,7,0,21,13,0
Total reachable state count : 4

Verifying 1 reachability properties.
Invariant property SmartHome-PT-11-ReachabilityCardinality-15 does not hold.
FORMULA SmartHome-PT-11-ReachabilityCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING

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-11-ReachabilityCardinality-15,1,0.005791,4012,2,5,6,24,7,0,24,13,0
All properties solved without resorting to model-checking.

BK_STOP 1621167637116

--------------------
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-11"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is SmartHome-PT-11, 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 r254-tall-162106745700238"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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