fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r178-oct2-177969020000229
Last Updated
Jun 17, 2026

About the Execution of ITS-Tools for MedleyA-PT-17

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
599.604 47667.00 69482.00 133.00 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 6.9K Mar 7 18:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Mar 7 18:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Mar 7 18:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Mar 7 18:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 15 11:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 19K Mar 15 11:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 7 18:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Mar 7 18:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Mar 7 18:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K 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 175K 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-17-UpperBounds-00
FORMULA_NAME MedleyA-PT-17-UpperBounds-01
FORMULA_NAME MedleyA-PT-17-UpperBounds-02
FORMULA_NAME MedleyA-PT-17-UpperBounds-03
FORMULA_NAME MedleyA-PT-17-UpperBounds-04
FORMULA_NAME MedleyA-PT-17-UpperBounds-05
FORMULA_NAME MedleyA-PT-17-UpperBounds-06
FORMULA_NAME MedleyA-PT-17-UpperBounds-07
FORMULA_NAME MedleyA-PT-17-UpperBounds-08
FORMULA_NAME MedleyA-PT-17-UpperBounds-09
FORMULA_NAME MedleyA-PT-17-UpperBounds-10
FORMULA_NAME MedleyA-PT-17-UpperBounds-11
FORMULA_NAME MedleyA-PT-17-UpperBounds-12
FORMULA_NAME MedleyA-PT-17-UpperBounds-13
FORMULA_NAME MedleyA-PT-17-UpperBounds-14
FORMULA_NAME MedleyA-PT-17-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779700757739

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-17
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-25 09:19:19] [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:19:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 09:19:20] [INFO ] Load time of PNML (sax parser for PT used): 139 ms
[2026-05-25 09:19:20] [INFO ] Transformed 248 places.
[2026-05-25 09:19:20] [INFO ] Transformed 591 transitions.
[2026-05-25 09:19:20] [INFO ] Found NUPN structural information;
[2026-05-25 09:19:20] [INFO ] Parsed PT model containing 248 places and 591 transitions and 2764 arcs in 293 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 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-7868236963027640289.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2478561677131370956.kers'
[2026-05-25 09:19:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7868236963027640289.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2478561677131370956.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 589 rows 248 cols 2760 entries
Finished phase 1 with 240 SingleSign rule and 1 generalized
[2026-05-25 09:19:20] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-2478561677131370956.kers
Total runtime 10 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 (344 resets) in 57 ms. (172 steps per ms)
FORMULA MedleyA-PT-17-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-17-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-17-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-17-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-17-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-17-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 100008 steps (745 resets) in 87 ms. (1136 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2026-05-25 09:19:20] [INFO ] Invariant cache hit.
[2026-05-25 09:19:20] [INFO ] [Real]Absence check using 7 positive place invariants in 17 ms returned sat
[2026-05-25 09:19:21] [INFO ] [Real]Absence check using state equation in 208 ms returned sat
[2026-05-25 09:19:21] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:19:21] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2026-05-25 09:19:21] [INFO ] [Nat]Absence check using state equation in 258 ms returned sat
[2026-05-25 09:19:22] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 962 ms
[2026-05-25 09:19:22] [INFO ] Computed and/alt/rep : 385/1143/385 causal constraints (skipped 203 transitions) in 55 ms.
[2026-05-25 09:19:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 556 ms
[2026-05-25 09:19:24] [INFO ] Added : 161 causal constraints over 33 iterations in 2300 ms. Result :sat
Minimization took 200 ms.
[2026-05-25 09:19:25] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2026-05-25 09:19:25] [INFO ] [Real]Absence check using state equation in 193 ms returned sat
[2026-05-25 09:19:25] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:19:25] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2026-05-25 09:19:25] [INFO ] [Nat]Absence check using state equation in 315 ms returned sat
[2026-05-25 09:19:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 608 ms
[2026-05-25 09:19:26] [INFO ] Computed and/alt/rep : 385/1143/385 causal constraints (skipped 203 transitions) in 54 ms.
[2026-05-25 09:19:27] [INFO ] Added : 93 causal constraints over 19 iterations in 994 ms. Result :sat
Minimization took 173 ms.
[2026-05-25 09:19:27] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2026-05-25 09:19:28] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2026-05-25 09:19:28] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:19:28] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2026-05-25 09:19:28] [INFO ] [Nat]Absence check using state equation in 227 ms returned sat
[2026-05-25 09:19:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 651 ms
[2026-05-25 09:19:29] [INFO ] Computed and/alt/rep : 385/1143/385 causal constraints (skipped 203 transitions) in 37 ms.
[2026-05-25 09:19:32] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1073 ms
[2026-05-25 09:19:32] [INFO ] Added : 156 causal constraints over 32 iterations in 3181 ms. Result :sat
Minimization took 215 ms.
[2026-05-25 09:19:32] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2026-05-25 09:19:32] [INFO ] [Real]Absence check using state equation in 224 ms returned sat
[2026-05-25 09:19:32] [INFO ] Computed and/alt/rep : 385/1143/385 causal constraints (skipped 203 transitions) in 43 ms.
[2026-05-25 09:19:32] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:19:33] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2026-05-25 09:19:33] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2026-05-25 09:19:33] [INFO ] Computed and/alt/rep : 385/1143/385 causal constraints (skipped 203 transitions) in 35 ms.
[2026-05-25 09:19:35] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1622 ms
[2026-05-25 09:19:36] [INFO ] Added : 116 causal constraints over 24 iterations in 2830 ms. Result :sat
Minimization took 221 ms.
[2026-05-25 09:19:36] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2026-05-25 09:19:36] [INFO ] [Real]Absence check using state equation in 496 ms returned sat
[2026-05-25 09:19:36] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:19:37] [INFO ] [Nat]Absence check using 7 positive place invariants in 21 ms returned sat
[2026-05-25 09:19:37] [INFO ] [Nat]Absence check using state equation in 194 ms returned sat
[2026-05-25 09:19:38] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1047 ms
[2026-05-25 09:19:38] [INFO ] Computed and/alt/rep : 385/1143/385 causal constraints (skipped 203 transitions) in 34 ms.
[2026-05-25 09:19:39] [INFO ] Added : 130 causal constraints over 26 iterations in 1256 ms. Result :sat
Minimization took 198 ms.
[2026-05-25 09:19:39] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2026-05-25 09:19:40] [INFO ] [Real]Absence check using state equation in 174 ms returned sat
[2026-05-25 09:19:40] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:19:40] [INFO ] [Nat]Absence check using 7 positive place invariants in 9 ms returned sat
[2026-05-25 09:19:40] [INFO ] [Nat]Absence check using state equation in 192 ms returned sat
[2026-05-25 09:19:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 834 ms
[2026-05-25 09:19:41] [INFO ] Computed and/alt/rep : 385/1143/385 causal constraints (skipped 203 transitions) in 64 ms.
[2026-05-25 09:19:43] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 897 ms
[2026-05-25 09:19:43] [INFO ] Added : 124 causal constraints over 26 iterations in 2329 ms. Result :sat
Minimization took 200 ms.
[2026-05-25 09:19:44] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2026-05-25 09:19:44] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2026-05-25 09:19:44] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:19:44] [INFO ] [Nat]Absence check using 7 positive place invariants in 12 ms returned sat
[2026-05-25 09:19:44] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2026-05-25 09:19:46] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1641 ms
[2026-05-25 09:19:46] [INFO ] Computed and/alt/rep : 385/1143/385 causal constraints (skipped 203 transitions) in 51 ms.
[2026-05-25 09:19:47] [INFO ] Added : 143 causal constraints over 29 iterations in 1269 ms. Result :sat
Minimization took 262 ms.
[2026-05-25 09:19:47] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2026-05-25 09:19:48] [INFO ] [Real]Absence check using state equation in 198 ms returned sat
[2026-05-25 09:19:48] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:19:48] [INFO ] [Nat]Absence check using 7 positive place invariants in 13 ms returned sat
[2026-05-25 09:19:48] [INFO ] [Nat]Absence check using state equation in 210 ms returned sat
[2026-05-25 09:19:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 694 ms
[2026-05-25 09:19:49] [INFO ] Computed and/alt/rep : 385/1143/385 causal constraints (skipped 203 transitions) in 62 ms.
[2026-05-25 09:19:51] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1260 ms
[2026-05-25 09:19:51] [INFO ] Added : 168 causal constraints over 34 iterations in 2804 ms. Result :sat
Minimization took 194 ms.
[2026-05-25 09:19:52] [INFO ] [Real]Absence check using 7 positive place invariants in 14 ms returned sat
[2026-05-25 09:19:52] [INFO ] [Real]Absence check using state equation in 241 ms returned sat
[2026-05-25 09:19:52] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:19:52] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2026-05-25 09:19:52] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2026-05-25 09:19:54] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1160 ms
[2026-05-25 09:19:54] [INFO ] Computed and/alt/rep : 385/1143/385 causal constraints (skipped 203 transitions) in 37 ms.
[2026-05-25 09:19:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 542 ms
[2026-05-25 09:19:56] [INFO ] Added : 145 causal constraints over 30 iterations in 2211 ms. Result :sat
Minimization took 159 ms.
[2026-05-25 09:19:56] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2026-05-25 09:19:56] [INFO ] [Real]Absence check using state equation in 176 ms returned sat
[2026-05-25 09:19:56] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:19:56] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2026-05-25 09:19:56] [INFO ] [Nat]Absence check using state equation in 166 ms returned sat
[2026-05-25 09:19:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 876 ms
[2026-05-25 09:19:57] [INFO ] Computed and/alt/rep : 385/1143/385 causal constraints (skipped 203 transitions) in 62 ms.
[2026-05-25 09:20:00] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1815 ms
[2026-05-25 09:20:00] [INFO ] Added : 120 causal constraints over 24 iterations in 3046 ms. Result :sat
Minimization took 189 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 10 out of 248 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 248/248 places, 589/589 transitions.
Graph (trivial) has 259 edges and 248 vertex of which 6 / 248 are part of one of the 2 SCC in 8 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 244 transition count 554
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 33 rules applied. Total rules applied 63 place count 215 transition count 550
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 65 place count 213 transition count 550
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 65 place count 213 transition count 535
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 95 place count 198 transition count 535
Discarding 49 places :
Symmetric choice reduction at 3 with 49 rule applications. Total rules 144 place count 149 transition count 450
Iterating global reduction 3 with 49 rules applied. Total rules applied 193 place count 149 transition count 450
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 3 with 32 rules applied. Total rules applied 225 place count 149 transition count 418
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 225 place count 149 transition count 412
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 237 place count 143 transition count 412
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 241 place count 139 transition count 380
Iterating global reduction 4 with 4 rules applied. Total rules applied 245 place count 139 transition count 380
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 273 place count 125 transition count 366
Performed 22 Post agglomeration using F-continuation condition with reduction of 18 identical transitions.
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 317 place count 103 transition count 466
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 318 place count 103 transition count 465
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 319 place count 102 transition count 457
Iterating global reduction 5 with 1 rules applied. Total rules applied 320 place count 102 transition count 457
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 324 place count 102 transition count 453
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 6 with 12 rules applied. Total rules applied 336 place count 102 transition count 441
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 344 place count 98 transition count 437
Free-agglomeration rule applied 29 times.
Iterating global reduction 6 with 29 rules applied. Total rules applied 373 place count 98 transition count 408
Reduce places removed 29 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 6 with 53 rules applied. Total rules applied 426 place count 69 transition count 384
Drop transitions (Redundant composition of simpler transitions.) removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 7 with 23 rules applied. Total rules applied 449 place count 69 transition count 361
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 450 place count 69 transition count 375
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 451 place count 68 transition count 375
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 452 place count 68 transition count 375
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 453 place count 67 transition count 374
Applied a total of 453 rules in 203 ms. Remains 67 /248 variables (removed 181) and now considering 374/589 (removed 215) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 210 ms. Remains : 67/248 places, 374/589 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-755087128245951001.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14248644118423730295.kers'
[2026-05-25 09:20:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-755087128245951001.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14248644118423730295.kers]
Normalized transition count is 303 out of 374 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 303 rows 66 cols 1370 entries
Finished phase 1 with 59 SingleSign rule and 1 generalized
[2026-05-25 09:20:02] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14248644118423730295.kers
Total runtime 2 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (92227 resets) in 2381 ms. (419 steps per ms)
FORMULA MedleyA-PT-17-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-17-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-17-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-17-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-17-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-17-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-17-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-17-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-17-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-17-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (52 resets) in 719 ms. (1388 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 45375 ms.

BK_STOP 1779700805406

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

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