Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2022-input.r211-oct2-165281603900131.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/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 itstools
Input is SafeBus-COL-06, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-oct2-165281603900131
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 304K
-rw-r--r-- 1 mcc users 8.5K Apr 29 11:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Apr 29 11:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 29 11:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 29 11:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K May 9 08:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 08:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 08:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 08:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 42K 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

FORMULA_NAME ReachabilityDeadlock

=== Now, execution of the tool begins

BK_START 1653116499008

Running Version 202205111006
[2022-05-21 07:01:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -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, 1800]
[2022-05-21 07:01:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 07:01:40] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-21 07:01:40] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-21 07:01:40] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 579 ms
[2022-05-21 07:01:40] [INFO ] Detected 1 constant HL places corresponding to 6 PT places.
[2022-05-21 07:01:40] [INFO ] Imported 20 HL places and 14 HL transitions for a total of 150 PT places and 2029.0 transition bindings in 38 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 2 ms.
Working with output stream class java.io.PrintStream
[2022-05-21 07:01:40] [INFO ] Built PT skeleton of HLPN with 20 places and 14 transitions 68 arcs in 6 ms.
[2022-05-21 07:01:40] [INFO ] Skeletonized 1 HLPN properties in 1 ms.
Reduce places removed 3 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Prefix of Interest using HLPN skeleton for deadlock discarded 0 places and 0 transitions.
Domain [It(6), It(6)] of place AMC breaks symmetries in sort It
[2022-05-21 07:01:40] [INFO ] Unfolded HLPN to a Petri net with 150 places and 463 transitions 2962 arcs in 49 ms.
[2022-05-21 07:01:40] [INFO ] Unfolded 1 HLPN properties in 0 ms.
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 12 places and 12 transitions.
Built sparse matrix representations for Structural reductions in 0 ms.10327KB memory used
Starting structural reductions in DEADLOCKS mode, iteration 0 : 138/138 places, 451/451 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 45 ms. Remains 138 /138 variables (removed 0) and now considering 451/451 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 138/138 places, 451/451 transitions.
Starting structural reductions in DEADLOCKS mode, iteration 0 : 138/138 places, 451/451 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 40 ms. Remains 138 /138 variables (removed 0) and now considering 451/451 (removed 0) transitions.
[2022-05-21 07:01:41] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
// Phase 1: matrix 242 rows 138 cols
[2022-05-21 07:01:41] [INFO ] Computed 29 place invariants in 22 ms
[2022-05-21 07:01:41] [INFO ] Implicit Places using invariants in 310 ms returned [91, 92, 93, 94, 95, 96]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 340 ms to find 6 implicit places.
Starting structural reductions in DEADLOCKS mode, iteration 1 : 132/138 places, 451/451 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 132 transition count 445
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 126 transition count 445
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -114
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 120 transition count 559
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 24 rules in 37 ms. Remains 120 /132 variables (removed 12) and now considering 559/451 (removed -108) transitions.
[2022-05-21 07:01:41] [INFO ] Flow matrix only has 350 transitions (discarded 209 similar events)
// Phase 1: matrix 350 rows 120 cols
[2022-05-21 07:01:41] [INFO ] Computed 23 place invariants in 4 ms
[2022-05-21 07:01:41] [INFO ] Implicit Places using invariants in 159 ms returned []
[2022-05-21 07:01:41] [INFO ] Flow matrix only has 350 transitions (discarded 209 similar events)
// Phase 1: matrix 350 rows 120 cols
[2022-05-21 07:01:41] [INFO ] Computed 23 place invariants in 5 ms
[2022-05-21 07:01:41] [INFO ] State equation strengthened by 43 read => feed constraints.
[2022-05-21 07:01:41] [INFO ] Implicit Places using invariants and state equation in 445 ms returned []
Implicit Place search using SMT with State Equation took 606 ms to find 0 implicit places.
Starting structural reductions in DEADLOCKS mode, iteration 2 : 120/138 places, 559/451 transitions.
Finished structural reductions, in 2 iterations. Remains : 120/138 places, 559/451 transitions.
Random walk for 1250000 steps, including 0 resets, run took 3433 ms (no deadlock found). (steps per millisecond=364 )
Random directed walk for 1250000 steps, including 0 resets, run took 3005 ms (no deadlock found). (steps per millisecond=415 )
[2022-05-21 07:01:48] [INFO ] Flow matrix only has 350 transitions (discarded 209 similar events)
// Phase 1: matrix 350 rows 120 cols
[2022-05-21 07:01:48] [INFO ] Computed 23 place invariants in 7 ms
[2022-05-21 07:01:48] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-21 07:01:48] [INFO ] [Real]Absence check using 11 positive and 12 generalized place invariants in 7 ms returned sat
[2022-05-21 07:01:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 07:01:48] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2022-05-21 07:01:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 07:01:48] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2022-05-21 07:01:48] [INFO ] [Nat]Absence check using 11 positive and 12 generalized place invariants in 17 ms returned sat
[2022-05-21 07:01:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 07:01:48] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2022-05-21 07:01:49] [INFO ] State equation strengthened by 43 read => feed constraints.
[2022-05-21 07:01:49] [INFO ] [Nat]Added 43 Read/Feed constraints in 23 ms returned sat
[2022-05-21 07:01:49] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 12 ms to minimize.
[2022-05-21 07:01:49] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2022-05-21 07:01:49] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2022-05-21 07:01:49] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 2 ms to minimize.
[2022-05-21 07:01:49] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 369 ms
[2022-05-21 07:01:49] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 308 transitions) in 42 ms.
[2022-05-21 07:01:49] [INFO ] Added : 4 causal constraints over 3 iterations in 180 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 3 ms.
Parikh directed walk for 10100 steps, including 837 resets, run took 57 ms. (steps per millisecond=177 )
Random directed walk for 500002 steps, including 0 resets, run took 1154 ms (no deadlock found). (steps per millisecond=433 )
Random walk for 500000 steps, including 0 resets, run took 1229 ms (no deadlock found). (steps per millisecond=406 )
Random directed walk for 500000 steps, including 0 resets, run took 1152 ms (no deadlock found). (steps per millisecond=434 )
Random walk for 500000 steps, including 0 resets, run took 1232 ms (no deadlock found). (steps per millisecond=405 )
Starting structural reductions in DEADLOCKS mode, iteration 0 : 120/120 places, 559/559 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 39 ms. Remains 120 /120 variables (removed 0) and now considering 559/559 (removed 0) transitions.
[2022-05-21 07:01:54] [INFO ] Flow matrix only has 350 transitions (discarded 209 similar events)
// Phase 1: matrix 350 rows 120 cols
[2022-05-21 07:01:54] [INFO ] Computed 23 place invariants in 8 ms
[2022-05-21 07:01:54] [INFO ] Implicit Places using invariants in 140 ms returned []
[2022-05-21 07:01:54] [INFO ] Flow matrix only has 350 transitions (discarded 209 similar events)
// Phase 1: matrix 350 rows 120 cols
[2022-05-21 07:01:54] [INFO ] Computed 23 place invariants in 4 ms
[2022-05-21 07:01:54] [INFO ] State equation strengthened by 43 read => feed constraints.
[2022-05-21 07:01:55] [INFO ] Implicit Places using invariants and state equation in 400 ms returned []
Implicit Place search using SMT with State Equation took 544 ms to find 0 implicit places.
[2022-05-21 07:01:55] [INFO ] Redundant transitions in 25 ms returned []
[2022-05-21 07:01:55] [INFO ] Flow matrix only has 350 transitions (discarded 209 similar events)
// Phase 1: matrix 350 rows 120 cols
[2022-05-21 07:01:55] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-21 07:01:55] [INFO ] Dead Transitions using invariants and state equation in 206 ms found 36 transitions.
Found 36 dead transitions using SMT.
Drop transitions removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in DEADLOCKS mode, iteration 1 : 120/120 places, 523/559 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 24 ms. Remains 120 /120 variables (removed 0) and now considering 523/523 (removed 0) transitions.
[2022-05-21 07:01:55] [INFO ] Redundant transitions in 2 ms returned []
Finished structural reductions, in 2 iterations. Remains : 120/120 places, 523/559 transitions.
Random walk for 1250000 steps, including 0 resets, run took 3250 ms (no deadlock found). (steps per millisecond=384 )
Random directed walk for 1250000 steps, including 0 resets, run took 2817 ms (no deadlock found). (steps per millisecond=443 )
[2022-05-21 07:02:01] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
// Phase 1: matrix 350 rows 120 cols
[2022-05-21 07:02:01] [INFO ] Computed 23 place invariants in 16 ms
[2022-05-21 07:02:01] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-21 07:02:01] [INFO ] [Real]Absence check using 11 positive and 12 generalized place invariants in 51 ms returned sat
[2022-05-21 07:02:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 07:02:01] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2022-05-21 07:02:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 07:02:01] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-21 07:02:01] [INFO ] [Nat]Absence check using 11 positive and 12 generalized place invariants in 4 ms returned sat
[2022-05-21 07:02:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 07:02:01] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2022-05-21 07:02:01] [INFO ] State equation strengthened by 43 read => feed constraints.
[2022-05-21 07:02:01] [INFO ] [Nat]Added 43 Read/Feed constraints in 83 ms returned sat
[2022-05-21 07:02:02] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2022-05-21 07:02:02] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2022-05-21 07:02:02] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2022-05-21 07:02:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 220 ms
[2022-05-21 07:02:02] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 308 transitions) in 36 ms.
[2022-05-21 07:02:02] [INFO ] Added : 0 causal constraints over 0 iterations in 71 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 3 ms.
Parikh directed walk for 5700 steps, including 893 resets, run took 21 ms. (steps per millisecond=271 )
Random directed walk for 500000 steps, including 0 resets, run took 1051 ms (no deadlock found). (steps per millisecond=475 )
Random walk for 500000 steps, including 0 resets, run took 1155 ms (no deadlock found). (steps per millisecond=432 )
Random directed walk for 500002 steps, including 0 resets, run took 997 ms (no deadlock found). (steps per millisecond=501 )
Random walk for 500000 steps, including 0 resets, run took 1293 ms (no deadlock found). (steps per millisecond=386 )
[2022-05-21 07:02:07] [INFO ] Flatten gal took : 155 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14832039915164445043
[2022-05-21 07:02:07] [INFO ] Applying decomposition
[2022-05-21 07:02:07] [INFO ] Computing symmetric may disable matrix : 451 transitions.
[2022-05-21 07:02:07] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 07:02:07] [INFO ] Computing symmetric may enable matrix : 451 transitions.
[2022-05-21 07:02:07] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 07:02:07] [INFO ] Flatten gal took : 83 ms
[2022-05-21 07:02:07] [INFO ] Computing Do-Not-Accords matrix : 451 transitions.
[2022-05-21 07:02:07] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 07:02:07] [INFO ] Built C files in 220ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14832039915164445043
Running compilation step : cd /tmp/ltsmin14832039915164445043;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph4815792194590992193.txt' '-o' '/tmp/graph4815792194590992193.bin' '-w' '/tmp/graph4815792194590992193.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4815792194590992193.bin' '-l' '-1' '-v' '-w' '/tmp/graph4815792194590992193.weights' '-q' '0' '-e' '0.001'
[2022-05-21 07:02:07] [INFO ] Decomposing Gal with order
[2022-05-21 07:02:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-21 07:02:07] [INFO ] Removed a total of 364 redundant transitions.
[2022-05-21 07:02:08] [INFO ] Flatten gal took : 230 ms
[2022-05-21 07:02:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 193 labels/synchronizations in 46 ms.
[2022-05-21 07:02:08] [INFO ] Time to serialize gal into /tmp/ReachabilityDeadlock4772855938367400536.gal : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityDeadlock4772855938367400536.gal' '-t' 'CGAL' '-ctl' 'DEADLOCK'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/R...225
No direction supplied, using forward translation only.
Compilation finished in 1827 ms.
Running link step : cd /tmp/ltsmin14832039915164445043;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin14832039915164445043;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-d'
LTSmin run took 463938 ms.
FORMULA ReachabilityDeadlock FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 493322 ms.

BK_STOP 1653116993485

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityDeadlock = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityDeadlock -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination ReachabilityDeadlock -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 1800 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="SafeBus-COL-06"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 SafeBus-COL-06, examination is ReachabilityDeadlock"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r211-oct2-165281603900131"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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