Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 812K
-rw-r--r-- 1 mcc users 8.1K Mar 5 14:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Mar 5 14:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Mar 5 14:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Mar 5 14:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Mar 15 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Mar 5 14:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Mar 5 14:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Mar 5 14:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Mar 5 14:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:07 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 417K 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 1779654436296

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ASLink-PT-02b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StableMarking PT
Running Version 202604301425
[2026-05-24 20:27:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2026-05-24 20:27:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 20:27:18] [INFO ] Load time of PNML (sax parser for PT used): 142 ms
[2026-05-24 20:27:18] [INFO ] Transformed 1242 places.
[2026-05-24 20:27:18] [INFO ] Transformed 1621 transitions.
[2026-05-24 20:27:18] [INFO ] Found NUPN structural information;
[2026-05-24 20:27:18] [INFO ] Parsed PT model containing 1242 places and 1621 transitions and 5041 arcs in 252 ms.
Structural test allowed to assert that 146 places are NOT stable. Took 16 ms.
[2026-05-24 20:27:18] [INFO ] Flatten gal took : 267 ms
[2026-05-24 20:27:19] [INFO ] Flatten gal took : 171 ms
[2026-05-24 20:27:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13999815736138134166.gal : 88 ms
[2026-05-24 20:27:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17836993660907459876.prop : 6 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/ReachabilityCardinality13999815736138134166.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17836993660907459876.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40000 steps (167 resets) in 3316 ms. (12 steps per ms) remains 212/1096 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 212/212 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 212/212 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 212/212 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 212/212 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 212/212 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 212/212 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 212/212 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 212/212 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 212/212 properties
BEST_FIRST walk for 402 steps (8 resets) in 11 ms. (33 steps per ms) remains 212/212 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 212/212 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 212/212 properties
BEST_FIRST walk for 401 steps (8 resets) in 7 ms. (50 steps per ms) remains 212/212 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 212/212 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 212/212 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 212/212 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 212/212 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 212/212 properties
BEST_FIRST walk for 402 steps (8 resets) in 10 ms. (36 steps per ms) remains 212/212 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 212/212 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 212/212 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 212/212 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 212/212 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 212/212 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 212/212 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 212/212 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 212/212 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 212/212 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 212/212 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 212/212 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 212/212 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 212/212 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 212/212 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 212/212 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 212/212 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 212/212 properties
BEST_FIRST walk for 403 steps (8 resets) in 25 ms. (15 steps per ms) remains 212/212 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 212/212 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 212/212 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 212/212 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 212/212 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 212/212 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 212/212 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 212/212 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 212/212 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 212/212 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 212/212 properties
BEST_FIRST walk for 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 212/212 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 212/212 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 212/212 properties
Loading property file /tmp/ReachabilityCardinality17836993660907459876.prop.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17675539626670998706.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-630194962696749760.kers'
[2026-05-24 20:27:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17675539626670998706.kers, --Pflows, --basisKERS=/tmp/petrispot-output-630194962696749760.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1621 rows 1242 cols 5041 entries
Finished phase 1 with 820 SingleSign rule and 301 generalized
[2026-05-24 20:27:19] [INFO ] Computed 121 invariants in 8 ms
Computed 121 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-630194962696749760.kers
Total runtime 11 ms.
SDD proceeding with computation,1096 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1096 properties remain. new max is 8
SDD size :5 after 8
SDD proceeding with computation,1096 properties remain. new max is 16
SDD size :8 after 14
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 212/212 constraints. Problems are: Problem set: 0 solved, 212 unsolved
SDD proceeding with computation,1096 properties remain. new max is 32
SDD size :14 after 47
At refinement iteration 1 (INCLUDED_ONLY) 0/212 variables, 12/224 constraints. Problems are: Problem set: 0 solved, 212 unsolved
SDD proceeding with computation,1096 properties remain. new max is 64
SDD size :47 after 194
SDD proceeding with computation,1096 properties remain. new max is 128
SDD size :194 after 321
SDD proceeding with computation,1096 properties remain. new max is 256
SDD size :321 after 964
Invariant property smplace_470 does not hold.
Invariant property smplace_469 does not hold.
Invariant property smplace_468 does not hold.
Invariant property smplace_310 does not hold.
Invariant property smplace_309 does not hold.
Invariant property smplace_308 does not hold.
Invariant property smplace_307 does not hold.
Invariant property smplace_306 does not hold.
Invariant property smplace_305 does not hold.
Invariant property smplace_304 does not hold.
Invariant property smplace_303 does not hold.
Invariant property smplace_302 does not hold.
Invariant property smplace_301 does not hold.
Invariant property smplace_300 does not hold.
Invariant property smplace_299 does not hold.
Invariant property smplace_298 does not hold.
Invariant property smplace_297 does not hold.
Invariant property smplace_296 does not hold.
Invariant property smplace_295 does not hold.
Invariant property smplace_294 does not hold.
SDD proceeding with computation,1076 properties remain. new max is 256
SDD size :964 after 14485
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 212/2863 variables, and 224 constraints, problems are : Problem set: 0 solved, 212 unsolved in 5040 ms.
Refiners :[Domain max(s): 212/1242 constraints, Positive P Invariants (semi-flows): 0/23 constraints, Generalized P Invariants (flows): 12/98 constraints, State Equation: 0/1242 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 212 unsolved
Invariant property smplace_442 does not hold.
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 212/212 constraints. Problems are: Problem set: 0 solved, 212 unsolved
Invariant property smplace_362 does not hold.
Invariant property smplace_361 does not hold.
Invariant property smplace_334 does not hold.
Invariant property smplace_328 does not hold.
Invariant property smplace_327 does not hold.
Invariant property smplace_291 does not hold.
Invariant property smplace_290 does not hold.
At refinement iteration 1 (INCLUDED_ONLY) 0/212 variables, 12/224 constraints. Problems are: Problem set: 0 solved, 212 unsolved
Invariant property smplace_230 does not hold.
Invariant property smplace_229 does not hold.
SDD proceeding with computation,1066 properties remain. new max is 256
SDD size :14485 after 36754
Invariant property smplace_378 does not hold.
Invariant property smplace_369 does not hold.
Invariant property smplace_368 does not hold.
Invariant property smplace_347 does not hold.
Invariant property smplace_346 does not hold.
Invariant property smplace_345 does not hold.
Invariant property smplace_344 does not hold.
Invariant property smplace_343 does not hold.
Invariant property smplace_342 does not hold.
Invariant property smplace_341 does not hold.
Invariant property smplace_340 does not hold.
Invariant property smplace_339 does not hold.
Invariant property smplace_338 does not hold.
Invariant property smplace_337 does not hold.
Invariant property smplace_336 does not hold.
Invariant property smplace_335 does not hold.
Invariant property smplace_333 does not hold.
Invariant property smplace_332 does not hold.
Invariant property smplace_331 does not hold.
SDD proceeding with computation,1047 properties remain. new max is 256
SDD size :36754 after 615827
SDD proceeding with computation,1047 properties remain. new max is 512
SDD size :615827 after 618137
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (OVERLAPS) 116/328 variables, 10/234 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/328 variables, 116/350 constraints. Problems are: Problem set: 0 solved, 212 unsolved
Invariant property smplace_449 does not hold.
Invariant property smplace_448 does not hold.
Invariant property smplace_447 does not hold.
Invariant property smplace_394 does not hold.
Invariant property smplace_393 does not hold.
Invariant property smplace_391 does not hold.
Invariant property smplace_390 does not hold.
Invariant property smplace_389 does not hold.
Invariant property smplace_388 does not hold.
Invariant property smplace_386 does not hold.
Invariant property smplace_384 does not hold.
Invariant property smplace_383 does not hold.
Invariant property smplace_381 does not hold.
Invariant property smplace_380 does not hold.
Invariant property smplace_379 does not hold.
Invariant property smplace_377 does not hold.
Invariant property smplace_376 does not hold.
Invariant property smplace_375 does not hold.
Invariant property smplace_374 does not hold.
Invariant property smplace_373 does not hold.
Invariant property smplace_372 does not hold.
Invariant property smplace_371 does not hold.
Invariant property smplace_370 does not hold.
Invariant property smplace_367 does not hold.
Invariant property smplace_366 does not hold.
Invariant property smplace_365 does not hold.
SDD proceeding with computation,1021 properties remain. new max is 512
SDD size :618137 after 906887
Invariant property smplace_810 does not hold.
Invariant property smplace_441 does not hold.
Invariant property smplace_440 does not hold.
Invariant property smplace_392 does not hold.
Invariant property smplace_387 does not hold.
Invariant property smplace_385 does not hold.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 328/2863 variables, and 356 constraints, problems are : Problem set: 0 solved, 212 unsolved in 5021 ms.
Refiners :[Domain max(s): 328/1242 constraints, Positive P Invariants (semi-flows): 10/23 constraints, Generalized P Invariants (flows): 12/98 constraints, State Equation: 0/1242 constraints, PredecessorRefiner: 0/212 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10255ms problems are : Problem set: 0 solved, 212 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 212 out of 1242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1242/1242 places, 1621/1621 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 242 transitions
Trivial Post-agglo rules discarded 242 transitions
Performed 242 trivial Post agglomeration. Transition count delta: 242
Iterating post reduction 0 with 242 rules applied. Total rules applied 242 place count 1242 transition count 1379
Reduce places removed 242 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 256 rules applied. Total rules applied 498 place count 1000 transition count 1365
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 502 place count 996 transition count 1365
Performed 230 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 230 Pre rules applied. Total rules applied 502 place count 996 transition count 1135
Deduced a syphon composed of 230 places in 6 ms
Ensure Unique test removed 20 places
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 3 with 480 rules applied. Total rules applied 982 place count 746 transition count 1135
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 3 with 15 rules applied. Total rules applied 997 place count 745 transition count 1121
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 1011 place count 731 transition count 1121
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 1011 place count 731 transition count 1114
Deduced a syphon composed of 7 places in 5 ms
Ensure Unique test removed 7 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 21 rules applied. Total rules applied 1032 place count 717 transition count 1114
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 1032 place count 717 transition count 1107
SDD proceeding with computation,1015 properties remain. new max is 512
SDD size :906887 after 8.39552e+08
Deduced a syphon composed of 7 places in 5 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 1046 place count 710 transition count 1107
Discarding 31 places :
Symmetric choice reduction at 5 with 31 rule applications. Total rules 1077 place count 679 transition count 1076
Iterating global reduction 5 with 31 rules applied. Total rules applied 1108 place count 679 transition count 1076
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1109 place count 679 transition count 1075
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 11 Pre rules applied. Total rules applied 1109 place count 679 transition count 1064
Deduced a syphon composed of 11 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 23 rules applied. Total rules applied 1132 place count 667 transition count 1064
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1132 place count 667 transition count 1063
Deduced a syphon composed of 1 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 1135 place count 665 transition count 1063
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 1138 place count 662 transition count 1042
Iterating global reduction 6 with 3 rules applied. Total rules applied 1141 place count 662 transition count 1042
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1141 place count 662 transition count 1041
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1143 place count 661 transition count 1041
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1144 place count 660 transition count 1033
Iterating global reduction 6 with 1 rules applied. Total rules applied 1145 place count 660 transition count 1033
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1146 place count 659 transition count 1025
Iterating global reduction 6 with 1 rules applied. Total rules applied 1147 place count 659 transition count 1025
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1148 place count 658 transition count 1017
Iterating global reduction 6 with 1 rules applied. Total rules applied 1149 place count 658 transition count 1017
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1150 place count 657 transition count 1009
Iterating global reduction 6 with 1 rules applied. Total rules applied 1151 place count 657 transition count 1009
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1152 place count 656 transition count 1001
Iterating global reduction 6 with 1 rules applied. Total rules applied 1153 place count 656 transition count 1001
Invariant property smplace_815 does not hold.
Invariant property smplace_811 does not hold.
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1154 place count 655 transition count 993
Iterating global reduction 6 with 1 rules applied. Total rules applied 1155 place count 655 transition count 993
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1156 place count 654 transition count 985
Iterating global reduction 6 with 1 rules applied. Total rules applied 1157 place count 654 transition count 985
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1158 place count 653 transition count 977
Iterating global reduction 6 with 1 rules applied. Total rules applied 1159 place count 653 transition count 977
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1160 place count 652 transition count 969
Iterating global reduction 6 with 1 rules applied. Total rules applied 1161 place count 652 transition count 969
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1162 place count 651 transition count 961
Iterating global reduction 6 with 1 rules applied. Total rules applied 1163 place count 651 transition count 961
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1164 place count 650 transition count 953
Iterating global reduction 6 with 1 rules applied. Total rules applied 1165 place count 650 transition count 953
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1166 place count 649 transition count 945
Iterating global reduction 6 with 1 rules applied. Total rules applied 1167 place count 649 transition count 945
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1168 place count 648 transition count 937
Iterating global reduction 6 with 1 rules applied. Total rules applied 1169 place count 648 transition count 937
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1170 place count 647 transition count 929
Iterating global reduction 6 with 1 rules applied. Total rules applied 1171 place count 647 transition count 929
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1172 place count 646 transition count 921
Iterating global reduction 6 with 1 rules applied. Total rules applied 1173 place count 646 transition count 921
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1174 place count 645 transition count 913
Iterating global reduction 6 with 1 rules applied. Total rules applied 1175 place count 645 transition count 913
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 6 with 112 rules applied. Total rules applied 1287 place count 589 transition count 857
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1289 place count 588 transition count 866
Free-agglomeration rule applied 6 times.
Iterating global reduction 6 with 6 rules applied. Total rules applied 1295 place count 588 transition count 860
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1301 place count 582 transition count 860
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1302 place count 581 transition count 859
Reduce places removed 3 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 4 rules applied. Total rules applied 1306 place count 578 transition count 858
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1307 place count 577 transition count 858
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 4 Pre rules applied. Total rules applied 1307 place count 577 transition count 854
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 1315 place count 573 transition count 854
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 9 with 2 rules applied. Total rules applied 1317 place count 571 transition count 854
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 10 with 6 rules applied. Total rules applied 1323 place count 568 transition count 851
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 1325 place count 566 transition count 849
Iterating global reduction 10 with 2 rules applied. Total rules applied 1327 place count 566 transition count 849
Free-agglomeration rule applied 2 times.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1329 place count 566 transition count 847
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 1331 place count 564 transition count 847
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 1332 place count 564 transition count 847
Applied a total of 1332 rules in 718 ms. Remains 564 /1242 variables (removed 678) and now considering 847/1621 (removed 774) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 729 ms. Remains : 564/1242 places, 847/1621 transitions.
SDD proceeding with computation,1013 properties remain. new max is 512
SDD size :8.39552e+08 after 1.98398e+09
Invariant property smplace_865 does not hold.
Invariant property smplace_705 does not hold.
Invariant property smplace_704 does not hold.
Invariant property smplace_703 does not hold.
Invariant property smplace_702 does not hold.
Invariant property smplace_701 does not hold.
Invariant property smplace_700 does not hold.
Invariant property smplace_699 does not hold.
Invariant property smplace_698 does not hold.
Invariant property smplace_697 does not hold.
Invariant property smplace_696 does not hold.
Invariant property smplace_695 does not hold.
Invariant property smplace_694 does not hold.
Invariant property smplace_693 does not hold.
Invariant property smplace_692 does not hold.
Invariant property smplace_691 does not hold.
Invariant property smplace_690 does not hold.
SDD proceeding with computation,996 properties remain. new max is 512
SDD size :1.98398e+09 after 3.66958e+09
SDD proceeding with computation,996 properties remain. new max is 1024
SDD size :3.66958e+09 after 5.47746e+09
Invariant property smplace_864 does not hold.
Invariant property smplace_863 does not hold.
Invariant property smplace_853 does not hold.
Invariant property smplace_852 does not hold.
Invariant property smplace_851 does not hold.
Invariant property smplace_844 does not hold.
Invariant property smplace_843 does not hold.
Invariant property smplace_814 does not hold.
Invariant property smplace_813 does not hold.
Invariant property smplace_812 does not hold.
Invariant property smplace_789 does not hold.
Invariant property smplace_773 does not hold.
Invariant property smplace_764 does not hold.
Invariant property smplace_763 does not hold.
Invariant property smplace_742 does not hold.
Invariant property smplace_741 does not hold.
Invariant property smplace_740 does not hold.
Invariant property smplace_739 does not hold.
Invariant property smplace_738 does not hold.
Invariant property smplace_737 does not hold.
Invariant property smplace_736 does not hold.
Invariant property smplace_735 does not hold.
Invariant property smplace_734 does not hold.
Invariant property smplace_733 does not hold.
Invariant property smplace_732 does not hold.
Invariant property smplace_731 does not hold.
Invariant property smplace_730 does not hold.
Invariant property smplace_729 does not hold.
Invariant property smplace_728 does not hold.
Invariant property smplace_727 does not hold.
Invariant property smplace_726 does not hold.
Invariant property smplace_689 does not hold.
RANDOM walk for 4000000 steps (63935 resets) in 58818 ms. (68 steps per ms) remains 66/212 properties
BEST_FIRST walk for 400002 steps (2204 resets) in 2254 ms. (177 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2175 resets) in 1912 ms. (209 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2190 resets) in 1650 ms. (242 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2251 resets) in 1603 ms. (249 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2175 resets) in 1519 ms. (263 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2205 resets) in 1451 ms. (275 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2206 resets) in 1499 ms. (266 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2214 resets) in 1759 ms. (227 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2219 resets) in 1415 ms. (282 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2215 resets) in 1566 ms. (255 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2192 resets) in 1473 ms. (271 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400000 steps (2245 resets) in 1389 ms. (287 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2180 resets) in 1583 ms. (252 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400001 steps (2183 resets) in 1408 ms. (283 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400001 steps (2201 resets) in 1451 ms. (275 steps per ms) remains 66/66 properties
SDD proceeding with computation,964 properties remain. new max is 1024
SDD size :5.47746e+09 after 2.55982e+11
BEST_FIRST walk for 400002 steps (2237 resets) in 1491 ms. (268 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2232 resets) in 1462 ms. (273 steps per ms) remains 66/66 properties
Invariant property smplace_842 does not hold.
Invariant property smplace_837 does not hold.
BEST_FIRST walk for 400003 steps (2217 resets) in 1361 ms. (293 steps per ms) remains 66/66 properties
Invariant property smplace_788 does not hold.
Invariant property smplace_786 does not hold.
Invariant property smplace_785 does not hold.
Invariant property smplace_784 does not hold.
Invariant property smplace_783 does not hold.
Invariant property smplace_781 does not hold.
Invariant property smplace_779 does not hold.
Invariant property smplace_778 does not hold.
Invariant property smplace_776 does not hold.
Invariant property smplace_769 does not hold.
Invariant property smplace_768 does not hold.
Invariant property smplace_767 does not hold.
Invariant property smplace_766 does not hold.
Invariant property smplace_765 does not hold.
Invariant property smplace_757 does not hold.
Invariant property smplace_756 does not hold.
Invariant property smplace_723 does not hold.
Invariant property smplace_722 does not hold.
Invariant property smplace_686 does not hold.
Invariant property smplace_685 does not hold.
BEST_FIRST walk for 400003 steps (2204 resets) in 1568 ms. (254 steps per ms) remains 66/66 properties
Invariant property smplace_625 does not hold.
Invariant property smplace_624 does not hold.
BEST_FIRST walk for 400002 steps (2157 resets) in 1580 ms. (253 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2200 resets) in 1464 ms. (273 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2179 resets) in 1389 ms. (287 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2166 resets) in 1523 ms. (262 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2222 resets) in 1652 ms. (241 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2141 resets) in 1580 ms. (253 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2189 resets) in 1483 ms. (269 steps per ms) remains 66/66 properties
SDD proceeding with computation,940 properties remain. new max is 1024
SDD size :2.55982e+11 after 5.34868e+11
BEST_FIRST walk for 400004 steps (2221 resets) in 1666 ms. (239 steps per ms) remains 66/66 properties
Invariant property smplace_782 does not hold.
Invariant property smplace_780 does not hold.
Invariant property smplace_775 does not hold.
Invariant property smplace_774 does not hold.
Invariant property smplace_772 does not hold.
Invariant property smplace_771 does not hold.
Invariant property smplace_770 does not hold.
Invariant property smplace_762 does not hold.
Invariant property smplace_761 does not hold.
Invariant property smplace_760 does not hold.
BEST_FIRST walk for 400004 steps (2201 resets) in 1490 ms. (268 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2231 resets) in 1458 ms. (274 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2182 resets) in 1385 ms. (288 steps per ms) remains 66/66 properties
SDD proceeding with computation,930 properties remain. new max is 1024
SDD size :5.34868e+11 after 7.27785e+11
BEST_FIRST walk for 400001 steps (2186 resets) in 1535 ms. (260 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400000 steps (2217 resets) in 1327 ms. (301 steps per ms) remains 66/66 properties
Invariant property smplace_1120 does not hold.
Invariant property smplace_965 does not hold.
Invariant property smplace_964 does not hold.
Invariant property smplace_963 does not hold.
Invariant property smplace_962 does not hold.
Invariant property smplace_961 does not hold.
Invariant property smplace_934 does not hold.
BEST_FIRST walk for 400002 steps (2168 resets) in 1613 ms. (247 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2165 resets) in 1636 ms. (244 steps per ms) remains 66/66 properties
Invariant property smplace_836 does not hold.
Invariant property smplace_835 does not hold.
Invariant property smplace_834 does not hold.
Invariant property smplace_833 does not hold.
Invariant property smplace_832 does not hold.
Invariant property smplace_825 does not hold.
Invariant property smplace_824 does not hold.
Invariant property smplace_818 does not hold.
Invariant property smplace_817 does not hold.
BEST_FIRST walk for 400002 steps (2215 resets) in 1440 ms. (277 steps per ms) remains 66/66 properties
Invariant property smplace_787 does not hold.
BEST_FIRST walk for 400003 steps (2144 resets) in 1523 ms. (262 steps per ms) remains 66/66 properties
Invariant property smplace_684 does not hold.
Invariant property smplace_683 does not hold.
Invariant property smplace_682 does not hold.
Invariant property smplace_681 does not hold.
Invariant property smplace_680 does not hold.
BEST_FIRST walk for 400002 steps (2197 resets) in 1449 ms. (275 steps per ms) remains 66/66 properties
Invariant property smplace_664 does not hold.
BEST_FIRST walk for 400002 steps (2223 resets) in 1361 ms. (293 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2206 resets) in 1449 ms. (275 steps per ms) remains 66/66 properties
Invariant property smplace_623 does not hold.
BEST_FIRST walk for 400000 steps (2179 resets) in 1333 ms. (299 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400001 steps (2220 resets) in 1540 ms. (259 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2169 resets) in 1491 ms. (268 steps per ms) remains 66/66 properties
Invariant property smplace_549 does not hold.
BEST_FIRST walk for 400003 steps (2221 resets) in 1525 ms. (262 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2214 resets) in 1679 ms. (238 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2208 resets) in 1531 ms. (261 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2147 resets) in 1495 ms. (267 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2194 resets) in 1405 ms. (284 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2199 resets) in 1559 ms. (256 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2211 resets) in 1580 ms. (253 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2192 resets) in 1425 ms. (280 steps per ms) remains 66/66 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9022958657143513033.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17116743242466480021.kers'
[2026-05-24 20:28:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9022958657143513033.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17116743242466480021.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 847 rows 559 cols 3097 entries
Finished phase 1 with 223 SingleSign rule and 255 generalized
[2026-05-24 20:28:13] [INFO ] Computed 86 invariants in 5 ms
Computed 86 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-17116743242466480021.kers
Total runtime 6 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (OVERLAPS) 12/78 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 35/113 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (OVERLAPS) 12/125 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (OVERLAPS) 4/129 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/129 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 10 (OVERLAPS) 114/243 variables, 16/29 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/243 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 12 (OVERLAPS) 36/279 variables, 5/34 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/279 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 14 (OVERLAPS) 56/335 variables, 6/40 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/335 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 16 (OVERLAPS) 26/361 variables, 5/45 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/361 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 18 (OVERLAPS) 26/387 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 66 unsolved
SDD proceeding with computation,905 properties remain. new max is 1024
SDD size :7.27785e+11 after 7.20811e+13
At refinement iteration 19 (INCLUDED_ONLY) 0/387 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 20 (OVERLAPS) 44/431 variables, 10/58 constraints. Problems are: Problem set: 0 solved, 66 unsolved
Invariant property smplace_667 does not hold.
Invariant property smplace_666 does not hold.
Invariant property smplace_665 does not hold.
Invariant property smplace_583 does not hold.
Invariant property smplace_582 does not hold.
At refinement iteration 21 (INCLUDED_ONLY) 0/431 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 22 (OVERLAPS) 102/533 variables, 11/69 constraints. Problems are: Problem set: 0 solved, 66 unsolved
SDD proceeding with computation,900 properties remain. new max is 1024
SDD size :7.20811e+13 after 7.20856e+13
At refinement iteration 23 (INCLUDED_ONLY) 0/533 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 24 (OVERLAPS) 6/539 variables, 3/72 constraints. Problems are: Problem set: 0 solved, 66 unsolved
SDD proceeding with computation,900 properties remain. new max is 2048
SDD size :7.20856e+13 after 7.21067e+13
At refinement iteration 25 (INCLUDED_ONLY) 0/539 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 26 (OVERLAPS) 1/540 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/540 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 28 (OVERLAPS) 24/564 variables, 13/86 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/564 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 30 (OVERLAPS) 847/1411 variables, 564/650 constraints. Problems are: Problem set: 0 solved, 66 unsolved
SDD proceeding with computation,900 properties remain. new max is 4096
SDD size :7.21067e+13 after 7.22345e+13
Invariant property smplace_831 does not hold.
At refinement iteration 31 (INCLUDED_ONLY) 0/1411 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 66 unsolved
Invariant property smplace_622 does not hold.
Invariant property smplace_621 does not hold.
At refinement iteration 32 (OVERLAPS) 0/1411 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1411/1411 variables, and 650 constraints, problems are : Problem set: 0 solved, 66 unsolved in 13588 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 61/61 constraints, State Equation: 564/564 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (OVERLAPS) 12/78 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (OVERLAPS) 35/113 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (OVERLAPS) 12/125 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (OVERLAPS) 4/129 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/129 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 11 (OVERLAPS) 114/243 variables, 16/30 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/243 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/243 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 66 unsolved
Invariant property smplace_548 does not hold.
Invariant property smplace_547 does not hold.
At refinement iteration 14 (INCLUDED_ONLY) 0/243 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 15 (OVERLAPS) 36/279 variables, 5/40 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/279 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 17 (OVERLAPS) 56/335 variables, 6/46 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/335 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 19 (OVERLAPS) 26/361 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 66 unsolved
SDD proceeding with computation,895 properties remain. new max is 4096
SDD size :7.22345e+13 after 7.24757e+13
At refinement iteration 20 (INCLUDED_ONLY) 0/361 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 21 (OVERLAPS) 26/387 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 66 unsolved
Invariant property smplace_721 does not hold.
Invariant property smplace_720 does not hold.
Invariant property smplace_719 does not hold.
Invariant property smplace_718 does not hold.
Invariant property smplace_717 does not hold.
At refinement iteration 22 (INCLUDED_ONLY) 0/387 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 23 (OVERLAPS) 44/431 variables, 10/64 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/431 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 25 (OVERLAPS) 102/533 variables, 11/75 constraints. Problems are: Problem set: 0 solved, 66 unsolved
SDD proceeding with computation,890 properties remain. new max is 4096
SDD size :7.24757e+13 after 7.2611e+13
Invariant property smplace_710 does not hold.
Invariant property smplace_709 does not hold.
Invariant property smplace_708 does not hold.
Invariant property smplace_707 does not hold.
Invariant property smplace_586 does not hold.
Invariant property smplace_585 does not hold.
At refinement iteration 26 (INCLUDED_ONLY) 0/533 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 27 (OVERLAPS) 6/539 variables, 3/78 constraints. Problems are: Problem set: 0 solved, 66 unsolved
SDD proceeding with computation,884 properties remain. new max is 4096
SDD size :7.2611e+13 after 7.26144e+13
At refinement iteration 28 (INCLUDED_ONLY) 0/539 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 29 (OVERLAPS) 1/540 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/540 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 31 (OVERLAPS) 24/564 variables, 13/92 constraints. Problems are: Problem set: 0 solved, 66 unsolved
SDD proceeding with computation,884 properties remain. new max is 8192
SDD size :7.26144e+13 after 7.26287e+13
Invariant property smplace_755 does not hold.
Invariant property smplace_754 does not hold.
Invariant property smplace_753 does not hold.
Invariant property smplace_752 does not hold.
Invariant property smplace_751 does not hold.
At refinement iteration 32 (INCLUDED_ONLY) 0/564 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 33 (OVERLAPS) 847/1411 variables, 564/656 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1411 variables, 66/722 constraints. Problems are: Problem set: 0 solved, 66 unsolved
SDD proceeding with computation,879 properties remain. new max is 8192
SDD size :7.26287e+13 after 7.27917e+13
At refinement iteration 35 (INCLUDED_ONLY) 0/1411 variables, 0/722 constraints. Problems are: Problem set: 0 solved, 66 unsolved
Invariant property smplace_747 does not hold.
Invariant property smplace_746 does not hold.
Invariant property smplace_745 does not hold.
Invariant property smplace_744 does not hold.
At refinement iteration 36 (OVERLAPS) 0/1411 variables, 0/722 constraints. Problems are: Problem set: 0 solved, 66 unsolved
Invariant property smplace_589 does not hold.
Invariant property smplace_588 does not hold.
No progress, stopping.
After SMT solving in domain Int declared 1411/1411 variables, and 722 constraints, problems are : Problem set: 0 solved, 66 unsolved in 43947 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 61/61 constraints, State Equation: 564/564 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57579ms problems are : Problem set: 0 solved, 66 unsolved
Fused 66 Parikh solutions to 59 different solutions.
Parikh walk visited 0 properties in 9806 ms.
Support contains 66 out of 564 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 564/564 places, 847/847 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 564 transition count 821
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 538 transition count 821
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 52 place count 538 transition count 784
Deduced a syphon composed of 37 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 75 rules applied. Total rules applied 127 place count 500 transition count 784
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 128 place count 500 transition count 783
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 129 place count 499 transition count 783
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 149 place count 489 transition count 773
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 150 place count 488 transition count 772
Ensure Unique test removed 1 places
Iterating global reduction 4 with 2 rules applied. Total rules applied 152 place count 487 transition count 772
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 153 place count 486 transition count 771
Iterating global reduction 4 with 1 rules applied. Total rules applied 154 place count 486 transition count 771
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 156 place count 486 transition count 769
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 157 place count 485 transition count 769
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 158 place count 485 transition count 768
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 159 place count 484 transition count 768
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 160 place count 484 transition count 768
Applied a total of 160 rules in 111 ms. Remains 484 /564 variables (removed 80) and now considering 768/847 (removed 79) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111 ms. Remains : 484/564 places, 768/847 transitions.
RANDOM walk for 4000000 steps (64781 resets) in 36893 ms. (108 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400000 steps (2193 resets) in 1610 ms. (248 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2202 resets) in 1448 ms. (276 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2231 resets) in 1653 ms. (241 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2229 resets) in 1417 ms. (282 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2202 resets) in 1628 ms. (245 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2242 resets) in 1533 ms. (260 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2213 resets) in 1566 ms. (255 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2221 resets) in 1516 ms. (263 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2243 resets) in 1455 ms. (274 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2205 resets) in 1511 ms. (264 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400001 steps (2217 resets) in 1462 ms. (273 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2249 resets) in 1441 ms. (277 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2241 resets) in 1419 ms. (281 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2212 resets) in 1710 ms. (233 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2200 resets) in 1403 ms. (284 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2241 resets) in 1665 ms. (240 steps per ms) remains 66/66 properties
SDD proceeding with computation,873 properties remain. new max is 8192
SDD size :7.27917e+13 after 7.28212e+13
BEST_FIRST walk for 400004 steps (2199 resets) in 1686 ms. (237 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2245 resets) in 1561 ms. (256 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2199 resets) in 1549 ms. (258 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400001 steps (2213 resets) in 1587 ms. (251 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2214 resets) in 1419 ms. (281 steps per ms) remains 66/66 properties
Invariant property smplace_960 does not hold.
Invariant property smplace_959 does not hold.
Invariant property smplace_958 does not hold.
BEST_FIRST walk for 400003 steps (2172 resets) in 1529 ms. (261 steps per ms) remains 66/66 properties
Invariant property smplace_830 does not hold.
Invariant property smplace_829 does not hold.
Invariant property smplace_828 does not hold.
Invariant property smplace_827 does not hold.
Invariant property smplace_826 does not hold.
BEST_FIRST walk for 400004 steps (2226 resets) in 1542 ms. (259 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2218 resets) in 1681 ms. (237 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2222 resets) in 1495 ms. (267 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2254 resets) in 1471 ms. (271 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400001 steps (2229 resets) in 1632 ms. (244 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2192 resets) in 1452 ms. (275 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2212 resets) in 1605 ms. (249 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2229 resets) in 1606 ms. (248 steps per ms) remains 66/66 properties
Invariant property smplace_546 does not hold.
BEST_FIRST walk for 400003 steps (2234 resets) in 1654 ms. (241 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2238 resets) in 1546 ms. (258 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2206 resets) in 1730 ms. (231 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2224 resets) in 1602 ms. (249 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2247 resets) in 1515 ms. (263 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2232 resets) in 1623 ms. (246 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2204 resets) in 1531 ms. (261 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2234 resets) in 1551 ms. (257 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2191 resets) in 1591 ms. (251 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2189 resets) in 1435 ms. (278 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2173 resets) in 1491 ms. (268 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2205 resets) in 1697 ms. (235 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400000 steps (2210 resets) in 1327 ms. (301 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400001 steps (2209 resets) in 1439 ms. (277 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2196 resets) in 1356 ms. (294 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2201 resets) in 1450 ms. (275 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2219 resets) in 1373 ms. (291 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2239 resets) in 1474 ms. (271 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2199 resets) in 1417 ms. (282 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2201 resets) in 1384 ms. (288 steps per ms) remains 66/66 properties
SDD proceeding with computation,864 properties remain. new max is 8192
SDD size :7.28212e+13 after 7.92272e+13
Invariant property smplace_957 does not hold.
Invariant property smplace_956 does not hold.
Invariant property smplace_955 does not hold.
Invariant property smplace_545 does not hold.
Invariant property smplace_544 does not hold.
Invariant property smplace_543 does not hold.
SDD proceeding with computation,858 properties remain. new max is 8192
SDD size :7.92272e+13 after 8.11851e+13
Invariant property smplace_542 does not hold.
Invariant property smplace_541 does not hold.
Interrupted probabilistic random walk after 21538386 steps, run timeout after 108001 ms. (steps per millisecond=199 ) properties seen :64 out of 66
Probabilistic random walk after 21538386 steps, saw 3819066 distinct states, run finished after 108031 ms. (steps per millisecond=199 ) properties seen :64
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6802243156887325404.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5428163162842712843.kers'
[2026-05-24 20:31:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6802243156887325404.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5428163162842712843.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 768 rows 479 cols 2929 entries
Finished phase 1 with 143 SingleSign rule and 257 generalized
[2026-05-24 20:31:45] [INFO ] Computed 84 invariants in 4 ms
Computed 84 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-5428163162842712843.kers
Total runtime 5 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 10/19 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 19/38 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 10/48 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/50 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/50 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 84/134 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/134 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 39/173 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/173 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1/174 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/174 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 53/227 variables, 12/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/227 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 3/230 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/230 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 52/282 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/282 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 41/323 variables, 6/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/323 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 1/324 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/324 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 36/360 variables, 8/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/360 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 97/457 variables, 11/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/457 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 6/463 variables, 3/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/463 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (OVERLAPS) 1/464 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/464 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (OVERLAPS) 20/484 variables, 13/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/484 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (OVERLAPS) 768/1252 variables, 484/568 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1252 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 39 (OVERLAPS) 0/1252 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1252/1252 variables, and 568 constraints, problems are : Problem set: 0 solved, 2 unsolved in 571 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 59/59 constraints, State Equation: 484/484 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 10/19 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 19/38 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 10/48 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/50 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/50 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 84/134 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/134 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 39/173 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/173 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1/174 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/174 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 53/227 variables, 12/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/227 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 3/230 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/230 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 52/282 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/282 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 41/323 variables, 6/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/323 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 1/324 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/324 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 36/360 variables, 8/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/360 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 97/457 variables, 11/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/457 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 6/463 variables, 3/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/463 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (OVERLAPS) 1/464 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/464 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (OVERLAPS) 20/484 variables, 13/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/484 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (OVERLAPS) 768/1252 variables, 484/568 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1252 variables, 2/570 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1252 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 40 (OVERLAPS) 0/1252 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1252/1252 variables, and 570 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1100 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 59/59 constraints, State Equation: 484/484 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1688ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 458 ms.
Support contains 2 out of 484 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 484/484 places, 768/768 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 484 transition count 754
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 470 transition count 754
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 28 place count 470 transition count 738
Deduced a syphon composed of 16 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 62 place count 452 transition count 738
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 64 place count 451 transition count 737
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 65 place count 450 transition count 737
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 65 place count 450 transition count 736
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 68 place count 448 transition count 736
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 68 place count 448 transition count 735
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 70 place count 447 transition count 735
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 17 rules applied. Total rules applied 87 place count 438 transition count 727
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 87 place count 438 transition count 724
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 7 rules applied. Total rules applied 94 place count 434 transition count 724
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 95 place count 433 transition count 724
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 95 place count 433 transition count 723
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 97 place count 432 transition count 723
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 5 with 2 rules applied. Total rules applied 99 place count 431 transition count 722
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 100 place count 431 transition count 721
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 101 place count 430 transition count 721
Applied a total of 101 rules in 86 ms. Remains 430 /484 variables (removed 54) and now considering 721/768 (removed 47) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 430/484 places, 721/768 transitions.
RANDOM walk for 4000000 steps (65205 resets) in 10728 ms. (372 steps per ms) remains 2/2 properties
BEST_FIRST walk for 4000002 steps (22210 resets) in 5043 ms. (793 steps per ms) remains 2/2 properties
BEST_FIRST walk for 4000001 steps (22102 resets) in 5058 ms. (790 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 2318560 steps, run timeout after 15001 ms. (steps per millisecond=154 ) properties seen :0 out of 2
Probabilistic random walk after 2318560 steps, saw 636449 distinct states, run finished after 15002 ms. (steps per millisecond=154 ) 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-4092005925815110075.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7189262700809570031.kers'
[2026-05-24 20:32:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4092005925815110075.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7189262700809570031.kers]
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 721 rows 423 cols 2818 entries
Finished phase 1 with 141 SingleSign rule and 212 generalized
[2026-05-24 20:32:08] [INFO ] Computed 77 invariants in 4 ms
Computed 77 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-7189262700809570031.kers
Total runtime 6 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 110/112 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 50/162 variables, 12/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/163 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 79/242 variables, 10/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 42/284 variables, 7/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/284 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/285 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/285 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 105/390 variables, 14/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 9/399 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/399 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/401 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/401 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 29/430 variables, 16/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/430 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 721/1151 variables, 430/507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1151 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/1151 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1151/1151 variables, and 507 constraints, problems are : Problem set: 0 solved, 2 unsolved in 801 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 52/52 constraints, State Equation: 430/430 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 110/112 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 50/162 variables, 12/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/163 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 79/242 variables, 10/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 42/284 variables, 7/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/284 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/285 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/285 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 105/390 variables, 14/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 9/399 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/399 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/401 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/401 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 29/430 variables, 16/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/430 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 721/1151 variables, 430/507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1151 variables, 2/509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1151 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/1151 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1151/1151 variables, and 509 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1163 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 52/52 constraints, State Equation: 430/430 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1987ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 565 ms.
Support contains 2 out of 430 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 430/430 places, 721/721 transitions.
Applied a total of 0 rules in 13 ms. Remains 430 /430 variables (removed 0) and now considering 721/721 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 430/430 places, 721/721 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 430/430 places, 721/721 transitions.
Applied a total of 0 rules in 12 ms. Remains 430 /430 variables (removed 0) and now considering 721/721 (removed 0) transitions.
[2026-05-24 20:32:10] [INFO ] Invariant cache hit.
[2026-05-24 20:32:11] [INFO ] Implicit Places using invariants in 393 ms returned [0, 18, 19, 32, 49, 67, 136, 140, 149, 150, 152, 169, 187, 256, 260, 261, 264, 275, 276, 277, 295, 297, 301, 319, 320, 321, 322, 334, 340, 346, 352, 358, 364, 370, 376, 382, 388, 394]
[2026-05-24 20:32:11] [INFO ] Actually due to overlaps returned [295, 277, 32, 49, 169, 301, 152, 149, 275, 319, 150, 276, 297, 320, 0, 19, 260, 261, 67, 187, 321, 364, 382, 394, 18, 264, 322, 334, 340, 346, 352, 358, 370, 376, 388]
Discarding 35 places :
Implicit Place search using SMT only with invariants took 410 ms to find 35 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 395/430 places, 721/721 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 393 transition count 659
Reduce places removed 62 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 63 rules applied. Total rules applied 127 place count 331 transition count 658
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 127 place count 331 transition count 643
Deduced a syphon composed of 15 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 31 rules applied. Total rules applied 158 place count 315 transition count 643
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 170 place count 311 transition count 635
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 178 place count 303 transition count 635
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 193 place count 288 transition count 620
Iterating global reduction 4 with 15 rules applied. Total rules applied 208 place count 288 transition count 620
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 211 place count 288 transition count 617
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 211 place count 288 transition count 616
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 213 place count 287 transition count 616
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 216 place count 284 transition count 610
Iterating global reduction 5 with 3 rules applied. Total rules applied 219 place count 284 transition count 610
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 220 place count 283 transition count 609
Iterating global reduction 5 with 1 rules applied. Total rules applied 221 place count 283 transition count 609
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 222 place count 282 transition count 607
Iterating global reduction 5 with 1 rules applied. Total rules applied 223 place count 282 transition count 607
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 5 with 44 rules applied. Total rules applied 267 place count 260 transition count 585
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 268 place count 260 transition count 584
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 270 place count 258 transition count 582
Iterating global reduction 6 with 2 rules applied. Total rules applied 272 place count 258 transition count 582
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 274 place count 258 transition count 580
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 278 place count 256 transition count 581
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 7 with 4 rules applied. Total rules applied 282 place count 256 transition count 577
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 287 place count 251 transition count 577
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 293 place count 251 transition count 577
Applied a total of 293 rules in 97 ms. Remains 251 /395 variables (removed 144) and now considering 577/721 (removed 144) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1633290607408890382.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4620796602029075933.kers'
[2026-05-24 20:32:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1633290607408890382.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4620796602029075933.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 577 rows 250 cols 2343 entries
Finished phase 1 with 104 SingleSign rule and 113 generalized
[2026-05-24 20:32:11] [INFO ] Computed 34 invariants in 16 ms
Computed 34 P flows in 18 ms.
Exported basis to /tmp/petrispot-output-4620796602029075933.kers
Total runtime 19 ms.
[2026-05-24 20:32:11] [INFO ] Implicit Places using invariants in 211 ms returned [74, 91, 97, 100, 102, 103, 106, 107, 159, 176, 182, 185, 187]
[2026-05-24 20:32:11] [INFO ] Actually due to overlaps returned [106, 107, 91, 97, 102, 176, 182, 187, 74, 103, 159]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 214 ms to find 11 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 240/430 places, 577/721 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 232 transition count 569
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 232 transition count 569
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 230 transition count 567
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 230 transition count 567
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 28 place count 226 transition count 563
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 226 transition count 557
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 40 place count 220 transition count 557
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 42 place count 220 transition count 555
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 44 place count 218 transition count 555
Applied a total of 44 rules in 79 ms. Remains 218 /240 variables (removed 22) and now considering 555/577 (removed 22) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17012369461344419288.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-338167245521867441.kers'
[2026-05-24 20:32:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17012369461344419288.kers, --Pflows, --basisKERS=/tmp/petrispot-output-338167245521867441.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 555 rows 218 cols 2270 entries
Finished phase 1 with 62 SingleSign rule and 133 generalized
[2026-05-24 20:32:11] [INFO ] Computed 23 invariants in 3 ms
Computed 23 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-338167245521867441.kers
Total runtime 4 ms.
[2026-05-24 20:32:11] [INFO ] Implicit Places using invariants in 147 ms returned []
[2026-05-24 20:32:11] [INFO ] Invariant cache hit.
[2026-05-24 20:32:12] [INFO ] Implicit Places using invariants and state equation in 525 ms returned []
Implicit Place search using SMT with State Equation took 687 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 218/430 places, 555/721 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1502 ms. Remains : 218/430 places, 555/721 transitions.
RANDOM walk for 4000000 steps (101308 resets) in 10219 ms. (391 steps per ms) remains 2/2 properties
BEST_FIRST walk for 4000003 steps (38594 resets) in 4705 ms. (849 steps per ms) remains 2/2 properties
BEST_FIRST walk for 4000004 steps (38505 resets) in 4293 ms. (931 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 38772 steps, run visited all 2 properties in 223 ms. (steps per millisecond=173 )
Probabilistic random walk after 38772 steps, saw 20269 distinct states, run finished after 227 ms. (steps per millisecond=170 ) properties seen :2
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Able to resolve query StableMarking after proving 1097 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST TOPOLOGICAL
Total runtime 300462 ms.

BK_STOP 1779654738438

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ StableMarking = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ASLink-PT-02b"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is ASLink-PT-02b, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r008-oct2-177944369800193"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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