Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r299-tajo-171654456000276.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is PolyORBNT-PT-S05J20, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r299-tajo-171654456000276
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 17K Apr 12 09:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 113K Apr 12 09:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 50K Apr 12 09:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 220K Apr 12 09:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 9.0K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 39K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 23K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 74K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 25K Apr 12 09:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Apr 12 09:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 22K Apr 12 09:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 100K Apr 12 09:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.6M May 18 16:43 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 1717142180907

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBNT-PT-S05J20
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityDeadlock PT
Running Version 202405141337
[2024-05-31 07:56:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2024-05-31 07:56:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 07:56:22] [INFO ] Load time of PNML (sax parser for PT used): 169 ms
[2024-05-31 07:56:22] [INFO ] Transformed 349 places.
[2024-05-31 07:56:22] [INFO ] Transformed 1210 transitions.
[2024-05-31 07:56:22] [INFO ] Parsed PT model containing 349 places and 1210 transitions and 8824 arcs in 291 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 4 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Built sparse matrix representations for Structural reductions in 4 ms.19321KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 349/349 places, 555/555 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Ensure Unique test removed 5 places
Computed a total of 0 stabilizing places and 0 stable transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 344 transition count 529
Reduce places removed 26 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Iterating post reduction 1 with 26 rules applied. Total rules applied 57 place count 318 transition count 529
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 57 place count 318 transition count 504
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 107 place count 293 transition count 504
Computed a total of 0 stabilizing places and 0 stable transitions
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 108 place count 292 transition count 503
Iterating global reduction 2 with 1 rules applied. Total rules applied 109 place count 292 transition count 503
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 113 place count 290 transition count 501
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 113 rules in 152 ms. Remains 290 /349 variables (removed 59) and now considering 501/555 (removed 54) transitions.
Running 495 sub problems to find dead transitions.
[2024-05-31 07:56:22] [INFO ] Flow matrix only has 497 transitions (discarded 4 similar events)
// Phase 1: matrix 497 rows 290 cols
[2024-05-31 07:56:22] [INFO ] Computed 57 invariants in 38 ms
[2024-05-31 07:56:22] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/285 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 495 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/285 variables, 10/52 constraints. Problems are: Problem set: 0 solved, 495 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/285 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 495 unsolved
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
At refinement iteration 3 (OVERLAPS) 5/290 variables, 5/57 constraints. Problems are: Problem set: 95 solved, 400 unsolved
[2024-05-31 07:56:32] [INFO ] Deduced a trap composed of 64 places in 170 ms of which 28 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/290 variables, 1/58 constraints. Problems are: Problem set: 95 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/290 variables, 0/58 constraints. Problems are: Problem set: 95 solved, 400 unsolved
At refinement iteration 6 (OVERLAPS) 497/787 variables, 290/348 constraints. Problems are: Problem set: 95 solved, 400 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/787 variables, 1/349 constraints. Problems are: Problem set: 95 solved, 400 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 (/ 163.0 170.0))
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 (/ 7.0 170.0))
(s7 (/ 163.0 170.0))
(s8 0.0)
(s9 (/ 7.0 10.0))
(s10 0.0)
(s11 (/ 3.0 10.0))
(s12 (/ 3263.0 1020.0))
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 (/ 7.0 170.0))
(s19 0.0)
(s20 (/ 3.0 10.0))
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 (/ 163.0 170.0))
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 (/ 7.0 170.0))
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 (/ 91.0 170.0))
(s44 0.0)
(s45 0.0)
(s46 (/ 7.0 170.0))
(s47 0.0)
(s48 1.0)
(s49 (/ 163.0 170.0))
(s50 0.0)
(s51 (/ 163.0 170.0))
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 (/ 7.0 170.0))
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 (/ 7.0 170.0))
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 (/ 7.0 170.0))
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 1.0)
(s81 (/ 7.0 170.0))
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 (/ 49.0 170.0))
(s88 (/ 7.0 170.0))
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 (/ 7.0 170.0))
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 (/ 3.0 10.0))
(s106 0.0)
(s107 (/ 163.0 170.0))
(s108 0.0)
(s109 (/ 3.0 17.0))
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 1.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 (/ 3.0 10.0))
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 (/ 511.0 1020.0))
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 1.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 (/ 7.0 170.0))
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 (/ 163.0 170.0))
(s172 (/ 7.0 170.0))
(s173 0.0)
(s174 1.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 (/ 161.0 1020.0))
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 1.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 (/ 149.0 170.0))
(s202 0.0)
(s203 1.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 (/ 121.0 170.0))
(s211 0.0)
(s212 0.0)
(s213 (/ 7.0 170.0))
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 1.0)
(s223 (/ 163.0 170.0))
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 1.0)
(s229 (/ 859.0 1020.0))
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 (/ 163.0 170.0))
(s234 0.0)
(s235 0.0)
(s236 (/ 163.0 170.0))
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 1.0)
(s251 0.0)
(s252 (/ 21.0 170.0))
(s253 0.0)
(s254 (/ 29.0 85.0))
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 (/ 56.0 85.0))
(s259 0.0)
(s260 1.0)
(s261 (/ 7.0 10.0))
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 1.0)
(s266 0.0)
(s267 0.0)
(s268 (/ 7.0 170.0))
(s269 (/ 7.0 170.0))
(s270 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 787/787 variables, and 349 constraints, problems are : Problem set: 95 solved, 400 unsolved in 20069 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 290/290 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 495/495 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 95 solved, 400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/285 variables, 42/42 constraints. Problems are: Problem set: 95 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/285 variables, 10/52 constraints. Problems are: Problem set: 95 solved, 400 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/285 variables, 1/53 constraints. Problems are: Problem set: 95 solved, 400 unsolved
[2024-05-31 07:56:44] [INFO ] Deduced a trap composed of 13 places in 164 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 1/54 constraints. Problems are: Problem set: 95 solved, 400 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 0/54 constraints. Problems are: Problem set: 95 solved, 400 unsolved
At refinement iteration 5 (OVERLAPS) 5/290 variables, 5/59 constraints. Problems are: Problem set: 95 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 0/59 constraints. Problems are: Problem set: 95 solved, 400 unsolved
At refinement iteration 7 (OVERLAPS) 497/787 variables, 290/349 constraints. Problems are: Problem set: 95 solved, 400 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/787 variables, 1/350 constraints. Problems are: Problem set: 95 solved, 400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 787/787 variables, and 750 constraints, problems are : Problem set: 95 solved, 400 unsolved in 20207 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 290/290 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 400/495 constraints, Known Traps: 2/2 constraints]
After SMT, in 41306ms problems are : Problem set: 95 solved, 400 unsolved
Search for dead transitions found 95 dead transitions in 41337ms
Found 95 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions.
Starting structural reductions in DEADLOCK mode, iteration 1 : 290/349 places, 406/555 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 35 ms. Remains 290 /290 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 41584 ms. Remains : 290/349 places, 406/555 transitions.
Finished random walk after 7 steps, including 0 resets, run found a deadlock after 1 ms. (steps per millisecond=7 )
FORMULA ReachabilityDeadlock TRUE TECHNIQUES TOPOLOGICAL STRUCTURAL_REDUCTION RANDOM_WALK
Total runtime 41962 ms.

BK_STOP 1717142224291

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityDeadlock = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityDeadlock -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityDeadlock -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800

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="PolyORBNT-PT-S05J20"
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-5568"
echo " Executing tool itstools"
echo " Input is PolyORBNT-PT-S05J20, 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 r299-tajo-171654456000276"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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