Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r066-tall-177946967700381.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool itstools
Input is CO4-PT-13, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tall-177946967700381
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 5.5K Mar 6 13:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Mar 6 13:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Mar 6 13:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Mar 6 13:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 08:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 08:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 08:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 15 08:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.5K Mar 6 13:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 72K Mar 6 13:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Mar 6 13:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Mar 6 13:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 08:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:31 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 191K 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 CO4-PT-13-UpperBounds-00
FORMULA_NAME CO4-PT-13-UpperBounds-01
FORMULA_NAME CO4-PT-13-UpperBounds-02
FORMULA_NAME CO4-PT-13-UpperBounds-03
FORMULA_NAME CO4-PT-13-UpperBounds-04
FORMULA_NAME CO4-PT-13-UpperBounds-05
FORMULA_NAME CO4-PT-13-UpperBounds-06
FORMULA_NAME CO4-PT-13-UpperBounds-07
FORMULA_NAME CO4-PT-13-UpperBounds-08
FORMULA_NAME CO4-PT-13-UpperBounds-09
FORMULA_NAME CO4-PT-13-UpperBounds-10
FORMULA_NAME CO4-PT-13-UpperBounds-11
FORMULA_NAME CO4-PT-13-UpperBounds-12
FORMULA_NAME CO4-PT-13-UpperBounds-13
FORMULA_NAME CO4-PT-13-UpperBounds-14
FORMULA_NAME CO4-PT-13-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779523164806

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-13
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-23 07:59:25] [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-23 07:59:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 07:59:26] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2026-05-23 07:59:26] [INFO ] Transformed 649 places.
[2026-05-23 07:59:26] [INFO ] Transformed 816 transitions.
[2026-05-23 07:59:26] [INFO ] Found NUPN structural information;
[2026-05-23 07:59:26] [INFO ] Parsed PT model containing 649 places and 816 transitions and 2232 arcs in 178 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 172 places in 10 ms
Reduce places removed 172 places and 227 transitions.
FORMULA CO4-PT-13-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-13-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-13-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-13-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA CO4-PT-13-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Before main loop) : 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]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16966655753550550110.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1095076438837185217.kers'
[2026-05-23 07:59:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16966655753550550110.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1095076438837185217.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 589 rows 477 cols 1578 entries
Finished phase 1 with 458 SingleSign rule and 10 generalized
[2026-05-23 07:59:26] [INFO ] Computed 9 invariants in 2 ms
Computed 9 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-1095076438837185217.kers
Total runtime 5 ms.
Current structural bounds on expressions (after invariants) : 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]
RANDOM walk for 10000 steps (191 resets) in 41 ms. (238 steps per ms)
FORMULA CO4-PT-13-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-13-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90001 steps (265 resets) in 141 ms. (633 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-23 07:59:26] [INFO ] Invariant cache hit.
[2026-05-23 07:59:26] [INFO ] [Real]Absence check using 8 positive place invariants in 17 ms returned sat
[2026-05-23 07:59:26] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 2 ms returned sat
[2026-05-23 07:59:26] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2026-05-23 07:59:26] [INFO ] Computed and/alt/rep : 484/755/484 causal constraints (skipped 104 transitions) in 42 ms.
[2026-05-23 07:59:27] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 07:59:27] [INFO ] [Nat]Absence check using 8 positive place invariants in 13 ms returned sat
[2026-05-23 07:59:27] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-23 07:59:27] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2026-05-23 07:59:27] [INFO ] Computed and/alt/rep : 484/755/484 causal constraints (skipped 104 transitions) in 33 ms.
[2026-05-23 07:59:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 220 ms
[2026-05-23 07:59:28] [INFO ] Added : 70 causal constraints over 15 iterations in 850 ms. Result :sat
Minimization took 333 ms.
[2026-05-23 07:59:28] [INFO ] [Real]Absence check using 8 positive place invariants in 11 ms returned sat
[2026-05-23 07:59:28] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 2 ms returned sat
[2026-05-23 07:59:28] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2026-05-23 07:59:28] [INFO ] Computed and/alt/rep : 484/755/484 causal constraints (skipped 104 transitions) in 32 ms.
[2026-05-23 07:59:28] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 07:59:29] [INFO ] [Nat]Absence check using 8 positive place invariants in 12 ms returned sat
[2026-05-23 07:59:29] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 2 ms returned sat
[2026-05-23 07:59:29] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2026-05-23 07:59:29] [INFO ] Computed and/alt/rep : 484/755/484 causal constraints (skipped 104 transitions) in 30 ms.
[2026-05-23 07:59:29] [INFO ] Added : 81 causal constraints over 17 iterations in 640 ms. Result :sat
Minimization took 223 ms.
[2026-05-23 07:59:30] [INFO ] [Real]Absence check using 8 positive place invariants in 11 ms returned sat
[2026-05-23 07:59:30] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 2 ms returned sat
[2026-05-23 07:59:30] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2026-05-23 07:59:30] [INFO ] Computed and/alt/rep : 484/755/484 causal constraints (skipped 104 transitions) in 37 ms.
[2026-05-23 07:59:30] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 07:59:30] [INFO ] [Nat]Absence check using 8 positive place invariants in 12 ms returned sat
[2026-05-23 07:59:30] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 3 ms returned sat
[2026-05-23 07:59:30] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2026-05-23 07:59:30] [INFO ] Computed and/alt/rep : 484/755/484 causal constraints (skipped 104 transitions) in 30 ms.
[2026-05-23 07:59:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 225 ms
[2026-05-23 07:59:31] [INFO ] Added : 84 causal constraints over 18 iterations in 857 ms. Result :sat
Minimization took 325 ms.
[2026-05-23 07:59:31] [INFO ] [Real]Absence check using 8 positive place invariants in 11 ms returned sat
[2026-05-23 07:59:31] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-23 07:59:32] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2026-05-23 07:59:32] [INFO ] Computed and/alt/rep : 484/755/484 causal constraints (skipped 104 transitions) in 32 ms.
[2026-05-23 07:59:32] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 07:59:32] [INFO ] [Nat]Absence check using 8 positive place invariants in 12 ms returned sat
[2026-05-23 07:59:32] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-23 07:59:32] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2026-05-23 07:59:32] [INFO ] Computed and/alt/rep : 484/755/484 causal constraints (skipped 104 transitions) in 30 ms.
[2026-05-23 07:59:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 212 ms
[2026-05-23 07:59:33] [INFO ] Added : 104 causal constraints over 21 iterations in 1037 ms. Result :sat
Minimization took 501 ms.
[2026-05-23 07:59:34] [INFO ] [Real]Absence check using 8 positive place invariants in 10 ms returned sat
[2026-05-23 07:59:34] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-23 07:59:34] [INFO ] [Real]Absence check using state equation in 135 ms returned sat
[2026-05-23 07:59:34] [INFO ] Computed and/alt/rep : 484/755/484 causal constraints (skipped 104 transitions) in 33 ms.
[2026-05-23 07:59:34] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 07:59:34] [INFO ] [Nat]Absence check using 8 positive place invariants in 12 ms returned sat
[2026-05-23 07:59:34] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-23 07:59:34] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2026-05-23 07:59:34] [INFO ] Computed and/alt/rep : 484/755/484 causal constraints (skipped 104 transitions) in 25 ms.
[2026-05-23 07:59:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 167 ms
[2026-05-23 07:59:35] [INFO ] Added : 127 causal constraints over 26 iterations in 1061 ms. Result :sat
Minimization took 382 ms.
[2026-05-23 07:59:36] [INFO ] [Real]Absence check using 8 positive place invariants in 11 ms returned sat
[2026-05-23 07:59:36] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-23 07:59:36] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2026-05-23 07:59:36] [INFO ] Computed and/alt/rep : 484/755/484 causal constraints (skipped 104 transitions) in 28 ms.
[2026-05-23 07:59:36] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 07:59:36] [INFO ] [Nat]Absence check using 8 positive place invariants in 16 ms returned sat
[2026-05-23 07:59:36] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 3 ms returned sat
[2026-05-23 07:59:36] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2026-05-23 07:59:36] [INFO ] Computed and/alt/rep : 484/755/484 causal constraints (skipped 104 transitions) in 27 ms.
[2026-05-23 07:59:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 182 ms
[2026-05-23 07:59:37] [INFO ] Added : 122 causal constraints over 26 iterations in 1121 ms. Result :sat
Minimization took 235 ms.
[2026-05-23 07:59:38] [INFO ] [Real]Absence check using 8 positive place invariants in 11 ms returned sat
[2026-05-23 07:59:38] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-23 07:59:38] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2026-05-23 07:59:38] [INFO ] Computed and/alt/rep : 484/755/484 causal constraints (skipped 104 transitions) in 25 ms.
[2026-05-23 07:59:38] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 07:59:38] [INFO ] [Nat]Absence check using 8 positive place invariants in 12 ms returned sat
[2026-05-23 07:59:38] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-23 07:59:38] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2026-05-23 07:59:38] [INFO ] Computed and/alt/rep : 484/755/484 causal constraints (skipped 104 transitions) in 26 ms.
[2026-05-23 07:59:39] [INFO ] Added : 69 causal constraints over 14 iterations in 480 ms. Result :sat
Minimization took 215 ms.
[2026-05-23 07:59:39] [INFO ] [Real]Absence check using 8 positive place invariants in 10 ms returned sat
[2026-05-23 07:59:39] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 3 ms returned sat
[2026-05-23 07:59:39] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2026-05-23 07:59:39] [INFO ] Computed and/alt/rep : 484/755/484 causal constraints (skipped 104 transitions) in 26 ms.
[2026-05-23 07:59:39] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 07:59:39] [INFO ] [Nat]Absence check using 8 positive place invariants in 12 ms returned sat
[2026-05-23 07:59:39] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-23 07:59:39] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2026-05-23 07:59:40] [INFO ] Computed and/alt/rep : 484/755/484 causal constraints (skipped 104 transitions) in 25 ms.
[2026-05-23 07:59:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 203 ms
[2026-05-23 07:59:40] [INFO ] Added : 98 causal constraints over 21 iterations in 960 ms. Result :sat
Minimization took 501 ms.
[2026-05-23 07:59:41] [INFO ] [Real]Absence check using 8 positive place invariants in 10 ms returned sat
[2026-05-23 07:59:41] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-23 07:59:41] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2026-05-23 07:59:41] [INFO ] Computed and/alt/rep : 484/755/484 causal constraints (skipped 104 transitions) in 25 ms.
[2026-05-23 07:59:41] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 07:59:41] [INFO ] [Nat]Absence check using 8 positive place invariants in 11 ms returned sat
[2026-05-23 07:59:41] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 2 ms returned sat
[2026-05-23 07:59:42] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2026-05-23 07:59:42] [INFO ] Computed and/alt/rep : 484/755/484 causal constraints (skipped 104 transitions) in 23 ms.
[2026-05-23 07:59:42] [INFO ] Added : 98 causal constraints over 20 iterations in 697 ms. Result :sat
Minimization took 500 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 CO4-PT-13-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-13-UpperBounds-07 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 477 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 477/477 places, 589/589 transitions.
Graph (trivial) has 472 edges and 477 vertex of which 3 / 477 are part of one of the 1 SCC in 6 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 874 edges and 475 vertex of which 434 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.2 ms
Discarding 41 places :
Also discarding 20 output transitions
Drop transitions (Output transitions of discarded places.) removed 20 transitions
Drop transitions (Empty/Sink Transition effects.) removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 267 transitions
Trivial Post-agglo rules discarded 267 transitions
Performed 267 trivial Post agglomeration. Transition count delta: 267
Iterating post reduction 0 with 292 rules applied. Total rules applied 294 place count 434 transition count 274
Reduce places removed 267 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 283 rules applied. Total rules applied 577 place count 167 transition count 258
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 18 rules applied. Total rules applied 595 place count 160 transition count 247
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 8 rules applied. Total rules applied 603 place count 156 transition count 243
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 6 rules applied. Total rules applied 609 place count 154 transition count 239
Reduce places removed 2 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 5 with 6 rules applied. Total rules applied 615 place count 152 transition count 235
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 617 place count 150 transition count 235
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 617 place count 150 transition count 234
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 619 place count 149 transition count 234
Discarding 23 places :
Symmetric choice reduction at 7 with 23 rule applications. Total rules 642 place count 126 transition count 211
Iterating global reduction 7 with 23 rules applied. Total rules applied 665 place count 126 transition count 211
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 6 Pre rules applied. Total rules applied 665 place count 126 transition count 205
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 677 place count 120 transition count 205
Discarding 14 places :
Symmetric choice reduction at 7 with 14 rule applications. Total rules 691 place count 106 transition count 169
Iterating global reduction 7 with 14 rules applied. Total rules applied 705 place count 106 transition count 169
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 706 place count 106 transition count 168
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 707 place count 105 transition count 167
Iterating global reduction 8 with 1 rules applied. Total rules applied 708 place count 105 transition count 167
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 709 place count 105 transition count 166
Performed 33 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 9 with 66 rules applied. Total rules applied 775 place count 72 transition count 130
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 776 place count 72 transition count 129
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 10 with 32 rules applied. Total rules applied 808 place count 56 transition count 143
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 10 with 23 rules applied. Total rules applied 831 place count 56 transition count 120
Discarding 10 places :
Symmetric choice reduction at 11 with 10 rule applications. Total rules 841 place count 46 transition count 90
Iterating global reduction 11 with 10 rules applied. Total rules applied 851 place count 46 transition count 90
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 11 with 7 rules applied. Total rules applied 858 place count 46 transition count 83
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 12 with 3 rules applied. Total rules applied 861 place count 46 transition count 80
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 861 place count 46 transition count 79
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 863 place count 45 transition count 79
Free-agglomeration rule applied 8 times.
Iterating global reduction 12 with 8 rules applied. Total rules applied 871 place count 45 transition count 71
Reduce places removed 8 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 10 rules applied. Total rules applied 881 place count 37 transition count 69
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 882 place count 36 transition count 68
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 884 place count 34 transition count 68
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 14 with 9 rules applied. Total rules applied 893 place count 34 transition count 59
Discarding 2 places :
Symmetric choice reduction at 14 with 2 rule applications. Total rules 895 place count 32 transition count 55
Iterating global reduction 14 with 2 rules applied. Total rules applied 897 place count 32 transition count 55
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 899 place count 32 transition count 53
Free-agglomeration rule applied 5 times.
Iterating global reduction 15 with 5 rules applied. Total rules applied 904 place count 32 transition count 48
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 6 rules applied. Total rules applied 910 place count 27 transition count 47
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 16 with 2 rules applied. Total rules applied 912 place count 27 transition count 45
Applied a total of 912 rules in 96 ms. Remains 27 /477 variables (removed 450) and now considering 45/589 (removed 544) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 27/477 places, 45/589 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-176280377370767937.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5758845349458930583.kers'
[2026-05-23 07:59:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-176280377370767937.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5758845349458930583.kers]
Normalized transition count is 43 out of 45 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 43 rows 26 cols 134 entries
Finished phase 1 with 22 SingleSign rule and 0 generalized
[2026-05-23 07:59:43] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5758845349458930583.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 (2 resets) in 829 ms. (1204 steps per ms)
FORMULA CO4-PT-13-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-13-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-13-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-13-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-13-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-13-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-13-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 294 ms. (3389 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 18815 ms.

BK_STOP 1779523184759

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
++ perl -pe 's/.*\.//g'
+ 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="CO4-PT-13"
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 CO4-PT-13, 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 r066-tall-177946967700381"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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