Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 5.5K Mar 5 14:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K Mar 5 14:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Mar 5 14:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Mar 5 14:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 07:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 07:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Mar 5 14:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 177K Mar 5 14:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Mar 5 14:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 113K Mar 5 14:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 07:08 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:08 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 669K 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 StableMarking

=== Now, execution of the tool begins

BK_START 1779654633018

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ASLink-PT-04b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StableMarking PT
Running Version 202604301425
[2026-05-24 20:30:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2026-05-24 20:30:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 20:30:34] [INFO ] Load time of PNML (sax parser for PT used): 188 ms
[2026-05-24 20:30:34] [INFO ] Transformed 2034 places.
[2026-05-24 20:30:34] [INFO ] Transformed 2567 transitions.
[2026-05-24 20:30:34] [INFO ] Found NUPN structural information;
[2026-05-24 20:30:34] [INFO ] Parsed PT model containing 2034 places and 2567 transitions and 7875 arcs in 326 ms.
Structural test allowed to assert that 246 places are NOT stable. Took 38 ms.
[2026-05-24 20:30:36] [INFO ] Flatten gal took : 522 ms
[2026-05-24 20:30:36] [INFO ] Flatten gal took : 344 ms
[2026-05-24 20:30:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11169365610673563408.gal : 119 ms
[2026-05-24 20:30:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13338807395541673363.prop : 9 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/ReachabilityCardinality11169365610673563408.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13338807395541673363.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 ...330
RANDOM walk for 40000 steps (78 resets) in 5706 ms. (7 steps per ms) remains 257/1788 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 257/257 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 257/257 properties
BEST_FIRST walk for 404 steps (8 resets) in 18 ms. (21 steps per ms) remains 257/257 properties
BEST_FIRST walk for 404 steps (8 resets) in 32 ms. (12 steps per ms) remains 257/257 properties
BEST_FIRST walk for 403 steps (8 resets) in 20 ms. (19 steps per ms) remains 257/257 properties
BEST_FIRST walk for 403 steps (8 resets) in 14 ms. (26 steps per ms) remains 257/257 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 257/257 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 257/257 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 257/257 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 257/257 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 257/257 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 257/257 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 257/257 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 257/257 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 257/257 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 257/257 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 257/257 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 257/257 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 257/257 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 257/257 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 257/257 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 257/257 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 257/257 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 257/257 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 257/257 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 257/257 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 257/257 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 257/257 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 257/257 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 257/257 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 257/257 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 257/257 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 257/257 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 257/257 properties
BEST_FIRST walk for 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 257/257 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 257/257 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 257/257 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 257/257 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 257/257 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 257/257 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 257/257 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 257/257 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 257/257 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 257/257 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 257/257 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 257/257 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 257/257 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 257/257 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 257/257 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 257/257 properties
Loading property file /tmp/ReachabilityCardinality13338807395541673363.prop.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12712951002966292019.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4768027197815399816.kers'
[2026-05-24 20:30:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12712951002966292019.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4768027197815399816.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 2567 rows 2034 cols 7875 entries
Finished phase 1 with 1365 SingleSign rule and 470 generalized
[2026-05-24 20:30:37] [INFO ] Computed 199 invariants in 17 ms
Computed 199 P flows in 20 ms.
Exported basis to /tmp/petrispot-output-4768027197815399816.kers
Total runtime 22 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/257 variables, 257/257 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/257 variables, 15/272 constraints. Problems are: Problem set: 0 solved, 257 unsolved
SDD proceeding with computation,1788 properties remain. new max is 4
SDD size :1 after 5
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 257/4601 variables, and 272 constraints, problems are : Problem set: 0 solved, 257 unsolved in 5060 ms.
Refiners :[Domain max(s): 257/2034 constraints, Positive P Invariants (semi-flows): 0/42 constraints, Generalized P Invariants (flows): 15/157 constraints, State Equation: 0/2034 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 257 unsolved
SDD proceeding with computation,1788 properties remain. new max is 8
SDD size :5 after 10
At refinement iteration 0 (INCLUDED_ONLY) 0/257 variables, 257/257 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/257 variables, 15/272 constraints. Problems are: Problem set: 0 solved, 257 unsolved
SDD proceeding with computation,1788 properties remain. new max is 16
SDD size :10 after 16
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 257/4601 variables, and 272 constraints, problems are : Problem set: 0 solved, 257 unsolved in 5021 ms.
Refiners :[Domain max(s): 257/2034 constraints, Positive P Invariants (semi-flows): 0/42 constraints, Generalized P Invariants (flows): 15/157 constraints, State Equation: 0/2034 constraints, PredecessorRefiner: 0/257 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10363ms problems are : Problem set: 0 solved, 257 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 257 out of 2034 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2034/2034 places, 2567/2567 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 398 transitions
Trivial Post-agglo rules discarded 398 transitions
Performed 398 trivial Post agglomeration. Transition count delta: 398
Iterating post reduction 0 with 398 rules applied. Total rules applied 398 place count 2034 transition count 2169
Reduce places removed 398 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 418 rules applied. Total rules applied 816 place count 1636 transition count 2149
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 821 place count 1631 transition count 2149
SDD proceeding with computation,1788 properties remain. new max is 32
SDD size :16 after 49
Performed 412 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 412 Pre rules applied. Total rules applied 821 place count 1631 transition count 1737
Deduced a syphon composed of 412 places in 5 ms
Ensure Unique test removed 34 places
Reduce places removed 446 places and 0 transitions.
Iterating global reduction 3 with 858 rules applied. Total rules applied 1679 place count 1185 transition count 1737
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 3 with 25 rules applied. Total rules applied 1704 place count 1182 transition count 1715
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 4 with 22 rules applied. Total rules applied 1726 place count 1160 transition count 1715
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 13 Pre rules applied. Total rules applied 1726 place count 1160 transition count 1702
Deduced a syphon composed of 13 places in 7 ms
Ensure Unique test removed 13 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 5 with 39 rules applied. Total rules applied 1765 place count 1134 transition count 1702
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 13 Pre rules applied. Total rules applied 1765 place count 1134 transition count 1689
Deduced a syphon composed of 13 places in 8 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 1791 place count 1121 transition count 1689
Discarding 54 places :
Symmetric choice reduction at 5 with 54 rule applications. Total rules 1845 place count 1067 transition count 1635
Iterating global reduction 5 with 54 rules applied. Total rules applied 1899 place count 1067 transition count 1635
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1900 place count 1067 transition count 1634
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 16 Pre rules applied. Total rules applied 1900 place count 1067 transition count 1618
Deduced a syphon composed of 16 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 6 with 33 rules applied. Total rules applied 1933 place count 1050 transition count 1618
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1933 place count 1050 transition count 1617
Deduced a syphon composed of 1 places in 8 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 1936 place count 1048 transition count 1617
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 1941 place count 1043 transition count 1584
Iterating global reduction 6 with 5 rules applied. Total rules applied 1946 place count 1043 transition count 1584
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1946 place count 1043 transition count 1583
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1948 place count 1042 transition count 1583
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1949 place count 1041 transition count 1575
Iterating global reduction 6 with 1 rules applied. Total rules applied 1950 place count 1041 transition count 1575
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1951 place count 1040 transition count 1567
Iterating global reduction 6 with 1 rules applied. Total rules applied 1952 place count 1040 transition count 1567
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1953 place count 1039 transition count 1559
Iterating global reduction 6 with 1 rules applied. Total rules applied 1954 place count 1039 transition count 1559
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1955 place count 1038 transition count 1551
Iterating global reduction 6 with 1 rules applied. Total rules applied 1956 place count 1038 transition count 1551
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1957 place count 1037 transition count 1543
Iterating global reduction 6 with 1 rules applied. Total rules applied 1958 place count 1037 transition count 1543
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1959 place count 1036 transition count 1535
Iterating global reduction 6 with 1 rules applied. Total rules applied 1960 place count 1036 transition count 1535
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1961 place count 1035 transition count 1527
Iterating global reduction 6 with 1 rules applied. Total rules applied 1962 place count 1035 transition count 1527
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1963 place count 1034 transition count 1519
Iterating global reduction 6 with 1 rules applied. Total rules applied 1964 place count 1034 transition count 1519
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1965 place count 1033 transition count 1511
Iterating global reduction 6 with 1 rules applied. Total rules applied 1966 place count 1033 transition count 1511
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1967 place count 1032 transition count 1503
Iterating global reduction 6 with 1 rules applied. Total rules applied 1968 place count 1032 transition count 1503
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1969 place count 1031 transition count 1495
Iterating global reduction 6 with 1 rules applied. Total rules applied 1970 place count 1031 transition count 1495
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1971 place count 1030 transition count 1487
Iterating global reduction 6 with 1 rules applied. Total rules applied 1972 place count 1030 transition count 1487
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1973 place count 1029 transition count 1479
Iterating global reduction 6 with 1 rules applied. Total rules applied 1974 place count 1029 transition count 1479
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1975 place count 1028 transition count 1471
Iterating global reduction 6 with 1 rules applied. Total rules applied 1976 place count 1028 transition count 1471
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1977 place count 1027 transition count 1463
Iterating global reduction 6 with 1 rules applied. Total rules applied 1978 place count 1027 transition count 1463
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1979 place count 1026 transition count 1455
Iterating global reduction 6 with 1 rules applied. Total rules applied 1980 place count 1026 transition count 1455
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 6 with 202 rules applied. Total rules applied 2182 place count 925 transition count 1354
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 2184 place count 924 transition count 1363
Free-agglomeration rule applied 8 times.
Iterating global reduction 6 with 8 rules applied. Total rules applied 2192 place count 924 transition count 1355
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 2200 place count 916 transition count 1355
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 2202 place count 916 transition count 1353
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 2204 place count 914 transition count 1353
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 2207 place count 914 transition count 1353
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 2209 place count 914 transition count 1353
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 2210 place count 913 transition count 1352
Reduce places removed 3 places and 0 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 8 with 4 rules applied. Total rules applied 2214 place count 910 transition count 1351
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 2215 place count 909 transition count 1351
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 5 Pre rules applied. Total rules applied 2215 place count 909 transition count 1346
Deduced a syphon composed of 5 places in 6 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 10 with 10 rules applied. Total rules applied 2225 place count 904 transition count 1346
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 10 with 1 rules applied. Total rules applied 2226 place count 903 transition count 1346
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 6 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 11 with 6 rules applied. Total rules applied 2232 place count 900 transition count 1343
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 2233 place count 899 transition count 1342
Iterating global reduction 11 with 1 rules applied. Total rules applied 2234 place count 899 transition count 1342
Free-agglomeration rule applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 2235 place count 899 transition count 1341
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 2236 place count 898 transition count 1341
Applied a total of 2236 rules in 1702 ms. Remains 898 /2034 variables (removed 1136) and now considering 1341/2567 (removed 1226) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1713 ms. Remains : 898/2034 places, 1341/2567 transitions.
SDD proceeding with computation,1788 properties remain. new max is 64
SDD size :49 after 196
SDD proceeding with computation,1788 properties remain. new max is 128
SDD size :196 after 416
SDD proceeding with computation,1788 properties remain. new max is 256
SDD size :416 after 569
Invariant property smplace_472 does not hold.
Invariant property smplace_471 does not hold.
Invariant property smplace_470 does not hold.
Invariant property smplace_312 does not hold.
Invariant property smplace_311 does not hold.
Invariant property smplace_310 does not hold.
Invariant property smplace_309 does not hold.
Invariant property smplace_308 does not hold.
Invariant property smplace_307 does not hold.
Invariant property smplace_306 does not hold.
Invariant property smplace_305 does not hold.
Invariant property smplace_304 does not hold.
Invariant property smplace_303 does not hold.
Invariant property smplace_302 does not hold.
Invariant property smplace_301 does not hold.
Invariant property smplace_300 does not hold.
Invariant property smplace_299 does not hold.
Invariant property smplace_298 does not hold.
Invariant property smplace_297 does not hold.
Invariant property smplace_296 does not hold.
SDD proceeding with computation,1768 properties remain. new max is 256
SDD size :569 after 15361
Invariant property smplace_444 does not hold.
Invariant property smplace_370 does not hold.
Invariant property smplace_364 does not hold.
Invariant property smplace_363 does not hold.
Invariant property smplace_336 does not hold.
Invariant property smplace_330 does not hold.
Invariant property smplace_329 does not hold.
Invariant property smplace_293 does not hold.
Invariant property smplace_292 does not hold.
Invariant property smplace_232 does not hold.
Invariant property smplace_231 does not hold.
SDD proceeding with computation,1757 properties remain. new max is 256
SDD size :15361 after 37196
Invariant property smplace_380 does not hold.
Invariant property smplace_371 does not hold.
Invariant property smplace_349 does not hold.
Invariant property smplace_348 does not hold.
Invariant property smplace_347 does not hold.
Invariant property smplace_346 does not hold.
Invariant property smplace_345 does not hold.
Invariant property smplace_344 does not hold.
Invariant property smplace_343 does not hold.
Invariant property smplace_342 does not hold.
Invariant property smplace_341 does not hold.
Invariant property smplace_340 does not hold.
Invariant property smplace_339 does not hold.
Invariant property smplace_338 does not hold.
Invariant property smplace_337 does not hold.
Invariant property smplace_335 does not hold.
Invariant property smplace_334 does not hold.
Invariant property smplace_333 does not hold.
SDD proceeding with computation,1739 properties remain. new max is 256
SDD size :37196 after 618139
Invariant property smplace_451 does not hold.
Invariant property smplace_450 does not hold.
Invariant property smplace_396 does not hold.
Invariant property smplace_383 does not hold.
Invariant property smplace_382 does not hold.
Invariant property smplace_381 does not hold.
Invariant property smplace_379 does not hold.
Invariant property smplace_378 does not hold.
Invariant property smplace_377 does not hold.
Invariant property smplace_376 does not hold.
Invariant property smplace_375 does not hold.
Invariant property smplace_374 does not hold.
Invariant property smplace_373 does not hold.
Invariant property smplace_372 does not hold.
Invariant property smplace_369 does not hold.
Invariant property smplace_368 does not hold.
Invariant property smplace_367 does not hold.
SDD proceeding with computation,1722 properties remain. new max is 256
SDD size :618139 after 895449
Invariant property smplace_395 does not hold.
Invariant property smplace_390 does not hold.
Invariant property smplace_388 does not hold.
Invariant property smplace_386 does not hold.
SDD proceeding with computation,1718 properties remain. new max is 256
SDD size :895449 after 902929
Invariant property smplace_812 does not hold.
RANDOM walk for 4000000 steps (51152 resets) in 77019 ms. (51 steps per ms) remains 178/257 properties
BEST_FIRST walk for 40003 steps (112 resets) in 238 ms. (167 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40002 steps (113 resets) in 220 ms. (181 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40003 steps (118 resets) in 249 ms. (160 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40003 steps (118 resets) in 218 ms. (182 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (121 resets) in 224 ms. (177 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40003 steps (112 resets) in 225 ms. (177 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (116 resets) in 230 ms. (173 steps per ms) remains 178/178 properties
Invariant property smplace_449 does not hold.
Invariant property smplace_443 does not hold.
Invariant property smplace_442 does not hold.
BEST_FIRST walk for 40003 steps (113 resets) in 170 ms. (233 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40002 steps (114 resets) in 260 ms. (153 steps per ms) remains 178/178 properties
Invariant property smplace_394 does not hold.
Invariant property smplace_393 does not hold.
Invariant property smplace_392 does not hold.
BEST_FIRST walk for 40004 steps (117 resets) in 201 ms. (198 steps per ms) remains 178/178 properties
Invariant property smplace_391 does not hold.
Invariant property smplace_389 does not hold.
Invariant property smplace_387 does not hold.
Invariant property smplace_385 does not hold.
BEST_FIRST walk for 40004 steps (110 resets) in 223 ms. (178 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40003 steps (118 resets) in 205 ms. (194 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40003 steps (121 resets) in 223 ms. (178 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (116 resets) in 278 ms. (143 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40003 steps (113 resets) in 221 ms. (180 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40003 steps (109 resets) in 225 ms. (177 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40003 steps (114 resets) in 222 ms. (179 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40002 steps (110 resets) in 213 ms. (186 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40003 steps (115 resets) in 230 ms. (173 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40002 steps (113 resets) in 206 ms. (193 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (115 resets) in 221 ms. (180 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (119 resets) in 223 ms. (178 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (123 resets) in 214 ms. (186 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (112 resets) in 193 ms. (206 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40003 steps (113 resets) in 242 ms. (164 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (123 resets) in 227 ms. (175 steps per ms) remains 178/178 properties
SDD proceeding with computation,1707 properties remain. new max is 256
SDD size :902929 after 1.72565e+07
BEST_FIRST walk for 40002 steps (118 resets) in 200 ms. (199 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (111 resets) in 226 ms. (176 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40003 steps (122 resets) in 203 ms. (196 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40003 steps (110 resets) in 201 ms. (198 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (113 resets) in 248 ms. (160 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40003 steps (110 resets) in 265 ms. (150 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40003 steps (111 resets) in 255 ms. (156 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (112 resets) in 206 ms. (193 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40003 steps (116 resets) in 227 ms. (175 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40003 steps (114 resets) in 225 ms. (177 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (114 resets) in 242 ms. (164 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (110 resets) in 246 ms. (161 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (113 resets) in 202 ms. (197 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40003 steps (105 resets) in 246 ms. (161 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40001 steps (115 resets) in 234 ms. (170 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (111 resets) in 196 ms. (203 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40002 steps (116 resets) in 247 ms. (161 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (118 resets) in 196 ms. (203 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40003 steps (115 resets) in 221 ms. (180 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (111 resets) in 225 ms. (177 steps per ms) remains 174/178 properties
BEST_FIRST walk for 40001 steps (104 resets) in 234 ms. (170 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40003 steps (109 resets) in 218 ms. (182 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40003 steps (110 resets) in 249 ms. (160 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40004 steps (114 resets) in 209 ms. (190 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40003 steps (116 resets) in 243 ms. (163 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40004 steps (107 resets) in 204 ms. (195 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40004 steps (116 resets) in 213 ms. (186 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40004 steps (112 resets) in 230 ms. (173 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40004 steps (113 resets) in 282 ms. (141 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40002 steps (122 resets) in 195 ms. (204 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40003 steps (112 resets) in 244 ms. (163 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40001 steps (120 resets) in 185 ms. (215 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40002 steps (117 resets) in 236 ms. (168 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40004 steps (116 resets) in 218 ms. (182 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40003 steps (113 resets) in 254 ms. (156 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40003 steps (112 resets) in 196 ms. (203 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40002 steps (113 resets) in 239 ms. (166 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40004 steps (115 resets) in 238 ms. (167 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40004 steps (111 resets) in 202 ms. (197 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40003 steps (113 resets) in 246 ms. (161 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40004 steps (117 resets) in 220 ms. (181 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40003 steps (108 resets) in 240 ms. (165 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40003 steps (104 resets) in 210 ms. (189 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40002 steps (115 resets) in 238 ms. (167 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40004 steps (108 resets) in 220 ms. (181 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40003 steps (110 resets) in 310 ms. (128 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40002 steps (115 resets) in 259 ms. (153 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40003 steps (114 resets) in 265 ms. (150 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40004 steps (114 resets) in 205 ms. (194 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40004 steps (119 resets) in 196 ms. (203 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40004 steps (113 resets) in 213 ms. (186 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40001 steps (116 resets) in 202 ms. (197 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40004 steps (118 resets) in 239 ms. (166 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40003 steps (114 resets) in 239 ms. (166 steps per ms) remains 174/174 properties
SDD proceeding with computation,1707 properties remain. new max is 512
SDD size :1.72565e+07 after 1.27294e+08
BEST_FIRST walk for 40003 steps (104 resets) in 237 ms. (168 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40004 steps (115 resets) in 249 ms. (160 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40003 steps (112 resets) in 255 ms. (156 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40003 steps (112 resets) in 217 ms. (183 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40004 steps (110 resets) in 228 ms. (174 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40004 steps (118 resets) in 268 ms. (148 steps per ms) remains 174/174 properties
Invariant property smplace_867 does not hold.
Invariant property smplace_866 does not hold.
Invariant property smplace_865 does not hold.
BEST_FIRST walk for 40002 steps (102 resets) in 244 ms. (163 steps per ms) remains 174/174 properties
Invariant property smplace_839 does not hold.
Invariant property smplace_817 does not hold.
Invariant property smplace_813 does not hold.
BEST_FIRST walk for 40003 steps (115 resets) in 227 ms. (175 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40003 steps (117 resets) in 211 ms. (188 steps per ms) remains 174/174 properties
Invariant property smplace_759 does not hold.
Invariant property smplace_758 does not hold.
BEST_FIRST walk for 40003 steps (109 resets) in 225 ms. (177 steps per ms) remains 174/174 properties
Invariant property smplace_731 does not hold.
Invariant property smplace_725 does not hold.
Invariant property smplace_724 does not hold.
BEST_FIRST walk for 40003 steps (115 resets) in 227 ms. (175 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40001 steps (113 resets) in 222 ms. (179 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40002 steps (109 resets) in 213 ms. (186 steps per ms) remains 174/174 properties
Invariant property smplace_707 does not hold.
Invariant property smplace_706 does not hold.
Invariant property smplace_705 does not hold.
Invariant property smplace_704 does not hold.
Invariant property smplace_703 does not hold.
Invariant property smplace_702 does not hold.
Invariant property smplace_701 does not hold.
Invariant property smplace_700 does not hold.
Invariant property smplace_699 does not hold.
BEST_FIRST walk for 40004 steps (108 resets) in 229 ms. (173 steps per ms) remains 174/174 properties
Invariant property smplace_698 does not hold.
Invariant property smplace_697 does not hold.
Invariant property smplace_696 does not hold.
Invariant property smplace_695 does not hold.
Invariant property smplace_694 does not hold.
Invariant property smplace_693 does not hold.
Invariant property smplace_692 does not hold.
Invariant property smplace_691 does not hold.
Invariant property smplace_688 does not hold.
Invariant property smplace_687 does not hold.
BEST_FIRST walk for 40002 steps (113 resets) in 206 ms. (193 steps per ms) remains 174/174 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-49890755665076927.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17268395168645466422.kers'
[2026-05-24 20:31:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-49890755665076927.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17268395168645466422.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 1341 rows 890 cols 4935 entries
Finished phase 1 with 337 SingleSign rule and 418 generalized
[2026-05-24 20:31:16] [INFO ] Computed 143 invariants in 9 ms
Computed 143 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-17268395168645466422.kers
Total runtime 11 ms.
Invariant property smplace_627 does not hold.
Invariant property smplace_626 does not hold.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 174 unsolved
SDD proceeding with computation,1675 properties remain. new max is 512
SDD size :1.27294e+08 after 2.65704e+10
Invariant property smplace_855 does not hold.
Invariant property smplace_854 does not hold.
Invariant property smplace_853 does not hold.
Invariant property smplace_827 does not hold.
Invariant property smplace_820 does not hold.
Invariant property smplace_819 does not hold.
Invariant property smplace_816 does not hold.
Invariant property smplace_815 does not hold.
Invariant property smplace_814 does not hold.
At refinement iteration 1 (INCLUDED_ONLY) 0/174 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 174 unsolved
Invariant property smplace_775 does not hold.
Invariant property smplace_766 does not hold.
Invariant property smplace_765 does not hold.
At refinement iteration 2 (OVERLAPS) 13/187 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 174 unsolved
Invariant property smplace_744 does not hold.
Invariant property smplace_743 does not hold.
Invariant property smplace_742 does not hold.
Invariant property smplace_741 does not hold.
Invariant property smplace_740 does not hold.
Invariant property smplace_739 does not hold.
Invariant property smplace_738 does not hold.
Invariant property smplace_737 does not hold.
Invariant property smplace_736 does not hold.
Invariant property smplace_735 does not hold.
Invariant property smplace_734 does not hold.
Invariant property smplace_733 does not hold.
Invariant property smplace_732 does not hold.
Invariant property smplace_730 does not hold.
Invariant property smplace_729 does not hold.
Invariant property smplace_728 does not hold.
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (OVERLAPS) 26/213 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (OVERLAPS) 165/378 variables, 31/49 constraints. Problems are: Problem set: 0 solved, 174 unsolved
SDD proceeding with computation,1647 properties remain. new max is 512
SDD size :2.65704e+10 after 3.88761e+11
At refinement iteration 7 (INCLUDED_ONLY) 0/378 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 8 (OVERLAPS) 97/475 variables, 15/64 constraints. Problems are: Problem set: 0 solved, 174 unsolved
SDD proceeding with computation,1647 properties remain. new max is 1024
SDD size :3.88761e+11 after 3.89056e+11
Invariant property smplace_846 does not hold.
Invariant property smplace_845 does not hold.
Invariant property smplace_791 does not hold.
Invariant property smplace_778 does not hold.
Invariant property smplace_777 does not hold.
Invariant property smplace_776 does not hold.
Invariant property smplace_774 does not hold.
Invariant property smplace_773 does not hold.
Invariant property smplace_772 does not hold.
Invariant property smplace_771 does not hold.
Invariant property smplace_770 does not hold.
Invariant property smplace_769 does not hold.
Invariant property smplace_768 does not hold.
Invariant property smplace_767 does not hold.
Invariant property smplace_764 does not hold.
Invariant property smplace_763 does not hold.
Invariant property smplace_762 does not hold.
SDD proceeding with computation,1630 properties remain. new max is 1024
SDD size :3.89056e+11 after 5.79187e+11
At refinement iteration 9 (INCLUDED_ONLY) 0/475 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 10 (OVERLAPS) 130/605 variables, 23/87 constraints. Problems are: Problem set: 0 solved, 174 unsolved
SDD proceeding with computation,1630 properties remain. new max is 2048
SDD size :5.79187e+11 after 5.80686e+11
Invariant property smplace_1262 does not hold.
Invariant property smplace_1261 does not hold.
Invariant property smplace_1260 does not hold.
Invariant property smplace_1250 does not hold.
Invariant property smplace_1249 does not hold.
Invariant property smplace_1248 does not hold.
Invariant property smplace_1234 does not hold.
Invariant property smplace_1222 does not hold.
Invariant property smplace_1215 does not hold.
Invariant property smplace_1214 does not hold.
Invariant property smplace_1212 does not hold.
Invariant property smplace_1211 does not hold.
Invariant property smplace_1210 does not hold.
Invariant property smplace_1209 does not hold.
Invariant property smplace_1208 does not hold.
Invariant property smplace_1207 does not hold.
At refinement iteration 11 (INCLUDED_ONLY) 0/605 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 12 (OVERLAPS) 24/629 variables, 6/93 constraints. Problems are: Problem set: 0 solved, 174 unsolved
Invariant property smplace_1160 does not hold.
Invariant property smplace_1154 does not hold.
Invariant property smplace_1153 does not hold.
Invariant property smplace_1126 does not hold.
Invariant property smplace_1120 does not hold.
Invariant property smplace_1119 does not hold.
Invariant property smplace_1102 does not hold.
Invariant property smplace_1101 does not hold.
Invariant property smplace_1100 does not hold.
Invariant property smplace_1099 does not hold.
Invariant property smplace_1098 does not hold.
Invariant property smplace_1097 does not hold.
Invariant property smplace_1096 does not hold.
Invariant property smplace_1095 does not hold.
Invariant property smplace_1094 does not hold.
Invariant property smplace_1093 does not hold.
Invariant property smplace_1092 does not hold.
Invariant property smplace_1091 does not hold.
Invariant property smplace_1090 does not hold.
Invariant property smplace_1089 does not hold.
Invariant property smplace_1088 does not hold.
Invariant property smplace_1087 does not hold.
Invariant property smplace_1086 does not hold.
Invariant property smplace_1083 does not hold.
Invariant property smplace_1082 does not hold.
Invariant property smplace_1022 does not hold.
Invariant property smplace_1021 does not hold.
At refinement iteration 13 (INCLUDED_ONLY) 0/629 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 14 (OVERLAPS) 1/630 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 174 unsolved
Invariant property smplace_844 does not hold.
Invariant property smplace_838 does not hold.
Invariant property smplace_837 does not hold.
Invariant property smplace_826 does not hold.
Invariant property smplace_825 does not hold.
Invariant property smplace_790 does not hold.
Invariant property smplace_789 does not hold.
Invariant property smplace_788 does not hold.
Invariant property smplace_787 does not hold.
Invariant property smplace_786 does not hold.
Invariant property smplace_785 does not hold.
Invariant property smplace_784 does not hold.
Invariant property smplace_783 does not hold.
Invariant property smplace_782 does not hold.
Invariant property smplace_781 does not hold.
Invariant property smplace_780 does not hold.
At refinement iteration 15 (INCLUDED_ONLY) 0/630 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 16 (OVERLAPS) 22/652 variables, 4/98 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/652 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 18 (OVERLAPS) 36/688 variables, 4/102 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/688 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 20 (OVERLAPS) 1/689 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/689 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 22 (OVERLAPS) 72/761 variables, 8/111 constraints. Problems are: Problem set: 0 solved, 174 unsolved
SDD proceeding with computation,1571 properties remain. new max is 2048
SDD size :5.80686e+11 after 1.28923e+17
At refinement iteration 23 (INCLUDED_ONLY) 0/761 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 174 unsolved
Invariant property smplace_1241 does not hold.
Invariant property smplace_1240 does not hold.
At refinement iteration 24 (OVERLAPS) 10/771 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 174 unsolved
Invariant property smplace_1186 does not hold.
Invariant property smplace_1173 does not hold.
Invariant property smplace_1172 does not hold.
Invariant property smplace_1171 does not hold.
Invariant property smplace_1170 does not hold.
Invariant property smplace_1169 does not hold.
Invariant property smplace_1168 does not hold.
Invariant property smplace_1167 does not hold.
Invariant property smplace_1166 does not hold.
Invariant property smplace_1165 does not hold.
Invariant property smplace_1164 does not hold.
Invariant property smplace_1163 does not hold.
Invariant property smplace_1162 does not hold.
Invariant property smplace_1161 does not hold.
Invariant property smplace_1159 does not hold.
Invariant property smplace_1158 does not hold.
Invariant property smplace_1157 does not hold.
Invariant property smplace_1139 does not hold.
Invariant property smplace_1138 does not hold.
Invariant property smplace_1137 does not hold.
Invariant property smplace_1136 does not hold.
Invariant property smplace_1135 does not hold.
Invariant property smplace_1134 does not hold.
Invariant property smplace_1133 does not hold.
Invariant property smplace_1132 does not hold.
Invariant property smplace_1131 does not hold.
Invariant property smplace_1130 does not hold.
Invariant property smplace_1129 does not hold.
Invariant property smplace_1128 does not hold.
Invariant property smplace_1127 does not hold.
Invariant property smplace_1125 does not hold.
Invariant property smplace_1124 does not hold.
Invariant property smplace_1123 does not hold.
At refinement iteration 25 (INCLUDED_ONLY) 0/771 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 26 (OVERLAPS) 100/871 variables, 12/125 constraints. Problems are: Problem set: 0 solved, 174 unsolved
SDD proceeding with computation,1536 properties remain. new max is 2048
SDD size :1.28923e+17 after 5.10252e+17
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 871/2239 variables, and 125 constraints, problems are : Problem set: 0 solved, 174 unsolved in 45039 ms.
Refiners :[Positive P Invariants (semi-flows): 39/42 constraints, Generalized P Invariants (flows): 86/101 constraints, State Equation: 0/898 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 174 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 174 unsolved
Invariant property smplace_1239 does not hold.
Invariant property smplace_1185 does not hold.
Invariant property smplace_1184 does not hold.
Invariant property smplace_1183 does not hold.
Invariant property smplace_1182 does not hold.
Invariant property smplace_1181 does not hold.
Invariant property smplace_1180 does not hold.
Invariant property smplace_1179 does not hold.
Invariant property smplace_1178 does not hold.
Invariant property smplace_1177 does not hold.
Invariant property smplace_1176 does not hold.
Invariant property smplace_1175 does not hold.
At refinement iteration 1 (INCLUDED_ONLY) 0/174 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 13/187 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 174 unsolved
SDD proceeding with computation,1524 properties remain. new max is 2048
SDD size :5.10252e+17 after 5.72712e+18
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (OVERLAPS) 26/213 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 174 unsolved
Invariant property smplace_1657 does not hold.
Invariant property smplace_1656 does not hold.
Invariant property smplace_1655 does not hold.
Invariant property smplace_1645 does not hold.
Invariant property smplace_1607 does not hold.
Invariant property smplace_1606 does not hold.
Invariant property smplace_1603 does not hold.
Invariant property smplace_1602 does not hold.
Invariant property smplace_1521 does not hold.
Invariant property smplace_1497 does not hold.
Invariant property smplace_1496 does not hold.
Invariant property smplace_1495 does not hold.
Invariant property smplace_1494 does not hold.
Invariant property smplace_1493 does not hold.
Invariant property smplace_1492 does not hold.
Invariant property smplace_1491 does not hold.
Invariant property smplace_1490 does not hold.
Invariant property smplace_1489 does not hold.
Invariant property smplace_1488 does not hold.
Invariant property smplace_1487 does not hold.
Invariant property smplace_1486 does not hold.
Invariant property smplace_1485 does not hold.
Invariant property smplace_1484 does not hold.
Invariant property smplace_1483 does not hold.
Invariant property smplace_1482 does not hold.
Invariant property smplace_1481 does not hold.
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (OVERLAPS) 165/378 variables, 31/50 constraints. Problems are: Problem set: 0 solved, 174 unsolved
Invariant property smplace_1233 does not hold.
Invariant property smplace_1232 does not hold.
Invariant property smplace_1221 does not hold.
Invariant property smplace_1220 does not hold.
At refinement iteration 8 (INCLUDED_ONLY) 0/378 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/378 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/378 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/378 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 12 (OVERLAPS) 97/475 variables, 15/74 constraints. Problems are: Problem set: 0 solved, 174 unsolved
SDD proceeding with computation,1494 properties remain. new max is 2048
SDD size :5.72712e+18 after 1.95128e+22
At refinement iteration 13 (INCLUDED_ONLY) 0/475 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 14 (OVERLAPS) 130/605 variables, 23/97 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/605 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 16 (OVERLAPS) 24/629 variables, 6/103 constraints. Problems are: Problem set: 0 solved, 174 unsolved
Invariant property smplace_1644 does not hold.
Invariant property smplace_1643 does not hold.
Invariant property smplace_1636 does not hold.
Invariant property smplace_1635 does not hold.
Invariant property smplace_1629 does not hold.
Invariant property smplace_1605 does not hold.
Invariant property smplace_1604 does not hold.
Invariant property smplace_1581 does not hold.
Invariant property smplace_1580 does not hold.
Invariant property smplace_1575 does not hold.
Invariant property smplace_1573 does not hold.
Invariant property smplace_1571 does not hold.
Invariant property smplace_1568 does not hold.
Invariant property smplace_1567 does not hold.
Invariant property smplace_1566 does not hold.
Invariant property smplace_1565 does not hold.
Invariant property smplace_1564 does not hold.
Invariant property smplace_1563 does not hold.
Invariant property smplace_1562 does not hold.
Invariant property smplace_1561 does not hold.
Invariant property smplace_1560 does not hold.
Invariant property smplace_1559 does not hold.
Invariant property smplace_1558 does not hold.
Invariant property smplace_1557 does not hold.
Invariant property smplace_1556 does not hold.
Invariant property smplace_1555 does not hold.
Invariant property smplace_1554 does not hold.
Invariant property smplace_1553 does not hold.
Invariant property smplace_1552 does not hold.
Invariant property smplace_1549 does not hold.
Invariant property smplace_1548 does not hold.
Invariant property smplace_1534 does not hold.
Invariant property smplace_1533 does not hold.
Invariant property smplace_1532 does not hold.
Invariant property smplace_1531 does not hold.
Invariant property smplace_1530 does not hold.
Invariant property smplace_1529 does not hold.
Invariant property smplace_1528 does not hold.
Invariant property smplace_1527 does not hold.
Invariant property smplace_1526 does not hold.
Invariant property smplace_1525 does not hold.
Invariant property smplace_1524 does not hold.
Invariant property smplace_1523 does not hold.
Invariant property smplace_1522 does not hold.
Invariant property smplace_1520 does not hold.
Invariant property smplace_1519 does not hold.
Invariant property smplace_1518 does not hold.
Invariant property smplace_1515 does not hold.
Invariant property smplace_1514 does not hold.
Invariant property smplace_1478 does not hold.
Invariant property smplace_1477 does not hold.
Invariant property smplace_1417 does not hold.
Invariant property smplace_1416 does not hold.
At refinement iteration 17 (INCLUDED_ONLY) 0/629 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 18 (OVERLAPS) 1/630 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 174 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 630/2239 variables, and 104 constraints, problems are : Problem set: 0 solved, 174 unsolved in 45017 ms.
Refiners :[Positive P Invariants (semi-flows): 32/42 constraints, Generalized P Invariants (flows): 62/101 constraints, State Equation: 0/898 constraints, PredecessorRefiner: 0/174 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 90114ms problems are : Problem set: 0 solved, 174 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 174 out of 898 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 898/898 places, 1341/1341 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 898 transition count 1318
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 875 transition count 1318
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 46 place count 875 transition count 1301
Deduced a syphon composed of 17 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 35 rules applied. Total rules applied 81 place count 857 transition count 1301
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 2 with 1 rules applied. Total rules applied 82 place count 857 transition count 1300
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 83 place count 856 transition count 1300
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 21 rules applied. Total rules applied 104 place count 845 transition count 1290
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 104 place count 845 transition count 1287
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 110 place count 842 transition count 1287
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 111 place count 841 transition count 1287
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 113 place count 840 transition count 1286
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 114 place count 839 transition count 1285
Iterating global reduction 5 with 1 rules applied. Total rules applied 115 place count 839 transition count 1285
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 118 place count 839 transition count 1282
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 7 rules applied. Total rules applied 125 place count 835 transition count 1279
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 126 place count 834 transition count 1279
Applied a total of 126 rules in 163 ms. Remains 834 /898 variables (removed 64) and now considering 1279/1341 (removed 62) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 163 ms. Remains : 834/898 places, 1279/1341 transitions.
RANDOM walk for 4000000 steps (53205 resets) in 67602 ms. (59 steps per ms) remains 166/174 properties
BEST_FIRST walk for 40004 steps (126 resets) in 181 ms. (219 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40004 steps (124 resets) in 208 ms. (191 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40004 steps (122 resets) in 192 ms. (207 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40003 steps (125 resets) in 190 ms. (209 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40003 steps (121 resets) in 220 ms. (181 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40004 steps (125 resets) in 185 ms. (215 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40003 steps (121 resets) in 256 ms. (155 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40002 steps (120 resets) in 190 ms. (209 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40003 steps (122 resets) in 219 ms. (181 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40003 steps (121 resets) in 248 ms. (160 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40003 steps (121 resets) in 187 ms. (212 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40002 steps (124 resets) in 223 ms. (178 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40003 steps (116 resets) in 207 ms. (192 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40003 steps (116 resets) in 265 ms. (150 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40003 steps (115 resets) in 194 ms. (205 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40002 steps (124 resets) in 227 ms. (175 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40002 steps (117 resets) in 206 ms. (193 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40002 steps (111 resets) in 223 ms. (178 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40002 steps (122 resets) in 239 ms. (166 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40004 steps (119 resets) in 238 ms. (167 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40002 steps (109 resets) in 219 ms. (181 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40004 steps (119 resets) in 219 ms. (181 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40002 steps (120 resets) in 239 ms. (166 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40003 steps (120 resets) in 199 ms. (200 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40003 steps (117 resets) in 230 ms. (173 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40002 steps (120 resets) in 197 ms. (202 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40002 steps (114 resets) in 242 ms. (164 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40004 steps (126 resets) in 222 ms. (179 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40003 steps (115 resets) in 233 ms. (170 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40001 steps (120 resets) in 227 ms. (175 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40003 steps (123 resets) in 242 ms. (164 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40004 steps (124 resets) in 205 ms. (194 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40002 steps (114 resets) in 224 ms. (177 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40003 steps (123 resets) in 216 ms. (184 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40003 steps (119 resets) in 249 ms. (160 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40004 steps (126 resets) in 208 ms. (191 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40003 steps (114 resets) in 195 ms. (204 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40003 steps (115 resets) in 250 ms. (159 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40002 steps (121 resets) in 189 ms. (210 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40003 steps (117 resets) in 192 ms. (207 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40003 steps (124 resets) in 225 ms. (177 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40003 steps (127 resets) in 185 ms. (215 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40003 steps (116 resets) in 227 ms. (175 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40003 steps (114 resets) in 227 ms. (175 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40004 steps (119 resets) in 216 ms. (184 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40003 steps (121 resets) in 192 ms. (207 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40003 steps (119 resets) in 222 ms. (179 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40004 steps (122 resets) in 239 ms. (166 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40004 steps (111 resets) in 217 ms. (183 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40003 steps (124 resets) in 187 ms. (212 steps per ms) remains 166/166 properties
SDD proceeding with computation,1441 properties remain. new max is 2048
SDD size :1.95128e+22 after 5.5133e+23
Invariant property smplace_1912 does not hold.
Invariant property smplace_1757 does not hold.
Invariant property smplace_1756 does not hold.
Invariant property smplace_1755 does not hold.
Invariant property smplace_1754 does not hold.
Invariant property smplace_1753 does not hold.
Invariant property smplace_1726 does not hold.
Invariant property smplace_1634 does not hold.
Invariant property smplace_1628 does not hold.
Invariant property smplace_1627 does not hold.
Invariant property smplace_1626 does not hold.
Invariant property smplace_1625 does not hold.
Invariant property smplace_1624 does not hold.
Invariant property smplace_1617 does not hold.
Invariant property smplace_1616 does not hold.
Invariant property smplace_1610 does not hold.
Invariant property smplace_1609 does not hold.
Invariant property smplace_1579 does not hold.
Invariant property smplace_1578 does not hold.
Invariant property smplace_1577 does not hold.
Invariant property smplace_1576 does not hold.
Invariant property smplace_1574 does not hold.
Invariant property smplace_1572 does not hold.
Invariant property smplace_1570 does not hold.
Invariant property smplace_1476 does not hold.
Invariant property smplace_1475 does not hold.
Invariant property smplace_1474 does not hold.
Invariant property smplace_1473 does not hold.
Invariant property smplace_1472 does not hold.
Invariant property smplace_1459 does not hold.
Invariant property smplace_1458 does not hold.
Invariant property smplace_1457 does not hold.
Invariant property smplace_1456 does not hold.
Invariant property smplace_1415 does not hold.
Invariant property smplace_1341 does not hold.
Interrupted probabilistic random walk after 3314296 steps, run timeout after 63001 ms. (steps per millisecond=52 ) properties seen :33 out of 166
Probabilistic random walk after 3314296 steps, saw 841673 distinct states, run finished after 63020 ms. (steps per millisecond=52 ) properties seen :33
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17147944349094438000.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5808677299703664975.kers'
[2026-05-24 20:34:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17147944349094438000.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5808677299703664975.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 2 ms.
// Phase 1: matrix 1279 rows 824 cols 4787 entries
Finished phase 1 with 283 SingleSign rule and 412 generalized
[2026-05-24 20:34:11] [INFO ] Computed 139 invariants in 19 ms
Computed 139 P flows in 19 ms.
Exported basis to /tmp/petrispot-output-5808677299703664975.kers
Total runtime 22 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (OVERLAPS) 13/146 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (OVERLAPS) 26/172 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (OVERLAPS) 106/278 variables, 23/40 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/278 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (OVERLAPS) 67/345 variables, 10/50 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/345 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 10 (OVERLAPS) 1/346 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/346 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 12 (OVERLAPS) 86/432 variables, 14/65 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/432 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 14 (OVERLAPS) 41/473 variables, 7/72 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/473 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 16 (OVERLAPS) 1/474 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/474 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 18 (OVERLAPS) 84/558 variables, 12/85 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/558 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 20 (OVERLAPS) 19/577 variables, 4/89 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/577 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 22 (OVERLAPS) 55/632 variables, 7/96 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/632 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 24 (OVERLAPS) 41/673 variables, 6/102 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/673 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 26 (OVERLAPS) 1/674 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/674 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 28 (OVERLAPS) 36/710 variables, 8/111 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/710 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 30 (OVERLAPS) 97/807 variables, 10/121 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/807 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 32 (OVERLAPS) 3/810 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 133 unsolved
SDD proceeding with computation,1406 properties remain. new max is 2048
SDD size :5.5133e+23 after 5.64973e+25
At refinement iteration 33 (INCLUDED_ONLY) 0/810 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 34 (OVERLAPS) 1/811 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/811 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 36 (OVERLAPS) 23/834 variables, 15/139 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/834 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 38 (OVERLAPS) 1279/2113 variables, 834/973 constraints. Problems are: Problem set: 0 solved, 133 unsolved
Invariant property smplace_1375 does not hold.
Invariant property smplace_1374 does not hold.
At refinement iteration 39 (INCLUDED_ONLY) 0/2113 variables, 0/973 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 40 (OVERLAPS) 0/2113 variables, 0/973 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2113/2113 variables, and 973 constraints, problems are : Problem set: 0 solved, 133 unsolved in 63004 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, Generalized P Invariants (flows): 96/96 constraints, State Equation: 834/834 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 133 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (OVERLAPS) 13/146 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (OVERLAPS) 26/172 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (OVERLAPS) 106/278 variables, 23/41 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/278 variables, 8/49 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/278 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/278 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/278 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 12 (OVERLAPS) 67/345 variables, 10/62 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/345 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 14 (OVERLAPS) 1/346 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/346 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 16 (OVERLAPS) 86/432 variables, 14/77 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/432 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 18 (OVERLAPS) 41/473 variables, 7/84 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/473 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 20 (OVERLAPS) 1/474 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/474 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 22 (OVERLAPS) 84/558 variables, 12/97 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/558 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 24 (OVERLAPS) 19/577 variables, 4/101 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/577 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 26 (OVERLAPS) 55/632 variables, 7/108 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/632 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 28 (OVERLAPS) 41/673 variables, 6/114 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/673 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/673 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 31 (OVERLAPS) 1/674 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 133 unsolved
SDD proceeding with computation,1404 properties remain. new max is 2048
SDD size :5.64973e+25 after 5.64986e+25
SDD proceeding with computation,1404 properties remain. new max is 4096
SDD size :5.64986e+25 after 5.656e+25
At refinement iteration 32 (INCLUDED_ONLY) 0/674 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 33 (OVERLAPS) 36/710 variables, 8/124 constraints. Problems are: Problem set: 0 solved, 133 unsolved
Invariant property smplace_1414 does not hold.
Invariant property smplace_1413 does not hold.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 710/2113 variables, and 124 constraints, problems are : Problem set: 0 solved, 133 unsolved in 75022 ms.
Refiners :[Positive P Invariants (semi-flows): 40/43 constraints, Generalized P Invariants (flows): 71/96 constraints, State Equation: 0/834 constraints, PredecessorRefiner: 0/133 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 138099ms problems are : Problem set: 0 solved, 133 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 133 out of 834 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 834/834 places, 1279/1279 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 834 transition count 1264
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 819 transition count 1264
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 30 place count 819 transition count 1255
Deduced a syphon composed of 9 places in 4 ms
Ensure Unique test removed 2 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 50 place count 808 transition count 1255
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 2 with 1 rules applied. Total rules applied 51 place count 808 transition count 1254
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 52 place count 807 transition count 1254
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 52 place count 807 transition count 1253
Deduced a syphon composed of 1 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 55 place count 805 transition count 1253
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 55 place count 805 transition count 1252
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 57 place count 804 transition count 1252
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 5 rules applied. Total rules applied 62 place count 801 transition count 1250
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 4 with 1 rules applied. Total rules applied 63 place count 801 transition count 1249
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 64 place count 800 transition count 1249
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 64 place count 800 transition count 1248
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 66 place count 799 transition count 1248
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 6 with 1 rules applied. Total rules applied 67 place count 798 transition count 1248
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 69 place count 797 transition count 1247
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 70 place count 796 transition count 1246
Iterating global reduction 7 with 1 rules applied. Total rules applied 71 place count 796 transition count 1246
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 72 place count 796 transition count 1245
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 73 place count 795 transition count 1245
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 74 place count 795 transition count 1245
Applied a total of 74 rules in 162 ms. Remains 795 /834 variables (removed 39) and now considering 1245/1279 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 163 ms. Remains : 795/834 places, 1245/1279 transitions.
SDD proceeding with computation,1402 properties remain. new max is 4096
SDD size :5.656e+25 after 5.66357e+25
Invariant property smplace_1623 does not hold.
Invariant property smplace_1340 does not hold.
Invariant property smplace_1339 does not hold.
RANDOM walk for 4000000 steps (52628 resets) in 55863 ms. (71 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40003 steps (116 resets) in 244 ms. (163 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (113 resets) in 219 ms. (181 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40004 steps (110 resets) in 172 ms. (231 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40004 steps (128 resets) in 188 ms. (211 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40003 steps (123 resets) in 170 ms. (233 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40004 steps (124 resets) in 203 ms. (196 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (107 resets) in 222 ms. (179 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40003 steps (121 resets) in 169 ms. (235 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (113 resets) in 186 ms. (213 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (112 resets) in 201 ms. (198 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40004 steps (116 resets) in 165 ms. (240 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (117 resets) in 199 ms. (200 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40004 steps (116 resets) in 171 ms. (232 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40004 steps (116 resets) in 195 ms. (204 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40004 steps (107 resets) in 212 ms. (187 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40003 steps (113 resets) in 177 ms. (224 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40003 steps (119 resets) in 191 ms. (208 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40004 steps (118 resets) in 213 ms. (186 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40004 steps (116 resets) in 204 ms. (195 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (118 resets) in 161 ms. (246 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40004 steps (110 resets) in 180 ms. (221 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40004 steps (110 resets) in 208 ms. (191 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40004 steps (117 resets) in 176 ms. (226 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40003 steps (124 resets) in 179 ms. (222 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40003 steps (117 resets) in 185 ms. (215 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40004 steps (119 resets) in 178 ms. (223 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40003 steps (119 resets) in 249 ms. (160 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40003 steps (128 resets) in 177 ms. (224 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40003 steps (115 resets) in 177 ms. (224 steps per ms) remains 133/133 properties
SDD proceeding with computation,1399 properties remain. new max is 4096
SDD size :5.66357e+25 after 5.68325e+25
BEST_FIRST walk for 40003 steps (130 resets) in 222 ms. (179 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40003 steps (121 resets) in 188 ms. (211 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (121 resets) in 168 ms. (236 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (122 resets) in 208 ms. (191 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (118 resets) in 173 ms. (229 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (113 resets) in 195 ms. (204 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40003 steps (117 resets) in 224 ms. (177 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (122 resets) in 206 ms. (193 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40004 steps (113 resets) in 177 ms. (224 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40003 steps (117 resets) in 222 ms. (179 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40003 steps (122 resets) in 175 ms. (227 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40004 steps (103 resets) in 229 ms. (173 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40003 steps (124 resets) in 196 ms. (203 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (119 resets) in 204 ms. (195 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (113 resets) in 229 ms. (173 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40004 steps (120 resets) in 179 ms. (222 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (117 resets) in 200 ms. (199 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40003 steps (118 resets) in 176 ms. (226 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40004 steps (114 resets) in 203 ms. (196 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40004 steps (112 resets) in 198 ms. (201 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40003 steps (123 resets) in 161 ms. (246 steps per ms) remains 133/133 properties
Interrupted probabilistic random walk after 3209482 steps, run timeout after 54001 ms. (steps per millisecond=59 ) properties seen :0 out of 133
Probabilistic random walk after 3209482 steps, saw 862370 distinct states, run finished after 54004 ms. (steps per millisecond=59 ) 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-6370036203097662965.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13154083445507411952.kers'
[2026-05-24 20:37:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6370036203097662965.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13154083445507411952.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 1245 rows 785 cols 4709 entries
Finished phase 1 with 255 SingleSign rule and 406 generalized
[2026-05-24 20:37:42] [INFO ] Computed 134 invariants in 8 ms
Computed 134 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-13154083445507411952.kers
Total runtime 10 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (OVERLAPS) 13/146 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (OVERLAPS) 26/172 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (OVERLAPS) 106/278 variables, 23/40 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/278 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (OVERLAPS) 67/345 variables, 10/50 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/345 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 10 (OVERLAPS) 1/346 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/346 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 12 (OVERLAPS) 78/424 variables, 14/65 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/424 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 14 (OVERLAPS) 50/474 variables, 8/73 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/474 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 16 (OVERLAPS) 2/476 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/476 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 18 (OVERLAPS) 53/529 variables, 9/84 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/529 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 20 (OVERLAPS) 12/541 variables, 3/87 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/541 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 22 (OVERLAPS) 52/593 variables, 4/91 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/593 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 24 (OVERLAPS) 41/634 variables, 6/97 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/634 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 26 (OVERLAPS) 1/635 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/635 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 28 (OVERLAPS) 36/671 variables, 8/106 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/671 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 30 (OVERLAPS) 97/768 variables, 10/116 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/768 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 32 (OVERLAPS) 3/771 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/771 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 34 (OVERLAPS) 1/772 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/772 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 36 (OVERLAPS) 23/795 variables, 15/134 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/795 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 38 (OVERLAPS) 1245/2040 variables, 795/929 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/2040 variables, 0/929 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 40 (OVERLAPS) 0/2040 variables, 0/929 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2040/2040 variables, and 929 constraints, problems are : Problem set: 0 solved, 133 unsolved in 57638 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, Generalized P Invariants (flows): 90/90 constraints, State Equation: 795/795 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 133 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (OVERLAPS) 13/146 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (OVERLAPS) 26/172 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (OVERLAPS) 106/278 variables, 23/41 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/278 variables, 8/49 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/278 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/278 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 133 unsolved
SDD proceeding with computation,1399 properties remain. new max is 8192
SDD size :5.68325e+25 after 5.69073e+25
At refinement iteration 11 (INCLUDED_ONLY) 0/278 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 12 (OVERLAPS) 67/345 variables, 10/62 constraints. Problems are: Problem set: 0 solved, 133 unsolved
Invariant property smplace_1513 does not hold.
Invariant property smplace_1512 does not hold.
Invariant property smplace_1511 does not hold.
Invariant property smplace_1510 does not hold.
Invariant property smplace_1509 does not hold.
Invariant property smplace_1502 does not hold.
Invariant property smplace_1501 does not hold.
Invariant property smplace_1500 does not hold.
Invariant property smplace_1499 does not hold.
Invariant property smplace_1378 does not hold.
At refinement iteration 13 (INCLUDED_ONLY) 0/345 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 133 unsolved
Invariant property smplace_1377 does not hold.
At refinement iteration 14 (OVERLAPS) 1/346 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/346 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 16 (OVERLAPS) 78/424 variables, 14/77 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/424 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 18 (OVERLAPS) 50/474 variables, 8/85 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/474 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 20 (OVERLAPS) 2/476 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/476 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 22 (OVERLAPS) 53/529 variables, 9/96 constraints. Problems are: Problem set: 0 solved, 133 unsolved
SDD proceeding with computation,1388 properties remain. new max is 8192
At refinement iteration 23 (INCLUDED_ONLY) 0/529 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 133 unsolved
SDD size :5.69073e+25 after 5.70237e+25
At refinement iteration 24 (OVERLAPS) 12/541 variables, 3/99 constraints. Problems are: Problem set: 0 solved, 133 unsolved
Invariant property smplace_1547 does not hold.
Invariant property smplace_1546 does not hold.
Invariant property smplace_1545 does not hold.
Invariant property smplace_1544 does not hold.
Invariant property smplace_1543 does not hold.
Invariant property smplace_1539 does not hold.
Invariant property smplace_1538 does not hold.
Invariant property smplace_1537 does not hold.
Invariant property smplace_1536 does not hold.
Invariant property smplace_1381 does not hold.
Invariant property smplace_1380 does not hold.
At refinement iteration 25 (INCLUDED_ONLY) 0/541 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 26 (OVERLAPS) 52/593 variables, 4/103 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/593 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 28 (OVERLAPS) 41/634 variables, 6/109 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/634 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 30 (OVERLAPS) 1/635 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/635 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 32 (OVERLAPS) 36/671 variables, 8/118 constraints. Problems are: Problem set: 0 solved, 133 unsolved
SDD proceeding with computation,1377 properties remain. new max is 8192
SDD size :5.70237e+25 after 5.79355e+25
At refinement iteration 33 (INCLUDED_ONLY) 0/671 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 34 (OVERLAPS) 97/768 variables, 10/128 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/768 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 36 (OVERLAPS) 3/771 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/771 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 38 (OVERLAPS) 1/772 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 133 unsolved
Invariant property smplace_1752 does not hold.
Invariant property smplace_1751 does not hold.
Invariant property smplace_1750 does not hold.
At refinement iteration 39 (INCLUDED_ONLY) 0/772 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 40 (OVERLAPS) 23/795 variables, 15/146 constraints. Problems are: Problem set: 0 solved, 133 unsolved
Invariant property smplace_1622 does not hold.
Invariant property smplace_1621 does not hold.
Invariant property smplace_1620 does not hold.
Invariant property smplace_1619 does not hold.
Invariant property smplace_1618 does not hold.
At refinement iteration 41 (INCLUDED_ONLY) 0/795 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 42 (OVERLAPS) 1245/2040 variables, 795/941 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/2040 variables, 133/1074 constraints. Problems are: Problem set: 0 solved, 133 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2040/2040 variables, and 1074 constraints, problems are : Problem set: 0 solved, 133 unsolved in 90024 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, Generalized P Invariants (flows): 90/90 constraints, State Equation: 795/795 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 147729ms problems are : Problem set: 0 solved, 133 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 133 out of 795 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 795/795 places, 1245/1245 transitions.
Applied a total of 0 rules in 41 ms. Remains 795 /795 variables (removed 0) and now considering 1245/1245 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 795/795 places, 1245/1245 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 795/795 places, 1245/1245 transitions.
Applied a total of 0 rules in 25 ms. Remains 795 /795 variables (removed 0) and now considering 1245/1245 (removed 0) transitions.
[2026-05-24 20:40:09] [INFO ] Invariant cache hit.
[2026-05-24 20:40:10] [INFO ] Implicit Places using invariants in 805 ms returned [1, 18, 47, 64, 82, 232, 233, 235, 252, 270, 375, 379, 380, 395, 396, 398, 415, 433, 452, 502, 503, 514, 515, 517, 534, 552, 621, 625, 626, 629, 640, 641, 642, 660, 662, 666, 684, 685, 686, 687, 699, 705, 711, 717, 723, 729, 735, 741, 747, 753, 759]
[2026-05-24 20:40:10] [INFO ] Actually due to overlaps returned [660, 642, 47, 64, 235, 252, 415, 534, 666, 398, 517, 232, 395, 514, 640, 684, 233, 396, 515, 641, 662, 685, 1, 379, 380, 502, 503, 625, 626, 18, 82, 270, 552, 686, 729, 747, 759, 433, 452, 629, 687, 699, 705, 711, 717, 723, 735, 741, 753]
Discarding 49 places :
Implicit Place search using SMT only with invariants took 818 ms to find 49 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 746/795 places, 1245/1245 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 82 rules applied. Total rules applied 82 place count 744 transition count 1165
Reduce places removed 80 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 81 rules applied. Total rules applied 163 place count 664 transition count 1164
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 163 place count 664 transition count 1144
Deduced a syphon composed of 20 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 41 rules applied. Total rules applied 204 place count 643 transition count 1144
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 216 place count 639 transition count 1136
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 224 place count 631 transition count 1136
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 239 place count 616 transition count 1121
Iterating global reduction 4 with 15 rules applied. Total rules applied 254 place count 616 transition count 1121
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 257 place count 616 transition count 1118
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 257 place count 616 transition count 1117
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 259 place count 615 transition count 1117
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 262 place count 612 transition count 1111
Iterating global reduction 5 with 3 rules applied. Total rules applied 265 place count 612 transition count 1111
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 266 place count 611 transition count 1110
Iterating global reduction 5 with 1 rules applied. Total rules applied 267 place count 611 transition count 1110
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 268 place count 610 transition count 1108
Iterating global reduction 5 with 1 rules applied. Total rules applied 269 place count 610 transition count 1108
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 5 with 72 rules applied. Total rules applied 341 place count 574 transition count 1072
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 342 place count 574 transition count 1071
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 344 place count 572 transition count 1069
Iterating global reduction 6 with 2 rules applied. Total rules applied 346 place count 572 transition count 1069
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 348 place count 572 transition count 1067
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 352 place count 570 transition count 1068
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 7 with 13 rules applied. Total rules applied 365 place count 570 transition count 1055
Ensure Unique test removed 1 places
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 7 with 14 rules applied. Total rules applied 379 place count 556 transition count 1055
Partial Free-agglomeration rule applied 12 times.
Drop transitions (Partial Free agglomeration) removed 12 transitions
Iterating global reduction 8 with 12 rules applied. Total rules applied 391 place count 556 transition count 1055
Applied a total of 391 rules in 160 ms. Remains 556 /746 variables (removed 190) and now considering 1055/1245 (removed 190) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9117665302937257249.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13621594560500448575.kers'
[2026-05-24 20:40:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9117665302937257249.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13621594560500448575.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1055 rows 556 cols 4118 entries
Finished phase 1 with 239 SingleSign rule and 240 generalized
[2026-05-24 20:40:10] [INFO ] Computed 77 invariants in 6 ms
Computed 77 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-13621594560500448575.kers
Total runtime 7 ms.
Invariant property smplace_1338 does not hold.
[2026-05-24 20:40:11] [INFO ] Implicit Places using invariants in 568 ms returned [152, 158, 161, 163, 170, 191, 192, 259, 304, 310, 313, 315, 324, 325, 395, 401, 404, 406, 411, 412, 464, 481, 487, 490, 492]
[2026-05-24 20:40:11] [INFO ] Actually due to overlaps returned [191, 324, 411, 192, 325, 412, 152, 158, 163, 304, 310, 315, 395, 401, 406, 481, 487, 492, 170, 259, 464]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 584 ms to find 21 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 535/795 places, 1055/1245 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 519 transition count 1039
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 519 transition count 1039
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 515 transition count 1035
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 515 transition count 1035
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 52 place count 509 transition count 1029
Free-agglomeration rule applied 12 times.
Iterating global reduction 0 with 12 rules applied. Total rules applied 64 place count 509 transition count 1017
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 76 place count 497 transition count 1017
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 78 place count 497 transition count 1015
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 80 place count 495 transition count 1015
Applied a total of 80 rules in 87 ms. Remains 495 /535 variables (removed 40) and now considering 1015/1055 (removed 40) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13858138260409131233.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7194116595775447398.kers'
[2026-05-24 20:40:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13858138260409131233.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7194116595775447398.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1015 rows 495 cols 3927 entries
Finished phase 1 with 194 SingleSign rule and 245 generalized
[2026-05-24 20:40:11] [INFO ] Computed 56 invariants in 7 ms
Computed 56 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-7194116595775447398.kers
Total runtime 10 ms.
[2026-05-24 20:40:11] [INFO ] Implicit Places using invariants in 310 ms returned []
[2026-05-24 20:40:11] [INFO ] Invariant cache hit.
[2026-05-24 20:40:13] [INFO ] Implicit Places using invariants and state equation in 1363 ms returned []
Implicit Place search using SMT with State Equation took 1688 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 495/795 places, 1015/1245 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 3364 ms. Remains : 495/795 places, 1015/1245 transitions.
RANDOM walk for 4000000 steps (79974 resets) in 52701 ms. (75 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40003 steps (210 resets) in 206 ms. (193 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40003 steps (213 resets) in 250 ms. (159 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (212 resets) in 200 ms. (199 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40003 steps (205 resets) in 215 ms. (185 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40003 steps (209 resets) in 225 ms. (177 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40004 steps (200 resets) in 189 ms. (210 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40003 steps (204 resets) in 224 ms. (177 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40003 steps (205 resets) in 172 ms. (231 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (218 resets) in 164 ms. (242 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40004 steps (212 resets) in 176 ms. (226 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40004 steps (217 resets) in 246 ms. (161 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (208 resets) in 196 ms. (203 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (206 resets) in 194 ms. (205 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40000 steps (204 resets) in 176 ms. (225 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40003 steps (211 resets) in 174 ms. (228 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40003 steps (197 resets) in 185 ms. (215 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40004 steps (201 resets) in 179 ms. (222 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40003 steps (209 resets) in 207 ms. (192 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (205 resets) in 172 ms. (231 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40003 steps (221 resets) in 237 ms. (168 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40004 steps (204 resets) in 234 ms. (170 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40004 steps (216 resets) in 192 ms. (207 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40003 steps (203 resets) in 178 ms. (223 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (207 resets) in 220 ms. (181 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (212 resets) in 173 ms. (229 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (209 resets) in 202 ms. (197 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40003 steps (208 resets) in 202 ms. (197 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40003 steps (220 resets) in 173 ms. (229 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40003 steps (213 resets) in 207 ms. (192 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (206 resets) in 192 ms. (207 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40004 steps (208 resets) in 206 ms. (193 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40003 steps (211 resets) in 187 ms. (212 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40004 steps (202 resets) in 176 ms. (226 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40003 steps (213 resets) in 178 ms. (223 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40003 steps (223 resets) in 181 ms. (219 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40003 steps (209 resets) in 162 ms. (245 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40004 steps (203 resets) in 196 ms. (203 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40003 steps (211 resets) in 184 ms. (216 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40004 steps (204 resets) in 174 ms. (228 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (220 resets) in 196 ms. (203 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40003 steps (206 resets) in 197 ms. (202 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40004 steps (201 resets) in 180 ms. (221 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (210 resets) in 170 ms. (233 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40003 steps (207 resets) in 182 ms. (218 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40003 steps (209 resets) in 167 ms. (238 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (198 resets) in 228 ms. (174 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40003 steps (217 resets) in 236 ms. (168 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40003 steps (204 resets) in 165 ms. (240 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40003 steps (215 resets) in 210 ms. (189 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40003 steps (201 resets) in 229 ms. (173 steps per ms) remains 133/133 properties
Detected timeout of ITS tools.
[2026-05-24 20:40:37] [INFO ] Flatten gal took : 93 ms
[2026-05-24 20:40:37] [INFO ] Applying decomposition
[2026-05-24 20:40:37] [INFO ] Flatten gal took : 60 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/graph4572066678372516552.txt' '-o' '/tmp/graph4572066678372516552.bin' '-w' '/tmp/graph4572066678372516552.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4572066678372516552.bin' '-l' '-1' '-v' '-w' '/tmp/graph4572066678372516552.weights' '-q' '0' '-e' '0.001'
[2026-05-24 20:40:37] [INFO ] Decomposing Gal with order
[2026-05-24 20:40:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 20:40:38] [INFO ] Removed a total of 1933 redundant transitions.
[2026-05-24 20:40:38] [INFO ] Flatten gal took : 199 ms
[2026-05-24 20:40:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 65 ms.
[2026-05-24 20:40:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13846882261450434714.gal : 28 ms
[2026-05-24 20:40:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4946684503198850654.prop : 1 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/ReachabilityCardinality13846882261450434714.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4946684503198850654.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/ReachabilityCardinality4946684503198850654.prop.
SDD proceeding with computation,133 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,133 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,133 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,133 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,133 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,133 properties remain. new max is 128
SDD size :1 after 1
SDD proceeding with computation,133 properties remain. new max is 256
SDD size :1 after 3.44725e+18
SDD proceeding with computation,133 properties remain. new max is 512
SDD size :3.44725e+18 after 2.45521e+25
Invariant property smplace_843 does not hold.
Invariant property smplace_842 does not hold.
Invariant property smplace_841 does not hold.
Invariant property smplace_647 does not hold.
Invariant property smplace_646 does not hold.
Invariant property smplace_645 does not hold.
Invariant property smplace_644 does not hold.
Invariant property smplace_643 does not hold.
Invariant property smplace_602 does not hold.
Invariant property smplace_601 does not hold.
Invariant property smplace_600 does not hold.
Invariant property smplace_599 does not hold.
Invariant property smplace_598 does not hold.
Invariant property smplace_460 does not hold.
Invariant property smplace_459 does not hold.
Invariant property smplace_458 does not hold.
Invariant property smplace_448 does not hold.
Invariant property smplace_447 does not hold.
Invariant property smplace_446 does not hold.
Invariant property smplace_432 does not hold.
Invariant property smplace_431 does not hold.
Invariant property smplace_430 does not hold.
Invariant property smplace_425 does not hold.
Invariant property smplace_424 does not hold.
Invariant property smplace_422 does not hold.
Invariant property smplace_421 does not hold.
Invariant property smplace_420 does not hold.
Invariant property smplace_419 does not hold.
Invariant property smplace_418 does not hold.
Invariant property smplace_417 does not hold.
Invariant property smplace_256 does not hold.
Invariant property smplace_255 does not hold.
Invariant property smplace_254 does not hold.
Invariant property smplace_253 does not hold.
Invariant property smplace_252 does not hold.
Invariant property smplace_251 does not hold.
Invariant property smplace_250 does not hold.
Invariant property smplace_249 does not hold.
Invariant property smplace_248 does not hold.
Invariant property smplace_217 does not hold.
Invariant property smplace_216 does not hold.
Invariant property smplace_215 does not hold.
Invariant property smplace_214 does not hold.
Invariant property smplace_213 does not hold.
Invariant property smplace_207 does not hold.
Invariant property smplace_206 does not hold.
Invariant property smplace_205 does not hold.
Invariant property smplace_204 does not hold.
Invariant property smplace_203 does not hold.
Invariant property smplace_72 does not hold.
Invariant property smplace_71 does not hold.
Invariant property smplace_70 does not hold.
Invariant property smplace_69 does not hold.
Invariant property smplace_68 does not hold.
Invariant property smplace_65 does not hold.
Invariant property smplace_64 does not hold.
Invariant property smplace_63 does not hold.
Invariant property smplace_62 does not hold.
Invariant property smplace_61 does not hold.
Invariant property smplace_59 does not hold.
Invariant property smplace_58 does not hold.
Invariant property smplace_57 does not hold.
Invariant property smplace_56 does not hold.
Invariant property smplace_55 does not hold.
Invariant property smplace_51 does not hold.
Invariant property smplace_50 does not hold.
Invariant property smplace_49 does not hold.
SDD proceeding with computation,66 properties remain. new max is 512
SDD size :2.45521e+25 after 6.92658e+27
Interrupted probabilistic random walk after 4129561 steps, run timeout after 48001 ms. (steps per millisecond=86 ) properties seen :95 out of 133
Probabilistic random walk after 4129561 steps, saw 1028363 distinct states, run finished after 48001 ms. (steps per millisecond=86 ) properties seen :95
[2026-05-24 20:41:18] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (OVERLAPS) 111/149 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 4/153 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (OVERLAPS) 84/237 variables, 16/25 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (OVERLAPS) 39/276 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/276 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (OVERLAPS) 24/300 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/300 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 11 (OVERLAPS) 30/330 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/330 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 13 (OVERLAPS) 6/336 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/336 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 15 (OVERLAPS) 143/479 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/479 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 17 (OVERLAPS) 1/480 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/480 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 19 (OVERLAPS) 15/495 variables, 6/56 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/495 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 21 (OVERLAPS) 1015/1510 variables, 495/551 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1510 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 23 (OVERLAPS) 0/1510 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1510/1510 variables, and 551 constraints, problems are : Problem set: 0 solved, 38 unsolved in 6514 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 495/495 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (OVERLAPS) 111/149 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 4/153 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (OVERLAPS) 84/237 variables, 16/25 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (OVERLAPS) 39/276 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/276 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (OVERLAPS) 24/300 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/300 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 12 (OVERLAPS) 30/330 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/330 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 14 (OVERLAPS) 6/336 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/336 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 16 (OVERLAPS) 143/479 variables, 18/50 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/479 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 18 (OVERLAPS) 1/480 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/480 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 20 (OVERLAPS) 15/495 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/495 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 22 (OVERLAPS) 1015/1510 variables, 495/552 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1510 variables, 38/590 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1510 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 25 (OVERLAPS) 0/1510 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1510/1510 variables, and 590 constraints, problems are : Problem set: 0 solved, 38 unsolved in 19832 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 495/495 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 26375ms problems are : Problem set: 0 solved, 38 unsolved
Fused 38 Parikh solutions to 33 different solutions.
Parikh walk visited 0 properties in 4068 ms.
Support contains 38 out of 495 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 495/495 places, 1015/1015 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 495 transition count 976
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 78 place count 456 transition count 976
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 78 place count 456 transition count 960
Deduced a syphon composed of 16 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 114 place count 436 transition count 960
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 5 rules applied. Total rules applied 119 place count 435 transition count 956
Reduce places removed 4 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
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 3 with 6 rules applied. Total rules applied 125 place count 430 transition count 955
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 126 place count 429 transition count 955
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 126 place count 429 transition count 954
Deduced a syphon composed of 1 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 129 place count 427 transition count 954
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 129 place count 427 transition count 953
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 131 place count 426 transition count 953
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 132 place count 425 transition count 952
Iterating global reduction 5 with 1 rules applied. Total rules applied 133 place count 425 transition count 952
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 21 rules applied. Total rules applied 154 place count 413 transition count 943
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 2 rules applied. Total rules applied 156 place count 413 transition count 941
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 158 place count 411 transition count 941
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 3 Pre rules applied. Total rules applied 158 place count 411 transition count 938
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 164 place count 408 transition count 938
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 7 with 3 rules applied. Total rules applied 167 place count 405 transition count 938
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 167 place count 405 transition count 937
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 169 place count 404 transition count 937
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 175 place count 401 transition count 934
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 176 place count 401 transition count 933
Free-agglomeration rule applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 178 place count 401 transition count 931
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 182 place count 399 transition count 929
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 183 place count 399 transition count 928
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 185 place count 398 transition count 927
Applied a total of 185 rules in 100 ms. Remains 398 /495 variables (removed 97) and now considering 927/1015 (removed 88) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 398/495 places, 927/1015 transitions.
RANDOM walk for 4000000 steps (78652 resets) in 30481 ms. (131 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (2201 resets) in 1137 ms. (351 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (2167 resets) in 1036 ms. (385 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400002 steps (2176 resets) in 1213 ms. (329 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (2161 resets) in 1163 ms. (343 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (2147 resets) in 1038 ms. (384 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (2199 resets) in 1161 ms. (344 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (2176 resets) in 1204 ms. (331 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400001 steps (2185 resets) in 1025 ms. (389 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400002 steps (2180 resets) in 1086 ms. (367 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400002 steps (2186 resets) in 1085 ms. (368 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (2171 resets) in 1162 ms. (343 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (2167 resets) in 1126 ms. (354 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (2184 resets) in 1043 ms. (383 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (2157 resets) in 1218 ms. (328 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (2169 resets) in 1016 ms. (393 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (2195 resets) in 1129 ms. (353 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400002 steps (2134 resets) in 1015 ms. (393 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400002 steps (2166 resets) in 1172 ms. (341 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400002 steps (2151 resets) in 1106 ms. (361 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (2184 resets) in 1099 ms. (363 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400002 steps (2131 resets) in 1027 ms. (389 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (2152 resets) in 1166 ms. (342 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400001 steps (2163 resets) in 996 ms. (401 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400002 steps (2193 resets) in 1138 ms. (351 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (2210 resets) in 1015 ms. (393 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400002 steps (2148 resets) in 1257 ms. (317 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (2160 resets) in 1041 ms. (383 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400001 steps (2190 resets) in 1036 ms. (385 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (2178 resets) in 1187 ms. (336 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (2128 resets) in 1060 ms. (377 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400001 steps (2199 resets) in 1185 ms. (337 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (2156 resets) in 1006 ms. (397 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (2172 resets) in 1230 ms. (324 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400002 steps (2160 resets) in 991 ms. (403 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (2186 resets) in 1024 ms. (390 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (2151 resets) in 1112 ms. (359 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (2186 resets) in 1078 ms. (370 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400002 steps (2177 resets) in 1069 ms. (373 steps per ms) remains 38/38 properties
Interrupted probabilistic random walk after 6333974 steps, run timeout after 69001 ms. (steps per millisecond=91 ) properties seen :30 out of 38
Probabilistic random walk after 6333974 steps, saw 1720094 distinct states, run finished after 69001 ms. (steps per millisecond=91 ) properties seen :30
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4709080958375409296.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6460316359459621739.kers'
[2026-05-24 20:43:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4709080958375409296.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6460316359459621739.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 927 rows 397 cols 3709 entries
Finished phase 1 with 132 SingleSign rule and 223 generalized
[2026-05-24 20:43:21] [INFO ] Computed 43 invariants in 6 ms
Computed 43 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-6460316359459621739.kers
Total runtime 7 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 6/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 1/15 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 21/36 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 82/118 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/118 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 25/143 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/143 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 61/204 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/204 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 37/241 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/241 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 24/265 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/265 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 30/295 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/295 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (OVERLAPS) 6/301 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/301 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (OVERLAPS) 91/392 variables, 14/41 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/392 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (OVERLAPS) 6/398 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/398 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 25 (OVERLAPS) 927/1325 variables, 398/441 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1325 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 27 (OVERLAPS) 0/1325 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1325/1325 variables, and 441 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1364 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 398/398 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 6/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 1/15 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 21/36 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 82/118 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/118 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 25/143 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/143 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 61/204 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/204 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 37/241 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/241 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 24/265 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/265 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 30/295 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/295 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (OVERLAPS) 6/301 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/301 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (OVERLAPS) 91/392 variables, 14/41 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/392 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (OVERLAPS) 6/398 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/398 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 25 (OVERLAPS) 927/1325 variables, 398/441 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1325 variables, 8/449 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1325 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 28 (OVERLAPS) 0/1325 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1325/1325 variables, and 449 constraints, problems are : Problem set: 0 solved, 8 unsolved in 4135 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 398/398 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5521ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 2613 ms.
Support contains 8 out of 398 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 398/398 places, 927/927 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 398 transition count 907
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 40 place count 378 transition count 907
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 40 place count 378 transition count 903
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 49 place count 373 transition count 903
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 49 place count 373 transition count 902
Deduced a syphon composed of 1 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 52 place count 371 transition count 902
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 52 place count 371 transition count 901
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 54 place count 370 transition count 901
Applied a total of 54 rules in 21 ms. Remains 370 /398 variables (removed 28) and now considering 901/927 (removed 26) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 370/398 places, 901/927 transitions.
RANDOM walk for 4000000 steps (78443 resets) in 18893 ms. (211 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000004 steps (21620 resets) in 6507 ms. (614 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000004 steps (21728 resets) in 6482 ms. (616 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000003 steps (21601 resets) in 6140 ms. (651 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000003 steps (21612 resets) in 6232 ms. (641 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000004 steps (21715 resets) in 7192 ms. (556 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000004 steps (21607 resets) in 6169 ms. (648 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000003 steps (21725 resets) in 6614 ms. (604 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000003 steps (21835 resets) in 6522 ms. (613 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 6479374 steps, run timeout after 66001 ms. (steps per millisecond=98 ) properties seen :0 out of 8
Probabilistic random walk after 6479374 steps, saw 1764130 distinct states, run finished after 66001 ms. (steps per millisecond=98 ) 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-2501681410283310287.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18187429724946656886.kers'
[2026-05-24 20:44:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2501681410283310287.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18187429724946656886.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 901 rows 369 cols 3653 entries
Finished phase 1 with 106 SingleSign rule and 223 generalized
[2026-05-24 20:44:58] [INFO ] Computed 41 invariants in 5 ms
Computed 41 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-18187429724946656886.kers
Total runtime 7 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 6/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 1/15 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 19/34 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/34 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 31/65 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/65 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 25/90 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/90 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 70/160 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/160 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 53/213 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/213 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 24/237 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/237 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 30/267 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/267 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (OVERLAPS) 6/273 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/273 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (OVERLAPS) 91/364 variables, 14/39 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/364 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (OVERLAPS) 6/370 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/370 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 25 (OVERLAPS) 901/1271 variables, 370/411 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1271 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 27 (OVERLAPS) 0/1271 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1271/1271 variables, and 411 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1479 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 370/370 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 6/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 1/15 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 19/34 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/34 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 31/65 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/65 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 25/90 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/90 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 70/160 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/160 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 53/213 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/213 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 24/237 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/237 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 30/267 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/267 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (OVERLAPS) 6/273 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/273 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (OVERLAPS) 91/364 variables, 14/39 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/364 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/364 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 24 (OVERLAPS) 6/370 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/370 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/370 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 27 (OVERLAPS) 901/1271 variables, 370/413 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1271 variables, 8/421 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1271 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 30 (OVERLAPS) 0/1271 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1271/1271 variables, and 421 constraints, problems are : Problem set: 0 solved, 8 unsolved in 3812 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 370/370 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5314ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 1588 ms.
Support contains 8 out of 370 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 370/370 places, 901/901 transitions.
Applied a total of 0 rules in 10 ms. Remains 370 /370 variables (removed 0) and now considering 901/901 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 370/370 places, 901/901 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 370/370 places, 901/901 transitions.
Applied a total of 0 rules in 11 ms. Remains 370 /370 variables (removed 0) and now considering 901/901 (removed 0) transitions.
[2026-05-24 20:45:04] [INFO ] Invariant cache hit.
[2026-05-24 20:45:05] [INFO ] Implicit Places using invariants in 327 ms returned [17, 18, 77]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 332 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 367/370 places, 901/901 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 367 transition count 900
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 366 transition count 900
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 364 transition count 898
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 364 transition count 897
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 8 place count 363 transition count 897
Applied a total of 8 rules in 56 ms. Remains 363 /367 variables (removed 4) and now considering 897/901 (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-6539931119485666380.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17888688906140811506.kers'
[2026-05-24 20:45:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6539931119485666380.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17888688906140811506.kers]
Culled 0 columns in 5 ms.
// Phase 1: matrix 897 rows 363 cols 3656 entries
Finished phase 1 with 100 SingleSign rule and 225 generalized
[2026-05-24 20:45:05] [INFO ] Computed 38 invariants in 20 ms
Computed 38 P flows in 23 ms.
Exported basis to /tmp/petrispot-output-17888688906140811506.kers
Total runtime 24 ms.
[2026-05-24 20:45:05] [INFO ] Implicit Places using invariants in 451 ms returned []
[2026-05-24 20:45:05] [INFO ] Invariant cache hit.
[2026-05-24 20:45:06] [INFO ] Implicit Places using invariants and state equation in 839 ms returned []
Implicit Place search using SMT with State Equation took 1293 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 363/370 places, 897/901 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1693 ms. Remains : 363/370 places, 897/901 transitions.
RANDOM walk for 4000000 steps (78388 resets) in 17763 ms. (225 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000003 steps (21752 resets) in 6471 ms. (618 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000003 steps (21806 resets) in 5899 ms. (677 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000003 steps (21869 resets) in 6046 ms. (661 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000004 steps (21802 resets) in 6174 ms. (647 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000001 steps (21673 resets) in 6837 ms. (584 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000004 steps (21778 resets) in 6034 ms. (662 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000004 steps (21625 resets) in 6382 ms. (626 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000002 steps (21696 resets) in 6160 ms. (649 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 5818302 steps, run timeout after 57001 ms. (steps per millisecond=102 ) properties seen :0 out of 8
Probabilistic random walk after 5818302 steps, saw 1420462 distinct states, run finished after 57001 ms. (steps per millisecond=102 ) properties seen :0
[2026-05-24 20:46:22] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 2/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 20/30 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 13/43 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 78/121 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 53/174 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/174 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 24/198 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/198 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 30/228 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/228 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 6/234 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/234 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 123/357 variables, 17/36 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/357 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (OVERLAPS) 6/363 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/363 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (OVERLAPS) 897/1260 variables, 363/401 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1260 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (OVERLAPS) 0/1260 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1260/1260 variables, and 401 constraints, problems are : Problem set: 0 solved, 8 unsolved in 943 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 363/363 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 2/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 20/30 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 13/43 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 78/121 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 53/174 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/174 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 24/198 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/198 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 30/228 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/228 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 6/234 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/234 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 123/357 variables, 17/36 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/357 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (OVERLAPS) 6/363 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/363 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (OVERLAPS) 897/1260 variables, 363/401 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1260 variables, 8/409 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1260 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 24 (OVERLAPS) 0/1260 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1260/1260 variables, and 409 constraints, problems are : Problem set: 0 solved, 8 unsolved in 2731 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 363/363 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3696ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 2956 ms.
Support contains 8 out of 363 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 363/363 places, 897/897 transitions.
Applied a total of 0 rules in 12 ms. Remains 363 /363 variables (removed 0) and now considering 897/897 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 363/363 places, 897/897 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 363/363 places, 897/897 transitions.
Applied a total of 0 rules in 11 ms. Remains 363 /363 variables (removed 0) and now considering 897/897 (removed 0) transitions.
[2026-05-24 20:46:29] [INFO ] Invariant cache hit.
[2026-05-24 20:46:29] [INFO ] Implicit Places using invariants in 249 ms returned []
[2026-05-24 20:46:29] [INFO ] Invariant cache hit.
[2026-05-24 20:46:30] [INFO ] Implicit Places using invariants and state equation in 922 ms returned []
Implicit Place search using SMT with State Equation took 1174 ms to find 0 implicit places.
[2026-05-24 20:46:30] [INFO ] Redundant transitions in 71 ms returned []
Running 872 sub problems to find dead transitions.
[2026-05-24 20:46:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/362 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 872 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/362 variables, 29/36 constraints. Problems are: Problem set: 0 solved, 872 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/362 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 872 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 362/1260 variables, and 37 constraints, problems are : Problem set: 0 solved, 872 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 7/9 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 0/363 constraints, PredecessorRefiner: 872/872 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 872 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/362 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 872 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/362 variables, 29/36 constraints. Problems are: Problem set: 0 solved, 872 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/362 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 872 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/362 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 872 unsolved
At refinement iteration 4 (OVERLAPS) 1/363 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 872 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 363/1260 variables, and 40 constraints, problems are : Problem set: 0 solved, 872 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 0/363 constraints, PredecessorRefiner: 0/872 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60390ms problems are : Problem set: 0 solved, 872 unsolved
Search for dead transitions found 0 dead transitions in 60395ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61685 ms. Remains : 363/363 places, 897/897 transitions.
RANDOM walk for 400000 steps (7865 resets) in 3623 ms. (110 steps per ms) remains 8/8 properties
Running SMT prover for 8 properties.
[2026-05-24 20:47:32] [INFO ] Invariant cache hit.
[2026-05-24 20:47:32] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2026-05-24 20:47:32] [INFO ] [Real]Absence check using 9 positive and 29 generalized place invariants in 9 ms returned sat
[2026-05-24 20:47:32] [INFO ] After 349ms SMT Verify possible using state equation in real domain returned unsat :0 sat :8
TRAPS : Iteration 0
[2026-05-24 20:47:33] [INFO ] After 838ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:8
[2026-05-24 20:47:33] [INFO ] After 924ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2026-05-24 20:47:33] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2026-05-24 20:47:33] [INFO ] [Nat]Absence check using 9 positive and 29 generalized place invariants in 8 ms returned sat
[2026-05-24 20:47:34] [INFO ] After 1390ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
TRAPS : Iteration 0
[2026-05-24 20:47:35] [INFO ] After 2046ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
[2026-05-24 20:47:35] [INFO ] After 2238ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
RANDOM walk for 4000000 steps (78908 resets) in 20387 ms. (196 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000003 steps (21596 resets) in 6262 ms. (638 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000004 steps (21736 resets) in 6249 ms. (640 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000004 steps (21625 resets) in 6327 ms. (632 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000002 steps (21670 resets) in 6431 ms. (621 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000001 steps (21614 resets) in 5952 ms. (671 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000002 steps (21784 resets) in 7069 ms. (565 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000003 steps (21642 resets) in 6180 ms. (647 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000002 steps (21596 resets) in 5880 ms. (680 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 6691684 steps, run timeout after 66004 ms. (steps per millisecond=101 ) properties seen :0 out of 8
Probabilistic random walk after 6691684 steps, saw 1591094 distinct states, run finished after 66006 ms. (steps per millisecond=101 ) properties seen :0
[2026-05-24 20:49:04] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 2/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 20/30 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 13/43 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 78/121 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 53/174 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/174 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 24/198 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/198 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 30/228 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/228 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 6/234 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/234 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 123/357 variables, 17/36 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/357 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (OVERLAPS) 6/363 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/363 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (OVERLAPS) 897/1260 variables, 363/401 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1260 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (OVERLAPS) 0/1260 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1260/1260 variables, and 401 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1155 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 363/363 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 2/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 20/30 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 13/43 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 78/121 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 53/174 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/174 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 24/198 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/198 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 30/228 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/228 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 6/234 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/234 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 123/357 variables, 17/36 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/357 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (OVERLAPS) 6/363 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/363 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (OVERLAPS) 897/1260 variables, 363/401 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1260 variables, 8/409 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1260 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 24 (OVERLAPS) 0/1260 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1260/1260 variables, and 409 constraints, problems are : Problem set: 0 solved, 8 unsolved in 3084 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 363/363 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4249ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 3301 ms.
Support contains 8 out of 363 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 363/363 places, 897/897 transitions.
Applied a total of 0 rules in 12 ms. Remains 363 /363 variables (removed 0) and now considering 897/897 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 363/363 places, 897/897 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 363/363 places, 897/897 transitions.
Applied a total of 0 rules in 24 ms. Remains 363 /363 variables (removed 0) and now considering 897/897 (removed 0) transitions.
[2026-05-24 20:49:11] [INFO ] Invariant cache hit.
[2026-05-24 20:49:12] [INFO ] Implicit Places using invariants in 302 ms returned []
[2026-05-24 20:49:12] [INFO ] Invariant cache hit.
[2026-05-24 20:49:13] [INFO ] Implicit Places using invariants and state equation in 1558 ms returned []
Implicit Place search using SMT with State Equation took 1876 ms to find 0 implicit places.
[2026-05-24 20:49:13] [INFO ] Redundant transitions in 31 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1952 ms. Remains : 363/363 places, 897/897 transitions.
RANDOM walk for 400000 steps (7955 resets) in 1952 ms. (204 steps per ms) remains 8/8 properties
Running SMT prover for 8 properties.
[2026-05-24 20:49:14] [INFO ] Invariant cache hit.
[2026-05-24 20:49:14] [INFO ] [Real]Absence check using 9 positive place invariants in 16 ms returned sat
[2026-05-24 20:49:14] [INFO ] [Real]Absence check using 9 positive and 29 generalized place invariants in 10 ms returned sat
[2026-05-24 20:49:15] [INFO ] After 601ms SMT Verify possible using state equation in real domain returned unsat :0 sat :8
TRAPS : Iteration 0
[2026-05-24 20:49:15] [INFO ] After 1127ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:8
[2026-05-24 20:49:15] [INFO ] After 1210ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2026-05-24 20:49:15] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2026-05-24 20:49:15] [INFO ] [Nat]Absence check using 9 positive and 29 generalized place invariants in 33 ms returned sat
[2026-05-24 20:49:16] [INFO ] After 353ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
TRAPS : Iteration 0
[2026-05-24 20:49:16] [INFO ] After 713ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
[2026-05-24 20:49:16] [INFO ] After 848ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
RANDOM walk for 40000 steps (787 resets) in 167 ms. (238 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (217 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 589549 steps, run timeout after 3001 ms. (steps per millisecond=196 ) properties seen :0 out of 1
Probabilistic random walk after 589549 steps, saw 207065 distinct states, run finished after 3002 ms. (steps per millisecond=196 ) properties seen :0
[2026-05-24 20:49:19] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
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) 6/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/13 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 17/30 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 13/43 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/43 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 78/121 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/121 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 53/174 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/174 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 24/198 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/198 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 30/228 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/228 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/234 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/234 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 123/357 variables, 17/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/357 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 6/363 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/363 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 897/1260 variables, 363/401 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1260 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1260 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1260/1260 variables, and 401 constraints, problems are : Problem set: 0 solved, 1 unsolved in 575 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 363/363 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) 6/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/13 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 17/30 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 13/43 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/43 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 78/121 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/121 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 53/174 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/174 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 24/198 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/198 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 30/228 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/228 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/234 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/234 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 123/357 variables, 17/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/357 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/357 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 6/363 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/363 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 897/1260 variables, 363/402 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1260 variables, 1/403 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1260 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1260 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1260/1260 variables, and 403 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1131 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 363/363 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1728ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 71 ms.
Support contains 1 out of 363 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 363/363 places, 897/897 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 363 transition count 894
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 360 transition count 894
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 360 transition count 893
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 359 transition count 893
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 357 transition count 891
Applied a total of 12 rules in 37 ms. Remains 357 /363 variables (removed 6) and now considering 891/897 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 357/363 places, 891/897 transitions.
RANDOM walk for 40000 steps (803 resets) in 198 ms. (201 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (212 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 606070 steps, run timeout after 3001 ms. (steps per millisecond=201 ) properties seen :0 out of 1
Probabilistic random walk after 606070 steps, saw 235117 distinct states, run finished after 3001 ms. (steps per millisecond=201 ) 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-2467711688700669378.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9707260401766092731.kers'
[2026-05-24 20:49:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2467711688700669378.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9707260401766092731.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 891 rows 357 cols 3644 entries
Finished phase 1 with 94 SingleSign rule and 225 generalized
[2026-05-24 20:49:24] [INFO ] Computed 38 invariants in 7 ms
Computed 38 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-9707260401766092731.kers
Total runtime 9 ms.
All remaining problems are real, not stopping.
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) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/8 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 16/24 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 13/37 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/37 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 78/115 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/115 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 53/168 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/168 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 24/192 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/192 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 30/222 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/222 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/228 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/228 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 123/351 variables, 17/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/351 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 6/357 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/357 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 891/1248 variables, 357/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1248 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1248 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1248/1248 variables, and 395 constraints, problems are : Problem set: 0 solved, 1 unsolved in 732 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 357/357 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) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/8 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 16/24 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 13/37 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/37 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 78/115 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/115 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 53/168 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/168 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 24/192 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/192 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 30/222 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/222 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/228 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/228 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 123/351 variables, 17/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/351 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 6/357 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/357 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 891/1248 variables, 357/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1248 variables, 1/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1248 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1248 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1248/1248 variables, and 396 constraints, problems are : Problem set: 0 solved, 1 unsolved in 631 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 357/357 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1393ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 55 ms.
Support contains 1 out of 357 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 357/357 places, 891/891 transitions.
Applied a total of 0 rules in 11 ms. Remains 357 /357 variables (removed 0) and now considering 891/891 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 357/357 places, 891/891 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 357/357 places, 891/891 transitions.
Applied a total of 0 rules in 11 ms. Remains 357 /357 variables (removed 0) and now considering 891/891 (removed 0) transitions.
[2026-05-24 20:49:25] [INFO ] Invariant cache hit.
[2026-05-24 20:49:26] [INFO ] Implicit Places using invariants in 583 ms returned [87]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 587 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 356/357 places, 891/891 transitions.
Applied a total of 0 rules in 11 ms. Remains 356 /356 variables (removed 0) and now considering 891/891 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 609 ms. Remains : 356/357 places, 891/891 transitions.
RANDOM walk for 40000 steps (756 resets) in 124 ms. (320 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (211 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 642796 steps, run timeout after 3001 ms. (steps per millisecond=214 ) properties seen :0 out of 1
Probabilistic random walk after 642796 steps, saw 257110 distinct states, run finished after 3001 ms. (steps per millisecond=214 ) 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-14779632424292936805.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18340446660998271022.kers'
[2026-05-24 20:49:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14779632424292936805.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18340446660998271022.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 891 rows 356 cols 3642 entries
Finished phase 1 with 94 SingleSign rule and 225 generalized
[2026-05-24 20:49:29] [INFO ] Computed 37 invariants in 6 ms
Computed 37 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-18340446660998271022.kers
Total runtime 7 ms.
All remaining problems are real, not stopping.
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) 6/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/20 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 40/60 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 29/89 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/89 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 73/162 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 37/199 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/199 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 24/223 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/223 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 30/253 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/253 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/259 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/259 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 91/350 variables, 14/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/350 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 6/356 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/356 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 891/1247 variables, 356/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1247 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1247 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1247/1247 variables, and 393 constraints, problems are : Problem set: 0 solved, 1 unsolved in 624 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 356/356 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) 6/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/20 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 40/60 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 29/89 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/89 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 73/162 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 37/199 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/199 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 24/223 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/223 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 30/253 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/253 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/259 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/259 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 91/350 variables, 14/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/350 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 6/356 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/356 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 891/1247 variables, 356/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1247 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1247 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1247 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1247/1247 variables, and 394 constraints, problems are : Problem set: 0 solved, 1 unsolved in 918 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1586ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 47 ms.
Support contains 1 out of 356 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 356/356 places, 891/891 transitions.
Applied a total of 0 rules in 20 ms. Remains 356 /356 variables (removed 0) and now considering 891/891 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 356/356 places, 891/891 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 356/356 places, 891/891 transitions.
Applied a total of 0 rules in 11 ms. Remains 356 /356 variables (removed 0) and now considering 891/891 (removed 0) transitions.
[2026-05-24 20:49:31] [INFO ] Invariant cache hit.
[2026-05-24 20:49:31] [INFO ] Implicit Places using invariants in 432 ms returned []
[2026-05-24 20:49:31] [INFO ] Invariant cache hit.
[2026-05-24 20:49:33] [INFO ] Implicit Places using invariants and state equation in 1391 ms returned []
Implicit Place search using SMT with State Equation took 1838 ms to find 0 implicit places.
[2026-05-24 20:49:33] [INFO ] Redundant transitions in 6 ms returned []
Running 866 sub problems to find dead transitions.
[2026-05-24 20:49:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 866 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/355 variables, 27/35 constraints. Problems are: Problem set: 0 solved, 866 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 355/1247 variables, and 35 constraints, problems are : Problem set: 0 solved, 866 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 8/10 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 0/356 constraints, PredecessorRefiner: 866/866 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 866 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 866 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/355 variables, 27/35 constraints. Problems are: Problem set: 0 solved, 866 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 866 unsolved
At refinement iteration 3 (OVERLAPS) 1/356 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 866 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 356/1247 variables, and 38 constraints, problems are : Problem set: 0 solved, 866 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 0/356 constraints, PredecessorRefiner: 0/866 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60327ms problems are : Problem set: 0 solved, 866 unsolved
Search for dead transitions found 0 dead transitions in 60329ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62192 ms. Remains : 356/356 places, 891/891 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 10 ms. Remains 356 /356 variables (removed 0) and now considering 891/891 (removed 0) transitions.
Running SMT prover for 1 properties.
[2026-05-24 20:50:33] [INFO ] Invariant cache hit.
[2026-05-24 20:50:33] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-24 20:50:33] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2026-05-24 20:50:33] [INFO ] [Nat]Absence check using 10 positive and 27 generalized place invariants in 19 ms returned sat
[2026-05-24 20:50:33] [INFO ] After 247ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 20:50:34] [INFO ] After 314ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 20:50:34] [INFO ] After 466ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 541 ms.
RANDOM walk for 40000 steps (787 resets) in 121 ms. (327 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (219 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 643437 steps, run timeout after 3001 ms. (steps per millisecond=214 ) properties seen :0 out of 1
Probabilistic random walk after 643437 steps, saw 217979 distinct states, run finished after 3001 ms. (steps per millisecond=214 ) 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-3729668724516718498.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14845724475369638644.kers'
[2026-05-24 20:50:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3729668724516718498.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14845724475369638644.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 897 rows 363 cols 3656 entries
Finished phase 1 with 100 SingleSign rule and 225 generalized
[2026-05-24 20:50:37] [INFO ] Computed 38 invariants in 18 ms
Computed 38 P flows in 18 ms.
Exported basis to /tmp/petrispot-output-14845724475369638644.kers
Total runtime 20 ms.
All remaining problems are real, not stopping.
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) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/30 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/43 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 78/121 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 53/174 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/174 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 24/198 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/198 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 30/228 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/228 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/234 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/234 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 123/357 variables, 17/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/357 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/357 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 6/363 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/363 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 897/1260 variables, 363/402 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1260 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1260 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1260/1260 variables, and 402 constraints, problems are : Problem set: 0 solved, 1 unsolved in 664 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 363/363 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) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/30 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/43 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 78/121 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 53/174 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/174 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 24/198 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/198 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 30/228 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/228 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/234 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/234 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 123/357 variables, 17/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/357 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/357 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/357 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 6/363 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/363 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Detected timeout of ITS tools.
At refinement iteration 23 (OVERLAPS) 897/1260 variables, 363/403 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1260 variables, 1/404 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1260 variables, 1/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1260 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1260 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1260/1260 variables, and 405 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1311 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 363/363 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2010ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 96 ms.
Support contains 1 out of 363 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 363/363 places, 897/897 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 363 transition count 894
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 360 transition count 894
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 360 transition count 893
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 359 transition count 893
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 357 transition count 891
Applied a total of 12 rules in 23 ms. Remains 357 /363 variables (removed 6) and now considering 891/897 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 357/363 places, 891/897 transitions.
RANDOM walk for 40000 steps (795 resets) in 111 ms. (357 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (220 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 650401 steps, run timeout after 3001 ms. (steps per millisecond=216 ) properties seen :0 out of 1
Probabilistic random walk after 650401 steps, saw 262911 distinct states, run finished after 3001 ms. (steps per millisecond=216 ) 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-13868301883750683856.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5775300729285547176.kers'
[2026-05-24 20:50:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13868301883750683856.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5775300729285547176.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 891 rows 357 cols 3644 entries
Finished phase 1 with 94 SingleSign rule and 225 generalized
[2026-05-24 20:50:42] [INFO ] Computed 38 invariants in 18 ms
Computed 38 P flows in 19 ms.
Exported basis to /tmp/petrispot-output-5775300729285547176.kers
Total runtime 21 ms.
All remaining problems are real, not stopping.
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) 20/24 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/37 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 78/115 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 53/168 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/168 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 24/192 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/192 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 30/222 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/222 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/228 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/228 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 123/351 variables, 17/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/351 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 6/357 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/357 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 891/1248 variables, 357/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1248 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1248 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1248/1248 variables, and 395 constraints, problems are : Problem set: 0 solved, 1 unsolved in 608 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 357/357 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) 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) 20/24 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/37 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 78/115 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 53/168 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/168 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 24/192 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/192 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 30/222 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/222 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/228 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/228 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 123/351 variables, 17/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/351 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/351 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 6/357 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/357 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 891/1248 variables, 357/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1248 variables, 1/397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1248 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1248 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1248/1248 variables, and 397 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1166 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 357/357 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1862ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 188 ms.
Support contains 1 out of 357 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 357/357 places, 891/891 transitions.
Applied a total of 0 rules in 9 ms. Remains 357 /357 variables (removed 0) and now considering 891/891 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 357/357 places, 891/891 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 357/357 places, 891/891 transitions.
Applied a total of 0 rules in 10 ms. Remains 357 /357 variables (removed 0) and now considering 891/891 (removed 0) transitions.
[2026-05-24 20:50:44] [INFO ] Invariant cache hit.
[2026-05-24 20:50:44] [INFO ] Implicit Places using invariants in 462 ms returned []
[2026-05-24 20:50:44] [INFO ] Invariant cache hit.
[2026-05-24 20:50:45] [INFO ] Implicit Places using invariants and state equation in 821 ms returned []
Implicit Place search using SMT with State Equation took 1298 ms to find 0 implicit places.
[2026-05-24 20:50:45] [INFO ] Redundant transitions in 19 ms returned []
Running 866 sub problems to find dead transitions.
[2026-05-24 20:50:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 866 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 29/36 constraints. Problems are: Problem set: 0 solved, 866 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/356 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 866 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (OVERLAPS) 1/357 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 866 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 357/1248 variables, and 38 constraints, problems are : Problem set: 0 solved, 866 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 0/357 constraints, PredecessorRefiner: 866/866 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 866 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 866 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 29/36 constraints. Problems are: Problem set: 0 solved, 866 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/356 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 866 unsolved
At refinement iteration 3 (OVERLAPS) 1/357 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 866 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 357/1248 variables, and 39 constraints, problems are : Problem set: 0 solved, 866 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 0/357 constraints, PredecessorRefiner: 0/866 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60296ms problems are : Problem set: 0 solved, 866 unsolved
Search for dead transitions found 0 dead transitions in 60299ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61644 ms. Remains : 357/357 places, 891/891 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 15 ms. Remains 357 /357 variables (removed 0) and now considering 891/891 (removed 0) transitions.
Running SMT prover for 1 properties.
[2026-05-24 20:51:46] [INFO ] Invariant cache hit.
[2026-05-24 20:51:46] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-24 20:51:46] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2026-05-24 20:51:46] [INFO ] [Nat]Absence check using 9 positive and 29 generalized place invariants in 15 ms returned sat
[2026-05-24 20:51:46] [INFO ] After 345ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 20:51:46] [INFO ] After 406ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 20:51:46] [INFO ] After 585ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 716 ms.
RANDOM walk for 40000 steps (766 resets) in 163 ms. (243 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (211 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 647027 steps, run timeout after 3001 ms. (steps per millisecond=215 ) properties seen :0 out of 1
Probabilistic random walk after 647027 steps, saw 218752 distinct states, run finished after 3001 ms. (steps per millisecond=215 ) 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-10829197553545800625.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6535989346580399414.kers'
[2026-05-24 20:51:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10829197553545800625.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6535989346580399414.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 897 rows 363 cols 3656 entries
Finished phase 1 with 100 SingleSign rule and 225 generalized
[2026-05-24 20:51:49] [INFO ] Computed 38 invariants in 19 ms
Computed 38 P flows in 20 ms.
Exported basis to /tmp/petrispot-output-6535989346580399414.kers
Total runtime 23 ms.
All remaining problems are real, not stopping.
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) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/30 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/43 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 78/121 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 53/174 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/174 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 24/198 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/198 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 30/228 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/228 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/234 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/234 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 123/357 variables, 17/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/357 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 6/363 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/363 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 897/1260 variables, 363/401 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1260 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1260 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1260/1260 variables, and 401 constraints, problems are : Problem set: 0 solved, 1 unsolved in 696 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 363/363 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) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/30 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/43 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 78/121 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 53/174 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/174 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 24/198 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/198 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 30/228 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/228 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/234 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/234 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 123/357 variables, 17/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/357 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 6/363 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/363 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 897/1260 variables, 363/401 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1260 variables, 1/402 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1260 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1260 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1260/1260 variables, and 402 constraints, problems are : Problem set: 0 solved, 1 unsolved in 735 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 363/363 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1491ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 146 ms.
Support contains 1 out of 363 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 363/363 places, 897/897 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 363 transition count 895
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 361 transition count 895
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 361 transition count 894
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 360 transition count 894
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 12 place count 357 transition count 891
Applied a total of 12 rules in 30 ms. Remains 357 /363 variables (removed 6) and now considering 891/897 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 357/363 places, 891/897 transitions.
RANDOM walk for 40000 steps (769 resets) in 121 ms. (327 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (223 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 651629 steps, run timeout after 3001 ms. (steps per millisecond=217 ) properties seen :0 out of 1
Probabilistic random walk after 651629 steps, saw 263825 distinct states, run finished after 3001 ms. (steps per millisecond=217 ) 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-4052000245833981468.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6577353429982765295.kers'
[2026-05-24 20:51:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4052000245833981468.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6577353429982765295.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 891 rows 357 cols 3644 entries
Finished phase 1 with 94 SingleSign rule and 225 generalized
[2026-05-24 20:51:54] [INFO ] Computed 38 invariants in 28 ms
Computed 38 P flows in 29 ms.
Exported basis to /tmp/petrispot-output-6577353429982765295.kers
Total runtime 32 ms.
All remaining problems are real, not stopping.
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) 20/24 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/37 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 78/115 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 53/168 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/168 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 24/192 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/192 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 30/222 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/222 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/228 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/228 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 123/351 variables, 17/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/351 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/351 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 6/357 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/357 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 891/1248 variables, 357/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1248 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1248 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1248/1248 variables, and 396 constraints, problems are : Problem set: 0 solved, 1 unsolved in 837 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 357/357 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) 20/24 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/37 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 78/115 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 53/168 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/168 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 24/192 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/192 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 30/222 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/222 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/228 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/228 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 123/351 variables, 17/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/351 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/351 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 6/357 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/357 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 891/1248 variables, 357/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1248 variables, 1/397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1248 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1248 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1248/1248 variables, and 397 constraints, problems are : Problem set: 0 solved, 1 unsolved in 658 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 357/357 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1567ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 53 ms.
Support contains 1 out of 357 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 357/357 places, 891/891 transitions.
Applied a total of 0 rules in 9 ms. Remains 357 /357 variables (removed 0) and now considering 891/891 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 357/357 places, 891/891 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 357/357 places, 891/891 transitions.
Applied a total of 0 rules in 9 ms. Remains 357 /357 variables (removed 0) and now considering 891/891 (removed 0) transitions.
[2026-05-24 20:51:56] [INFO ] Invariant cache hit.
[2026-05-24 20:51:56] [INFO ] Implicit Places using invariants in 407 ms returned [86]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 426 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 356/357 places, 891/891 transitions.
Applied a total of 0 rules in 9 ms. Remains 356 /356 variables (removed 0) and now considering 891/891 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 444 ms. Remains : 356/357 places, 891/891 transitions.
RANDOM walk for 40000 steps (763 resets) in 139 ms. (285 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (218 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 672786 steps, run timeout after 3001 ms. (steps per millisecond=224 ) properties seen :0 out of 1
Probabilistic random walk after 672786 steps, saw 277482 distinct states, run finished after 3001 ms. (steps per millisecond=224 ) 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-17056561708063928049.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8163117748773290754.kers'
[2026-05-24 20:51:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17056561708063928049.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8163117748773290754.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 891 rows 356 cols 3642 entries
Finished phase 1 with 94 SingleSign rule and 225 generalized
[2026-05-24 20:51:59] [INFO ] Computed 37 invariants in 6 ms
Computed 37 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-8163117748773290754.kers
Total runtime 10 ms.
All remaining problems are real, not stopping.
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) 6/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/20 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 40/60 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 29/89 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/89 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 73/162 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 37/199 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/199 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 24/223 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/223 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 30/253 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/253 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/259 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/259 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 91/350 variables, 14/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/350 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 6/356 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/356 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 891/1247 variables, 356/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1247 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1247 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1247/1247 variables, and 393 constraints, problems are : Problem set: 0 solved, 1 unsolved in 470 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 356/356 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) 6/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/20 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 40/60 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 29/89 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/89 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 73/162 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 37/199 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/199 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 24/223 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/223 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 30/253 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/253 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/259 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/259 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 91/350 variables, 14/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/350 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 6/356 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/356 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 891/1247 variables, 356/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1247 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1247 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1247 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1247/1247 variables, and 394 constraints, problems are : Problem set: 0 solved, 1 unsolved in 764 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1266ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 46 ms.
Support contains 1 out of 356 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 356/356 places, 891/891 transitions.
Applied a total of 0 rules in 10 ms. Remains 356 /356 variables (removed 0) and now considering 891/891 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 356/356 places, 891/891 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 356/356 places, 891/891 transitions.
Applied a total of 0 rules in 11 ms. Remains 356 /356 variables (removed 0) and now considering 891/891 (removed 0) transitions.
[2026-05-24 20:52:01] [INFO ] Invariant cache hit.
[2026-05-24 20:52:01] [INFO ] Implicit Places using invariants in 468 ms returned []
[2026-05-24 20:52:01] [INFO ] Invariant cache hit.
[2026-05-24 20:52:02] [INFO ] Implicit Places using invariants and state equation in 913 ms returned []
Implicit Place search using SMT with State Equation took 1412 ms to find 0 implicit places.
[2026-05-24 20:52:02] [INFO ] Redundant transitions in 6 ms returned []
Running 866 sub problems to find dead transitions.
[2026-05-24 20:52:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 866 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/355 variables, 27/35 constraints. Problems are: Problem set: 0 solved, 866 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 866 unsolved
At refinement iteration 3 (OVERLAPS) 1/356 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 866 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 356/1247 variables, and 37 constraints, problems are : Problem set: 0 solved, 866 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 0/356 constraints, PredecessorRefiner: 866/866 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 866 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 866 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/355 variables, 27/35 constraints. Problems are: Problem set: 0 solved, 866 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 866 unsolved
At refinement iteration 3 (OVERLAPS) 1/356 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 866 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 356/1247 variables, and 38 constraints, problems are : Problem set: 0 solved, 866 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 0/356 constraints, PredecessorRefiner: 0/866 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60289ms problems are : Problem set: 0 solved, 866 unsolved
Search for dead transitions found 0 dead transitions in 60291ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61738 ms. Remains : 356/356 places, 891/891 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 11 ms. Remains 356 /356 variables (removed 0) and now considering 891/891 (removed 0) transitions.
Running SMT prover for 1 properties.
[2026-05-24 20:53:02] [INFO ] Invariant cache hit.
[2026-05-24 20:53:02] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-24 20:53:02] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2026-05-24 20:53:02] [INFO ] [Nat]Absence check using 10 positive and 27 generalized place invariants in 21 ms returned sat
[2026-05-24 20:53:03] [INFO ] After 687ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 20:53:03] [INFO ] After 773ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 20:53:03] [INFO ] After 987ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 1080 ms.
RANDOM walk for 40000 steps (742 resets) in 143 ms. (277 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (214 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 647344 steps, run timeout after 3001 ms. (steps per millisecond=215 ) properties seen :0 out of 1
Probabilistic random walk after 647344 steps, saw 218794 distinct states, run finished after 3001 ms. (steps per millisecond=215 ) 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-8073876773410735610.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17530793601622762358.kers'
[2026-05-24 20:53:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8073876773410735610.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17530793601622762358.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 897 rows 363 cols 3656 entries
Finished phase 1 with 100 SingleSign rule and 225 generalized
[2026-05-24 20:53:06] [INFO ] Computed 38 invariants in 6 ms
Computed 38 P flows in 31 ms.
Exported basis to /tmp/petrispot-output-17530793601622762358.kers
Total runtime 32 ms.
All remaining problems are real, not stopping.
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) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/30 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/43 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 78/121 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 53/174 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/174 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 24/198 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/198 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 30/228 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/228 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/234 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/234 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 123/357 variables, 17/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/357 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 6/363 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/363 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 897/1260 variables, 363/401 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1260 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1260 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1260/1260 variables, and 401 constraints, problems are : Problem set: 0 solved, 1 unsolved in 569 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 363/363 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) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/30 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/43 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 78/121 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 53/174 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/174 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 24/198 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/198 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 30/228 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/228 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/234 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/234 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 123/357 variables, 17/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/357 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 6/363 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/363 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 897/1260 variables, 363/401 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1260 variables, 1/402 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1260 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1260 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1260/1260 variables, and 402 constraints, problems are : Problem set: 0 solved, 1 unsolved in 815 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 363/363 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1454ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 118 ms.
Support contains 1 out of 363 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 363/363 places, 897/897 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 363 transition count 895
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 361 transition count 894
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 360 transition count 894
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 12 place count 357 transition count 891
Applied a total of 12 rules in 39 ms. Remains 357 /363 variables (removed 6) and now considering 891/897 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 357/363 places, 891/897 transitions.
RANDOM walk for 40000 steps (796 resets) in 133 ms. (298 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (227 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 638822 steps, run timeout after 3001 ms. (steps per millisecond=212 ) properties seen :0 out of 1
Probabilistic random walk after 638822 steps, saw 254206 distinct states, run finished after 3001 ms. (steps per millisecond=212 ) 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-12079903008272268039.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9988875271689036082.kers'
[2026-05-24 20:53:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12079903008272268039.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9988875271689036082.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 891 rows 357 cols 3644 entries
Finished phase 1 with 94 SingleSign rule and 225 generalized
[2026-05-24 20:53:11] [INFO ] Computed 38 invariants in 19 ms
Computed 38 P flows in 20 ms.
Exported basis to /tmp/petrispot-output-9988875271689036082.kers
Total runtime 22 ms.
All remaining problems are real, not stopping.
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) 20/24 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/37 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 78/115 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 53/168 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/168 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 24/192 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/192 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 30/222 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/222 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/228 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/228 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 123/351 variables, 17/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/351 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/351 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 6/357 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/357 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 891/1248 variables, 357/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1248 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1248 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1248/1248 variables, and 396 constraints, problems are : Problem set: 0 solved, 1 unsolved in 816 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 357/357 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) 20/24 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/37 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 78/115 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 53/168 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/168 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 24/192 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/192 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 30/222 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/222 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/228 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/228 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 123/351 variables, 17/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/351 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/351 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 6/357 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/357 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 891/1248 variables, 357/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1248 variables, 1/397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1248 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1248 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1248/1248 variables, and 397 constraints, problems are : Problem set: 0 solved, 1 unsolved in 562 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 357/357 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1423ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 69 ms.
Support contains 1 out of 357 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 357/357 places, 891/891 transitions.
Applied a total of 0 rules in 9 ms. Remains 357 /357 variables (removed 0) and now considering 891/891 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 357/357 places, 891/891 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 357/357 places, 891/891 transitions.
Applied a total of 0 rules in 10 ms. Remains 357 /357 variables (removed 0) and now considering 891/891 (removed 0) transitions.
[2026-05-24 20:53:13] [INFO ] Invariant cache hit.
[2026-05-24 20:53:13] [INFO ] Implicit Places using invariants in 482 ms returned [86]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 485 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 356/357 places, 891/891 transitions.
Applied a total of 0 rules in 9 ms. Remains 356 /356 variables (removed 0) and now considering 891/891 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 505 ms. Remains : 356/357 places, 891/891 transitions.
RANDOM walk for 40000 steps (737 resets) in 168 ms. (236 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (218 resets) in 55 ms. (714 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 665712 steps, run timeout after 3001 ms. (steps per millisecond=221 ) properties seen :0 out of 1
Probabilistic random walk after 665712 steps, saw 272410 distinct states, run finished after 3001 ms. (steps per millisecond=221 ) 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-13123935450685374595.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4135304713937373328.kers'
[2026-05-24 20:53:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13123935450685374595.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4135304713937373328.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 891 rows 356 cols 3642 entries
Finished phase 1 with 94 SingleSign rule and 225 generalized
[2026-05-24 20:53:16] [INFO ] Computed 37 invariants in 6 ms
Computed 37 P flows in 17 ms.
Exported basis to /tmp/petrispot-output-4135304713937373328.kers
Total runtime 18 ms.
All remaining problems are real, not stopping.
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) 6/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/20 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 40/60 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 29/89 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/89 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 73/162 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 37/199 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/199 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 24/223 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/223 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 30/253 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/253 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/259 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/259 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 91/350 variables, 14/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/350 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 6/356 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/356 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 891/1247 variables, 356/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1247 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1247 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1247/1247 variables, and 393 constraints, problems are : Problem set: 0 solved, 1 unsolved in 490 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 356/356 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) 6/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/20 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 40/60 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 29/89 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/89 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 73/162 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 37/199 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/199 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 24/223 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/223 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 30/253 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/253 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/259 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/259 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 91/350 variables, 14/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/350 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 6/356 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/356 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 891/1247 variables, 356/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1247 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1247 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1247 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1247/1247 variables, and 394 constraints, problems are : Problem set: 0 solved, 1 unsolved in 717 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1236ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 83 ms.
Support contains 1 out of 356 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 356/356 places, 891/891 transitions.
Applied a total of 0 rules in 12 ms. Remains 356 /356 variables (removed 0) and now considering 891/891 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 356/356 places, 891/891 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 356/356 places, 891/891 transitions.
Applied a total of 0 rules in 10 ms. Remains 356 /356 variables (removed 0) and now considering 891/891 (removed 0) transitions.
[2026-05-24 20:53:18] [INFO ] Invariant cache hit.
[2026-05-24 20:53:18] [INFO ] Implicit Places using invariants in 518 ms returned []
[2026-05-24 20:53:18] [INFO ] Invariant cache hit.
[2026-05-24 20:53:19] [INFO ] Implicit Places using invariants and state equation in 1050 ms returned []
Implicit Place search using SMT with State Equation took 1593 ms to find 0 implicit places.
[2026-05-24 20:53:19] [INFO ] Redundant transitions in 6 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1614 ms. Remains : 356/356 places, 891/891 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 10 ms. Remains 356 /356 variables (removed 0) and now considering 891/891 (removed 0) transitions.
Running SMT prover for 1 properties.
[2026-05-24 20:53:19] [INFO ] Invariant cache hit.
[2026-05-24 20:53:19] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-24 20:53:19] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 20:53:19] [INFO ] [Nat]Absence check using 10 positive and 27 generalized place invariants in 9 ms returned sat
[2026-05-24 20:53:20] [INFO ] After 338ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 20:53:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 287 ms
TRAPS : Iteration 1
[2026-05-24 20:53:20] [INFO ] After 724ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 20:53:20] [INFO ] After 899ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 987 ms.
RANDOM walk for 40000 steps (795 resets) in 163 ms. (243 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (214 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 619937 steps, run timeout after 3001 ms. (steps per millisecond=206 ) properties seen :0 out of 1
Probabilistic random walk after 619937 steps, saw 213211 distinct states, run finished after 3001 ms. (steps per millisecond=206 ) 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-17505357113061574883.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17181792568557453804.kers'
[2026-05-24 20:53:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17505357113061574883.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17181792568557453804.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 897 rows 363 cols 3656 entries
Finished phase 1 with 100 SingleSign rule and 225 generalized
[2026-05-24 20:53:23] [INFO ] Computed 38 invariants in 9 ms
Computed 38 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-17181792568557453804.kers
Total runtime 11 ms.
All remaining problems are real, not stopping.
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) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/30 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/43 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 78/121 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 53/174 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/174 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 24/198 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/198 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 30/228 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/228 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/234 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/234 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 123/357 variables, 17/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/357 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 6/363 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/363 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 897/1260 variables, 363/401 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1260 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1260 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1260/1260 variables, and 401 constraints, problems are : Problem set: 0 solved, 1 unsolved in 700 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 363/363 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) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/30 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/43 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 78/121 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 53/174 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/174 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 24/198 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/198 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 30/228 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/228 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/234 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/234 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 123/357 variables, 17/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/357 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 6/363 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/363 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 897/1260 variables, 363/401 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1260 variables, 1/402 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1260 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1260 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1260/1260 variables, and 402 constraints, problems are : Problem set: 0 solved, 1 unsolved in 691 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 363/363 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1437ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 120 ms.
Support contains 1 out of 363 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 363/363 places, 897/897 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 363 transition count 895
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 361 transition count 894
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 360 transition count 894
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 12 place count 357 transition count 891
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 13 place count 357 transition count 890
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 14 place count 356 transition count 890
Applied a total of 14 rules in 31 ms. Remains 356 /363 variables (removed 7) and now considering 890/897 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 356/363 places, 890/897 transitions.
RANDOM walk for 40000 steps (747 resets) in 192 ms. (207 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (226 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 673517 steps, run timeout after 3001 ms. (steps per millisecond=224 ) properties seen :0 out of 1
Probabilistic random walk after 673517 steps, saw 278050 distinct states, run finished after 3001 ms. (steps per millisecond=224 ) 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-17911995582012425410.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5716651577943979005.kers'
[2026-05-24 20:53:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17911995582012425410.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5716651577943979005.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 890 rows 356 cols 3642 entries
Finished phase 1 with 93 SingleSign rule and 225 generalized
[2026-05-24 20:53:28] [INFO ] Computed 38 invariants in 29 ms
Computed 38 P flows in 30 ms.
Exported basis to /tmp/petrispot-output-5716651577943979005.kers
Total runtime 32 ms.
All remaining problems are real, not stopping.
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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 20/23 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/36 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 78/114 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/114 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 53/167 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/167 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 24/191 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/191 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 30/221 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/221 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/227 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/227 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 123/350 variables, 17/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/350 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 6/356 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/356 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 890/1246 variables, 356/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1246 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1246 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1246/1246 variables, and 394 constraints, problems are : Problem set: 0 solved, 1 unsolved in 699 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 356/356 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 20/23 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/36 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 78/114 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/114 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 53/167 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/167 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 24/191 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/191 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 30/221 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/221 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/227 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/227 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 123/350 variables, 17/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/350 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 6/356 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/356 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 890/1246 variables, 356/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1246 variables, 1/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1246 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1246 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1246/1246 variables, and 395 constraints, problems are : Problem set: 0 solved, 1 unsolved in 777 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1534ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 65 ms.
Support contains 1 out of 356 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 356/356 places, 890/890 transitions.
Applied a total of 0 rules in 11 ms. Remains 356 /356 variables (removed 0) and now considering 890/890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 356/356 places, 890/890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 356/356 places, 890/890 transitions.
Applied a total of 0 rules in 11 ms. Remains 356 /356 variables (removed 0) and now considering 890/890 (removed 0) transitions.
[2026-05-24 20:53:30] [INFO ] Invariant cache hit.
[2026-05-24 20:53:30] [INFO ] Implicit Places using invariants in 582 ms returned [86]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 584 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 355/356 places, 890/890 transitions.
Applied a total of 0 rules in 21 ms. Remains 355 /355 variables (removed 0) and now considering 890/890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 630 ms. Remains : 355/356 places, 890/890 transitions.
RANDOM walk for 40000 steps (786 resets) in 170 ms. (233 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (212 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 637137 steps, run timeout after 3001 ms. (steps per millisecond=212 ) properties seen :0 out of 1
Probabilistic random walk after 637137 steps, saw 252933 distinct states, run finished after 3001 ms. (steps per millisecond=212 ) 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-8272449501379945373.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11994971540601280438.kers'
[2026-05-24 20:53:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8272449501379945373.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11994971540601280438.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 890 rows 355 cols 3640 entries
Finished phase 1 with 93 SingleSign rule and 225 generalized
[2026-05-24 20:53:33] [INFO ] Computed 37 invariants in 17 ms
Computed 37 P flows in 21 ms.
Exported basis to /tmp/petrispot-output-11994971540601280438.kers
Total runtime 31 ms.
All remaining problems are real, not stopping.
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) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/19 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 40/59 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 29/88 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/88 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 73/161 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/161 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 37/198 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/198 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 24/222 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/222 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 30/252 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/252 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/258 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/258 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 91/349 variables, 14/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/349 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 6/355 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/355 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 890/1245 variables, 355/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1245 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1245 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1245/1245 variables, and 392 constraints, problems are : Problem set: 0 solved, 1 unsolved in 607 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 355/355 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) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/19 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 40/59 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 29/88 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/88 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 73/161 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/161 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 37/198 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/198 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 24/222 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/222 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 30/252 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/252 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/258 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/258 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 91/349 variables, 14/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/349 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/349 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 6/355 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/355 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 890/1245 variables, 355/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1245 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1245 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1245 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1245/1245 variables, and 394 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1232 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 355/355 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1915ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 40 ms.
Support contains 1 out of 355 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 355/355 places, 890/890 transitions.
Applied a total of 0 rules in 10 ms. Remains 355 /355 variables (removed 0) and now considering 890/890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 355/355 places, 890/890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 355/355 places, 890/890 transitions.
Applied a total of 0 rules in 10 ms. Remains 355 /355 variables (removed 0) and now considering 890/890 (removed 0) transitions.
[2026-05-24 20:53:35] [INFO ] Invariant cache hit.
[2026-05-24 20:53:36] [INFO ] Implicit Places using invariants in 489 ms returned []
[2026-05-24 20:53:36] [INFO ] Invariant cache hit.
[2026-05-24 20:53:37] [INFO ] Implicit Places using invariants and state equation in 1196 ms returned []
Implicit Place search using SMT with State Equation took 1692 ms to find 0 implicit places.
[2026-05-24 20:53:37] [INFO ] Redundant transitions in 15 ms returned []
Running 865 sub problems to find dead transitions.
[2026-05-24 20:53:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/354 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 865 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/354 variables, 27/35 constraints. Problems are: Problem set: 0 solved, 865 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/354 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 865 unsolved
SMT process timed out in 30268ms, After SMT, problems are : Problem set: 0 solved, 865 unsolved
Search for dead transitions found 0 dead transitions in 30271ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32017 ms. Remains : 355/355 places, 890/890 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 11 ms. Remains 355 /355 variables (removed 0) and now considering 890/890 (removed 0) transitions.
Running SMT prover for 1 properties.
[2026-05-24 20:54:07] [INFO ] Invariant cache hit.
[2026-05-24 20:54:07] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-24 20:54:07] [INFO ] [Nat]Absence check using 10 positive place invariants in 17 ms returned sat
[2026-05-24 20:54:07] [INFO ] [Nat]Absence check using 10 positive and 27 generalized place invariants in 10 ms returned sat
[2026-05-24 20:54:08] [INFO ] After 349ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 20:54:08] [INFO ] After 423ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 20:54:08] [INFO ] After 614ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 752 ms.
RANDOM walk for 40000 steps (760 resets) in 143 ms. (277 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (214 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 672456 steps, run timeout after 3001 ms. (steps per millisecond=224 ) properties seen :0 out of 1
Probabilistic random walk after 672456 steps, saw 223962 distinct states, run finished after 3001 ms. (steps per millisecond=224 ) 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-4334628418252387923.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12212254685069871142.kers'
[2026-05-24 20:54:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4334628418252387923.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12212254685069871142.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 897 rows 363 cols 3656 entries
Finished phase 1 with 100 SingleSign rule and 225 generalized
[2026-05-24 20:54:11] [INFO ] Computed 38 invariants in 27 ms
Computed 38 P flows in 28 ms.
Exported basis to /tmp/petrispot-output-12212254685069871142.kers
Total runtime 30 ms.
All remaining problems are real, not stopping.
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) 18/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/22 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 45/67 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 29/96 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 73/169 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/169 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 37/206 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/206 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 24/230 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/230 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 30/260 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/260 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/266 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/266 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 91/357 variables, 14/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/357 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 6/363 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/363 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 897/1260 variables, 363/401 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1260 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1260 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1260/1260 variables, and 401 constraints, problems are : Problem set: 0 solved, 1 unsolved in 448 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 363/363 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) 18/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/22 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 45/67 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 29/96 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 73/169 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/169 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 37/206 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/206 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 24/230 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/230 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 30/260 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/260 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/266 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/266 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 91/357 variables, 14/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/357 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/357 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 6/363 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/363 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 897/1260 variables, 363/402 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1260 variables, 1/403 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1260 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1260 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1260/1260 variables, and 403 constraints, problems are : Problem set: 0 solved, 1 unsolved in 854 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 363/363 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1363ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 52 ms.
Support contains 1 out of 363 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 363/363 places, 897/897 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 363 transition count 894
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 360 transition count 894
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 357 transition count 891
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 357 transition count 890
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 356 transition count 890
Applied a total of 14 rules in 27 ms. Remains 356 /363 variables (removed 7) and now considering 890/897 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 356/363 places, 890/897 transitions.
RANDOM walk for 40000 steps (787 resets) in 116 ms. (341 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (213 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 674942 steps, run timeout after 3001 ms. (steps per millisecond=224 ) properties seen :0 out of 1
Probabilistic random walk after 674942 steps, saw 279120 distinct states, run finished after 3001 ms. (steps per millisecond=224 ) 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-17679518273153668948.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13007080695531932685.kers'
[2026-05-24 20:54:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17679518273153668948.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13007080695531932685.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 890 rows 355 cols 3640 entries
Finished phase 1 with 114 SingleSign rule and 204 generalized
[2026-05-24 20:54:16] [INFO ] Computed 38 invariants in 9 ms
Computed 38 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-13007080695531932685.kers
Total runtime 12 ms.
All remaining problems are real, not stopping.
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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 49/54 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 30/84 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 159/243 variables, 16/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/243 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 58/301 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/301 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 55/356 variables, 9/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/356 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 890/1246 variables, 356/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1246 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1246 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1246/1246 variables, and 394 constraints, problems are : Problem set: 0 solved, 1 unsolved in 376 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 356/356 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 49/54 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 30/84 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 159/243 variables, 16/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/243 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 58/301 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/301 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 55/356 variables, 9/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/356 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/356 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 890/1246 variables, 356/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1246 variables, 1/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1246 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1246 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1246/1246 variables, and 396 constraints, problems are : Problem set: 0 solved, 1 unsolved in 775 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1184ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 48 ms.
Support contains 1 out of 356 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 356/356 places, 890/890 transitions.
Applied a total of 0 rules in 10 ms. Remains 356 /356 variables (removed 0) and now considering 890/890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 356/356 places, 890/890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 356/356 places, 890/890 transitions.
Applied a total of 0 rules in 10 ms. Remains 356 /356 variables (removed 0) and now considering 890/890 (removed 0) transitions.
[2026-05-24 20:54:17] [INFO ] Invariant cache hit.
[2026-05-24 20:54:17] [INFO ] Implicit Places using invariants in 443 ms returned [86]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 459 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 355/356 places, 890/890 transitions.
Applied a total of 0 rules in 11 ms. Remains 355 /355 variables (removed 0) and now considering 890/890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 480 ms. Remains : 355/356 places, 890/890 transitions.
RANDOM walk for 40000 steps (797 resets) in 154 ms. (258 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (211 resets) in 49 ms. (800 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 647728 steps, run timeout after 3001 ms. (steps per millisecond=215 ) properties seen :0 out of 1
Probabilistic random walk after 647728 steps, saw 260893 distinct states, run finished after 3001 ms. (steps per millisecond=215 ) 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-3627305990469558336.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14743079906917509582.kers'
[2026-05-24 20:54:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3627305990469558336.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14743079906917509582.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 890 rows 355 cols 3640 entries
Finished phase 1 with 93 SingleSign rule and 225 generalized
[2026-05-24 20:54:20] [INFO ] Computed 37 invariants in 6 ms
Computed 37 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-14743079906917509582.kers
Total runtime 10 ms.
All remaining problems are real, not stopping.
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) 14/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/19 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 40/59 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 29/88 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/88 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 73/161 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/161 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 37/198 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/198 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 24/222 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/222 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 30/252 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/252 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/258 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/258 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 91/349 variables, 14/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/349 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/349 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 6/355 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/355 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 890/1245 variables, 355/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1245 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1245 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1245/1245 variables, and 393 constraints, problems are : Problem set: 0 solved, 1 unsolved in 823 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 355/355 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) 14/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/19 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 40/59 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 29/88 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/88 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 73/161 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/161 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 37/198 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/198 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 24/222 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/222 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 30/252 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/252 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/258 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/258 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 91/349 variables, 14/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/349 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/349 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 6/355 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/355 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 890/1245 variables, 355/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1245 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1245 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1245 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1245/1245 variables, and 394 constraints, problems are : Problem set: 0 solved, 1 unsolved in 691 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 355/355 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1542ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 40 ms.
Support contains 1 out of 355 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 355/355 places, 890/890 transitions.
Applied a total of 0 rules in 9 ms. Remains 355 /355 variables (removed 0) and now considering 890/890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 355/355 places, 890/890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 355/355 places, 890/890 transitions.
Applied a total of 0 rules in 9 ms. Remains 355 /355 variables (removed 0) and now considering 890/890 (removed 0) transitions.
[2026-05-24 20:54:22] [INFO ] Invariant cache hit.
[2026-05-24 20:54:22] [INFO ] Implicit Places using invariants in 373 ms returned []
[2026-05-24 20:54:22] [INFO ] Invariant cache hit.
[2026-05-24 20:54:23] [INFO ] Implicit Places using invariants and state equation in 878 ms returned []
Implicit Place search using SMT with State Equation took 1255 ms to find 0 implicit places.
[2026-05-24 20:54:23] [INFO ] Redundant transitions in 18 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1296 ms. Remains : 355/355 places, 890/890 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 13 ms. Remains 355 /355 variables (removed 0) and now considering 890/890 (removed 0) transitions.
Running SMT prover for 1 properties.
[2026-05-24 20:54:23] [INFO ] Invariant cache hit.
[2026-05-24 20:54:23] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-24 20:54:23] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2026-05-24 20:54:23] [INFO ] [Nat]Absence check using 10 positive and 27 generalized place invariants in 9 ms returned sat
[2026-05-24 20:54:24] [INFO ] After 364ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 20:54:24] [INFO ] After 468ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 20:54:24] [INFO ] After 628ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 775 ms.
RANDOM walk for 40000 steps (756 resets) in 170 ms. (233 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (216 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 671159 steps, run timeout after 3001 ms. (steps per millisecond=223 ) properties seen :0 out of 1
Probabilistic random walk after 671159 steps, saw 223676 distinct states, run finished after 3001 ms. (steps per millisecond=223 ) 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-13885983229771103958.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8841207566216481244.kers'
[2026-05-24 20:54:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13885983229771103958.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8841207566216481244.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 897 rows 363 cols 3656 entries
Finished phase 1 with 100 SingleSign rule and 225 generalized
[2026-05-24 20:54:27] [INFO ] Computed 38 invariants in 17 ms
Computed 38 P flows in 18 ms.
Exported basis to /tmp/petrispot-output-8841207566216481244.kers
Total runtime 18 ms.
All remaining problems are real, not stopping.
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) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/30 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/43 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 78/121 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 53/174 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/174 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 24/198 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/198 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 30/228 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/228 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/234 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/234 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 123/357 variables, 17/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/357 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/357 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 6/363 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/363 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 897/1260 variables, 363/402 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1260 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1260 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1260/1260 variables, and 402 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1029 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 363/363 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) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/30 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/43 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 78/121 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 53/174 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/174 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 24/198 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/198 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 30/228 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/228 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/234 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/234 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 123/357 variables, 17/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/357 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/357 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/357 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 6/363 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/363 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 897/1260 variables, 363/403 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1260 variables, 1/404 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1260 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1260 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1260/1260 variables, and 404 constraints, problems are : Problem set: 0 solved, 1 unsolved in 852 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 363/363 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1923ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 49 ms.
Support contains 1 out of 363 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 363/363 places, 897/897 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 363 transition count 895
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 361 transition count 895
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 12 place count 357 transition count 891
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 357 transition count 890
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 356 transition count 890
Applied a total of 14 rules in 27 ms. Remains 356 /363 variables (removed 7) and now considering 890/897 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 356/363 places, 890/897 transitions.
RANDOM walk for 40000 steps (841 resets) in 128 ms. (310 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (213 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 669336 steps, run timeout after 3001 ms. (steps per millisecond=223 ) properties seen :0 out of 1
Probabilistic random walk after 669336 steps, saw 274893 distinct states, run finished after 3004 ms. (steps per millisecond=222 ) 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-6913080478170041543.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17653544595841288724.kers'
[2026-05-24 20:54:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6913080478170041543.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17653544595841288724.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 890 rows 356 cols 3642 entries
Finished phase 1 with 93 SingleSign rule and 225 generalized
[2026-05-24 20:54:32] [INFO ] Computed 38 invariants in 16 ms
Computed 38 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-17653544595841288724.kers
Total runtime 19 ms.
All remaining problems are real, not stopping.
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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 20/23 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/36 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 78/114 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/114 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 53/167 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/167 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 24/191 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/191 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 30/221 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/221 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/227 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/227 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 123/350 variables, 17/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/350 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/350 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 6/356 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/356 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 890/1246 variables, 356/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1246 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1246 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1246/1246 variables, and 395 constraints, problems are : Problem set: 0 solved, 1 unsolved in 887 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 356/356 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 20/23 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/36 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 78/114 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/114 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 53/167 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/167 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 24/191 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/191 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 30/221 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/221 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/227 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/227 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 123/350 variables, 17/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/350 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/350 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/350 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 6/356 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/356 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 890/1246 variables, 356/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1246 variables, 1/397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1246 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1246 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1246/1246 variables, and 397 constraints, problems are : Problem set: 0 solved, 1 unsolved in 734 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1657ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 65 ms.
Support contains 1 out of 356 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 356/356 places, 890/890 transitions.
Applied a total of 0 rules in 10 ms. Remains 356 /356 variables (removed 0) and now considering 890/890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 356/356 places, 890/890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 356/356 places, 890/890 transitions.
Applied a total of 0 rules in 9 ms. Remains 356 /356 variables (removed 0) and now considering 890/890 (removed 0) transitions.
[2026-05-24 20:54:34] [INFO ] Invariant cache hit.
[2026-05-24 20:54:34] [INFO ] Implicit Places using invariants in 340 ms returned [86]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 348 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 355/356 places, 890/890 transitions.
Applied a total of 0 rules in 10 ms. Remains 355 /355 variables (removed 0) and now considering 890/890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 394 ms. Remains : 355/356 places, 890/890 transitions.
RANDOM walk for 40000 steps (778 resets) in 128 ms. (310 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (218 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 675143 steps, run timeout after 3001 ms. (steps per millisecond=224 ) properties seen :0 out of 1
Probabilistic random walk after 675143 steps, saw 279221 distinct states, run finished after 3001 ms. (steps per millisecond=224 ) 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-11673919289766311643.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3669644838072924472.kers'
[2026-05-24 20:54:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11673919289766311643.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3669644838072924472.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 890 rows 355 cols 3640 entries
Finished phase 1 with 93 SingleSign rule and 225 generalized
[2026-05-24 20:54:37] [INFO ] Computed 37 invariants in 6 ms
Computed 37 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-3669644838072924472.kers
Total runtime 9 ms.
All remaining problems are real, not stopping.
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) 18/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/59 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/88 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 73/161 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 37/198 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 24/222 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 30/252 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/252 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/258 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/258 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 91/349 variables, 14/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/349 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 6/355 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/355 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 890/1245 variables, 355/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1245 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1245 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1245/1245 variables, and 392 constraints, problems are : Problem set: 0 solved, 1 unsolved in 720 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 355/355 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) 18/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/59 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/88 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 73/161 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 37/198 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 24/222 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 30/252 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/252 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/258 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/258 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 91/349 variables, 14/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/349 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 6/355 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/355 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 890/1245 variables, 355/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1245 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1245 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1245 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1245/1245 variables, and 393 constraints, problems are : Problem set: 0 solved, 1 unsolved in 754 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 355/355 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1497ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 54 ms.
Support contains 1 out of 355 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 355/355 places, 890/890 transitions.
Applied a total of 0 rules in 15 ms. Remains 355 /355 variables (removed 0) and now considering 890/890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 355/355 places, 890/890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 355/355 places, 890/890 transitions.
Applied a total of 0 rules in 9 ms. Remains 355 /355 variables (removed 0) and now considering 890/890 (removed 0) transitions.
[2026-05-24 20:54:39] [INFO ] Invariant cache hit.
[2026-05-24 20:54:39] [INFO ] Implicit Places using invariants in 405 ms returned []
[2026-05-24 20:54:39] [INFO ] Invariant cache hit.
[2026-05-24 20:54:40] [INFO ] Implicit Places using invariants and state equation in 776 ms returned []
Implicit Place search using SMT with State Equation took 1207 ms to find 0 implicit places.
[2026-05-24 20:54:40] [INFO ] Redundant transitions in 19 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1241 ms. Remains : 355/355 places, 890/890 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 22 ms. Remains 355 /355 variables (removed 0) and now considering 890/890 (removed 0) transitions.
Running SMT prover for 1 properties.
[2026-05-24 20:54:40] [INFO ] Invariant cache hit.
[2026-05-24 20:54:40] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-24 20:54:40] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2026-05-24 20:54:40] [INFO ] [Nat]Absence check using 10 positive and 27 generalized place invariants in 7 ms returned sat
[2026-05-24 20:54:41] [INFO ] After 384ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 20:54:41] [INFO ] After 458ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 20:54:41] [INFO ] After 626ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 736 ms.
RANDOM walk for 40000 steps (738 resets) in 171 ms. (232 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (207 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 624610 steps, run timeout after 3001 ms. (steps per millisecond=208 ) properties seen :0 out of 1
Probabilistic random walk after 624610 steps, saw 214193 distinct states, run finished after 3001 ms. (steps per millisecond=208 ) 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-7761820616858022897.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14714839847173552838.kers'
[2026-05-24 20:54:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7761820616858022897.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14714839847173552838.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 897 rows 363 cols 3656 entries
Finished phase 1 with 100 SingleSign rule and 225 generalized
[2026-05-24 20:54:44] [INFO ] Computed 38 invariants in 18 ms
Computed 38 P flows in 27 ms.
Exported basis to /tmp/petrispot-output-14714839847173552838.kers
Total runtime 30 ms.
All remaining problems are real, not stopping.
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) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/30 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/43 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 78/121 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 53/174 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/174 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 24/198 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/198 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 30/228 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/228 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/234 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/234 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 123/357 variables, 17/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/357 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/357 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 6/363 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/363 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 897/1260 variables, 363/402 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1260 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1260 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1260/1260 variables, and 402 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1354 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 363/363 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) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/30 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/43 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 78/121 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 53/174 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/174 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 24/198 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/198 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 30/228 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/228 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/234 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/234 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 123/357 variables, 17/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/357 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/357 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/357 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 6/363 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/363 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 897/1260 variables, 363/403 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1260 variables, 1/404 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1260 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1260 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1260/1260 variables, and 404 constraints, problems are : Problem set: 0 solved, 1 unsolved in 822 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 363/363 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2241ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 38 ms.
Support contains 1 out of 363 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 363/363 places, 897/897 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 363 transition count 895
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 361 transition count 894
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 360 transition count 894
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 14 place count 356 transition count 890
Applied a total of 14 rules in 20 ms. Remains 356 /363 variables (removed 7) and now considering 890/897 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 356/363 places, 890/897 transitions.
RANDOM walk for 40000 steps (749 resets) in 159 ms. (250 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (207 resets) in 71 ms. (555 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 641477 steps, run timeout after 3001 ms. (steps per millisecond=213 ) properties seen :0 out of 1
Probabilistic random walk after 641477 steps, saw 256206 distinct states, run finished after 3001 ms. (steps per millisecond=213 ) 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-11159751651290409607.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10773888421537756059.kers'
[2026-05-24 20:54:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11159751651290409607.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10773888421537756059.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 890 rows 356 cols 3642 entries
Finished phase 1 with 93 SingleSign rule and 225 generalized
[2026-05-24 20:54:49] [INFO ] Computed 38 invariants in 16 ms
Computed 38 P flows in 19 ms.
Exported basis to /tmp/petrispot-output-10773888421537756059.kers
Total runtime 20 ms.
All remaining problems are real, not stopping.
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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 20/23 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/36 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 78/114 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/114 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 53/167 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/167 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 24/191 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/191 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 30/221 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/221 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/227 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/227 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 123/350 variables, 17/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/350 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/350 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 6/356 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/356 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 890/1246 variables, 356/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1246 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1246 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1246/1246 variables, and 395 constraints, problems are : Problem set: 0 solved, 1 unsolved in 721 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 356/356 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 20/23 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/36 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 78/114 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/114 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 53/167 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/167 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 24/191 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/191 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 30/221 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/221 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/227 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/227 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 123/350 variables, 17/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/350 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/350 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/350 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 6/356 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/356 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 890/1246 variables, 356/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1246 variables, 1/397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1246 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1246 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1246/1246 variables, and 397 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1043 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1810ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 46 ms.
Support contains 1 out of 356 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 356/356 places, 890/890 transitions.
Applied a total of 0 rules in 9 ms. Remains 356 /356 variables (removed 0) and now considering 890/890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 356/356 places, 890/890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 356/356 places, 890/890 transitions.
Applied a total of 0 rules in 10 ms. Remains 356 /356 variables (removed 0) and now considering 890/890 (removed 0) transitions.
[2026-05-24 20:54:51] [INFO ] Invariant cache hit.
[2026-05-24 20:54:52] [INFO ] Implicit Places using invariants in 339 ms returned [86]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 341 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 355/356 places, 890/890 transitions.
Applied a total of 0 rules in 18 ms. Remains 355 /355 variables (removed 0) and now considering 890/890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 369 ms. Remains : 355/356 places, 890/890 transitions.
RANDOM walk for 40000 steps (758 resets) in 144 ms. (275 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (214 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 689333 steps, run timeout after 3001 ms. (steps per millisecond=229 ) properties seen :0 out of 1
Probabilistic random walk after 689333 steps, saw 288788 distinct states, run finished after 3001 ms. (steps per millisecond=229 ) 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-646173410988613627.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15346280157006232253.kers'
[2026-05-24 20:54:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-646173410988613627.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15346280157006232253.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 890 rows 355 cols 3640 entries
Finished phase 1 with 93 SingleSign rule and 225 generalized
[2026-05-24 20:54:55] [INFO ] Computed 37 invariants in 28 ms
Computed 37 P flows in 42 ms.
Exported basis to /tmp/petrispot-output-15346280157006232253.kers
Total runtime 46 ms.
All remaining problems are real, not stopping.
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) 18/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/59 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/88 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 73/161 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 37/198 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 24/222 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 30/252 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/252 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/258 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/258 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 91/349 variables, 14/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/349 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 6/355 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/355 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 890/1245 variables, 355/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1245 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1245 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1245/1245 variables, and 392 constraints, problems are : Problem set: 0 solved, 1 unsolved in 532 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 355/355 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) 18/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/59 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/88 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 73/161 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 37/198 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 24/222 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 30/252 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/252 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/258 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/258 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 91/349 variables, 14/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/349 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 6/355 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/355 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 890/1245 variables, 355/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1245 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1245 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1245 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1245/1245 variables, and 393 constraints, problems are : Problem set: 0 solved, 1 unsolved in 889 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 355/355 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1490ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 59 ms.
Support contains 1 out of 355 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 355/355 places, 890/890 transitions.
Applied a total of 0 rules in 10 ms. Remains 355 /355 variables (removed 0) and now considering 890/890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 355/355 places, 890/890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 355/355 places, 890/890 transitions.
Applied a total of 0 rules in 11 ms. Remains 355 /355 variables (removed 0) and now considering 890/890 (removed 0) transitions.
[2026-05-24 20:54:56] [INFO ] Invariant cache hit.
[2026-05-24 20:54:57] [INFO ] Implicit Places using invariants in 374 ms returned []
[2026-05-24 20:54:57] [INFO ] Invariant cache hit.
[2026-05-24 20:54:58] [INFO ] Implicit Places using invariants and state equation in 983 ms returned []
Implicit Place search using SMT with State Equation took 1371 ms to find 0 implicit places.
[2026-05-24 20:54:58] [INFO ] Redundant transitions in 19 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1412 ms. Remains : 355/355 places, 890/890 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 9 ms. Remains 355 /355 variables (removed 0) and now considering 890/890 (removed 0) transitions.
Running SMT prover for 1 properties.
[2026-05-24 20:54:58] [INFO ] Invariant cache hit.
[2026-05-24 20:54:58] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-24 20:54:58] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2026-05-24 20:54:58] [INFO ] [Nat]Absence check using 10 positive and 27 generalized place invariants in 22 ms returned sat
[2026-05-24 20:54:58] [INFO ] After 332ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 20:54:58] [INFO ] After 393ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 20:54:58] [INFO ] After 566ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 667 ms.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 23 ms. Remains 363 /363 variables (removed 0) and now considering 897/897 (removed 0) transitions.
Running SMT prover for 8 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9535235498023856962.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13357336283617780481.kers'
[2026-05-24 20:54:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9535235498023856962.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13357336283617780481.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 897 rows 363 cols 3656 entries
Finished phase 1 with 100 SingleSign rule and 225 generalized
[2026-05-24 20:54:58] [INFO ] Computed 38 invariants in 17 ms
Computed 38 P flows in 18 ms.
Exported basis to /tmp/petrispot-output-13357336283617780481.kers
Total runtime 20 ms.
[2026-05-24 20:54:59] [INFO ] After 211ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2026-05-24 20:54:59] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-24 20:54:59] [INFO ] [Nat]Absence check using 9 positive and 29 generalized place invariants in 35 ms returned sat
[2026-05-24 20:54:59] [INFO ] After 528ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
TRAPS : Iteration 0
[2026-05-24 20:55:00] [INFO ] After 1111ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
[2026-05-24 20:55:00] [INFO ] After 1644ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
[2026-05-24 20:55:00] [INFO ] Flatten gal took : 34 ms
[2026-05-24 20:55:00] [INFO ] Flatten gal took : 54 ms
[2026-05-24 20:55:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13917949865518234318.gal : 5 ms
[2026-05-24 20:55:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14373422346042281994.prop : 0 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/ReachabilityCardinality13917949865518234318.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14373422346042281994.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 ...330
Loading property file /tmp/ReachabilityCardinality14373422346042281994.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :6 after 44
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :44 after 328
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :328 after 8528
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :8528 after 17712
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :17712 after 20070
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :20070 after 20618
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :20618 after 22564
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :22564 after 351317
SDD proceeding with computation,8 properties remain. new max is 4096
SDD size :351317 after 2.59887e+06
SDD proceeding with computation,8 properties remain. new max is 8192
SDD size :2.59887e+06 after 3.68626e+07
SDD proceeding with computation,8 properties remain. new max is 16384
SDD size :3.68626e+07 after 4.5059e+08
Invariant property smplace_429 does not hold.
Invariant property smplace_428 does not hold.
Invariant property smplace_427 does not hold.
Invariant property smplace_423 does not hold.
Invariant property smplace_416 does not hold.
Invariant property smplace_415 does not hold.
Invariant property smplace_414 does not hold.
Invariant property smplace_60 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 16385 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,1.40473e+09,4.09198,122268,2,24224,26,288583,6,0,2353,325651,0
Total reachable state count : 1404734497

Verifying 8 reachability properties.
Invariant property smplace_60 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_60,2,4.09557,122268,2,370,26,288583,7,0,2356,325651,0
Invariant property smplace_414 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_414,10,4.09793,122268,2,412,26,288583,8,0,2358,325651,0
Invariant property smplace_415 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_415,2,4.09937,122268,2,370,26,288583,9,0,2360,325651,0
Invariant property smplace_416 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_416,420,4.1007,122268,2,997,26,288583,10,0,2362,325651,0
Invariant property smplace_423 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_423,990,4.1021,122268,2,1293,26,288583,11,0,2364,325651,0
Invariant property smplace_427 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_427,3750,4.10394,122268,2,2851,26,288583,12,0,2366,325651,0
Invariant property smplace_428 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_428,420,4.10534,122268,2,997,26,288583,13,0,2368,325651,0
Invariant property smplace_429 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_429,420,4.10678,122268,2,997,26,288583,14,0,2370,325651,0
Over-approximation ignoring read arcs solved 0 properties in 6134 ms.
[2026-05-24 20:55:05] [INFO ] Flatten gal took : 52 ms
[2026-05-24 20:55:05] [INFO ] Flatten gal took : 27 ms
[2026-05-24 20:55:05] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability16477417603115173249.gal : 6 ms
[2026-05-24 20:55:05] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability16722151514243676776.prop : 0 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/ReachabilityFireability16477417603115173249.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability16722151514243676776.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 ...330
Loading property file /tmp/ReachabilityFireability16722151514243676776.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :6 after 44
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :44 after 328
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :328 after 8528
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :8528 after 17712
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :17712 after 20070
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :20070 after 20644
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :20644 after 22564
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :22564 after 348447
SDD proceeding with computation,8 properties remain. new max is 4096
SDD size :348447 after 4.22504e+06
SDD proceeding with computation,8 properties remain. new max is 8192
SDD size :4.22504e+06 after 3.74021e+07
SDD proceeding with computation,8 properties remain. new max is 16384
SDD size :3.74021e+07 after 6.25457e+08
Detected timeout of ITS tools.
[2026-05-24 20:55:08] [INFO ] Flatten gal took : 48 ms
[2026-05-24 20:55:08] [INFO ] Applying decomposition
[2026-05-24 20:55: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/graph11235600596328002756.txt' '-o' '/tmp/graph11235600596328002756.bin' '-w' '/tmp/graph11235600596328002756.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11235600596328002756.bin' '-l' '-1' '-v' '-w' '/tmp/graph11235600596328002756.weights' '-q' '0' '-e' '0.001'
[2026-05-24 20:55:08] [INFO ] Decomposing Gal with order
[2026-05-24 20:55:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 20:55:08] [INFO ] Removed a total of 1852 redundant transitions.
[2026-05-24 20:55:08] [INFO ] Flatten gal took : 46 ms
[2026-05-24 20:55:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 71 labels/synchronizations in 9 ms.
[2026-05-24 20:55:08] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability5333786723122324440.gal : 6 ms
[2026-05-24 20:55:08] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability8003745572693907002.prop : 0 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/ReachabilityFireability5333786723122324440.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability8003745572693907002.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 ...307
Loading property file /tmp/ReachabilityFireability8003745572693907002.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :5 after 6
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :6 after 36
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :36 after 328
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :30432 after 223704
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :223704 after 1.85615e+06
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :1.85615e+06 after 8.24092e+06
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :8.24092e+06 after 3.37528e+07
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :3.90901e+07 after 3.54444e+08
Invariant property smplace_429 does not hold.
Invariant property smplace_428 does not hold.
Invariant property smplace_427 does not hold.
Invariant property smplace_423 does not hold.
Invariant property smplace_416 does not hold.
Invariant property smplace_415 does not hold.
Invariant property smplace_414 does not hold.
Invariant property smplace_60 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 1025 fixpoint passes
Detected timeout of ITS tools.
Able to resolve query StableMarking after proving 1789 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST DECISION_DIAGRAMS COLLATERAL_PROCESSING BESTFIRST_WALK TOPOLOGICAL USE_NUPN
Total runtime 1476761 ms.

BK_STOP 1779656111459

--------------------
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
+ [[ StableMarking = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution StableMarking -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 StableMarking -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="ASLink-PT-04b"
export BK_EXAMINATION="StableMarking"
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 ASLink-PT-04b, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r008-oct2-177944369800213"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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