Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r276-smll-171654415800021.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is ParamProductionCell-PT-3, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r276-smll-171654415800021
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.1K Apr 23 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.5K Apr 12 20:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 46K Apr 12 20:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 12 20:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 12 20:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 174K 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 1716811659593

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ParamProductionCell-PT-3
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 12:07:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -timeout, 180, -rebuildPNML]
[2024-05-27 12:07:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 12:07:42] [INFO ] Load time of PNML (sax parser for PT used): 183 ms
[2024-05-27 12:07:42] [INFO ] Transformed 231 places.
[2024-05-27 12:07:42] [INFO ] Transformed 202 transitions.
[2024-05-27 12:07:42] [INFO ] Found NUPN structural information;
[2024-05-27 12:07:42] [INFO ] Parsed PT model containing 231 places and 202 transitions and 846 arcs in 499 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 11 ms.
Working with output stream class java.io.PrintStream
Built sparse matrix representations for Structural reductions in 8 ms.20491KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 231/231 places, 202/202 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 14 Pre rules applied. Total rules applied 0 place count 231 transition count 188
Deduced a syphon composed of 14 places in 5 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 28 place count 217 transition count 188
Computed a total of 0 stabilizing places and 0 stable transitions
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 211 transition count 182
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 211 transition count 182
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 76 place count 193 transition count 164
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 76 rules in 231 ms. Remains 193 /231 variables (removed 38) and now considering 164/202 (removed 38) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 270 ms. Remains : 193/231 places, 164/202 transitions.
Random walk for 1250000 steps, including 0 resets, run took 2432 ms (no deadlock found). (steps per millisecond=513 )
Random directed walk for 1250002 steps, including 0 resets, run took 1482 ms (no deadlock found). (steps per millisecond=843 )
// Phase 1: matrix 164 rows 193 cols
[2024-05-27 12:07:46] [INFO ] Computed 59 invariants in 15 ms
[2024-05-27 12:07:46] [INFO ] [Real]Absence check using 35 positive place invariants in 27 ms returned sat
[2024-05-27 12:07:46] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 32 ms returned sat
[2024-05-27 12:07:47] [INFO ] [Real]Absence check using state equation in 281 ms returned sat
[2024-05-27 12:07:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 12:07:47] [INFO ] [Nat]Absence check using 35 positive place invariants in 22 ms returned sat
[2024-05-27 12:07:47] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 19 ms returned sat
[2024-05-27 12:07:47] [INFO ] [Nat]Absence check using state equation in 372 ms returned sat
[2024-05-27 12:07:47] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-27 12:07:47] [INFO ] [Nat]Added 68 Read/Feed constraints in 77 ms returned sat
[2024-05-27 12:07:48] [INFO ] Deduced a trap composed of 7 places in 131 ms of which 13 ms to minimize.
[2024-05-27 12:07:48] [INFO ] Deduced a trap composed of 8 places in 154 ms of which 4 ms to minimize.
[2024-05-27 12:07:48] [INFO ] Deduced a trap composed of 7 places in 110 ms of which 3 ms to minimize.
[2024-05-27 12:07:48] [INFO ] Deduced a trap composed of 5 places in 116 ms of which 2 ms to minimize.
[2024-05-27 12:07:48] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 3 ms to minimize.
[2024-05-27 12:07:48] [INFO ] Deduced a trap composed of 6 places in 103 ms of which 2 ms to minimize.
[2024-05-27 12:07:49] [INFO ] Deduced a trap composed of 7 places in 139 ms of which 3 ms to minimize.
[2024-05-27 12:07:49] [INFO ] Deduced a trap composed of 6 places in 103 ms of which 3 ms to minimize.
[2024-05-27 12:07:49] [INFO ] Deduced a trap composed of 14 places in 136 ms of which 4 ms to minimize.
[2024-05-27 12:07:49] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 3 ms to minimize.
[2024-05-27 12:07:49] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 2 ms to minimize.
[2024-05-27 12:07:49] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 2 ms to minimize.
[2024-05-27 12:07:49] [INFO ] Deduced a trap composed of 40 places in 84 ms of which 2 ms to minimize.
[2024-05-27 12:07:49] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 2 ms to minimize.
[2024-05-27 12:07:50] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 2 ms to minimize.
[2024-05-27 12:07:50] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 2 ms to minimize.
[2024-05-27 12:07:50] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 1 ms to minimize.
[2024-05-27 12:07:50] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 2 ms to minimize.
[2024-05-27 12:07:50] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-05-27 12:07:50] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 2 ms to minimize.
[2024-05-27 12:07:50] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 5 ms to minimize.
[2024-05-27 12:07:50] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 2 ms to minimize.
[2024-05-27 12:07:50] [INFO ] Deduced a trap composed of 33 places in 105 ms of which 2 ms to minimize.
[2024-05-27 12:07:50] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 2 ms to minimize.
[2024-05-27 12:07:50] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 3027 ms
[2024-05-27 12:07:50] [INFO ] Computed and/alt/rep : 155/412/155 causal constraints (skipped 7 transitions) in 19 ms.
[2024-05-27 12:07:51] [INFO ] Added : 135 causal constraints over 27 iterations in 648 ms. Result :sat
Parikh directed walk for 26400 steps, including 904 resets, run took 82 ms. (steps per millisecond=321 )
Random directed walk for 500000 steps, including 0 resets, run took 592 ms (no deadlock found). (steps per millisecond=844 )
Random walk for 500000 steps, including 0 resets, run took 1049 ms (no deadlock found). (steps per millisecond=476 )
Random directed walk for 500002 steps, including 0 resets, run took 581 ms (no deadlock found). (steps per millisecond=860 )
Random walk for 500000 steps, including 0 resets, run took 761 ms (no deadlock found). (steps per millisecond=657 )
Starting structural reductions in DEADLOCK mode, iteration 0 : 193/193 places, 164/164 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 12 ms. Remains 193 /193 variables (removed 0) and now considering 164/164 (removed 0) transitions.
[2024-05-27 12:07:54] [INFO ] Invariant cache hit.
[2024-05-27 12:07:55] [INFO ] Implicit Places using invariants in 359 ms returned [15, 16, 17, 18, 22, 28, 31, 32, 35, 36, 40, 41, 51, 54, 55, 61, 64, 65, 77, 78, 80, 92, 93, 95, 97, 98, 132, 133, 135, 137, 138, 162, 163, 166, 167, 172, 173, 175, 184]
[2024-05-27 12:07:55] [INFO ] Actually due to overlaps returned [78, 80, 77, 35, 40, 54, 64, 92, 93, 95, 132, 133, 135, 166, 167, 175, 17, 18, 22, 28, 36, 41, 55, 65, 172, 173, 184, 97, 98, 137, 138, 162, 163]
Discarding 33 places :
Implicit Place search using SMT only with invariants took 362 ms to find 33 implicit places.
Starting structural reductions in DEADLOCK mode, iteration 1 : 160/193 places, 164/164 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 160 transition count 143
Reduce places removed 21 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 139 transition count 143
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 42 place count 139 transition count 141
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 46 place count 137 transition count 141
Computed a total of 0 stabilizing places and 0 stable transitions
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 48 place count 135 transition count 139
Iterating global reduction 2 with 2 rules applied. Total rules applied 50 place count 135 transition count 139
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 132 place count 94 transition count 98
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 132 rules in 24 ms. Remains 94 /160 variables (removed 66) and now considering 98/164 (removed 66) transitions.
// Phase 1: matrix 98 rows 94 cols
[2024-05-27 12:07:55] [INFO ] Computed 26 invariants in 1 ms
[2024-05-27 12:07:55] [INFO ] Implicit Places using invariants in 121 ms returned [15, 16, 23, 24, 33, 38]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 122 ms to find 6 implicit places.
Starting structural reductions in DEADLOCK mode, iteration 2 : 88/193 places, 98/164 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 85 transition count 95
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 84 transition count 94
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 8 rules in 11 ms. Remains 84 /88 variables (removed 4) and now considering 94/98 (removed 4) transitions.
// Phase 1: matrix 94 rows 84 cols
[2024-05-27 12:07:55] [INFO ] Computed 20 invariants in 5 ms
[2024-05-27 12:07:55] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-05-27 12:07:55] [INFO ] Invariant cache hit.
[2024-05-27 12:07:55] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-27 12:07:55] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 434 ms to find 0 implicit places.
Starting structural reductions in DEADLOCK mode, iteration 3 : 84/193 places, 94/164 transitions.
Finished structural reductions in DEADLOCK mode , in 3 iterations and 970 ms. Remains : 84/193 places, 94/164 transitions.
Random walk for 1250000 steps, including 0 resets, run took 1531 ms (no deadlock found). (steps per millisecond=816 )
Random directed walk for 1250001 steps, including 0 resets, run took 971 ms (no deadlock found). (steps per millisecond=1287 )
[2024-05-27 12:07:58] [INFO ] Invariant cache hit.
[2024-05-27 12:07:58] [INFO ] [Real]Absence check using 18 positive place invariants in 8 ms returned sat
[2024-05-27 12:07:58] [INFO ] [Real]Absence check using 18 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-27 12:07:58] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2024-05-27 12:07:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 12:07:58] [INFO ] [Nat]Absence check using 18 positive place invariants in 10 ms returned sat
[2024-05-27 12:07:58] [INFO ] [Nat]Absence check using 18 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-27 12:07:58] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2024-05-27 12:07:58] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-27 12:07:58] [INFO ] [Nat]Added 67 Read/Feed constraints in 18 ms returned sat
[2024-05-27 12:07:58] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 2 ms to minimize.
[2024-05-27 12:07:58] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 2 ms to minimize.
[2024-05-27 12:07:58] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 1 ms to minimize.
[2024-05-27 12:07:58] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 2 ms to minimize.
[2024-05-27 12:07:58] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
[2024-05-27 12:07:58] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-27 12:07:59] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 2 ms to minimize.
[2024-05-27 12:07:59] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 2 ms to minimize.
[2024-05-27 12:07:59] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2024-05-27 12:07:59] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 2 ms to minimize.
[2024-05-27 12:07:59] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 6 ms to minimize.
[2024-05-27 12:07:59] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-27 12:07:59] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-27 12:07:59] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2024-05-27 12:07:59] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 1 ms to minimize.
[2024-05-27 12:07:59] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 2 ms to minimize.
[2024-05-27 12:07:59] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-05-27 12:07:59] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 1006 ms
[2024-05-27 12:07:59] [INFO ] Computed and/alt/rep : 92/216/92 causal constraints (skipped 0 transitions) in 11 ms.
[2024-05-27 12:07:59] [INFO ] Added : 89 causal constraints over 19 iterations in 268 ms. Result :sat
Parikh directed walk for 19900 steps, including 371 resets, run took 67 ms. (steps per millisecond=297 )
Random directed walk for 500000 steps, including 0 resets, run took 517 ms (no deadlock found). (steps per millisecond=967 )
Random walk for 500000 steps, including 0 resets, run took 514 ms (no deadlock found). (steps per millisecond=972 )
Random directed walk for 500000 steps, including 0 resets, run took 387 ms (no deadlock found). (steps per millisecond=1291 )
Random walk for 500000 steps, including 0 resets, run took 513 ms (no deadlock found). (steps per millisecond=974 )
[2024-05-27 12:08:02] [INFO ] Flatten gal took : 74 ms
[2024-05-27 12:08:02] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityDeadlock.sr.xml took 2 ms.
[2024-05-27 12:08:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 231 places, 202 transitions and 846 arcs took 9 ms.
Total runtime 20470 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ParamProductionCell-PT-3

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/411/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 231
TRANSITIONS: 202
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.010s, Sys 0.002s]


SAVING FILE /home/mcc/execution/411/model (.net / .def) ...
EXPORT TIME: [User 0.001s, Sys 0.001s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 663
MODEL NAME: /home/mcc/execution/411/model
231 places, 202 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA ReachabilityDeadlock FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716811684842

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityDeadlock -timeout 180 -rebuildPNML

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="ParamProductionCell-PT-3"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is ParamProductionCell-PT-3, 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 r276-smll-171654415800021"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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