Execution Chart

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

Trace from the execution

Formatting '/data/sdalzilio/mcc2026-input.r178-oct2-177969020000245.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/sdalzilio/mcc2026-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is MedleyA-PT-19, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-oct2-177969020000245
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 700K
-rw-r--r-- 1 mcc users 8.0K Mar 7 18:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Mar 7 18:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Mar 7 18:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Mar 7 18:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 15 11:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 11:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 11:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 11:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Mar 7 18:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 162K Mar 7 18:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Mar 7 18:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Mar 7 18:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 184K Mar 3 18:30 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME MedleyA-PT-19-UpperBounds-00
FORMULA_NAME MedleyA-PT-19-UpperBounds-01
FORMULA_NAME MedleyA-PT-19-UpperBounds-02
FORMULA_NAME MedleyA-PT-19-UpperBounds-03
FORMULA_NAME MedleyA-PT-19-UpperBounds-04
FORMULA_NAME MedleyA-PT-19-UpperBounds-05
FORMULA_NAME MedleyA-PT-19-UpperBounds-06
FORMULA_NAME MedleyA-PT-19-UpperBounds-07
FORMULA_NAME MedleyA-PT-19-UpperBounds-08
FORMULA_NAME MedleyA-PT-19-UpperBounds-09
FORMULA_NAME MedleyA-PT-19-UpperBounds-10
FORMULA_NAME MedleyA-PT-19-UpperBounds-11
FORMULA_NAME MedleyA-PT-19-UpperBounds-12
FORMULA_NAME MedleyA-PT-19-UpperBounds-13
FORMULA_NAME MedleyA-PT-19-UpperBounds-14
FORMULA_NAME MedleyA-PT-19-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779701491691

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-19
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-25 09:31:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 09:31:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 09:31:33] [INFO ] Load time of PNML (sax parser for PT used): 119 ms
[2026-05-25 09:31:33] [INFO ] Transformed 272 places.
[2026-05-25 09:31:33] [INFO ] Transformed 586 transitions.
[2026-05-25 09:31:33] [INFO ] Found NUPN structural information;
[2026-05-25 09:31:33] [INFO ] Parsed PT model containing 272 places and 586 transitions and 2889 arcs in 231 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 3 transitions.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4159186444915779044.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14407835017245061958.kers'
[2026-05-25 09:31:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4159186444915779044.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14407835017245061958.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 583 rows 269 cols 2883 entries
Finished phase 1 with 238 SingleSign rule and 7 generalized
[2026-05-25 09:31:33] [INFO ] Computed 24 invariants in 2 ms
Computed 24 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-14407835017245061958.kers
Total runtime 3 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 72 ms. (136 steps per ms)
FORMULA MedleyA-PT-19-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-19-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-19-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-19-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-19-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-19-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-19-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90002 steps (35 resets) in 237 ms. (378 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
[2026-05-25 09:31:33] [INFO ] Invariant cache hit.
[2026-05-25 09:31:34] [INFO ] [Real]Absence check using 16 positive place invariants in 14 ms returned sat
[2026-05-25 09:31:34] [INFO ] [Real]Absence check using 16 positive and 8 generalized place invariants in 9 ms returned sat
[2026-05-25 09:31:34] [INFO ] [Real]Absence check using state equation in 228 ms returned sat
[2026-05-25 09:31:34] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:31:34] [INFO ] [Nat]Absence check using 16 positive place invariants in 10 ms returned sat
[2026-05-25 09:31:34] [INFO ] [Nat]Absence check using 16 positive and 8 generalized place invariants in 1 ms returned sat
[2026-05-25 09:31:34] [INFO ] [Nat]Absence check using state equation in 113 ms returned sat
[2026-05-25 09:31:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 152 ms
[2026-05-25 09:31:35] [INFO ] Computed and/alt/rep : 205/568/205 causal constraints (skipped 377 transitions) in 39 ms.
[2026-05-25 09:31:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 212 ms
[2026-05-25 09:31:36] [INFO ] Added : 140 causal constraints over 28 iterations in 1613 ms. Result :sat
Minimization took 379 ms.
[2026-05-25 09:31:37] [INFO ] [Real]Absence check using 16 positive place invariants in 27 ms returned sat
[2026-05-25 09:31:37] [INFO ] [Real]Absence check using 16 positive and 8 generalized place invariants in 14 ms returned sat
[2026-05-25 09:31:37] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2026-05-25 09:31:37] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:31:37] [INFO ] [Nat]Absence check using 16 positive place invariants in 13 ms returned sat
[2026-05-25 09:31:37] [INFO ] [Nat]Absence check using 16 positive and 8 generalized place invariants in 2 ms returned sat
[2026-05-25 09:31:37] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2026-05-25 09:31:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 382 ms
[2026-05-25 09:31:38] [INFO ] Computed and/alt/rep : 205/568/205 causal constraints (skipped 377 transitions) in 59 ms.
[2026-05-25 09:31:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 583 ms
[2026-05-25 09:31:40] [INFO ] Added : 152 causal constraints over 31 iterations in 2014 ms. Result :sat
Minimization took 296 ms.
[2026-05-25 09:31:40] [INFO ] [Real]Absence check using 16 positive place invariants in 34 ms returned sat
[2026-05-25 09:31:40] [INFO ] [Real]Absence check using 16 positive and 8 generalized place invariants in 7 ms returned sat
[2026-05-25 09:31:40] [INFO ] [Real]Absence check using state equation in 117 ms returned sat
[2026-05-25 09:31:40] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:31:41] [INFO ] [Nat]Absence check using 16 positive place invariants in 12 ms returned sat
[2026-05-25 09:31:41] [INFO ] [Nat]Absence check using 16 positive and 8 generalized place invariants in 5 ms returned sat
[2026-05-25 09:31:41] [INFO ] [Nat]Absence check using state equation in 105 ms returned sat
[2026-05-25 09:31:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 263 ms
[2026-05-25 09:31:41] [INFO ] Computed and/alt/rep : 205/568/205 causal constraints (skipped 377 transitions) in 45 ms.
[2026-05-25 09:31:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 429 ms
[2026-05-25 09:31:43] [INFO ] Added : 145 causal constraints over 30 iterations in 2103 ms. Result :sat
Minimization took 314 ms.
[2026-05-25 09:31:43] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2026-05-25 09:31:43] [INFO ] [Real]Absence check using 16 positive and 8 generalized place invariants in 3 ms returned sat
[2026-05-25 09:31:44] [INFO ] [Real]Absence check using state equation in 204 ms returned sat
[2026-05-25 09:31:44] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:31:44] [INFO ] [Nat]Absence check using 16 positive place invariants in 18 ms returned sat
[2026-05-25 09:31:44] [INFO ] [Nat]Absence check using 16 positive and 8 generalized place invariants in 6 ms returned sat
[2026-05-25 09:31:44] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2026-05-25 09:31:44] [INFO ] Computed and/alt/rep : 205/568/205 causal constraints (skipped 377 transitions) in 52 ms.
[2026-05-25 09:31:46] [INFO ] Added : 144 causal constraints over 29 iterations in 1591 ms. Result :sat
Minimization took 376 ms.
[2026-05-25 09:31:46] [INFO ] [Real]Absence check using 16 positive place invariants in 6 ms returned sat
[2026-05-25 09:31:46] [INFO ] [Real]Absence check using 16 positive and 8 generalized place invariants in 2 ms returned sat
[2026-05-25 09:31:46] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2026-05-25 09:31:46] [INFO ] Computed and/alt/rep : 205/568/205 causal constraints (skipped 377 transitions) in 43 ms.
[2026-05-25 09:31:46] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:31:47] [INFO ] [Nat]Absence check using 16 positive place invariants in 10 ms returned sat
[2026-05-25 09:31:47] [INFO ] [Nat]Absence check using 16 positive and 8 generalized place invariants in 4 ms returned sat
[2026-05-25 09:31:47] [INFO ] [Nat]Absence check using state equation in 208 ms returned sat
[2026-05-25 09:31:47] [INFO ] Computed and/alt/rep : 205/568/205 causal constraints (skipped 377 transitions) in 44 ms.
[2026-05-25 09:31:48] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 563 ms
[2026-05-25 09:31:48] [INFO ] Added : 147 causal constraints over 30 iterations in 1568 ms. Result :sat
Minimization took 251 ms.
[2026-05-25 09:31:49] [INFO ] [Real]Absence check using 16 positive place invariants in 7 ms returned sat
[2026-05-25 09:31:49] [INFO ] [Real]Absence check using 16 positive and 8 generalized place invariants in 6 ms returned sat
[2026-05-25 09:31:49] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2026-05-25 09:31:49] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:31:49] [INFO ] [Nat]Absence check using 16 positive place invariants in 20 ms returned sat
[2026-05-25 09:31:49] [INFO ] [Nat]Absence check using 16 positive and 8 generalized place invariants in 14 ms returned sat
[2026-05-25 09:31:49] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2026-05-25 09:31:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 193 ms
[2026-05-25 09:31:49] [INFO ] Computed and/alt/rep : 205/568/205 causal constraints (skipped 377 transitions) in 30 ms.
[2026-05-25 09:31:51] [INFO ] Added : 147 causal constraints over 30 iterations in 1586 ms. Result :sat
Minimization took 365 ms.
[2026-05-25 09:31:52] [INFO ] [Real]Absence check using 16 positive place invariants in 11 ms returned sat
[2026-05-25 09:31:52] [INFO ] [Real]Absence check using 16 positive and 8 generalized place invariants in 5 ms returned sat
[2026-05-25 09:31:52] [INFO ] [Real]Absence check using state equation in 181 ms returned sat
[2026-05-25 09:31:52] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:31:52] [INFO ] [Nat]Absence check using 16 positive place invariants in 17 ms returned sat
[2026-05-25 09:31:52] [INFO ] [Nat]Absence check using 16 positive and 8 generalized place invariants in 2 ms returned sat
[2026-05-25 09:31:52] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2026-05-25 09:31:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 403 ms
[2026-05-25 09:31:53] [INFO ] Computed and/alt/rep : 205/568/205 causal constraints (skipped 377 transitions) in 30 ms.
[2026-05-25 09:31:55] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1270 ms
[2026-05-25 09:31:55] [INFO ] Added : 146 causal constraints over 30 iterations in 2639 ms. Result :sat
Minimization took 371 ms.
[2026-05-25 09:31:56] [INFO ] [Real]Absence check using 16 positive place invariants in 11 ms returned sat
[2026-05-25 09:31:56] [INFO ] [Real]Absence check using 16 positive and 8 generalized place invariants in 3 ms returned sat
[2026-05-25 09:31:56] [INFO ] [Real]Absence check using state equation in 172 ms returned sat
[2026-05-25 09:31:56] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:31:56] [INFO ] [Nat]Absence check using 16 positive place invariants in 8 ms returned sat
[2026-05-25 09:31:56] [INFO ] [Nat]Absence check using 16 positive and 8 generalized place invariants in 2 ms returned sat
[2026-05-25 09:31:56] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2026-05-25 09:31:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 402 ms
[2026-05-25 09:31:57] [INFO ] Computed and/alt/rep : 205/568/205 causal constraints (skipped 377 transitions) in 31 ms.
[2026-05-25 09:31:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 450 ms
[2026-05-25 09:31:59] [INFO ] Added : 143 causal constraints over 30 iterations in 2151 ms. Result :sat
Minimization took 370 ms.
[2026-05-25 09:31:59] [INFO ] [Real]Absence check using 16 positive place invariants in 10 ms returned sat
[2026-05-25 09:31:59] [INFO ] [Real]Absence check using 16 positive and 8 generalized place invariants in 2 ms returned sat
[2026-05-25 09:32:00] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2026-05-25 09:32:00] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:32:00] [INFO ] [Nat]Absence check using 16 positive place invariants in 8 ms returned sat
[2026-05-25 09:32:00] [INFO ] [Nat]Absence check using 16 positive and 8 generalized place invariants in 2 ms returned sat
[2026-05-25 09:32:00] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2026-05-25 09:32:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
[2026-05-25 09:32:00] [INFO ] Computed and/alt/rep : 205/568/205 causal constraints (skipped 377 transitions) in 42 ms.
[2026-05-25 09:32:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 169 ms
[2026-05-25 09:32:02] [INFO ] Added : 134 causal constraints over 28 iterations in 1592 ms. Result :sat
Minimization took 285 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA MedleyA-PT-19-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-19-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-19-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-19-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 583/583 transitions.
Graph (complete) has 909 edges and 269 vertex of which 263 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 263 transition count 530
Reduce places removed 48 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 54 rules applied. Total rules applied 104 place count 215 transition count 524
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 107 place count 212 transition count 524
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 107 place count 212 transition count 518
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 119 place count 206 transition count 518
Discarding 67 places :
Symmetric choice reduction at 3 with 67 rule applications. Total rules 186 place count 139 transition count 433
Iterating global reduction 3 with 67 rules applied. Total rules applied 253 place count 139 transition count 433
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 253 place count 139 transition count 431
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 257 place count 137 transition count 431
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 325 place count 103 transition count 397
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 329 place count 103 transition count 393
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 339 place count 98 transition count 422
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 4 with 36 rules applied. Total rules applied 375 place count 98 transition count 386
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 377 place count 97 transition count 396
Free-agglomeration rule applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 383 place count 97 transition count 390
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 389 place count 91 transition count 390
Free-agglomeration rule (complex) applied 18 times.
Iterating global reduction 5 with 18 rules applied. Total rules applied 407 place count 91 transition count 594
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 5 with 72 rules applied. Total rules applied 479 place count 73 transition count 540
Applied a total of 479 rules in 146 ms. Remains 73 /269 variables (removed 196) and now considering 540/583 (removed 43) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 167 ms. Remains : 73/269 places, 540/583 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1614822280386920939.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18003485976258226335.kers'
[2026-05-25 09:32:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1614822280386920939.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18003485976258226335.kers]
Normalized transition count is 464 out of 540 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 464 rows 71 cols 2573 entries
Finished phase 1 with 45 SingleSign rule and 5 generalized
[2026-05-25 09:32:03] [INFO ] Computed 23 invariants in 1 ms
Computed 23 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-18003485976258226335.kers
Total runtime 2 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (159293 resets) in 6098 ms. (163 steps per ms)
FORMULA MedleyA-PT-19-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-19-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-19-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-19-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-19-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (19831 resets) in 1130 ms. (884 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 37345 ms.

BK_STOP 1779701530656

--------------------
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
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ 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.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="MedleyA-PT-19"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is MedleyA-PT-19, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r178-oct2-177969020000245"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-19.tgz
mv MedleyA-PT-19 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;