Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r196-tall-174889279200476.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is SafeBus-PT-03, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r196-tall-174889279200476
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 780K
-rw-r--r-- 1 mcc users 13K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 128K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 170K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 21K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 127K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 95K May 29 14:32 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 1748964947221

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=SafeBus-PT-03
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-03 15:35:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -timeout, 180, -rebuildPNML]
[2025-06-03 15:35:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 15:35:48] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2025-06-03 15:35:48] [INFO ] Transformed 57 places.
[2025-06-03 15:35:48] [INFO ] Transformed 91 transitions.
[2025-06-03 15:35:48] [INFO ] Found NUPN structural information;
[2025-06-03 15:35:48] [INFO ] Parsed PT model containing 57 places and 91 transitions and 541 arcs in 158 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 5 ms.
Working with output stream class java.io.PrintStream
Reduce places removed 3 places and 0 transitions.
Built sparse matrix representations for Structural reductions in 3 ms.19290KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 54/54 places, 91/91 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 20 ms. Remains 54 /54 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 37 ms. Remains : 54/54 places, 91/91 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 54/54 places, 91/91 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 7 ms. Remains 54 /54 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2025-06-03 15:35:48] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
// Phase 1: matrix 68 rows 54 cols
[2025-06-03 15:35:48] [INFO ] Computed 17 invariants in 12 ms
[2025-06-03 15:35:48] [INFO ] Implicit Places using invariants in 226 ms returned [42, 43, 44]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 257 ms to find 3 implicit places.
Starting structural reductions in DEADLOCK mode, iteration 1 : 51/54 places, 91/91 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 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 51 transition count 88
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 48 transition count 88
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 12 place count 45 transition count 91
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 12 rules in 27 ms. Remains 45 /51 variables (removed 6) and now considering 91/91 (removed 0) transitions.
[2025-06-03 15:35:49] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
// Phase 1: matrix 68 rows 45 cols
[2025-06-03 15:35:49] [INFO ] Computed 14 invariants in 2 ms
[2025-06-03 15:35:49] [INFO ] Implicit Places using invariants in 80 ms returned []
[2025-06-03 15:35:49] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
[2025-06-03 15:35:49] [INFO ] Invariant cache hit.
[2025-06-03 15:35:49] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-03 15:35:49] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
Starting structural reductions in DEADLOCK mode, iteration 2 : 45/54 places, 91/91 transitions.
Finished structural reductions in DEADLOCK mode , in 2 iterations and 486 ms. Remains : 45/54 places, 91/91 transitions.
Random walk for 1250000 steps, including 0 resets, run took 1540 ms (no deadlock found). (steps per millisecond=811 )
Random directed walk for 1250000 steps, including 0 resets, run took 1039 ms (no deadlock found). (steps per millisecond=1203 )
[2025-06-03 15:35:51] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
[2025-06-03 15:35:51] [INFO ] Invariant cache hit.
[2025-06-03 15:35:51] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-03 15:35:51] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 7 ms returned sat
[2025-06-03 15:35:51] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-06-03 15:35:51] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 15:35:51] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-03 15:35:51] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2025-06-03 15:35:51] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-06-03 15:35:51] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-03 15:35:51] [INFO ] [Nat]Added 13 Read/Feed constraints in 2 ms returned sat
[2025-06-03 15:35:52] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 5 ms to minimize.
[2025-06-03 15:35:52] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2025-06-03 15:35:52] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
[2025-06-03 15:35:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 122 ms
[2025-06-03 15:35:52] [INFO ] Computed and/alt/rep : 37/219/37 causal constraints (skipped 28 transitions) in 6 ms.
[2025-06-03 15:35:52] [INFO ] Added : 24 causal constraints over 5 iterations in 54 ms. Result :sat
Parikh directed walk for 12800 steps, including 958 resets, run took 33 ms. (steps per millisecond=387 )
Random directed walk for 500000 steps, including 0 resets, run took 409 ms (no deadlock found). (steps per millisecond=1222 )
Random walk for 500000 steps, including 0 resets, run took 519 ms (no deadlock found). (steps per millisecond=963 )
Random directed walk for 500000 steps, including 0 resets, run took 401 ms (no deadlock found). (steps per millisecond=1246 )
Random walk for 500000 steps, including 0 resets, run took 518 ms (no deadlock found). (steps per millisecond=965 )
Starting structural reductions in DEADLOCK mode, iteration 0 : 45/45 places, 91/91 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 6 ms. Remains 45 /45 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2025-06-03 15:35:54] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
[2025-06-03 15:35:54] [INFO ] Invariant cache hit.
[2025-06-03 15:35:54] [INFO ] Implicit Places using invariants in 68 ms returned []
[2025-06-03 15:35:54] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
[2025-06-03 15:35:54] [INFO ] Invariant cache hit.
[2025-06-03 15:35:54] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-03 15:35:54] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2025-06-03 15:35:54] [INFO ] Redundant transitions in 2 ms returned []
Running 88 sub problems to find dead transitions.
[2025-06-03 15:35:54] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
[2025-06-03 15:35:54] [INFO ] Invariant cache hit.
[2025-06-03 15:35:54] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 5/50 constraints. Problems are: Problem set: 0 solved, 88 unsolved
Problem TDEAD7 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD33 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 9/59 constraints. Problems are: Problem set: 9 solved, 79 unsolved
[2025-06-03 15:35:54] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2025-06-03 15:35:54] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2025-06-03 15:35:54] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2025-06-03 15:35:54] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2025-06-03 15:35:54] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2025-06-03 15:35:54] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2025-06-03 15:35:54] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 0 ms to minimize.
[2025-06-03 15:35:54] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2025-06-03 15:35:54] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2025-06-03 15:35:54] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2025-06-03 15:35:54] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 11/70 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/70 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 5 (OVERLAPS) 68/113 variables, 45/115 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 13/128 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 0/128 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 8 (OVERLAPS) 0/113 variables, 0/128 constraints. Problems are: Problem set: 9 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 113/113 variables, and 128 constraints, problems are : Problem set: 9 solved, 79 unsolved in 1698 ms.
Refiners :[Domain max(s): 45/45 constraints, Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 45/45 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 9 solved, 79 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 45/45 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 5/50 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 9/59 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 11/70 constraints. Problems are: Problem set: 9 solved, 79 unsolved
[2025-06-03 15:35:56] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2025-06-03 15:35:56] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 2/72 constraints. Problems are: Problem set: 9 solved, 79 unsolved
[2025-06-03 15:35:56] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 1/73 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/45 variables, 0/73 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 7 (OVERLAPS) 68/113 variables, 45/118 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 13/131 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/113 variables, 79/210 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/113 variables, 0/210 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 11 (OVERLAPS) 0/113 variables, 0/210 constraints. Problems are: Problem set: 9 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 113/113 variables, and 210 constraints, problems are : Problem set: 9 solved, 79 unsolved in 1771 ms.
Refiners :[Domain max(s): 45/45 constraints, Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 45/45 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 79/88 constraints, Known Traps: 14/14 constraints]
After SMT, in 3554ms problems are : Problem set: 9 solved, 79 unsolved
Search for dead transitions found 9 dead transitions in 3563ms
Found 9 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 9 transitions
Dead transitions reduction (with SMT) removed 9 transitions
Starting structural reductions in DEADLOCK mode, iteration 1 : 45/45 places, 82/91 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 9 ms. Remains 45 /45 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2025-06-03 15:35:57] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in DEADLOCK mode , in 2 iterations and 3759 ms. Remains : 45/45 places, 82/91 transitions.
Random walk for 1250000 steps, including 0 resets, run took 1230 ms (no deadlock found). (steps per millisecond=1016 )
Random directed walk for 1250001 steps, including 0 resets, run took 942 ms (no deadlock found). (steps per millisecond=1326 )
[2025-06-03 15:35:59] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
// Phase 1: matrix 68 rows 45 cols
[2025-06-03 15:35:59] [INFO ] Computed 14 invariants in 7 ms
[2025-06-03 15:36:00] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-03 15:36:00] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 20 ms returned sat
[2025-06-03 15:36:00] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-06-03 15:36:00] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 15:36:00] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-03 15:36:00] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 3 ms returned sat
[2025-06-03 15:36:00] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2025-06-03 15:36:00] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-03 15:36:00] [INFO ] [Nat]Added 13 Read/Feed constraints in 4 ms returned sat
[2025-06-03 15:36:00] [INFO ] Computed and/alt/rep : 37/219/37 causal constraints (skipped 28 transitions) in 5 ms.
[2025-06-03 15:36:00] [INFO ] Added : 22 causal constraints over 5 iterations in 48 ms. Result :sat
Parikh directed walk for 7600 steps, including 785 resets, run took 19 ms. (steps per millisecond=400 )
Random directed walk for 500000 steps, including 0 resets, run took 381 ms (no deadlock found). (steps per millisecond=1312 )
Random walk for 500000 steps, including 0 resets, run took 487 ms (no deadlock found). (steps per millisecond=1026 )
Random directed walk for 500000 steps, including 0 resets, run took 374 ms (no deadlock found). (steps per millisecond=1336 )
Random walk for 500000 steps, including 0 resets, run took 492 ms (no deadlock found). (steps per millisecond=1016 )
[2025-06-03 15:36:02] [INFO ] Flatten gal took : 35 ms
[2025-06-03 15:36:02] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityDeadlock.sr.xml took 1 ms.
[2025-06-03 15:36:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 54 places, 91 transitions and 529 arcs took 4 ms.
Total runtime 13628 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running SafeBus-PT-03

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 54
TRANSITIONS: 91
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.004s, Sys 0.000s]


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


----------------------------------------------------------------------
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: 601
MODEL NAME: /home/mcc/execution/412/model
54 places, 91 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 1748964962361

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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="SafeBus-PT-03"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is SafeBus-PT-03, 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 r196-tall-174889279200476"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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