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.r104-tall-177955698800552.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 DoubleExponent-PT-010, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r104-tall-177955698800552
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 6.3K Mar 6 16:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Mar 6 16:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Mar 6 16:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K Mar 6 16:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.1K Mar 15 09:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 09:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 09:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 15 09:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 6 16:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Mar 6 16:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Mar 6 16:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 37K Mar 6 16:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 09:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 09:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 169K 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 booleans
BOOL_VECTOR

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1779610684201

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=DoubleExponent-PT-010
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
QuasiLiveness PT
Running Version 202604301425
[2026-05-24 08:18:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2026-05-24 08:18:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 08:18:05] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2026-05-24 08:18:05] [INFO ] Transformed 534 places.
[2026-05-24 08:18:05] [INFO ] Transformed 498 transitions.
[2026-05-24 08:18:05] [INFO ] Parsed PT model containing 534 places and 498 transitions and 1404 arcs in 172 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 534/534 places, 498/498 transitions.
Reduce places removed 4 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 124 rules applied. Total rules applied 124 place count 530 transition count 378
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 244 place count 410 transition count 378
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 244 place count 410 transition count 358
Deduced a syphon composed of 20 places in 16 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 284 place count 390 transition count 358
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: 94
Deduced a syphon composed of 94 places in 2 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 2 with 188 rules applied. Total rules applied 472 place count 296 transition count 264
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 2 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 508 place count 278 transition count 264
Applied a total of 508 rules in 108 ms. Remains 278 /534 variables (removed 256) and now considering 264/498 (removed 234) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3408725885536867210.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5566321237696671986.kers'
[2026-05-24 08:18:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3408725885536867210.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5566321237696671986.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 264 rows 278 cols 1031 entries
Finished phase 1 with 163 SingleSign rule and 64 generalized
[2026-05-24 08:18:05] [INFO ] Computed 51 invariants in 3 ms
Computed 51 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-5566321237696671986.kers
Total runtime 5 ms.
[2026-05-24 08:18:06] [INFO ] Implicit Places using invariants in 423 ms returned [229, 230]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 455 ms to find 2 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 276/534 places, 264/498 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 276 transition count 263
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 275 transition count 263
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 272 transition count 260
Applied a total of 8 rules in 13 ms. Remains 272 /276 variables (removed 4) and now considering 260/264 (removed 4) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11761556143595152592.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9356779619506385256.kers'
[2026-05-24 08:18:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11761556143595152592.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9356779619506385256.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 260 rows 272 cols 1015 entries
Finished phase 1 with 156 SingleSign rule and 67 generalized
[2026-05-24 08:18:06] [INFO ] Computed 49 invariants in 2 ms
Computed 49 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9356779619506385256.kers
Total runtime 3 ms.
[2026-05-24 08:18:06] [INFO ] Implicit Places using invariants in 208 ms returned []
[2026-05-24 08:18:06] [INFO ] Invariant cache hit.
[2026-05-24 08:18:06] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-24 08:18:07] [INFO ] Implicit Places using invariants and state equation in 1501 ms returned []
Implicit Place search using SMT with State Equation took 1715 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 272/534 places, 260/498 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 2305 ms. Remains : 272/534 places, 260/498 transitions.
Discarding 58 transitions out of 260. Remains 202
Initial state reduction rules removed 1 formulas.
[2026-05-24 08:18:08] [INFO ] Flatten gal took : 86 ms
[2026-05-24 08:18:08] [INFO ] Flatten gal took : 37 ms
[2026-05-24 08:18:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12867530374024057834.gal : 15 ms
[2026-05-24 08:18:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4250197582241931596.prop : 17 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12867530374024057834.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4250197582241931596.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality4250197582241931596.prop.
RANDOM walk for 40000 steps (4888 resets) in 1793 ms. (22 steps per ms) remains 175/201 properties
BEST_FIRST walk for 401 steps (27 resets) in 35 ms. (11 steps per ms) remains 175/175 properties
Reachability property qltransition_210 is true.
Reachability property qltransition_114 is true.
BEST_FIRST walk for 403 steps (28 resets) in 17 ms. (22 steps per ms) remains 175/175 properties
SDD proceeding with computation,199 properties remain. new max is 2
SDD size :1 after 3
Reachability property qltransition_149 is true.
Reachability property qltransition_145 is true.
BEST_FIRST walk for 401 steps (32 resets) in 28 ms. (13 steps per ms) remains 175/175 properties
Reachability property qltransition_98 is true.
Reachability property qltransition_36 is true.
SDD proceeding with computation,195 properties remain. new max is 2
SDD size :3 after 7
BEST_FIRST walk for 401 steps (28 resets) in 39 ms. (10 steps per ms) remains 175/175 properties
SDD proceeding with computation,195 properties remain. new max is 4
SDD size :7 after 8
BEST_FIRST walk for 401 steps (30 resets) in 16 ms. (23 steps per ms) remains 175/175 properties
BEST_FIRST walk for 401 steps (29 resets) in 21 ms. (18 steps per ms) remains 175/175 properties
SDD proceeding with computation,195 properties remain. new max is 8
SDD size :8 after 9
BEST_FIRST walk for 401 steps (27 resets) in 18 ms. (21 steps per ms) remains 175/175 properties
Reachability property qltransition_15 is true.
SDD proceeding with computation,194 properties remain. new max is 8
SDD size :9 after 11
BEST_FIRST walk for 400 steps (26 resets) in 16 ms. (23 steps per ms) remains 175/175 properties
BEST_FIRST walk for 402 steps (27 resets) in 7 ms. (50 steps per ms) remains 175/175 properties
SDD proceeding with computation,194 properties remain. new max is 16
SDD size :11 after 17
BEST_FIRST walk for 401 steps (28 resets) in 12 ms. (30 steps per ms) remains 175/175 properties
Reachability property qltransition_228 is true.
Reachability property qltransition_167 is true.
Reachability property qltransition_160 is true.
BEST_FIRST walk for 402 steps (30 resets) in 13 ms. (28 steps per ms) remains 175/175 properties
Reachability property qltransition_100 is true.
Reachability property qltransition_70 is true.
Reachability property qltransition_61 is true.
BEST_FIRST walk for 400 steps (30 resets) in 10 ms. (36 steps per ms) remains 175/175 properties
SDD proceeding with computation,188 properties remain. new max is 16
SDD size :17 after 27
BEST_FIRST walk for 401 steps (28 resets) in 10 ms. (36 steps per ms) remains 175/175 properties
BEST_FIRST walk for 401 steps (26 resets) in 9 ms. (40 steps per ms) remains 175/175 properties
Reachability property qltransition_24 is true.
SDD proceeding with computation,187 properties remain. new max is 16
SDD size :27 after 32
BEST_FIRST walk for 401 steps (32 resets) in 14 ms. (26 steps per ms) remains 175/175 properties
BEST_FIRST walk for 401 steps (28 resets) in 11 ms. (33 steps per ms) remains 175/175 properties
BEST_FIRST walk for 402 steps (25 resets) in 7 ms. (50 steps per ms) remains 175/175 properties
BEST_FIRST walk for 401 steps (28 resets) in 11 ms. (33 steps per ms) remains 175/175 properties
BEST_FIRST walk for 402 steps (22 resets) in 8 ms. (44 steps per ms) remains 175/175 properties
SDD proceeding with computation,187 properties remain. new max is 32
SDD size :32 after 40
BEST_FIRST walk for 401 steps (30 resets) in 15 ms. (25 steps per ms) remains 175/175 properties
BEST_FIRST walk for 401 steps (28 resets) in 9 ms. (40 steps per ms) remains 175/175 properties
BEST_FIRST walk for 401 steps (24 resets) in 8 ms. (44 steps per ms) remains 175/175 properties
Reachability property qltransition_94 is true.
SDD proceeding with computation,186 properties remain. new max is 32
SDD size :40 after 63
BEST_FIRST walk for 401 steps (33 resets) in 11 ms. (33 steps per ms) remains 175/175 properties
Reachability property qltransition_250 is true.
Reachability property qltransition_208 is true.
Reachability property qltransition_179 is true.
Reachability property qltransition_178 is true.
BEST_FIRST walk for 400 steps (32 resets) in 13 ms. (28 steps per ms) remains 175/175 properties
Reachability property qltransition_117 is true.
Reachability property qltransition_116 is true.
Reachability property qltransition_111 is true.
Reachability property qltransition_107 is true.
BEST_FIRST walk for 401 steps (31 resets) in 7 ms. (50 steps per ms) remains 175/175 properties
Reachability property qltransition_28 is true.
SDD proceeding with computation,177 properties remain. new max is 32
SDD size :63 after 72
BEST_FIRST walk for 403 steps (29 resets) in 14 ms. (26 steps per ms) remains 175/175 properties
BEST_FIRST walk for 402 steps (30 resets) in 6 ms. (57 steps per ms) remains 175/175 properties
Reachability property qltransition_118 is true.
Reachability property qltransition_108 is true.
BEST_FIRST walk for 400 steps (24 resets) in 12 ms. (30 steps per ms) remains 175/175 properties
SDD proceeding with computation,175 properties remain. new max is 32
SDD size :72 after 83
BEST_FIRST walk for 403 steps (28 resets) in 10 ms. (36 steps per ms) remains 175/175 properties
BEST_FIRST walk for 402 steps (26 resets) in 6 ms. (57 steps per ms) remains 175/175 properties
BEST_FIRST walk for 401 steps (33 resets) in 9 ms. (40 steps per ms) remains 175/175 properties
SDD proceeding with computation,175 properties remain. new max is 64
SDD size :83 after 101
BEST_FIRST walk for 402 steps (30 resets) in 9 ms. (40 steps per ms) remains 175/175 properties
Reachability property qltransition_230 is true.
BEST_FIRST walk for 401 steps (27 resets) in 9 ms. (40 steps per ms) remains 175/175 properties
Reachability property qltransition_119 is true.
BEST_FIRST walk for 402 steps (32 resets) in 9 ms. (40 steps per ms) remains 175/175 properties
BEST_FIRST walk for 401 steps (32 resets) in 8 ms. (44 steps per ms) remains 175/175 properties
SDD proceeding with computation,173 properties remain. new max is 64
SDD size :101 after 138
BEST_FIRST walk for 402 steps (27 resets) in 9 ms. (40 steps per ms) remains 175/175 properties
BEST_FIRST walk for 403 steps (26 resets) in 8 ms. (44 steps per ms) remains 175/175 properties
BEST_FIRST walk for 401 steps (31 resets) in 9 ms. (40 steps per ms) remains 175/175 properties
BEST_FIRST walk for 401 steps (32 resets) in 8 ms. (44 steps per ms) remains 175/175 properties
SDD proceeding with computation,173 properties remain. new max is 128
SDD size :138 after 333
BEST_FIRST walk for 402 steps (28 resets) in 11 ms. (33 steps per ms) remains 175/175 properties
BEST_FIRST walk for 401 steps (28 resets) in 6 ms. (57 steps per ms) remains 175/175 properties
BEST_FIRST walk for 401 steps (28 resets) in 8 ms. (44 steps per ms) remains 175/175 properties
Reachability property qltransition_254 is true.
Reachability property qltransition_182 is true.
Reachability property qltransition_181 is true.
BEST_FIRST walk for 401 steps (29 resets) in 8 ms. (44 steps per ms) remains 175/175 properties
BEST_FIRST walk for 400 steps (31 resets) in 8 ms. (44 steps per ms) remains 175/175 properties
BEST_FIRST walk for 402 steps (24 resets) in 6 ms. (57 steps per ms) remains 175/175 properties
Reachability property qltransition_120 is true.
Reachability property qltransition_113 is true.
Reachability property qltransition_112 is true.
Reachability property qltransition_109 is true.
SDD proceeding with computation,166 properties remain. new max is 128
SDD size :333 after 496
BEST_FIRST walk for 401 steps (28 resets) in 10 ms. (36 steps per ms) remains 175/175 properties
BEST_FIRST walk for 403 steps (32 resets) in 36 ms. (10 steps per ms) remains 175/175 properties
BEST_FIRST walk for 402 steps (26 resets) in 8 ms. (44 steps per ms) remains 175/175 properties
SDD proceeding with computation,166 properties remain. new max is 256
SDD size :496 after 836
BEST_FIRST walk for 401 steps (28 resets) in 14 ms. (26 steps per ms) remains 175/175 properties
BEST_FIRST walk for 402 steps (26 resets) in 7 ms. (50 steps per ms) remains 175/175 properties
[2026-05-24 08:18:08] [INFO ] Invariant cache hit.
[2026-05-24 08:18:08] [INFO ] State equation strengthened by 20 read => feed constraints.
SDD proceeding with computation,166 properties remain. new max is 512
SDD size :836 after 1481
Reachability property qltransition_252 is true.
Reachability property qltransition_248 is true.
Reachability property qltransition_184 is true.
Reachability property qltransition_122 is true.
Reachability property qltransition_121 is true.
Reachability property qltransition_115 is true.
Reachability property qltransition_110 is true.
Reachability property qltransition_11 is true.
Reachability property qltransition_10 is true.
Reachability property qltransition_9 is true.
Reachability property qltransition_8 is true.
Reachability property qltransition_4 is true.
Reachability property qltransition_1 is true.
Reachability property qltransition_0 is true.
SDD proceeding with computation,152 properties remain. new max is 512
SDD size :1481 after 7380
SDD proceeding with computation,152 properties remain. new max is 1024
SDD size :7380 after 37045
Reachability property qltransition_188 is true.
Reachability property qltransition_125 is true.
Reachability property qltransition_124 is true.
Reachability property qltransition_12 is true.
Reachability property qltransition_6 is true.
Reachability property qltransition_5 is true.
Reachability property qltransition_2 is true.
SDD proceeding with computation,145 properties remain. new max is 1024
SDD size :37045 after 96613
SDD proceeding with computation,145 properties remain. new max is 2048
SDD size :96613 after 165778
SDD proceeding with computation,145 properties remain. new max is 4096
SDD size :165778 after 309882
SDD proceeding with computation,145 properties remain. new max is 8192
SDD size :309882 after 591751
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 25/25 constraints. Problems are: Problem set: 21 solved, 145 unsolved
Reachability property qltransition_192 is true.
Reachability property qltransition_186 is true.
Reachability property qltransition_128 is true.
Reachability property qltransition_127 is true.
Reachability property qltransition_25 is true.
Reachability property qltransition_23 is true.
Reachability property qltransition_22 is true.
Reachability property qltransition_18 is true.
Reachability property qltransition_14 is true.
Reachability property qltransition_13 is true.
Reachability property qltransition_7 is true.
Reachability property qltransition_3 is true.
SDD proceeding with computation,133 properties remain. new max is 8192
SDD size :591751 after 1.20167e+06
Reachability property qltransition_190 is true.
Reachability property qltransition_26 is true.
SDD proceeding with computation,131 properties remain. new max is 8192
SDD size :1.20167e+06 after 7.80565e+07
At refinement iteration 1 (INCLUDED_ONLY) 0/227 variables, 0/25 constraints. Problems are: Problem set: 35 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 17/244 variables, 18/43 constraints. Problems are: Problem set: 35 solved, 131 unsolved
SDD proceeding with computation,131 properties remain. new max is 16384
SDD size :7.80565e+07 after 2.53969e+08
At refinement iteration 3 (INCLUDED_ONLY) 0/244 variables, 0/43 constraints. Problems are: Problem set: 35 solved, 131 unsolved
At refinement iteration 4 (OVERLAPS) 19/263 variables, 3/46 constraints. Problems are: Problem set: 35 solved, 131 unsolved
SDD proceeding with computation,131 properties remain. new max is 32768
SDD size :2.53969e+08 after 8.02247e+08
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 0/46 constraints. Problems are: Problem set: 35 solved, 131 unsolved
At refinement iteration 6 (OVERLAPS) 4/267 variables, 2/48 constraints. Problems are: Problem set: 35 solved, 131 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 267/532 variables, and 48 constraints, problems are : Problem set: 35 solved, 131 unsolved in 5017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 46/47 constraints, State Equation: 0/272 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 35 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 19/19 constraints. Problems are: Problem set: 35 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 0/19 constraints. Problems are: Problem set: 35 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 41/221 variables, 15/34 constraints. Problems are: Problem set: 35 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 0/34 constraints. Problems are: Problem set: 35 solved, 131 unsolved
At refinement iteration 4 (OVERLAPS) 36/257 variables, 11/45 constraints. Problems are: Problem set: 35 solved, 131 unsolved
SDD proceeding with computation,131 properties remain. new max is 65536
SDD size :8.02247e+08 after 2.46698e+09
At refinement iteration 5 (INCLUDED_ONLY) 0/257 variables, 0/45 constraints. Problems are: Problem set: 35 solved, 131 unsolved
At refinement iteration 6 (OVERLAPS) 4/261 variables, 2/47 constraints. Problems are: Problem set: 35 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/261 variables, 0/47 constraints. Problems are: Problem set: 35 solved, 131 unsolved
At refinement iteration 8 (OVERLAPS) 3/264 variables, 2/49 constraints. Problems are: Problem set: 35 solved, 131 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 264/532 variables, and 50 constraints, problems are : Problem set: 35 solved, 131 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 0/272 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 0/166 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10092ms problems are : Problem set: 35 solved, 131 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 180 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 260/260 transitions.
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 272 transition count 251
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 18 place count 263 transition count 251
Partial Free-agglomeration rule applied 12 times.
Drop transitions (Partial Free agglomeration) removed 12 transitions
Iterating global reduction 1 with 12 rules applied. Total rules applied 30 place count 263 transition count 251
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 262 transition count 250
Applied a total of 31 rules in 44 ms. Remains 262 /272 variables (removed 10) and now considering 250/260 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 262/272 places, 250/260 transitions.
RANDOM walk for 4000000 steps (513097 resets) in 42463 ms. (94 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3424 resets) in 449 ms. (88 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3330 resets) in 447 ms. (89 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40003 steps (3419 resets) in 426 ms. (93 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3381 resets) in 397 ms. (100 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3420 resets) in 406 ms. (98 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3369 resets) in 417 ms. (95 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3407 resets) in 404 ms. (98 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3354 resets) in 432 ms. (92 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3383 resets) in 447 ms. (89 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40003 steps (3352 resets) in 305 ms. (130 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3422 resets) in 294 ms. (135 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3412 resets) in 315 ms. (126 steps per ms) remains 131/131 properties
SDD proceeding with computation,131 properties remain. new max is 131072
SDD size :2.46698e+09 after 7.42893e+09
BEST_FIRST walk for 40001 steps (3351 resets) in 397 ms. (100 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3360 resets) in 298 ms. (133 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40000 steps (3438 resets) in 364 ms. (109 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3324 resets) in 311 ms. (128 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40000 steps (3380 resets) in 391 ms. (102 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3306 resets) in 301 ms. (132 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40000 steps (3408 resets) in 399 ms. (100 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3398 resets) in 282 ms. (141 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3330 resets) in 371 ms. (107 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40000 steps (3405 resets) in 302 ms. (132 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40000 steps (3412 resets) in 364 ms. (109 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3379 resets) in 331 ms. (120 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3431 resets) in 340 ms. (117 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3399 resets) in 506 ms. (78 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3393 resets) in 333 ms. (119 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3350 resets) in 440 ms. (90 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40003 steps (3422 resets) in 282 ms. (141 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3363 resets) in 362 ms. (110 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3331 resets) in 293 ms. (136 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3380 resets) in 305 ms. (130 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3323 resets) in 298 ms. (133 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3373 resets) in 312 ms. (127 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3396 resets) in 334 ms. (119 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3388 resets) in 386 ms. (103 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3439 resets) in 348 ms. (114 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3371 resets) in 364 ms. (109 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3365 resets) in 322 ms. (123 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40000 steps (3358 resets) in 394 ms. (101 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3424 resets) in 315 ms. (126 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40003 steps (3359 resets) in 282 ms. (141 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3404 resets) in 336 ms. (118 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3393 resets) in 357 ms. (111 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3406 resets) in 320 ms. (124 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3360 resets) in 369 ms. (108 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3410 resets) in 382 ms. (104 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40003 steps (3318 resets) in 413 ms. (96 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40000 steps (3417 resets) in 385 ms. (103 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3374 resets) in 362 ms. (110 steps per ms) remains 131/131 properties
Reachability property qltransition_196 is true.
Reachability property qltransition_131 is true.
Reachability property qltransition_130 is true.
Reachability property qltransition_27 is true.
Reachability property qltransition_20 is true.
Reachability property qltransition_19 is true.
Reachability property qltransition_16 is true.
SDD proceeding with computation,124 properties remain. new max is 131072
SDD size :7.42893e+09 after 1.73298e+10
SDD proceeding with computation,124 properties remain. new max is 262144
SDD size :1.73298e+10 after 2.82283e+10
Interrupted probabilistic random walk after 2942635 steps, run timeout after 54001 ms. (steps per millisecond=54 ) properties seen :0 out of 131
Probabilistic random walk after 2942635 steps, saw 1471376 distinct states, run finished after 54010 ms. (steps per millisecond=54 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6262210841382209981.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8570952751150230197.kers'
[2026-05-24 08:19:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6262210841382209981.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8570952751150230197.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 250 rows 260 cols 1039 entries
Finished phase 1 with 147 SingleSign rule and 66 generalized
[2026-05-24 08:19:31] [INFO ] Computed 49 invariants in 2 ms
Computed 49 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-8570952751150230197.kers
Total runtime 3 ms.
[2026-05-24 08:19:31] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (OVERLAPS) 30/201 variables, 14/33 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (OVERLAPS) 33/234 variables, 9/42 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (OVERLAPS) 16/250 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/250 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 8 (OVERLAPS) 2/252 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/252 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 10 (OVERLAPS) 249/501 variables, 252/299 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/501 variables, 24/323 constraints. Problems are: Problem set: 0 solved, 124 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/501 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 124 unsolved
SDD proceeding with computation,124 properties remain. new max is 524288
At refinement iteration 13 (OVERLAPS) 10/511 variables, 9/332 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/511 variables, 2/334 constraints. Problems are: Problem set: 0 solved, 124 unsolved
SDD size :2.82283e+10 after 5.01408e+10
At refinement iteration 15 (INCLUDED_ONLY) 0/511 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 16 (OVERLAPS) 1/512 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/512 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 18 (OVERLAPS) 0/512 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Real declared 512/512 variables, and 335 constraints, problems are : Problem set: 0 solved, 124 unsolved in 28998 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 262/262 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 124 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (OVERLAPS) 30/201 variables, 14/33 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (OVERLAPS) 33/234 variables, 9/42 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (OVERLAPS) 16/250 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/250 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 8 (OVERLAPS) 2/252 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/252 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 10 (OVERLAPS) 249/501 variables, 252/299 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/501 variables, 24/323 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/501 variables, 120/443 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/501 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 14 (OVERLAPS) 10/511 variables, 9/452 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/511 variables, 2/454 constraints. Problems are: Problem set: 0 solved, 124 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 511/512 variables, and 458 constraints, problems are : Problem set: 0 solved, 124 unsolved in 45019 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 261/262 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 74048ms problems are : Problem set: 0 solved, 124 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 171 out of 262 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 262/262 places, 250/250 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 262 transition count 249
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 261 transition count 249
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 6 place count 261 transition count 249
Applied a total of 6 rules in 60 ms. Remains 261 /262 variables (removed 1) and now considering 249/250 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 261/262 places, 249/250 transitions.
SDD proceeding with computation,124 properties remain. new max is 1048576
SDD size :5.01408e+10 after 9.44182e+10
RANDOM walk for 4000000 steps (513059 resets) in 42642 ms. (93 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40002 steps (3406 resets) in 442 ms. (90 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40002 steps (3346 resets) in 419 ms. (95 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40000 steps (3356 resets) in 335 ms. (119 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40001 steps (3404 resets) in 356 ms. (112 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40002 steps (3412 resets) in 324 ms. (123 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40002 steps (3393 resets) in 343 ms. (116 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40003 steps (3404 resets) in 398 ms. (100 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40002 steps (3413 resets) in 340 ms. (117 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40002 steps (3344 resets) in 389 ms. (102 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40001 steps (3378 resets) in 313 ms. (127 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40002 steps (3424 resets) in 438 ms. (91 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40001 steps (3426 resets) in 328 ms. (121 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40001 steps (3422 resets) in 410 ms. (97 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40001 steps (3338 resets) in 336 ms. (118 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40000 steps (3347 resets) in 488 ms. (81 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40000 steps (3381 resets) in 422 ms. (94 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40001 steps (3375 resets) in 395 ms. (101 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40001 steps (3427 resets) in 363 ms. (109 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40003 steps (3310 resets) in 449 ms. (88 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40001 steps (3411 resets) in 328 ms. (121 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40001 steps (3377 resets) in 393 ms. (101 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40002 steps (3373 resets) in 326 ms. (122 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40002 steps (3361 resets) in 410 ms. (97 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40003 steps (3374 resets) in 360 ms. (110 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40001 steps (3345 resets) in 429 ms. (93 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40001 steps (3433 resets) in 339 ms. (117 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40001 steps (3388 resets) in 375 ms. (106 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40000 steps (3357 resets) in 339 ms. (117 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40001 steps (3414 resets) in 400 ms. (99 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40002 steps (3344 resets) in 425 ms. (93 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40003 steps (3381 resets) in 411 ms. (97 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40001 steps (3367 resets) in 435 ms. (91 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40002 steps (3342 resets) in 338 ms. (118 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40002 steps (3399 resets) in 378 ms. (105 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40002 steps (3377 resets) in 415 ms. (96 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40002 steps (3415 resets) in 358 ms. (111 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40001 steps (3393 resets) in 292 ms. (136 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40001 steps (3355 resets) in 302 ms. (132 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40001 steps (3365 resets) in 299 ms. (133 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40002 steps (3348 resets) in 459 ms. (86 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40001 steps (3418 resets) in 316 ms. (126 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40001 steps (3412 resets) in 395 ms. (101 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40001 steps (3325 resets) in 463 ms. (86 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40001 steps (3374 resets) in 406 ms. (98 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40001 steps (3439 resets) in 391 ms. (102 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40000 steps (3354 resets) in 301 ms. (132 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40001 steps (3400 resets) in 298 ms. (133 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40002 steps (3421 resets) in 317 ms. (125 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40000 steps (3327 resets) in 315 ms. (126 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40000 steps (3406 resets) in 397 ms. (100 steps per ms) remains 124/124 properties
Interrupted probabilistic random walk after 2940372 steps, run timeout after 54001 ms. (steps per millisecond=54 ) properties seen :0 out of 124
Probabilistic random walk after 2940372 steps, saw 1470260 distinct states, run finished after 54001 ms. (steps per millisecond=54 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6547097008916249068.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14568681920234191991.kers'
[2026-05-24 08:21:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6547097008916249068.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14568681920234191991.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 249 rows 259 cols 1048 entries
Finished phase 1 with 147 SingleSign rule and 65 generalized
[2026-05-24 08:21:58] [INFO ] Computed 49 invariants in 2 ms
Computed 49 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14568681920234191991.kers
Total runtime 2 ms.
[2026-05-24 08:21:58] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (OVERLAPS) 29/200 variables, 14/33 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (OVERLAPS) 33/233 variables, 9/42 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (OVERLAPS) 16/249 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/249 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 9 (OVERLAPS) 2/251 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/251 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 11 (OVERLAPS) 248/499 variables, 251/299 constraints. Problems are: Problem set: 0 solved, 124 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/499 variables, 26/325 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/499 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 14 (OVERLAPS) 10/509 variables, 9/334 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/509 variables, 2/336 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/509 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 17 (OVERLAPS) 1/510 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/510 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 19 (OVERLAPS) 0/510 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Real declared 510/510 variables, and 337 constraints, problems are : Problem set: 0 solved, 124 unsolved in 28002 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 261/261 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 124 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (OVERLAPS) 29/200 variables, 14/33 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (OVERLAPS) 33/233 variables, 9/42 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (OVERLAPS) 16/249 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/249 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 9 (OVERLAPS) 2/251 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/251 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 11 (OVERLAPS) 248/499 variables, 251/299 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/499 variables, 26/325 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/499 variables, 120/445 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/499 variables, 1/446 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/499 variables, 1/447 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/499 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 17 (OVERLAPS) 10/509 variables, 9/456 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/509 variables, 2/458 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/509 variables, 4/462 constraints. Problems are: Problem set: 0 solved, 124 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 509/510 variables, and 462 constraints, problems are : Problem set: 0 solved, 124 unsolved in 75018 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 260/261 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 103044ms problems are : Problem set: 0 solved, 124 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 171 out of 261 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 261/261 places, 249/249 transitions.
Applied a total of 0 rules in 8 ms. Remains 261 /261 variables (removed 0) and now considering 249/249 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 261/261 places, 249/249 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 261/261 places, 249/249 transitions.
Applied a total of 0 rules in 8 ms. Remains 261 /261 variables (removed 0) and now considering 249/249 (removed 0) transitions.
[2026-05-24 08:23:41] [INFO ] Invariant cache hit.
[2026-05-24 08:23:41] [INFO ] Implicit Places using invariants in 107 ms returned []
[2026-05-24 08:23:41] [INFO ] Invariant cache hit.
[2026-05-24 08:23:41] [INFO ] State equation strengthened by 26 read => feed constraints.
[2026-05-24 08:23:42] [INFO ] Implicit Places using invariants and state equation in 1227 ms returned [20, 26, 143, 213, 252, 258]
[2026-05-24 08:23:42] [INFO ] Actually due to overlaps returned [213, 143]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1348 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 259/261 places, 249/249 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 259 transition count 248
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 258 transition count 248
Applied a total of 2 rules in 18 ms. Remains 258 /259 variables (removed 1) and now considering 248/249 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4912132684916942637.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16325828187845279394.kers'
[2026-05-24 08:23:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4912132684916942637.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16325828187845279394.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 248 rows 256 cols 1026 entries
Finished phase 1 with 150 SingleSign rule and 61 generalized
[2026-05-24 08:23:42] [INFO ] Computed 47 invariants in 2 ms
Computed 47 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16325828187845279394.kers
Total runtime 2 ms.
[2026-05-24 08:23:42] [INFO ] Implicit Places using invariants in 209 ms returned []
[2026-05-24 08:23:42] [INFO ] Invariant cache hit.
[2026-05-24 08:23:42] [INFO ] State equation strengthened by 26 read => feed constraints.
[2026-05-24 08:23:44] [INFO ] Implicit Places using invariants and state equation in 1344 ms returned [20, 26, 249, 255]
[2026-05-24 08:23:44] [INFO ] Actually due to overlaps returned [255, 249]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1562 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 256/261 places, 248/249 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 256 transition count 247
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 255 transition count 247
Applied a total of 2 rules in 19 ms. Remains 255 /256 variables (removed 1) and now considering 247/248 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7704604658182940434.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3288570349928245886.kers'
[2026-05-24 08:23:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7704604658182940434.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3288570349928245886.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 247 rows 253 cols 1012 entries
Finished phase 1 with 153 SingleSign rule and 57 generalized
[2026-05-24 08:23:44] [INFO ] Computed 45 invariants in 1 ms
Computed 45 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3288570349928245886.kers
Total runtime 2 ms.
[2026-05-24 08:23:44] [INFO ] Implicit Places using invariants in 197 ms returned []
[2026-05-24 08:23:44] [INFO ] Invariant cache hit.
[2026-05-24 08:23:44] [INFO ] State equation strengthened by 26 read => feed constraints.
[2026-05-24 08:23:44] [INFO ] Implicit Places using invariants and state equation in 728 ms returned [20, 26]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 934 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 253/261 places, 247/249 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 253 transition count 246
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 252 transition count 246
Applied a total of 2 rules in 21 ms. Remains 252 /253 variables (removed 1) and now considering 246/247 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15932923725723141298.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15321312855292173110.kers'
[2026-05-24 08:23:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15932923725723141298.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15321312855292173110.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 246 rows 250 cols 1004 entries
Finished phase 1 with 153 SingleSign rule and 56 generalized
[2026-05-24 08:23:45] [INFO ] Computed 43 invariants in 1 ms
Computed 43 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15321312855292173110.kers
Total runtime 2 ms.
[2026-05-24 08:23:45] [INFO ] Implicit Places using invariants in 105 ms returned []
[2026-05-24 08:23:45] [INFO ] Invariant cache hit.
[2026-05-24 08:23:45] [INFO ] State equation strengthened by 26 read => feed constraints.
[2026-05-24 08:23:45] [INFO ] Implicit Places using invariants and state equation in 633 ms returned []
Implicit Place search using SMT with State Equation took 751 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 252/261 places, 246/249 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 4664 ms. Remains : 252/261 places, 246/249 transitions.
RANDOM walk for 4000000 steps (577286 resets) in 52312 ms. (76 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40001 steps (3604 resets) in 410 ms. (97 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40001 steps (3589 resets) in 510 ms. (78 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40002 steps (3723 resets) in 418 ms. (95 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40001 steps (3611 resets) in 365 ms. (109 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40002 steps (3610 resets) in 365 ms. (109 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40000 steps (3732 resets) in 357 ms. (111 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40002 steps (3616 resets) in 363 ms. (109 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40003 steps (3621 resets) in 371 ms. (107 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40003 steps (3662 resets) in 348 ms. (114 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40001 steps (3657 resets) in 484 ms. (82 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40001 steps (3693 resets) in 282 ms. (141 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40002 steps (3693 resets) in 462 ms. (86 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40001 steps (3708 resets) in 359 ms. (111 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40002 steps (3642 resets) in 443 ms. (90 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40000 steps (3679 resets) in 354 ms. (112 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40001 steps (3682 resets) in 371 ms. (107 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40000 steps (3653 resets) in 360 ms. (110 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40001 steps (3678 resets) in 354 ms. (112 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40000 steps (3635 resets) in 350 ms. (113 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40001 steps (3654 resets) in 376 ms. (106 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40001 steps (3668 resets) in 360 ms. (110 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40001 steps (3673 resets) in 279 ms. (142 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40001 steps (3639 resets) in 429 ms. (93 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40001 steps (3649 resets) in 398 ms. (100 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40002 steps (3672 resets) in 370 ms. (107 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40001 steps (3629 resets) in 330 ms. (120 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40000 steps (3633 resets) in 463 ms. (86 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40002 steps (3650 resets) in 395 ms. (101 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40001 steps (3640 resets) in 437 ms. (91 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40002 steps (3621 resets) in 372 ms. (107 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40003 steps (3665 resets) in 384 ms. (103 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40000 steps (3631 resets) in 360 ms. (110 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40001 steps (3638 resets) in 300 ms. (132 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40002 steps (3606 resets) in 378 ms. (105 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40003 steps (3650 resets) in 415 ms. (96 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40001 steps (3645 resets) in 376 ms. (106 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40002 steps (3728 resets) in 356 ms. (112 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40000 steps (3691 resets) in 370 ms. (107 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40001 steps (3680 resets) in 393 ms. (101 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40001 steps (3712 resets) in 318 ms. (125 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40000 steps (3649 resets) in 376 ms. (106 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40002 steps (3664 resets) in 380 ms. (104 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40000 steps (3643 resets) in 336 ms. (118 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40001 steps (3706 resets) in 379 ms. (105 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40003 steps (3636 resets) in 522 ms. (76 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40002 steps (3671 resets) in 373 ms. (106 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40001 steps (3632 resets) in 368 ms. (108 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40001 steps (3671 resets) in 348 ms. (114 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40000 steps (3657 resets) in 379 ms. (105 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40001 steps (3539 resets) in 482 ms. (82 steps per ms) remains 124/124 properties
SDD proceeding with computation,124 properties remain. new max is 2097152
SDD size :9.44182e+10 after 1.7808e+11
Probably explored full state space saw : 681098 states, properties seen :0
Probabilistic random walk after 1362238 steps, saw 681098 distinct states, run finished after 24052 ms. (steps per millisecond=56 ) properties seen :0
Interrupted probabilistic random walk after 3234755 steps, run timeout after 57001 ms. (steps per millisecond=56 ) properties seen :0 out of 124
Exhaustive walk after 3234755 steps, saw 1617454 distinct states, run finished after 57001 ms. (steps per millisecond=56 ) properties seen :0
[2026-05-24 08:25:26] [INFO ] Invariant cache hit.
[2026-05-24 08:25:26] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (OVERLAPS) 43/214 variables, 14/33 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/214 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (OVERLAPS) 26/240 variables, 7/40 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 7 (OVERLAPS) 2/242 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 9 (OVERLAPS) 245/487 variables, 242/284 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/487 variables, 26/310 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/487 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 124 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 10/497 variables, 9/319 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/497 variables, 2/321 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/497 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 15 (OVERLAPS) 1/498 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/498 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 17 (OVERLAPS) 0/498 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Real declared 498/498 variables, and 322 constraints, problems are : Problem set: 0 solved, 124 unsolved in 25691 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 252/252 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 124 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (OVERLAPS) 43/214 variables, 14/33 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/214 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (OVERLAPS) 26/240 variables, 7/40 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 7 (OVERLAPS) 2/242 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 9 (OVERLAPS) 245/487 variables, 242/284 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/487 variables, 26/310 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/487 variables, 120/430 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/487 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 13 (OVERLAPS) 10/497 variables, 9/439 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/497 variables, 2/441 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/497 variables, 4/445 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/497 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 17 (OVERLAPS) 1/498 variables, 1/446 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/498 variables, 7/453 constraints. Problems are: Problem set: 0 solved, 124 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 498/498 variables, and 453 constraints, problems are : Problem set: 0 solved, 124 unsolved in 90019 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 252/252 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 115735ms problems are : Problem set: 0 solved, 124 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 171 out of 252 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 246/246 transitions.
Applied a total of 0 rules in 7 ms. Remains 252 /252 variables (removed 0) and now considering 246/246 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 252/252 places, 246/246 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 246/246 transitions.
Applied a total of 0 rules in 6 ms. Remains 252 /252 variables (removed 0) and now considering 246/246 (removed 0) transitions.
[2026-05-24 08:27:22] [INFO ] Invariant cache hit.
[2026-05-24 08:27:22] [INFO ] Implicit Places using invariants in 89 ms returned []
[2026-05-24 08:27:22] [INFO ] Invariant cache hit.
[2026-05-24 08:27:22] [INFO ] State equation strengthened by 26 read => feed constraints.
[2026-05-24 08:27:22] [INFO ] Implicit Places using invariants and state equation in 561 ms returned []
Implicit Place search using SMT with State Equation took 651 ms to find 0 implicit places.
[2026-05-24 08:27:22] [INFO ] Redundant transitions in 16 ms returned []
Running 245 sub problems to find dead transitions.
[2026-05-24 08:27:23] [INFO ] Invariant cache hit.
[2026-05-24 08:27:23] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/251 variables, 41/43 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/251 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 3 (OVERLAPS) 246/497 variables, 251/294 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/497 variables, 26/320 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/497 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 245 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/498 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/498 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 8 (OVERLAPS) 0/498 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 245 unsolved
No progress, stopping.
After SMT solving in domain Real declared 498/498 variables, and 321 constraints, problems are : Problem set: 0 solved, 245 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 252/252 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 245/245 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 245 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/251 variables, 41/43 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/251 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 3 (OVERLAPS) 246/497 variables, 251/294 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/497 variables, 26/320 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/497 variables, 245/565 constraints. Problems are: Problem set: 0 solved, 245 unsolved
Detected timeout of ITS tools.
[2026-05-24 08:28:08] [INFO ] Flatten gal took : 48 ms
[2026-05-24 08:28:08] [INFO ] Applying decomposition
[2026-05-24 08:28:08] [INFO ] Flatten gal took : 28 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph11219087819579617322.txt' '-o' '/tmp/graph11219087819579617322.bin' '-w' '/tmp/graph11219087819579617322.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11219087819579617322.bin' '-l' '-1' '-v' '-w' '/tmp/graph11219087819579617322.weights' '-q' '0' '-e' '0.001'
[2026-05-24 08:28:08] [INFO ] Decomposing Gal with order
[2026-05-24 08:28:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 08:28:08] [INFO ] Removed a total of 196 redundant transitions.
[2026-05-24 08:28:09] [INFO ] Flatten gal took : 238 ms
[2026-05-24 08:28:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 24 ms.
[2026-05-24 08:28:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1077867888649678555.gal : 15 ms
[2026-05-24 08:28:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11007916234700223100.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1077867888649678555.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11007916234700223100.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality11007916234700223100.prop.
SDD proceeding with computation,124 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,124 properties remain. new max is 8
SDD size :7 after 23
SDD proceeding with computation,124 properties remain. new max is 16
SDD size :23 after 70
SDD proceeding with computation,124 properties remain. new max is 32
SDD size :70 after 107
SDD proceeding with computation,124 properties remain. new max is 64
SDD size :107 after 213
SDD proceeding with computation,124 properties remain. new max is 128
SDD size :213 after 1782
SDD proceeding with computation,124 properties remain. new max is 256
SDD size :1782 after 2502
SDD proceeding with computation,124 properties remain. new max is 512
SDD size :2502 after 12966
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 497/498 variables, and 565 constraints, problems are : Problem set: 0 solved, 245 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 251/252 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 245/245 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60074ms problems are : Problem set: 0 solved, 245 unsolved
Search for dead transitions found 0 dead transitions in 60076ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60777 ms. Remains : 252/252 places, 246/246 transitions.
RANDOM walk for 400000 steps (57812 resets) in 7473 ms. (53 steps per ms) remains 171/171 properties
Running SMT prover for 171 properties.
[2026-05-24 08:28:25] [INFO ] Invariant cache hit.
[2026-05-24 08:28:25] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-24 08:28:25] [INFO ] [Real]Absence check using 2 positive and 41 generalized place invariants in 12 ms returned sat
[2026-05-24 08:28:26] [INFO ] After 697ms SMT Verify possible using state equation in real domain returned unsat :0 sat :171
[2026-05-24 08:28:26] [INFO ] State equation strengthened by 26 read => feed constraints.
[2026-05-24 08:28:27] [INFO ] After 1013ms SMT Verify possible using 26 Read/Feed constraints in real domain returned unsat :0 sat :171
TRAPS : Iteration 0
[2026-05-24 08:28:31] [INFO ] After 5577ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:171
[2026-05-24 08:28:31] [INFO ] After 6482ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:171
[2026-05-24 08:28:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-24 08:28:31] [INFO ] [Nat]Absence check using 2 positive and 41 generalized place invariants in 13 ms returned sat
[2026-05-24 08:28:32] [INFO ] After 675ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :171
[2026-05-24 08:28:34] [INFO ] After 1703ms SMT Verify possible using 26 Read/Feed constraints in natural domain returned unsat :0 sat :171
TRAPS : Iteration 0
[2026-05-24 08:28:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 204 ms
[2026-05-24 08:28:35] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1296 ms
[2026-05-24 08:28:36] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 718 ms
[2026-05-24 08:28:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2026-05-24 08:28:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2026-05-24 08:28:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2026-05-24 08:28:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 207 ms
[2026-05-24 08:28:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 148 ms
[2026-05-24 08:28:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 137 ms
[2026-05-24 08:28:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2026-05-24 08:28:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2026-05-24 08:28:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2026-05-24 08:28:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2026-05-24 08:28:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2026-05-24 08:28:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
TRAPS : Iteration 1
[2026-05-24 08:28:46] [INFO ] After 14045ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :171
[2026-05-24 08:28:48] [INFO ] After 17124ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :171
RANDOM walk for 4000000 steps (577094 resets) in 53330 ms. (75 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40001 steps (3638 resets) in 329 ms. (121 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40001 steps (3727 resets) in 510 ms. (78 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40003 steps (3640 resets) in 456 ms. (87 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40001 steps (3670 resets) in 397 ms. (100 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40001 steps (3668 resets) in 318 ms. (125 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40003 steps (3678 resets) in 392 ms. (101 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40001 steps (3662 resets) in 471 ms. (84 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40001 steps (3712 resets) in 279 ms. (142 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40001 steps (3594 resets) in 393 ms. (101 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40000 steps (3704 resets) in 447 ms. (89 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40003 steps (3608 resets) in 311 ms. (128 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40002 steps (3623 resets) in 417 ms. (95 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40001 steps (3591 resets) in 391 ms. (102 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40003 steps (3635 resets) in 391 ms. (102 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40001 steps (3680 resets) in 435 ms. (91 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40002 steps (3658 resets) in 546 ms. (73 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40001 steps (3687 resets) in 447 ms. (89 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40000 steps (3621 resets) in 349 ms. (114 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40000 steps (3661 resets) in 383 ms. (104 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40001 steps (3637 resets) in 342 ms. (116 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40003 steps (3668 resets) in 425 ms. (93 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40002 steps (3653 resets) in 321 ms. (124 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40002 steps (3592 resets) in 420 ms. (95 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40002 steps (3595 resets) in 516 ms. (77 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40002 steps (3604 resets) in 404 ms. (98 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40001 steps (3693 resets) in 381 ms. (104 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40002 steps (3662 resets) in 328 ms. (121 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40003 steps (3661 resets) in 495 ms. (80 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40001 steps (3663 resets) in 307 ms. (129 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40003 steps (3691 resets) in 395 ms. (101 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40001 steps (3717 resets) in 387 ms. (103 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40002 steps (3615 resets) in 462 ms. (86 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40001 steps (3637 resets) in 387 ms. (103 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40001 steps (3686 resets) in 516 ms. (77 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40001 steps (3721 resets) in 498 ms. (80 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40002 steps (3664 resets) in 322 ms. (123 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40001 steps (3698 resets) in 493 ms. (80 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40001 steps (3640 resets) in 411 ms. (97 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40002 steps (3655 resets) in 389 ms. (102 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40001 steps (3650 resets) in 391 ms. (102 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40002 steps (3668 resets) in 329 ms. (121 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40001 steps (3722 resets) in 372 ms. (107 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40002 steps (3656 resets) in 439 ms. (90 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40002 steps (3714 resets) in 301 ms. (132 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40001 steps (3701 resets) in 357 ms. (111 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40001 steps (3756 resets) in 443 ms. (90 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40001 steps (3698 resets) in 485 ms. (82 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40002 steps (3654 resets) in 397 ms. (100 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40001 steps (3687 resets) in 386 ms. (103 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40000 steps (3584 resets) in 369 ms. (108 steps per ms) remains 124/124 properties
SDD proceeding with computation,124 properties remain. new max is 1024
SDD size :12966 after 8.27856e+07
Probably explored full state space saw : 681098 states, properties seen :0
Probabilistic random walk after 1362238 steps, saw 681098 distinct states, run finished after 25858 ms. (steps per millisecond=52 ) properties seen :0
Interrupted probabilistic random walk after 3503484 steps, run timeout after 63001 ms. (steps per millisecond=55 ) properties seen :0 out of 124
Exhaustive walk after 3503484 steps, saw 1751817 distinct states, run finished after 63001 ms. (steps per millisecond=55 ) properties seen :0
[2026-05-24 08:30:39] [INFO ] Invariant cache hit.
[2026-05-24 08:30:39] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (OVERLAPS) 43/214 variables, 14/33 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/214 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (OVERLAPS) 26/240 variables, 7/40 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 7 (OVERLAPS) 2/242 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 9 (OVERLAPS) 245/487 variables, 242/284 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/487 variables, 26/310 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/487 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 124 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 10/497 variables, 9/319 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/497 variables, 2/321 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/497 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 15 (OVERLAPS) 1/498 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/498 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 17 (OVERLAPS) 0/498 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Real declared 498/498 variables, and 322 constraints, problems are : Problem set: 0 solved, 124 unsolved in 26030 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 252/252 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 124 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (OVERLAPS) 43/214 variables, 14/33 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/214 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (OVERLAPS) 26/240 variables, 7/40 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 7 (OVERLAPS) 2/242 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 9 (OVERLAPS) 245/487 variables, 242/284 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/487 variables, 26/310 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/487 variables, 120/430 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/487 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 13 (OVERLAPS) 10/497 variables, 9/439 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/497 variables, 2/441 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/497 variables, 4/445 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/497 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 17 (OVERLAPS) 1/498 variables, 1/446 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/498 variables, 7/453 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/498 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 124 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 498/498 variables, and 453 constraints, problems are : Problem set: 0 solved, 124 unsolved in 105022 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 252/252 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 131063ms problems are : Problem set: 0 solved, 124 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 171 out of 252 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 246/246 transitions.
Applied a total of 0 rules in 16 ms. Remains 252 /252 variables (removed 0) and now considering 246/246 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 252/252 places, 246/246 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 246/246 transitions.
Applied a total of 0 rules in 10 ms. Remains 252 /252 variables (removed 0) and now considering 246/246 (removed 0) transitions.
[2026-05-24 08:32:50] [INFO ] Invariant cache hit.
[2026-05-24 08:32:50] [INFO ] Implicit Places using invariants in 125 ms returned []
[2026-05-24 08:32:50] [INFO ] Invariant cache hit.
[2026-05-24 08:32:50] [INFO ] State equation strengthened by 26 read => feed constraints.
[2026-05-24 08:32:51] [INFO ] Implicit Places using invariants and state equation in 579 ms returned []
Implicit Place search using SMT with State Equation took 706 ms to find 0 implicit places.
[2026-05-24 08:32:51] [INFO ] Redundant transitions in 7 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 732 ms. Remains : 252/252 places, 246/246 transitions.
RANDOM walk for 400000 steps (57729 resets) in 5018 ms. (79 steps per ms) remains 171/171 properties
Running SMT prover for 171 properties.
[2026-05-24 08:32:52] [INFO ] Invariant cache hit.
[2026-05-24 08:32:52] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2026-05-24 08:32:52] [INFO ] [Real]Absence check using 2 positive and 41 generalized place invariants in 14 ms returned sat
[2026-05-24 08:32:53] [INFO ] After 635ms SMT Verify possible using state equation in real domain returned unsat :0 sat :171
[2026-05-24 08:32:53] [INFO ] State equation strengthened by 26 read => feed constraints.
[2026-05-24 08:32:54] [INFO ] After 995ms SMT Verify possible using 26 Read/Feed constraints in real domain returned unsat :0 sat :171
TRAPS : Iteration 0
[2026-05-24 08:32:58] [INFO ] After 5350ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:171
[2026-05-24 08:32:58] [INFO ] After 6120ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:171
[2026-05-24 08:32:58] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-24 08:32:58] [INFO ] [Nat]Absence check using 2 positive and 41 generalized place invariants in 12 ms returned sat
[2026-05-24 08:32:59] [INFO ] After 662ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :171
[2026-05-24 08:33:01] [INFO ] After 1692ms SMT Verify possible using 26 Read/Feed constraints in natural domain returned unsat :0 sat :171
TRAPS : Iteration 0
[2026-05-24 08:33:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 213 ms
[2026-05-24 08:33:02] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1139 ms
[2026-05-24 08:33:03] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 818 ms
[2026-05-24 08:33:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2026-05-24 08:33:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2026-05-24 08:33:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2026-05-24 08:33:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 198 ms
[2026-05-24 08:33:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 141 ms
[2026-05-24 08:33:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 137 ms
[2026-05-24 08:33:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2026-05-24 08:33:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2026-05-24 08:33:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2026-05-24 08:33:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2026-05-24 08:33:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2026-05-24 08:33:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
TRAPS : Iteration 1
[2026-05-24 08:33:13] [INFO ] After 13767ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :171
[2026-05-24 08:33:15] [INFO ] After 16749ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :171
RANDOM walk for 40000 steps (5805 resets) in 91 ms. (434 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3691 resets) in 106 ms. (373 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 774275 steps, run timeout after 3001 ms. (steps per millisecond=258 ) properties seen :0 out of 1
Probabilistic random walk after 774275 steps, saw 387224 distinct states, run finished after 3001 ms. (steps per millisecond=258 ) properties seen :0
[2026-05-24 08:33:18] [INFO ] Invariant cache hit.
[2026-05-24 08:33:18] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 160/161 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 55/216 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/218 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 236/454 variables, 218/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/454 variables, 24/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/454 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 37/491 variables, 28/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/491 variables, 2/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/491 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/491 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/493 variables, 2/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/493 variables, 2/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/493 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 5/498 variables, 4/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/498 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/498 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/498 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 498/498 variables, and 321 constraints, problems are : Problem set: 0 solved, 1 unsolved in 383 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 252/252 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 160/161 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 55/216 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/218 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 236/454 variables, 218/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/454 variables, 24/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/454 variables, 2/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/454 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 37/491 variables, 28/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/491 variables, 2/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/491 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/491 variables, 1/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/491 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/493 variables, 2/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/493 variables, 2/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/493 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 5/498 variables, 4/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/498 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/498 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/498 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 498/498 variables, and 325 constraints, problems are : Problem set: 0 solved, 1 unsolved in 699 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 252/252 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 1088ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 54 ms.
Support contains 1 out of 252 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 246/246 transitions.
Graph (complete) has 834 edges and 252 vertex of which 251 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 251 transition count 245
Free-agglomeration rule (complex) applied 25 times.
Iterating global reduction 1 with 25 rules applied. Total rules applied 27 place count 251 transition count 220
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 52 place count 226 transition count 220
Partial Free-agglomeration rule applied 26 times.
Drop transitions (Partial Free agglomeration) removed 26 transitions
Iterating global reduction 2 with 26 rules applied. Total rules applied 78 place count 226 transition count 220
Applied a total of 78 rules in 36 ms. Remains 226 /252 variables (removed 26) and now considering 220/246 (removed 26) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 226/252 places, 220/246 transitions.
RANDOM walk for 40000 steps (5770 resets) in 114 ms. (347 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3676 resets) in 139 ms. (285 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 772189 steps, run timeout after 3001 ms. (steps per millisecond=257 ) properties seen :0 out of 1
Probabilistic random walk after 772189 steps, saw 386173 distinct states, run finished after 3001 ms. (steps per millisecond=257 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13107307380661610634.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-789950925392495404.kers'
[2026-05-24 08:33:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13107307380661610634.kers, --Pflows, --basisKERS=/tmp/petrispot-output-789950925392495404.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 220 rows 224 cols 1280 entries
Finished phase 1 with 135 SingleSign rule and 48 generalized
[2026-05-24 08:33:22] [INFO ] Computed 43 invariants in 2 ms
Computed 43 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-789950925392495404.kers
Total runtime 4 ms.
[2026-05-24 08:33:22] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 129/130 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 83/213 variables, 26/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 6/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/221 variables, 4/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/221 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 220/441 variables, 221/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/441 variables, 38/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/441 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 5/446 variables, 5/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/446 variables, 2/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/446 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/446 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 446/446 variables, and 315 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1009 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 226/226 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 129/130 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 83/213 variables, 26/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 6/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/221 variables, 4/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/221 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/221 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 220/441 variables, 221/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/441 variables, 38/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/441 variables, 1/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/441 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 5/446 variables, 5/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/446 variables, 2/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/446 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/446 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 446/446 variables, and 323 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1356 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 226/226 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2388ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 48 ms.
Support contains 1 out of 226 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 220/220 transitions.
Applied a total of 0 rules in 14 ms. Remains 226 /226 variables (removed 0) and now considering 220/220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 226/226 places, 220/220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 220/220 transitions.
Applied a total of 0 rules in 13 ms. Remains 226 /226 variables (removed 0) and now considering 220/220 (removed 0) transitions.
[2026-05-24 08:33:25] [INFO ] Invariant cache hit.
[2026-05-24 08:33:25] [INFO ] Implicit Places using invariants in 579 ms returned [44, 49, 71, 76, 96, 102, 123, 128, 148, 153, 174, 180]
[2026-05-24 08:33:25] [INFO ] Actually due to overlaps returned [49, 44]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 582 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 224/226 places, 220/220 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 224 transition count 219
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 223 transition count 219
Applied a total of 2 rules in 26 ms. Remains 223 /224 variables (removed 1) and now considering 219/220 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5464469260805998413.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9713202519130776160.kers'
[2026-05-24 08:33:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5464469260805998413.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9713202519130776160.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 219 rows 221 cols 1246 entries
Finished phase 1 with 135 SingleSign rule and 47 generalized
[2026-05-24 08:33:25] [INFO ] Computed 41 invariants in 2 ms
Computed 41 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9713202519130776160.kers
Total runtime 3 ms.
[2026-05-24 08:33:26] [INFO ] Implicit Places using invariants in 527 ms returned [68, 73, 93, 99, 120, 125, 145, 150, 171, 177]
[2026-05-24 08:33:26] [INFO ] Actually due to overlaps returned [73, 68]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 531 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 221/226 places, 219/220 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 221 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 220 transition count 218
Applied a total of 2 rules in 21 ms. Remains 220 /221 variables (removed 1) and now considering 218/219 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15859196946397104524.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3138797949849220750.kers'
[2026-05-24 08:33:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15859196946397104524.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3138797949849220750.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 218 rows 218 cols 1217 entries
Finished phase 1 with 135 SingleSign rule and 46 generalized
[2026-05-24 08:33:26] [INFO ] Computed 39 invariants in 6 ms
Computed 39 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-3138797949849220750.kers
Total runtime 7 ms.
[2026-05-24 08:33:26] [INFO ] Implicit Places using invariants in 437 ms returned [90, 96, 117, 122, 142, 147, 168, 174]
[2026-05-24 08:33:26] [INFO ] Actually due to overlaps returned [96, 90]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 442 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 218/226 places, 218/220 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 218 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 217 transition count 217
Applied a total of 2 rules in 15 ms. Remains 217 /218 variables (removed 1) and now considering 217/218 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11236225049074731292.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16956485432789747975.kers'
[2026-05-24 08:33:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11236225049074731292.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16956485432789747975.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 217 rows 215 cols 1193 entries
Finished phase 1 with 135 SingleSign rule and 45 generalized
[2026-05-24 08:33:26] [INFO ] Computed 37 invariants in 3 ms
Computed 37 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-16956485432789747975.kers
Total runtime 4 ms.
[2026-05-24 08:33:27] [INFO ] Implicit Places using invariants in 391 ms returned [114, 119, 139, 144, 165, 171]
[2026-05-24 08:33:27] [INFO ] Actually due to overlaps returned [119, 114]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 395 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 215/226 places, 217/220 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 215 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 214 transition count 216
Applied a total of 2 rules in 14 ms. Remains 214 /215 variables (removed 1) and now considering 216/217 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17421340229413386057.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15887096054532452960.kers'
[2026-05-24 08:33:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17421340229413386057.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15887096054532452960.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 216 rows 212 cols 1174 entries
Finished phase 1 with 135 SingleSign rule and 44 generalized
[2026-05-24 08:33:27] [INFO ] Computed 35 invariants in 2 ms
Computed 35 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15887096054532452960.kers
Total runtime 3 ms.
[2026-05-24 08:33:27] [INFO ] Implicit Places using invariants in 336 ms returned [136, 141, 162, 168]
[2026-05-24 08:33:27] [INFO ] Actually due to overlaps returned [141, 136]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 340 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 212/226 places, 216/220 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 212 transition count 215
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 211 transition count 215
Applied a total of 2 rules in 12 ms. Remains 211 /212 variables (removed 1) and now considering 215/216 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6755701332708786599.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15382023676863684619.kers'
[2026-05-24 08:33:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6755701332708786599.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15382023676863684619.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 215 rows 209 cols 1160 entries
Finished phase 1 with 135 SingleSign rule and 43 generalized
[2026-05-24 08:33:27] [INFO ] Computed 33 invariants in 2 ms
Computed 33 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15382023676863684619.kers
Total runtime 3 ms.
[2026-05-24 08:33:28] [INFO ] Implicit Places using invariants in 327 ms returned [159, 165]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 333 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 209/226 places, 215/220 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 209 transition count 214
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 208 transition count 214
Applied a total of 2 rules in 13 ms. Remains 208 /209 variables (removed 1) and now considering 214/215 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5631083851414884967.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11554945365771161430.kers'
[2026-05-24 08:33:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5631083851414884967.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11554945365771161430.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 214 rows 206 cols 1151 entries
Finished phase 1 with 135 SingleSign rule and 42 generalized
[2026-05-24 08:33:28] [INFO ] Computed 31 invariants in 1 ms
Computed 31 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11554945365771161430.kers
Total runtime 2 ms.
[2026-05-24 08:33:28] [INFO ] Implicit Places using invariants in 333 ms returned []
[2026-05-24 08:33:28] [INFO ] Invariant cache hit.
[2026-05-24 08:33:28] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-24 08:33:30] [INFO ] Implicit Places using invariants and state equation in 2299 ms returned []
Implicit Place search using SMT with State Equation took 2637 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 208/226 places, 214/220 transitions.
Finished structural reductions in REACHABILITY mode , in 7 iterations and 5381 ms. Remains : 208/226 places, 214/220 transitions.
RANDOM walk for 40000 steps (5801 resets) in 101 ms. (392 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3643 resets) in 95 ms. (416 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 797291 steps, run timeout after 3001 ms. (steps per millisecond=265 ) properties seen :0 out of 1
Probabilistic random walk after 797291 steps, saw 398741 distinct states, run finished after 3001 ms. (steps per millisecond=265 ) properties seen :0
[2026-05-24 08:33:33] [INFO ] Invariant cache hit.
[2026-05-24 08:33:33] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 134/135 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 62/197 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/203 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 214/417 variables, 203/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/417 variables, 38/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/417 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/422 variables, 5/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/422 variables, 2/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/422 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/422 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 422/422 variables, and 289 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1237 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 208/208 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 134/135 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 62/197 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/203 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/203 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 214/417 variables, 203/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/417 variables, 38/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/417 variables, 1/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/417 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 5/422 variables, 5/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/422 variables, 2/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/422 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/422 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 422/422 variables, and 292 constraints, problems are : Problem set: 0 solved, 1 unsolved in 553 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 208/208 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1796ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 31 ms.
Support contains 1 out of 208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 208/208 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 4 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2026-05-24 08:33:35] [INFO ] Invariant cache hit.
[2026-05-24 08:33:35] [INFO ] Implicit Places using invariants in 325 ms returned []
[2026-05-24 08:33:35] [INFO ] Invariant cache hit.
[2026-05-24 08:33:36] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-24 08:33:38] [INFO ] Implicit Places using invariants and state equation in 2243 ms returned []
Implicit Place search using SMT with State Equation took 2570 ms to find 0 implicit places.
[2026-05-24 08:33:38] [INFO ] Redundant transitions in 2 ms returned []
Running 213 sub problems to find dead transitions.
[2026-05-24 08:33:38] [INFO ] Invariant cache hit.
[2026-05-24 08:33:38] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/207 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (OVERLAPS) 1/208 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (OVERLAPS) 214/422 variables, 208/241 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/422 variables, 38/279 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/422 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 213 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/422 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 422/422 variables, and 279 constraints, problems are : Problem set: 0 solved, 213 unsolved in 20338 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 208/208 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/207 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (OVERLAPS) 1/208 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (OVERLAPS) 214/422 variables, 208/242 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/422 variables, 38/280 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/422 variables, 213/493 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/422 variables, 20/513 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 422/422 variables, and 513 constraints, problems are : Problem set: 0 solved, 213 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 208/208 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50423ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 50428ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53012 ms. Remains : 208/208 places, 214/214 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 208 transition count 196
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 190 transition count 196
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 181 transition count 187
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 181 transition count 187
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 180 transition count 186
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 180 transition count 184
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 178 transition count 184
Applied a total of 60 rules in 45 ms. Remains 178 /208 variables (removed 30) and now considering 184/214 (removed 30) transitions.
Running SMT prover for 1 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12884758354240094661.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11234008525218117348.kers'
[2026-05-24 08:34:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12884758354240094661.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11234008525218117348.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 184 rows 176 cols 1064 entries
Finished phase 1 with 102 SingleSign rule and 45 generalized
[2026-05-24 08:34:28] [INFO ] Computed 31 invariants in 2 ms
Computed 31 P flows in 18 ms.
Exported basis to /tmp/petrispot-output-11234008525218117348.kers
Total runtime 18 ms.
[2026-05-24 08:34:28] [INFO ] [Real]Absence check using 3 positive place invariants in 37 ms returned sat
[2026-05-24 08:34:29] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 149 ms returned sat
[2026-05-24 08:34:29] [INFO ] After 118ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2026-05-24 08:34:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 08:34:29] [INFO ] After 9ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 08:34:29] [INFO ] After 22ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2026-05-24 08:34:29] [INFO ] After 454ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 549 ms.
RANDOM walk for 40000 steps (5756 resets) in 110 ms. (360 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3665 resets) in 63 ms. (625 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 734557 steps, run timeout after 3001 ms. (steps per millisecond=244 ) properties seen :0 out of 1
Probabilistic random walk after 734557 steps, saw 367364 distinct states, run finished after 3001 ms. (steps per millisecond=244 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8729011488795261159.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6129983091801256801.kers'
[2026-05-24 08:34:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8729011488795261159.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6129983091801256801.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 246 rows 250 cols 1004 entries
Finished phase 1 with 153 SingleSign rule and 56 generalized
[2026-05-24 08:34:32] [INFO ] Computed 43 invariants in 7 ms
Computed 43 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-6129983091801256801.kers
Total runtime 9 ms.
[2026-05-24 08:34:32] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 160/161 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 55/216 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/218 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 236/454 variables, 218/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/454 variables, 24/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/454 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 37/491 variables, 28/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/491 variables, 2/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/491 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/491 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/493 variables, 2/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/493 variables, 2/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/493 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 5/498 variables, 4/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/498 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/498 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/498 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 498/498 variables, and 322 constraints, problems are : Problem set: 0 solved, 1 unsolved in 373 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 252/252 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 160/161 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 55/216 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/218 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 236/454 variables, 218/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/454 variables, 24/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/454 variables, 2/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/454 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 37/491 variables, 28/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/491 variables, 2/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/491 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/491 variables, 1/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/491 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/493 variables, 2/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/493 variables, 2/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/493 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 5/498 variables, 4/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/498 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/498 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/498 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 498/498 variables, and 325 constraints, problems are : Problem set: 0 solved, 1 unsolved in 420 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 252/252 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 824ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 79 ms.
Support contains 1 out of 252 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 246/246 transitions.
Graph (complete) has 834 edges and 252 vertex of which 251 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 251 transition count 245
Free-agglomeration rule (complex) applied 24 times.
Iterating global reduction 1 with 24 rules applied. Total rules applied 26 place count 251 transition count 221
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 50 place count 227 transition count 221
Partial Free-agglomeration rule applied 26 times.
Drop transitions (Partial Free agglomeration) removed 26 transitions
Iterating global reduction 2 with 26 rules applied. Total rules applied 76 place count 227 transition count 221
Applied a total of 76 rules in 21 ms. Remains 227 /252 variables (removed 25) and now considering 221/246 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 227/252 places, 221/246 transitions.
RANDOM walk for 40000 steps (5822 resets) in 90 ms. (439 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3648 resets) in 71 ms. (555 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 775425 steps, run timeout after 3001 ms. (steps per millisecond=258 ) properties seen :0 out of 1
Probabilistic random walk after 775425 steps, saw 387800 distinct states, run finished after 3001 ms. (steps per millisecond=258 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1925219350686819799.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4557257021326365362.kers'
[2026-05-24 08:34:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1925219350686819799.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4557257021326365362.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 221 rows 225 cols 1148 entries
Finished phase 1 with 136 SingleSign rule and 48 generalized
[2026-05-24 08:34:36] [INFO ] Computed 43 invariants in 4 ms
Computed 43 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-4557257021326365362.kers
Total runtime 5 ms.
[2026-05-24 08:34:36] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 164/165 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 53/218 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/222 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 6/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 221/443 variables, 222/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/443 variables, 38/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/443 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/448 variables, 5/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/448 variables, 2/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/448 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/448 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 448/448 variables, and 316 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1109 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 227/227 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 164/165 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 53/218 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 7/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 16/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/222 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 221/443 variables, 222/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/443 variables, 38/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/443 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/443 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 5/448 variables, 5/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/448 variables, 2/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/448 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/448 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 448/448 variables, and 333 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1833 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 227/227 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2978ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 43 ms.
Support contains 1 out of 227 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 221/221 transitions.
Applied a total of 0 rules in 5 ms. Remains 227 /227 variables (removed 0) and now considering 221/221 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 227/227 places, 221/221 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 221/221 transitions.
Applied a total of 0 rules in 27 ms. Remains 227 /227 variables (removed 0) and now considering 221/221 (removed 0) transitions.
[2026-05-24 08:34:39] [INFO ] Invariant cache hit.
[2026-05-24 08:34:39] [INFO ] Implicit Places using invariants in 524 ms returned [43, 71, 76, 97, 103, 124, 129, 149, 154, 175, 181]
[2026-05-24 08:34:39] [INFO ] Actually due to overlaps returned [76, 43, 71]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 529 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 224/227 places, 221/221 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 224 transition count 220
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 223 transition count 220
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 223 transition count 220
Applied a total of 3 rules in 14 ms. Remains 223 /224 variables (removed 1) and now considering 220/221 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15161328183446290751.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5365059043703658349.kers'
[2026-05-24 08:34:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15161328183446290751.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5365059043703658349.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 220 rows 221 cols 1116 entries
Finished phase 1 with 137 SingleSign rule and 46 generalized
[2026-05-24 08:34:39] [INFO ] Computed 40 invariants in 2 ms
Computed 40 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5365059043703658349.kers
Total runtime 3 ms.
[2026-05-24 08:34:40] [INFO ] Implicit Places using invariants in 433 ms returned [93, 99, 120, 125, 145, 150, 171, 177]
[2026-05-24 08:34:40] [INFO ] Actually due to overlaps returned [99, 93]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 444 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 221/227 places, 220/221 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 221 transition count 219
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 220 transition count 219
Applied a total of 2 rules in 17 ms. Remains 220 /221 variables (removed 1) and now considering 219/220 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3664701213904721734.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1162185706586091509.kers'
[2026-05-24 08:34:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3664701213904721734.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1162185706586091509.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 219 rows 218 cols 1092 entries
Finished phase 1 with 137 SingleSign rule and 45 generalized
[2026-05-24 08:34:40] [INFO ] Computed 38 invariants in 2 ms
Computed 38 P flows in 17 ms.
Exported basis to /tmp/petrispot-output-1162185706586091509.kers
Total runtime 18 ms.
[2026-05-24 08:34:40] [INFO ] Implicit Places using invariants in 568 ms returned [117, 122, 142, 147, 168, 174]
[2026-05-24 08:34:40] [INFO ] Actually due to overlaps returned [122, 117]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 579 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 218/227 places, 219/221 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 218 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 217 transition count 218
Applied a total of 2 rules in 19 ms. Remains 217 /218 variables (removed 1) and now considering 218/219 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1236348329733590294.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-242178476247446513.kers'
[2026-05-24 08:34:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1236348329733590294.kers, --Pflows, --basisKERS=/tmp/petrispot-output-242178476247446513.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 218 rows 215 cols 1073 entries
Finished phase 1 with 137 SingleSign rule and 44 generalized
[2026-05-24 08:34:40] [INFO ] Computed 36 invariants in 1 ms
Computed 36 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-242178476247446513.kers
Total runtime 6 ms.
[2026-05-24 08:34:41] [INFO ] Implicit Places using invariants in 747 ms returned [139, 144, 165, 171]
[2026-05-24 08:34:41] [INFO ] Actually due to overlaps returned [144, 139]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 752 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 215/227 places, 218/221 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 215 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 214 transition count 217
Applied a total of 2 rules in 11 ms. Remains 214 /215 variables (removed 1) and now considering 217/218 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11382869592194315328.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14345673646331516044.kers'
[2026-05-24 08:34:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11382869592194315328.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14345673646331516044.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 217 rows 212 cols 1059 entries
Finished phase 1 with 137 SingleSign rule and 43 generalized
[2026-05-24 08:34:41] [INFO ] Computed 34 invariants in 1 ms
Computed 34 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14345673646331516044.kers
Total runtime 2 ms.
[2026-05-24 08:34:42] [INFO ] Implicit Places using invariants in 473 ms returned [162, 168]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 482 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 212/227 places, 217/221 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 212 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 211 transition count 216
Applied a total of 2 rules in 10 ms. Remains 211 /212 variables (removed 1) and now considering 216/217 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4892965763590293095.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6137370189342663105.kers'
[2026-05-24 08:34:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4892965763590293095.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6137370189342663105.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 216 rows 209 cols 1050 entries
Finished phase 1 with 137 SingleSign rule and 42 generalized
[2026-05-24 08:34:42] [INFO ] Computed 32 invariants in 1 ms
Computed 32 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6137370189342663105.kers
Total runtime 2 ms.
[2026-05-24 08:34:42] [INFO ] Implicit Places using invariants in 555 ms returned []
[2026-05-24 08:34:42] [INFO ] Invariant cache hit.
[2026-05-24 08:34:42] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-24 08:34:44] [INFO ] Implicit Places using invariants and state equation in 1787 ms returned []
Implicit Place search using SMT with State Equation took 2353 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 211/227 places, 216/221 transitions.
Finished structural reductions in REACHABILITY mode , in 6 iterations and 5244 ms. Remains : 211/227 places, 216/221 transitions.
RANDOM walk for 40000 steps (5760 resets) in 107 ms. (370 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3609 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 753988 steps, run timeout after 3001 ms. (steps per millisecond=251 ) properties seen :0 out of 1
Probabilistic random walk after 753988 steps, saw 377074 distinct states, run finished after 3001 ms. (steps per millisecond=251 ) properties seen :0
[2026-05-24 08:34:47] [INFO ] Invariant cache hit.
[2026-05-24 08:34:47] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 146/147 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 55/202 variables, 21/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/206 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/206 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 216/422 variables, 206/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/422 variables, 38/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/422 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/427 variables, 5/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/427 variables, 2/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/427 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/427 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 427/427 variables, and 295 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1327 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 211/211 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 146/147 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 55/202 variables, 21/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/206 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/206 variables, 4/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/206 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 216/422 variables, 206/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/422 variables, 38/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/422 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/422 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 5/427 variables, 5/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/427 variables, 2/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/427 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/427 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 427/427 variables, and 300 constraints, problems are : Problem set: 0 solved, 1 unsolved in 712 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 211/211 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2044ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 43 ms.
Support contains 1 out of 211 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 216/216 transitions.
Applied a total of 0 rules in 3 ms. Remains 211 /211 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 211/211 places, 216/216 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 216/216 transitions.
Applied a total of 0 rules in 4 ms. Remains 211 /211 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2026-05-24 08:34:49] [INFO ] Invariant cache hit.
[2026-05-24 08:34:50] [INFO ] Implicit Places using invariants in 483 ms returned []
[2026-05-24 08:34:50] [INFO ] Invariant cache hit.
[2026-05-24 08:34:50] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-24 08:34:51] [INFO ] Implicit Places using invariants and state equation in 1813 ms returned []
Implicit Place search using SMT with State Equation took 2307 ms to find 0 implicit places.
[2026-05-24 08:34:51] [INFO ] Redundant transitions in 2 ms returned []
Running 215 sub problems to find dead transitions.
[2026-05-24 08:34:51] [INFO ] Invariant cache hit.
[2026-05-24 08:34:51] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/210 variables, 27/29 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (OVERLAPS) 1/211 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/211 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (OVERLAPS) 216/427 variables, 211/245 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/427 variables, 38/283 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/427 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 215 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/427 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 427/427 variables, and 283 constraints, problems are : Problem set: 0 solved, 215 unsolved in 21469 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 211/211 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/210 variables, 27/29 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (OVERLAPS) 1/211 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/211 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (OVERLAPS) 216/427 variables, 211/245 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/427 variables, 38/283 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/427 variables, 215/498 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/427 variables, 20/518 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 427/427 variables, and 518 constraints, problems are : Problem set: 0 solved, 215 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 211/211 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 51536ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 51536ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53854 ms. Remains : 211/211 places, 216/216 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 211 transition count 198
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 193 transition count 198
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 185 transition count 190
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 185 transition count 190
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 184 transition count 189
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 184 transition count 187
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 182 transition count 187
Applied a total of 58 rules in 13 ms. Remains 182 /211 variables (removed 29) and now considering 187/216 (removed 29) transitions.
Running SMT prover for 1 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11635325824861823501.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2229451723728733447.kers'
[2026-05-24 08:35:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11635325824861823501.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2229451723728733447.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 187 rows 180 cols 968 entries
Finished phase 1 with 104 SingleSign rule and 46 generalized
[2026-05-24 08:35:43] [INFO ] Computed 32 invariants in 1 ms
Computed 32 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2229451723728733447.kers
Total runtime 2 ms.
[2026-05-24 08:35:43] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2026-05-24 08:35:43] [INFO ] [Real]Absence check using 3 positive and 29 generalized place invariants in 7 ms returned sat
[2026-05-24 08:35:43] [INFO ] After 96ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2026-05-24 08:35:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 08:35:43] [INFO ] After 7ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 08:35:43] [INFO ] After 21ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2026-05-24 08:35:43] [INFO ] After 176ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 197 ms.
RANDOM walk for 40000 steps (5791 resets) in 80 ms. (493 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3649 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 744210 steps, run timeout after 3001 ms. (steps per millisecond=247 ) properties seen :0 out of 1
Probabilistic random walk after 744210 steps, saw 372192 distinct states, run finished after 3001 ms. (steps per millisecond=247 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16743764929329153780.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15649494753078034364.kers'
[2026-05-24 08:35:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16743764929329153780.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15649494753078034364.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 246 rows 250 cols 1004 entries
Finished phase 1 with 153 SingleSign rule and 56 generalized
[2026-05-24 08:35:46] [INFO ] Computed 43 invariants in 4 ms
Computed 43 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-15649494753078034364.kers
Total runtime 5 ms.
[2026-05-24 08:35:46] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 155/189 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/218 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 236/454 variables, 218/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/454 variables, 24/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/454 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 37/491 variables, 28/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/491 variables, 2/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/491 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/491 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/493 variables, 2/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/493 variables, 2/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/493 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 5/498 variables, 4/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/498 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/498 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/498 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 498/498 variables, and 321 constraints, problems are : Problem set: 0 solved, 1 unsolved in 420 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 252/252 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 155/189 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/218 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 236/454 variables, 218/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/454 variables, 24/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/454 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/454 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/454 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 37/491 variables, 28/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/491 variables, 2/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/491 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/491 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/493 variables, 2/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/493 variables, 2/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/493 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 5/498 variables, 4/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/498 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/498 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/498 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 498/498 variables, and 323 constraints, problems are : Problem set: 0 solved, 1 unsolved in 455 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 252/252 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 890ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 31 ms.
Support contains 1 out of 252 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 246/246 transitions.
Graph (complete) has 834 edges and 252 vertex of which 251 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 251 transition count 245
Free-agglomeration rule (complex) applied 26 times.
Iterating global reduction 1 with 26 rules applied. Total rules applied 28 place count 251 transition count 219
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 54 place count 225 transition count 219
Partial Free-agglomeration rule applied 25 times.
Drop transitions (Partial Free agglomeration) removed 25 transitions
Iterating global reduction 2 with 25 rules applied. Total rules applied 79 place count 225 transition count 219
Applied a total of 79 rules in 14 ms. Remains 225 /252 variables (removed 27) and now considering 219/246 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 225/252 places, 219/246 transitions.
RANDOM walk for 40000 steps (5781 resets) in 90 ms. (439 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (3678 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
Probably explored full state space saw : 355343 states, properties seen :0
Probabilistic random walk after 710692 steps, saw 355343 distinct states, run finished after 2639 ms. (steps per millisecond=269 ) properties seen :0
Interrupted probabilistic random walk after 795886 steps, run timeout after 3001 ms. (steps per millisecond=265 ) properties seen :0 out of 1
Exhaustive walk after 795886 steps, saw 398039 distinct states, run finished after 3001 ms. (steps per millisecond=265 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7841819830355447424.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10018783717259228931.kers'
[2026-05-24 08:35:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7841819830355447424.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10018783717259228931.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 219 rows 223 cols 1170 entries
Finished phase 1 with 134 SingleSign rule and 48 generalized
[2026-05-24 08:35:53] [INFO ] Computed 43 invariants in 1 ms
Computed 43 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-10018783717259228931.kers
Total runtime 12 ms.
[2026-05-24 08:35:53] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 39/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/193 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 6/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 27/220 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/220 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 219/439 variables, 220/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/439 variables, 38/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/439 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/444 variables, 5/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/444 variables, 2/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/444 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/444 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 444/444 variables, and 312 constraints, problems are : Problem set: 0 solved, 1 unsolved in 967 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 225/225 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 39/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/193 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 6/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 27/220 variables, 18/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/220 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/220 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 219/439 variables, 220/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/439 variables, 38/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/439 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/439 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 5/444 variables, 5/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 2/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/444 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/444 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 444/444 variables, and 315 constraints, problems are : Problem set: 0 solved, 1 unsolved in 536 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 225/225 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1545ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 32 ms.
Support contains 1 out of 225 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 225/225 places, 219/219 transitions.
Applied a total of 0 rules in 4 ms. Remains 225 /225 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 225/225 places, 219/219 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 225/225 places, 219/219 transitions.
Applied a total of 0 rules in 4 ms. Remains 225 /225 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2026-05-24 08:35:54] [INFO ] Invariant cache hit.
[2026-05-24 08:35:55] [INFO ] Implicit Places using invariants in 496 ms returned [43, 70, 75, 95, 101, 122, 127, 147, 152, 173, 179]
[2026-05-24 08:35:55] [INFO ] Actually due to overlaps returned [75, 43, 70]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 499 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 222/225 places, 219/219 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 222 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 221 transition count 218
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 221 transition count 218
Applied a total of 3 rules in 13 ms. Remains 221 /222 variables (removed 1) and now considering 218/219 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9841671181330057451.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8318514842538433168.kers'
[2026-05-24 08:35:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9841671181330057451.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8318514842538433168.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 218 rows 219 cols 1138 entries
Finished phase 1 with 135 SingleSign rule and 46 generalized
[2026-05-24 08:35:55] [INFO ] Computed 40 invariants in 2 ms
Computed 40 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-8318514842538433168.kers
Total runtime 2 ms.
[2026-05-24 08:35:55] [INFO ] Implicit Places using invariants in 425 ms returned [91, 97, 118, 123, 143, 148, 169, 175]
[2026-05-24 08:35:55] [INFO ] Actually due to overlaps returned [97, 91]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 439 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 219/225 places, 218/219 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 219 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 218 transition count 217
Applied a total of 2 rules in 9 ms. Remains 218 /219 variables (removed 1) and now considering 217/218 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10067768093782702464.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11511837950944295213.kers'
[2026-05-24 08:35:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10067768093782702464.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11511837950944295213.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 217 rows 216 cols 1114 entries
Finished phase 1 with 135 SingleSign rule and 45 generalized
[2026-05-24 08:35:55] [INFO ] Computed 38 invariants in 1 ms
Computed 38 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11511837950944295213.kers
Total runtime 2 ms.
[2026-05-24 08:35:56] [INFO ] Implicit Places using invariants in 372 ms returned [115, 120, 140, 145, 166, 172]
[2026-05-24 08:35:56] [INFO ] Actually due to overlaps returned [120, 115]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 373 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 216/225 places, 217/219 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 216 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 215 transition count 216
Applied a total of 2 rules in 41 ms. Remains 215 /216 variables (removed 1) and now considering 216/217 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12714559735111620864.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4532910671919629563.kers'
[2026-05-24 08:35:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12714559735111620864.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4532910671919629563.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 216 rows 213 cols 1095 entries
Finished phase 1 with 135 SingleSign rule and 44 generalized
[2026-05-24 08:35:56] [INFO ] Computed 36 invariants in 1 ms
Computed 36 P flows in 18 ms.
Exported basis to /tmp/petrispot-output-4532910671919629563.kers
Total runtime 18 ms.
[2026-05-24 08:35:56] [INFO ] Implicit Places using invariants in 352 ms returned [137, 142, 163, 169]
[2026-05-24 08:35:56] [INFO ] Actually due to overlaps returned [142, 137]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 365 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 213/225 places, 216/219 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 213 transition count 215
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 212 transition count 215
Applied a total of 2 rules in 7 ms. Remains 212 /213 variables (removed 1) and now considering 215/216 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14569674908922659689.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5220680936815911506.kers'
[2026-05-24 08:35:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14569674908922659689.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5220680936815911506.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 215 rows 210 cols 1081 entries
Finished phase 1 with 135 SingleSign rule and 43 generalized
[2026-05-24 08:35:56] [INFO ] Computed 34 invariants in 1 ms
Computed 34 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5220680936815911506.kers
Total runtime 2 ms.
[2026-05-24 08:35:57] [INFO ] Implicit Places using invariants in 307 ms returned [160, 166]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 318 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 210/225 places, 215/219 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 210 transition count 214
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 209 transition count 214
Applied a total of 2 rules in 7 ms. Remains 209 /210 variables (removed 1) and now considering 214/215 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2745754335132499859.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11975886163359686104.kers'
[2026-05-24 08:35:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2745754335132499859.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11975886163359686104.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 214 rows 207 cols 1072 entries
Finished phase 1 with 135 SingleSign rule and 42 generalized
[2026-05-24 08:35:57] [INFO ] Computed 32 invariants in 1 ms
Computed 32 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11975886163359686104.kers
Total runtime 2 ms.
[2026-05-24 08:35:57] [INFO ] Implicit Places using invariants in 293 ms returned []
[2026-05-24 08:35:57] [INFO ] Invariant cache hit.
[2026-05-24 08:35:57] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-24 08:35:59] [INFO ] Implicit Places using invariants and state equation in 2039 ms returned []
Implicit Place search using SMT with State Equation took 2341 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 209/225 places, 214/219 transitions.
Finished structural reductions in REACHABILITY mode , in 6 iterations and 4416 ms. Remains : 209/225 places, 214/219 transitions.
RANDOM walk for 40000 steps (5788 resets) in 86 ms. (459 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3659 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 769974 steps, run timeout after 3001 ms. (steps per millisecond=256 ) properties seen :0 out of 1
Probabilistic random walk after 769974 steps, saw 385073 distinct states, run finished after 3001 ms. (steps per millisecond=256 ) properties seen :0
[2026-05-24 08:36:02] [INFO ] Invariant cache hit.
[2026-05-24 08:36:02] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 39/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 138/178 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 26/204 variables, 13/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 214/418 variables, 204/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/418 variables, 38/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/418 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/423 variables, 5/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/423 variables, 2/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/423 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/423 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 283 constraints, problems are : Problem set: 0 solved, 1 unsolved in 677 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 209/209 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 39/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 138/178 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 26/204 variables, 13/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/204 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 214/418 variables, 204/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/418 variables, 38/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/418 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/418 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 5/423 variables, 5/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/423 variables, 2/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/423 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/423 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 423/423 variables, and 287 constraints, problems are : Problem set: 0 solved, 1 unsolved in 557 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 209/209 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1249ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 28 ms.
Support contains 1 out of 209 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 214/214 transitions.
Applied a total of 0 rules in 4 ms. Remains 209 /209 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 209/209 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 209 /209 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2026-05-24 08:36:03] [INFO ] Invariant cache hit.
[2026-05-24 08:36:04] [INFO ] Implicit Places using invariants in 296 ms returned []
[2026-05-24 08:36:04] [INFO ] Invariant cache hit.
[2026-05-24 08:36:04] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-24 08:36:06] [INFO ] Implicit Places using invariants and state equation in 2043 ms returned []
Implicit Place search using SMT with State Equation took 2351 ms to find 0 implicit places.
[2026-05-24 08:36:06] [INFO ] Redundant transitions in 1 ms returned []
Running 213 sub problems to find dead transitions.
[2026-05-24 08:36:06] [INFO ] Invariant cache hit.
[2026-05-24 08:36:06] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 27/29 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (OVERLAPS) 1/209 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 214/423 variables, 209/241 constraints. Problems are: Problem set: 0 solved, 213 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/423 variables, 38/279 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/423 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (OVERLAPS) 0/423 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 279 constraints, problems are : Problem set: 0 solved, 213 unsolved in 15034 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 209/209 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 27/29 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (OVERLAPS) 1/209 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 214/423 variables, 209/241 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/423 variables, 38/279 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/423 variables, 213/492 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/423 variables, 20/512 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 423/423 variables, and 512 constraints, problems are : Problem set: 0 solved, 213 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 209/209 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45096ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 45097ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47457 ms. Remains : 209/209 places, 214/214 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 209 transition count 196
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 191 transition count 196
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 183 transition count 188
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 183 transition count 188
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 182 transition count 187
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 182 transition count 185
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 180 transition count 185
Applied a total of 58 rules in 11 ms. Remains 180 /209 variables (removed 29) and now considering 185/214 (removed 29) transitions.
Running SMT prover for 1 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18315275346764334426.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14360406612679968031.kers'
[2026-05-24 08:36:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18315275346764334426.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14360406612679968031.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 185 rows 178 cols 990 entries
Finished phase 1 with 102 SingleSign rule and 46 generalized
[2026-05-24 08:36:51] [INFO ] Computed 32 invariants in 1 ms
Computed 32 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14360406612679968031.kers
Total runtime 2 ms.
[2026-05-24 08:36:51] [INFO ] [Real]Absence check using 3 positive place invariants in 25 ms returned sat
[2026-05-24 08:36:51] [INFO ] [Real]Absence check using 3 positive and 29 generalized place invariants in 22 ms returned sat
[2026-05-24 08:36:51] [INFO ] After 64ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2026-05-24 08:36:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 08:36:51] [INFO ] After 6ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
TRAPS : Iteration 1
[2026-05-24 08:36:51] [INFO ] After 115ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-24 08:36:51] [INFO ] After 361ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-24 08:36:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2026-05-24 08:36:51] [INFO ] [Nat]Absence check using 3 positive and 29 generalized place invariants in 7 ms returned sat
[2026-05-24 08:36:51] [INFO ] After 58ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-24 08:36:51] [INFO ] After 6ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 08:36:52] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 466 ms
TRAPS : Iteration 1
[2026-05-24 08:36:52] [INFO ] After 494ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 08:36:52] [INFO ] After 615ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 994 ms.
RANDOM walk for 40000 steps (5772 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3681 resets) in 57 ms. (689 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 739177 steps, run timeout after 3001 ms. (steps per millisecond=246 ) properties seen :0 out of 1
Probabilistic random walk after 739177 steps, saw 369672 distinct states, run finished after 3001 ms. (steps per millisecond=246 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4050220539825314234.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17008897219308827109.kers'
[2026-05-24 08:36:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4050220539825314234.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17008897219308827109.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 246 rows 250 cols 1004 entries
Finished phase 1 with 153 SingleSign rule and 56 generalized
[2026-05-24 08:36:55] [INFO ] Computed 43 invariants in 1 ms
Computed 43 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-17008897219308827109.kers
Total runtime 2 ms.
[2026-05-24 08:36:55] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 161/162 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 54/216 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/218 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 236/454 variables, 218/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/454 variables, 24/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/454 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 37/491 variables, 28/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/491 variables, 2/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/491 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/491 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/493 variables, 2/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/493 variables, 2/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/493 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 5/498 variables, 4/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/498 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/498 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/498 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 498/498 variables, and 322 constraints, problems are : Problem set: 0 solved, 1 unsolved in 479 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 252/252 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 161/162 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 54/216 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/218 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 236/454 variables, 218/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/454 variables, 24/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/454 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/454 variables, 6/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/454 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 37/491 variables, 28/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/491 variables, 2/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/491 variables, 1/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/491 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/493 variables, 2/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/493 variables, 2/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/493 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 5/498 variables, 4/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/498 variables, 1/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/498 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/498 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 498/498 variables, and 329 constraints, problems are : Problem set: 0 solved, 1 unsolved in 594 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 252/252 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 1096ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 31 ms.
Support contains 1 out of 252 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 246/246 transitions.
Graph (complete) has 834 edges and 252 vertex of which 251 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 251 transition count 245
Free-agglomeration rule (complex) applied 24 times.
Iterating global reduction 1 with 24 rules applied. Total rules applied 26 place count 251 transition count 221
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 50 place count 227 transition count 221
Partial Free-agglomeration rule applied 25 times.
Drop transitions (Partial Free agglomeration) removed 25 transitions
Iterating global reduction 2 with 25 rules applied. Total rules applied 75 place count 227 transition count 221
Applied a total of 75 rules in 12 ms. Remains 227 /252 variables (removed 25) and now considering 221/246 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 227/252 places, 221/246 transitions.
RANDOM walk for 40000 steps (5752 resets) in 64 ms. (615 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (3642 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 794500 steps, run timeout after 3001 ms. (steps per millisecond=264 ) properties seen :0 out of 1
Probabilistic random walk after 794500 steps, saw 397340 distinct states, run finished after 3001 ms. (steps per millisecond=264 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14734193869378895126.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16251624472507752825.kers'
[2026-05-24 08:36:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14734193869378895126.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16251624472507752825.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 221 rows 225 cols 1159 entries
Finished phase 1 with 136 SingleSign rule and 48 generalized
[2026-05-24 08:36:59] [INFO ] Computed 43 invariants in 1 ms
Computed 43 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16251624472507752825.kers
Total runtime 3 ms.
[2026-05-24 08:36:59] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 166/167 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 51/218 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/222 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 18/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 221/443 variables, 222/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/443 variables, 38/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/443 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/448 variables, 5/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/448 variables, 2/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/448 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/448 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 448/448 variables, and 328 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1899 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 227/227 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 166/167 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 51/218 variables, 25/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/222 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 221/443 variables, 222/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/443 variables, 38/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/443 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/443 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 5/448 variables, 5/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/448 variables, 2/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/448 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/448 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 448/448 variables, and 330 constraints, problems are : Problem set: 0 solved, 1 unsolved in 473 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 227/227 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2396ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 47 ms.
Support contains 1 out of 227 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 221/221 transitions.
Applied a total of 0 rules in 4 ms. Remains 227 /227 variables (removed 0) and now considering 221/221 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 227/227 places, 221/221 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 221/221 transitions.
Applied a total of 0 rules in 4 ms. Remains 227 /227 variables (removed 0) and now considering 221/221 (removed 0) transitions.
[2026-05-24 08:37:01] [INFO ] Invariant cache hit.
[2026-05-24 08:37:02] [INFO ] Implicit Places using invariants in 473 ms returned [72, 77, 97, 103, 124, 129, 149, 154, 175, 181]
[2026-05-24 08:37:02] [INFO ] Actually due to overlaps returned [77, 72]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 478 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 225/227 places, 221/221 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 225 transition count 220
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 224 transition count 220
Applied a total of 2 rules in 51 ms. Remains 224 /225 variables (removed 1) and now considering 220/221 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14490584870392327146.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3685909290825920163.kers'
[2026-05-24 08:37:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14490584870392327146.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3685909290825920163.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 220 rows 222 cols 1130 entries
Finished phase 1 with 136 SingleSign rule and 47 generalized
[2026-05-24 08:37:02] [INFO ] Computed 41 invariants in 1 ms
Computed 41 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3685909290825920163.kers
Total runtime 2 ms.
[2026-05-24 08:37:02] [INFO ] Implicit Places using invariants in 481 ms returned [94, 100, 121, 126, 146, 151, 172, 178]
[2026-05-24 08:37:02] [INFO ] Actually due to overlaps returned [100, 94]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 483 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 222/227 places, 220/221 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 222 transition count 219
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 221 transition count 219
Applied a total of 2 rules in 11 ms. Remains 221 /222 variables (removed 1) and now considering 219/220 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12150980005768423087.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9589609319294924767.kers'
[2026-05-24 08:37:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12150980005768423087.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9589609319294924767.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 219 rows 219 cols 1106 entries
Finished phase 1 with 136 SingleSign rule and 46 generalized
[2026-05-24 08:37:02] [INFO ] Computed 39 invariants in 2 ms
Computed 39 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9589609319294924767.kers
Total runtime 2 ms.
[2026-05-24 08:37:03] [INFO ] Implicit Places using invariants in 368 ms returned [118, 123, 143, 148, 169, 175]
[2026-05-24 08:37:03] [INFO ] Actually due to overlaps returned [123, 118]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 378 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 219/227 places, 219/221 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 219 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 218 transition count 218
Applied a total of 2 rules in 8 ms. Remains 218 /219 variables (removed 1) and now considering 218/219 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12663445564112765295.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9306274733413907112.kers'
[2026-05-24 08:37:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12663445564112765295.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9306274733413907112.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 218 rows 216 cols 1087 entries
Finished phase 1 with 136 SingleSign rule and 45 generalized
[2026-05-24 08:37:03] [INFO ] Computed 37 invariants in 1 ms
Computed 37 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9306274733413907112.kers
Total runtime 2 ms.
[2026-05-24 08:37:03] [INFO ] Implicit Places using invariants in 322 ms returned [140, 145, 166, 172]
[2026-05-24 08:37:03] [INFO ] Actually due to overlaps returned [145, 140]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 323 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 216/227 places, 218/221 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 216 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 215 transition count 217
Applied a total of 2 rules in 31 ms. Remains 215 /216 variables (removed 1) and now considering 217/218 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15009699468307910432.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8542280853731528290.kers'
[2026-05-24 08:37:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15009699468307910432.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8542280853731528290.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 217 rows 213 cols 1073 entries
Finished phase 1 with 136 SingleSign rule and 44 generalized
[2026-05-24 08:37:03] [INFO ] Computed 35 invariants in 1 ms
Computed 35 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-8542280853731528290.kers
Total runtime 4 ms.
[2026-05-24 08:37:03] [INFO ] Implicit Places using invariants in 331 ms returned [163, 169]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 333 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 213/227 places, 217/221 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 213 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 212 transition count 216
Applied a total of 2 rules in 6 ms. Remains 212 /213 variables (removed 1) and now considering 216/217 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11645944537531089334.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11789665396376264165.kers'
[2026-05-24 08:37:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11645944537531089334.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11789665396376264165.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 216 rows 210 cols 1064 entries
Finished phase 1 with 136 SingleSign rule and 43 generalized
[2026-05-24 08:37:03] [INFO ] Computed 33 invariants in 1 ms
Computed 33 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11789665396376264165.kers
Total runtime 2 ms.
[2026-05-24 08:37:04] [INFO ] Implicit Places using invariants in 303 ms returned []
[2026-05-24 08:37:04] [INFO ] Invariant cache hit.
[2026-05-24 08:37:04] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-24 08:37:05] [INFO ] Implicit Places using invariants and state equation in 1586 ms returned []
Implicit Place search using SMT with State Equation took 1913 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 212/227 places, 216/221 transitions.
Finished structural reductions in REACHABILITY mode , in 6 iterations and 4021 ms. Remains : 212/227 places, 216/221 transitions.
RANDOM walk for 40000 steps (5813 resets) in 87 ms. (454 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (3650 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 766821 steps, run timeout after 3006 ms. (steps per millisecond=255 ) properties seen :0 out of 1
Probabilistic random walk after 766821 steps, saw 383493 distinct states, run finished after 3006 ms. (steps per millisecond=255 ) properties seen :0
[2026-05-24 08:37:08] [INFO ] Invariant cache hit.
[2026-05-24 08:37:08] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 148/149 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 54/203 variables, 21/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 5/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/207 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 216/423 variables, 207/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/423 variables, 38/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/423 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 5/428 variables, 5/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/428 variables, 2/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/428 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/428 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 428/428 variables, and 297 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1323 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 212/212 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 148/149 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 54/203 variables, 21/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 5/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/207 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/207 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 216/423 variables, 207/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/423 variables, 38/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/423 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/423 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 5/428 variables, 5/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/428 variables, 2/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/428 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/428 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 428/428 variables, and 301 constraints, problems are : Problem set: 0 solved, 1 unsolved in 780 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 212/212 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2138ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 26 ms.
Support contains 1 out of 212 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 216/216 transitions.
Applied a total of 0 rules in 4 ms. Remains 212 /212 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 212/212 places, 216/216 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 216/216 transitions.
Applied a total of 0 rules in 3 ms. Remains 212 /212 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2026-05-24 08:37:11] [INFO ] Invariant cache hit.
[2026-05-24 08:37:11] [INFO ] Implicit Places using invariants in 317 ms returned []
[2026-05-24 08:37:11] [INFO ] Invariant cache hit.
[2026-05-24 08:37:11] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-24 08:37:13] [INFO ] Implicit Places using invariants and state equation in 1646 ms returned []
Implicit Place search using SMT with State Equation took 1973 ms to find 0 implicit places.
[2026-05-24 08:37:13] [INFO ] Redundant transitions in 0 ms returned []
Running 215 sub problems to find dead transitions.
[2026-05-24 08:37:13] [INFO ] Invariant cache hit.
[2026-05-24 08:37:13] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/211 variables, 28/30 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/211 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (OVERLAPS) 1/212 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (OVERLAPS) 216/428 variables, 212/245 constraints. Problems are: Problem set: 0 solved, 215 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/428 variables, 38/283 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/428 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (OVERLAPS) 0/428 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 428/428 variables, and 283 constraints, problems are : Problem set: 0 solved, 215 unsolved in 14486 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 212/212 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/211 variables, 28/30 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/211 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (OVERLAPS) 1/212 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (OVERLAPS) 216/428 variables, 212/247 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/428 variables, 38/285 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/428 variables, 215/500 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/428 variables, 20/520 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 428/428 variables, and 520 constraints, problems are : Problem set: 0 solved, 215 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 212/212 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44547ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 44548ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46530 ms. Remains : 212/212 places, 216/216 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 212 transition count 198
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 194 transition count 198
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 186 transition count 190
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 186 transition count 190
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 185 transition count 189
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 185 transition count 187
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 183 transition count 187
Applied a total of 58 rules in 32 ms. Remains 183 /212 variables (removed 29) and now considering 187/216 (removed 29) transitions.
Running SMT prover for 1 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-107574585563294428.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7775395667060886654.kers'
[2026-05-24 08:37:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-107574585563294428.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7775395667060886654.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 187 rows 181 cols 982 entries
Finished phase 1 with 103 SingleSign rule and 47 generalized
[2026-05-24 08:37:57] [INFO ] Computed 33 invariants in 1 ms
Computed 33 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7775395667060886654.kers
Total runtime 2 ms.
[2026-05-24 08:37:57] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2026-05-24 08:37:57] [INFO ] [Real]Absence check using 3 positive and 30 generalized place invariants in 8 ms returned sat
[2026-05-24 08:37:57] [INFO ] After 84ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2026-05-24 08:37:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 08:37:57] [INFO ] After 7ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
TRAPS : Iteration 1
[2026-05-24 08:37:57] [INFO ] After 112ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-24 08:37:57] [INFO ] After 240ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-24 08:37:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2026-05-24 08:37:57] [INFO ] [Nat]Absence check using 3 positive and 30 generalized place invariants in 8 ms returned sat
[2026-05-24 08:37:58] [INFO ] After 87ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-24 08:37:58] [INFO ] After 7ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 08:37:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 104 ms
TRAPS : Iteration 1
[2026-05-24 08:37:58] [INFO ] After 126ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 08:37:58] [INFO ] After 272ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 556 ms.
RANDOM walk for 40000 steps (5800 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (3746 resets) in 57 ms. (689 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 733751 steps, run timeout after 3001 ms. (steps per millisecond=244 ) properties seen :0 out of 1
Probabilistic random walk after 733751 steps, saw 366963 distinct states, run finished after 3001 ms. (steps per millisecond=244 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10719042826346865944.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-68635369941988058.kers'
[2026-05-24 08:38:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10719042826346865944.kers, --Pflows, --basisKERS=/tmp/petrispot-output-68635369941988058.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 246 rows 250 cols 1004 entries
Finished phase 1 with 153 SingleSign rule and 56 generalized
[2026-05-24 08:38:01] [INFO ] Computed 43 invariants in 2 ms
Computed 43 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-68635369941988058.kers
Total runtime 3 ms.
[2026-05-24 08:38:01] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 159/160 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 56/216 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/218 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 236/454 variables, 218/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/454 variables, 24/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/454 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 37/491 variables, 28/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/491 variables, 2/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/491 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/491 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/493 variables, 2/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/493 variables, 2/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/493 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 5/498 variables, 4/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/498 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/498 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/498 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 498/498 variables, and 321 constraints, problems are : Problem set: 0 solved, 1 unsolved in 250 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 252/252 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 159/160 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 56/216 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/218 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 236/454 variables, 218/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/454 variables, 24/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/454 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 37/491 variables, 28/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/491 variables, 2/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/491 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/491 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/491 variables, 2/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/491 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/493 variables, 2/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/493 variables, 2/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/493 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 5/498 variables, 4/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/498 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/498 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/498 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/498 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 498/498 variables, and 326 constraints, problems are : Problem set: 0 solved, 1 unsolved in 815 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 252/252 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 1105ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 22 ms.
Support contains 1 out of 252 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 246/246 transitions.
Graph (complete) has 834 edges and 252 vertex of which 251 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 251 transition count 245
Free-agglomeration rule (complex) applied 27 times.
Iterating global reduction 1 with 27 rules applied. Total rules applied 29 place count 251 transition count 218
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 56 place count 224 transition count 218
Partial Free-agglomeration rule applied 25 times.
Drop transitions (Partial Free agglomeration) removed 25 transitions
Iterating global reduction 2 with 25 rules applied. Total rules applied 81 place count 224 transition count 218
Applied a total of 81 rules in 14 ms. Remains 224 /252 variables (removed 28) and now considering 218/246 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 224/252 places, 218/246 transitions.
RANDOM walk for 40000 steps (5764 resets) in 108 ms. (366 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3727 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 778479 steps, run timeout after 3001 ms. (steps per millisecond=259 ) properties seen :0 out of 1
Probabilistic random walk after 778479 steps, saw 389324 distinct states, run finished after 3001 ms. (steps per millisecond=259 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3373966896614127127.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8828172444837704311.kers'
[2026-05-24 08:38:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3373966896614127127.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8828172444837704311.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 218 rows 222 cols 1276 entries
Finished phase 1 with 133 SingleSign rule and 48 generalized
[2026-05-24 08:38:05] [INFO ] Computed 43 invariants in 3 ms
Computed 43 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-8828172444837704311.kers
Total runtime 5 ms.
[2026-05-24 08:38:05] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 163/164 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 51/215 variables, 24/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/215 variables, 6/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/219 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 218/437 variables, 219/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/437 variables, 38/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/437 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/442 variables, 5/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/442 variables, 2/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/442 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/442 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 442/442 variables, and 320 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1703 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 224/224 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 163/164 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 51/215 variables, 24/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/215 variables, 6/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/219 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 9/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 218/437 variables, 219/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/437 variables, 38/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/437 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/437 variables, 3/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Detected timeout of ITS tools.
At refinement iteration 15 (INCLUDED_ONLY) 0/437 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 5/442 variables, 5/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/442 variables, 2/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/442 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/442 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 442/442 variables, and 333 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2312 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 224/224 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4030ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 106 ms.
Support contains 1 out of 224 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 224/224 places, 218/218 transitions.
Applied a total of 0 rules in 4 ms. Remains 224 /224 variables (removed 0) and now considering 218/218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 224/224 places, 218/218 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 224/224 places, 218/218 transitions.
Applied a total of 0 rules in 4 ms. Remains 224 /224 variables (removed 0) and now considering 218/218 (removed 0) transitions.
[2026-05-24 08:38:09] [INFO ] Invariant cache hit.
[2026-05-24 08:38:10] [INFO ] Implicit Places using invariants in 573 ms returned [43, 48, 69, 74, 94, 100, 121, 126, 146, 151, 172, 178]
[2026-05-24 08:38:10] [INFO ] Actually due to overlaps returned [48, 43]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 575 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 222/224 places, 218/218 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 222 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 221 transition count 217
Applied a total of 2 rules in 13 ms. Remains 221 /222 variables (removed 1) and now considering 217/218 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5097758286465745288.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11612989959543847604.kers'
[2026-05-24 08:38:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5097758286465745288.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11612989959543847604.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 217 rows 219 cols 1242 entries
Finished phase 1 with 133 SingleSign rule and 47 generalized
[2026-05-24 08:38:10] [INFO ] Computed 41 invariants in 2 ms
Computed 41 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11612989959543847604.kers
Total runtime 2 ms.
[2026-05-24 08:38:10] [INFO ] Implicit Places using invariants in 482 ms returned [66, 71, 91, 97, 118, 123, 143, 148, 169, 175]
[2026-05-24 08:38:10] [INFO ] Actually due to overlaps returned [71, 66]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 485 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 219/224 places, 217/218 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 219 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 218 transition count 216
Applied a total of 2 rules in 9 ms. Remains 218 /219 variables (removed 1) and now considering 216/217 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8974671538144668583.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8550564117940436864.kers'
[2026-05-24 08:38:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8974671538144668583.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8550564117940436864.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 216 rows 216 cols 1213 entries
Finished phase 1 with 133 SingleSign rule and 46 generalized
[2026-05-24 08:38:10] [INFO ] Computed 39 invariants in 1 ms
Computed 39 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8550564117940436864.kers
Total runtime 2 ms.
[2026-05-24 08:38:11] [INFO ] Implicit Places using invariants in 431 ms returned [88, 94, 115, 120, 140, 145, 166, 172]
[2026-05-24 08:38:11] [INFO ] Actually due to overlaps returned [94, 88]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 433 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 216/224 places, 216/218 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 216 transition count 215
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 215 transition count 215
Applied a total of 2 rules in 9 ms. Remains 215 /216 variables (removed 1) and now considering 215/216 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14150825716612274065.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1063638108365927444.kers'
[2026-05-24 08:38:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14150825716612274065.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1063638108365927444.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 215 rows 213 cols 1189 entries
Finished phase 1 with 133 SingleSign rule and 45 generalized
[2026-05-24 08:38:11] [INFO ] Computed 37 invariants in 2 ms
Computed 37 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1063638108365927444.kers
Total runtime 2 ms.
[2026-05-24 08:38:11] [INFO ] Implicit Places using invariants in 386 ms returned [112, 117, 137, 142, 163, 169]
[2026-05-24 08:38:11] [INFO ] Actually due to overlaps returned [117, 112]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 387 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 213/224 places, 215/218 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 213 transition count 214
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 212 transition count 214
Applied a total of 2 rules in 13 ms. Remains 212 /213 variables (removed 1) and now considering 214/215 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1121856030404118150.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9132033009371035037.kers'
[2026-05-24 08:38:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1121856030404118150.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9132033009371035037.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 214 rows 210 cols 1170 entries
Finished phase 1 with 133 SingleSign rule and 44 generalized
[2026-05-24 08:38:11] [INFO ] Computed 35 invariants in 6 ms
Computed 35 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-9132033009371035037.kers
Total runtime 8 ms.
[2026-05-24 08:38:11] [INFO ] Implicit Places using invariants in 363 ms returned [134, 139, 160, 166]
[2026-05-24 08:38:11] [INFO ] Actually due to overlaps returned [139, 134]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 364 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 210/224 places, 214/218 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 210 transition count 213
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 209 transition count 213
Applied a total of 2 rules in 10 ms. Remains 209 /210 variables (removed 1) and now considering 213/214 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9561638677698715232.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11447966321047604329.kers'
[2026-05-24 08:38:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9561638677698715232.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11447966321047604329.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 213 rows 207 cols 1156 entries
Finished phase 1 with 133 SingleSign rule and 43 generalized
[2026-05-24 08:38:11] [INFO ] Computed 33 invariants in 1 ms
Computed 33 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11447966321047604329.kers
Total runtime 2 ms.
[2026-05-24 08:38:12] [INFO ] Implicit Places using invariants in 341 ms returned [157, 163]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 342 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 207/224 places, 213/218 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 207 transition count 212
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 206 transition count 212
Applied a total of 2 rules in 9 ms. Remains 206 /207 variables (removed 1) and now considering 212/213 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7899450482749573196.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16829747264599228107.kers'
[2026-05-24 08:38:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7899450482749573196.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16829747264599228107.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 212 rows 204 cols 1147 entries
Finished phase 1 with 133 SingleSign rule and 42 generalized
[2026-05-24 08:38:12] [INFO ] Computed 31 invariants in 1 ms
Computed 31 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16829747264599228107.kers
Total runtime 2 ms.
[2026-05-24 08:38:12] [INFO ] Implicit Places using invariants in 313 ms returned []
[2026-05-24 08:38:12] [INFO ] Invariant cache hit.
[2026-05-24 08:38:12] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-24 08:38:13] [INFO ] Implicit Places using invariants and state equation in 1366 ms returned []
Implicit Place search using SMT with State Equation took 1680 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 206/224 places, 212/218 transitions.
Finished structural reductions in REACHABILITY mode , in 7 iterations and 4333 ms. Remains : 206/224 places, 212/218 transitions.
RANDOM walk for 40000 steps (5708 resets) in 58 ms. (677 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3652 resets) in 71 ms. (555 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 771594 steps, run timeout after 3001 ms. (steps per millisecond=257 ) properties seen :0 out of 1
Probabilistic random walk after 771594 steps, saw 385880 distinct states, run finished after 3001 ms. (steps per millisecond=257 ) properties seen :0
[2026-05-24 08:38:16] [INFO ] Invariant cache hit.
[2026-05-24 08:38:16] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 144/145 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 14/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 52/197 variables, 19/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/201 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 212/413 variables, 201/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/413 variables, 38/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/413 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/418 variables, 5/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/418 variables, 2/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/418 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/418 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 418/418 variables, and 292 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1032 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 206/206 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 144/145 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 14/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 52/197 variables, 19/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/201 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 212/413 variables, 201/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/413 variables, 38/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/413 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/413 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 5/418 variables, 5/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/418 variables, 2/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/418 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/418 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 418/418 variables, and 295 constraints, problems are : Problem set: 0 solved, 1 unsolved in 580 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 206/206 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1614ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 20 ms.
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 206/206 places, 212/212 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
[2026-05-24 08:38:18] [INFO ] Invariant cache hit.
[2026-05-24 08:38:18] [INFO ] Implicit Places using invariants in 316 ms returned []
[2026-05-24 08:38:18] [INFO ] Invariant cache hit.
[2026-05-24 08:38:19] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-24 08:38:20] [INFO ] Implicit Places using invariants and state equation in 1374 ms returned []
Implicit Place search using SMT with State Equation took 1700 ms to find 0 implicit places.
[2026-05-24 08:38:20] [INFO ] Redundant transitions in 1 ms returned []
Running 211 sub problems to find dead transitions.
[2026-05-24 08:38:20] [INFO ] Invariant cache hit.
[2026-05-24 08:38:20] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/205 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (OVERLAPS) 1/206 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (OVERLAPS) 212/418 variables, 206/237 constraints. Problems are: Problem set: 0 solved, 211 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/418 variables, 38/275 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/418 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 8 (OVERLAPS) 0/418 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Real declared 418/418 variables, and 275 constraints, problems are : Problem set: 0 solved, 211 unsolved in 13840 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 206/206 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 211 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/205 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (OVERLAPS) 1/206 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (OVERLAPS) 212/418 variables, 206/237 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/418 variables, 38/275 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/418 variables, 211/486 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/418 variables, 20/506 constraints. Problems are: Problem set: 0 solved, 211 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 418/418 variables, and 521 constraints, problems are : Problem set: 0 solved, 211 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 206/206 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43902ms problems are : Problem set: 0 solved, 211 unsolved
Search for dead transitions found 0 dead transitions in 43903ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45612 ms. Remains : 206/206 places, 212/212 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 206 transition count 194
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 188 transition count 194
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 179 transition count 185
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 179 transition count 185
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 178 transition count 184
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 178 transition count 182
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 176 transition count 182
Applied a total of 60 rules in 12 ms. Remains 176 /206 variables (removed 30) and now considering 182/212 (removed 30) transitions.
Running SMT prover for 1 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1676749674370531811.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1912497787715392797.kers'
[2026-05-24 08:39:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1676749674370531811.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1912497787715392797.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 182 rows 174 cols 1060 entries
Finished phase 1 with 102 SingleSign rule and 43 generalized
[2026-05-24 08:39:04] [INFO ] Computed 31 invariants in 2 ms
Computed 31 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1912497787715392797.kers
Total runtime 3 ms.
[2026-05-24 08:39:04] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2026-05-24 08:39:04] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 10 ms returned sat
[2026-05-24 08:39:04] [INFO ] After 88ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2026-05-24 08:39:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 08:39:04] [INFO ] After 15ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-24 08:39:04] [INFO ] After 164ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-24 08:39:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2026-05-24 08:39:04] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 7 ms returned sat
[2026-05-24 08:39:04] [INFO ] After 88ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-24 08:39:04] [INFO ] After 10ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 08:39:04] [INFO ] After 23ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 08:39:04] [INFO ] After 162ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 349 ms.
RANDOM walk for 40000 steps (5765 resets) in 77 ms. (512 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3654 resets) in 49 ms. (800 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 747139 steps, run timeout after 3001 ms. (steps per millisecond=248 ) properties seen :0 out of 1
Probabilistic random walk after 747139 steps, saw 373654 distinct states, run finished after 3001 ms. (steps per millisecond=248 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14935201355360210469.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4556007523543696238.kers'
[2026-05-24 08:39:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14935201355360210469.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4556007523543696238.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 246 rows 250 cols 1004 entries
Finished phase 1 with 153 SingleSign rule and 56 generalized
[2026-05-24 08:39:07] [INFO ] Computed 43 invariants in 1 ms
Computed 43 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4556007523543696238.kers
Total runtime 2 ms.
[2026-05-24 08:39:07] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 24/28 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 159/187 variables, 13/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/187 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/187 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 51/238 variables, 25/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/238 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/240 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/240 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 219/459 variables, 214/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/459 variables, 23/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/459 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 32/491 variables, 23/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/491 variables, 2/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/491 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/491 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/493 variables, 2/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/493 variables, 2/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/493 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 5/498 variables, 4/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/498 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/498 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/498 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 498/498 variables, and 322 constraints, problems are : Problem set: 0 solved, 1 unsolved in 375 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 252/252 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 24/28 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 159/187 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/187 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/187 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 51/238 variables, 25/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/238 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/238 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/240 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/240 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 219/459 variables, 214/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/459 variables, 23/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/459 variables, 1/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/459 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 32/491 variables, 23/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/491 variables, 2/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/491 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/491 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/493 variables, 2/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/493 variables, 2/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/493 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 5/498 variables, 4/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/498 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/498 variables, 2/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/498 variables, 2/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/498 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 0/498 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 498/498 variables, and 328 constraints, problems are : Problem set: 0 solved, 1 unsolved in 744 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 252/252 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 1131ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 89 ms.
Support contains 1 out of 252 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 246/246 transitions.
Graph (complete) has 834 edges and 252 vertex of which 251 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 251 transition count 245
Free-agglomeration rule (complex) applied 26 times.
Iterating global reduction 1 with 26 rules applied. Total rules applied 28 place count 251 transition count 219
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 54 place count 225 transition count 219
Partial Free-agglomeration rule applied 25 times.
Drop transitions (Partial Free agglomeration) removed 25 transitions
Iterating global reduction 2 with 25 rules applied. Total rules applied 79 place count 225 transition count 219
Applied a total of 79 rules in 11 ms. Remains 225 /252 variables (removed 27) and now considering 219/246 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 225/252 places, 219/246 transitions.
RANDOM walk for 40000 steps (5784 resets) in 84 ms. (470 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3629 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
Probably explored full state space saw : 355343 states, properties seen :0
Probabilistic random walk after 710692 steps, saw 355343 distinct states, run finished after 2733 ms. (steps per millisecond=260 ) properties seen :0
Interrupted probabilistic random walk after 796539 steps, run timeout after 3001 ms. (steps per millisecond=265 ) properties seen :0 out of 1
Exhaustive walk after 796539 steps, saw 398370 distinct states, run finished after 3001 ms. (steps per millisecond=265 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3368396926835591278.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5195087759607754257.kers'
[2026-05-24 08:39:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3368396926835591278.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5195087759607754257.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 219 rows 223 cols 1276 entries
Finished phase 1 with 134 SingleSign rule and 48 generalized
[2026-05-24 08:39:14] [INFO ] Computed 43 invariants in 3 ms
Computed 43 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-5195087759607754257.kers
Total runtime 5 ms.
[2026-05-24 08:39:14] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 125/126 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 90/216 variables, 37/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 11/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 4/220 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/220 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/220 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 219/439 variables, 220/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/439 variables, 38/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/439 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 5/444 variables, 5/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/444 variables, 2/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/444 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 444/444 variables, and 318 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1349 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 225/225 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 125/126 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 90/216 variables, 37/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 11/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 4/220 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/220 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/220 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/220 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 219/439 variables, 220/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/439 variables, 38/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/439 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/439 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 5/444 variables, 5/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 2/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/444 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/444 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 444/444 variables, and 320 constraints, problems are : Problem set: 0 solved, 1 unsolved in 430 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 225/225 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1792ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 46 ms.
Support contains 1 out of 225 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 225/225 places, 219/219 transitions.
Applied a total of 0 rules in 4 ms. Remains 225 /225 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 225/225 places, 219/219 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 225/225 places, 219/219 transitions.
Applied a total of 0 rules in 3 ms. Remains 225 /225 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2026-05-24 08:39:16] [INFO ] Invariant cache hit.
[2026-05-24 08:39:17] [INFO ] Implicit Places using invariants in 574 ms returned [43, 48, 70, 75, 95, 101, 122, 127, 147, 152, 173, 179]
[2026-05-24 08:39:17] [INFO ] Actually due to overlaps returned [48, 43]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 576 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 223/225 places, 219/219 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 223 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 222 transition count 218
Applied a total of 2 rules in 12 ms. Remains 222 /223 variables (removed 1) and now considering 218/219 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15184248839474133034.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11100876312236732228.kers'
[2026-05-24 08:39:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15184248839474133034.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11100876312236732228.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 218 rows 220 cols 1242 entries
Finished phase 1 with 134 SingleSign rule and 47 generalized
[2026-05-24 08:39:17] [INFO ] Computed 41 invariants in 2 ms
Computed 41 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11100876312236732228.kers
Total runtime 3 ms.
[2026-05-24 08:39:17] [INFO ] Implicit Places using invariants in 480 ms returned [67, 72, 92, 98, 119, 124, 144, 149, 170, 176]
[2026-05-24 08:39:17] [INFO ] Actually due to overlaps returned [72, 67]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 481 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 220/225 places, 218/219 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 220 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 219 transition count 217
Applied a total of 2 rules in 11 ms. Remains 219 /220 variables (removed 1) and now considering 217/218 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17805283053257100594.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2908463477410879056.kers'
[2026-05-24 08:39:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17805283053257100594.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2908463477410879056.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 217 rows 217 cols 1213 entries
Finished phase 1 with 134 SingleSign rule and 46 generalized
[2026-05-24 08:39:17] [INFO ] Computed 39 invariants in 1 ms
Computed 39 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2908463477410879056.kers
Total runtime 2 ms.
[2026-05-24 08:39:18] [INFO ] Implicit Places using invariants in 468 ms returned [89, 95, 116, 121, 141, 146, 167, 173]
[2026-05-24 08:39:18] [INFO ] Actually due to overlaps returned [95, 89]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 471 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 217/225 places, 217/219 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 217 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 216 transition count 216
Applied a total of 2 rules in 13 ms. Remains 216 /217 variables (removed 1) and now considering 216/217 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17391193137039943645.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9570853447359358763.kers'
[2026-05-24 08:39:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17391193137039943645.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9570853447359358763.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 216 rows 214 cols 1189 entries
Finished phase 1 with 134 SingleSign rule and 45 generalized
[2026-05-24 08:39:18] [INFO ] Computed 37 invariants in 2 ms
Computed 37 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9570853447359358763.kers
Total runtime 3 ms.
[2026-05-24 08:39:18] [INFO ] Implicit Places using invariants in 391 ms returned [113, 118, 138, 143, 164, 170]
[2026-05-24 08:39:18] [INFO ] Actually due to overlaps returned [118, 113]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 392 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 214/225 places, 216/219 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 214 transition count 215
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 213 transition count 215
Applied a total of 2 rules in 10 ms. Remains 213 /214 variables (removed 1) and now considering 215/216 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11964321349254338257.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15886971472025263287.kers'
[2026-05-24 08:39:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11964321349254338257.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15886971472025263287.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 215 rows 211 cols 1170 entries
Finished phase 1 with 134 SingleSign rule and 44 generalized
[2026-05-24 08:39:18] [INFO ] Computed 35 invariants in 3 ms
Computed 35 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-15886971472025263287.kers
Total runtime 3 ms.
[2026-05-24 08:39:18] [INFO ] Implicit Places using invariants in 367 ms returned [135, 140, 161, 167]
[2026-05-24 08:39:18] [INFO ] Actually due to overlaps returned [140, 135]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 384 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 211/225 places, 215/219 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 211 transition count 214
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 210 transition count 214
Applied a total of 2 rules in 7 ms. Remains 210 /211 variables (removed 1) and now considering 214/215 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15762566734435519514.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4804823345913625117.kers'
[2026-05-24 08:39:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15762566734435519514.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4804823345913625117.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 214 rows 208 cols 1156 entries
Finished phase 1 with 134 SingleSign rule and 43 generalized
[2026-05-24 08:39:18] [INFO ] Computed 33 invariants in 1 ms
Computed 33 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4804823345913625117.kers
Total runtime 2 ms.
[2026-05-24 08:39:19] [INFO ] Implicit Places using invariants in 316 ms returned [158, 164]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 317 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 208/225 places, 214/219 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 208 transition count 213
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 207 transition count 213
Applied a total of 2 rules in 10 ms. Remains 207 /208 variables (removed 1) and now considering 213/214 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7568146590439122396.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-591780867913893326.kers'
[2026-05-24 08:39:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7568146590439122396.kers, --Pflows, --basisKERS=/tmp/petrispot-output-591780867913893326.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 213 rows 205 cols 1147 entries
Finished phase 1 with 134 SingleSign rule and 42 generalized
[2026-05-24 08:39:19] [INFO ] Computed 31 invariants in 1 ms
Computed 31 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-591780867913893326.kers
Total runtime 2 ms.
[2026-05-24 08:39:19] [INFO ] Implicit Places using invariants in 313 ms returned []
[2026-05-24 08:39:19] [INFO ] Invariant cache hit.
[2026-05-24 08:39:19] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-24 08:39:21] [INFO ] Implicit Places using invariants and state equation in 2071 ms returned []
Implicit Place search using SMT with State Equation took 2394 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 207/225 places, 213/219 transitions.
Finished structural reductions in REACHABILITY mode , in 7 iterations and 5081 ms. Remains : 207/225 places, 213/219 transitions.
RANDOM walk for 40000 steps (5742 resets) in 80 ms. (493 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3645 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 797154 steps, run timeout after 3001 ms. (steps per millisecond=265 ) properties seen :0 out of 1
Probabilistic random walk after 797154 steps, saw 398668 distinct states, run finished after 3001 ms. (steps per millisecond=265 ) properties seen :0
[2026-05-24 08:39:24] [INFO ] Invariant cache hit.
[2026-05-24 08:39:24] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 137/138 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 60/198 variables, 24/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/202 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 213/415 variables, 202/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/415 variables, 38/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/415 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/420 variables, 5/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/420 variables, 2/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/420 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/420 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 420/420 variables, and 283 constraints, problems are : Problem set: 0 solved, 1 unsolved in 792 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 207/207 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 137/138 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 60/198 variables, 24/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/202 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/202 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 213/415 variables, 202/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/415 variables, 38/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/415 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/415 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 5/420 variables, 5/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/420 variables, 2/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/420 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/420 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 420/420 variables, and 286 constraints, problems are : Problem set: 0 solved, 1 unsolved in 418 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 207/207 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1214ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 40 ms.
Support contains 1 out of 207 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 213/213 transitions.
Applied a total of 0 rules in 3 ms. Remains 207 /207 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 207/207 places, 213/213 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 213/213 transitions.
Applied a total of 0 rules in 3 ms. Remains 207 /207 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2026-05-24 08:39:25] [INFO ] Invariant cache hit.
[2026-05-24 08:39:26] [INFO ] Implicit Places using invariants in 342 ms returned []
[2026-05-24 08:39:26] [INFO ] Invariant cache hit.
[2026-05-24 08:39:26] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-24 08:39:28] [INFO ] Implicit Places using invariants and state equation in 2091 ms returned []
Implicit Place search using SMT with State Equation took 2435 ms to find 0 implicit places.
[2026-05-24 08:39:28] [INFO ] Redundant transitions in 1 ms returned []
Running 212 sub problems to find dead transitions.
[2026-05-24 08:39:28] [INFO ] Invariant cache hit.
[2026-05-24 08:39:28] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/206 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (OVERLAPS) 1/207 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (OVERLAPS) 213/420 variables, 207/238 constraints. Problems are: Problem set: 0 solved, 212 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/420 variables, 38/276 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/420 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 8 (OVERLAPS) 0/420 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Real declared 420/420 variables, and 276 constraints, problems are : Problem set: 0 solved, 212 unsolved in 14705 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 207/207 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 212 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/206 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (OVERLAPS) 1/207 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (OVERLAPS) 213/420 variables, 207/240 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/420 variables, 38/278 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/420 variables, 212/490 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/420 variables, 19/509 constraints. Problems are: Problem set: 0 solved, 212 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 420/420 variables, and 510 constraints, problems are : Problem set: 0 solved, 212 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 207/207 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44760ms problems are : Problem set: 0 solved, 212 unsolved
Search for dead transitions found 0 dead transitions in 44761ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47205 ms. Remains : 207/207 places, 213/213 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 207 transition count 195
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 189 transition count 195
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 180 transition count 186
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 180 transition count 186
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 179 transition count 185
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 179 transition count 183
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 177 transition count 183
Applied a total of 60 rules in 12 ms. Remains 177 /207 variables (removed 30) and now considering 183/213 (removed 30) transitions.
Running SMT prover for 1 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4803212792949033367.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1539302032303098361.kers'
[2026-05-24 08:40:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4803212792949033367.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1539302032303098361.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 183 rows 175 cols 1060 entries
Finished phase 1 with 103 SingleSign rule and 43 generalized
[2026-05-24 08:40:13] [INFO ] Computed 31 invariants in 4 ms
Computed 31 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-1539302032303098361.kers
Total runtime 5 ms.
[2026-05-24 08:40:13] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2026-05-24 08:40:13] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 8 ms returned sat
[2026-05-24 08:40:13] [INFO ] After 75ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2026-05-24 08:40:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 08:40:13] [INFO ] After 13ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
TRAPS : Iteration 1
[2026-05-24 08:40:13] [INFO ] After 104ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-24 08:40:13] [INFO ] After 229ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-24 08:40:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2026-05-24 08:40:13] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 7 ms returned sat
[2026-05-24 08:40:13] [INFO ] After 73ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-24 08:40:13] [INFO ] After 8ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 08:40:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
TRAPS : Iteration 1
[2026-05-24 08:40:13] [INFO ] After 108ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 08:40:13] [INFO ] After 243ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 500 ms.
RANDOM walk for 40000 steps (5686 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3608 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 762039 steps, run timeout after 3001 ms. (steps per millisecond=253 ) properties seen :0 out of 1
Probabilistic random walk after 762039 steps, saw 381102 distinct states, run finished after 3001 ms. (steps per millisecond=253 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9025753110052554687.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13343658279301155961.kers'
[2026-05-24 08:40:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9025753110052554687.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13343658279301155961.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 246 rows 250 cols 1004 entries
Finished phase 1 with 153 SingleSign rule and 56 generalized
[2026-05-24 08:40:16] [INFO ] Computed 43 invariants in 2 ms
Computed 43 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-13343658279301155961.kers
Total runtime 3 ms.
[2026-05-24 08:40:16] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 156/157 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 59/216 variables, 30/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/218 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 236/454 variables, 218/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/454 variables, 24/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/454 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 37/491 variables, 28/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/491 variables, 2/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/491 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/491 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/493 variables, 2/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/493 variables, 2/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/493 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 5/498 variables, 4/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/498 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/498 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/498 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 498/498 variables, and 322 constraints, problems are : Problem set: 0 solved, 1 unsolved in 367 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 252/252 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 156/157 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 59/216 variables, 30/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/218 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 236/454 variables, 218/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/454 variables, 24/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/454 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 37/491 variables, 28/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/491 variables, 2/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/491 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/491 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/491 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/491 variables, 1/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/491 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/493 variables, 2/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/493 variables, 2/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/493 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 5/498 variables, 4/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/498 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/498 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/498 variables, 4/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/498 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/498 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 498/498 variables, and 330 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1498 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 252/252 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 1881ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 135 ms.
Support contains 1 out of 252 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 246/246 transitions.
Graph (complete) has 834 edges and 252 vertex of which 251 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 251 transition count 245
Free-agglomeration rule (complex) applied 27 times.
Iterating global reduction 1 with 27 rules applied. Total rules applied 29 place count 251 transition count 218
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 56 place count 224 transition count 218
Partial Free-agglomeration rule applied 25 times.
Drop transitions (Partial Free agglomeration) removed 25 transitions
Iterating global reduction 2 with 25 rules applied. Total rules applied 81 place count 224 transition count 218
Applied a total of 81 rules in 12 ms. Remains 224 /252 variables (removed 28) and now considering 218/246 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 224/252 places, 218/246 transitions.
RANDOM walk for 40000 steps (5745 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3669 resets) in 67 ms. (588 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 799110 steps, run timeout after 3001 ms. (steps per millisecond=266 ) properties seen :0 out of 1
Probabilistic random walk after 799110 steps, saw 399647 distinct states, run finished after 3001 ms. (steps per millisecond=266 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11898322835096810893.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2165181842349152040.kers'
[2026-05-24 08:40:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11898322835096810893.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2165181842349152040.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 218 rows 222 cols 1276 entries
Finished phase 1 with 133 SingleSign rule and 48 generalized
[2026-05-24 08:40:21] [INFO ] Computed 43 invariants in 1 ms
Computed 43 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2165181842349152040.kers
Total runtime 2 ms.
[2026-05-24 08:40:21] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 128/129 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 82/211 variables, 26/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/211 variables, 10/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/219 variables, 4/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 218/437 variables, 219/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/437 variables, 38/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/437 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 5/442 variables, 5/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/442 variables, 2/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/442 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/442 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 442/442 variables, and 316 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1519 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 224/224 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 128/129 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 82/211 variables, 26/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/211 variables, 10/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/219 variables, 4/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 218/437 variables, 219/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/437 variables, 38/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/437 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/437 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 5/442 variables, 5/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/442 variables, 2/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/442 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/442 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 442/442 variables, and 325 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1211 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 224/224 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2740ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 49 ms.
Support contains 1 out of 224 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 224/224 places, 218/218 transitions.
Applied a total of 0 rules in 4 ms. Remains 224 /224 variables (removed 0) and now considering 218/218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 224/224 places, 218/218 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 224/224 places, 218/218 transitions.
Applied a total of 0 rules in 3 ms. Remains 224 /224 variables (removed 0) and now considering 218/218 (removed 0) transitions.
[2026-05-24 08:40:24] [INFO ] Invariant cache hit.
[2026-05-24 08:40:25] [INFO ] Implicit Places using invariants in 601 ms returned [43, 48, 69, 74, 94, 100, 121, 126, 146, 151, 172, 178]
[2026-05-24 08:40:25] [INFO ] Actually due to overlaps returned [48, 43]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 604 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 222/224 places, 218/218 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 222 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 221 transition count 217
Applied a total of 2 rules in 9 ms. Remains 221 /222 variables (removed 1) and now considering 217/218 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15542236474899406492.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1267139688065627002.kers'
[2026-05-24 08:40:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15542236474899406492.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1267139688065627002.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 217 rows 219 cols 1242 entries
Finished phase 1 with 133 SingleSign rule and 47 generalized
[2026-05-24 08:40:25] [INFO ] Computed 41 invariants in 4 ms
Computed 41 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-1267139688065627002.kers
Total runtime 5 ms.
[2026-05-24 08:40:25] [INFO ] Implicit Places using invariants in 490 ms returned [66, 71, 91, 97, 118, 123, 143, 148, 169, 175]
[2026-05-24 08:40:25] [INFO ] Actually due to overlaps returned [71, 66]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 491 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 219/224 places, 217/218 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 219 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 218 transition count 216
Applied a total of 2 rules in 9 ms. Remains 218 /219 variables (removed 1) and now considering 216/217 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17510426514381181649.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1035856946765664761.kers'
[2026-05-24 08:40:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17510426514381181649.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1035856946765664761.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 216 rows 216 cols 1213 entries
Finished phase 1 with 133 SingleSign rule and 46 generalized
[2026-05-24 08:40:25] [INFO ] Computed 39 invariants in 1 ms
Computed 39 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1035856946765664761.kers
Total runtime 2 ms.
[2026-05-24 08:40:26] [INFO ] Implicit Places using invariants in 433 ms returned [88, 94, 115, 120, 140, 145, 166, 172]
[2026-05-24 08:40:26] [INFO ] Actually due to overlaps returned [94, 88]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 434 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 216/224 places, 216/218 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 216 transition count 215
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 215 transition count 215
Applied a total of 2 rules in 11 ms. Remains 215 /216 variables (removed 1) and now considering 215/216 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4152003733262343876.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14630321518917988543.kers'
[2026-05-24 08:40:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4152003733262343876.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14630321518917988543.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 215 rows 213 cols 1189 entries
Finished phase 1 with 133 SingleSign rule and 45 generalized
[2026-05-24 08:40:26] [INFO ] Computed 37 invariants in 1 ms
Computed 37 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14630321518917988543.kers
Total runtime 2 ms.
[2026-05-24 08:40:26] [INFO ] Implicit Places using invariants in 420 ms returned [112, 117, 137, 142, 163, 169]
[2026-05-24 08:40:26] [INFO ] Actually due to overlaps returned [117, 112]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 422 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 213/224 places, 215/218 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 213 transition count 214
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 212 transition count 214
Applied a total of 2 rules in 12 ms. Remains 212 /213 variables (removed 1) and now considering 214/215 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9976238333106924085.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14398057741527982681.kers'
[2026-05-24 08:40:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9976238333106924085.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14398057741527982681.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 214 rows 210 cols 1170 entries
Finished phase 1 with 133 SingleSign rule and 44 generalized
[2026-05-24 08:40:26] [INFO ] Computed 35 invariants in 2 ms
Computed 35 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14398057741527982681.kers
Total runtime 3 ms.
[2026-05-24 08:40:26] [INFO ] Implicit Places using invariants in 357 ms returned [134, 139, 160, 166]
[2026-05-24 08:40:26] [INFO ] Actually due to overlaps returned [139, 134]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 361 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 210/224 places, 214/218 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 210 transition count 213
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 209 transition count 213
Applied a total of 2 rules in 8 ms. Remains 209 /210 variables (removed 1) and now considering 213/214 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9342100542368586076.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9804968366050835408.kers'
[2026-05-24 08:40:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9342100542368586076.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9804968366050835408.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 213 rows 207 cols 1156 entries
Finished phase 1 with 133 SingleSign rule and 43 generalized
[2026-05-24 08:40:26] [INFO ] Computed 33 invariants in 1 ms
Computed 33 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9804968366050835408.kers
Total runtime 2 ms.
[2026-05-24 08:40:27] [INFO ] Implicit Places using invariants in 331 ms returned [157, 163]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 342 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 207/224 places, 213/218 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 207 transition count 212
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 206 transition count 212
Applied a total of 2 rules in 7 ms. Remains 206 /207 variables (removed 1) and now considering 212/213 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7678956035955669864.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8451171351238008332.kers'
[2026-05-24 08:40:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7678956035955669864.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8451171351238008332.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 212 rows 204 cols 1147 entries
Finished phase 1 with 133 SingleSign rule and 42 generalized
[2026-05-24 08:40:27] [INFO ] Computed 31 invariants in 1 ms
Computed 31 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8451171351238008332.kers
Total runtime 2 ms.
[2026-05-24 08:40:27] [INFO ] Implicit Places using invariants in 336 ms returned []
[2026-05-24 08:40:27] [INFO ] Invariant cache hit.
[2026-05-24 08:40:27] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-24 08:40:29] [INFO ] Implicit Places using invariants and state equation in 1607 ms returned []
Implicit Place search using SMT with State Equation took 1945 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 206/224 places, 212/218 transitions.
Finished structural reductions in REACHABILITY mode , in 7 iterations and 4658 ms. Remains : 206/224 places, 212/218 transitions.
RANDOM walk for 40000 steps (5776 resets) in 68 ms. (579 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3605 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 798231 steps, run timeout after 3001 ms. (steps per millisecond=265 ) properties seen :0 out of 1
Probabilistic random walk after 798231 steps, saw 399204 distinct states, run finished after 3001 ms. (steps per millisecond=265 ) properties seen :0
[2026-05-24 08:40:32] [INFO ] Invariant cache hit.
[2026-05-24 08:40:32] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 130/131 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 64/195 variables, 21/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 11/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/201 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 212/413 variables, 201/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/413 variables, 38/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/413 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/418 variables, 5/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/418 variables, 2/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/418 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/418 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 418/418 variables, and 289 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1500 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 206/206 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 130/131 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 64/195 variables, 21/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 9/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/201 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 8/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 212/413 variables, 201/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/413 variables, 38/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/413 variables, 1/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/413 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 5/418 variables, 5/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/418 variables, 2/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/418 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/418 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 418/418 variables, and 298 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1296 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 206/206 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2798ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 46 ms.
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 8 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 206/206 places, 212/212 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
[2026-05-24 08:40:35] [INFO ] Invariant cache hit.
[2026-05-24 08:40:35] [INFO ] Implicit Places using invariants in 320 ms returned []
[2026-05-24 08:40:35] [INFO ] Invariant cache hit.
[2026-05-24 08:40:35] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-24 08:40:36] [INFO ] Implicit Places using invariants and state equation in 1575 ms returned []
Implicit Place search using SMT with State Equation took 1902 ms to find 0 implicit places.
[2026-05-24 08:40:36] [INFO ] Redundant transitions in 1 ms returned []
Running 211 sub problems to find dead transitions.
[2026-05-24 08:40:36] [INFO ] Invariant cache hit.
[2026-05-24 08:40:36] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/205 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (OVERLAPS) 1/206 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (OVERLAPS) 212/418 variables, 206/237 constraints. Problems are: Problem set: 0 solved, 211 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/418 variables, 38/275 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/418 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 8 (OVERLAPS) 0/418 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Real declared 418/418 variables, and 275 constraints, problems are : Problem set: 0 solved, 211 unsolved in 14104 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 206/206 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 211 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/205 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (OVERLAPS) 1/206 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (OVERLAPS) 212/418 variables, 206/237 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/418 variables, 38/275 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/418 variables, 211/486 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/418 variables, 20/506 constraints. Problems are: Problem set: 0 solved, 211 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 418/418 variables, and 521 constraints, problems are : Problem set: 0 solved, 211 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 206/206 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44159ms problems are : Problem set: 0 solved, 211 unsolved
Search for dead transitions found 0 dead transitions in 44159ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46070 ms. Remains : 206/206 places, 212/212 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 206 transition count 194
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 188 transition count 194
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 179 transition count 185
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 179 transition count 185
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 178 transition count 184
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 178 transition count 182
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 176 transition count 182
Applied a total of 60 rules in 12 ms. Remains 176 /206 variables (removed 30) and now considering 182/212 (removed 30) transitions.
Running SMT prover for 1 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6212677897894203848.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11457411501641838645.kers'
[2026-05-24 08:41:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6212677897894203848.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11457411501641838645.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 182 rows 174 cols 1060 entries
Finished phase 1 with 102 SingleSign rule and 43 generalized
[2026-05-24 08:41:21] [INFO ] Computed 31 invariants in 2 ms
Computed 31 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11457411501641838645.kers
Total runtime 3 ms.
[2026-05-24 08:41:21] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2026-05-24 08:41:21] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 9 ms returned sat
[2026-05-24 08:41:21] [INFO ] After 78ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2026-05-24 08:41:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 08:41:21] [INFO ] After 9ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
TRAPS : Iteration 1
[2026-05-24 08:41:21] [INFO ] After 99ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-24 08:41:21] [INFO ] After 224ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-24 08:41:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2026-05-24 08:41:21] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 8 ms returned sat
[2026-05-24 08:41:21] [INFO ] After 74ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-24 08:41:21] [INFO ] After 7ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 08:41:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 147 ms
TRAPS : Iteration 1
[2026-05-24 08:41:21] [INFO ] After 175ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 08:41:21] [INFO ] After 300ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 547 ms.
RANDOM walk for 40000 steps (5787 resets) in 58 ms. (677 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (3661 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 771706 steps, run timeout after 3001 ms. (steps per millisecond=257 ) properties seen :0 out of 1
Probabilistic random walk after 771706 steps, saw 385938 distinct states, run finished after 3001 ms. (steps per millisecond=257 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17402005081759231338.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17038152148321277154.kers'
[2026-05-24 08:41:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17402005081759231338.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17038152148321277154.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 246 rows 250 cols 1004 entries
Finished phase 1 with 153 SingleSign rule and 56 generalized
[2026-05-24 08:41:24] [INFO ] Computed 43 invariants in 2 ms
Computed 43 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-17038152148321277154.kers
Total runtime 3 ms.
[2026-05-24 08:41:24] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 156/157 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 59/216 variables, 30/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/218 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 236/454 variables, 218/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/454 variables, 24/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/454 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 37/491 variables, 28/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/491 variables, 2/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/491 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/491 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/493 variables, 2/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/493 variables, 2/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/493 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 5/498 variables, 4/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/498 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/498 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/498 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 498/498 variables, and 321 constraints, problems are : Problem set: 0 solved, 1 unsolved in 823 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 252/252 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 156/157 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 59/216 variables, 30/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/218 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 236/454 variables, 218/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/454 variables, 24/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/454 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 37/491 variables, 28/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/491 variables, 2/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/491 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/491 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/491 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/491 variables, 12/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/491 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/493 variables, 2/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/493 variables, 2/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/493 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 5/498 variables, 4/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/498 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/498 variables, 2/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/498 variables, 2/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/498 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/498 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 498/498 variables, and 340 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2275 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 252/252 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 14/14 constraints]
After SMT, in 3114ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 50 ms.
Support contains 1 out of 252 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 246/246 transitions.
Graph (complete) has 834 edges and 252 vertex of which 251 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 251 transition count 245
Free-agglomeration rule (complex) applied 27 times.
Iterating global reduction 1 with 27 rules applied. Total rules applied 29 place count 251 transition count 218
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 56 place count 224 transition count 218
Partial Free-agglomeration rule applied 24 times.
Drop transitions (Partial Free agglomeration) removed 24 transitions
Iterating global reduction 2 with 24 rules applied. Total rules applied 80 place count 224 transition count 218
Applied a total of 80 rules in 15 ms. Remains 224 /252 variables (removed 28) and now considering 218/246 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 224/252 places, 218/246 transitions.
RANDOM walk for 40000 steps (5728 resets) in 93 ms. (425 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (3690 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 797822 steps, run timeout after 3001 ms. (steps per millisecond=265 ) properties seen :0 out of 1
Probabilistic random walk after 797822 steps, saw 399004 distinct states, run finished after 3001 ms. (steps per millisecond=265 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13200394431970333448.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10733186573113637052.kers'
[2026-05-24 08:41:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13200394431970333448.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10733186573113637052.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 218 rows 222 cols 1274 entries
Finished phase 1 with 133 SingleSign rule and 48 generalized
[2026-05-24 08:41:30] [INFO ] Computed 43 invariants in 6 ms
Computed 43 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-10733186573113637052.kers
Total runtime 9 ms.
[2026-05-24 08:41:30] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 158/159 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 56/215 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/215 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 10/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/219 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 218/437 variables, 219/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/437 variables, 38/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/437 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/442 variables, 5/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/442 variables, 2/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/442 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/442 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 442/442 variables, and 336 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3548 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 224/224 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 31/31 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 158/159 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 56/215 variables, 28/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/215 variables, 22/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/219 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 20/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 20/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 16/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/219 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 218/437 variables, 219/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/437 variables, 38/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/437 variables, 1/387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/437 variables, 1/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/437 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 5/442 variables, 5/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/442 variables, 2/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/442 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/442 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 442/442 variables, and 395 constraints, problems are : Problem set: 0 solved, 1 unsolved in 8319 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 224/224 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 88/88 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 11888ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 55 ms.
Support contains 1 out of 224 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 224/224 places, 218/218 transitions.
Applied a total of 0 rules in 5 ms. Remains 224 /224 variables (removed 0) and now considering 218/218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 224/224 places, 218/218 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 224/224 places, 218/218 transitions.
Applied a total of 0 rules in 3 ms. Remains 224 /224 variables (removed 0) and now considering 218/218 (removed 0) transitions.
[2026-05-24 08:41:42] [INFO ] Invariant cache hit.
[2026-05-24 08:41:43] [INFO ] Implicit Places using invariants in 549 ms returned [43, 48, 69, 74, 94, 100, 121, 126, 146, 151, 172, 178]
[2026-05-24 08:41:43] [INFO ] Actually due to overlaps returned [48, 43]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 551 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 222/224 places, 218/218 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 222 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 221 transition count 217
Applied a total of 2 rules in 18 ms. Remains 221 /222 variables (removed 1) and now considering 217/218 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7159283491437011532.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15778379495420339430.kers'
[2026-05-24 08:41:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7159283491437011532.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15778379495420339430.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 217 rows 219 cols 1240 entries
Finished phase 1 with 133 SingleSign rule and 47 generalized
[2026-05-24 08:41:43] [INFO ] Computed 41 invariants in 2 ms
Computed 41 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15778379495420339430.kers
Total runtime 3 ms.
[2026-05-24 08:41:43] [INFO ] Implicit Places using invariants in 477 ms returned [66, 71, 91, 97, 118, 123, 143, 148, 169, 175]
[2026-05-24 08:41:43] [INFO ] Actually due to overlaps returned [71, 66]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 479 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 219/224 places, 217/218 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 219 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 218 transition count 216
Applied a total of 2 rules in 12 ms. Remains 218 /219 variables (removed 1) and now considering 216/217 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3450327565855048302.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1022102957601820885.kers'
[2026-05-24 08:41:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3450327565855048302.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1022102957601820885.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 216 rows 216 cols 1211 entries
Finished phase 1 with 133 SingleSign rule and 46 generalized
[2026-05-24 08:41:43] [INFO ] Computed 39 invariants in 2 ms
Computed 39 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1022102957601820885.kers
Total runtime 3 ms.
[2026-05-24 08:41:44] [INFO ] Implicit Places using invariants in 441 ms returned [88, 94, 115, 120, 140, 145, 166, 172]
[2026-05-24 08:41:44] [INFO ] Actually due to overlaps returned [94, 88]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 448 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 216/224 places, 216/218 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 216 transition count 215
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 215 transition count 215
Applied a total of 2 rules in 7 ms. Remains 215 /216 variables (removed 1) and now considering 215/216 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11870318699606984184.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11200339725461032212.kers'
[2026-05-24 08:41:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11870318699606984184.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11200339725461032212.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 215 rows 213 cols 1187 entries
Finished phase 1 with 132 SingleSign rule and 46 generalized
[2026-05-24 08:41:44] [INFO ] Computed 37 invariants in 1 ms
Computed 37 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11200339725461032212.kers
Total runtime 2 ms.
[2026-05-24 08:41:44] [INFO ] Implicit Places using invariants in 377 ms returned [112, 117, 137, 142, 163, 169]
[2026-05-24 08:41:44] [INFO ] Actually due to overlaps returned [117, 112]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 379 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 213/224 places, 215/218 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 213 transition count 214
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 212 transition count 214
Applied a total of 2 rules in 10 ms. Remains 212 /213 variables (removed 1) and now considering 214/215 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1180756367601459006.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5324157707695652436.kers'
[2026-05-24 08:41:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1180756367601459006.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5324157707695652436.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 214 rows 210 cols 1168 entries
Finished phase 1 with 132 SingleSign rule and 45 generalized
[2026-05-24 08:41:44] [INFO ] Computed 35 invariants in 2 ms
Computed 35 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5324157707695652436.kers
Total runtime 2 ms.
[2026-05-24 08:41:45] [INFO ] Implicit Places using invariants in 349 ms returned [134, 139, 160, 166]
[2026-05-24 08:41:45] [INFO ] Actually due to overlaps returned [139, 134]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 354 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 210/224 places, 214/218 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 210 transition count 213
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 209 transition count 213
Applied a total of 2 rules in 9 ms. Remains 209 /210 variables (removed 1) and now considering 213/214 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1021132473514631230.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11572677471812819336.kers'
[2026-05-24 08:41:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1021132473514631230.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11572677471812819336.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 213 rows 207 cols 1154 entries
Finished phase 1 with 132 SingleSign rule and 44 generalized
[2026-05-24 08:41:45] [INFO ] Computed 33 invariants in 2 ms
Computed 33 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11572677471812819336.kers
Total runtime 2 ms.
[2026-05-24 08:41:45] [INFO ] Implicit Places using invariants in 320 ms returned [157, 163]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 329 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 207/224 places, 213/218 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 207 transition count 212
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 206 transition count 212
Applied a total of 2 rules in 12 ms. Remains 206 /207 variables (removed 1) and now considering 212/213 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6727472218272811359.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3606557649218444656.kers'
[2026-05-24 08:41:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6727472218272811359.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3606557649218444656.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 212 rows 204 cols 1145 entries
Finished phase 1 with 132 SingleSign rule and 43 generalized
[2026-05-24 08:41:45] [INFO ] Computed 31 invariants in 1 ms
Computed 31 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3606557649218444656.kers
Total runtime 1 ms.
[2026-05-24 08:41:45] [INFO ] Implicit Places using invariants in 313 ms returned []
[2026-05-24 08:41:45] [INFO ] Invariant cache hit.
[2026-05-24 08:41:45] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-24 08:41:47] [INFO ] Implicit Places using invariants and state equation in 1749 ms returned []
Implicit Place search using SMT with State Equation took 2066 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 206/224 places, 212/218 transitions.
Finished structural reductions in REACHABILITY mode , in 7 iterations and 4679 ms. Remains : 206/224 places, 212/218 transitions.
RANDOM walk for 40000 steps (5809 resets) in 80 ms. (493 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (3646 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 799120 steps, run timeout after 3001 ms. (steps per millisecond=266 ) properties seen :0 out of 1
Probabilistic random walk after 799120 steps, saw 399649 distinct states, run finished after 3001 ms. (steps per millisecond=266 ) properties seen :0
[2026-05-24 08:41:50] [INFO ] Invariant cache hit.
[2026-05-24 08:41:50] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 121/179 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 14/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 22/201 variables, 11/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 17/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 212/413 variables, 201/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/413 variables, 38/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/413 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 5/418 variables, 5/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/418 variables, 2/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/418 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/418 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 418/418 variables, and 306 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3846 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 206/206 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 31/31 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 121/179 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 16/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 22/201 variables, 11/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 15/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 8/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 212/413 variables, 201/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/413 variables, 38/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/413 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/413 variables, 1/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/413 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/413 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 5/418 variables, 5/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/418 variables, 2/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/418 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/418 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 418/418 variables, and 337 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4146 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 206/206 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 7994ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 59 ms.
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 206/206 places, 212/212 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 2 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
[2026-05-24 08:41:58] [INFO ] Invariant cache hit.
[2026-05-24 08:41:58] [INFO ] Implicit Places using invariants in 329 ms returned []
[2026-05-24 08:41:58] [INFO ] Invariant cache hit.
[2026-05-24 08:41:59] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-24 08:42:00] [INFO ] Implicit Places using invariants and state equation in 1707 ms returned []
Implicit Place search using SMT with State Equation took 2037 ms to find 0 implicit places.
[2026-05-24 08:42:00] [INFO ] Redundant transitions in 2 ms returned []
Running 211 sub problems to find dead transitions.
[2026-05-24 08:42:00] [INFO ] Invariant cache hit.
[2026-05-24 08:42:00] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/205 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (OVERLAPS) 1/206 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (OVERLAPS) 212/418 variables, 206/237 constraints. Problems are: Problem set: 0 solved, 211 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/418 variables, 38/275 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/418 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 8 (OVERLAPS) 0/418 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Real declared 418/418 variables, and 275 constraints, problems are : Problem set: 0 solved, 211 unsolved in 13609 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 206/206 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 211 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/205 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (OVERLAPS) 1/206 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (OVERLAPS) 212/418 variables, 206/239 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/418 variables, 38/277 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/418 variables, 211/488 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/418 variables, 20/508 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/418 variables, 20/528 constraints. Problems are: Problem set: 0 solved, 211 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 418/418 variables, and 528 constraints, problems are : Problem set: 0 solved, 211 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 206/206 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 42/42 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43679ms problems are : Problem set: 0 solved, 211 unsolved
Search for dead transitions found 0 dead transitions in 43679ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45725 ms. Remains : 206/206 places, 212/212 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 17 Pre rules applied. Total rules applied 0 place count 206 transition count 195
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 189 transition count 195
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 43 place count 180 transition count 186
Iterating global reduction 0 with 9 rules applied. Total rules applied 52 place count 180 transition count 186
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 179 transition count 185
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 179 transition count 183
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 177 transition count 183
Applied a total of 58 rules in 12 ms. Remains 177 /206 variables (removed 29) and now considering 183/212 (removed 29) transitions.
Running SMT prover for 1 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13149952247931309352.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18156234295265286561.kers'
[2026-05-24 08:42:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13149952247931309352.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18156234295265286561.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 183 rows 175 cols 1060 entries
Finished phase 1 with 103 SingleSign rule and 43 generalized
[2026-05-24 08:42:44] [INFO ] Computed 31 invariants in 2 ms
Computed 31 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-18156234295265286561.kers
Total runtime 3 ms.
[2026-05-24 08:42:44] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2026-05-24 08:42:44] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 7 ms returned sat
[2026-05-24 08:42:44] [INFO ] After 82ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2026-05-24 08:42:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 08:42:44] [INFO ] After 7ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 08:42:44] [INFO ] After 29ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2026-05-24 08:42:44] [INFO ] After 174ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 197 ms.
RANDOM walk for 40000 steps (5767 resets) in 49 ms. (800 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3612 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 775486 steps, run timeout after 3001 ms. (steps per millisecond=258 ) properties seen :0 out of 1
Probabilistic random walk after 775486 steps, saw 387828 distinct states, run finished after 3001 ms. (steps per millisecond=258 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1799245362095032169.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13302175281753802372.kers'
[2026-05-24 08:42:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1799245362095032169.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13302175281753802372.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 246 rows 250 cols 1004 entries
Finished phase 1 with 153 SingleSign rule and 56 generalized
[2026-05-24 08:42:47] [INFO ] Computed 43 invariants in 6 ms
Computed 43 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-13302175281753802372.kers
Total runtime 8 ms.
[2026-05-24 08:42:47] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 156/157 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 59/216 variables, 30/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/218 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 236/454 variables, 218/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/454 variables, 24/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/454 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 37/491 variables, 28/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/491 variables, 2/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/491 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/491 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/493 variables, 2/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/493 variables, 2/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/493 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 5/498 variables, 4/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/498 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/498 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/498 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 498/498 variables, and 321 constraints, problems are : Problem set: 0 solved, 1 unsolved in 268 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 252/252 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 156/157 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 59/216 variables, 30/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/218 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 236/454 variables, 218/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/454 variables, 24/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/454 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/454 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 37/491 variables, 28/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/491 variables, 2/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/491 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/491 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/491 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/493 variables, 2/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/493 variables, 2/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/493 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 5/498 variables, 4/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/498 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/498 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/498 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/498 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 498/498 variables, and 324 constraints, problems are : Problem set: 0 solved, 1 unsolved in 542 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 252/252 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 827ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 79 ms.
Support contains 1 out of 252 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 246/246 transitions.
Graph (complete) has 834 edges and 252 vertex of which 251 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 251 transition count 245
Free-agglomeration rule (complex) applied 25 times.
Iterating global reduction 1 with 25 rules applied. Total rules applied 27 place count 251 transition count 220
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 52 place count 226 transition count 220
Partial Free-agglomeration rule applied 27 times.
Drop transitions (Partial Free agglomeration) removed 27 transitions
Iterating global reduction 2 with 27 rules applied. Total rules applied 79 place count 226 transition count 220
Applied a total of 79 rules in 16 ms. Remains 226 /252 variables (removed 26) and now considering 220/246 (removed 26) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 226/252 places, 220/246 transitions.
RANDOM walk for 40000 steps (5796 resets) in 83 ms. (476 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3645 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 805688 steps, run timeout after 3001 ms. (steps per millisecond=268 ) properties seen :0 out of 1
Probabilistic random walk after 805688 steps, saw 402933 distinct states, run finished after 3001 ms. (steps per millisecond=268 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9897233095392188795.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17882005231108737447.kers'
[2026-05-24 08:42:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9897233095392188795.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17882005231108737447.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 220 rows 224 cols 1280 entries
Finished phase 1 with 135 SingleSign rule and 48 generalized
[2026-05-24 08:42:51] [INFO ] Computed 43 invariants in 6 ms
Computed 43 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-17882005231108737447.kers
Total runtime 7 ms.
[2026-05-24 08:42:51] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 125/126 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 87/213 variables, 28/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 17/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/221 variables, 4/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/221 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 220/441 variables, 221/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/441 variables, 38/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/441 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 5/446 variables, 5/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/446 variables, 2/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/446 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/446 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 446/446 variables, and 327 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2463 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 226/226 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 125/126 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 87/213 variables, 28/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 18/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/221 variables, 4/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/221 variables, 13/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/221 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 220/441 variables, 221/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/441 variables, 38/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/441 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/441 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 5/446 variables, 5/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/446 variables, 2/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/446 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/446 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 446/446 variables, and 341 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2344 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 226/226 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4821ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 64 ms.
Support contains 1 out of 226 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 220/220 transitions.
Applied a total of 0 rules in 6 ms. Remains 226 /226 variables (removed 0) and now considering 220/220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 226/226 places, 220/220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 220/220 transitions.
Applied a total of 0 rules in 3 ms. Remains 226 /226 variables (removed 0) and now considering 220/220 (removed 0) transitions.
[2026-05-24 08:42:56] [INFO ] Invariant cache hit.
[2026-05-24 08:42:57] [INFO ] Implicit Places using invariants in 645 ms returned [43, 48, 70, 75, 96, 102, 123, 128, 148, 153, 174, 180]
[2026-05-24 08:42:57] [INFO ] Actually due to overlaps returned [48, 43]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 650 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 224/226 places, 220/220 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 224 transition count 219
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 223 transition count 219
Applied a total of 2 rules in 12 ms. Remains 223 /224 variables (removed 1) and now considering 219/220 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12205904490847231655.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-33910667720662846.kers'
[2026-05-24 08:42:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12205904490847231655.kers, --Pflows, --basisKERS=/tmp/petrispot-output-33910667720662846.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 219 rows 221 cols 1246 entries
Finished phase 1 with 135 SingleSign rule and 47 generalized
[2026-05-24 08:42:57] [INFO ] Computed 41 invariants in 3 ms
Computed 41 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-33910667720662846.kers
Total runtime 5 ms.
[2026-05-24 08:42:57] [INFO ] Implicit Places using invariants in 546 ms returned [67, 72, 93, 99, 120, 125, 145, 150, 171, 177]
[2026-05-24 08:42:57] [INFO ] Actually due to overlaps returned [72, 67]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 547 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 221/226 places, 219/220 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 221 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 220 transition count 218
Applied a total of 2 rules in 10 ms. Remains 220 /221 variables (removed 1) and now considering 218/219 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10156368152654851548.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5600823824602123670.kers'
[2026-05-24 08:42:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10156368152654851548.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5600823824602123670.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 218 rows 218 cols 1217 entries
Finished phase 1 with 135 SingleSign rule and 46 generalized
[2026-05-24 08:42:57] [INFO ] Computed 39 invariants in 3 ms
Computed 39 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-5600823824602123670.kers
Total runtime 5 ms.
[2026-05-24 08:42:58] [INFO ] Implicit Places using invariants in 458 ms returned [90, 96, 117, 122, 142, 147, 168, 174]
[2026-05-24 08:42:58] [INFO ] Actually due to overlaps returned [96, 90]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 460 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 218/226 places, 218/220 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 218 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 217 transition count 217
Applied a total of 2 rules in 10 ms. Remains 217 /218 variables (removed 1) and now considering 217/218 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8727069170784554251.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15491353610255578234.kers'
[2026-05-24 08:42:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8727069170784554251.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15491353610255578234.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 217 rows 215 cols 1193 entries
Finished phase 1 with 135 SingleSign rule and 45 generalized
[2026-05-24 08:42:58] [INFO ] Computed 37 invariants in 3 ms
Computed 37 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-15491353610255578234.kers
Total runtime 4 ms.
[2026-05-24 08:42:58] [INFO ] Implicit Places using invariants in 400 ms returned [114, 119, 139, 144, 165, 171]
[2026-05-24 08:42:58] [INFO ] Actually due to overlaps returned [119, 114]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 402 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 215/226 places, 217/220 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 215 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 214 transition count 216
Applied a total of 2 rules in 10 ms. Remains 214 /215 variables (removed 1) and now considering 216/217 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3457497073203833019.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4665645325791352386.kers'
[2026-05-24 08:42:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3457497073203833019.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4665645325791352386.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 216 rows 212 cols 1174 entries
Finished phase 1 with 135 SingleSign rule and 44 generalized
[2026-05-24 08:42:58] [INFO ] Computed 35 invariants in 1 ms
Computed 35 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4665645325791352386.kers
Total runtime 3 ms.
[2026-05-24 08:42:58] [INFO ] Implicit Places using invariants in 392 ms returned [136, 141, 162, 168]
[2026-05-24 08:42:58] [INFO ] Actually due to overlaps returned [141, 136]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 394 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 212/226 places, 216/220 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 212 transition count 215
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 211 transition count 215
Applied a total of 2 rules in 8 ms. Remains 211 /212 variables (removed 1) and now considering 215/216 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15298964756171527778.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14250579894761070340.kers'
[2026-05-24 08:42:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15298964756171527778.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14250579894761070340.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 215 rows 209 cols 1160 entries
Finished phase 1 with 135 SingleSign rule and 43 generalized
[2026-05-24 08:42:58] [INFO ] Computed 33 invariants in 2 ms
Computed 33 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14250579894761070340.kers
Total runtime 3 ms.
[2026-05-24 08:42:59] [INFO ] Implicit Places using invariants in 319 ms returned [159, 165]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 320 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 209/226 places, 215/220 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 209 transition count 214
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 208 transition count 214
Applied a total of 2 rules in 11 ms. Remains 208 /209 variables (removed 1) and now considering 214/215 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7443089945929287763.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1611551203605704652.kers'
[2026-05-24 08:42:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7443089945929287763.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1611551203605704652.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 214 rows 206 cols 1151 entries
Finished phase 1 with 135 SingleSign rule and 42 generalized
[2026-05-24 08:42:59] [INFO ] Computed 31 invariants in 6 ms
Computed 31 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-1611551203605704652.kers
Total runtime 8 ms.
[2026-05-24 08:42:59] [INFO ] Implicit Places using invariants in 307 ms returned []
[2026-05-24 08:42:59] [INFO ] Invariant cache hit.
[2026-05-24 08:42:59] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-24 08:43:01] [INFO ] Implicit Places using invariants and state equation in 1529 ms returned []
Implicit Place search using SMT with State Equation took 1840 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 208/226 places, 214/220 transitions.
Finished structural reductions in REACHABILITY mode , in 7 iterations and 4681 ms. Remains : 208/226 places, 214/220 transitions.
RANDOM walk for 40000 steps (5706 resets) in 72 ms. (547 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3692 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 808338 steps, run timeout after 3001 ms. (steps per millisecond=269 ) properties seen :0 out of 1
Probabilistic random walk after 808338 steps, saw 404265 distinct states, run finished after 3001 ms. (steps per millisecond=269 ) properties seen :0
[2026-05-24 08:43:04] [INFO ] Invariant cache hit.
[2026-05-24 08:43:04] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 132/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 64/197 variables, 21/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/203 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 6/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 214/417 variables, 203/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/417 variables, 38/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/417 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/422 variables, 5/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/422 variables, 2/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/422 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/422 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 422/422 variables, and 287 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1235 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 208/208 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 132/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 64/197 variables, 21/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 9/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/203 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 214/417 variables, 203/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/417 variables, 38/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/417 variables, 1/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/417 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 5/422 variables, 5/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/422 variables, 2/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/422 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/422 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 422/422 variables, and 292 constraints, problems are : Problem set: 0 solved, 1 unsolved in 683 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 208/208 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1921ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 59 ms.
Support contains 1 out of 208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 4 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 208/208 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2026-05-24 08:43:06] [INFO ] Invariant cache hit.
[2026-05-24 08:43:06] [INFO ] Implicit Places using invariants in 301 ms returned []
[2026-05-24 08:43:06] [INFO ] Invariant cache hit.
[2026-05-24 08:43:06] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-24 08:43:07] [INFO ] Implicit Places using invariants and state equation in 1493 ms returned []
Implicit Place search using SMT with State Equation took 1797 ms to find 0 implicit places.
[2026-05-24 08:43:07] [INFO ] Redundant transitions in 2 ms returned []
Running 213 sub problems to find dead transitions.
[2026-05-24 08:43:07] [INFO ] Invariant cache hit.
[2026-05-24 08:43:07] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/207 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (OVERLAPS) 1/208 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 214/422 variables, 208/239 constraints. Problems are: Problem set: 0 solved, 213 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/422 variables, 38/277 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/422 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (OVERLAPS) 0/422 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 422/422 variables, and 277 constraints, problems are : Problem set: 0 solved, 213 unsolved in 15075 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 208/208 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/207 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (OVERLAPS) 1/208 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 214/422 variables, 208/239 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/422 variables, 38/277 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/422 variables, 213/490 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 422/422 variables, and 500 constraints, problems are : Problem set: 0 solved, 213 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 208/208 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45136ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 45137ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46945 ms. Remains : 208/208 places, 214/214 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 208 transition count 196
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 190 transition count 196
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 181 transition count 187
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 181 transition count 187
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 180 transition count 186
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 180 transition count 184
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 178 transition count 184
Applied a total of 60 rules in 11 ms. Remains 178 /208 variables (removed 30) and now considering 184/214 (removed 30) transitions.
Running SMT prover for 1 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4507879803253680254.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6685712856995515860.kers'
[2026-05-24 08:43:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4507879803253680254.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6685712856995515860.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 184 rows 176 cols 1064 entries
Finished phase 1 with 104 SingleSign rule and 43 generalized
[2026-05-24 08:43:53] [INFO ] Computed 31 invariants in 6 ms
Computed 31 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-6685712856995515860.kers
Total runtime 8 ms.
[2026-05-24 08:43:53] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2026-05-24 08:43:53] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 8 ms returned sat
[2026-05-24 08:43:53] [INFO ] After 91ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2026-05-24 08:43:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 08:43:53] [INFO ] After 8ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
TRAPS : Iteration 1
[2026-05-24 08:43:53] [INFO ] After 90ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-24 08:43:53] [INFO ] After 235ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-24 08:43:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2026-05-24 08:43:53] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 7 ms returned sat
[2026-05-24 08:43:53] [INFO ] After 79ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-24 08:43:53] [INFO ] After 9ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 08:43:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
TRAPS : Iteration 1
[2026-05-24 08:43:53] [INFO ] After 105ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 08:43:53] [INFO ] After 242ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 504 ms.
RANDOM walk for 40000 steps (5683 resets) in 90 ms. (439 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3671 resets) in 70 ms. (563 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 767785 steps, run timeout after 3001 ms. (steps per millisecond=255 ) properties seen :0 out of 1
Probabilistic random walk after 767785 steps, saw 383976 distinct states, run finished after 3001 ms. (steps per millisecond=255 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9231034528386007264.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17448055560561499162.kers'
[2026-05-24 08:43:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9231034528386007264.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17448055560561499162.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 246 rows 250 cols 1004 entries
Finished phase 1 with 153 SingleSign rule and 56 generalized
[2026-05-24 08:43:56] [INFO ] Computed 43 invariants in 7 ms
Computed 43 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-17448055560561499162.kers
Total runtime 8 ms.
[2026-05-24 08:43:56] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 156/157 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 59/216 variables, 30/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/218 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 236/454 variables, 218/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/454 variables, 24/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/454 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 37/491 variables, 28/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/491 variables, 2/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/491 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/491 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/493 variables, 2/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/493 variables, 2/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/493 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 5/498 variables, 4/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/498 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/498 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/498 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 498/498 variables, and 322 constraints, problems are : Problem set: 0 solved, 1 unsolved in 351 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 252/252 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 156/157 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 59/216 variables, 30/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/218 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 236/454 variables, 218/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/454 variables, 24/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/454 variables, 2/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/454 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 37/491 variables, 28/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/491 variables, 2/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/491 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/491 variables, 1/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/491 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/491 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/493 variables, 2/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/493 variables, 2/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/493 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 5/498 variables, 4/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/498 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/498 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/498 variables, 3/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/498 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/498 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 498/498 variables, and 330 constraints, problems are : Problem set: 0 solved, 1 unsolved in 863 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 252/252 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 1231ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 69 ms.
Support contains 1 out of 252 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 246/246 transitions.
Graph (complete) has 834 edges and 252 vertex of which 251 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 251 transition count 245
Free-agglomeration rule (complex) applied 26 times.
Iterating global reduction 1 with 26 rules applied. Total rules applied 28 place count 251 transition count 219
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 54 place count 225 transition count 219
Partial Free-agglomeration rule applied 25 times.
Drop transitions (Partial Free agglomeration) removed 25 transitions
Iterating global reduction 2 with 25 rules applied. Total rules applied 79 place count 225 transition count 219
Applied a total of 79 rules in 13 ms. Remains 225 /252 variables (removed 27) and now considering 219/246 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 225/252 places, 219/246 transitions.
RANDOM walk for 40000 steps (5789 resets) in 85 ms. (465 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3615 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Probably explored full state space saw : 355343 states, properties seen :0
Probabilistic random walk after 710692 steps, saw 355343 distinct states, run finished after 2646 ms. (steps per millisecond=268 ) properties seen :0
Interrupted probabilistic random walk after 798653 steps, run timeout after 3001 ms. (steps per millisecond=266 ) properties seen :0 out of 1
Exhaustive walk after 798653 steps, saw 399426 distinct states, run finished after 3001 ms. (steps per millisecond=266 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9568272932850415227.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16363469387380317959.kers'
[2026-05-24 08:44:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9568272932850415227.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16363469387380317959.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 219 rows 223 cols 1276 entries
Finished phase 1 with 134 SingleSign rule and 48 generalized
[2026-05-24 08:44:03] [INFO ] Computed 43 invariants in 3 ms
Computed 43 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-16363469387380317959.kers
Total runtime 5 ms.
[2026-05-24 08:44:03] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 159/160 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 56/216 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/220 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/220 variables, 12/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/220 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 219/439 variables, 220/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/439 variables, 38/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/439 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/444 variables, 5/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 2/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/444 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 444/444 variables, and 322 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1806 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 225/225 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 159/160 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 56/216 variables, 28/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 10/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/220 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/220 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/220 variables, 16/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/220 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 219/439 variables, 220/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/439 variables, 38/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/439 variables, 1/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/439 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/439 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 5/444 variables, 5/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/444 variables, 2/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/444 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/444 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 444/444 variables, and 340 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1620 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 225/225 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3439ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 78 ms.
Support contains 1 out of 225 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 225/225 places, 219/219 transitions.
Applied a total of 0 rules in 4 ms. Remains 225 /225 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 225/225 places, 219/219 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 225/225 places, 219/219 transitions.
Applied a total of 0 rules in 3 ms. Remains 225 /225 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2026-05-24 08:44:07] [INFO ] Invariant cache hit.
[2026-05-24 08:44:07] [INFO ] Implicit Places using invariants in 611 ms returned [43, 48, 70, 75, 95, 101, 122, 127, 147, 152, 173, 179]
[2026-05-24 08:44:07] [INFO ] Actually due to overlaps returned [48, 43]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 613 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 223/225 places, 219/219 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 223 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 222 transition count 218
Applied a total of 2 rules in 9 ms. Remains 222 /223 variables (removed 1) and now considering 218/219 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17850062668079474402.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12144608361310663378.kers'
[2026-05-24 08:44:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17850062668079474402.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12144608361310663378.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 218 rows 220 cols 1242 entries
Finished phase 1 with 134 SingleSign rule and 47 generalized
[2026-05-24 08:44:07] [INFO ] Computed 41 invariants in 4 ms
Computed 41 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-12144608361310663378.kers
Total runtime 5 ms.
[2026-05-24 08:44:08] [INFO ] Implicit Places using invariants in 479 ms returned [67, 72, 92, 98, 119, 124, 144, 149, 170, 176]
[2026-05-24 08:44:08] [INFO ] Actually due to overlaps returned [72, 67]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 480 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 220/225 places, 218/219 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 220 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 219 transition count 217
Applied a total of 2 rules in 18 ms. Remains 219 /220 variables (removed 1) and now considering 217/218 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13427451647370708370.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9292892943150016766.kers'
[2026-05-24 08:44:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13427451647370708370.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9292892943150016766.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 217 rows 217 cols 1213 entries
Finished phase 1 with 134 SingleSign rule and 46 generalized
[2026-05-24 08:44:08] [INFO ] Computed 39 invariants in 1 ms
Computed 39 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9292892943150016766.kers
Total runtime 2 ms.
[2026-05-24 08:44:08] [INFO ] Implicit Places using invariants in 450 ms returned [89, 95, 116, 121, 141, 146, 167, 173]
[2026-05-24 08:44:08] [INFO ] Actually due to overlaps returned [95, 89]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 452 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 217/225 places, 217/219 transitions.
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 217 transition count 217
Applied a total of 2 rules in 10 ms. Remains 217 /217 variables (removed 0) and now considering 217/217 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10499697691756766937.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3745077205706450956.kers'
[2026-05-24 08:44:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10499697691756766937.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3745077205706450956.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 217 rows 215 cols 1193 entries
Finished phase 1 with 135 SingleSign rule and 45 generalized
[2026-05-24 08:44:08] [INFO ] Computed 37 invariants in 3 ms
Computed 37 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-3745077205706450956.kers
Total runtime 3 ms.
[2026-05-24 08:44:09] [INFO ] Implicit Places using invariants in 388 ms returned [114, 119, 139, 144, 165, 171]
[2026-05-24 08:44:09] [INFO ] Actually due to overlaps returned [119, 114]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 390 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 215/225 places, 217/219 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 215 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 214 transition count 216
Applied a total of 2 rules in 8 ms. Remains 214 /215 variables (removed 1) and now considering 216/217 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11760137495924849212.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9687049599956455132.kers'
[2026-05-24 08:44:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11760137495924849212.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9687049599956455132.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 216 rows 212 cols 1174 entries
Finished phase 1 with 135 SingleSign rule and 44 generalized
[2026-05-24 08:44:09] [INFO ] Computed 35 invariants in 1 ms
Computed 35 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9687049599956455132.kers
Total runtime 3 ms.
[2026-05-24 08:44:09] [INFO ] Implicit Places using invariants in 336 ms returned [136, 141, 162, 168]
[2026-05-24 08:44:09] [INFO ] Actually due to overlaps returned [141, 136]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 337 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 212/225 places, 216/219 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 212 transition count 215
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 211 transition count 215
Applied a total of 2 rules in 9 ms. Remains 211 /212 variables (removed 1) and now considering 215/216 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10553112960893637245.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17950859900673378259.kers'
[2026-05-24 08:44:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10553112960893637245.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17950859900673378259.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 215 rows 209 cols 1160 entries
Finished phase 1 with 135 SingleSign rule and 43 generalized
[2026-05-24 08:44:09] [INFO ] Computed 33 invariants in 2 ms
Computed 33 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-17950859900673378259.kers
Total runtime 3 ms.
[2026-05-24 08:44:09] [INFO ] Implicit Places using invariants in 345 ms returned [159, 165]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 349 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 209/225 places, 215/219 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 209 transition count 214
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 208 transition count 214
Applied a total of 2 rules in 8 ms. Remains 208 /209 variables (removed 1) and now considering 214/215 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-899054554188871999.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1990073862027896245.kers'
[2026-05-24 08:44:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-899054554188871999.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1990073862027896245.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 214 rows 206 cols 1151 entries
Finished phase 1 with 135 SingleSign rule and 42 generalized
[2026-05-24 08:44:09] [INFO ] Computed 31 invariants in 3 ms
Computed 31 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-1990073862027896245.kers
Total runtime 4 ms.
[2026-05-24 08:44:10] [INFO ] Implicit Places using invariants in 307 ms returned []
[2026-05-24 08:44:10] [INFO ] Invariant cache hit.
[2026-05-24 08:44:10] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-24 08:44:11] [INFO ] Implicit Places using invariants and state equation in 1589 ms returned []
Implicit Place search using SMT with State Equation took 1897 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 208/225 places, 214/219 transitions.
Finished structural reductions in REACHABILITY mode , in 7 iterations and 4584 ms. Remains : 208/225 places, 214/219 transitions.
RANDOM walk for 40000 steps (5749 resets) in 62 ms. (634 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3697 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 802745 steps, run timeout after 3001 ms. (steps per millisecond=267 ) properties seen :0 out of 1
Probabilistic random walk after 802745 steps, saw 401469 distinct states, run finished after 3001 ms. (steps per millisecond=267 ) properties seen :0
[2026-05-24 08:44:14] [INFO ] Invariant cache hit.
[2026-05-24 08:44:14] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 142/143 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 56/199 variables, 21/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 17/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/203 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 214/417 variables, 203/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/417 variables, 38/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/417 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 5/422 variables, 5/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/422 variables, 2/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/422 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/422 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 422/422 variables, and 295 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1506 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 208/208 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 142/143 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 56/199 variables, 21/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 14/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/203 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/203 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/203 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 214/417 variables, 203/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/417 variables, 38/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/417 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/417 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 5/422 variables, 5/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/422 variables, 2/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/422 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/422 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 422/422 variables, and 319 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3100 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 208/208 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 41/41 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4608ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 86 ms.
Support contains 1 out of 208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 208/208 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2026-05-24 08:44:19] [INFO ] Invariant cache hit.
[2026-05-24 08:44:19] [INFO ] Implicit Places using invariants in 310 ms returned []
[2026-05-24 08:44:19] [INFO ] Invariant cache hit.
[2026-05-24 08:44:19] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-24 08:44:21] [INFO ] Implicit Places using invariants and state equation in 1589 ms returned []
Implicit Place search using SMT with State Equation took 1916 ms to find 0 implicit places.
[2026-05-24 08:44:21] [INFO ] Redundant transitions in 1 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1923 ms. Remains : 208/208 places, 214/214 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 17 Pre rules applied. Total rules applied 0 place count 208 transition count 197
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 191 transition count 197
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 43 place count 182 transition count 188
Iterating global reduction 0 with 9 rules applied. Total rules applied 52 place count 182 transition count 188
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 181 transition count 187
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 181 transition count 185
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 179 transition count 185
Applied a total of 58 rules in 9 ms. Remains 179 /208 variables (removed 29) and now considering 185/214 (removed 29) transitions.
Running SMT prover for 1 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15108536815233750604.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7900809509344195976.kers'
[2026-05-24 08:44:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15108536815233750604.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7900809509344195976.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 185 rows 177 cols 1066 entries
Finished phase 1 with 103 SingleSign rule and 45 generalized
[2026-05-24 08:44:21] [INFO ] Computed 31 invariants in 3 ms
Computed 31 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-7900809509344195976.kers
Total runtime 3 ms.
[2026-05-24 08:44:21] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2026-05-24 08:44:21] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 8 ms returned sat
[2026-05-24 08:44:21] [INFO ] After 100ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2026-05-24 08:44:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 08:44:21] [INFO ] After 7ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
TRAPS : Iteration 1
[2026-05-24 08:44:21] [INFO ] After 94ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-24 08:44:21] [INFO ] After 245ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-24 08:44:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2026-05-24 08:44:21] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 7 ms returned sat
[2026-05-24 08:44:21] [INFO ] After 93ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-24 08:44:21] [INFO ] After 7ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 08:44:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
TRAPS : Iteration 1
[2026-05-24 08:44:21] [INFO ] After 109ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 08:44:21] [INFO ] After 255ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 518 ms.
RANDOM walk for 40000 steps (5710 resets) in 58 ms. (677 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3611 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 757888 steps, run timeout after 3001 ms. (steps per millisecond=252 ) properties seen :0 out of 1
Probabilistic random walk after 757888 steps, saw 379029 distinct states, run finished after 3001 ms. (steps per millisecond=252 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13677471931950717011.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13364197319562315635.kers'
[2026-05-24 08:44:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13677471931950717011.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13364197319562315635.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 246 rows 250 cols 1004 entries
Finished phase 1 with 153 SingleSign rule and 56 generalized
[2026-05-24 08:44:25] [INFO ] Computed 43 invariants in 1 ms
Computed 43 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-13364197319562315635.kers
Total runtime 2 ms.
[2026-05-24 08:44:25] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 156/157 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 59/216 variables, 30/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/218 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 236/454 variables, 218/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/454 variables, 24/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/454 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 37/491 variables, 28/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/491 variables, 2/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/491 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/491 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/493 variables, 2/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/493 variables, 2/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/493 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 5/498 variables, 4/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/498 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/498 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/498 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 498/498 variables, and 322 constraints, problems are : Problem set: 0 solved, 1 unsolved in 417 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 252/252 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 156/157 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 59/216 variables, 30/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/218 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 236/454 variables, 218/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/454 variables, 24/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/454 variables, 3/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/454 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 37/491 variables, 28/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/491 variables, 2/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/491 variables, 1/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/491 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/491 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/493 variables, 2/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/493 variables, 2/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/493 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 5/498 variables, 4/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/498 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/498 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/498 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 498/498 variables, and 326 constraints, problems are : Problem set: 0 solved, 1 unsolved in 423 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 252/252 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 856ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 86 ms.
Support contains 1 out of 252 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 246/246 transitions.
Graph (complete) has 834 edges and 252 vertex of which 251 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 251 transition count 245
Free-agglomeration rule (complex) applied 24 times.
Iterating global reduction 1 with 24 rules applied. Total rules applied 26 place count 251 transition count 221
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 50 place count 227 transition count 221
Partial Free-agglomeration rule applied 26 times.
Drop transitions (Partial Free agglomeration) removed 26 transitions
Iterating global reduction 2 with 26 rules applied. Total rules applied 76 place count 227 transition count 221
Applied a total of 76 rules in 11 ms. Remains 227 /252 variables (removed 25) and now considering 221/246 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 227/252 places, 221/246 transitions.
RANDOM walk for 40000 steps (5784 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (3601 resets) in 69 ms. (571 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 803175 steps, run timeout after 3001 ms. (steps per millisecond=267 ) properties seen :0 out of 1
Probabilistic random walk after 803175 steps, saw 401681 distinct states, run finished after 3001 ms. (steps per millisecond=267 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17658878065819374543.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4350366673681038300.kers'
[2026-05-24 08:44:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17658878065819374543.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4350366673681038300.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 221 rows 225 cols 1129 entries
Finished phase 1 with 136 SingleSign rule and 48 generalized
[2026-05-24 08:44:29] [INFO ] Computed 43 invariants in 1 ms
Computed 43 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4350366673681038300.kers
Total runtime 3 ms.
[2026-05-24 08:44:29] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 160/161 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 57/218 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/222 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 221/443 variables, 222/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/443 variables, 38/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/443 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 5/448 variables, 5/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/448 variables, 2/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/448 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/448 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 448/448 variables, and 332 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1847 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 227/227 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 160/161 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 57/218 variables, 28/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 16/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/222 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 221/443 variables, 222/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/443 variables, 38/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/443 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/443 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 5/448 variables, 5/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/448 variables, 2/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/448 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/448 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 448/448 variables, and 334 constraints, problems are : Problem set: 0 solved, 1 unsolved in 497 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 227/227 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2365ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 83 ms.
Support contains 1 out of 227 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 221/221 transitions.
Applied a total of 0 rules in 8 ms. Remains 227 /227 variables (removed 0) and now considering 221/221 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 227/227 places, 221/221 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 221/221 transitions.
Applied a total of 0 rules in 4 ms. Remains 227 /227 variables (removed 0) and now considering 221/221 (removed 0) transitions.
[2026-05-24 08:44:31] [INFO ] Invariant cache hit.
[2026-05-24 08:44:31] [INFO ] Implicit Places using invariants in 360 ms returned [43, 48, 69, 96, 102, 124, 129, 149, 154, 175, 181]
[2026-05-24 08:44:31] [INFO ] Actually due to overlaps returned [102, 48, 43, 96]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 362 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 223/227 places, 221/221 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 223 transition count 219
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 221 transition count 219
Applied a total of 4 rules in 9 ms. Remains 221 /223 variables (removed 2) and now considering 219/221 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5931188285793281593.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9722066221374862918.kers'
[2026-05-24 08:44:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5931188285793281593.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9722066221374862918.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 219 rows 219 cols 1093 entries
Finished phase 1 with 136 SingleSign rule and 46 generalized
[2026-05-24 08:44:31] [INFO ] Computed 39 invariants in 1 ms
Computed 39 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9722066221374862918.kers
Total runtime 2 ms.
[2026-05-24 08:44:32] [INFO ] Implicit Places using invariants in 363 ms returned [66, 118, 123, 143, 148, 169, 175]
[2026-05-24 08:44:32] [INFO ] Actually due to overlaps returned [123, 66, 118]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 364 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 218/227 places, 219/221 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 218 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 217 transition count 218
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 217 transition count 218
Applied a total of 3 rules in 14 ms. Remains 217 /218 variables (removed 1) and now considering 218/219 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6862810182121025138.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1590738298965538764.kers'
[2026-05-24 08:44:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6862810182121025138.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1590738298965538764.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 218 rows 215 cols 1071 entries
Finished phase 1 with 137 SingleSign rule and 44 generalized
[2026-05-24 08:44:32] [INFO ] Computed 36 invariants in 3 ms
Computed 36 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-1590738298965538764.kers
Total runtime 3 ms.
[2026-05-24 08:44:32] [INFO ] Implicit Places using invariants in 331 ms returned [139, 144, 165, 171]
[2026-05-24 08:44:32] [INFO ] Actually due to overlaps returned [144, 139]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 345 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 215/227 places, 218/221 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 215 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 214 transition count 217
Applied a total of 2 rules in 16 ms. Remains 214 /215 variables (removed 1) and now considering 217/218 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17687939385329448107.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8997208478253495685.kers'
[2026-05-24 08:44:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17687939385329448107.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8997208478253495685.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 217 rows 212 cols 1057 entries
Finished phase 1 with 137 SingleSign rule and 43 generalized
[2026-05-24 08:44:32] [INFO ] Computed 34 invariants in 2 ms
Computed 34 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-8997208478253495685.kers
Total runtime 3 ms.
[2026-05-24 08:44:32] [INFO ] Implicit Places using invariants in 278 ms returned [162, 168]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 289 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 212/227 places, 217/221 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 212 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 211 transition count 216
Applied a total of 2 rules in 11 ms. Remains 211 /212 variables (removed 1) and now considering 216/217 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1950580407232125981.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6562087792635198572.kers'
[2026-05-24 08:44:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1950580407232125981.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6562087792635198572.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 216 rows 209 cols 1048 entries
Finished phase 1 with 137 SingleSign rule and 42 generalized
[2026-05-24 08:44:32] [INFO ] Computed 32 invariants in 2 ms
Computed 32 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6562087792635198572.kers
Total runtime 2 ms.
[2026-05-24 08:44:33] [INFO ] Implicit Places using invariants in 285 ms returned []
[2026-05-24 08:44:33] [INFO ] Invariant cache hit.
[2026-05-24 08:44:33] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-24 08:44:34] [INFO ] Implicit Places using invariants and state equation in 1810 ms returned []
Implicit Place search using SMT with State Equation took 2104 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 211/227 places, 216/221 transitions.
Finished structural reductions in REACHABILITY mode , in 5 iterations and 3519 ms. Remains : 211/227 places, 216/221 transitions.
RANDOM walk for 40000 steps (5784 resets) in 88 ms. (449 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3617 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 798168 steps, run timeout after 3001 ms. (steps per millisecond=265 ) properties seen :0 out of 1
Probabilistic random walk after 798168 steps, saw 399170 distinct states, run finished after 3001 ms. (steps per millisecond=265 ) properties seen :0
[2026-05-24 08:44:38] [INFO ] Invariant cache hit.
[2026-05-24 08:44:38] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 144/145 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 57/202 variables, 22/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 17/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/206 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/206 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 216/422 variables, 206/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/422 variables, 38/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/422 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/427 variables, 5/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/427 variables, 2/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/427 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/427 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 427/427 variables, and 300 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1561 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 211/211 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 144/145 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 57/202 variables, 22/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 15/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/206 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/206 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/206 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 216/422 variables, 206/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/422 variables, 38/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/422 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/422 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 5/427 variables, 5/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/427 variables, 2/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/427 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/427 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 427/427 variables, and 305 constraints, problems are : Problem set: 0 solved, 1 unsolved in 645 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 211/211 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2220ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 87 ms.
Support contains 1 out of 211 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 216/216 transitions.
Applied a total of 0 rules in 3 ms. Remains 211 /211 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 211/211 places, 216/216 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 216/216 transitions.
Applied a total of 0 rules in 2 ms. Remains 211 /211 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2026-05-24 08:44:40] [INFO ] Invariant cache hit.
[2026-05-24 08:44:40] [INFO ] Implicit Places using invariants in 280 ms returned []
[2026-05-24 08:44:40] [INFO ] Invariant cache hit.
[2026-05-24 08:44:40] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-24 08:44:42] [INFO ] Implicit Places using invariants and state equation in 1824 ms returned []
Implicit Place search using SMT with State Equation took 2106 ms to find 0 implicit places.
[2026-05-24 08:44:42] [INFO ] Redundant transitions in 2 ms returned []
Running 215 sub problems to find dead transitions.
[2026-05-24 08:44:42] [INFO ] Invariant cache hit.
[2026-05-24 08:44:42] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/210 variables, 27/29 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (OVERLAPS) 1/211 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/211 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (OVERLAPS) 216/427 variables, 211/243 constraints. Problems are: Problem set: 0 solved, 215 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/427 variables, 38/281 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/427 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (OVERLAPS) 0/427 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 427/427 variables, and 281 constraints, problems are : Problem set: 0 solved, 215 unsolved in 15242 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 211/211 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/210 variables, 27/29 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (OVERLAPS) 1/211 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/211 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (OVERLAPS) 216/427 variables, 211/243 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/427 variables, 38/281 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/427 variables, 215/496 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/427 variables, 20/516 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 427/427 variables, and 516 constraints, problems are : Problem set: 0 solved, 215 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 211/211 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45307ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 45308ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47424 ms. Remains : 211/211 places, 216/216 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 211 transition count 198
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 193 transition count 198
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 185 transition count 190
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 185 transition count 190
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 184 transition count 189
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 184 transition count 187
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 182 transition count 187
Applied a total of 58 rules in 11 ms. Remains 182 /211 variables (removed 29) and now considering 187/216 (removed 29) transitions.
Running SMT prover for 1 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13503824058360940131.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7596806635854624793.kers'
[2026-05-24 08:45:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13503824058360940131.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7596806635854624793.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 187 rows 180 cols 966 entries
Finished phase 1 with 107 SingleSign rule and 43 generalized
[2026-05-24 08:45:27] [INFO ] Computed 32 invariants in 4 ms
Computed 32 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-7596806635854624793.kers
Total runtime 5 ms.
[2026-05-24 08:45:27] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2026-05-24 08:45:27] [INFO ] [Real]Absence check using 3 positive and 29 generalized place invariants in 13 ms returned sat
[2026-05-24 08:45:27] [INFO ] After 70ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2026-05-24 08:45:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 08:45:27] [INFO ] After 9ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 08:45:27] [INFO ] After 20ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2026-05-24 08:45:27] [INFO ] After 157ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 181 ms.
RANDOM walk for 40000 steps (5693 resets) in 75 ms. (526 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3652 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 753965 steps, run timeout after 3001 ms. (steps per millisecond=251 ) properties seen :0 out of 1
Probabilistic random walk after 753965 steps, saw 377067 distinct states, run finished after 3001 ms. (steps per millisecond=251 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13752060723487967216.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9339508479476845690.kers'
[2026-05-24 08:45:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13752060723487967216.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9339508479476845690.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 246 rows 250 cols 1004 entries
Finished phase 1 with 153 SingleSign rule and 56 generalized
[2026-05-24 08:45:31] [INFO ] Computed 43 invariants in 2 ms
Computed 43 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9339508479476845690.kers
Total runtime 3 ms.
[2026-05-24 08:45:31] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 156/160 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 56/216 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/216 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/218 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/218 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 236/454 variables, 218/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/454 variables, 24/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/454 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 37/491 variables, 28/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/491 variables, 2/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/491 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/491 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/493 variables, 2/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/493 variables, 2/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/493 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 5/498 variables, 4/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/498 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/498 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/498 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 498/498 variables, and 322 constraints, problems are : Problem set: 0 solved, 1 unsolved in 278 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 252/252 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 156/160 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 56/216 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/216 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/218 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/218 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 236/454 variables, 218/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/454 variables, 24/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/454 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/454 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 37/491 variables, 28/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/491 variables, 2/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/491 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/491 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/491 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/493 variables, 2/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/493 variables, 2/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/493 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 5/498 variables, 4/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/498 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/498 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/498 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 498/498 variables, and 324 constraints, problems are : Problem set: 0 solved, 1 unsolved in 572 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 252/252 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 866ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 20 ms.
Support contains 1 out of 252 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 246/246 transitions.
Graph (complete) has 834 edges and 252 vertex of which 251 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 251 transition count 245
Free-agglomeration rule (complex) applied 27 times.
Iterating global reduction 1 with 27 rules applied. Total rules applied 29 place count 251 transition count 218
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 56 place count 224 transition count 218
Partial Free-agglomeration rule applied 25 times.
Drop transitions (Partial Free agglomeration) removed 25 transitions
Iterating global reduction 2 with 25 rules applied. Total rules applied 81 place count 224 transition count 218
Applied a total of 81 rules in 11 ms. Remains 224 /252 variables (removed 28) and now considering 218/246 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 224/252 places, 218/246 transitions.
RANDOM walk for 40000 steps (5734 resets) in 82 ms. (481 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (3689 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 787044 steps, run timeout after 3001 ms. (steps per millisecond=262 ) properties seen :0 out of 1
Probabilistic random walk after 787044 steps, saw 393604 distinct states, run finished after 3001 ms. (steps per millisecond=262 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8561861020832177464.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7415863566783057260.kers'
[2026-05-24 08:45:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8561861020832177464.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7415863566783057260.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 218 rows 222 cols 1276 entries
Finished phase 1 with 133 SingleSign rule and 48 generalized
[2026-05-24 08:45:34] [INFO ] Computed 43 invariants in 1 ms
Computed 43 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7415863566783057260.kers
Total runtime 2 ms.
[2026-05-24 08:45:34] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 160/164 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 17/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 51/215 variables, 24/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 18/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/215 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/219 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 218/437 variables, 219/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/437 variables, 38/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/437 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 5/442 variables, 5/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/442 variables, 2/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/442 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/442 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 442/442 variables, and 341 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3197 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 224/224 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 36/36 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 160/164 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 18/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 51/215 variables, 24/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 17/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/215 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/219 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 5/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/219 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 218/437 variables, 219/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/437 variables, 38/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/437 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/437 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 5/442 variables, 5/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/442 variables, 2/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/442 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/442 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 442/442 variables, and 347 constraints, problems are : Problem set: 0 solved, 1 unsolved in 968 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 224/224 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 41/41 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4179ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 19 ms.
Support contains 1 out of 224 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 224/224 places, 218/218 transitions.
Applied a total of 0 rules in 3 ms. Remains 224 /224 variables (removed 0) and now considering 218/218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 224/224 places, 218/218 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 224/224 places, 218/218 transitions.
Applied a total of 0 rules in 3 ms. Remains 224 /224 variables (removed 0) and now considering 218/218 (removed 0) transitions.
[2026-05-24 08:45:39] [INFO ] Invariant cache hit.
[2026-05-24 08:45:39] [INFO ] Implicit Places using invariants in 570 ms returned [43, 48, 69, 74, 94, 100, 121, 126, 146, 151, 172, 178]
[2026-05-24 08:45:39] [INFO ] Actually due to overlaps returned [48, 43]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 571 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 222/224 places, 218/218 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 222 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 221 transition count 217
Applied a total of 2 rules in 12 ms. Remains 221 /222 variables (removed 1) and now considering 217/218 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5992103352759477131.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-863495724115282955.kers'
[2026-05-24 08:45:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5992103352759477131.kers, --Pflows, --basisKERS=/tmp/petrispot-output-863495724115282955.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 217 rows 219 cols 1242 entries
Finished phase 1 with 133 SingleSign rule and 47 generalized
[2026-05-24 08:45:39] [INFO ] Computed 41 invariants in 2 ms
Computed 41 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-863495724115282955.kers
Total runtime 3 ms.
[2026-05-24 08:45:40] [INFO ] Implicit Places using invariants in 467 ms returned [66, 71, 91, 97, 118, 123, 143, 148, 169, 175]
[2026-05-24 08:45:40] [INFO ] Actually due to overlaps returned [71, 66]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 469 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 219/224 places, 217/218 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 219 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 218 transition count 216
Applied a total of 2 rules in 9 ms. Remains 218 /219 variables (removed 1) and now considering 216/217 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5824094076620869351.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13239494823858558643.kers'
[2026-05-24 08:45:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5824094076620869351.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13239494823858558643.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 216 rows 216 cols 1213 entries
Finished phase 1 with 133 SingleSign rule and 46 generalized
[2026-05-24 08:45:40] [INFO ] Computed 39 invariants in 2 ms
Computed 39 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-13239494823858558643.kers
Total runtime 2 ms.
[2026-05-24 08:45:40] [INFO ] Implicit Places using invariants in 441 ms returned [88, 94, 115, 120, 140, 145, 166, 172]
[2026-05-24 08:45:40] [INFO ] Actually due to overlaps returned [94, 88]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 442 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 216/224 places, 216/218 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 216 transition count 215
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 215 transition count 215
Applied a total of 2 rules in 12 ms. Remains 215 /216 variables (removed 1) and now considering 215/216 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4113741024221392190.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6457108780727612115.kers'
[2026-05-24 08:45:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4113741024221392190.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6457108780727612115.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 215 rows 213 cols 1189 entries
Finished phase 1 with 133 SingleSign rule and 45 generalized
[2026-05-24 08:45:40] [INFO ] Computed 37 invariants in 5 ms
Computed 37 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-6457108780727612115.kers
Total runtime 6 ms.
[2026-05-24 08:45:41] [INFO ] Implicit Places using invariants in 381 ms returned [112, 117, 137, 142, 163, 169]
[2026-05-24 08:45:41] [INFO ] Actually due to overlaps returned [117, 112]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 382 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 213/224 places, 215/218 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 213 transition count 214
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 212 transition count 214
Applied a total of 2 rules in 15 ms. Remains 212 /213 variables (removed 1) and now considering 214/215 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2727660174136143792.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14476541750505263519.kers'
[2026-05-24 08:45:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2727660174136143792.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14476541750505263519.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 214 rows 210 cols 1170 entries
Finished phase 1 with 133 SingleSign rule and 44 generalized
[2026-05-24 08:45:41] [INFO ] Computed 35 invariants in 1 ms
Computed 35 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14476541750505263519.kers
Total runtime 2 ms.
[2026-05-24 08:45:41] [INFO ] Implicit Places using invariants in 356 ms returned [134, 139, 160, 166]
[2026-05-24 08:45:41] [INFO ] Actually due to overlaps returned [139, 134]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 357 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 210/224 places, 214/218 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 210 transition count 213
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 209 transition count 213
Applied a total of 2 rules in 9 ms. Remains 209 /210 variables (removed 1) and now considering 213/214 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11858255680147809504.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-813611315742810664.kers'
[2026-05-24 08:45:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11858255680147809504.kers, --Pflows, --basisKERS=/tmp/petrispot-output-813611315742810664.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 213 rows 207 cols 1156 entries
Finished phase 1 with 133 SingleSign rule and 43 generalized
[2026-05-24 08:45:41] [INFO ] Computed 33 invariants in 2 ms
Computed 33 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-813611315742810664.kers
Total runtime 3 ms.
[2026-05-24 08:45:41] [INFO ] Implicit Places using invariants in 362 ms returned [157, 163]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 362 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 207/224 places, 213/218 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 207 transition count 212
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 206 transition count 212
Applied a total of 2 rules in 10 ms. Remains 206 /207 variables (removed 1) and now considering 212/213 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17688404380868579638.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18071303111793325572.kers'
[2026-05-24 08:45:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17688404380868579638.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18071303111793325572.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 212 rows 204 cols 1147 entries
Finished phase 1 with 133 SingleSign rule and 42 generalized
[2026-05-24 08:45:41] [INFO ] Computed 31 invariants in 2 ms
Computed 31 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-18071303111793325572.kers
Total runtime 3 ms.
[2026-05-24 08:45:42] [INFO ] Implicit Places using invariants in 331 ms returned []
[2026-05-24 08:45:42] [INFO ] Invariant cache hit.
[2026-05-24 08:45:42] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-24 08:45:43] [INFO ] Implicit Places using invariants and state equation in 1578 ms returned []
Implicit Place search using SMT with State Equation took 1911 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 206/224 places, 212/218 transitions.
Finished structural reductions in REACHABILITY mode , in 7 iterations and 4565 ms. Remains : 206/224 places, 212/218 transitions.
RANDOM walk for 40000 steps (5766 resets) in 77 ms. (512 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (3634 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 807864 steps, run timeout after 3001 ms. (steps per millisecond=269 ) properties seen :0 out of 1
Probabilistic random walk after 807864 steps, saw 404021 distinct states, run finished after 3001 ms. (steps per millisecond=269 ) properties seen :0
[2026-05-24 08:45:46] [INFO ] Invariant cache hit.
[2026-05-24 08:45:46] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 141/145 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 52/197 variables, 19/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/201 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 14/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/201 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 212/413 variables, 201/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/413 variables, 38/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/413 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 5/418 variables, 5/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/418 variables, 2/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/418 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/418 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 418/418 variables, and 303 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2397 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 206/206 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 141/145 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 52/197 variables, 19/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 17/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/197 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/201 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/201 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/201 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 212/413 variables, 201/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/413 variables, 38/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/413 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/413 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/413 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 5/418 variables, 5/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/418 variables, 2/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/418 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/418 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 418/418 variables, and 308 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1073 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 206/206 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3475ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 25 ms.
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 4 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 206/206 places, 212/212 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 4 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
[2026-05-24 08:45:50] [INFO ] Invariant cache hit.
[2026-05-24 08:45:50] [INFO ] Implicit Places using invariants in 322 ms returned []
[2026-05-24 08:45:50] [INFO ] Invariant cache hit.
[2026-05-24 08:45:50] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-24 08:45:52] [INFO ] Implicit Places using invariants and state equation in 1601 ms returned []
Implicit Place search using SMT with State Equation took 1926 ms to find 0 implicit places.
[2026-05-24 08:45:52] [INFO ] Redundant transitions in 1 ms returned []
Running 211 sub problems to find dead transitions.
[2026-05-24 08:45:52] [INFO ] Invariant cache hit.
[2026-05-24 08:45:52] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/205 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (OVERLAPS) 1/206 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (OVERLAPS) 212/418 variables, 206/237 constraints. Problems are: Problem set: 0 solved, 211 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/418 variables, 38/275 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/418 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 8 (OVERLAPS) 0/418 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Real declared 418/418 variables, and 275 constraints, problems are : Problem set: 0 solved, 211 unsolved in 14002 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 206/206 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 211 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/205 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (OVERLAPS) 1/206 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (OVERLAPS) 212/418 variables, 206/237 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/418 variables, 38/275 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/418 variables, 211/486 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/418 variables, 20/506 constraints. Problems are: Problem set: 0 solved, 211 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 418/418 variables, and 521 constraints, problems are : Problem set: 0 solved, 211 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 206/206 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44064ms problems are : Problem set: 0 solved, 211 unsolved
Search for dead transitions found 0 dead transitions in 44065ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46000 ms. Remains : 206/206 places, 212/212 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 206 transition count 194
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 188 transition count 194
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 179 transition count 185
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 179 transition count 185
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 178 transition count 184
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 178 transition count 182
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 176 transition count 182
Applied a total of 60 rules in 11 ms. Remains 176 /206 variables (removed 30) and now considering 182/212 (removed 30) transitions.
Running SMT prover for 1 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3732588898725337732.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3461441664604446099.kers'
[2026-05-24 08:46:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3732588898725337732.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3461441664604446099.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 182 rows 174 cols 1060 entries
Finished phase 1 with 102 SingleSign rule and 43 generalized
[2026-05-24 08:46:36] [INFO ] Computed 31 invariants in 2 ms
Computed 31 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3461441664604446099.kers
Total runtime 2 ms.
[2026-05-24 08:46:36] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2026-05-24 08:46:36] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 7 ms returned sat
[2026-05-24 08:46:36] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-24 08:46:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2026-05-24 08:46:36] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 7 ms returned sat
[2026-05-24 08:46:36] [INFO ] After 76ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-24 08:46:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 08:46:36] [INFO ] After 10ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 08:46:36] [INFO ] After 28ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 08:46:36] [INFO ] After 167ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 306 ms.
RANDOM walk for 40000 steps (5714 resets) in 67 ms. (588 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3654 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 768396 steps, run timeout after 3001 ms. (steps per millisecond=256 ) properties seen :0 out of 1
Probabilistic random walk after 768396 steps, saw 384280 distinct states, run finished after 3001 ms. (steps per millisecond=256 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18432705974572517998.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15451386632224200984.kers'
[2026-05-24 08:46:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18432705974572517998.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15451386632224200984.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 246 rows 250 cols 1004 entries
Finished phase 1 with 153 SingleSign rule and 56 generalized
[2026-05-24 08:46:39] [INFO ] Computed 43 invariants in 1 ms
Computed 43 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15451386632224200984.kers
Total runtime 3 ms.
[2026-05-24 08:46:39] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 156/157 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 59/216 variables, 30/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/218 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 236/454 variables, 218/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/454 variables, 24/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/454 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 37/491 variables, 28/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/491 variables, 2/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/491 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/491 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/493 variables, 2/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/493 variables, 2/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/493 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 5/498 variables, 4/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/498 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/498 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/498 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/498 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 498/498 variables, and 322 constraints, problems are : Problem set: 0 solved, 1 unsolved in 524 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 252/252 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 156/157 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 59/216 variables, 30/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/218 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 236/454 variables, 218/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/454 variables, 24/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/454 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/454 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 491/498 variables, and 310 constraints, problems are : Problem set: 0 solved, 1 unsolved in 708 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, Generalized P Invariants (flows): 39/41 constraints, State Equation: 246/252 constraints, ReadFeed: 24/26 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1245ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 152 ms.
Support contains 1 out of 252 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 246/246 transitions.
Graph (complete) has 834 edges and 252 vertex of which 251 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 251 transition count 245
Free-agglomeration rule (complex) applied 27 times.
Iterating global reduction 1 with 27 rules applied. Total rules applied 29 place count 251 transition count 218
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 56 place count 224 transition count 218
Partial Free-agglomeration rule applied 25 times.
Drop transitions (Partial Free agglomeration) removed 25 transitions
Iterating global reduction 2 with 25 rules applied. Total rules applied 81 place count 224 transition count 218
Applied a total of 81 rules in 10 ms. Remains 224 /252 variables (removed 28) and now considering 218/246 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 224/252 places, 218/246 transitions.
RANDOM walk for 40000 steps (5831 resets) in 74 ms. (533 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (3650 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 806531 steps, run timeout after 3001 ms. (steps per millisecond=268 ) properties seen :0 out of 1
Probabilistic random walk after 806531 steps, saw 403359 distinct states, run finished after 3001 ms. (steps per millisecond=268 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4731343898645298664.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4635373951756734779.kers'
[2026-05-24 08:46:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4731343898645298664.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4635373951756734779.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 218 rows 222 cols 1276 entries
Finished phase 1 with 133 SingleSign rule and 48 generalized
[2026-05-24 08:46:44] [INFO ] Computed 43 invariants in 6 ms
Computed 43 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-4635373951756734779.kers
Total runtime 8 ms.
[2026-05-24 08:46:44] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 160/161 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 54/215 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/215 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/219 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 218/437 variables, 219/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/437 variables, 38/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/437 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/442 variables, 5/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/442 variables, 2/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/442 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/442 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 442/442 variables, and 329 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2862 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 224/224 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 160/161 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 54/215 variables, 26/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/215 variables, 18/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 5/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/219 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 218/437 variables, 219/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/437 variables, 38/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/437 variables, 1/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/437 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 5/442 variables, 5/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/442 variables, 2/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/442 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/442 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 442/442 variables, and 336 constraints, problems are : Problem set: 0 solved, 1 unsolved in 930 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 224/224 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3807ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 45 ms.
Support contains 1 out of 224 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 224/224 places, 218/218 transitions.
Applied a total of 0 rules in 3 ms. Remains 224 /224 variables (removed 0) and now considering 218/218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 224/224 places, 218/218 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 224/224 places, 218/218 transitions.
Applied a total of 0 rules in 13 ms. Remains 224 /224 variables (removed 0) and now considering 218/218 (removed 0) transitions.
[2026-05-24 08:46:47] [INFO ] Invariant cache hit.
[2026-05-24 08:46:48] [INFO ] Implicit Places using invariants in 634 ms returned [43, 48, 69, 74, 94, 100, 121, 126, 146, 151, 172, 178]
[2026-05-24 08:46:48] [INFO ] Actually due to overlaps returned [48, 43]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 635 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 222/224 places, 218/218 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 222 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 221 transition count 217
Applied a total of 2 rules in 10 ms. Remains 221 /222 variables (removed 1) and now considering 217/218 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15986421755932314081.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4442145903887537948.kers'
[2026-05-24 08:46:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15986421755932314081.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4442145903887537948.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 217 rows 219 cols 1242 entries
Finished phase 1 with 133 SingleSign rule and 47 generalized
[2026-05-24 08:46:48] [INFO ] Computed 41 invariants in 3 ms
Computed 41 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-4442145903887537948.kers
Total runtime 4 ms.
[2026-05-24 08:46:49] [INFO ] Implicit Places using invariants in 485 ms returned [66, 71, 91, 97, 118, 123, 143, 148, 169, 175]
[2026-05-24 08:46:49] [INFO ] Actually due to overlaps returned [71, 66]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 486 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 219/224 places, 217/218 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 219 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 218 transition count 216
Applied a total of 2 rules in 12 ms. Remains 218 /219 variables (removed 1) and now considering 216/217 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13921320016194281840.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13767641902854838155.kers'
[2026-05-24 08:46:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13921320016194281840.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13767641902854838155.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 216 rows 216 cols 1213 entries
Finished phase 1 with 133 SingleSign rule and 46 generalized
[2026-05-24 08:46:49] [INFO ] Computed 39 invariants in 2 ms
Computed 39 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-13767641902854838155.kers
Total runtime 4 ms.
[2026-05-24 08:46:49] [INFO ] Implicit Places using invariants in 434 ms returned [88, 94, 115, 120, 140, 145, 166, 172]
[2026-05-24 08:46:49] [INFO ] Actually due to overlaps returned [94, 88]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 435 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 216/224 places, 216/218 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 216 transition count 215
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 215 transition count 215
Applied a total of 2 rules in 18 ms. Remains 215 /216 variables (removed 1) and now considering 215/216 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13898293313860838387.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9575874925267099198.kers'
[2026-05-24 08:46:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13898293313860838387.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9575874925267099198.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 215 rows 213 cols 1189 entries
Finished phase 1 with 133 SingleSign rule and 45 generalized
[2026-05-24 08:46:49] [INFO ] Computed 37 invariants in 3 ms
Computed 37 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-9575874925267099198.kers
Total runtime 5 ms.
[2026-05-24 08:46:49] [INFO ] Implicit Places using invariants in 395 ms returned [112, 117, 137, 142, 163, 169]
[2026-05-24 08:46:49] [INFO ] Actually due to overlaps returned [117, 112]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 398 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 213/224 places, 215/218 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 213 transition count 214
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 212 transition count 214
Applied a total of 2 rules in 12 ms. Remains 212 /213 variables (removed 1) and now considering 214/215 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16315911691637866854.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2688277471246495145.kers'
[2026-05-24 08:46:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16315911691637866854.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2688277471246495145.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 214 rows 210 cols 1170 entries
Finished phase 1 with 133 SingleSign rule and 44 generalized
[2026-05-24 08:46:49] [INFO ] Computed 35 invariants in 1 ms
Computed 35 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2688277471246495145.kers
Total runtime 2 ms.
[2026-05-24 08:46:50] [INFO ] Implicit Places using invariants in 375 ms returned [134, 139, 160, 166]
[2026-05-24 08:46:50] [INFO ] Actually due to overlaps returned [139, 134]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 377 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 210/224 places, 214/218 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 210 transition count 213
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 209 transition count 213
Applied a total of 2 rules in 10 ms. Remains 209 /210 variables (removed 1) and now considering 213/214 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17120085519802680690.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12122110686668658084.kers'
[2026-05-24 08:46:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17120085519802680690.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12122110686668658084.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 213 rows 207 cols 1156 entries
Finished phase 1 with 133 SingleSign rule and 43 generalized
[2026-05-24 08:46:50] [INFO ] Computed 33 invariants in 2 ms
Computed 33 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-12122110686668658084.kers
Total runtime 4 ms.
[2026-05-24 08:46:50] [INFO ] Implicit Places using invariants in 331 ms returned [157, 163]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 332 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 207/224 places, 213/218 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 207 transition count 212
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 206 transition count 212
Applied a total of 2 rules in 8 ms. Remains 206 /207 variables (removed 1) and now considering 212/213 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8511692349950209375.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16447491645329630339.kers'
[2026-05-24 08:46:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8511692349950209375.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16447491645329630339.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 212 rows 204 cols 1147 entries
Finished phase 1 with 133 SingleSign rule and 42 generalized
[2026-05-24 08:46:50] [INFO ] Computed 31 invariants in 4 ms
Computed 31 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-16447491645329630339.kers
Total runtime 5 ms.
[2026-05-24 08:46:50] [INFO ] Implicit Places using invariants in 300 ms returned []
[2026-05-24 08:46:50] [INFO ] Invariant cache hit.
[2026-05-24 08:46:51] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-24 08:46:52] [INFO ] Implicit Places using invariants and state equation in 1400 ms returned []
Implicit Place search using SMT with State Equation took 1702 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 206/224 places, 212/218 transitions.
Finished structural reductions in REACHABILITY mode , in 7 iterations and 4449 ms. Remains : 206/224 places, 212/218 transitions.
RANDOM walk for 40000 steps (5724 resets) in 78 ms. (506 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3639 resets) in 58 ms. (678 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 766308 steps, run timeout after 3001 ms. (steps per millisecond=255 ) properties seen :0 out of 1
Probabilistic random walk after 766308 steps, saw 383241 distinct states, run finished after 3001 ms. (steps per millisecond=255 ) properties seen :0
[2026-05-24 08:46:55] [INFO ] Invariant cache hit.
[2026-05-24 08:46:55] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 140/141 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 56/197 variables, 21/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 17/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/201 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 212/413 variables, 201/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/413 variables, 38/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/413 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/418 variables, 5/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/418 variables, 2/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/418 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/418 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 418/418 variables, and 294 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2220 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 206/206 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 140/141 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 56/197 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 10/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/201 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 19/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 212/413 variables, 201/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/413 variables, 38/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/413 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/413 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 5/418 variables, 5/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/418 variables, 2/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/418 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/418 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 418/418 variables, and 314 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2734 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 206/206 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 38/38 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4956ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 85 ms.
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 206/206 places, 212/212 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
[2026-05-24 08:47:00] [INFO ] Invariant cache hit.
[2026-05-24 08:47:00] [INFO ] Implicit Places using invariants in 294 ms returned []
[2026-05-24 08:47:00] [INFO ] Invariant cache hit.
[2026-05-24 08:47:00] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-24 08:47:02] [INFO ] Implicit Places using invariants and state equation in 1451 ms returned []
Implicit Place search using SMT with State Equation took 1746 ms to find 0 implicit places.
[2026-05-24 08:47:02] [INFO ] Redundant transitions in 2 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1756 ms. Remains : 206/206 places, 212/212 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 17 Pre rules applied. Total rules applied 0 place count 206 transition count 195
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 189 transition count 195
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 43 place count 180 transition count 186
Iterating global reduction 0 with 9 rules applied. Total rules applied 52 place count 180 transition count 186
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 179 transition count 185
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 179 transition count 183
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 177 transition count 183
Applied a total of 58 rules in 12 ms. Remains 177 /206 variables (removed 29) and now considering 183/212 (removed 29) transitions.
Running SMT prover for 1 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2531115063973463945.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6177936835418138526.kers'
[2026-05-24 08:47:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2531115063973463945.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6177936835418138526.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 183 rows 175 cols 1062 entries
Finished phase 1 with 103 SingleSign rule and 43 generalized
[2026-05-24 08:47:02] [INFO ] Computed 31 invariants in 2 ms
Computed 31 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6177936835418138526.kers
Total runtime 2 ms.
[2026-05-24 08:47:02] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2026-05-24 08:47:02] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 7 ms returned sat
[2026-05-24 08:47:02] [INFO ] After 109ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2026-05-24 08:47:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 08:47:02] [INFO ] After 9ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-24 08:47:02] [INFO ] After 165ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-24 08:47:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2026-05-24 08:47:02] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 7 ms returned sat
[2026-05-24 08:47:02] [INFO ] After 110ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-24 08:47:02] [INFO ] After 13ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 08:47:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 158 ms
TRAPS : Iteration 1
[2026-05-24 08:47:02] [INFO ] After 193ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 08:47:02] [INFO ] After 359ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 545 ms.
RANDOM walk for 40000 steps (5810 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3660 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 727036 steps, run timeout after 3001 ms. (steps per millisecond=242 ) properties seen :0 out of 1
Probabilistic random walk after 727036 steps, saw 363605 distinct states, run finished after 3001 ms. (steps per millisecond=242 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11896697484047446533.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17688686304039334462.kers'
[2026-05-24 08:47:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11896697484047446533.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17688686304039334462.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 246 rows 250 cols 1004 entries
Finished phase 1 with 153 SingleSign rule and 56 generalized
[2026-05-24 08:47:05] [INFO ] Computed 43 invariants in 4 ms
Computed 43 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-17688686304039334462.kers
Total runtime 5 ms.
[2026-05-24 08:47:05] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 68/69 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 127/196 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 22/218 variables, 15/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 236/454 variables, 218/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/454 variables, 24/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/454 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 37/491 variables, 28/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/491 variables, 2/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/491 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/491 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/493 variables, 2/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/493 variables, 2/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/493 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 5/498 variables, 4/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/498 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/498 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/498 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 498/498 variables, and 322 constraints, problems are : Problem set: 0 solved, 1 unsolved in 542 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 252/252 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 68/69 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 127/196 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 22/218 variables, 15/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 236/454 variables, 218/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/454 variables, 24/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/454 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/454 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 37/491 variables, 28/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/491 variables, 2/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/491 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/491 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/493 variables, 2/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/493 variables, 2/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/493 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 5/498 variables, 4/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/498 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/498 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/498 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 498/498 variables, and 323 constraints, problems are : Problem set: 0 solved, 1 unsolved in 293 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 252/252 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 847ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 46 ms.
Support contains 1 out of 252 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 246/246 transitions.
Graph (complete) has 834 edges and 252 vertex of which 251 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 251 transition count 245
Free-agglomeration rule (complex) applied 26 times.
Iterating global reduction 1 with 26 rules applied. Total rules applied 28 place count 251 transition count 219
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 54 place count 225 transition count 219
Partial Free-agglomeration rule applied 25 times.
Drop transitions (Partial Free agglomeration) removed 25 transitions
Iterating global reduction 2 with 25 rules applied. Total rules applied 79 place count 225 transition count 219
Applied a total of 79 rules in 12 ms. Remains 225 /252 variables (removed 27) and now considering 219/246 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 225/252 places, 219/246 transitions.
RANDOM walk for 40000 steps (5840 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (3614 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Probably explored full state space saw : 355343 states, properties seen :0
Probabilistic random walk after 710692 steps, saw 355343 distinct states, run finished after 2837 ms. (steps per millisecond=250 ) properties seen :0
Interrupted probabilistic random walk after 778160 steps, run timeout after 3001 ms. (steps per millisecond=259 ) properties seen :0 out of 1
Exhaustive walk after 778160 steps, saw 389173 distinct states, run finished after 3001 ms. (steps per millisecond=259 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12029120156076756872.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2516942014375476192.kers'
[2026-05-24 08:47:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12029120156076756872.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2516942014375476192.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 219 rows 223 cols 1260 entries
Finished phase 1 with 134 SingleSign rule and 48 generalized
[2026-05-24 08:47:12] [INFO ] Computed 43 invariants in 1 ms
Computed 43 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2516942014375476192.kers
Total runtime 2 ms.
[2026-05-24 08:47:12] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 11/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/165 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 51/216 variables, 24/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/216 variables, 6/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/216 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/220 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/220 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/220 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 219/439 variables, 220/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/439 variables, 38/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/439 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 5/444 variables, 5/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/444 variables, 2/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/444 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/444 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 444/444 variables, and 318 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1331 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 225/225 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 11/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/165 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 6/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 51/216 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/216 variables, 5/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/216 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/220 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/220 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/220 variables, 19/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/220 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 219/439 variables, 220/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/439 variables, 38/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/439 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/439 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 5/444 variables, 5/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/444 variables, 2/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/444 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/444 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 444/444 variables, and 338 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1624 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 225/225 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 31/31 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2963ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 42 ms.
Support contains 1 out of 225 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 225/225 places, 219/219 transitions.
Applied a total of 0 rules in 4 ms. Remains 225 /225 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 225/225 places, 219/219 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 225/225 places, 219/219 transitions.
Applied a total of 0 rules in 3 ms. Remains 225 /225 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2026-05-24 08:47:15] [INFO ] Invariant cache hit.
[2026-05-24 08:47:16] [INFO ] Implicit Places using invariants in 524 ms returned [43, 48, 75, 95, 101, 122, 127, 147, 152, 173, 179]
[2026-05-24 08:47:16] [INFO ] Actually due to overlaps returned [48, 43]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 526 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 223/225 places, 219/219 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 223 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 222 transition count 218
Applied a total of 2 rules in 12 ms. Remains 222 /223 variables (removed 1) and now considering 218/219 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4619163742537692741.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17206759299318716219.kers'
[2026-05-24 08:47:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4619163742537692741.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17206759299318716219.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 218 rows 220 cols 1229 entries
Finished phase 1 with 134 SingleSign rule and 47 generalized
[2026-05-24 08:47:16] [INFO ] Computed 41 invariants in 3 ms
Computed 41 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-17206759299318716219.kers
Total runtime 4 ms.
[2026-05-24 08:47:16] [INFO ] Implicit Places using invariants in 527 ms returned [72, 92, 98, 119, 124, 144, 149, 170, 176]
[2026-05-24 08:47:16] [INFO ] Actually due to overlaps returned [72]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 531 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 221/225 places, 218/219 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 221 transition count 218
Applied a total of 1 rules in 10 ms. Remains 221 /221 variables (removed 0) and now considering 218/218 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17076789560723647922.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2701814929577847266.kers'
[2026-05-24 08:47:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17076789560723647922.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2701814929577847266.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 218 rows 219 cols 1207 entries
Finished phase 1 with 138 SingleSign rule and 43 generalized
[2026-05-24 08:47:16] [INFO ] Computed 40 invariants in 3 ms
Computed 40 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-2701814929577847266.kers
Total runtime 4 ms.
[2026-05-24 08:47:17] [INFO ] Implicit Places using invariants in 465 ms returned [91, 97, 118, 123, 143, 148, 169, 175]
[2026-05-24 08:47:17] [INFO ] Actually due to overlaps returned [97, 91]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 466 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 219/225 places, 218/219 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 219 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 218 transition count 217
Applied a total of 2 rules in 11 ms. Remains 218 /219 variables (removed 1) and now considering 217/218 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13349034441172234165.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7245456126473676937.kers'
[2026-05-24 08:47:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13349034441172234165.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7245456126473676937.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 217 rows 216 cols 1183 entries
Finished phase 1 with 137 SingleSign rule and 43 generalized
[2026-05-24 08:47:17] [INFO ] Computed 38 invariants in 6 ms
Computed 38 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-7245456126473676937.kers
Total runtime 7 ms.
[2026-05-24 08:47:17] [INFO ] Implicit Places using invariants in 390 ms returned [115, 120, 140, 145, 166, 172]
[2026-05-24 08:47:17] [INFO ] Actually due to overlaps returned [120, 115]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 391 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 216/225 places, 217/219 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 216 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 215 transition count 216
Applied a total of 2 rules in 9 ms. Remains 215 /216 variables (removed 1) and now considering 216/217 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7464429961339330313.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15748440721443963571.kers'
[2026-05-24 08:47:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7464429961339330313.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15748440721443963571.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 216 rows 213 cols 1164 entries
Finished phase 1 with 136 SingleSign rule and 43 generalized
[2026-05-24 08:47:17] [INFO ] Computed 36 invariants in 4 ms
Computed 36 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-15748440721443963571.kers
Total runtime 5 ms.
[2026-05-24 08:47:17] [INFO ] Implicit Places using invariants in 351 ms returned [137, 142, 163, 169]
[2026-05-24 08:47:17] [INFO ] Actually due to overlaps returned [142, 137]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 353 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 213/225 places, 216/219 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 213 transition count 215
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 212 transition count 215
Applied a total of 2 rules in 11 ms. Remains 212 /213 variables (removed 1) and now considering 215/216 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1812432804859688411.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14808277793266566769.kers'
[2026-05-24 08:47:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1812432804859688411.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14808277793266566769.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 215 rows 210 cols 1150 entries
Finished phase 1 with 135 SingleSign rule and 43 generalized
[2026-05-24 08:47:17] [INFO ] Computed 34 invariants in 5 ms
Computed 34 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-14808277793266566769.kers
Total runtime 6 ms.
[2026-05-24 08:47:18] [INFO ] Implicit Places using invariants in 323 ms returned [160, 166]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 323 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 210/225 places, 215/219 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 210 transition count 214
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 209 transition count 214
Applied a total of 2 rules in 10 ms. Remains 209 /210 variables (removed 1) and now considering 214/215 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10561904694092527572.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11238543033955370893.kers'
[2026-05-24 08:47:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10561904694092527572.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11238543033955370893.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 214 rows 207 cols 1141 entries
Finished phase 1 with 135 SingleSign rule and 42 generalized
[2026-05-24 08:47:18] [INFO ] Computed 32 invariants in 2 ms
Computed 32 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11238543033955370893.kers
Total runtime 2 ms.
[2026-05-24 08:47:18] [INFO ] Implicit Places using invariants in 352 ms returned []
[2026-05-24 08:47:18] [INFO ] Invariant cache hit.
[2026-05-24 08:47:18] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-24 08:47:20] [INFO ] Implicit Places using invariants and state equation in 2327 ms returned []
Implicit Place search using SMT with State Equation took 2681 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 209/225 places, 214/219 transitions.
Finished structural reductions in REACHABILITY mode , in 7 iterations and 5338 ms. Remains : 209/225 places, 214/219 transitions.
RANDOM walk for 40000 steps (5784 resets) in 81 ms. (487 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3691 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 812167 steps, run timeout after 3001 ms. (steps per millisecond=270 ) properties seen :0 out of 1
Probabilistic random walk after 812167 steps, saw 406178 distinct states, run finished after 3001 ms. (steps per millisecond=270 ) properties seen :0
[2026-05-24 08:47:23] [INFO ] Invariant cache hit.
[2026-05-24 08:47:23] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 59/60 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 122/182 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 22/204 variables, 11/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 9/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 214/418 variables, 204/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/418 variables, 38/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/418 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 5/423 variables, 5/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/423 variables, 2/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/423 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/423 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 291 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1209 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 209/209 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 59/60 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 122/182 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 22/204 variables, 11/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 17/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/204 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 214/418 variables, 204/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/418 variables, 38/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/418 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/418 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/418 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 5/423 variables, 5/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/423 variables, 2/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/423 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/423 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 423/423 variables, and 310 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2221 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 209/209 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3433ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 45 ms.
Support contains 1 out of 209 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 209 /209 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 209/209 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 209 /209 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2026-05-24 08:47:27] [INFO ] Invariant cache hit.
[2026-05-24 08:47:27] [INFO ] Implicit Places using invariants in 333 ms returned []
[2026-05-24 08:47:27] [INFO ] Invariant cache hit.
[2026-05-24 08:47:27] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-24 08:47:30] [INFO ] Implicit Places using invariants and state equation in 2322 ms returned []
Implicit Place search using SMT with State Equation took 2656 ms to find 0 implicit places.
[2026-05-24 08:47:30] [INFO ] Redundant transitions in 1 ms returned []
Running 213 sub problems to find dead transitions.
[2026-05-24 08:47:30] [INFO ] Invariant cache hit.
[2026-05-24 08:47:30] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 27/29 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (OVERLAPS) 1/209 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 214/423 variables, 209/241 constraints. Problems are: Problem set: 0 solved, 213 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/423 variables, 38/279 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/423 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (OVERLAPS) 0/423 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 279 constraints, problems are : Problem set: 0 solved, 213 unsolved in 14155 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 209/209 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 27/29 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (OVERLAPS) 1/209 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 214/423 variables, 209/241 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/423 variables, 38/279 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/423 variables, 213/492 constraints. Problems are: Problem set: 0 solved, 213 unsolved

BK_TIME_CONFINEMENT_REACHED

--------------------
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
+ [[ QuasiLiveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution QuasiLiveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ 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 QuasiLiveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800

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="DoubleExponent-PT-010"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is DoubleExponent-PT-010, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r104-tall-177955698800552"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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