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-177969020000213.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-15, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-oct2-177969020000213
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 6.7K Mar 7 18:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Mar 7 18:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Mar 7 18:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 83K Mar 7 18:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 15 11:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 15 11:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 11:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 11:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 7 18:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Mar 7 18:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Mar 7 18:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Mar 7 18:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:29 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 110K 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-15-UpperBounds-00
FORMULA_NAME MedleyA-PT-15-UpperBounds-01
FORMULA_NAME MedleyA-PT-15-UpperBounds-02
FORMULA_NAME MedleyA-PT-15-UpperBounds-03
FORMULA_NAME MedleyA-PT-15-UpperBounds-04
FORMULA_NAME MedleyA-PT-15-UpperBounds-05
FORMULA_NAME MedleyA-PT-15-UpperBounds-06
FORMULA_NAME MedleyA-PT-15-UpperBounds-07
FORMULA_NAME MedleyA-PT-15-UpperBounds-08
FORMULA_NAME MedleyA-PT-15-UpperBounds-09
FORMULA_NAME MedleyA-PT-15-UpperBounds-10
FORMULA_NAME MedleyA-PT-15-UpperBounds-11
FORMULA_NAME MedleyA-PT-15-UpperBounds-12
FORMULA_NAME MedleyA-PT-15-UpperBounds-13
FORMULA_NAME MedleyA-PT-15-UpperBounds-14
FORMULA_NAME MedleyA-PT-15-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779700502337

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-15
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-25 09:15:03] [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:15:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 09:15:04] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2026-05-25 09:15:04] [INFO ] Transformed 192 places.
[2026-05-25 09:15:04] [INFO ] Transformed 475 transitions.
[2026-05-25 09:15:04] [INFO ] Found NUPN structural information;
[2026-05-25 09:15:04] [INFO ] Parsed PT model containing 192 places and 475 transitions and 1522 arcs in 257 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 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-18334947220171677063.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17741390819901845137.kers'
[2026-05-25 09:15:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18334947220171677063.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17741390819901845137.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 473 rows 192 cols 1518 entries
Finished phase 1 with 184 SingleSign rule and 1 generalized
[2026-05-25 09:15:04] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-17741390819901845137.kers
Total runtime 16 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 64 ms. (153 steps per ms)
FORMULA MedleyA-PT-15-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-15-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-15-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-15-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-15-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 110006 steps (22 resets) in 218 ms. (502 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2026-05-25 09:15:04] [INFO ] Invariant cache hit.
[2026-05-25 09:15:04] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned sat
[2026-05-25 09:15:05] [INFO ] [Real]Absence check using state equation in 273 ms returned sat
[2026-05-25 09:15:05] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:15:05] [INFO ] [Nat]Absence check using 7 positive place invariants in 44 ms returned sat
[2026-05-25 09:15:05] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2026-05-25 09:15:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 280 ms
[2026-05-25 09:15:05] [INFO ] Computed and/alt/rep : 370/1564/370 causal constraints (skipped 102 transitions) in 39 ms.
[2026-05-25 09:15:09] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1246 ms
[2026-05-25 09:15:09] [INFO ] Added : 266 causal constraints over 54 iterations in 3609 ms. Result :sat
Minimization took 502 ms.
[2026-05-25 09:15:10] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2026-05-25 09:15:10] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2026-05-25 09:15:10] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:15:10] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2026-05-25 09:15:10] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2026-05-25 09:15:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 147 ms
[2026-05-25 09:15:10] [INFO ] Computed and/alt/rep : 370/1564/370 causal constraints (skipped 102 transitions) in 26 ms.
[2026-05-25 09:15:14] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1264 ms
[2026-05-25 09:15:14] [INFO ] Added : 240 causal constraints over 48 iterations in 3484 ms. Result :sat
Minimization took 345 ms.
[2026-05-25 09:15:14] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2026-05-25 09:15:14] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2026-05-25 09:15:15] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:15:15] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2026-05-25 09:15:15] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2026-05-25 09:15:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 444 ms
[2026-05-25 09:15:15] [INFO ] Computed and/alt/rep : 370/1564/370 causal constraints (skipped 102 transitions) in 43 ms.
[2026-05-25 09:15:17] [INFO ] Added : 230 causal constraints over 47 iterations in 2174 ms. Result :sat
Minimization took 141 ms.
[2026-05-25 09:15:18] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned sat
[2026-05-25 09:15:18] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2026-05-25 09:15:18] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:15:18] [INFO ] [Nat]Absence check using 7 positive place invariants in 39 ms returned sat
[2026-05-25 09:15:18] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2026-05-25 09:15:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 488 ms
[2026-05-25 09:15:19] [INFO ] Computed and/alt/rep : 370/1564/370 causal constraints (skipped 102 transitions) in 26 ms.
[2026-05-25 09:15:21] [INFO ] Added : 208 causal constraints over 44 iterations in 2196 ms. Result :sat
Minimization took 189 ms.
[2026-05-25 09:15:21] [INFO ] [Real]Absence check using 7 positive place invariants in 8 ms returned sat
[2026-05-25 09:15:21] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2026-05-25 09:15:22] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:15:22] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2026-05-25 09:15:22] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2026-05-25 09:15:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 655 ms
[2026-05-25 09:15:22] [INFO ] Computed and/alt/rep : 370/1564/370 causal constraints (skipped 102 transitions) in 30 ms.
[2026-05-25 09:15:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 327 ms
[2026-05-25 09:15:26] [INFO ] Added : 243 causal constraints over 52 iterations in 3273 ms. Result :sat
Minimization took 270 ms.
[2026-05-25 09:15:26] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2026-05-25 09:15:26] [INFO ] [Real]Absence check using state equation in 103 ms returned sat
[2026-05-25 09:15:26] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:15:27] [INFO ] [Nat]Absence check using 7 positive place invariants in 9 ms returned sat
[2026-05-25 09:15:27] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2026-05-25 09:15:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 582 ms
[2026-05-25 09:15:27] [INFO ] Computed and/alt/rep : 370/1564/370 causal constraints (skipped 102 transitions) in 33 ms.
[2026-05-25 09:15:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 971 ms
[2026-05-25 09:15:31] [INFO ] Added : 249 causal constraints over 51 iterations in 3759 ms. Result :sat
Minimization took 166 ms.
[2026-05-25 09:15:31] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2026-05-25 09:15:31] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2026-05-25 09:15:32] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:15:32] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2026-05-25 09:15:32] [INFO ] [Nat]Absence check using state equation in 189 ms returned sat
[2026-05-25 09:15:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 339 ms
[2026-05-25 09:15:32] [INFO ] Computed and/alt/rep : 370/1564/370 causal constraints (skipped 102 transitions) in 35 ms.
[2026-05-25 09:15:36] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1188 ms
[2026-05-25 09:15:36] [INFO ] Added : 247 causal constraints over 50 iterations in 3724 ms. Result :sat
Minimization took 502 ms.
[2026-05-25 09:15:37] [INFO ] [Real]Absence check using 7 positive place invariants in 13 ms returned sat
[2026-05-25 09:15:37] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2026-05-25 09:15:37] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:15:37] [INFO ] [Nat]Absence check using 7 positive place invariants in 17 ms returned sat
[2026-05-25 09:15:37] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2026-05-25 09:15:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 489 ms
[2026-05-25 09:15:38] [INFO ] Computed and/alt/rep : 370/1564/370 causal constraints (skipped 102 transitions) in 22 ms.
[2026-05-25 09:15:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 641 ms
[2026-05-25 09:15:41] [INFO ] Added : 206 causal constraints over 42 iterations in 3442 ms. Result :sat
Minimization took 151 ms.
[2026-05-25 09:15:41] [INFO ] [Real]Absence check using 7 positive place invariants in 11 ms returned sat
[2026-05-25 09:15:42] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2026-05-25 09:15:42] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:15:42] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2026-05-25 09:15:42] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2026-05-25 09:15:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 399 ms
[2026-05-25 09:15:42] [INFO ] Computed and/alt/rep : 370/1564/370 causal constraints (skipped 102 transitions) in 32 ms.
[2026-05-25 09:15:45] [INFO ] Added : 259 causal constraints over 53 iterations in 2439 ms. Result :sat
Minimization took 314 ms.
[2026-05-25 09:15:45] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2026-05-25 09:15:45] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2026-05-25 09:15:46] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:15:46] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2026-05-25 09:15:46] [INFO ] [Nat]Absence check using state equation in 107 ms returned sat
[2026-05-25 09:15:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 393 ms
[2026-05-25 09:15:46] [INFO ] Computed and/alt/rep : 370/1564/370 causal constraints (skipped 102 transitions) in 31 ms.
[2026-05-25 09:15:49] [INFO ] Added : 224 causal constraints over 46 iterations in 2704 ms. Result :sat
Minimization took 189 ms.
[2026-05-25 09:15:49] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2026-05-25 09:15:49] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2026-05-25 09:15:50] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:15:50] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2026-05-25 09:15:50] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2026-05-25 09:15:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 437 ms
[2026-05-25 09:15:50] [INFO ] Computed and/alt/rep : 370/1564/370 causal constraints (skipped 102 transitions) in 21 ms.
[2026-05-25 09:15:51] [INFO ] Added : 100 causal constraints over 21 iterations in 729 ms. Result :sat
Minimization took 100 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA MedleyA-PT-15-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-15-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-15-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-15-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Support contains 7 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 473/473 transitions.
Graph (trivial) has 212 edges and 192 vertex of which 9 / 192 are part of one of the 3 SCC in 8 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 186 transition count 439
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 28 rules applied. Total rules applied 54 place count 161 transition count 436
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 55 place count 160 transition count 436
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 55 place count 160 transition count 430
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 67 place count 154 transition count 430
Discarding 44 places :
Symmetric choice reduction at 3 with 44 rule applications. Total rules 111 place count 110 transition count 354
Iterating global reduction 3 with 44 rules applied. Total rules applied 155 place count 110 transition count 354
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 3 with 17 rules applied. Total rules applied 172 place count 110 transition count 337
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 172 place count 110 transition count 329
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 188 place count 102 transition count 329
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 189 place count 102 transition count 328
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 190 place count 101 transition count 324
Iterating global reduction 5 with 1 rules applied. Total rules applied 191 place count 101 transition count 324
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 209 place count 92 transition count 315
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -121
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 241 place count 76 transition count 436
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 244 place count 76 transition count 433
Drop transitions (Redundant composition of simpler transitions.) removed 63 transitions
Redundant transition composition rules discarded 63 transitions
Iterating global reduction 6 with 63 rules applied. Total rules applied 307 place count 76 transition count 370
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 6 with 2 rules applied. Total rules applied 309 place count 75 transition count 380
Free-agglomeration rule applied 22 times with reduction of 7 identical transitions.
Iterating global reduction 6 with 22 rules applied. Total rules applied 331 place count 75 transition count 351
Reduce places removed 22 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 6 with 51 rules applied. Total rules applied 382 place count 53 transition count 322
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 14 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 384 place count 52 transition count 335
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 390 place count 52 transition count 329
Drop transitions (Redundant composition of simpler transitions.) removed 34 transitions
Redundant transition composition rules discarded 34 transitions
Iterating global reduction 8 with 34 rules applied. Total rules applied 424 place count 52 transition count 295
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 425 place count 51 transition count 294
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 33 edges and 49 vertex of which 8 / 49 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 8 with 3 rules applied. Total rules applied 428 place count 45 transition count 294
Drop transitions (Empty/Sink Transition effects.) removed 48 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 9 with 60 rules applied. Total rules applied 488 place count 45 transition count 234
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 492 place count 41 transition count 206
Iterating global reduction 10 with 4 rules applied. Total rules applied 496 place count 41 transition count 206
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 497 place count 41 transition count 205
Drop transitions (Redundant composition of simpler transitions.) removed 44 transitions
Redundant transition composition rules discarded 44 transitions
Iterating global reduction 11 with 44 rules applied. Total rules applied 541 place count 41 transition count 161
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 11 with 4 rules applied. Total rules applied 545 place count 39 transition count 159
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 547 place count 38 transition count 164
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 11 with 12 rules applied. Total rules applied 559 place count 38 transition count 152
Applied a total of 559 rules in 260 ms. Remains 38 /192 variables (removed 154) and now considering 152/473 (removed 321) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 271 ms. Remains : 38/192 places, 152/473 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10491240324356754304.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8506230072095337025.kers'
[2026-05-25 09:15:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10491240324356754304.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8506230072095337025.kers]
Normalized transition count is 137 out of 152 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 137 rows 37 cols 496 entries
Finished phase 1 with 32 SingleSign rule and 1 generalized
[2026-05-25 09:15:52] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8506230072095337025.kers
Total runtime 0 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (78 resets) in 1150 ms. (868 steps per ms)
FORMULA MedleyA-PT-15-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-15-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-15-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-15-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-15-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-15-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-15-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (2 resets) in 899 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 50790 ms.

BK_STOP 1779700554772

--------------------
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-15"
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-15, 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-177969020000213"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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