Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r104-tall-177955698800553.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is DoubleExponent-PT-010, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r104-tall-177955698800553
=====================================================================

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

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1779610692061

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=DoubleExponent-PT-010
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StableMarking PT
Running Version 202604301425
[2026-05-24 08:18:13] [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 08:18:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 08:18:13] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2026-05-24 08:18:13] [INFO ] Transformed 534 places.
[2026-05-24 08:18:13] [INFO ] Transformed 498 transitions.
[2026-05-24 08:18:13] [INFO ] Parsed PT model containing 534 places and 498 transitions and 1404 arcs in 179 ms.
Structural test allowed to assert that 11 places are NOT stable. Took 13 ms.
[2026-05-24 08:18:14] [INFO ] Flatten gal took : 156 ms
[2026-05-24 08:18:14] [INFO ] Flatten gal took : 91 ms
[2026-05-24 08:18:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14657003744185673067.gal : 47 ms
[2026-05-24 08:18:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4002924692459874521.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/ReachabilityCardinality14657003744185673067.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4002924692459874521.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality4002924692459874521.prop.
RANDOM walk for 40000 steps (1303 resets) in 2991 ms. (13 steps per ms) remains 479/523 properties
BEST_FIRST walk for 400 steps (11 resets) in 17 ms. (22 steps per ms) remains 479/479 properties
BEST_FIRST walk for 400 steps (11 resets) in 14 ms. (26 steps per ms) remains 479/479 properties
BEST_FIRST walk for 400 steps (12 resets) in 24 ms. (16 steps per ms) remains 479/479 properties
BEST_FIRST walk for 401 steps (9 resets) in 83 ms. (4 steps per ms) remains 479/479 properties
BEST_FIRST walk for 400 steps (11 resets) in 51 ms. (7 steps per ms) remains 479/479 properties
BEST_FIRST walk for 400 steps (11 resets) in 17 ms. (22 steps per ms) remains 479/479 properties
BEST_FIRST walk for 400 steps (11 resets) in 22 ms. (17 steps per ms) remains 479/479 properties
BEST_FIRST walk for 402 steps (10 resets) in 20 ms. (19 steps per ms) remains 479/479 properties
BEST_FIRST walk for 402 steps (9 resets) in 14 ms. (26 steps per ms) remains 479/479 properties
BEST_FIRST walk for 401 steps (10 resets) in 20 ms. (19 steps per ms) remains 479/479 properties
BEST_FIRST walk for 400 steps (10 resets) in 13 ms. (28 steps per ms) remains 479/479 properties
BEST_FIRST walk for 400 steps (12 resets) in 20 ms. (19 steps per ms) remains 479/479 properties
BEST_FIRST walk for 400 steps (12 resets) in 16 ms. (23 steps per ms) remains 479/479 properties
BEST_FIRST walk for 400 steps (11 resets) in 18 ms. (21 steps per ms) remains 479/479 properties
BEST_FIRST walk for 400 steps (11 resets) in 15 ms. (25 steps per ms) remains 479/479 properties
BEST_FIRST walk for 400 steps (12 resets) in 14 ms. (26 steps per ms) remains 479/479 properties
BEST_FIRST walk for 400 steps (11 resets) in 18 ms. (21 steps per ms) remains 479/479 properties
BEST_FIRST walk for 400 steps (12 resets) in 19 ms. (20 steps per ms) remains 479/479 properties
BEST_FIRST walk for 400 steps (11 resets) in 17 ms. (22 steps per ms) remains 479/479 properties
BEST_FIRST walk for 403 steps (8 resets) in 14 ms. (26 steps per ms) remains 479/479 properties
BEST_FIRST walk for 401 steps (11 resets) in 17 ms. (22 steps per ms) remains 479/479 properties
BEST_FIRST walk for 401 steps (12 resets) in 17 ms. (22 steps per ms) remains 479/479 properties
BEST_FIRST walk for 403 steps (11 resets) in 17 ms. (22 steps per ms) remains 479/479 properties
BEST_FIRST walk for 400 steps (12 resets) in 13 ms. (28 steps per ms) remains 479/479 properties
BEST_FIRST walk for 401 steps (12 resets) in 20 ms. (19 steps per ms) remains 479/479 properties
BEST_FIRST walk for 400 steps (12 resets) in 16 ms. (23 steps per ms) remains 479/479 properties
BEST_FIRST walk for 402 steps (11 resets) in 17 ms. (22 steps per ms) remains 479/479 properties
BEST_FIRST walk for 401 steps (11 resets) in 22 ms. (17 steps per ms) remains 479/479 properties
BEST_FIRST walk for 400 steps (12 resets) in 12 ms. (30 steps per ms) remains 479/479 properties
BEST_FIRST walk for 400 steps (12 resets) in 18 ms. (21 steps per ms) remains 479/479 properties
BEST_FIRST walk for 401 steps (11 resets) in 15 ms. (25 steps per ms) remains 479/479 properties
BEST_FIRST walk for 400 steps (11 resets) in 23 ms. (16 steps per ms) remains 479/479 properties
BEST_FIRST walk for 400 steps (10 resets) in 16 ms. (23 steps per ms) remains 479/479 properties
BEST_FIRST walk for 400 steps (12 resets) in 13 ms. (28 steps per ms) remains 479/479 properties
BEST_FIRST walk for 401 steps (11 resets) in 19 ms. (20 steps per ms) remains 479/479 properties
BEST_FIRST walk for 400 steps (10 resets) in 13 ms. (28 steps per ms) remains 479/479 properties
BEST_FIRST walk for 400 steps (12 resets) in 13 ms. (28 steps per ms) remains 479/479 properties
BEST_FIRST walk for 401 steps (11 resets) in 17 ms. (22 steps per ms) remains 479/479 properties
BEST_FIRST walk for 400 steps (11 resets) in 12 ms. (30 steps per ms) remains 479/479 properties
SDD proceeding with computation,523 properties remain. new max is 4
SDD size :1 after 4
BEST_FIRST walk for 400 steps (12 resets) in 20 ms. (19 steps per ms) remains 479/479 properties
BEST_FIRST walk for 400 steps (12 resets) in 12 ms. (30 steps per ms) remains 479/479 properties
BEST_FIRST walk for 401 steps (11 resets) in 35 ms. (11 steps per ms) remains 479/479 properties
BEST_FIRST walk for 401 steps (10 resets) in 16 ms. (23 steps per ms) remains 479/479 properties
BEST_FIRST walk for 401 steps (10 resets) in 14 ms. (26 steps per ms) remains 479/479 properties
BEST_FIRST walk for 401 steps (10 resets) in 14 ms. (26 steps per ms) remains 479/479 properties
BEST_FIRST walk for 401 steps (10 resets) in 13 ms. (28 steps per ms) remains 479/479 properties
BEST_FIRST walk for 402 steps (10 resets) in 15 ms. (25 steps per ms) remains 479/479 properties
BEST_FIRST walk for 402 steps (9 resets) in 13 ms. (28 steps per ms) remains 479/479 properties
BEST_FIRST walk for 400 steps (12 resets) in 13 ms. (28 steps per ms) remains 479/479 properties
BEST_FIRST walk for 400 steps (12 resets) in 13 ms. (28 steps per ms) remains 479/479 properties
SDD proceeding with computation,523 properties remain. new max is 8
SDD size :4 after 7
Invariant property smplace_523 does not hold.
Invariant property smplace_78 does not hold.
Invariant property smplace_67 does not hold.
Invariant property smplace_56 does not hold.
SDD proceeding with computation,519 properties remain. new max is 8
SDD size :7 after 11
Invariant property smplace_89 does not hold.
Invariant property smplace_12 does not hold.
SDD proceeding with computation,517 properties remain. new max is 8
SDD size :11 after 12
Invariant property smplace_487 does not hold.
Invariant property smplace_486 does not hold.
Invariant property smplace_485 does not hold.
Invariant property smplace_234 does not hold.
Invariant property smplace_211 does not hold.
Invariant property smplace_200 does not hold.
Invariant property smplace_189 does not hold.
Invariant property smplace_178 does not hold.
Invariant property smplace_134 does not hold.
Invariant property smplace_123 does not hold.
Invariant property smplace_112 does not hold.
Invariant property smplace_100 does not hold.
SDD proceeding with computation,505 properties remain. new max is 8
SDD size :12 after 20
Invariant property smplace_256 does not hold.
Invariant property smplace_245 does not hold.
Invariant property smplace_223 does not hold.
SDD proceeding with computation,502 properties remain. new max is 8
SDD size :20 after 23
Invariant property smplace_278 does not hold.
Invariant property smplace_267 does not hold.
Invariant property smplace_23 does not hold.
SDD proceeding with computation,499 properties remain. new max is 8
SDD size :23 after 26
Invariant property smplace_467 does not hold.
Invariant property smplace_456 does not hold.
Invariant property smplace_445 does not hold.
Invariant property smplace_289 does not hold.
SDD proceeding with computation,495 properties remain. new max is 8
SDD size :26 after 29
SDD proceeding with computation,495 properties remain. new max is 16
SDD size :29 after 31
SDD proceeding with computation,495 properties remain. new max is 32
SDD size :31 after 32
SDD proceeding with computation,495 properties remain. new max is 64
SDD size :32 after 44
Invariant property smplace_484 does not hold.
Invariant property smplace_478 does not hold.
SDD proceeding with computation,493 properties remain. new max is 64
SDD size :44 after 57
Invariant property smplace_422 does not hold.
Invariant property smplace_411 does not hold.
Invariant property smplace_400 does not hold.
Invariant property smplace_389 does not hold.
Invariant property smplace_378 does not hold.
Invariant property smplace_367 does not hold.
Invariant property smplace_356 does not hold.
Invariant property smplace_345 does not hold.
Invariant property smplace_334 does not hold.
Invariant property smplace_322 does not hold.
Invariant property smplace_311 does not hold.
Invariant property smplace_300 does not hold.
Invariant property smplace_156 does not hold.
Invariant property smplace_145 does not hold.
SDD proceeding with computation,479 properties remain. new max is 64
SDD size :57 after 77
SDD proceeding with computation,479 properties remain. new max is 128
SDD size :77 after 95
SDD proceeding with computation,479 properties remain. new max is 256
SDD size :95 after 137
Invariant property smplace_533 does not hold.
Invariant property smplace_532 does not hold.
Invariant property smplace_531 does not hold.
Invariant property smplace_516 does not hold.
Invariant property smplace_515 does not hold.
Invariant property smplace_514 does not hold.
Invariant property smplace_513 does not hold.
Invariant property smplace_511 does not hold.
Invariant property smplace_510 does not hold.
Invariant property smplace_509 does not hold.
Invariant property smplace_508 does not hold.
Invariant property smplace_507 does not hold.
Invariant property smplace_506 does not hold.
Invariant property smplace_505 does not hold.
Invariant property smplace_500 does not hold.
Invariant property smplace_499 does not hold.
Invariant property smplace_498 does not hold.
Invariant property smplace_497 does not hold.
Invariant property smplace_496 does not hold.
Invariant property smplace_495 does not hold.
Invariant property smplace_494 does not hold.
Invariant property smplace_493 does not hold.
Invariant property smplace_492 does not hold.
Invariant property smplace_491 does not hold.
Invariant property smplace_489 does not hold.
Invariant property smplace_488 does not hold.
Invariant property smplace_433 does not hold.
Invariant property smplace_167 does not hold.
Invariant property smplace_13 does not hold.
Invariant property smplace_11 does not hold.
Invariant property smplace_10 does not hold.
Invariant property smplace_6 does not hold.
Invariant property smplace_5 does not hold.
Invariant property smplace_4 does not hold.
Invariant property smplace_3 does not hold.
Invariant property smplace_2 does not hold.
SDD proceeding with computation,443 properties remain. new max is 256
SDD size :137 after 194
Invariant property smplace_8 does not hold.
Invariant property smplace_7 does not hold.
SDD proceeding with computation,441 properties remain. new max is 256
SDD size :194 after 511
SDD proceeding with computation,441 properties remain. new max is 512
SDD size :511 after 862
Invariant property smplace_529 does not hold.
Invariant property smplace_528 does not hold.
Invariant property smplace_527 does not hold.
Invariant property smplace_526 does not hold.
Invariant property smplace_525 does not hold.
Invariant property smplace_524 does not hold.
Invariant property smplace_522 does not hold.
Invariant property smplace_521 does not hold.
Invariant property smplace_520 does not hold.
Invariant property smplace_519 does not hold.
Invariant property smplace_518 does not hold.
Invariant property smplace_517 does not hold.
Invariant property smplace_503 does not hold.
Invariant property smplace_502 does not hold.
Invariant property smplace_9 does not hold.
SDD proceeding with computation,426 properties remain. new max is 512
SDD size :862 after 1773
SDD proceeding with computation,426 properties remain. new max is 1024
SDD size :1773 after 3363
Invariant property smplace_530 does not hold.
Invariant property smplace_504 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_66 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_60 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_41 does not hold.
Invariant property smplace_40 does not hold.
Invariant property smplace_39 does not hold.
Invariant property smplace_38 does not hold.
Invariant property smplace_37 does not hold.
Invariant property smplace_36 does not hold.
Invariant property smplace_35 does not hold.
Invariant property smplace_33 does not hold.
Invariant property smplace_32 does not hold.
Invariant property smplace_31 does not hold.
Invariant property smplace_30 does not hold.
Invariant property smplace_26 does not hold.
Invariant property smplace_25 does not hold.
Invariant property smplace_24 does not hold.
Invariant property smplace_22 does not hold.
Invariant property smplace_21 does not hold.
Invariant property smplace_20 does not hold.
Invariant property smplace_19 does not hold.
Invariant property smplace_18 does not hold.
Invariant property smplace_17 does not hold.
Invariant property smplace_16 does not hold.
Invariant property smplace_15 does not hold.
Invariant property smplace_14 does not hold.
SDD proceeding with computation,388 properties remain. new max is 1024
SDD size :3363 after 10260
SDD proceeding with computation,388 properties remain. new max is 2048
SDD size :10260 after 37617
Invariant property smplace_68 does not hold.
Invariant property smplace_54 does not hold.
Invariant property smplace_53 does not hold.
Invariant property smplace_52 does not hold.
Invariant property smplace_51 does not hold.
Invariant property smplace_50 does not hold.
Invariant property smplace_49 does not hold.
Invariant property smplace_48 does not hold.
Invariant property smplace_47 does not hold.
Invariant property smplace_46 does not hold.
Invariant property smplace_44 does not hold.
Invariant property smplace_43 does not hold.
Invariant property smplace_42 does not hold.
Invariant property smplace_28 does not hold.
Invariant property smplace_27 does not hold.
SDD proceeding with computation,373 properties remain. new max is 2048
SDD size :37617 after 143855
SDD proceeding with computation,373 properties remain. new max is 4096
SDD size :143855 after 284282
SDD proceeding with computation,373 properties remain. new max is 8192
SDD size :284282 after 568510
SDD proceeding with computation,373 properties remain. new max is 16384
SDD size :568510 after 1.1534e+06
Probabilistic random walk after 100001 steps, saw 50005 distinct states, run finished after 2725 ms. (steps per millisecond=36 ) properties seen :91
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16687302404100181609.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18036431529984312048.kers'
[2026-05-24 08:18:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16687302404100181609.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18036431529984312048.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 498 rows 534 cols 1404 entries
Finished phase 1 with 449 SingleSign rule and 31 generalized
[2026-05-24 08:18:17] [INFO ] Computed 54 invariants in 21 ms
Computed 54 P flows in 21 ms.
Exported basis to /tmp/petrispot-output-18036431529984312048.kers
Total runtime 22 ms.
Invariant property smplace_130 does not hold.
Invariant property smplace_129 does not hold.
Invariant property smplace_128 does not hold.
Invariant property smplace_124 does not hold.
Invariant property smplace_122 does not hold.
Invariant property smplace_121 does not hold.
Invariant property smplace_120 does not hold.
Invariant property smplace_119 does not hold.
Invariant property smplace_118 does not hold.
Invariant property smplace_117 does not hold.
Invariant property smplace_116 does not hold.
Invariant property smplace_99 does not hold.
Invariant property smplace_98 does not hold.
Invariant property smplace_97 does not hold.
Invariant property smplace_96 does not hold.
Invariant property smplace_95 does not hold.
Invariant property smplace_94 does not hold.
Invariant property smplace_93 does not hold.
Invariant property smplace_92 does not hold.
Invariant property smplace_91 does not hold.
Invariant property smplace_90 does not hold.
Invariant property smplace_88 does not hold.
Invariant property smplace_84 does not hold.
Invariant property smplace_83 does not hold.
Invariant property smplace_82 does not hold.
Invariant property smplace_81 does not hold.
Invariant property smplace_80 does not hold.
Invariant property smplace_79 does not hold.
Invariant property smplace_77 does not hold.
Invariant property smplace_76 does not hold.
Invariant property smplace_75 does not hold.
Invariant property smplace_74 does not hold.
Invariant property smplace_73 does not hold.
Invariant property smplace_72 does not hold.
Invariant property smplace_55 does not hold.
Invariant property smplace_29 does not hold.
SDD proceeding with computation,337 properties remain. new max is 16384
SDD size :1.1534e+06 after 2.41362e+06
Invariant property smplace_126 does not hold.
Invariant property smplace_125 does not hold.
SDD proceeding with computation,335 properties remain. new max is 16384
SDD size :2.41362e+06 after 6.32616e+07
SDD proceeding with computation,335 properties remain. new max is 32768
SDD size :6.32616e+07 after 2.07016e+08
SDD proceeding with computation,335 properties remain. new max is 65536
SDD size :2.07016e+08 after 6.6513e+08
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/373 variables, 21/21 constraints. Problems are: Problem set: 36 solved, 337 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 373/1032 variables, and 21 constraints, problems are : Problem set: 38 solved, 335 unsolved in 5058 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, Generalized P Invariants (flows): 21/49 constraints, State Equation: 0/534 constraints, PredecessorRefiner: 373/373 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 38 solved, 335 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/335 variables, 18/18 constraints. Problems are: Problem set: 38 solved, 335 unsolved
SDD proceeding with computation,335 properties remain. new max is 131072
SDD size :6.6513e+08 after 2.05329e+09
At refinement iteration 1 (INCLUDED_ONLY) 0/335 variables, 0/18 constraints. Problems are: Problem set: 38 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 158/493 variables, 3/21 constraints. Problems are: Problem set: 38 solved, 335 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 493/1032 variables, and 21 constraints, problems are : Problem set: 38 solved, 335 unsolved in 5016 ms.
Refiners :[Positive P Invariants (semi-flows): 3/5 constraints, Generalized P Invariants (flows): 18/49 constraints, State Equation: 0/534 constraints, PredecessorRefiner: 0/373 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10228ms problems are : Problem set: 38 solved, 335 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 335 out of 534 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 534/534 places, 498/498 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 534 transition count 456
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 492 transition count 456
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 84 place count 492 transition count 449
Deduced a syphon composed of 7 places in 12 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 98 place count 485 transition count 449
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 8 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 176 place count 446 transition count 410
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 7 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 190 place count 439 transition count 410
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 200 place count 439 transition count 400
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 210 place count 429 transition count 400
Partial Free-agglomeration rule applied 15 times.
Drop transitions (Partial Free agglomeration) removed 15 transitions
Iterating global reduction 3 with 15 rules applied. Total rules applied 225 place count 429 transition count 400
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 226 place count 428 transition count 399
Applied a total of 226 rules in 161 ms. Remains 428 /534 variables (removed 106) and now considering 399/498 (removed 99) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 171 ms. Remains : 428/534 places, 399/498 transitions.
SDD proceeding with computation,335 properties remain. new max is 262144
SDD size :2.05329e+09 after 6.23837e+09
RANDOM walk for 4000000 steps (512734 resets) in 79335 ms. (50 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40000 steps (3352 resets) in 641 ms. (62 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40002 steps (3336 resets) in 599 ms. (66 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40000 steps (3383 resets) in 655 ms. (60 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40002 steps (3428 resets) in 659 ms. (60 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40002 steps (3409 resets) in 651 ms. (61 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40000 steps (3409 resets) in 544 ms. (73 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40002 steps (3417 resets) in 653 ms. (61 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40001 steps (3366 resets) in 584 ms. (68 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40004 steps (3361 resets) in 625 ms. (63 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40002 steps (3386 resets) in 705 ms. (56 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40001 steps (3363 resets) in 552 ms. (72 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40002 steps (3364 resets) in 577 ms. (69 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40000 steps (3394 resets) in 657 ms. (60 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40001 steps (3370 resets) in 582 ms. (68 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40001 steps (3444 resets) in 666 ms. (59 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40003 steps (3411 resets) in 561 ms. (71 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40003 steps (3367 resets) in 681 ms. (58 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40003 steps (3385 resets) in 648 ms. (61 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40001 steps (3378 resets) in 690 ms. (57 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40001 steps (3398 resets) in 602 ms. (66 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40000 steps (3367 resets) in 659 ms. (60 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40002 steps (3351 resets) in 682 ms. (58 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40002 steps (3399 resets) in 693 ms. (57 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40001 steps (3362 resets) in 564 ms. (70 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40001 steps (3360 resets) in 665 ms. (60 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40002 steps (3426 resets) in 581 ms. (68 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40001 steps (3363 resets) in 536 ms. (74 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40001 steps (3394 resets) in 707 ms. (56 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40001 steps (3367 resets) in 630 ms. (63 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40002 steps (3441 resets) in 590 ms. (67 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40000 steps (3384 resets) in 655 ms. (60 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40002 steps (3369 resets) in 529 ms. (75 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40001 steps (3409 resets) in 591 ms. (67 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40004 steps (3455 resets) in 624 ms. (64 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40000 steps (3384 resets) in 617 ms. (64 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40000 steps (3360 resets) in 613 ms. (65 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40002 steps (3362 resets) in 582 ms. (68 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40001 steps (3396 resets) in 549 ms. (72 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40001 steps (3387 resets) in 581 ms. (68 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40001 steps (3396 resets) in 555 ms. (71 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40002 steps (3384 resets) in 680 ms. (58 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40000 steps (3346 resets) in 536 ms. (74 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40001 steps (3422 resets) in 587 ms. (68 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40002 steps (3416 resets) in 526 ms. (75 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40000 steps (3434 resets) in 596 ms. (67 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40000 steps (3376 resets) in 665 ms. (60 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40002 steps (3402 resets) in 507 ms. (78 steps per ms) remains 335/335 properties
SDD proceeding with computation,335 properties remain. new max is 524288
BEST_FIRST walk for 40000 steps (3391 resets) in 565 ms. (70 steps per ms) remains 335/335 properties
SDD size :6.23837e+09 after 1.85475e+10
BEST_FIRST walk for 40001 steps (3400 resets) in 588 ms. (67 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40003 steps (3464 resets) in 670 ms. (59 steps per ms) remains 335/335 properties
Invariant property smplace_127 does not hold.
Invariant property smplace_114 does not hold.
Invariant property smplace_113 does not hold.
Invariant property smplace_110 does not hold.
Invariant property smplace_109 does not hold.
Invariant property smplace_108 does not hold.
Invariant property smplace_107 does not hold.
Invariant property smplace_106 does not hold.
Invariant property smplace_105 does not hold.
Invariant property smplace_104 does not hold.
Invariant property smplace_103 does not hold.
Invariant property smplace_102 does not hold.
Invariant property smplace_101 does not hold.
Invariant property smplace_86 does not hold.
Invariant property smplace_85 does not hold.
SDD proceeding with computation,320 properties remain. new max is 524288
SDD size :1.85475e+10 after 5.08871e+10
SDD proceeding with computation,320 properties remain. new max is 1048576
SDD size :5.08871e+10 after 8.86916e+10
Interrupted probabilistic random walk after 3542457 steps, run timeout after 90001 ms. (steps per millisecond=39 ) properties seen :0 out of 335
Probabilistic random walk after 3542457 steps, saw 1771251 distinct states, run finished after 90006 ms. (steps per millisecond=39 ) 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-10573677627277501795.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9480938415831488008.kers'
[2026-05-24 08:20:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10573677627277501795.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9480938415831488008.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 399 rows 426 cols 1296 entries
Finished phase 1 with 332 SingleSign rule and 42 generalized
[2026-05-24 08:20:28] [INFO ] Computed 54 invariants in 10 ms
Computed 54 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-9480938415831488008.kers
Total runtime 11 ms.
[2026-05-24 08:20:28] [INFO ] State equation strengthened by 12 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/320 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/320 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 2 (OVERLAPS) 25/345 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/345 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 4 (OVERLAPS) 73/418 variables, 29/48 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/418 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 6 (OVERLAPS) 6/424 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/424 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 8 (OVERLAPS) 399/823 variables, 424/476 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/823 variables, 12/488 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/823 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 11 (OVERLAPS) 4/827 variables, 4/492 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/827 variables, 2/494 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/827 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 320 unsolved
SDD proceeding with computation,320 properties remain. new max is 2097152
SDD size :8.86916e+10 after 1.62972e+11
At refinement iteration 14 (OVERLAPS) 0/827 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 320 unsolved
No progress, stopping.
After SMT solving in domain Real declared 827/827 variables, and 494 constraints, problems are : Problem set: 0 solved, 320 unsolved in 45019 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 428/428 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 320 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/320 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/320 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 2 (OVERLAPS) 25/345 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/345 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/345 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/345 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 7 (OVERLAPS) 73/418 variables, 29/91 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/418 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/418 variables, 11/122 constraints. Problems are: Problem set: 0 solved, 320 unsolved
SMT process timed out in 90706ms, After SMT, problems are : Problem set: 0 solved, 320 unsolved
Fused 320 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 320 out of 428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 428/428 places, 399/399 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 428 transition count 396
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 425 transition count 396
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 425 transition count 395
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 424 transition count 395
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 422 transition count 393
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 14 place count 421 transition count 393
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 17 place count 421 transition count 390
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 20 place count 418 transition count 390
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 21 place count 418 transition count 390
Applied a total of 21 rules in 158 ms. Remains 418 /428 variables (removed 10) and now considering 390/399 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 158 ms. Remains : 418/428 places, 390/399 transitions.
RANDOM walk for 4000000 steps (513471 resets) in 113003 ms. (35 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40001 steps (3391 resets) in 664 ms. (60 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40000 steps (3407 resets) in 858 ms. (46 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40003 steps (3309 resets) in 808 ms. (49 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40000 steps (3357 resets) in 797 ms. (50 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40003 steps (3377 resets) in 1019 ms. (39 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40002 steps (3416 resets) in 1043 ms. (38 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40003 steps (3403 resets) in 775 ms. (51 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40001 steps (3458 resets) in 852 ms. (46 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40003 steps (3383 resets) in 869 ms. (45 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40002 steps (3305 resets) in 850 ms. (47 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40002 steps (3429 resets) in 937 ms. (42 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40002 steps (3388 resets) in 776 ms. (51 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40002 steps (3364 resets) in 766 ms. (52 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40003 steps (3338 resets) in 1017 ms. (39 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40001 steps (3460 resets) in 875 ms. (45 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40001 steps (3347 resets) in 779 ms. (51 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40001 steps (3347 resets) in 892 ms. (44 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40001 steps (3375 resets) in 1036 ms. (38 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40001 steps (3455 resets) in 858 ms. (46 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40000 steps (3320 resets) in 932 ms. (42 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40001 steps (3410 resets) in 648 ms. (61 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40001 steps (3390 resets) in 777 ms. (51 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40001 steps (3378 resets) in 661 ms. (60 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40001 steps (3394 resets) in 817 ms. (48 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40001 steps (3297 resets) in 905 ms. (44 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40003 steps (3414 resets) in 1011 ms. (39 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40002 steps (3337 resets) in 828 ms. (48 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40001 steps (3367 resets) in 836 ms. (47 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40002 steps (3361 resets) in 922 ms. (43 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40003 steps (3415 resets) in 1003 ms. (39 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40001 steps (3465 resets) in 1005 ms. (39 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40002 steps (3390 resets) in 772 ms. (51 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40003 steps (3403 resets) in 970 ms. (41 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40003 steps (3322 resets) in 795 ms. (50 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40002 steps (3400 resets) in 695 ms. (57 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40000 steps (3395 resets) in 724 ms. (55 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40001 steps (3392 resets) in 791 ms. (50 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40002 steps (3374 resets) in 688 ms. (58 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40002 steps (3319 resets) in 765 ms. (52 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40001 steps (3400 resets) in 815 ms. (49 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40001 steps (3374 resets) in 1017 ms. (39 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40000 steps (3274 resets) in 829 ms. (48 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40002 steps (3383 resets) in 892 ms. (44 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40001 steps (3397 resets) in 958 ms. (41 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40003 steps (3373 resets) in 812 ms. (49 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40001 steps (3396 resets) in 755 ms. (52 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40004 steps (3344 resets) in 788 ms. (50 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40001 steps (3394 resets) in 789 ms. (50 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40002 steps (3419 resets) in 758 ms. (52 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40000 steps (3384 resets) in 797 ms. (50 steps per ms) remains 320/320 properties
SDD proceeding with computation,320 properties remain. new max is 4194304
SDD size :1.62972e+11 after 2.88883e+11
Interrupted probabilistic random walk after 4799114 steps, run timeout after 126001 ms. (steps per millisecond=38 ) properties seen :0 out of 320
Probabilistic random walk after 4799114 steps, saw 2399415 distinct states, run finished after 126001 ms. (steps per millisecond=38 ) 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-4882515397770402406.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-686777503008653136.kers'
[2026-05-24 08:24:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4882515397770402406.kers, --Pflows, --basisKERS=/tmp/petrispot-output-686777503008653136.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 390 rows 416 cols 1301 entries
Finished phase 1 with 303 SingleSign rule and 61 generalized
[2026-05-24 08:24:48] [INFO ] Computed 54 invariants in 7 ms
Computed 54 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-686777503008653136.kers
Total runtime 7 ms.
[2026-05-24 08:24:48] [INFO ] State equation strengthened by 14 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/320 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/320 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 2 (OVERLAPS) 13/333 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/333 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 4 (OVERLAPS) 75/408 variables, 18/48 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/408 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 6 (OVERLAPS) 6/414 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/414 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 8 (OVERLAPS) 390/804 variables, 414/466 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/804 variables, 14/480 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/804 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 11 (OVERLAPS) 4/808 variables, 4/484 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/808 variables, 2/486 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/808 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 14 (OVERLAPS) 0/808 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 320 unsolved
No progress, stopping.
After SMT solving in domain Real declared 808/808 variables, and 486 constraints, problems are : Problem set: 0 solved, 320 unsolved in 46405 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 418/418 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 320 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/320 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/320 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 2 (OVERLAPS) 13/333 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/333 variables, 5/35 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/333 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 5 (OVERLAPS) 75/408 variables, 18/53 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 9 (OVERLAPS) 6/414 variables, 4/78 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/414 variables, 3/81 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/414 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/414 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 13 (OVERLAPS) 390/804 variables, 414/496 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/804 variables, 14/510 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/804 variables, 320/830 constraints. Problems are: Problem set: 0 solved, 320 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 804/808 variables, and 830 constraints, problems are : Problem set: 0 solved, 320 unsolved in 75023 ms.
Refiners :[Positive P Invariants (semi-flows): 1/3 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 414/418 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 121463ms problems are : Problem set: 0 solved, 320 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 320 out of 418 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 418/418 places, 390/390 transitions.
Applied a total of 0 rules in 14 ms. Remains 418 /418 variables (removed 0) and now considering 390/390 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 418/418 places, 390/390 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 418/418 places, 390/390 transitions.
Applied a total of 0 rules in 10 ms. Remains 418 /418 variables (removed 0) and now considering 390/390 (removed 0) transitions.
[2026-05-24 08:26:49] [INFO ] Invariant cache hit.
[2026-05-24 08:26:50] [INFO ] Implicit Places using invariants in 941 ms returned [20, 26, 47, 211, 336, 409, 415]
[2026-05-24 08:26:50] [INFO ] Actually due to overlaps returned [336, 211]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 956 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 416/418 places, 390/390 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 416 transition count 389
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 415 transition count 389
Applied a total of 2 rules in 19 ms. Remains 415 /416 variables (removed 1) and now considering 389/390 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-911363482545421320.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18091828842944070263.kers'
[2026-05-24 08:26:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-911363482545421320.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18091828842944070263.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 389 rows 413 cols 1276 entries
Finished phase 1 with 306 SingleSign rule and 57 generalized
[2026-05-24 08:26:50] [INFO ] Computed 52 invariants in 6 ms
Computed 52 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-18091828842944070263.kers
Total runtime 6 ms.
[2026-05-24 08:26:51] [INFO ] Implicit Places using invariants in 825 ms returned [20, 26, 47, 406, 412]
[2026-05-24 08:26:51] [INFO ] Actually due to overlaps returned [412, 406]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 830 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 413/418 places, 389/390 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 413 transition count 388
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 412 transition count 388
Applied a total of 2 rules in 38 ms. Remains 412 /413 variables (removed 1) and now considering 388/389 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7711666972160242874.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6053404885568820165.kers'
[2026-05-24 08:26:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7711666972160242874.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6053404885568820165.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 388 rows 410 cols 1259 entries
Finished phase 1 with 310 SingleSign rule and 52 generalized
[2026-05-24 08:26:51] [INFO ] Computed 50 invariants in 10 ms
Computed 50 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-6053404885568820165.kers
Total runtime 12 ms.
[2026-05-24 08:26:52] [INFO ] Implicit Places using invariants in 683 ms returned [20, 26, 47]
[2026-05-24 08:26:52] [INFO ] Actually due to overlaps returned [26, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 688 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 410/418 places, 388/390 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 410 transition count 387
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 409 transition count 387
Applied a total of 2 rules in 27 ms. Remains 409 /410 variables (removed 1) and now considering 387/388 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14680669385843923655.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14374478137488097485.kers'
[2026-05-24 08:26:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14680669385843923655.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14374478137488097485.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 387 rows 407 cols 1248 entries
Finished phase 1 with 310 SingleSign rule and 51 generalized
[2026-05-24 08:26:52] [INFO ] Computed 48 invariants in 6 ms
Computed 48 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-14374478137488097485.kers
Total runtime 7 ms.
[2026-05-24 08:26:52] [INFO ] Implicit Places using invariants in 551 ms returned [44]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 553 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 408/418 places, 387/390 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 408 transition count 387
Applied a total of 1 rules in 19 ms. Remains 408 /408 variables (removed 0) and now considering 387/387 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2472897034609520835.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17866970167584692237.kers'
[2026-05-24 08:26:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2472897034609520835.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17866970167584692237.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 387 rows 406 cols 1246 entries
Finished phase 1 with 310 SingleSign rule and 51 generalized
[2026-05-24 08:26:52] [INFO ] Computed 47 invariants in 6 ms
Computed 47 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-17866970167584692237.kers
Total runtime 6 ms.
[2026-05-24 08:26:53] [INFO ] Implicit Places using invariants in 566 ms returned []
[2026-05-24 08:26:53] [INFO ] Invariant cache hit.
[2026-05-24 08:26:53] [INFO ] State equation strengthened by 14 read => feed constraints.
[2026-05-24 08:26:54] [INFO ] Implicit Places using invariants and state equation in 1339 ms returned []
Implicit Place search using SMT with State Equation took 1914 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 408/418 places, 387/390 transitions.
Finished structural reductions in REACHABILITY mode , in 5 iterations and 5060 ms. Remains : 408/418 places, 387/390 transitions.
RANDOM walk for 4000000 steps (576890 resets) in 74067 ms. (54 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40001 steps (3685 resets) in 606 ms. (65 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40003 steps (3695 resets) in 651 ms. (61 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40000 steps (3652 resets) in 549 ms. (72 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40000 steps (3646 resets) in 630 ms. (63 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40002 steps (3631 resets) in 529 ms. (75 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40000 steps (3598 resets) in 639 ms. (62 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40000 steps (3643 resets) in 559 ms. (71 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40003 steps (3700 resets) in 608 ms. (65 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40003 steps (3653 resets) in 529 ms. (75 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40001 steps (3642 resets) in 589 ms. (67 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40001 steps (3701 resets) in 498 ms. (80 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40002 steps (3616 resets) in 614 ms. (65 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40000 steps (3676 resets) in 462 ms. (86 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40000 steps (3652 resets) in 496 ms. (80 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40000 steps (3574 resets) in 486 ms. (82 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40001 steps (3632 resets) in 498 ms. (80 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40001 steps (3624 resets) in 566 ms. (70 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40002 steps (3659 resets) in 554 ms. (72 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40001 steps (3628 resets) in 587 ms. (68 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40000 steps (3607 resets) in 521 ms. (76 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40001 steps (3684 resets) in 607 ms. (65 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40002 steps (3641 resets) in 510 ms. (78 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40002 steps (3660 resets) in 558 ms. (71 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40001 steps (3619 resets) in 539 ms. (74 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40003 steps (3705 resets) in 509 ms. (78 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40001 steps (3644 resets) in 632 ms. (63 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40003 steps (3615 resets) in 642 ms. (62 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40001 steps (3691 resets) in 533 ms. (74 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40000 steps (3680 resets) in 593 ms. (67 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40003 steps (3628 resets) in 495 ms. (80 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40001 steps (3693 resets) in 534 ms. (74 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40002 steps (3696 resets) in 551 ms. (72 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40001 steps (3634 resets) in 593 ms. (67 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40003 steps (3644 resets) in 471 ms. (84 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40002 steps (3599 resets) in 548 ms. (72 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40001 steps (3590 resets) in 502 ms. (79 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40001 steps (3604 resets) in 572 ms. (69 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40000 steps (3670 resets) in 621 ms. (64 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40001 steps (3673 resets) in 602 ms. (66 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40001 steps (3650 resets) in 496 ms. (80 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40002 steps (3636 resets) in 517 ms. (77 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40001 steps (3721 resets) in 539 ms. (74 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40002 steps (3619 resets) in 628 ms. (63 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40003 steps (3618 resets) in 490 ms. (81 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40001 steps (3616 resets) in 512 ms. (77 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40001 steps (3648 resets) in 627 ms. (63 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40000 steps (3673 resets) in 500 ms. (79 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40002 steps (3698 resets) in 618 ms. (64 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40000 steps (3635 resets) in 485 ms. (82 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40004 steps (3591 resets) in 584 ms. (68 steps per ms) remains 320/320 properties
Detected timeout of ITS tools.
[2026-05-24 08:28:14] [INFO ] Flatten gal took : 52 ms
[2026-05-24 08:28:14] [INFO ] Applying decomposition
[2026-05-24 08:28:14] [INFO ] Flatten gal took : 47 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/graph1759505779218484568.txt' '-o' '/tmp/graph1759505779218484568.bin' '-w' '/tmp/graph1759505779218484568.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1759505779218484568.bin' '-l' '-1' '-v' '-w' '/tmp/graph1759505779218484568.weights' '-q' '0' '-e' '0.001'
[2026-05-24 08:28:14] [INFO ] Decomposing Gal with order
[2026-05-24 08:28:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 08:28:15] [INFO ] Removed a total of 136 redundant transitions.
[2026-05-24 08:28:15] [INFO ] Flatten gal took : 136 ms
[2026-05-24 08:28:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 16 ms.
[2026-05-24 08:28:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10005563346942411175.gal : 19 ms
[2026-05-24 08:28:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7262629365253485615.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/ReachabilityCardinality10005563346942411175.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7262629365253485615.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/ReachabilityCardinality7262629365253485615.prop.
SDD proceeding with computation,320 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,320 properties remain. new max is 8
SDD size :1 after 8
SDD proceeding with computation,320 properties remain. new max is 16
SDD size :8 after 168
SDD proceeding with computation,320 properties remain. new max is 32
SDD size :168 after 3783
Interrupted probabilistic random walk after 4147025 steps, run timeout after 87001 ms. (steps per millisecond=47 ) properties seen :0 out of 320
Probabilistic random walk after 4147025 steps, saw 2073327 distinct states, run finished after 87001 ms. (steps per millisecond=47 ) properties seen :0
[2026-05-24 08:28:50] [INFO ] Invariant cache hit.
[2026-05-24 08:28:50] [INFO ] State equation strengthened by 14 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/320 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/320 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 2 (OVERLAPS) 13/333 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/333 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 4 (OVERLAPS) 61/394 variables, 11/41 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 6 (OVERLAPS) 8/402 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/402 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 8 (OVERLAPS) 2/404 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/404 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 10 (OVERLAPS) 387/791 variables, 404/449 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/791 variables, 14/463 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/791 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 13 (OVERLAPS) 4/795 variables, 4/467 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/795 variables, 2/469 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/795 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 16 (OVERLAPS) 0/795 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 320 unsolved
No progress, stopping.
After SMT solving in domain Real declared 795/795 variables, and 469 constraints, problems are : Problem set: 0 solved, 320 unsolved in 49195 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 408/408 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 320 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/320 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/320 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 2 (OVERLAPS) 13/333 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/333 variables, 5/35 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/333 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 5 (OVERLAPS) 61/394 variables, 11/46 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/394 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/394 variables, 3/75 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/394 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 10 (OVERLAPS) 8/402 variables, 3/78 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/402 variables, 3/81 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/402 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 13 (OVERLAPS) 2/404 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/404 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 15 (OVERLAPS) 387/791 variables, 404/486 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/791 variables, 14/500 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/791 variables, 320/820 constraints. Problems are: Problem set: 0 solved, 320 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 791/795 variables, and 820 constraints, problems are : Problem set: 0 solved, 320 unsolved in 90028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/3 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 404/408 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 37/37 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 139251ms problems are : Problem set: 0 solved, 320 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 320 out of 408 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 408/408 places, 387/387 transitions.
Applied a total of 0 rules in 14 ms. Remains 408 /408 variables (removed 0) and now considering 387/387 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 408/408 places, 387/387 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 408/408 places, 387/387 transitions.
Applied a total of 0 rules in 23 ms. Remains 408 /408 variables (removed 0) and now considering 387/387 (removed 0) transitions.
[2026-05-24 08:31:10] [INFO ] Invariant cache hit.
[2026-05-24 08:31:10] [INFO ] Implicit Places using invariants in 572 ms returned []
[2026-05-24 08:31:10] [INFO ] Invariant cache hit.
[2026-05-24 08:31:10] [INFO ] State equation strengthened by 14 read => feed constraints.
[2026-05-24 08:31:11] [INFO ] Implicit Places using invariants and state equation in 1300 ms returned []
Implicit Place search using SMT with State Equation took 1876 ms to find 0 implicit places.
[2026-05-24 08:31:11] [INFO ] Redundant transitions in 25 ms returned []
Running 386 sub problems to find dead transitions.
[2026-05-24 08:31:11] [INFO ] Invariant cache hit.
[2026-05-24 08:31:11] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/403 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/403 variables, 38/40 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/403 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 3 (OVERLAPS) 2/405 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/405 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/405 variables, 5/50 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 16/66 constraints. Problems are: Problem set: 0 solved, 386 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 405/795 variables, and 66 constraints, problems are : Problem set: 0 solved, 386 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 42/44 constraints, State Equation: 0/408 constraints, ReadFeed: 0/14 constraints, PredecessorRefiner: 386/386 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 386 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/403 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/403 variables, 38/40 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/403 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 3 (OVERLAPS) 2/405 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/405 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/405 variables, 21/66 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/405 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/405 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 9 (OVERLAPS) 3/408 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 386 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 408/795 variables, and 71 constraints, problems are : Problem set: 0 solved, 386 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 0/408 constraints, ReadFeed: 0/14 constraints, PredecessorRefiner: 0/386 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60085ms problems are : Problem set: 0 solved, 386 unsolved
Search for dead transitions found 0 dead transitions in 60089ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62037 ms. Remains : 408/408 places, 387/387 transitions.
RANDOM walk for 400000 steps (57880 resets) in 8318 ms. (48 steps per ms) remains 320/320 properties
Running SMT prover for 320 properties.
[2026-05-24 08:32:14] [INFO ] Invariant cache hit.
[2026-05-24 08:32:14] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2026-05-24 08:32:14] [INFO ] [Real]Absence check using 3 positive and 44 generalized place invariants in 21 ms returned sat
[2026-05-24 08:32:17] [INFO ] After 2302ms SMT Verify possible using state equation in real domain returned unsat :0 sat :320
[2026-05-24 08:32:17] [INFO ] State equation strengthened by 14 read => feed constraints.
[2026-05-24 08:32:19] [INFO ] After 2146ms SMT Verify possible using 14 Read/Feed constraints in real domain returned unsat :0 sat :320
TRAPS : Iteration 0
TRAPS : Iteration 1
[2026-05-24 08:32:30] [INFO ] After 12900ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:320
[2026-05-24 08:32:30] [INFO ] After 15484ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:320
[2026-05-24 08:32:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-24 08:32:30] [INFO ] [Nat]Absence check using 3 positive and 44 generalized place invariants in 30 ms returned sat
[2026-05-24 08:32:32] [INFO ] After 2061ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :320
[2026-05-24 08:32:34] [INFO ] After 2355ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :320
TRAPS : Iteration 0
[2026-05-24 08:32:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 588 ms
[2026-05-24 08:32:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 265 ms
[2026-05-24 08:32:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 275 ms
[2026-05-24 08:32:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 357 ms
[2026-05-24 08:32:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 541 ms
[2026-05-24 08:32:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
[2026-05-24 08:32:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 206 ms
[2026-05-24 08:32:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 210 ms
[2026-05-24 08:32:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 332 ms
[2026-05-24 08:32:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 151 ms
[2026-05-24 08:32:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 223 ms
[2026-05-24 08:32:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 267 ms
[2026-05-24 08:32:44] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 607 ms
[2026-05-24 08:32:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 240 ms
[2026-05-24 08:32:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 232 ms
[2026-05-24 08:32:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 206 ms
[2026-05-24 08:32:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 222 ms
[2026-05-24 08:32:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 202 ms
[2026-05-24 08:32:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
[2026-05-24 08:32:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 231 ms
[2026-05-24 08:32:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 220 ms
[2026-05-24 08:32:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 220 ms
[2026-05-24 08:32:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
[2026-05-24 08:32:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 186 ms
[2026-05-24 08:32:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 226 ms
[2026-05-24 08:32:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 368 ms
[2026-05-24 08:32:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 215 ms
TRAPS : Iteration 1
SDD proceeding with computation,320 properties remain. new max is 64
SDD size :3783 after 2.38615e+06
SDD proceeding with computation,320 properties remain. new max is 128
SDD size :2.38615e+06 after 2.38729e+06
SDD proceeding with computation,320 properties remain. new max is 256
SDD size :2.38729e+06 after 2.4071e+06
[2026-05-24 08:34:40] [INFO ] Trap strengthening (SAT) tested/added 563/562 trap constraints in 103902 ms
[2026-05-24 08:34:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 428 ms
SDD proceeding with computation,320 properties remain. new max is 512
SDD size :2.4071e+06 after 2.50815e+06
[2026-05-24 08:35:24] [INFO ] Trap strengthening (SAT) tested/added 204/203 trap constraints in 39505 ms
[2026-05-24 08:35:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 141 ms
[2026-05-24 08:35:32] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 614 ms
[2026-05-24 08:35:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 144 ms
[2026-05-24 08:35:37] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1060 ms
[2026-05-24 08:35:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 245 ms
[2026-05-24 08:35:40] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 927 ms
[2026-05-24 08:35:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 228 ms
[2026-05-24 08:35:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 242 ms
TRAPS : Iteration 2
SMT process timed out, exceeded limit of 100
[2026-05-24 08:35:50] [INFO ] After 197475ms SMT Verify possible using After timeout in natural domain returned unsat :0 sat :320
[2026-05-24 08:35:50] [INFO ] After 200023ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :320
RANDOM walk for 4000000 steps (577756 resets) in 76022 ms. (52 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40001 steps (3669 resets) in 633 ms. (63 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40002 steps (3645 resets) in 642 ms. (62 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40002 steps (3652 resets) in 533 ms. (74 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40000 steps (3676 resets) in 612 ms. (65 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40001 steps (3663 resets) in 496 ms. (80 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40003 steps (3647 resets) in 537 ms. (74 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40002 steps (3635 resets) in 539 ms. (74 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40002 steps (3666 resets) in 519 ms. (76 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40003 steps (3683 resets) in 540 ms. (73 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40000 steps (3630 resets) in 602 ms. (66 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40000 steps (3676 resets) in 452 ms. (88 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40001 steps (3589 resets) in 651 ms. (61 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40001 steps (3628 resets) in 491 ms. (81 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40000 steps (3645 resets) in 548 ms. (72 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40003 steps (3643 resets) in 539 ms. (74 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40001 steps (3721 resets) in 620 ms. (64 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40001 steps (3648 resets) in 494 ms. (80 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40001 steps (3591 resets) in 495 ms. (80 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40000 steps (3685 resets) in 543 ms. (73 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40000 steps (3634 resets) in 670 ms. (59 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40000 steps (3668 resets) in 589 ms. (67 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40003 steps (3676 resets) in 658 ms. (60 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40002 steps (3622 resets) in 510 ms. (78 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40002 steps (3638 resets) in 619 ms. (64 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40002 steps (3634 resets) in 515 ms. (77 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40000 steps (3640 resets) in 510 ms. (78 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40001 steps (3607 resets) in 542 ms. (73 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40001 steps (3682 resets) in 629 ms. (63 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40002 steps (3691 resets) in 499 ms. (80 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40002 steps (3644 resets) in 612 ms. (65 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40001 steps (3685 resets) in 535 ms. (74 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40001 steps (3695 resets) in 603 ms. (66 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40001 steps (3643 resets) in 486 ms. (82 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40002 steps (3692 resets) in 598 ms. (66 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40001 steps (3666 resets) in 509 ms. (78 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40001 steps (3680 resets) in 622 ms. (64 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40003 steps (3669 resets) in 489 ms. (81 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40001 steps (3629 resets) in 474 ms. (84 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40002 steps (3630 resets) in 594 ms. (67 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40001 steps (3678 resets) in 531 ms. (75 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40001 steps (3729 resets) in 615 ms. (64 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40001 steps (3638 resets) in 492 ms. (81 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40001 steps (3673 resets) in 592 ms. (67 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40001 steps (3604 resets) in 562 ms. (71 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40003 steps (3684 resets) in 607 ms. (65 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40001 steps (3576 resets) in 486 ms. (82 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40001 steps (3716 resets) in 639 ms. (62 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40000 steps (3729 resets) in 549 ms. (72 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40000 steps (3631 resets) in 653 ms. (61 steps per ms) remains 320/320 properties
BEST_FIRST walk for 40003 steps (3661 resets) in 636 ms. (62 steps per ms) remains 320/320 properties
Interrupted probabilistic random walk after 3856618 steps, run timeout after 87001 ms. (steps per millisecond=44 ) properties seen :0 out of 320
Probabilistic random walk after 3856618 steps, saw 1928166 distinct states, run finished after 87001 ms. (steps per millisecond=44 ) properties seen :0
[2026-05-24 08:37:46] [INFO ] Invariant cache hit.
[2026-05-24 08:37:46] [INFO ] State equation strengthened by 14 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/320 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/320 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 2 (OVERLAPS) 13/333 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/333 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 4 (OVERLAPS) 61/394 variables, 11/41 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 6 (OVERLAPS) 8/402 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/402 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 8 (OVERLAPS) 2/404 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/404 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 10 (OVERLAPS) 387/791 variables, 404/449 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/791 variables, 14/463 constraints. Problems are: Problem set: 0 solved, 320 unsolved
Detected timeout of ITS tools.
At refinement iteration 12 (INCLUDED_ONLY) 0/791 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 13 (OVERLAPS) 4/795 variables, 4/467 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/795 variables, 2/469 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/795 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 16 (OVERLAPS) 0/795 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 320 unsolved
No progress, stopping.
After SMT solving in domain Real declared 795/795 variables, and 469 constraints, problems are : Problem set: 0 solved, 320 unsolved in 56418 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 408/408 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 320 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/320 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/320 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 2 (OVERLAPS) 13/333 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/333 variables, 5/35 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/333 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 5 (OVERLAPS) 61/394 variables, 11/46 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/394 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/394 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/394 variables, 10/105 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/394 variables, 5/110 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/394 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 12 (OVERLAPS) 8/402 variables, 3/113 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/402 variables, 4/117 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/402 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 15 (OVERLAPS) 2/404 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/404 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 17 (OVERLAPS) 387/791 variables, 404/522 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/791 variables, 14/536 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/791 variables, 320/856 constraints. Problems are: Problem set: 0 solved, 320 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 791/795 variables, and 856 constraints, problems are : Problem set: 0 solved, 320 unsolved in 105028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/3 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 404/408 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 73/73 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 161473ms problems are : Problem set: 0 solved, 320 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 320 out of 408 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 408/408 places, 387/387 transitions.
Applied a total of 0 rules in 9 ms. Remains 408 /408 variables (removed 0) and now considering 387/387 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 408/408 places, 387/387 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 408/408 places, 387/387 transitions.
Applied a total of 0 rules in 7 ms. Remains 408 /408 variables (removed 0) and now considering 387/387 (removed 0) transitions.
[2026-05-24 08:40:28] [INFO ] Invariant cache hit.
[2026-05-24 08:40:28] [INFO ] Implicit Places using invariants in 574 ms returned []
[2026-05-24 08:40:28] [INFO ] Invariant cache hit.
[2026-05-24 08:40:28] [INFO ] State equation strengthened by 14 read => feed constraints.
[2026-05-24 08:40:30] [INFO ] Implicit Places using invariants and state equation in 1353 ms returned []
Implicit Place search using SMT with State Equation took 1931 ms to find 0 implicit places.
[2026-05-24 08:40:30] [INFO ] Redundant transitions in 11 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1960 ms. Remains : 408/408 places, 387/387 transitions.
RANDOM walk for 400000 steps (57685 resets) in 6001 ms. (66 steps per ms) remains 320/320 properties
Running SMT prover for 320 properties.
[2026-05-24 08:40:31] [INFO ] Invariant cache hit.
[2026-05-24 08:40:31] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-24 08:40:31] [INFO ] [Real]Absence check using 3 positive and 44 generalized place invariants in 22 ms returned sat
[2026-05-24 08:40:34] [INFO ] After 2344ms SMT Verify possible using state equation in real domain returned unsat :0 sat :320
[2026-05-24 08:40:34] [INFO ] State equation strengthened by 14 read => feed constraints.
[2026-05-24 08:40:36] [INFO ] After 2183ms SMT Verify possible using 14 Read/Feed constraints in real domain returned unsat :0 sat :320
TRAPS : Iteration 0
TRAPS : Iteration 1
[2026-05-24 08:40:47] [INFO ] After 12917ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:320
[2026-05-24 08:40:47] [INFO ] After 15523ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:320
[2026-05-24 08:40:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2026-05-24 08:40:47] [INFO ] [Nat]Absence check using 3 positive and 44 generalized place invariants in 25 ms returned sat
[2026-05-24 08:40:49] [INFO ] After 2158ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :320
[2026-05-24 08:40:52] [INFO ] After 2436ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :320
TRAPS : Iteration 0
[2026-05-24 08:40:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 583 ms
[2026-05-24 08:40:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 269 ms
[2026-05-24 08:40:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 266 ms
[2026-05-24 08:40:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 416 ms
[2026-05-24 08:40:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 565 ms
[2026-05-24 08:40:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 147 ms
[2026-05-24 08:40:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 205 ms
[2026-05-24 08:40:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 243 ms
[2026-05-24 08:40:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 366 ms
[2026-05-24 08:40:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
[2026-05-24 08:41:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 235 ms
[2026-05-24 08:41:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 284 ms
[2026-05-24 08:41:01] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 686 ms
[2026-05-24 08:41:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 262 ms
[2026-05-24 08:41:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 227 ms
[2026-05-24 08:41:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 222 ms
[2026-05-24 08:41:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 237 ms
[2026-05-24 08:41:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 210 ms
[2026-05-24 08:41:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 154 ms
[2026-05-24 08:41:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 254 ms
[2026-05-24 08:41:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 224 ms
[2026-05-24 08:41:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 227 ms
[2026-05-24 08:41:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2026-05-24 08:41:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 231 ms
[2026-05-24 08:41:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 235 ms
[2026-05-24 08:41:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 398 ms
[2026-05-24 08:41:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 250 ms
TRAPS : Iteration 1
[2026-05-24 08:43:07] [INFO ] Trap strengthening (SAT) tested/added 563/562 trap constraints in 113718 ms
[2026-05-24 08:43:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 415 ms
[2026-05-24 08:43:55] [INFO ] Trap strengthening (SAT) tested/added 204/203 trap constraints in 41892 ms
[2026-05-24 08:44:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 141 ms
[2026-05-24 08:44:02] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 659 ms
[2026-05-24 08:44:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 158 ms
[2026-05-24 08:44:07] [INFO ] Trap strengthening (SAT) tested/added 5/5 trap constraints in 1081 ms
SMT process timed out, exceeded limit of 100
[2026-05-24 08:44:07] [INFO ] After 197411ms SMT Verify possible using After timeout in natural domain returned unsat :0 sat :319
[2026-05-24 08:44:07] [INFO ] After 200037ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :319
RANDOM walk for 40000 steps (5802 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3677 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 620643 steps, run timeout after 3001 ms. (steps per millisecond=206 ) properties seen :0 out of 1
Probabilistic random walk after 620643 steps, saw 310389 distinct states, run finished after 3001 ms. (steps per millisecond=206 ) properties seen :0
[2026-05-24 08:44:10] [INFO ] Invariant cache hit.
[2026-05-24 08:44:10] [INFO ] State equation strengthened by 14 read => feed constraints.
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) 85/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 306/392 variables, 39/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/392 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/402 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/402 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/404 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/404 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 387/791 variables, 404/449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/791 variables, 14/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/791 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 4/795 variables, 4/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/795 variables, 2/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/795 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/795 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 795/795 variables, and 469 constraints, problems are : Problem set: 0 solved, 1 unsolved in 271 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 408/408 constraints, ReadFeed: 14/14 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) 85/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 306/392 variables, 39/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/392 variables, 6/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/402 variables, 4/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/402 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/402 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/404 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/404 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 387/791 variables, 404/457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/791 variables, 14/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/791 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/791 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/795 variables, 4/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/795 variables, 2/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/795 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/795 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 795/795 variables, and 478 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1700 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 408/408 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2011ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 56 ms.
Support contains 1 out of 408 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 408/408 places, 387/387 transitions.
Graph (complete) has 902 edges and 408 vertex of which 402 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 74 transitions
Trivial Post-agglo rules discarded 74 transitions
Performed 74 trivial Post agglomeration. Transition count delta: 74
Iterating post reduction 0 with 77 rules applied. Total rules applied 78 place count 401 transition count 311
Reduce places removed 74 places and 0 transitions.
Iterating post reduction 1 with 74 rules applied. Total rules applied 152 place count 327 transition count 311
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 152 place count 327 transition count 299
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 176 place count 315 transition count 299
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 2 with 110 rules applied. Total rules applied 286 place count 260 transition count 244
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 306 place count 250 transition count 244
Free-agglomeration rule (complex) applied 23 times.
Iterating global reduction 2 with 23 rules applied. Total rules applied 329 place count 250 transition count 221
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 2 with 23 rules applied. Total rules applied 352 place count 227 transition count 221
Partial Free-agglomeration rule applied 26 times.
Drop transitions (Partial Free agglomeration) removed 26 transitions
Iterating global reduction 3 with 26 rules applied. Total rules applied 378 place count 227 transition count 221
Applied a total of 378 rules in 46 ms. Remains 227 /408 variables (removed 181) and now considering 221/387 (removed 166) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 227/408 places, 221/387 transitions.
RANDOM walk for 40000 steps (5698 resets) in 206 ms. (193 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3679 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 816504 steps, run timeout after 3001 ms. (steps per millisecond=272 ) properties seen :0 out of 1
Probabilistic random walk after 816504 steps, saw 408340 distinct states, run finished after 3001 ms. (steps per millisecond=272 ) 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-2804900313951680839.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17304490684411241084.kers'
[2026-05-24 08:44:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2804900313951680839.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17304490684411241084.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 221 rows 225 cols 1284 entries
Finished phase 1 with 137 SingleSign rule and 47 generalized
[2026-05-24 08:44:15] [INFO ] Computed 43 invariants in 1 ms
Computed 43 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-17304490684411241084.kers
Total runtime 2 ms.
[2026-05-24 08:44:15] [INFO ] State equation strengthened by 38 read => feed constraints.
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) 127/128 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 91/219 variables, 37/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/223 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 221/444 variables, 223/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/444 variables, 38/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/444 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/448 variables, 4/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/448 variables, 2/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/448 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/448 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 448/448 variables, and 308 constraints, problems are : Problem set: 0 solved, 1 unsolved in 169 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 227/227 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 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) 127/128 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 91/219 variables, 37/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 4/223 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 7/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/223 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 221/444 variables, 223/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/444 variables, 38/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/444 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/444 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/448 variables, 4/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/448 variables, 2/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/448 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/448 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 448/448 variables, and 317 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1230 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 227/227 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1444ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 46 ms.
Support contains 1 out of 227 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 221/221 transitions.
Applied a total of 0 rules in 5 ms. Remains 227 /227 variables (removed 0) and now considering 221/221 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 227/227 places, 221/221 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 221/221 transitions.
Applied a total of 0 rules in 5 ms. Remains 227 /227 variables (removed 0) and now considering 221/221 (removed 0) transitions.
[2026-05-24 08:44:17] [INFO ] Invariant cache hit.
[2026-05-24 08:44:17] [INFO ] Implicit Places using invariants in 579 ms returned [48, 70, 75, 95, 101, 122, 127, 147, 152, 173, 179, 193, 198]
[2026-05-24 08:44:17] [INFO ] Actually due to overlaps returned [48]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 593 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 226/227 places, 221/221 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 226 transition count 220
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 225 transition count 220
Applied a total of 2 rules in 10 ms. Remains 225 /226 variables (removed 1) and now considering 220/221 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5145655447185859704.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10215873543867924134.kers'
[2026-05-24 08:44:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5145655447185859704.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10215873543867924134.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 220 rows 223 cols 1253 entries
Finished phase 1 with 136 SingleSign rule and 47 generalized
[2026-05-24 08:44:17] [INFO ] Computed 42 invariants in 1 ms
Computed 42 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-10215873543867924134.kers
Total runtime 7 ms.
[2026-05-24 08:44:18] [INFO ] Implicit Places using invariants in 818 ms returned [68, 73, 93, 99, 120, 125, 145, 150, 171, 177, 191, 196]
[2026-05-24 08:44:18] [INFO ] Actually due to overlaps returned [73, 68]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 824 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 223/227 places, 220/221 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 223 transition count 219
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 222 transition count 219
Applied a total of 2 rules in 15 ms. Remains 222 /223 variables (removed 1) and now considering 219/220 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1715924832457261129.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3952285421951439103.kers'
[2026-05-24 08:44:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1715924832457261129.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3952285421951439103.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 219 rows 220 cols 1224 entries
Finished phase 1 with 136 SingleSign rule and 46 generalized
[2026-05-24 08:44:18] [INFO ] Computed 40 invariants in 2 ms
Computed 40 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3952285421951439103.kers
Total runtime 2 ms.
[2026-05-24 08:44:19] [INFO ] Implicit Places using invariants in 608 ms returned [90, 96, 117, 122, 142, 147, 168, 174, 188, 193]
[2026-05-24 08:44:19] [INFO ] Actually due to overlaps returned [96, 90]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 614 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 220/227 places, 219/221 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 220 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 219 transition count 218
Applied a total of 2 rules in 14 ms. Remains 219 /220 variables (removed 1) and now considering 218/219 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3684291189515164809.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3953631501283225294.kers'
[2026-05-24 08:44:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3684291189515164809.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3953631501283225294.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 218 rows 217 cols 1200 entries
Finished phase 1 with 136 SingleSign rule and 45 generalized
[2026-05-24 08:44:19] [INFO ] Computed 38 invariants in 1 ms
Computed 38 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3953631501283225294.kers
Total runtime 2 ms.
[2026-05-24 08:44:19] [INFO ] Implicit Places using invariants in 554 ms returned [114, 119, 139, 144, 165, 171, 185, 190]
[2026-05-24 08:44:19] [INFO ] Actually due to overlaps returned [119, 114]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 556 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 217/227 places, 218/221 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 217 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 216 transition count 217
Applied a total of 2 rules in 12 ms. Remains 216 /217 variables (removed 1) and now considering 217/218 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12268382789332598727.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7041376533733088879.kers'
[2026-05-24 08:44:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12268382789332598727.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7041376533733088879.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 217 rows 214 cols 1181 entries
Finished phase 1 with 136 SingleSign rule and 44 generalized
[2026-05-24 08:44:19] [INFO ] Computed 36 invariants in 1 ms
Computed 36 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7041376533733088879.kers
Total runtime 2 ms.
[2026-05-24 08:44:20] [INFO ] Implicit Places using invariants in 393 ms returned [136, 141, 162, 168, 182, 187]
[2026-05-24 08:44:20] [INFO ] Actually due to overlaps returned [141, 136]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 396 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 214/227 places, 217/221 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 214 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 213 transition count 216
Applied a total of 2 rules in 9 ms. Remains 213 /214 variables (removed 1) and now considering 216/217 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13165097939271249835.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12255646239314509954.kers'
[2026-05-24 08:44:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13165097939271249835.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12255646239314509954.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 216 rows 211 cols 1167 entries
Finished phase 1 with 136 SingleSign rule and 43 generalized
[2026-05-24 08:44:20] [INFO ] Computed 34 invariants in 1 ms
Computed 34 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12255646239314509954.kers
Total runtime 1 ms.
[2026-05-24 08:44:20] [INFO ] Implicit Places using invariants in 572 ms returned [159, 165, 179, 184]
[2026-05-24 08:44:20] [INFO ] Actually due to overlaps returned [159, 165]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 573 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 211/227 places, 216/221 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 211 transition count 215
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 210 transition count 215
Applied a total of 2 rules in 27 ms. Remains 210 /211 variables (removed 1) and now considering 215/216 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6614570811799657031.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16394107453614291844.kers'
[2026-05-24 08:44:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6614570811799657031.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16394107453614291844.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 215 rows 208 cols 1158 entries
Finished phase 1 with 136 SingleSign rule and 42 generalized
[2026-05-24 08:44:20] [INFO ] Computed 32 invariants in 1 ms
Computed 32 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16394107453614291844.kers
Total runtime 2 ms.
[2026-05-24 08:44:21] [INFO ] Implicit Places using invariants in 464 ms returned [176, 181]
[2026-05-24 08:44:21] [INFO ] Actually due to overlaps returned [176]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 469 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 209/227 places, 215/221 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 208 transition count 214
Applied a total of 2 rules in 13 ms. Remains 208 /209 variables (removed 1) and now considering 214/215 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16745959723831253880.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10098061942830017293.kers'
[2026-05-24 08:44:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16745959723831253880.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10098061942830017293.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 214 rows 206 cols 1151 entries
Finished phase 1 with 131 SingleSign rule and 46 generalized
[2026-05-24 08:44:21] [INFO ] Computed 31 invariants in 1 ms
Computed 31 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10098061942830017293.kers
Total runtime 2 ms.
[2026-05-24 08:44:21] [INFO ] Implicit Places using invariants in 410 ms returned []
[2026-05-24 08:44:21] [INFO ] Invariant cache hit.
[2026-05-24 08:44:21] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-24 08:44:23] [INFO ] Implicit Places using invariants and state equation in 1525 ms returned []
Implicit Place search using SMT with State Equation took 1956 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 208/227 places, 214/221 transitions.
Finished structural reductions in REACHABILITY mode , in 8 iterations and 6087 ms. Remains : 208/227 places, 214/221 transitions.
RANDOM walk for 40000 steps (5757 resets) in 72 ms. (547 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3666 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 853425 steps, run timeout after 3001 ms. (steps per millisecond=284 ) properties seen :0 out of 1
Probabilistic random walk after 853425 steps, saw 426802 distinct states, run finished after 3001 ms. (steps per millisecond=284 ) properties seen :0
[2026-05-24 08:44:26] [INFO ] Invariant cache hit.
[2026-05-24 08:44:26] [INFO ] State equation strengthened by 38 read => feed constraints.
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) 140/141 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 60/201 variables, 25/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/203 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 214/417 variables, 203/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/417 variables, 38/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/417 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/422 variables, 5/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/422 variables, 2/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/422 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/422 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 422/422 variables, and 277 constraints, problems are : Problem set: 0 solved, 1 unsolved in 159 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 208/208 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 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) 140/141 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 60/201 variables, 25/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/203 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 214/417 variables, 203/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/417 variables, 38/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/417 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/417 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/422 variables, 5/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/422 variables, 2/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/422 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/422 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 422/422 variables, and 287 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1020 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 208/208 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1183ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 54 ms.
Support contains 1 out of 208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 4 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 208/208 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 4 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2026-05-24 08:44:27] [INFO ] Invariant cache hit.
[2026-05-24 08:44:27] [INFO ] Implicit Places using invariants in 347 ms returned []
[2026-05-24 08:44:27] [INFO ] Invariant cache hit.
[2026-05-24 08:44:27] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-24 08:44:29] [INFO ] Implicit Places using invariants and state equation in 1479 ms returned []
Implicit Place search using SMT with State Equation took 1828 ms to find 0 implicit places.
[2026-05-24 08:44:29] [INFO ] Redundant transitions in 2 ms returned []
Running 213 sub problems to find dead transitions.
[2026-05-24 08:44:29] [INFO ] Invariant cache hit.
[2026-05-24 08:44:29] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/207 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (OVERLAPS) 1/208 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (OVERLAPS) 214/422 variables, 208/241 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/422 variables, 38/279 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/422 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 213 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/422 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 422/422 variables, and 279 constraints, problems are : Problem set: 0 solved, 213 unsolved in 19976 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 208/208 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/207 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (OVERLAPS) 1/208 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (OVERLAPS) 214/422 variables, 208/241 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/422 variables, 38/279 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/422 variables, 213/492 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/422 variables, 20/512 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 422/422 variables, and 512 constraints, problems are : Problem set: 0 solved, 213 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 208/208 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50026ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 50027ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51867 ms. Remains : 208/208 places, 214/214 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 208 transition count 196
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 190 transition count 196
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 181 transition count 187
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 181 transition count 187
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 180 transition count 186
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 180 transition count 184
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 178 transition count 184
Applied a total of 60 rules in 33 ms. Remains 178 /208 variables (removed 30) and now considering 184/214 (removed 30) transitions.
Running SMT prover for 1 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14318211891677398518.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3097124561879219854.kers'
[2026-05-24 08:45:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14318211891677398518.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3097124561879219854.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 184 rows 176 cols 1064 entries
Finished phase 1 with 104 SingleSign rule and 43 generalized
[2026-05-24 08:45:19] [INFO ] Computed 31 invariants in 2 ms
Computed 31 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3097124561879219854.kers
Total runtime 2 ms.
[2026-05-24 08:45:19] [INFO ] After 122ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-24 08:45:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2026-05-24 08:45:19] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 15 ms returned sat
[2026-05-24 08:45:19] [INFO ] After 138ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-24 08:45:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 08:45:19] [INFO ] After 10ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 08:45:19] [INFO ] After 22ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 08:45:19] [INFO ] After 254ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 433 ms.
RANDOM walk for 40000 steps (5810 resets) in 82 ms. (481 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3599 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 634493 steps, run timeout after 3001 ms. (steps per millisecond=211 ) properties seen :0 out of 1
Probabilistic random walk after 634493 steps, saw 317314 distinct states, run finished after 3001 ms. (steps per millisecond=211 ) 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-12052285634978536024.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10233267857815490214.kers'
[2026-05-24 08:45:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12052285634978536024.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10233267857815490214.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 387 rows 406 cols 1246 entries
Finished phase 1 with 310 SingleSign rule and 51 generalized
[2026-05-24 08:45:22] [INFO ] Computed 47 invariants in 6 ms
Computed 47 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-10233267857815490214.kers
Total runtime 7 ms.
[2026-05-24 08:45:22] [INFO ] State equation strengthened by 14 read => feed constraints.
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) 149/150 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/151 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 251/402 variables, 39/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/402 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/404 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/404 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 387/791 variables, 404/449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/791 variables, 14/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/791 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 4/795 variables, 4/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/795 variables, 2/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/795 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/795 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 795/795 variables, and 469 constraints, problems are : Problem set: 0 solved, 1 unsolved in 275 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 408/408 constraints, ReadFeed: 14/14 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) 149/150 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1/151 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 251/402 variables, 39/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/402 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/402 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/404 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/404 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 387/791 variables, 404/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/791 variables, 14/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/791 variables, 1/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/791 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/795 variables, 4/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/795 variables, 2/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/795 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/795 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 795/795 variables, and 476 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1288 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 408/408 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1607ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 35 ms.
Support contains 1 out of 408 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 408/408 places, 387/387 transitions.
Graph (complete) has 902 edges and 408 vertex of which 402 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 74 transitions
Trivial Post-agglo rules discarded 74 transitions
Performed 74 trivial Post agglomeration. Transition count delta: 74
Iterating post reduction 0 with 77 rules applied. Total rules applied 78 place count 401 transition count 311
Reduce places removed 74 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 75 rules applied. Total rules applied 153 place count 327 transition count 310
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 154 place count 326 transition count 310
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 154 place count 326 transition count 298
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 178 place count 314 transition count 298
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 3 with 110 rules applied. Total rules applied 288 place count 259 transition count 243
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 308 place count 249 transition count 243
Free-agglomeration rule (complex) applied 21 times.
Iterating global reduction 3 with 21 rules applied. Total rules applied 329 place count 249 transition count 222
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 3 with 21 rules applied. Total rules applied 350 place count 228 transition count 222
Partial Free-agglomeration rule applied 26 times.
Drop transitions (Partial Free agglomeration) removed 26 transitions
Iterating global reduction 4 with 26 rules applied. Total rules applied 376 place count 228 transition count 222
Applied a total of 376 rules in 34 ms. Remains 228 /408 variables (removed 180) and now considering 222/387 (removed 165) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 228/408 places, 222/387 transitions.
RANDOM walk for 40000 steps (5728 resets) in 62 ms. (634 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3654 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 862818 steps, run timeout after 3001 ms. (steps per millisecond=287 ) properties seen :0 out of 1
Probabilistic random walk after 862818 steps, saw 431494 distinct states, run finished after 3001 ms. (steps per millisecond=287 ) 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-18029592550513286205.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10442734242044500772.kers'
[2026-05-24 08:45:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18029592550513286205.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10442734242044500772.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 222 rows 226 cols 1152 entries
Finished phase 1 with 138 SingleSign rule and 47 generalized
[2026-05-24 08:45:27] [INFO ] Computed 43 invariants in 1 ms
Computed 43 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-10442734242044500772.kers
Total runtime 2 ms.
[2026-05-24 08:45:27] [INFO ] State equation strengthened by 38 read => feed constraints.
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) 165/166 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 54/220 variables, 26/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/224 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 222/446 variables, 224/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/446 variables, 38/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/446 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/450 variables, 4/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/450 variables, 2/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/450 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/450 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 450/450 variables, and 309 constraints, problems are : Problem set: 0 solved, 1 unsolved in 146 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 228/228 constraints, ReadFeed: 38/38 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) 165/166 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 54/220 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/220 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/224 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/224 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 222/446 variables, 224/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/446 variables, 38/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/446 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/446 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 4/450 variables, 4/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/450 variables, 2/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/450 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/450 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 450/450 variables, and 314 constraints, problems are : Problem set: 0 solved, 1 unsolved in 759 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 228/228 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 938ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 36 ms.
Support contains 1 out of 228 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 228/228 places, 222/222 transitions.
Applied a total of 0 rules in 4 ms. Remains 228 /228 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 228/228 places, 222/222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 228/228 places, 222/222 transitions.
Applied a total of 0 rules in 5 ms. Remains 228 /228 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2026-05-24 08:45:28] [INFO ] Invariant cache hit.
[2026-05-24 08:45:28] [INFO ] Implicit Places using invariants in 408 ms returned [70, 75, 96, 102, 123, 128, 148, 153, 174, 180, 194, 199]
[2026-05-24 08:45:28] [INFO ] Actually due to overlaps returned [75, 70]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 419 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 226/228 places, 222/222 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 226 transition count 221
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 225 transition count 221
Applied a total of 2 rules in 9 ms. Remains 225 /226 variables (removed 1) and now considering 221/222 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4294235609117856224.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4201013580638425696.kers'
[2026-05-24 08:45:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4294235609117856224.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4201013580638425696.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 221 rows 223 cols 1123 entries
Finished phase 1 with 138 SingleSign rule and 46 generalized
[2026-05-24 08:45:28] [INFO ] Computed 41 invariants in 1 ms
Computed 41 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4201013580638425696.kers
Total runtime 2 ms.
[2026-05-24 08:45:29] [INFO ] Implicit Places using invariants in 436 ms returned [93, 99, 120, 125, 145, 150, 171, 177, 191, 196]
[2026-05-24 08:45:29] [INFO ] Actually due to overlaps returned [99, 93]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 438 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 223/228 places, 221/222 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 223 transition count 220
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 222 transition count 220
Applied a total of 2 rules in 8 ms. Remains 222 /223 variables (removed 1) and now considering 220/221 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12601834244840834204.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15049191350645395352.kers'
[2026-05-24 08:45:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12601834244840834204.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15049191350645395352.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 220 rows 220 cols 1099 entries
Finished phase 1 with 138 SingleSign rule and 45 generalized
[2026-05-24 08:45:29] [INFO ] Computed 39 invariants in 1 ms
Computed 39 P flows in 18 ms.
Exported basis to /tmp/petrispot-output-15049191350645395352.kers
Total runtime 19 ms.
[2026-05-24 08:45:29] [INFO ] Implicit Places using invariants in 490 ms returned [117, 122, 142, 147, 168, 174, 188, 193]
[2026-05-24 08:45:29] [INFO ] Actually due to overlaps returned [122, 117]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 504 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 220/228 places, 220/222 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 220 transition count 219
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 219 transition count 219
Applied a total of 2 rules in 10 ms. Remains 219 /220 variables (removed 1) and now considering 219/220 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10210433872216994591.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7549587497174002420.kers'
[2026-05-24 08:45:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10210433872216994591.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7549587497174002420.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 219 rows 217 cols 1080 entries
Finished phase 1 with 138 SingleSign rule and 44 generalized
[2026-05-24 08:45:29] [INFO ] Computed 37 invariants in 1 ms
Computed 37 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7549587497174002420.kers
Total runtime 2 ms.
[2026-05-24 08:45:30] [INFO ] Implicit Places using invariants in 459 ms returned [139, 144, 165, 171, 185, 190]
[2026-05-24 08:45:30] [INFO ] Actually due to overlaps returned [144, 139]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 473 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 217/228 places, 219/222 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 217 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 216 transition count 218
Applied a total of 2 rules in 9 ms. Remains 216 /217 variables (removed 1) and now considering 218/219 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4758952817193259484.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-827660914808570798.kers'
[2026-05-24 08:45:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4758952817193259484.kers, --Pflows, --basisKERS=/tmp/petrispot-output-827660914808570798.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 218 rows 214 cols 1066 entries
Finished phase 1 with 138 SingleSign rule and 43 generalized
[2026-05-24 08:45:30] [INFO ] Computed 35 invariants in 1 ms
Computed 35 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-827660914808570798.kers
Total runtime 2 ms.
[2026-05-24 08:45:30] [INFO ] Implicit Places using invariants in 374 ms returned [162, 168, 182, 187]
[2026-05-24 08:45:30] [INFO ] Actually due to overlaps returned [162, 168]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 377 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 214/228 places, 218/222 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 214 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 213 transition count 217
Applied a total of 2 rules in 7 ms. Remains 213 /214 variables (removed 1) and now considering 217/218 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5445973079699031834.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7654110739495984478.kers'
[2026-05-24 08:45:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5445973079699031834.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7654110739495984478.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 217 rows 211 cols 1057 entries
Finished phase 1 with 138 SingleSign rule and 42 generalized
[2026-05-24 08:45:30] [INFO ] Computed 33 invariants in 1 ms
Computed 33 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7654110739495984478.kers
Total runtime 1 ms.
[2026-05-24 08:45:31] [INFO ] Implicit Places using invariants in 309 ms returned [179, 184]
[2026-05-24 08:45:31] [INFO ] Actually due to overlaps returned [179]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 319 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 212/228 places, 217/222 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 211 transition count 216
Applied a total of 2 rules in 5 ms. Remains 211 /212 variables (removed 1) and now considering 216/217 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8562083120266632427.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13224008029914240197.kers'
[2026-05-24 08:45:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8562083120266632427.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13224008029914240197.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 216 rows 209 cols 1050 entries
Finished phase 1 with 133 SingleSign rule and 46 generalized
[2026-05-24 08:45:31] [INFO ] Computed 32 invariants in 1 ms
Computed 32 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13224008029914240197.kers
Total runtime 1 ms.
[2026-05-24 08:45:31] [INFO ] Implicit Places using invariants in 287 ms returned []
[2026-05-24 08:45:31] [INFO ] Invariant cache hit.
[2026-05-24 08:45:31] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-24 08:45:33] [INFO ] Implicit Places using invariants and state equation in 1936 ms returned []
Implicit Place search using SMT with State Equation took 2243 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 211/228 places, 216/222 transitions.
Finished structural reductions in REACHABILITY mode , in 7 iterations and 4834 ms. Remains : 211/228 places, 216/222 transitions.
RANDOM walk for 40000 steps (5790 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3623 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 872259 steps, run timeout after 3001 ms. (steps per millisecond=290 ) properties seen :0 out of 1
Probabilistic random walk after 872259 steps, saw 436206 distinct states, run finished after 3001 ms. (steps per millisecond=290 ) properties seen :0
[2026-05-24 08:45:36] [INFO ] Invariant cache hit.
[2026-05-24 08:45:36] [INFO ] State equation strengthened by 38 read => feed constraints.
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) 148/149 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 55/204 variables, 22/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/206 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 216/422 variables, 206/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/422 variables, 38/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/422 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/427 variables, 5/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/427 variables, 2/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/427 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/427 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 427/427 variables, and 281 constraints, problems are : Problem set: 0 solved, 1 unsolved in 160 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 211/211 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 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) 148/149 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 55/204 variables, 22/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/206 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 216/422 variables, 206/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/422 variables, 38/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/422 variables, 1/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/422 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/427 variables, 5/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/427 variables, 2/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/427 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/427 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 427/427 variables, and 285 constraints, problems are : Problem set: 0 solved, 1 unsolved in 591 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 211/211 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 780ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 33 ms.
Support contains 1 out of 211 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 216/216 transitions.
Applied a total of 0 rules in 5 ms. Remains 211 /211 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 211/211 places, 216/216 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 216/216 transitions.
Applied a total of 0 rules in 5 ms. Remains 211 /211 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2026-05-24 08:45:37] [INFO ] Invariant cache hit.
[2026-05-24 08:45:37] [INFO ] Implicit Places using invariants in 269 ms returned []
[2026-05-24 08:45:37] [INFO ] Invariant cache hit.
[2026-05-24 08:45:37] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-24 08:45:39] [INFO ] Implicit Places using invariants and state equation in 1936 ms returned []
Implicit Place search using SMT with State Equation took 2242 ms to find 0 implicit places.
[2026-05-24 08:45:39] [INFO ] Redundant transitions in 1 ms returned []
Running 215 sub problems to find dead transitions.
[2026-05-24 08:45:39] [INFO ] Invariant cache hit.
[2026-05-24 08:45:39] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/210 variables, 27/29 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (OVERLAPS) 1/211 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/211 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (OVERLAPS) 216/427 variables, 211/245 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/427 variables, 38/283 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/427 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 215 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/427 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 427/427 variables, and 283 constraints, problems are : Problem set: 0 solved, 215 unsolved in 20179 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 211/211 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/210 variables, 27/29 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (OVERLAPS) 1/211 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/211 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (OVERLAPS) 216/427 variables, 211/245 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/427 variables, 38/283 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/427 variables, 215/498 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/427 variables, 20/518 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 427/427 variables, and 520 constraints, problems are : Problem set: 0 solved, 215 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 211/211 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50223ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 50223ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52477 ms. Remains : 211/211 places, 216/216 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 211 transition count 198
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 193 transition count 198
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 185 transition count 190
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 185 transition count 190
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 184 transition count 189
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 184 transition count 187
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 182 transition count 187
Applied a total of 58 rules in 28 ms. Remains 182 /211 variables (removed 29) and now considering 187/216 (removed 29) transitions.
Running SMT prover for 1 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11535989639959738051.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12719749998628881111.kers'
[2026-05-24 08:46:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11535989639959738051.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12719749998628881111.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 187 rows 180 cols 968 entries
Finished phase 1 with 109 SingleSign rule and 41 generalized
[2026-05-24 08:46:29] [INFO ] Computed 32 invariants in 2 ms
Computed 32 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12719749998628881111.kers
Total runtime 3 ms.
[2026-05-24 08:46:29] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-24 08:46:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2026-05-24 08:46:29] [INFO ] [Nat]Absence check using 3 positive and 29 generalized place invariants in 8 ms returned sat
[2026-05-24 08:46:29] [INFO ] After 70ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-24 08:46:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 08:46:29] [INFO ] After 8ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 08:46:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 186 ms
TRAPS : Iteration 1
[2026-05-24 08:46:30] [INFO ] After 211ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 08:46:30] [INFO ] After 342ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 444 ms.
RANDOM walk for 40000 steps (5816 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3696 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 644228 steps, run timeout after 3001 ms. (steps per millisecond=214 ) properties seen :0 out of 1
Probabilistic random walk after 644228 steps, saw 322183 distinct states, run finished after 3002 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-364805962164114053.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8831051836882927374.kers'
[2026-05-24 08:46:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-364805962164114053.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8831051836882927374.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 387 rows 406 cols 1246 entries
Finished phase 1 with 310 SingleSign rule and 51 generalized
[2026-05-24 08:46:33] [INFO ] Computed 47 invariants in 12 ms
Computed 47 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-8831051836882927374.kers
Total runtime 13 ms.
[2026-05-24 08:46:33] [INFO ] State equation strengthened by 14 read => feed constraints.
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) 16/17 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 84/101 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 291/392 variables, 37/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/392 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 10/402 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/402 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/404 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/404 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 387/791 variables, 404/449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/791 variables, 14/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/791 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 4/795 variables, 4/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/795 variables, 2/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/795 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/795 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 795/795 variables, and 469 constraints, problems are : Problem set: 0 solved, 1 unsolved in 262 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 408/408 constraints, ReadFeed: 14/14 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) 16/17 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 84/101 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 291/392 variables, 37/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/392 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/392 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 10/402 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/402 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/402 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/404 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/404 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 387/791 variables, 404/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/791 variables, 14/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/791 variables, 1/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/791 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/795 variables, 4/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/795 variables, 2/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/795 variables, 3/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/795 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/795 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 795/795 variables, and 477 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1762 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 408/408 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2064ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 83 ms.
Support contains 1 out of 408 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 408/408 places, 387/387 transitions.
Graph (complete) has 902 edges and 408 vertex of which 402 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 75 rules applied. Total rules applied 76 place count 401 transition count 313
Reduce places removed 72 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 73 rules applied. Total rules applied 149 place count 329 transition count 312
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 150 place count 328 transition count 312
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 150 place count 328 transition count 300
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 174 place count 316 transition count 300
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 3 with 110 rules applied. Total rules applied 284 place count 261 transition count 245
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 304 place count 251 transition count 245
Free-agglomeration rule (complex) applied 26 times.
Iterating global reduction 3 with 26 rules applied. Total rules applied 330 place count 251 transition count 219
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 3 with 26 rules applied. Total rules applied 356 place count 225 transition count 219
Partial Free-agglomeration rule applied 25 times.
Drop transitions (Partial Free agglomeration) removed 25 transitions
Iterating global reduction 4 with 25 rules applied. Total rules applied 381 place count 225 transition count 219
Applied a total of 381 rules in 28 ms. Remains 225 /408 variables (removed 183) and now considering 219/387 (removed 168) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 225/408 places, 219/387 transitions.
RANDOM walk for 40000 steps (5809 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3654 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 849477 steps, run timeout after 3001 ms. (steps per millisecond=283 ) properties seen :0 out of 1
Probabilistic random walk after 849477 steps, saw 424824 distinct states, run finished after 3001 ms. (steps per millisecond=283 ) 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-862211252657773335.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12017126453752421200.kers'
[2026-05-24 08:46:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-862211252657773335.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12017126453752421200.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 219 rows 223 cols 1280 entries
Finished phase 1 with 135 SingleSign rule and 47 generalized
[2026-05-24 08:46:38] [INFO ] Computed 43 invariants in 6 ms
Computed 43 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-12017126453752421200.kers
Total runtime 7 ms.
[2026-05-24 08:46:38] [INFO ] State equation strengthened by 38 read => feed constraints.
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) 164/165 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 52/217 variables, 24/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/217 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/221 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 219/440 variables, 221/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/440 variables, 38/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/440 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/444 variables, 4/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/444 variables, 2/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/444 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/444 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 444/444 variables, and 306 constraints, problems are : Problem set: 0 solved, 1 unsolved in 165 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 225/225 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 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) 164/165 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 52/217 variables, 24/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/217 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/221 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/221 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/221 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 219/440 variables, 221/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/440 variables, 38/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/440 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/440 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 4/444 variables, 4/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 2/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/444 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/444 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 444/444 variables, and 315 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1293 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 225/225 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1495ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 34 ms.
Support contains 1 out of 225 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 225/225 places, 219/219 transitions.
Applied a total of 0 rules in 3 ms. Remains 225 /225 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 225/225 places, 219/219 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 225/225 places, 219/219 transitions.
Applied a total of 0 rules in 4 ms. Remains 225 /225 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2026-05-24 08:46:39] [INFO ] Invariant cache hit.
[2026-05-24 08:46:40] [INFO ] Implicit Places using invariants in 746 ms returned [47, 68, 73, 93, 99, 120, 125, 145, 150, 171, 177, 191, 196]
[2026-05-24 08:46:40] [INFO ] Actually due to overlaps returned [47]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 756 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 224/225 places, 219/219 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 224 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 223 transition count 218
Applied a total of 2 rules in 11 ms. Remains 223 /224 variables (removed 1) and now considering 218/219 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17412341400362952273.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4221957937977703108.kers'
[2026-05-24 08:46:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17412341400362952273.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4221957937977703108.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 218 rows 221 cols 1249 entries
Finished phase 1 with 134 SingleSign rule and 47 generalized
[2026-05-24 08:46:40] [INFO ] Computed 42 invariants in 1 ms
Computed 42 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4221957937977703108.kers
Total runtime 2 ms.
[2026-05-24 08:46:41] [INFO ] Implicit Places using invariants in 524 ms returned [66, 71, 91, 97, 118, 123, 143, 148, 169, 175, 189, 194]
[2026-05-24 08:46:41] [INFO ] Actually due to overlaps returned [71, 66]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 547 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 221/225 places, 218/219 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 221 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 220 transition count 217
Applied a total of 2 rules in 8 ms. Remains 220 /221 variables (removed 1) and now considering 217/218 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3227958819770967069.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1865471802009222880.kers'
[2026-05-24 08:46:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3227958819770967069.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1865471802009222880.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 217 rows 218 cols 1220 entries
Finished phase 1 with 134 SingleSign rule and 46 generalized
[2026-05-24 08:46:41] [INFO ] Computed 40 invariants in 1 ms
Computed 40 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1865471802009222880.kers
Total runtime 6 ms.
[2026-05-24 08:46:41] [INFO ] Implicit Places using invariants in 473 ms returned [88, 94, 115, 120, 140, 145, 166, 172, 186, 191]
[2026-05-24 08:46:41] [INFO ] Actually due to overlaps returned [94, 88]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 476 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 218/225 places, 217/219 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 218 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 217 transition count 216
Applied a total of 2 rules in 12 ms. Remains 217 /218 variables (removed 1) and now considering 216/217 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9199027132080466320.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12099096724429985565.kers'
[2026-05-24 08:46:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9199027132080466320.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12099096724429985565.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 216 rows 215 cols 1196 entries
Finished phase 1 with 134 SingleSign rule and 45 generalized
[2026-05-24 08:46:41] [INFO ] Computed 38 invariants in 1 ms
Computed 38 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-12099096724429985565.kers
Total runtime 4 ms.
[2026-05-24 08:46:42] [INFO ] Implicit Places using invariants in 459 ms returned [112, 117, 137, 142, 163, 169, 183, 188]
[2026-05-24 08:46:42] [INFO ] Actually due to overlaps returned [117, 112]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 482 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 215/225 places, 216/219 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 215 transition count 215
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 214 transition count 215
Applied a total of 2 rules in 7 ms. Remains 214 /215 variables (removed 1) and now considering 215/216 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17563651612184942062.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3595046383148731147.kers'
[2026-05-24 08:46:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17563651612184942062.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3595046383148731147.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 215 rows 212 cols 1177 entries
Finished phase 1 with 134 SingleSign rule and 44 generalized
[2026-05-24 08:46:42] [INFO ] Computed 36 invariants in 1 ms
Computed 36 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3595046383148731147.kers
Total runtime 2 ms.
[2026-05-24 08:46:42] [INFO ] Implicit Places using invariants in 413 ms returned [134, 139, 160, 166, 180, 185]
[2026-05-24 08:46:42] [INFO ] Actually due to overlaps returned [139, 134]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 428 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 212/225 places, 215/219 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 212 transition count 214
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 211 transition count 214
Applied a total of 2 rules in 6 ms. Remains 211 /212 variables (removed 1) and now considering 214/215 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16889494910524142906.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17313491791230711638.kers'
[2026-05-24 08:46:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16889494910524142906.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17313491791230711638.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 214 rows 209 cols 1163 entries
Finished phase 1 with 134 SingleSign rule and 43 generalized
[2026-05-24 08:46:42] [INFO ] Computed 34 invariants in 1 ms
Computed 34 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17313491791230711638.kers
Total runtime 2 ms.
[2026-05-24 08:46:42] [INFO ] Implicit Places using invariants in 368 ms returned [157, 163, 177, 182]
[2026-05-24 08:46:42] [INFO ] Actually due to overlaps returned [157, 163]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 373 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 209/225 places, 214/219 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 209 transition count 213
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 208 transition count 213
Applied a total of 2 rules in 6 ms. Remains 208 /209 variables (removed 1) and now considering 213/214 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1692490042882941308.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9445793742096685947.kers'
[2026-05-24 08:46:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1692490042882941308.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9445793742096685947.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 213 rows 206 cols 1154 entries
Finished phase 1 with 134 SingleSign rule and 42 generalized
[2026-05-24 08:46:43] [INFO ] Computed 32 invariants in 2 ms
Computed 32 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9445793742096685947.kers
Total runtime 3 ms.
[2026-05-24 08:46:43] [INFO ] Implicit Places using invariants in 340 ms returned [174, 179]
[2026-05-24 08:46:43] [INFO ] Actually due to overlaps returned [174]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 353 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 207/225 places, 213/219 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 206 transition count 212
Applied a total of 2 rules in 5 ms. Remains 206 /207 variables (removed 1) and now considering 212/213 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11449491739374535427.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8621192685362548598.kers'
[2026-05-24 08:46:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11449491739374535427.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8621192685362548598.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 212 rows 204 cols 1147 entries
Finished phase 1 with 129 SingleSign rule and 46 generalized
[2026-05-24 08:46:43] [INFO ] Computed 31 invariants in 2 ms
Computed 31 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-8621192685362548598.kers
Total runtime 2 ms.
[2026-05-24 08:46:43] [INFO ] Implicit Places using invariants in 326 ms returned []
[2026-05-24 08:46:43] [INFO ] Invariant cache hit.
[2026-05-24 08:46:43] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-24 08:46:45] [INFO ] Implicit Places using invariants and state equation in 2079 ms returned []
Implicit Place search using SMT with State Equation took 2422 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 206/225 places, 212/219 transitions.
Finished structural reductions in REACHABILITY mode , in 8 iterations and 5896 ms. Remains : 206/225 places, 212/219 transitions.
RANDOM walk for 40000 steps (5689 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3626 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 853079 steps, run timeout after 3001 ms. (steps per millisecond=284 ) properties seen :0 out of 1
Probabilistic random walk after 853079 steps, saw 426622 distinct states, run finished after 3001 ms. (steps per millisecond=284 ) properties seen :0
[2026-05-24 08:46:48] [INFO ] Invariant cache hit.
[2026-05-24 08:46:48] [INFO ] State equation strengthened by 38 read => feed constraints.
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) 146/147 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 52/199 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/201 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 212/413 variables, 201/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/413 variables, 38/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/413 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/418 variables, 5/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/418 variables, 2/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/418 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/418 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 418/418 variables, and 275 constraints, problems are : Problem set: 0 solved, 1 unsolved in 138 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 206/206 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 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) 146/147 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 16/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 52/199 variables, 20/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 10/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/201 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 212/413 variables, 201/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/413 variables, 38/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/413 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/413 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 5/418 variables, 5/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/418 variables, 2/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/418 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/418 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 418/418 variables, and 303 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2947 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 206/206 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3120ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 33 ms.
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 206/206 places, 212/212 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
[2026-05-24 08:46:51] [INFO ] Invariant cache hit.
[2026-05-24 08:46:52] [INFO ] Implicit Places using invariants in 342 ms returned []
[2026-05-24 08:46:52] [INFO ] Invariant cache hit.
[2026-05-24 08:46:52] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-24 08:46:54] [INFO ] Implicit Places using invariants and state equation in 2150 ms returned []
Implicit Place search using SMT with State Equation took 2505 ms to find 0 implicit places.
[2026-05-24 08:46:54] [INFO ] Redundant transitions in 1 ms returned []
Running 211 sub problems to find dead transitions.
[2026-05-24 08:46:54] [INFO ] Invariant cache hit.
[2026-05-24 08:46:54] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/205 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (OVERLAPS) 1/206 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (OVERLAPS) 212/418 variables, 206/237 constraints. Problems are: Problem set: 0 solved, 211 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/418 variables, 38/275 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/418 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 8 (OVERLAPS) 0/418 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Real declared 418/418 variables, and 275 constraints, problems are : Problem set: 0 solved, 211 unsolved in 13957 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 206/206 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 211 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/205 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (OVERLAPS) 1/206 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (OVERLAPS) 212/418 variables, 206/237 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/418 variables, 38/275 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/418 variables, 211/486 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/418 variables, 16/502 constraints. Problems are: Problem set: 0 solved, 211 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 418/418 variables, and 502 constraints, problems are : Problem set: 0 solved, 211 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 206/206 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44026ms problems are : Problem set: 0 solved, 211 unsolved
Search for dead transitions found 0 dead transitions in 44027ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46551 ms. Remains : 206/206 places, 212/212 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 206 transition count 194
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 188 transition count 194
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 179 transition count 185
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 179 transition count 185
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 178 transition count 184
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 178 transition count 182
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 176 transition count 182
Applied a total of 60 rules in 10 ms. Remains 176 /206 variables (removed 30) and now considering 182/212 (removed 30) transitions.
Running SMT prover for 1 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3009596872781887953.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6816720560178747551.kers'
[2026-05-24 08:47:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3009596872781887953.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6816720560178747551.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 182 rows 174 cols 1060 entries
Finished phase 1 with 104 SingleSign rule and 41 generalized
[2026-05-24 08:47:38] [INFO ] Computed 31 invariants in 2 ms
Computed 31 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6816720560178747551.kers
Total runtime 2 ms.
[2026-05-24 08:47:38] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-24 08:47:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2026-05-24 08:47:38] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 8 ms returned sat
[2026-05-24 08:47:38] [INFO ] After 86ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-24 08:47:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 08:47:38] [INFO ] After 9ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 08:47:38] [INFO ] After 22ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 08:47:38] [INFO ] After 187ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 258 ms.
RANDOM walk for 40000 steps (5806 resets) in 71 ms. (555 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3613 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 631599 steps, run timeout after 3001 ms. (steps per millisecond=210 ) properties seen :0 out of 1
Probabilistic random walk after 631599 steps, saw 315866 distinct states, run finished after 3001 ms. (steps per millisecond=210 ) 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-12392179528977591702.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8268912936519132880.kers'
[2026-05-24 08:47:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12392179528977591702.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8268912936519132880.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 387 rows 406 cols 1246 entries
Finished phase 1 with 310 SingleSign rule and 51 generalized
[2026-05-24 08:47:41] [INFO ] Computed 47 invariants in 14 ms
Computed 47 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-8268912936519132880.kers
Total runtime 16 ms.
[2026-05-24 08:47:41] [INFO ] State equation strengthened by 14 read => feed constraints.
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) 11/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 84/96 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 296/392 variables, 38/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/392 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 10/402 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/402 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/404 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/404 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 387/791 variables, 404/449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/791 variables, 14/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/791 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 4/795 variables, 4/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/795 variables, 2/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/795 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/795 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 795/795 variables, and 469 constraints, problems are : Problem set: 0 solved, 1 unsolved in 314 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 408/408 constraints, ReadFeed: 14/14 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) 11/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 84/96 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 296/392 variables, 38/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/392 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/392 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 10/402 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/402 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/402 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/404 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/404 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 387/791 variables, 404/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/791 variables, 14/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/791 variables, 1/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/791 variables, 1/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/791 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 4/795 variables, 4/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/795 variables, 2/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/795 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/795 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 795/795 variables, and 482 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2561 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 408/408 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2900ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 93 ms.
Support contains 1 out of 408 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 408/408 places, 387/387 transitions.
Graph (complete) has 902 edges and 408 vertex of which 402 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 75 rules applied. Total rules applied 76 place count 401 transition count 313
Reduce places removed 72 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 73 rules applied. Total rules applied 149 place count 329 transition count 312
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 150 place count 328 transition count 312
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 150 place count 328 transition count 300
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 174 place count 316 transition count 300
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 3 with 110 rules applied. Total rules applied 284 place count 261 transition count 245
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 304 place count 251 transition count 245
Free-agglomeration rule (complex) applied 26 times.
Iterating global reduction 3 with 26 rules applied. Total rules applied 330 place count 251 transition count 219
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 3 with 26 rules applied. Total rules applied 356 place count 225 transition count 219
Partial Free-agglomeration rule applied 25 times.
Drop transitions (Partial Free agglomeration) removed 25 transitions
Iterating global reduction 4 with 25 rules applied. Total rules applied 381 place count 225 transition count 219
Applied a total of 381 rules in 30 ms. Remains 225 /408 variables (removed 183) and now considering 219/387 (removed 168) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 225/408 places, 219/387 transitions.
RANDOM walk for 40000 steps (5736 resets) in 62 ms. (634 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (3603 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 837163 steps, run timeout after 3001 ms. (steps per millisecond=278 ) properties seen :0 out of 1
Probabilistic random walk after 837163 steps, saw 418666 distinct states, run finished after 3001 ms. (steps per millisecond=278 ) 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-13286565561726062321.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11744161751944300395.kers'
[2026-05-24 08:47:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13286565561726062321.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11744161751944300395.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 219 rows 223 cols 1280 entries
Finished phase 1 with 135 SingleSign rule and 47 generalized
[2026-05-24 08:47:47] [INFO ] Computed 43 invariants in 5 ms
Computed 43 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-11744161751944300395.kers
Total runtime 7 ms.
[2026-05-24 08:47:47] [INFO ] State equation strengthened by 38 read => feed constraints.
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) 161/165 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 52/217 variables, 24/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/221 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/221 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 219/440 variables, 221/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/440 variables, 38/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/440 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 4/444 variables, 4/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/444 variables, 2/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/444 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 444/444 variables, and 306 constraints, problems are : Problem set: 0 solved, 1 unsolved in 160 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 225/225 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 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) 161/165 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 6/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 52/217 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/217 variables, 16/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/217 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/221 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 219/440 variables, 221/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/440 variables, 38/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/440 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/440 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/440 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/444 variables, 4/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/444 variables, 2/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/444 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/444 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 444/444 variables, and 330 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3097 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 225/225 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 3280ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 39 ms.
Support contains 1 out of 225 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 225/225 places, 219/219 transitions.
Applied a total of 0 rules in 3 ms. Remains 225 /225 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 225/225 places, 219/219 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 225/225 places, 219/219 transitions.
Applied a total of 0 rules in 9 ms. Remains 225 /225 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2026-05-24 08:47:51] [INFO ] Invariant cache hit.
[2026-05-24 08:47:51] [INFO ] Implicit Places using invariants in 620 ms returned [47, 68, 73, 93, 99, 120, 125, 145, 150, 171, 177, 191, 196]
[2026-05-24 08:47:51] [INFO ] Actually due to overlaps returned [47]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 624 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 224/225 places, 219/219 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 224 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 223 transition count 218
Applied a total of 2 rules in 11 ms. Remains 223 /224 variables (removed 1) and now considering 218/219 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15772892387554659783.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8256378778607857390.kers'
[2026-05-24 08:47:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15772892387554659783.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8256378778607857390.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 218 rows 221 cols 1249 entries
Finished phase 1 with 134 SingleSign rule and 47 generalized
[2026-05-24 08:47:51] [INFO ] Computed 42 invariants in 2 ms
Computed 42 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-8256378778607857390.kers
Total runtime 2 ms.
[2026-05-24 08:47:52] [INFO ] Implicit Places using invariants in 556 ms returned [66, 71, 91, 97, 118, 123, 143, 148, 169, 175, 189, 194]
[2026-05-24 08:47:52] [INFO ] Actually due to overlaps returned [71, 66]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 558 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 221/225 places, 218/219 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 221 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 220 transition count 217
Applied a total of 2 rules in 11 ms. Remains 220 /221 variables (removed 1) and now considering 217/218 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14403246864911401716.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15881160214029491827.kers'
[2026-05-24 08:47:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14403246864911401716.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15881160214029491827.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 217 rows 218 cols 1220 entries
Finished phase 1 with 134 SingleSign rule and 46 generalized
[2026-05-24 08:47:52] [INFO ] Computed 40 invariants in 4 ms
Computed 40 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-15881160214029491827.kers
Total runtime 5 ms.
[2026-05-24 08:47:52] [INFO ] Implicit Places using invariants in 475 ms returned [88, 94, 115, 120, 140, 145, 166, 172, 186, 191]
[2026-05-24 08:47:52] [INFO ] Actually due to overlaps returned [94, 88]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 477 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 218/225 places, 217/219 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 218 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 217 transition count 216
Applied a total of 2 rules in 9 ms. Remains 217 /218 variables (removed 1) and now considering 216/217 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17927987632093121402.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17929199742278675190.kers'
[2026-05-24 08:47:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17927987632093121402.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17929199742278675190.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 216 rows 215 cols 1196 entries
Finished phase 1 with 134 SingleSign rule and 45 generalized
[2026-05-24 08:47:52] [INFO ] Computed 38 invariants in 3 ms
Computed 38 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-17929199742278675190.kers
Total runtime 4 ms.
[2026-05-24 08:47:53] [INFO ] Implicit Places using invariants in 438 ms returned [112, 117, 137, 142, 163, 169, 183, 188]
[2026-05-24 08:47:53] [INFO ] Actually due to overlaps returned [117, 112]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 440 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 215/225 places, 216/219 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 215 transition count 215
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 214 transition count 215
Applied a total of 2 rules in 9 ms. Remains 214 /215 variables (removed 1) and now considering 215/216 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4781848656536150636.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7698019376324928172.kers'
[2026-05-24 08:47:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4781848656536150636.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7698019376324928172.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 215 rows 212 cols 1177 entries
Finished phase 1 with 134 SingleSign rule and 44 generalized
[2026-05-24 08:47:53] [INFO ] Computed 36 invariants in 1 ms
Computed 36 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7698019376324928172.kers
Total runtime 2 ms.
[2026-05-24 08:47:53] [INFO ] Implicit Places using invariants in 385 ms returned [134, 139, 160, 166, 180, 185]
[2026-05-24 08:47:53] [INFO ] Actually due to overlaps returned [139, 134]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 387 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 212/225 places, 215/219 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 212 transition count 214
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 211 transition count 214
Applied a total of 2 rules in 10 ms. Remains 211 /212 variables (removed 1) and now considering 214/215 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12184027194620375249.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6073243272559350105.kers'
[2026-05-24 08:47:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12184027194620375249.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6073243272559350105.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 214 rows 209 cols 1163 entries
Finished phase 1 with 134 SingleSign rule and 43 generalized
[2026-05-24 08:47:53] [INFO ] Computed 34 invariants in 6 ms
Computed 34 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-6073243272559350105.kers
Total runtime 7 ms.
[2026-05-24 08:47:54] [INFO ] Implicit Places using invariants in 382 ms returned [157, 163, 177, 182]
[2026-05-24 08:47:54] [INFO ] Actually due to overlaps returned [157, 163]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 384 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 209/225 places, 214/219 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 209 transition count 213
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 208 transition count 213
Applied a total of 2 rules in 12 ms. Remains 208 /209 variables (removed 1) and now considering 213/214 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17226691685739822500.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6832486640023222692.kers'
[2026-05-24 08:47:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17226691685739822500.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6832486640023222692.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 213 rows 206 cols 1154 entries
Finished phase 1 with 134 SingleSign rule and 42 generalized
[2026-05-24 08:47:54] [INFO ] Computed 32 invariants in 6 ms
Computed 32 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-6832486640023222692.kers
Total runtime 7 ms.
[2026-05-24 08:47:54] [INFO ] Implicit Places using invariants in 328 ms returned [174, 179]
[2026-05-24 08:47:54] [INFO ] Actually due to overlaps returned [174]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 330 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 207/225 places, 213/219 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 206 transition count 212
Applied a total of 2 rules in 9 ms. Remains 206 /207 variables (removed 1) and now considering 212/213 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12557840349744285592.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11642137095832200534.kers'
[2026-05-24 08:47:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12557840349744285592.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11642137095832200534.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 212 rows 204 cols 1147 entries
Finished phase 1 with 129 SingleSign rule and 46 generalized
[2026-05-24 08:47:54] [INFO ] Computed 31 invariants in 4 ms
Computed 31 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-11642137095832200534.kers
Total runtime 6 ms.
[2026-05-24 08:47:54] [INFO ] Implicit Places using invariants in 358 ms returned []
[2026-05-24 08:47:54] [INFO ] Invariant cache hit.
[2026-05-24 08:47:54] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-24 08:47:56] [INFO ] Implicit Places using invariants and state equation in 1740 ms returned []
Implicit Place search using SMT with State Equation took 2100 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 206/225 places, 212/219 transitions.
Finished structural reductions in REACHABILITY mode , in 8 iterations and 5383 ms. Remains : 206/225 places, 212/219 transitions.
RANDOM walk for 40000 steps (5801 resets) in 79 ms. (500 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (3583 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 841153 steps, run timeout after 3001 ms. (steps per millisecond=280 ) properties seen :0 out of 1
Probabilistic random walk after 841153 steps, saw 420660 distinct states, run finished after 3001 ms. (steps per millisecond=280 ) properties seen :0
[2026-05-24 08:47:59] [INFO ] Invariant cache hit.
[2026-05-24 08:47:59] [INFO ] State equation strengthened by 38 read => feed constraints.
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) 143/147 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 52/199 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/201 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 212/413 variables, 201/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/413 variables, 38/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/413 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 5/418 variables, 5/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/418 variables, 2/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/418 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/418 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 418/418 variables, and 275 constraints, problems are : Problem set: 0 solved, 1 unsolved in 146 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 206/206 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 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) 143/147 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 52/199 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/201 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 212/413 variables, 201/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/413 variables, 38/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/413 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/413 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 5/418 variables, 5/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/418 variables, 2/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/418 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/418 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 418/418 variables, and 282 constraints, problems are : Problem set: 0 solved, 1 unsolved in 962 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 206/206 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1111ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 38 ms.
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 206/206 places, 212/212 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
[2026-05-24 08:48:00] [INFO ] Invariant cache hit.
[2026-05-24 08:48:01] [INFO ] Implicit Places using invariants in 338 ms returned []
[2026-05-24 08:48:01] [INFO ] Invariant cache hit.
[2026-05-24 08:48:01] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-24 08:48:02] [INFO ] Implicit Places using invariants and state equation in 1750 ms returned []
Implicit Place search using SMT with State Equation took 2090 ms to find 0 implicit places.
[2026-05-24 08:48:02] [INFO ] Redundant transitions in 1 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2104 ms. Remains : 206/206 places, 212/212 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 206 transition count 194
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 188 transition count 194
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 179 transition count 185
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 179 transition count 185
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 178 transition count 184
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 178 transition count 182
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 176 transition count 182
Applied a total of 60 rules in 15 ms. Remains 176 /206 variables (removed 30) and now considering 182/212 (removed 30) transitions.
Running SMT prover for 1 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14473466973854959679.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5244105582286165264.kers'
[2026-05-24 08:48:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14473466973854959679.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5244105582286165264.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 182 rows 174 cols 1060 entries
Finished phase 1 with 101 SingleSign rule and 44 generalized
[2026-05-24 08:48:02] [INFO ] Computed 31 invariants in 2 ms
Computed 31 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-5244105582286165264.kers
Total runtime 4 ms.
[2026-05-24 08:48:02] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-24 08:48:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2026-05-24 08:48:03] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 8 ms returned sat
[2026-05-24 08:48:03] [INFO ] After 116ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-24 08:48:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 08:48:03] [INFO ] After 17ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 08:48:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 262 ms
TRAPS : Iteration 1
[2026-05-24 08:48:03] [INFO ] After 323ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 08:48:03] [INFO ] After 509ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 588 ms.
RANDOM walk for 40000 steps (5716 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (3618 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 625535 steps, run timeout after 3001 ms. (steps per millisecond=208 ) properties seen :0 out of 1
Probabilistic random walk after 625535 steps, saw 312834 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-18096609474713277239.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7346389846036093643.kers'
[2026-05-24 08:48:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18096609474713277239.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7346389846036093643.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 387 rows 406 cols 1246 entries
Finished phase 1 with 310 SingleSign rule and 51 generalized
[2026-05-24 08:48:06] [INFO ] Computed 47 invariants in 6 ms
Computed 47 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-7346389846036093643.kers
Total runtime 8 ms.
[2026-05-24 08:48:06] [INFO ] State equation strengthened by 14 read => feed constraints.
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) 10/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 85/96 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 296/392 variables, 38/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/392 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 10/402 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/402 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/404 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/404 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 387/791 variables, 404/449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/791 variables, 14/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/791 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 4/795 variables, 4/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/795 variables, 2/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/795 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/795 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 795/795 variables, and 469 constraints, problems are : Problem set: 0 solved, 1 unsolved in 286 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 408/408 constraints, ReadFeed: 14/14 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) 10/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 85/96 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 296/392 variables, 38/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/392 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/392 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 10/402 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/402 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/404 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/404 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 387/791 variables, 404/451 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/791 variables, 14/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/791 variables, 1/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/791 variables, 2/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/791 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/795 variables, 4/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/795 variables, 2/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/795 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/795 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 795/795 variables, and 474 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1437 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 408/408 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1741ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 47 ms.
Support contains 1 out of 408 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 408/408 places, 387/387 transitions.
Graph (complete) has 902 edges and 408 vertex of which 402 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 74 transitions
Trivial Post-agglo rules discarded 74 transitions
Performed 74 trivial Post agglomeration. Transition count delta: 74
Iterating post reduction 0 with 77 rules applied. Total rules applied 78 place count 401 transition count 311
Reduce places removed 74 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 75 rules applied. Total rules applied 153 place count 327 transition count 310
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 154 place count 326 transition count 310
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 154 place count 326 transition count 298
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 178 place count 314 transition count 298
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 53
Deduced a syphon composed of 53 places in 0 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 3 with 106 rules applied. Total rules applied 284 place count 261 transition count 245
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 304 place count 251 transition count 245
Free-agglomeration rule (complex) applied 24 times.
Iterating global reduction 3 with 24 rules applied. Total rules applied 328 place count 251 transition count 221
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 352 place count 227 transition count 221
Partial Free-agglomeration rule applied 25 times.
Drop transitions (Partial Free agglomeration) removed 25 transitions
Iterating global reduction 4 with 25 rules applied. Total rules applied 377 place count 227 transition count 221
Applied a total of 377 rules in 24 ms. Remains 227 /408 variables (removed 181) and now considering 221/387 (removed 166) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 227/408 places, 221/387 transitions.
RANDOM walk for 40000 steps (5757 resets) in 72 ms. (547 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (3689 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 806148 steps, run timeout after 3001 ms. (steps per millisecond=268 ) properties seen :0 out of 1
Probabilistic random walk after 806148 steps, saw 403160 distinct states, run finished after 3001 ms. (steps per millisecond=268 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11721065558878974427.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6999983888272522237.kers'
[2026-05-24 08:48:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11721065558878974427.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6999983888272522237.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 221 rows 225 cols 1286 entries
Finished phase 1 with 137 SingleSign rule and 47 generalized
[2026-05-24 08:48:11] [INFO ] Computed 43 invariants in 6 ms
Computed 43 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-6999983888272522237.kers
Total runtime 8 ms.
[2026-05-24 08:48:11] [INFO ] State equation strengthened by 36 read => feed constraints.
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) 164/165 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 54/219 variables, 25/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/223 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 221/444 variables, 223/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/444 variables, 36/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/444 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/448 variables, 4/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/448 variables, 2/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/448 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/448 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 448/448 variables, and 306 constraints, problems are : Problem set: 0 solved, 1 unsolved in 152 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 227/227 constraints, ReadFeed: 36/36 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) 164/165 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 54/219 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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="DoubleExponent-PT-010"
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 DoubleExponent-PT-010, 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 r104-tall-177955698800553"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-010.tgz
mv DoubleExponent-PT-010 execution
cd execution
if [ "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 ;