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.r002-oct2-177944366300436.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-10b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-oct2-177944366300436
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 5.1K Mar 5 14:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 48K Mar 5 14:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Mar 5 14:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 5 14:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 07:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 07:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Mar 5 14:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 150K Mar 5 14:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Mar 5 14:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Mar 5 14:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:11 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 1.4M 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

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME ASLink-PT-10b-LTLFireability-00
FORMULA_NAME ASLink-PT-10b-LTLFireability-01
FORMULA_NAME ASLink-PT-10b-LTLFireability-02
FORMULA_NAME ASLink-PT-10b-LTLFireability-03
FORMULA_NAME ASLink-PT-10b-LTLFireability-04
FORMULA_NAME ASLink-PT-10b-LTLFireability-05
FORMULA_NAME ASLink-PT-10b-LTLFireability-06
FORMULA_NAME ASLink-PT-10b-LTLFireability-07
FORMULA_NAME ASLink-PT-10b-LTLFireability-08
FORMULA_NAME ASLink-PT-10b-LTLFireability-09
FORMULA_NAME ASLink-PT-10b-LTLFireability-10
FORMULA_NAME ASLink-PT-10b-LTLFireability-11
FORMULA_NAME ASLink-PT-10b-LTLFireability-12
FORMULA_NAME ASLink-PT-10b-LTLFireability-13
FORMULA_NAME ASLink-PT-10b-LTLFireability-14
FORMULA_NAME ASLink-PT-10b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779489500104

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-10b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-22 22:38:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-22 22:38:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 22:38:21] [INFO ] Load time of PNML (sax parser for PT used): 246 ms
[2026-05-22 22:38:21] [INFO ] Transformed 4410 places.
[2026-05-22 22:38:21] [INFO ] Transformed 5405 transitions.
[2026-05-22 22:38:21] [INFO ] Found NUPN structural information;
[2026-05-22 22:38:21] [INFO ] Parsed PT model containing 4410 places and 5405 transitions and 16377 arcs in 422 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ASLink-PT-10b-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10b-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10b-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 4410 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4410/4410 places, 5405/5405 transitions.
Discarding 274 places :
Symmetric choice reduction at 0 with 274 rule applications. Total rules 274 place count 4136 transition count 5131
Iterating global reduction 0 with 274 rules applied. Total rules applied 548 place count 4136 transition count 5131
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 549 place count 4136 transition count 5130
Discarding 106 places :
Symmetric choice reduction at 1 with 106 rule applications. Total rules 655 place count 4030 transition count 4974
Iterating global reduction 1 with 106 rules applied. Total rules applied 761 place count 4030 transition count 4974
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 794 place count 4030 transition count 4941
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 807 place count 4017 transition count 4928
Iterating global reduction 2 with 13 rules applied. Total rules applied 820 place count 4017 transition count 4928
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 823 place count 4014 transition count 4925
Iterating global reduction 2 with 3 rules applied. Total rules applied 826 place count 4014 transition count 4925
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 828 place count 4012 transition count 4923
Iterating global reduction 2 with 2 rules applied. Total rules applied 830 place count 4012 transition count 4923
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 832 place count 4010 transition count 4921
Iterating global reduction 2 with 2 rules applied. Total rules applied 834 place count 4010 transition count 4921
Applied a total of 834 rules in 3804 ms. Remains 4010 /4410 variables (removed 400) and now considering 4921/5405 (removed 484) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11897513006223956411.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8395033276601452914.kers'
[2026-05-22 22:38:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11897513006223956411.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8395033276601452914.kers]
Culled 0 columns in 6 ms.
// Phase 1: matrix 4921 rows 4010 cols 15287 entries
Finished phase 1 with 2586 SingleSign rule and 991 generalized
[2026-05-22 22:38:26] [INFO ] Computed 433 invariants in 72 ms
Computed 433 P flows in 73 ms.
Exported basis to /tmp/petrispot-output-8395033276601452914.kers
Total runtime 77 ms.
[2026-05-22 22:38:29] [INFO ] Implicit Places using invariants in 3714 ms returned [3844, 3855, 3866, 3874, 3882, 3890, 3898, 3909, 3917, 3925, 3936]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 3775 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3999/4410 places, 4921/5405 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 3986 transition count 4908
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 3986 transition count 4908
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 37 place count 3975 transition count 4897
Iterating global reduction 0 with 11 rules applied. Total rules applied 48 place count 3975 transition count 4897
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 57 place count 3966 transition count 4888
Iterating global reduction 0 with 9 rules applied. Total rules applied 66 place count 3966 transition count 4888
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 69 place count 3963 transition count 4885
Iterating global reduction 0 with 3 rules applied. Total rules applied 72 place count 3963 transition count 4885
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 3962 transition count 4884
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 3962 transition count 4884
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 3961 transition count 4883
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 3961 transition count 4883
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 3960 transition count 4882
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 3960 transition count 4882
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 3959 transition count 4881
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 3959 transition count 4881
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 3958 transition count 4880
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 3958 transition count 4880
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 3957 transition count 4879
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 3957 transition count 4879
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 3956 transition count 4878
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 3956 transition count 4878
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 3955 transition count 4877
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 3955 transition count 4877
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 3954 transition count 4876
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 3954 transition count 4876
Applied a total of 90 rules in 6881 ms. Remains 3954 /3999 variables (removed 45) and now considering 4876/4921 (removed 45) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8559215006289255388.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5267232592143913029.kers'
[2026-05-22 22:38:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8559215006289255388.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5267232592143913029.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 4876 rows 3954 cols 15140 entries
Finished phase 1 with 2576 SingleSign rule and 956 generalized
[2026-05-22 22:38:36] [INFO ] Computed 422 invariants in 46 ms
Computed 422 P flows in 46 ms.
Exported basis to /tmp/petrispot-output-5267232592143913029.kers
Total runtime 51 ms.
[2026-05-22 22:38:39] [INFO ] Implicit Places using invariants in 3094 ms returned []
[2026-05-22 22:38:39] [INFO ] Invariant cache hit.
[2026-05-22 22:38:53] [INFO ] Implicit Places using invariants and state equation in 13218 ms returned []
Implicit Place search using SMT with State Equation took 16341 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 3954/4410 places, 4876/5405 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30836 ms. Remains : 3954/4410 places, 4876/5405 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3954/3954 places, 4876/4876 transitions.
Applied a total of 0 rules in 469 ms. Remains 3954 /3954 variables (removed 0) and now considering 4876/4876 (removed 0) transitions.
[2026-05-22 22:38:53] [INFO ] Invariant cache hit.
[2026-05-22 22:38:56] [INFO ] Implicit Places using invariants in 2885 ms returned []
[2026-05-22 22:38:56] [INFO ] Invariant cache hit.
[2026-05-22 22:39:09] [INFO ] Implicit Places using invariants and state equation in 13236 ms returned []
Implicit Place search using SMT with State Equation took 16128 ms to find 0 implicit places.
Running 4875 sub problems to find dead transitions.
[2026-05-22 22:39:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3953 variables, 253/253 constraints. Problems are: Problem set: 0 solved, 4875 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3953/8830 variables, and 253 constraints, problems are : Problem set: 0 solved, 4875 unsolved in 30141 ms.
Refiners :[Positive P Invariants (semi-flows): 0/88 constraints, Generalized P Invariants (flows): 253/334 constraints, State Equation: 0/3954 constraints, PredecessorRefiner: 4875/4875 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4875 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3953 variables, 253/253 constraints. Problems are: Problem set: 0 solved, 4875 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3953/8830 variables, and 253 constraints, problems are : Problem set: 0 solved, 4875 unsolved in 30085 ms.
Refiners :[Positive P Invariants (semi-flows): 0/88 constraints, Generalized P Invariants (flows): 253/334 constraints, State Equation: 0/3954 constraints, PredecessorRefiner: 0/4875 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62941ms problems are : Problem set: 0 solved, 4875 unsolved
Search for dead transitions found 0 dead transitions in 62981ms
Finished structural reductions in LTL mode , in 1 iterations and 79638 ms. Remains : 3954/3954 places, 4876/4876 transitions.
Support contains 44 out of 3954 places after structural reductions.
[2026-05-22 22:40:13] [INFO ] Flatten gal took : 324 ms
[2026-05-22 22:40:13] [INFO ] Flatten gal took : 172 ms
[2026-05-22 22:40:13] [INFO ] Input system was already deterministic with 4876 transitions.
Support contains 42 out of 3954 places (down from 44) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 32 to 31
RANDOM walk for 40000 steps (53 resets) in 2117 ms. (18 steps per ms) remains 19/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 19/19 properties
[2026-05-22 22:40:14] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 518/547 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/547 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 944/1491 variables, 69/88 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1491 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 2330/3821 variables, 288/376 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3821 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 133/3954 variables, 46/422 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3954 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 19 unsolved
SMT process timed out in 5057ms, After SMT, problems are : Problem set: 0 solved, 19 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 29 out of 3954 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3954/3954 places, 4876/4876 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 729 transitions
Trivial Post-agglo rules discarded 729 transitions
Performed 729 trivial Post agglomeration. Transition count delta: 729
Iterating post reduction 0 with 729 rules applied. Total rules applied 729 place count 3954 transition count 4147
Reduce places removed 729 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 732 rules applied. Total rules applied 1461 place count 3225 transition count 4144
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 1465 place count 3223 transition count 4142
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1467 place count 3221 transition count 4142
Performed 1056 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1056 Pre rules applied. Total rules applied 1467 place count 3221 transition count 3086
Deduced a syphon composed of 1056 places in 12 ms
Ensure Unique test removed 103 places
Reduce places removed 1159 places and 0 transitions.
Iterating global reduction 4 with 2215 rules applied. Total rules applied 3682 place count 2062 transition count 3086
Discarding 11 places :
Implicit places reduction removed 11 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 4 with 76 rules applied. Total rules applied 3758 place count 2051 transition count 3021
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 5 with 65 rules applied. Total rules applied 3823 place count 1986 transition count 3021
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 40 Pre rules applied. Total rules applied 3823 place count 1986 transition count 2981
Deduced a syphon composed of 40 places in 10 ms
Ensure Unique test removed 39 places
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 6 with 119 rules applied. Total rules applied 3942 place count 1907 transition count 2981
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 38 Pre rules applied. Total rules applied 3942 place count 1907 transition count 2943
Deduced a syphon composed of 38 places in 11 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 6 with 76 rules applied. Total rules applied 4018 place count 1869 transition count 2943
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 4019 place count 1868 transition count 2942
Iterating global reduction 6 with 1 rules applied. Total rules applied 4020 place count 1868 transition count 2942
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 4020 place count 1868 transition count 2941
Deduced a syphon composed of 1 places in 24 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 4022 place count 1867 transition count 2941
Performed 311 Post agglomeration using F-continuation condition.Transition count delta: 311
Deduced a syphon composed of 311 places in 9 ms
Ensure Unique test removed 1 places
Reduce places removed 312 places and 0 transitions.
Iterating global reduction 6 with 623 rules applied. Total rules applied 4645 place count 1555 transition count 2630
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 4649 place count 1551 transition count 2626
Ensure Unique test removed 1 places
Iterating global reduction 6 with 5 rules applied. Total rules applied 4654 place count 1550 transition count 2626
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 4654 place count 1550 transition count 2625
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 4656 place count 1549 transition count 2625
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 4658 place count 1547 transition count 2623
Iterating global reduction 6 with 2 rules applied. Total rules applied 4660 place count 1547 transition count 2623
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 6 with 2 rules applied. Total rules applied 4662 place count 1547 transition count 2621
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 4663 place count 1546 transition count 2621
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 4665 place count 1545 transition count 2626
Free-agglomeration rule applied 11 times.
Iterating global reduction 8 with 11 rules applied. Total rules applied 4676 place count 1545 transition count 2615
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 8 with 11 rules applied. Total rules applied 4687 place count 1534 transition count 2615
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 9 with 9 rules applied. Total rules applied 4696 place count 1534 transition count 2606
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 9 with 9 rules applied. Total rules applied 4705 place count 1525 transition count 2606
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 10 with 10 rules applied. Total rules applied 4715 place count 1525 transition count 2606
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 4716 place count 1524 transition count 2605
Reduce places removed 20 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 10 with 30 rules applied. Total rules applied 4746 place count 1504 transition count 2595
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 11 with 10 rules applied. Total rules applied 4756 place count 1494 transition count 2595
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 30 Pre rules applied. Total rules applied 4756 place count 1494 transition count 2565
Deduced a syphon composed of 30 places in 7 ms
Ensure Unique test removed 1 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 12 with 61 rules applied. Total rules applied 4817 place count 1463 transition count 2565
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 12 with 11 rules applied. Total rules applied 4828 place count 1452 transition count 2565
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 4828 place count 1452 transition count 2564
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 4830 place count 1451 transition count 2564
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 6 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 13 with 42 rules applied. Total rules applied 4872 place count 1430 transition count 2543
Discarding 10 places :
Symmetric choice reduction at 13 with 10 rule applications. Total rules 4882 place count 1420 transition count 2533
Iterating global reduction 13 with 10 rules applied. Total rules applied 4892 place count 1420 transition count 2533
Free-agglomeration rule applied 10 times.
Iterating global reduction 13 with 10 rules applied. Total rules applied 4902 place count 1420 transition count 2523
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 13 with 10 rules applied. Total rules applied 4912 place count 1410 transition count 2523
Applied a total of 4912 rules in 1992 ms. Remains 1410 /3954 variables (removed 2544) and now considering 2523/4876 (removed 2353) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1992 ms. Remains : 1410/3954 places, 2523/4876 transitions.
RANDOM walk for 40000 steps (340 resets) in 720 ms. (55 steps per ms) remains 16/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 16/16 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17707834955855159020.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8593541734469752556.kers'
[2026-05-22 22:40:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17707834955855159020.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8593541734469752556.kers]
Culling duplicate invariants (modulo rational): removing 22 columns.
Culled 22 columns in 1 ms.
// Phase 1: matrix 2523 rows 1388 cols 9892 entries
Finished phase 1 with 340 SingleSign rule and 835 generalized
[2026-05-22 22:40:22] [INFO ] Computed 235 invariants in 27 ms
Computed 235 P flows in 27 ms.
Exported basis to /tmp/petrispot-output-8593541734469752556.kers
Total runtime 30 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 267/293 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/293 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 82/375 variables, 9/30 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/375 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 27/402 variables, 6/36 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/402 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 4/406 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 1/407 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/407 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (OVERLAPS) 590/997 variables, 81/122 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/997 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (OVERLAPS) 148/1145 variables, 37/159 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1145 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 15 (OVERLAPS) 41/1186 variables, 12/171 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1186 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 17 (OVERLAPS) 141/1327 variables, 45/216 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1327 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 19 (OVERLAPS) 31/1358 variables, 8/224 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1358 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 21 (OVERLAPS) 2/1360 variables, 2/226 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1360 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 23 (OVERLAPS) 40/1400 variables, 7/233 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1400 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 25 (OVERLAPS) 10/1410 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1410 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 27 (OVERLAPS) 2523/3933 variables, 1410/1645 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3933 variables, 0/1645 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 29 (OVERLAPS) 0/3933 variables, 0/1645 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3933/3933 variables, and 1645 constraints, problems are : Problem set: 0 solved, 16 unsolved in 8043 ms.
Refiners :[Positive P Invariants (semi-flows): 102/102 constraints, Generalized P Invariants (flows): 133/133 constraints, State Equation: 1410/1410 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 267/293 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/293 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 82/375 variables, 9/30 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/375 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 27/402 variables, 6/36 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/402 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 4/406 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 1/407 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/407 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (OVERLAPS) 590/997 variables, 81/122 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/997 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/997 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (OVERLAPS) 148/1145 variables, 37/161 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1145 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 16 (OVERLAPS) 41/1186 variables, 12/173 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1186 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 18 (OVERLAPS) 141/1327 variables, 45/218 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Problem AtomicPropp4 is UNSAT
At refinement iteration 19 (INCLUDED_ONLY) 0/1327 variables, 1/219 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1327 variables, 0/219 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 21 (OVERLAPS) 31/1358 variables, 8/227 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1358 variables, 0/227 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 23 (OVERLAPS) 2/1360 variables, 2/229 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1360 variables, 0/229 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 25 (OVERLAPS) 40/1400 variables, 7/236 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1400 variables, 0/236 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 27 (OVERLAPS) 10/1410 variables, 2/238 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1410 variables, 0/238 constraints. Problems are: Problem set: 1 solved, 15 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
At refinement iteration 29 (OVERLAPS) 2523/3933 variables, 1410/1648 constraints. Problems are: Problem set: 5 solved, 11 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/3933 variables, 11/1659 constraints. Problems are: Problem set: 5 solved, 11 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/3933 variables, 1/1660 constraints. Problems are: Problem set: 5 solved, 11 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3933/3933 variables, and 1660 constraints, problems are : Problem set: 5 solved, 11 unsolved in 45032 ms.
Refiners :[Positive P Invariants (semi-flows): 102/102 constraints, Generalized P Invariants (flows): 133/133 constraints, State Equation: 1410/1410 constraints, PredecessorRefiner: 11/16 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 53129ms problems are : Problem set: 5 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 16 out of 1410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1410/1410 places, 2523/2523 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1410 transition count 2521
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1408 transition count 2521
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 4 place count 1408 transition count 2514
Deduced a syphon composed of 7 places in 6 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 18 place count 1401 transition count 2514
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 1400 transition count 2505
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 1400 transition count 2505
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 1399 transition count 2497
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 1399 transition count 2497
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 1398 transition count 2489
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 1398 transition count 2489
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 1397 transition count 2481
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 1397 transition count 2481
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 1396 transition count 2473
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 1396 transition count 2473
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 1395 transition count 2465
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 1395 transition count 2465
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 1394 transition count 2457
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 1394 transition count 2457
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 1393 transition count 2449
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 1393 transition count 2449
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 1392 transition count 2441
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 1392 transition count 2441
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 37 place count 1391 transition count 2433
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 1391 transition count 2433
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 39 place count 1390 transition count 2425
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 1390 transition count 2425
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 1389 transition count 2417
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 1389 transition count 2417
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 1388 transition count 2409
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 1388 transition count 2409
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 1387 transition count 2401
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 1387 transition count 2401
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 1386 transition count 2393
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 1386 transition count 2393
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 1385 transition count 2385
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 1385 transition count 2385
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 1384 transition count 2377
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 1384 transition count 2377
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 55 place count 1382 transition count 2376
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 56 place count 1381 transition count 2375
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 1381 transition count 2375
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 58 place count 1381 transition count 2374
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 59 place count 1380 transition count 2374
Applied a total of 59 rules in 1260 ms. Remains 1380 /1410 variables (removed 30) and now considering 2374/2523 (removed 149) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1260 ms. Remains : 1380/1410 places, 2374/2523 transitions.
RANDOM walk for 40000 steps (370 resets) in 494 ms. (80 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (28 resets) in 232 ms. (171 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (35 resets) in 236 ms. (168 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (36 resets) in 255 ms. (156 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (34 resets) in 112 ms. (354 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (32 resets) in 245 ms. (162 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (32 resets) in 116 ms. (341 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (34 resets) in 115 ms. (344 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (36 resets) in 106 ms. (373 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (32 resets) in 88 ms. (449 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (35 resets) in 93 ms. (425 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (34 resets) in 93 ms. (425 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 134865 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :0 out of 11
Probabilistic random walk after 134865 steps, saw 30368 distinct states, run finished after 3012 ms. (steps per millisecond=44 ) 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-4490278907227754766.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5077052360333152541.kers'
[2026-05-22 22:41:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4490278907227754766.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5077052360333152541.kers]
Culling duplicate invariants (modulo rational): removing 22 columns.
Culled 22 columns in 1 ms.
// Phase 1: matrix 2374 rows 1358 cols 9316 entries
Finished phase 1 with 326 SingleSign rule and 820 generalized
[2026-05-22 22:41:20] [INFO ] Computed 234 invariants in 26 ms
Computed 234 P flows in 27 ms.
Exported basis to /tmp/petrispot-output-5077052360333152541.kers
Total runtime 29 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 173/189 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 86/275 variables, 9/23 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 9/284 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 2/286 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/286 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 442/728 variables, 61/90 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/728 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 149/877 variables, 33/123 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/877 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (OVERLAPS) 33/910 variables, 10/133 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/910 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (OVERLAPS) 146/1056 variables, 40/173 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1056 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (OVERLAPS) 53/1109 variables, 11/184 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1109 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 19 (OVERLAPS) 3/1112 variables, 3/187 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1112 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 21 (OVERLAPS) 55/1167 variables, 10/197 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1167 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 23 (OVERLAPS) 12/1179 variables, 3/200 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1179 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 25 (OVERLAPS) 52/1231 variables, 4/204 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1231 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 27 (OVERLAPS) 41/1272 variables, 6/210 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1272 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 29 (OVERLAPS) 1/1273 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1273 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 31 (OVERLAPS) 34/1307 variables, 8/219 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1307 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 33 (OVERLAPS) 12/1319 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1319 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 35 (OVERLAPS) 7/1326 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1326 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 37 (OVERLAPS) 46/1372 variables, 6/227 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1372 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 39 (OVERLAPS) 2/1374 variables, 2/229 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1374 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 41 (OVERLAPS) 1/1375 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1375 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 43 (OVERLAPS) 5/1380 variables, 4/234 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1380 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 45 (OVERLAPS) 2374/3754 variables, 1380/1614 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/3754 variables, 0/1614 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 47 (OVERLAPS) 0/3754 variables, 2/1616 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/3754 variables, 0/1616 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 49 (OVERLAPS) 0/3754 variables, 0/1616 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3754/3754 variables, and 1616 constraints, problems are : Problem set: 0 solved, 11 unsolved in 12145 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, Generalized P Invariants (flows): 133/133 constraints, State Equation: 1380/1380 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 173/189 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 86/275 variables, 9/23 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 9/284 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 2/286 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/286 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 442/728 variables, 61/90 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/728 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/728 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 149/877 variables, 33/124 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/877 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (OVERLAPS) 33/910 variables, 10/134 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/910 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (OVERLAPS) 146/1056 variables, 40/174 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1056 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 18 (OVERLAPS) 53/1109 variables, 11/185 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1109 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 20 (OVERLAPS) 3/1112 variables, 3/188 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1112 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 22 (OVERLAPS) 55/1167 variables, 10/198 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1167 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 24 (OVERLAPS) 12/1179 variables, 3/201 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1179 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 26 (OVERLAPS) 52/1231 variables, 4/205 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1231 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 28 (OVERLAPS) 41/1272 variables, 6/211 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1272 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 30 (OVERLAPS) 1/1273 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1273 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 32 (OVERLAPS) 34/1307 variables, 8/220 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1307 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 34 (OVERLAPS) 12/1319 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1319 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 36 (OVERLAPS) 7/1326 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1326 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 38 (OVERLAPS) 46/1372 variables, 6/228 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1372 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 40 (OVERLAPS) 2/1374 variables, 2/230 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1374 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 42 (OVERLAPS) 1/1375 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1375 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 44 (OVERLAPS) 5/1380 variables, 4/235 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1380 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1380 variables, 2/238 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1380 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 48 (OVERLAPS) 2374/3754 variables, 1380/1618 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/3754 variables, 11/1629 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/3754 variables, 1/1630 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/3754 variables, 0/1630 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 52 (OVERLAPS) 0/3754 variables, 0/1630 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3754/3754 variables, and 1630 constraints, problems are : Problem set: 0 solved, 11 unsolved in 57250 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, Generalized P Invariants (flows): 133/133 constraints, State Equation: 1380/1380 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 69453ms problems are : Problem set: 0 solved, 11 unsolved
Parikh walk visited 1 properties in 32690 ms.
Support contains 15 out of 1380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1380/1380 places, 2374/2374 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1380 transition count 2373
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1379 transition count 2373
Applied a total of 2 rules in 92 ms. Remains 1379 /1380 variables (removed 1) and now considering 2373/2374 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 1379/1380 places, 2373/2374 transitions.
Successfully simplified 5 atomic propositions for a total of 13 simplifications.
FORMULA ASLink-PT-10b-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10b-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 162 stabilizing places and 162 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 3954 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3954/3954 places, 4876/4876 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 739 transitions
Trivial Post-agglo rules discarded 739 transitions
Performed 739 trivial Post agglomeration. Transition count delta: 739
Iterating post reduction 0 with 739 rules applied. Total rules applied 739 place count 3953 transition count 4136
Reduce places removed 739 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 742 rules applied. Total rules applied 1481 place count 3214 transition count 4133
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1483 place count 3212 transition count 4133
Performed 1072 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1072 Pre rules applied. Total rules applied 1483 place count 3212 transition count 3061
Deduced a syphon composed of 1072 places in 9 ms
Ensure Unique test removed 104 places
Reduce places removed 1176 places and 0 transitions.
Iterating global reduction 3 with 2248 rules applied. Total rules applied 3731 place count 2036 transition count 3061
Discarding 10 places :
Implicit places reduction removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 3 with 74 rules applied. Total rules applied 3805 place count 2026 transition count 2997
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 4 with 64 rules applied. Total rules applied 3869 place count 1962 transition count 2997
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 41 Pre rules applied. Total rules applied 3869 place count 1962 transition count 2956
Deduced a syphon composed of 41 places in 8 ms
Ensure Unique test removed 41 places
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 5 with 123 rules applied. Total rules applied 3992 place count 1880 transition count 2956
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 40 Pre rules applied. Total rules applied 3992 place count 1880 transition count 2916
Deduced a syphon composed of 40 places in 9 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 5 with 80 rules applied. Total rules applied 4072 place count 1840 transition count 2916
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 4075 place count 1837 transition count 2905
Iterating global reduction 5 with 3 rules applied. Total rules applied 4078 place count 1837 transition count 2905
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 4078 place count 1837 transition count 2904
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 4080 place count 1836 transition count 2904
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 4082 place count 1834 transition count 2895
Iterating global reduction 5 with 2 rules applied. Total rules applied 4084 place count 1834 transition count 2895
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 4085 place count 1833 transition count 2887
Iterating global reduction 5 with 1 rules applied. Total rules applied 4086 place count 1833 transition count 2887
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 4087 place count 1832 transition count 2879
Iterating global reduction 5 with 1 rules applied. Total rules applied 4088 place count 1832 transition count 2879
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 4089 place count 1831 transition count 2871
Iterating global reduction 5 with 1 rules applied. Total rules applied 4090 place count 1831 transition count 2871
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 4091 place count 1830 transition count 2863
Iterating global reduction 5 with 1 rules applied. Total rules applied 4092 place count 1830 transition count 2863
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 4093 place count 1829 transition count 2855
Iterating global reduction 5 with 1 rules applied. Total rules applied 4094 place count 1829 transition count 2855
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 4095 place count 1828 transition count 2847
Iterating global reduction 5 with 1 rules applied. Total rules applied 4096 place count 1828 transition count 2847
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 4097 place count 1827 transition count 2839
Iterating global reduction 5 with 1 rules applied. Total rules applied 4098 place count 1827 transition count 2839
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 4099 place count 1826 transition count 2831
Iterating global reduction 5 with 1 rules applied. Total rules applied 4100 place count 1826 transition count 2831
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 4101 place count 1825 transition count 2823
Iterating global reduction 5 with 1 rules applied. Total rules applied 4102 place count 1825 transition count 2823
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 4103 place count 1824 transition count 2815
Iterating global reduction 5 with 1 rules applied. Total rules applied 4104 place count 1824 transition count 2815
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 4105 place count 1823 transition count 2807
Iterating global reduction 5 with 1 rules applied. Total rules applied 4106 place count 1823 transition count 2807
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 4107 place count 1822 transition count 2799
Iterating global reduction 5 with 1 rules applied. Total rules applied 4108 place count 1822 transition count 2799
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 4109 place count 1821 transition count 2791
Iterating global reduction 5 with 1 rules applied. Total rules applied 4110 place count 1821 transition count 2791
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 4111 place count 1820 transition count 2783
Iterating global reduction 5 with 1 rules applied. Total rules applied 4112 place count 1820 transition count 2783
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 4113 place count 1819 transition count 2775
Iterating global reduction 5 with 1 rules applied. Total rules applied 4114 place count 1819 transition count 2775
Performed 307 Post agglomeration using F-continuation condition.Transition count delta: 307
Deduced a syphon composed of 307 places in 7 ms
Ensure Unique test removed 2 places
Reduce places removed 309 places and 0 transitions.
Iterating global reduction 5 with 616 rules applied. Total rules applied 4730 place count 1510 transition count 2468
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 4734 place count 1506 transition count 2464
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 4739 place count 1505 transition count 2464
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 4740 place count 1505 transition count 2463
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 4741 place count 1504 transition count 2463
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 4741 place count 1504 transition count 2462
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 4743 place count 1503 transition count 2462
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 4745 place count 1501 transition count 2460
Iterating global reduction 7 with 2 rules applied. Total rules applied 4747 place count 1501 transition count 2460
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 7 with 2 rules applied. Total rules applied 4749 place count 1501 transition count 2458
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 4750 place count 1500 transition count 2458
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 4752 place count 1499 transition count 2463
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 4754 place count 1497 transition count 2461
Reduce places removed 20 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 9 with 30 rules applied. Total rules applied 4784 place count 1477 transition count 2451
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 10 with 10 rules applied. Total rules applied 4794 place count 1467 transition count 2451
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 30 Pre rules applied. Total rules applied 4794 place count 1467 transition count 2421
Deduced a syphon composed of 30 places in 10 ms
Ensure Unique test removed 1 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 11 with 61 rules applied. Total rules applied 4855 place count 1436 transition count 2421
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 11 with 21 rules applied. Total rules applied 4876 place count 1415 transition count 2421
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 4876 place count 1415 transition count 2420
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 4878 place count 1414 transition count 2420
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 6 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 12 with 62 rules applied. Total rules applied 4940 place count 1383 transition count 2389
Discarding 20 places :
Symmetric choice reduction at 12 with 20 rule applications. Total rules 4960 place count 1363 transition count 2369
Iterating global reduction 12 with 20 rules applied. Total rules applied 4980 place count 1363 transition count 2369
Discarding 10 places :
Symmetric choice reduction at 12 with 10 rule applications. Total rules 4990 place count 1353 transition count 2359
Iterating global reduction 12 with 10 rules applied. Total rules applied 5000 place count 1353 transition count 2359
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 12 with 10 rules applied. Total rules applied 5010 place count 1353 transition count 2349
Applied a total of 5010 rules in 2654 ms. Remains 1353 /3954 variables (removed 2601) and now considering 2349/4876 (removed 2527) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15875098848502053453.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10880638697262020730.kers'
[2026-05-22 22:43:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15875098848502053453.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10880638697262020730.kers]
Culling duplicate invariants (modulo rational): removing 31 columns.
Culled 31 columns in 1 ms.
// Phase 1: matrix 2349 rows 1322 cols 9138 entries
Finished phase 1 with 317 SingleSign rule and 814 generalized
[2026-05-22 22:43:05] [INFO ] Computed 222 invariants in 26 ms
Computed 222 P flows in 26 ms.
Exported basis to /tmp/petrispot-output-10880638697262020730.kers
Total runtime 30 ms.
[2026-05-22 22:43:06] [INFO ] Implicit Places using invariants in 1296 ms returned [1, 18, 19, 31, 48, 67, 87, 138, 148, 149, 151, 168, 186, 206, 257, 258, 270, 271, 273, 290, 308, 328, 379, 380, 392, 393, 395, 412, 430, 450, 501, 502, 514, 515, 517, 534, 552, 572, 623, 624, 636, 637, 641, 676, 696, 747, 748, 760, 761, 763, 780, 798, 818, 869, 870, 882, 883, 885, 902, 920, 940, 991, 992, 1004, 1005, 1007, 1024, 1042, 1062, 1113, 1114, 1126, 1127, 1129, 1146, 1164, 1184, 1235, 1236, 1239, 1250, 1251, 1252, 1270, 1291, 1292, 1293, 1294]
Discarding 88 places :
Implicit Place search using SMT only with invariants took 1317 ms to find 88 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1265/3954 places, 2349/4876 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 159 transitions
Trivial Post-agglo rules discarded 159 transitions
Performed 159 trivial Post agglomeration. Transition count delta: 159
Iterating post reduction 0 with 159 rules applied. Total rules applied 159 place count 1265 transition count 2190
Reduce places removed 159 places and 0 transitions.
Iterating post reduction 1 with 159 rules applied. Total rules applied 318 place count 1106 transition count 2190
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 47 Pre rules applied. Total rules applied 318 place count 1106 transition count 2143
Deduced a syphon composed of 47 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 95 rules applied. Total rules applied 413 place count 1058 transition count 2143
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 425 place count 1054 transition count 2135
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 433 place count 1046 transition count 2135
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 436 place count 1043 transition count 2132
Iterating global reduction 4 with 3 rules applied. Total rules applied 439 place count 1043 transition count 2132
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 442 place count 1043 transition count 2129
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 4 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 5 with 146 rules applied. Total rules applied 588 place count 970 transition count 2056
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 592 place count 968 transition count 2057
Applied a total of 592 rules in 206 ms. Remains 968 /1265 variables (removed 297) and now considering 2057/2349 (removed 292) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1694843557946568945.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11941124355917990901.kers'
[2026-05-22 22:43:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1694843557946568945.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11941124355917990901.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 2057 rows 968 cols 8281 entries
Finished phase 1 with 268 SingleSign rule and 571 generalized
[2026-05-22 22:43:07] [INFO ] Computed 129 invariants in 34 ms
Computed 129 P flows in 34 ms.
Exported basis to /tmp/petrispot-output-11941124355917990901.kers
Total runtime 35 ms.
[2026-05-22 22:43:07] [INFO ] Implicit Places using invariants in 872 ms returned [89, 95, 100, 175, 181, 186, 263, 269, 274, 351, 357, 362, 439, 445, 450, 534, 542, 548, 625, 631, 636, 713, 719, 724, 801, 807, 812, 889, 895, 900, 965]
Discarding 31 places :
Implicit Place search using SMT only with invariants took 876 ms to find 31 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 937/3954 places, 2057/4876 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 937 transition count 2056
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 936 transition count 2056
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 22 place count 916 transition count 2036
Iterating global reduction 2 with 20 rules applied. Total rules applied 42 place count 916 transition count 2036
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 62 place count 896 transition count 2016
Iterating global reduction 2 with 20 rules applied. Total rules applied 82 place count 896 transition count 2016
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 93 place count 885 transition count 2005
Iterating global reduction 2 with 11 rules applied. Total rules applied 104 place count 885 transition count 2005
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 105 place count 884 transition count 2004
Iterating global reduction 2 with 1 rules applied. Total rules applied 106 place count 884 transition count 2004
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 107 place count 883 transition count 2003
Iterating global reduction 2 with 1 rules applied. Total rules applied 108 place count 883 transition count 2003
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 3 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 128 place count 873 transition count 1993
Applied a total of 128 rules in 270 ms. Remains 873 /937 variables (removed 64) and now considering 1993/2057 (removed 64) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16936025889489948789.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14455987574573114751.kers'
[2026-05-22 22:43:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16936025889489948789.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14455987574573114751.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1993 rows 873 cols 8042 entries
Finished phase 1 with 276 SingleSign rule and 499 generalized
[2026-05-22 22:43:08] [INFO ] Computed 98 invariants in 31 ms
Computed 98 P flows in 31 ms.
Exported basis to /tmp/petrispot-output-14455987574573114751.kers
Total runtime 36 ms.
[2026-05-22 22:43:08] [INFO ] Implicit Places using invariants in 696 ms returned []
[2026-05-22 22:43:08] [INFO ] Invariant cache hit.
[2026-05-22 22:43:11] [INFO ] Implicit Places using invariants and state equation in 2529 ms returned []
Implicit Place search using SMT with State Equation took 3243 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 873/3954 places, 1993/4876 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 8566 ms. Remains : 873/3954 places, 1993/4876 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 238 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-10b-LTLFireability-01
Product exploration explored 100000 steps with 1021 reset in 478 ms.
Product exploration explored 100000 steps with 1020 reset in 434 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge based reduction with 3 factoid took 56 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (389 resets) in 207 ms. (192 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (41 resets) in 133 ms. (298 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 258609 steps, run timeout after 3001 ms. (steps per millisecond=86 ) properties seen :0 out of 1
Probabilistic random walk after 258609 steps, saw 60154 distinct states, run finished after 3001 ms. (steps per millisecond=86 ) properties seen :0
[2026-05-22 22:43:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 37/39 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/49 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 141/190 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 139/329 variables, 10/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/329 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/329 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 42/371 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/371 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 66/437 variables, 4/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/437 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/439 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/439 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 319/758 variables, 39/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/758 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 46/804 variables, 7/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/804 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 69/873 variables, 17/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/873 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 1993/2866 variables, 873/972 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2866 variables, 0/972 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/2866 variables, 0/972 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2866/2866 variables, and 972 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1679 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 69/69 constraints, State Equation: 873/873 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 37/39 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/49 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 141/190 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 139/329 variables, 10/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/329 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/329 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 42/371 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/371 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 66/437 variables, 4/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/437 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/439 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/439 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 319/758 variables, 39/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/758 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 46/804 variables, 7/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/804 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 69/873 variables, 17/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/873 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 1993/2866 variables, 873/972 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2866 variables, 1/973 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2866 variables, 1/974 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2866 variables, 0/974 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/2866 variables, 0/974 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2866/2866 variables, and 974 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1782 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 69/69 constraints, State Equation: 873/873 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 3486ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 107 ms.
Support contains 2 out of 873 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 873/873 places, 1993/1993 transitions.
Free-agglomeration rule applied 50 times.
Iterating global reduction 0 with 50 rules applied. Total rules applied 50 place count 873 transition count 1943
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 110 place count 823 transition count 1933
Free-agglomeration rule (complex) applied 29 times.
Iterating global reduction 1 with 29 rules applied. Total rules applied 139 place count 823 transition count 1904
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 168 place count 794 transition count 1904
Applied a total of 168 rules in 158 ms. Remains 794 /873 variables (removed 79) and now considering 1904/1993 (removed 89) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 159 ms. Remains : 794/873 places, 1904/1993 transitions.
RANDOM walk for 40000 steps (610 resets) in 205 ms. (194 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (66 resets) in 72 ms. (547 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 247418 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :0 out of 1
Probabilistic random walk after 247418 steps, saw 66009 distinct states, run finished after 3001 ms. (steps per millisecond=82 ) 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-9935413847065485647.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15708869819057056681.kers'
[2026-05-22 22:43:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9935413847065485647.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15708869819057056681.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 1904 rows 794 cols 8019 entries
Finished phase 1 with 241 SingleSign rule and 455 generalized
[2026-05-22 22:43:22] [INFO ] Computed 98 invariants in 46 ms
Computed 98 P flows in 47 ms.
Exported basis to /tmp/petrispot-output-15708869819057056681.kers
Total runtime 49 ms.
[2026-05-22 22:43:22] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 37/39 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/49 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 123/172 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 132/304 variables, 10/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/304 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/304 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 40/344 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/344 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 61/405 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/405 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/407 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/407 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 282/689 variables, 39/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/689 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 46/735 variables, 7/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/735 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/735 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 59/794 variables, 17/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/794 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 1904/2698 variables, 794/895 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 24 (INCLUDED_ONLY) 0/2698 variables, 1/896 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2698 variables, 0/896 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/2698 variables, 0/896 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2698/2698 variables, and 896 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2014 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 69/69 constraints, State Equation: 794/794 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 37/39 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/49 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 123/172 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 132/304 variables, 10/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/304 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/304 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 40/344 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/344 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 61/405 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/405 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/407 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/407 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 282/689 variables, 39/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/689 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 46/735 variables, 7/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/735 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/735 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 59/794 variables, 17/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/794 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 1904/2698 variables, 794/895 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2698 variables, 1/896 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2698 variables, 1/897 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2698 variables, 0/897 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/2698 variables, 0/897 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2698/2698 variables, and 897 constraints, problems are : Problem set: 0 solved, 1 unsolved in 991 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 69/69 constraints, State Equation: 794/794 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3095ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 83 ms.
Support contains 2 out of 794 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 794/794 places, 1904/1904 transitions.
Applied a total of 0 rules in 41 ms. Remains 794 /794 variables (removed 0) and now considering 1904/1904 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 794/794 places, 1904/1904 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 794/794 places, 1904/1904 transitions.
Applied a total of 0 rules in 41 ms. Remains 794 /794 variables (removed 0) and now considering 1904/1904 (removed 0) transitions.
[2026-05-22 22:43:26] [INFO ] Invariant cache hit.
[2026-05-22 22:43:28] [INFO ] Implicit Places using invariants in 2826 ms returned [89, 90, 160, 161, 231, 232, 302, 303, 373, 374, 451, 452, 522, 523, 593, 594, 664, 665]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 2829 ms to find 18 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 776/794 places, 1904/1904 transitions.
Applied a total of 0 rules in 54 ms. Remains 776 /776 variables (removed 0) and now considering 1904/1904 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2924 ms. Remains : 776/794 places, 1904/1904 transitions.
RANDOM walk for 40000 steps (634 resets) in 234 ms. (170 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (64 resets) in 57 ms. (689 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 256597 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :0 out of 1
Probabilistic random walk after 256597 steps, saw 68682 distinct states, run finished after 3001 ms. (steps per millisecond=85 ) 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-11985252915862204105.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17714274396010025268.kers'
[2026-05-22 22:43:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11985252915862204105.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17714274396010025268.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 1904 rows 776 cols 7776 entries
Finished phase 1 with 203 SingleSign rule and 493 generalized
[2026-05-22 22:43:32] [INFO ] Computed 80 invariants in 54 ms
Computed 80 P flows in 55 ms.
Exported basis to /tmp/petrispot-output-17714274396010025268.kers
Total runtime 73 ms.
[2026-05-22 22:43:32] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 37/39 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/49 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 119/168 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 132/300 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/300 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/300 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 40/340 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/340 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 61/401 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/401 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/403 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/403 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 274/677 variables, 31/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/677 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 46/723 variables, 7/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/723 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 53/776 variables, 11/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/776 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 1904/2680 variables, 776/857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2680 variables, 1/858 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2680 variables, 0/858 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/2680 variables, 0/858 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2680/2680 variables, and 858 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1557 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 776/776 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 37/39 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/49 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 119/168 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 132/300 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/300 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/300 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 40/340 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/340 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 61/401 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/401 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/403 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/403 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 274/677 variables, 31/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/677 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 46/723 variables, 7/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/723 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 53/776 variables, 11/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/776 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 1904/2680 variables, 776/857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2680 variables, 1/858 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2680 variables, 1/859 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2680 variables, 0/859 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/2680 variables, 0/859 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2680/2680 variables, and 859 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1160 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 776/776 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2811ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 73 ms.
Support contains 2 out of 776 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 776/776 places, 1904/1904 transitions.
Applied a total of 0 rules in 39 ms. Remains 776 /776 variables (removed 0) and now considering 1904/1904 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 776/776 places, 1904/1904 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 776/776 places, 1904/1904 transitions.
Applied a total of 0 rules in 37 ms. Remains 776 /776 variables (removed 0) and now considering 1904/1904 (removed 0) transitions.
[2026-05-22 22:43:34] [INFO ] Invariant cache hit.
[2026-05-22 22:43:35] [INFO ] Implicit Places using invariants in 714 ms returned []
[2026-05-22 22:43:35] [INFO ] Invariant cache hit.
[2026-05-22 22:43:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 22:43:37] [INFO ] Implicit Places using invariants and state equation in 1910 ms returned []
Implicit Place search using SMT with State Equation took 2631 ms to find 0 implicit places.
[2026-05-22 22:43:37] [INFO ] Redundant transitions in 131 ms returned []
Running 1858 sub problems to find dead transitions.
[2026-05-22 22:43:37] [INFO ] Invariant cache hit.
[2026-05-22 22:43:37] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/774 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 1858 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/774 variables, 48/73 constraints. Problems are: Problem set: 0 solved, 1858 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 1.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 1.0)
(s154 0.0)
(s155 1.0)
(s156 0.0)
(s157 0.0)
(s158 1.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 timeout
0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 1.0)
(s223 0.0)
(s224 1.0)
(s225 0.0)
(s226 0.0)
(s227 1.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 1.0)
(s292 0.0)
(s293 1.0)
(s294 0.0)
(s295 0.0)
(s296 1.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 1.0)
(s361 0.0)
(s362 1.0)
(s363 0.0)
(s364 0.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 0.0)
(s370 1.0)
(s371 0.0)
(s372 1.0)
(s373 0.0)
(s374 1.0)
(s375 0.0)
(s376 1.0)
(s377 0.0)
(s378 1.0)
(s379 0.0)
(s380 1.0)
(s381 0.0)
(s382 1.0)
(s383 0.0)
(s384 1.0)
(s385 1.0)
(s386 0.0)
(s387 1.0)
(s388 0.0)
(s389 1.0)
(s390 0.0)
(s391 1.0)
(s392 0.0)
(s393 1.0)
(s394 0.0)
(s395 1.0)
(s396 0.0)
(s397 1.0)
(s398 0.0)
(s399 1.0)
(s400 0.0)
(s401 1.0)
(s402 0.0)
(s403 1.0)
(s404 0.0)
(s405 1.0)
(s406 0.0)
(s407 1.0)
(s408 0.0)
(s409 1.0)
(s410 0.0)
(s411 1.0)
(s412 0.0)
(s413 1.0)
(s414 0.0)
(s415 1.0)
(s416 0.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 0.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 0.0)
(s435 0.0)
(s436 1.0)
(s437 0.0)
(s438 1.0)
(s439 0.0)
(s440 0.0)
(s441 1.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 1.0)
(s506 0.0)
(s507 1.0)
(s508 0.0)
(s509 0.0)
(s510 1.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
( org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 774/2680 variables, and 73 constraints, problems are : Problem set: 0 solved, 1858 unsolved in 30063 ms.
Refiners :[Positive P Invariants (semi-flows): 25/29 constraints, Generalized P Invariants (flows): 48/51 constraints, State Equation: 0/776 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1858/1858 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1858 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/774 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 1858 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/774 variables, 48/73 constraints. Problems are: Problem set: 0 solved, 1858 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 774/2680 variables, and 73 constraints, problems are : Problem set: 0 solved, 1858 unsolved in 30064 ms.
Refiners :[Positive P Invariants (semi-flows): 25/29 constraints, Generalized P Invariants (flows): 48/51 constraints, State Equation: 0/776 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1858 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60984ms problems are : Problem set: 0 solved, 1858 unsolved
Search for dead transitions found 0 dead transitions in 60990ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63816 ms. Remains : 776/776 places, 1904/1904 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 37 ms. Remains 776 /776 variables (removed 0) and now considering 1904/1904 (removed 0) transitions.
Running SMT prover for 1 properties.
[2026-05-22 22:44:38] [INFO ] Invariant cache hit.
[2026-05-22 22:44:38] [INFO ] [Real]Absence check using 29 positive place invariants in 9 ms returned sat
[2026-05-22 22:44:39] [INFO ] [Real]Absence check using 29 positive and 51 generalized place invariants in 26 ms returned sat
[2026-05-22 22:44:39] [INFO ] After 937ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-22 22:44:39] [INFO ] [Nat]Absence check using 29 positive place invariants in 9 ms returned sat
[2026-05-22 22:44:39] [INFO ] [Nat]Absence check using 29 positive and 51 generalized place invariants in 15 ms returned sat
[2026-05-22 22:44:40] [INFO ] After 601ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-22 22:44:40] [INFO ] After 689ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-22 22:44:40] [INFO ] After 879ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 1878 ms.
Knowledge based reduction with 3 factoid took 46 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 88080 ms.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 873 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 873/873 places, 1993/1993 transitions.
Applied a total of 0 rules in 42 ms. Remains 873 /873 variables (removed 0) and now considering 1993/1993 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10348800563608790004.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1868661761854870894.kers'
[2026-05-22 22:44:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10348800563608790004.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1868661761854870894.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1993 rows 873 cols 8042 entries
Finished phase 1 with 276 SingleSign rule and 499 generalized
[2026-05-22 22:44:40] [INFO ] Computed 98 invariants in 32 ms
Computed 98 P flows in 33 ms.
Exported basis to /tmp/petrispot-output-1868661761854870894.kers
Total runtime 35 ms.
[2026-05-22 22:44:41] [INFO ] Implicit Places using invariants in 736 ms returned []
[2026-05-22 22:44:41] [INFO ] Invariant cache hit.
[2026-05-22 22:44:44] [INFO ] Implicit Places using invariants and state equation in 2367 ms returned []
Implicit Place search using SMT with State Equation took 3113 ms to find 0 implicit places.
[2026-05-22 22:44:44] [INFO ] Redundant transitions in 46 ms returned []
Running 1929 sub problems to find dead transitions.
[2026-05-22 22:44:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/862 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/862 variables, 52/73 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 862/2866 variables, and 73 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30056 ms.
Refiners :[Positive P Invariants (semi-flows): 21/29 constraints, Generalized P Invariants (flows): 52/69 constraints, State Equation: 0/873 constraints, PredecessorRefiner: 1929/1929 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1929 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/862 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/862 variables, 52/73 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 862/2866 variables, and 73 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30064 ms.
Refiners :[Positive P Invariants (semi-flows): 21/29 constraints, Generalized P Invariants (flows): 52/69 constraints, State Equation: 0/873 constraints, PredecessorRefiner: 0/1929 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60892ms problems are : Problem set: 0 solved, 1929 unsolved
Search for dead transitions found 0 dead transitions in 60897ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 64108 ms. Remains : 873/873 places, 1993/1993 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (392 resets) in 195 ms. (204 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (47 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 229327 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :0 out of 1
Probabilistic random walk after 229327 steps, saw 53308 distinct states, run finished after 3001 ms. (steps per millisecond=76 ) properties seen :0
[2026-05-22 22:45:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 37/39 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/49 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 141/190 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 139/329 variables, 10/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/329 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/329 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 42/371 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/371 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 66/437 variables, 4/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/437 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/439 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/439 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 319/758 variables, 39/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/758 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 46/804 variables, 7/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/804 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 69/873 variables, 17/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/873 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 1993/2866 variables, 873/972 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2866 variables, 0/972 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/2866 variables, 0/972 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2866/2866 variables, and 972 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1870 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 69/69 constraints, State Equation: 873/873 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 37/39 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/49 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 141/190 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 139/329 variables, 10/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/329 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/329 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 42/371 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/371 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 66/437 variables, 4/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/437 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/439 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/439 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 319/758 variables, 39/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/758 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 46/804 variables, 7/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/804 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 69/873 variables, 17/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/873 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 1993/2866 variables, 873/972 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2866 variables, 1/973 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2866 variables, 1/974 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2866 variables, 0/974 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/2866 variables, 0/974 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2866/2866 variables, and 974 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2189 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 69/69 constraints, State Equation: 873/873 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 4092ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 76 ms.
Support contains 2 out of 873 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 873/873 places, 1993/1993 transitions.
Free-agglomeration rule applied 50 times.
Iterating global reduction 0 with 50 rules applied. Total rules applied 50 place count 873 transition count 1943
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 110 place count 823 transition count 1933
Free-agglomeration rule (complex) applied 29 times.
Iterating global reduction 1 with 29 rules applied. Total rules applied 139 place count 823 transition count 1904
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 168 place count 794 transition count 1904
Applied a total of 168 rules in 130 ms. Remains 794 /873 variables (removed 79) and now considering 1904/1993 (removed 89) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130 ms. Remains : 794/873 places, 1904/1993 transitions.
RANDOM walk for 40000 steps (640 resets) in 299 ms. (133 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (66 resets) in 49 ms. (800 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 231142 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :0 out of 1
Probabilistic random walk after 231142 steps, saw 61291 distinct states, run finished after 3001 ms. (steps per millisecond=77 ) 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-2124088012752193350.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6628581057471774861.kers'
[2026-05-22 22:45:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2124088012752193350.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6628581057471774861.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 1904 rows 794 cols 8019 entries
Finished phase 1 with 241 SingleSign rule and 455 generalized
[2026-05-22 22:45:55] [INFO ] Computed 98 invariants in 55 ms
Computed 98 P flows in 56 ms.
Exported basis to /tmp/petrispot-output-6628581057471774861.kers
Total runtime 59 ms.
[2026-05-22 22:45:55] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 37/39 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/49 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 123/172 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 132/304 variables, 10/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/304 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/304 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 40/344 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/344 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 61/405 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/405 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/407 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/407 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 282/689 variables, 39/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/689 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 46/735 variables, 7/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/735 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/735 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 59/794 variables, 17/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/794 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 1904/2698 variables, 794/895 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 24 (INCLUDED_ONLY) 0/2698 variables, 1/896 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2698 variables, 0/896 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/2698 variables, 0/896 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2698/2698 variables, and 896 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1804 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 69/69 constraints, State Equation: 794/794 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 37/39 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/49 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 123/172 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 132/304 variables, 10/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/304 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/304 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 40/344 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/344 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 61/405 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/405 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/407 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/407 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 282/689 variables, 39/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/689 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 46/735 variables, 7/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/735 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/735 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 59/794 variables, 17/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/794 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 1904/2698 variables, 794/895 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2698 variables, 1/896 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2698 variables, 1/897 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2698 variables, 0/897 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/2698 variables, 0/897 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2698/2698 variables, and 897 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1256 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 69/69 constraints, State Equation: 794/794 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3136ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 96 ms.
Support contains 2 out of 794 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 794/794 places, 1904/1904 transitions.
Applied a total of 0 rules in 42 ms. Remains 794 /794 variables (removed 0) and now considering 1904/1904 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 794/794 places, 1904/1904 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 794/794 places, 1904/1904 transitions.
Applied a total of 0 rules in 39 ms. Remains 794 /794 variables (removed 0) and now considering 1904/1904 (removed 0) transitions.
[2026-05-22 22:45:58] [INFO ] Invariant cache hit.
[2026-05-22 22:45:59] [INFO ] Implicit Places using invariants in 1049 ms returned [89, 90, 160, 161, 231, 232, 302, 303, 373, 374, 451, 452, 522, 523, 593, 594, 664, 665]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 1053 ms to find 18 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 776/794 places, 1904/1904 transitions.
Applied a total of 0 rules in 59 ms. Remains 776 /776 variables (removed 0) and now considering 1904/1904 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1151 ms. Remains : 776/794 places, 1904/1904 transitions.
RANDOM walk for 40000 steps (630 resets) in 215 ms. (185 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (70 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 241211 steps, run timeout after 3001 ms. (steps per millisecond=80 ) properties seen :0 out of 1
Probabilistic random walk after 241211 steps, saw 64340 distinct states, run finished after 3001 ms. (steps per millisecond=80 ) 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-13496454960340978929.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2274624864050739886.kers'
[2026-05-22 22:46:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13496454960340978929.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2274624864050739886.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 1904 rows 776 cols 7776 entries
Finished phase 1 with 203 SingleSign rule and 493 generalized
[2026-05-22 22:46:03] [INFO ] Computed 80 invariants in 56 ms
Computed 80 P flows in 56 ms.
Exported basis to /tmp/petrispot-output-2274624864050739886.kers
Total runtime 61 ms.
[2026-05-22 22:46:03] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 37/39 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/49 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 119/168 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 132/300 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/300 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/300 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 40/340 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/340 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 61/401 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/401 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/403 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/403 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 274/677 variables, 31/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/677 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 46/723 variables, 7/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/723 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 53/776 variables, 11/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/776 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 1904/2680 variables, 776/857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2680 variables, 1/858 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2680 variables, 0/858 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/2680 variables, 0/858 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2680/2680 variables, and 858 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1783 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 776/776 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 37/39 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/49 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 119/168 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 132/300 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/300 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/300 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 40/340 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/340 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 61/401 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/401 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/403 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/403 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 274/677 variables, 31/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/677 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 46/723 variables, 7/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/723 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 53/776 variables, 11/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/776 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 1904/2680 variables, 776/857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2680 variables, 1/858 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2680 variables, 1/859 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2680 variables, 0/859 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/2680 variables, 0/859 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2680/2680 variables, and 859 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1378 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 776/776 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3252ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 92 ms.
Support contains 2 out of 776 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 776/776 places, 1904/1904 transitions.
Applied a total of 0 rules in 36 ms. Remains 776 /776 variables (removed 0) and now considering 1904/1904 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 776/776 places, 1904/1904 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 776/776 places, 1904/1904 transitions.
Applied a total of 0 rules in 36 ms. Remains 776 /776 variables (removed 0) and now considering 1904/1904 (removed 0) transitions.
[2026-05-22 22:46:06] [INFO ] Invariant cache hit.
[2026-05-22 22:46:07] [INFO ] Implicit Places using invariants in 659 ms returned []
[2026-05-22 22:46:07] [INFO ] Invariant cache hit.
[2026-05-22 22:46:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 22:46:09] [INFO ] Implicit Places using invariants and state equation in 2176 ms returned []
Implicit Place search using SMT with State Equation took 2859 ms to find 0 implicit places.
[2026-05-22 22:46:09] [INFO ] Redundant transitions in 36 ms returned []
Running 1858 sub problems to find dead transitions.
[2026-05-22 22:46:09] [INFO ] Invariant cache hit.
[2026-05-22 22:46:09] [INFO ] State equation strengthened by 1 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/774 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 1858 unsolved
SMT process timed out in 30659ms, After SMT, problems are : Problem set: 0 solved, 1858 unsolved
Search for dead transitions found 0 dead transitions in 30664ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33629 ms. Remains : 776/776 places, 1904/1904 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 52 ms. Remains 776 /776 variables (removed 0) and now considering 1904/1904 (removed 0) transitions.
Running SMT prover for 1 properties.
[2026-05-22 22:46:40] [INFO ] Invariant cache hit.
[2026-05-22 22:46:40] [INFO ] [Real]Absence check using 29 positive place invariants in 12 ms returned sat
[2026-05-22 22:46:40] [INFO ] [Real]Absence check using 29 positive and 51 generalized place invariants in 42 ms returned sat
[2026-05-22 22:46:41] [INFO ] After 1009ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-22 22:46:41] [INFO ] [Nat]Absence check using 29 positive place invariants in 17 ms returned sat
[2026-05-22 22:46:41] [INFO ] [Nat]Absence check using 29 positive and 51 generalized place invariants in 48 ms returned sat
[2026-05-22 22:46:42] [INFO ] After 676ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-22 22:46:42] [INFO ] After 846ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-22 22:46:42] [INFO ] After 1203ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 2288 ms.
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 57740 ms.
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 998 reset in 333 ms.
Product exploration explored 100000 steps with 1036 reset in 357 ms.
Built C files in :
/tmp/ltsmin12409184784496301923
[2026-05-22 22:46:43] [INFO ] Too many transitions (1993) to apply POR reductions. Disabling POR matrices.
[2026-05-22 22:46:43] [INFO ] Built C files in 73ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12409184784496301923
Running compilation step : cd /tmp/ltsmin12409184784496301923;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12409184784496301923;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12409184784496301923;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 2 out of 873 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 873/873 places, 1993/1993 transitions.
Applied a total of 0 rules in 41 ms. Remains 873 /873 variables (removed 0) and now considering 1993/1993 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8349021135388601970.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16467295396252639169.kers'
[2026-05-22 22:46:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8349021135388601970.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16467295396252639169.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 1993 rows 873 cols 8042 entries
Finished phase 1 with 276 SingleSign rule and 499 generalized
[2026-05-22 22:46:46] [INFO ] Computed 98 invariants in 52 ms
Computed 98 P flows in 53 ms.
Exported basis to /tmp/petrispot-output-16467295396252639169.kers
Total runtime 55 ms.
[2026-05-22 22:46:47] [INFO ] Implicit Places using invariants in 916 ms returned []
[2026-05-22 22:46:47] [INFO ] Invariant cache hit.
[2026-05-22 22:46:50] [INFO ] Implicit Places using invariants and state equation in 2468 ms returned []
Implicit Place search using SMT with State Equation took 3389 ms to find 0 implicit places.
[2026-05-22 22:46:50] [INFO ] Redundant transitions in 39 ms returned []
Running 1929 sub problems to find dead transitions.
[2026-05-22 22:46:50] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/862 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
SMT process timed out in 30795ms, After SMT, problems are : Problem set: 0 solved, 1929 unsolved
Search for dead transitions found 0 dead transitions in 30800ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 34283 ms. Remains : 873/873 places, 1993/1993 transitions.
Built C files in :
/tmp/ltsmin8128931763838571648
[2026-05-22 22:47:21] [INFO ] Too many transitions (1993) to apply POR reductions. Disabling POR matrices.
[2026-05-22 22:47:21] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8128931763838571648
Running compilation step : cd /tmp/ltsmin8128931763838571648;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8128931763838571648;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8128931763838571648;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-22 22:47:24] [INFO ] Flatten gal took : 61 ms
[2026-05-22 22:47:24] [INFO ] Flatten gal took : 56 ms
[2026-05-22 22:47:24] [INFO ] Time to serialize gal into /tmp/LTL16124127477878334363.gal : 23 ms
[2026-05-22 22:47:24] [INFO ] Time to serialize properties into /tmp/LTL13472668768327038026.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16124127477878334363.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11422613609894028740.hoa' '-atoms' '/tmp/LTL13472668768327038026.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL13472668768327038026.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11422613609894028740.hoa
Detected timeout of ITS tools.
[2026-05-22 22:47:39] [INFO ] Flatten gal took : 40 ms
[2026-05-22 22:47:39] [INFO ] Flatten gal took : 84 ms
[2026-05-22 22:47:39] [INFO ] Time to serialize gal into /tmp/LTL14791342804700625893.gal : 11 ms
[2026-05-22 22:47:39] [INFO ] Time to serialize properties into /tmp/LTL4129804430510902712.ltl : 13 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14791342804700625893.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4129804430510902712.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("((p2067!=1)||(p143!=1))"))))
Formula 0 simplified : FG!"((p2067!=1)||(p143!=1))"
Detected timeout of ITS tools.
[2026-05-22 22:47:55] [INFO ] Flatten gal took : 35 ms
[2026-05-22 22:47:55] [INFO ] Applying decomposition
[2026-05-22 22:47:55] [INFO ] Flatten gal took : 37 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph12560395828142899866.txt' '-o' '/tmp/graph12560395828142899866.bin' '-w' '/tmp/graph12560395828142899866.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12560395828142899866.bin' '-l' '-1' '-v' '-w' '/tmp/graph12560395828142899866.weights' '-q' '0' '-e' '0.001'
[2026-05-22 22:47:55] [INFO ] Decomposing Gal with order
[2026-05-22 22:47:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 22:47:55] [INFO ] Removed a total of 3909 redundant transitions.
[2026-05-22 22:47:55] [INFO ] Flatten gal took : 327 ms
[2026-05-22 22:47:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 113 labels/synchronizations in 56 ms.
[2026-05-22 22:47:55] [INFO ] Time to serialize gal into /tmp/LTL15664588103751000747.gal : 18 ms
[2026-05-22 22:47:55] [INFO ] Time to serialize properties into /tmp/LTL2712050550689576812.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15664588103751000747.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2712050550689576812.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F("((i11.u100.p2067!=1)||(i1.u17.p143!=1))"))))
Formula 0 simplified : FG!"((i11.u100.p2067!=1)||(i1.u17.p143!=1))"
Detected timeout of ITS tools.
Treatment of property ASLink-PT-10b-LTLFireability-01 finished in 308051 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(X(X(p1)))))'
Support contains 3 out of 3954 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3954/3954 places, 4876/4876 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 3950 transition count 4864
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 3950 transition count 4864
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 3948 transition count 4862
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 3948 transition count 4862
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 3946 transition count 4853
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 3946 transition count 4853
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 3944 transition count 4851
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 3944 transition count 4851
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 3942 transition count 4842
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 3942 transition count 4842
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 3941 transition count 4834
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 3941 transition count 4834
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 3940 transition count 4833
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 3940 transition count 4833
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 3939 transition count 4825
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 3939 transition count 4825
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 3938 transition count 4817
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 3938 transition count 4817
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 3937 transition count 4816
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 3937 transition count 4816
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 3936 transition count 4808
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 3936 transition count 4808
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 3935 transition count 4800
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 3935 transition count 4800
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 3934 transition count 4799
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 3934 transition count 4799
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 3933 transition count 4791
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 3933 transition count 4791
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 3932 transition count 4783
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 3932 transition count 4783
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 3931 transition count 4782
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 3931 transition count 4782
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 3930 transition count 4774
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 3930 transition count 4774
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 3929 transition count 4766
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 3929 transition count 4766
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 3928 transition count 4765
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 3928 transition count 4765
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 3927 transition count 4757
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 3927 transition count 4757
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 3926 transition count 4749
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 3926 transition count 4749
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 3925 transition count 4748
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 3925 transition count 4748
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 3924 transition count 4740
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 3924 transition count 4740
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 3923 transition count 4732
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 3923 transition count 4732
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 3922 transition count 4731
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 3922 transition count 4731
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 3921 transition count 4723
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 3921 transition count 4723
Applied a total of 66 rules in 12938 ms. Remains 3921 /3954 variables (removed 33) and now considering 4723/4876 (removed 153) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14072649239068910635.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10178521241455635354.kers'
[2026-05-22 22:48:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14072649239068910635.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10178521241455635354.kers]
Culled 0 columns in 10 ms.
// Phase 1: matrix 4723 rows 3921 cols 14557 entries
Finished phase 1 with 2551 SingleSign rule and 948 generalized
[2026-05-22 22:48:24] [INFO ] Computed 422 invariants in 90 ms
Computed 422 P flows in 91 ms.
Exported basis to /tmp/petrispot-output-10178521241455635354.kers
Total runtime 104 ms.
[2026-05-22 22:48:27] [INFO ] Implicit Places using invariants in 3175 ms returned []
[2026-05-22 22:48:27] [INFO ] Invariant cache hit.
[2026-05-22 22:48:43] [INFO ] Implicit Places using invariants and state equation in 16590 ms returned []
Implicit Place search using SMT with State Equation took 19807 ms to find 0 implicit places.
Running 4722 sub problems to find dead transitions.
[2026-05-22 22:48:43] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/3920 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 4722 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3920/8644 variables, and 255 constraints, problems are : Problem set: 0 solved, 4722 unsolved in 30106 ms.
Refiners :[Positive P Invariants (semi-flows): 0/86 constraints, Generalized P Invariants (flows): 255/336 constraints, State Equation: 0/3921 constraints, PredecessorRefiner: 4722/4722 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4722 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3920 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 4722 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3920/8644 variables, and 255 constraints, problems are : Problem set: 0 solved, 4722 unsolved in 30093 ms.
Refiners :[Positive P Invariants (semi-flows): 0/86 constraints, Generalized P Invariants (flows): 255/336 constraints, State Equation: 0/3921 constraints, PredecessorRefiner: 0/4722 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62455ms problems are : Problem set: 0 solved, 4722 unsolved
Search for dead transitions found 0 dead transitions in 62463ms
Starting structural reductions in LTL mode, iteration 1 : 3921/3954 places, 4723/4876 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 95225 ms. Remains : 3921/3954 places, 4723/4876 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(X(X(p1)))))'
Stuttering acceptance computed with spot in 385 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : ASLink-PT-10b-LTLFireability-02
Product exploration explored 100000 steps with 25000 reset in 621 ms.
Product exploration explored 100000 steps with 25000 reset in 683 ms.
Computed a total of 161 stabilizing places and 161 stable transitions
Computed a total of 161 stabilizing places and 161 stable transitions
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 9 states, 15 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (50 resets) in 578 ms. (69 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 113227 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :0 out of 1
Probabilistic random walk after 113227 steps, saw 26976 distinct states, run finished after 3011 ms. (steps per millisecond=37 ) properties seen :0
[2026-05-22 22:49:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 192/193 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/193 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1412/1605 variables, 86/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1605 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1605 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2167/3772 variables, 278/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3772/8644 variables, and 380 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5093 ms.
Refiners :[Positive P Invariants (semi-flows): 86/86 constraints, Generalized P Invariants (flows): 289/336 constraints, State Equation: 0/3921 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 192/193 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/193 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1412/1605 variables, 86/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1605 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1605 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2167/3772 variables, 278/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3772 variables, 4/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3772 variables, 2/382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3772 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 149/3921 variables, 47/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3921 variables, 1/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3921 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 8644/8644 variables, and 4351 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5037 ms.
Refiners :[Positive P Invariants (semi-flows): 86/86 constraints, Generalized P Invariants (flows): 336/336 constraints, State Equation: 3921/3921 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10158ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 3921 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3921/3921 places, 4723/4723 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 733 transitions
Trivial Post-agglo rules discarded 733 transitions
Performed 733 trivial Post agglomeration. Transition count delta: 733
Iterating post reduction 0 with 733 rules applied. Total rules applied 733 place count 3921 transition count 3990
Reduce places removed 733 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 736 rules applied. Total rules applied 1469 place count 3188 transition count 3987
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 1472 place count 3186 transition count 3986
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1473 place count 3185 transition count 3986
Performed 1063 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1063 Pre rules applied. Total rules applied 1473 place count 3185 transition count 2923
Deduced a syphon composed of 1063 places in 8 ms
Ensure Unique test removed 104 places
Reduce places removed 1167 places and 0 transitions.
Iterating global reduction 4 with 2230 rules applied. Total rules applied 3703 place count 2018 transition count 2923
Discarding 10 places :
Implicit places reduction removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 4 with 74 rules applied. Total rules applied 3777 place count 2008 transition count 2859
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 5 with 64 rules applied. Total rules applied 3841 place count 1944 transition count 2859
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 41 Pre rules applied. Total rules applied 3841 place count 1944 transition count 2818
Deduced a syphon composed of 41 places in 8 ms
Ensure Unique test removed 41 places
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 6 with 123 rules applied. Total rules applied 3964 place count 1862 transition count 2818
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 40 Pre rules applied. Total rules applied 3964 place count 1862 transition count 2778
Deduced a syphon composed of 40 places in 8 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 6 with 80 rules applied. Total rules applied 4044 place count 1822 transition count 2778
Performed 312 Post agglomeration using F-continuation condition.Transition count delta: 312
Deduced a syphon composed of 312 places in 5 ms
Ensure Unique test removed 2 places
Reduce places removed 314 places and 0 transitions.
Iterating global reduction 6 with 626 rules applied. Total rules applied 4670 place count 1508 transition count 2466
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 4674 place count 1504 transition count 2462
Ensure Unique test removed 1 places
Iterating global reduction 6 with 5 rules applied. Total rules applied 4679 place count 1503 transition count 2462
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 6 with 1 rules applied. Total rules applied 4680 place count 1503 transition count 2461
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 4681 place count 1502 transition count 2461
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 4681 place count 1502 transition count 2460
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 4683 place count 1501 transition count 2460
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 4685 place count 1499 transition count 2458
Iterating global reduction 8 with 2 rules applied. Total rules applied 4687 place count 1499 transition count 2458
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 8 with 2 rules applied. Total rules applied 4689 place count 1499 transition count 2456
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 4690 place count 1498 transition count 2456
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 4692 place count 1497 transition count 2461
Free-agglomeration rule applied 11 times.
Iterating global reduction 10 with 11 rules applied. Total rules applied 4703 place count 1497 transition count 2450
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 10 with 11 rules applied. Total rules applied 4714 place count 1486 transition count 2450
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 11 with 9 rules applied. Total rules applied 4723 place count 1486 transition count 2441
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 11 with 9 rules applied. Total rules applied 4732 place count 1477 transition count 2441
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 12 with 10 rules applied. Total rules applied 4742 place count 1477 transition count 2441
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 4743 place count 1476 transition count 2440
Reduce places removed 20 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 12 with 30 rules applied. Total rules applied 4773 place count 1456 transition count 2430
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 13 with 10 rules applied. Total rules applied 4783 place count 1446 transition count 2430
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 30 Pre rules applied. Total rules applied 4783 place count 1446 transition count 2400
Deduced a syphon composed of 30 places in 7 ms
Ensure Unique test removed 1 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 14 with 61 rules applied. Total rules applied 4844 place count 1415 transition count 2400
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 14 with 11 rules applied. Total rules applied 4855 place count 1404 transition count 2400
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 1 Pre rules applied. Total rules applied 4855 place count 1404 transition count 2399
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 4857 place count 1403 transition count 2399
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 5 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 15 with 42 rules applied. Total rules applied 4899 place count 1382 transition count 2378
Discarding 10 places :
Symmetric choice reduction at 15 with 10 rule applications. Total rules 4909 place count 1372 transition count 2368
Iterating global reduction 15 with 10 rules applied. Total rules applied 4919 place count 1372 transition count 2368
Free-agglomeration rule applied 10 times.
Iterating global reduction 15 with 10 rules applied. Total rules applied 4929 place count 1372 transition count 2358
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 15 with 10 rules applied. Total rules applied 4939 place count 1362 transition count 2358
Applied a total of 4939 rules in 1366 ms. Remains 1362 /3921 variables (removed 2559) and now considering 2358/4723 (removed 2365) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1368 ms. Remains : 1362/3921 places, 2358/4723 transitions.
RANDOM walk for 40000 steps (387 resets) in 258 ms. (154 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (35 resets) in 88 ms. (449 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 163109 steps, run timeout after 3001 ms. (steps per millisecond=54 ) properties seen :0 out of 1
Probabilistic random walk after 163109 steps, saw 37389 distinct states, run finished after 3001 ms. (steps per millisecond=54 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17716221649012863436.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6374239215570472334.kers'
[2026-05-22 22:50:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17716221649012863436.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6374239215570472334.kers]
Culling duplicate invariants (modulo rational): removing 23 columns.
Culled 23 columns in 4 ms.
// Phase 1: matrix 2358 rows 1339 cols 9269 entries
Finished phase 1 with 327 SingleSign rule and 803 generalized
[2026-05-22 22:50:06] [INFO ] Computed 232 invariants in 71 ms
Computed 232 P flows in 72 ms.
Exported basis to /tmp/petrispot-output-6374239215570472334.kers
Total runtime 77 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/20 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/21 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/21 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 88/109 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 46/155 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/155 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 74/229 variables, 12/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/229 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 48/277 variables, 11/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/277 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/279 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/279 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 63/342 variables, 11/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/342 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 29/371 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/371 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 27/398 variables, 4/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/398 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 67/465 variables, 11/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/465 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 29/494 variables, 6/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/494 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 27/521 variables, 4/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/521 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 67/588 variables, 11/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/588 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 29/617 variables, 6/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/617 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 27/644 variables, 4/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/644 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 67/711 variables, 11/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/711 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 29/740 variables, 6/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/740 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 27/767 variables, 4/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/767 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 67/834 variables, 11/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/834 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 29/863 variables, 6/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/863 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 27/890 variables, 4/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/890 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 67/957 variables, 11/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/957 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (OVERLAPS) 29/986 variables, 6/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/986 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (OVERLAPS) 27/1013 variables, 4/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1013 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 67/1080 variables, 11/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1080 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (OVERLAPS) 26/1106 variables, 5/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1106 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (OVERLAPS) 26/1132 variables, 3/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1132 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (OVERLAPS) 63/1195 variables, 9/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1195 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (OVERLAPS) 26/1221 variables, 5/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1221 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (OVERLAPS) 26/1247 variables, 3/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1247 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (OVERLAPS) 42/1289 variables, 10/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1289 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (OVERLAPS) 12/1301 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1301 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (OVERLAPS) 7/1308 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1308 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (OVERLAPS) 46/1354 variables, 6/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1354 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (OVERLAPS) 2/1356 variables, 2/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1356 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (OVERLAPS) 1/1357 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1357 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (OVERLAPS) 5/1362 variables, 4/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1362 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (OVERLAPS) 2358/3720 variables, 1362/1594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/3720 variables, 0/1594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (OVERLAPS) 0/3720 variables, 0/1594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3720/3720 variables, and 1594 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3334 ms.
Refiners :[Positive P Invariants (semi-flows): 104/104 constraints, Generalized P Invariants (flows): 128/128 constraints, State Equation: 1362/1362 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/20 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/21 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/21 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 88/109 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 46/155 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/155 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 74/229 variables, 12/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/229 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 48/277 variables, 11/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/277 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/279 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/279 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 63/342 variables, 11/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/342 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 29/371 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/371 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 27/398 variables, 4/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/398 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 67/465 variables, 11/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/465 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 29/494 variables, 6/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/494 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 27/521 variables, 4/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/521 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 67/588 variables, 11/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/588 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 29/617 variables, 6/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/617 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 27/644 variables, 4/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/644 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 67/711 variables, 11/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/711 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 29/740 variables, 6/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/740 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 27/767 variables, 4/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/767 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 67/834 variables, 11/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/834 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 29/863 variables, 6/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/863 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 27/890 variables, 4/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/890 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 67/957 variables, 11/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/957 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (OVERLAPS) 29/986 variables, 6/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/986 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (OVERLAPS) 27/1013 variables, 4/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1013 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 67/1080 variables, 11/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1080 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (OVERLAPS) 26/1106 variables, 5/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1106 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (OVERLAPS) 26/1132 variables, 3/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1132 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (OVERLAPS) 63/1195 variables, 9/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1195 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (OVERLAPS) 26/1221 variables, 5/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1221 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (OVERLAPS) 26/1247 variables, 3/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1247 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (OVERLAPS) 42/1289 variables, 10/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1289 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (OVERLAPS) 12/1301 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1301 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (OVERLAPS) 7/1308 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1308 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (OVERLAPS) 46/1354 variables, 6/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1354 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (OVERLAPS) 2/1356 variables, 2/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1356 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (OVERLAPS) 1/1357 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1357 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (OVERLAPS) 5/1362 variables, 4/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1362 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (OVERLAPS) 2358/3720 variables, 1362/1594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/3720 variables, 1/1595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/3720 variables, 0/1595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (OVERLAPS) 0/3720 variables, 0/1595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3720/3720 variables, and 1595 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3071 ms.
Refiners :[Positive P Invariants (semi-flows): 104/104 constraints, Generalized P Invariants (flows): 128/128 constraints, State Equation: 1362/1362 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6537ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 207 ms.
Support contains 1 out of 1362 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1362/1362 places, 2358/2358 transitions.
Applied a total of 0 rules in 69 ms. Remains 1362 /1362 variables (removed 0) and now considering 2358/2358 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 1362/1362 places, 2358/2358 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1362/1362 places, 2358/2358 transitions.
Applied a total of 0 rules in 80 ms. Remains 1362 /1362 variables (removed 0) and now considering 2358/2358 (removed 0) transitions.
[2026-05-22 22:50:12] [INFO ] Invariant cache hit.
[2026-05-22 22:50:14] [INFO ] Implicit Places using invariants in 1256 ms returned [1, 18, 19, 31, 48, 66, 137, 141, 150, 151, 153, 170, 188, 257, 261, 262, 273, 274, 276, 293, 311, 380, 384, 385, 396, 397, 399, 416, 434, 503, 507, 508, 519, 520, 522, 539, 557, 626, 630, 631, 642, 643, 645, 662, 680, 749, 753, 754, 765, 766, 768, 785, 803, 872, 876, 877, 888, 889, 891, 908, 926, 995, 999, 1000, 1011, 1012, 1014, 1031, 1049, 1118, 1122, 1123, 1134, 1135, 1137, 1154, 1172, 1241, 1245, 1246, 1249, 1260, 1261, 1262, 1280, 1301, 1302, 1303, 1304]
[2026-05-22 22:50:14] [INFO ] Actually due to overlaps returned [1280, 1262, 48, 170, 293, 416, 539, 662, 785, 908, 1031, 1154, 31, 153, 276, 399, 522, 645, 768, 891, 1014, 1137, 150, 273, 396, 519, 642, 765, 888, 1011, 1134, 1260, 1301, 151, 274, 397, 520, 643, 766, 889, 1012, 1135, 1261, 1302, 1, 18, 261, 262, 384, 385, 507, 508, 630, 631, 753, 754, 876, 877, 999, 1000, 1122, 1123, 1245, 1246, 66, 188, 311, 434, 557, 680, 803, 926, 1049, 1172, 1303, 19, 1249, 1304]
Discarding 78 places :
Implicit Place search using SMT only with invariants took 1263 ms to find 78 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1284/1362 places, 2358/2358 transitions.
Discarding 10 places :
Implicit places reduction removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 172 transitions
Trivial Post-agglo rules discarded 172 transitions
Performed 172 trivial Post agglomeration. Transition count delta: 172
Iterating post reduction 0 with 182 rules applied. Total rules applied 182 place count 1274 transition count 2186
Reduce places removed 172 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 183 rules applied. Total rules applied 365 place count 1102 transition count 2175
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 366 place count 1101 transition count 2175
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 366 place count 1101 transition count 2128
Deduced a syphon composed of 47 places in 9 ms
Ensure Unique test removed 1 places
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 95 rules applied. Total rules applied 461 place count 1053 transition count 2128
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 3 with 12 rules applied. Total rules applied 473 place count 1049 transition count 2120
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 481 place count 1041 transition count 2120
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 484 place count 1038 transition count 2117
Iterating global reduction 5 with 3 rules applied. Total rules applied 487 place count 1038 transition count 2117
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 490 place count 1038 transition count 2114
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 6 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 6 with 132 rules applied. Total rules applied 622 place count 972 transition count 2048
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 632 place count 962 transition count 2038
Iterating global reduction 6 with 10 rules applied. Total rules applied 642 place count 962 transition count 2038
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 652 place count 962 transition count 2028
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 656 place count 960 transition count 2029
Free-agglomeration rule (complex) applied 21 times.
Iterating global reduction 7 with 21 rules applied. Total rules applied 677 place count 960 transition count 2008
Ensure Unique test removed 1 places
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 7 with 22 rules applied. Total rules applied 699 place count 938 transition count 2008
Partial Free-agglomeration rule applied 30 times.
Drop transitions (Partial Free agglomeration) removed 30 transitions
Iterating global reduction 8 with 30 rules applied. Total rules applied 729 place count 938 transition count 2008
Applied a total of 729 rules in 391 ms. Remains 938 /1284 variables (removed 346) and now considering 2008/2358 (removed 350) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1163946210331470852.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13611160128833282379.kers'
[2026-05-22 22:50:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1163946210331470852.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13611160128833282379.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 3 ms.
// Phase 1: matrix 2008 rows 937 cols 8229 entries
Finished phase 1 with 247 SingleSign rule and 553 generalized
[2026-05-22 22:50:14] [INFO ] Computed 138 invariants in 57 ms
Computed 138 P flows in 58 ms.
Exported basis to /tmp/petrispot-output-13611160128833282379.kers
Total runtime 61 ms.
[2026-05-22 22:50:15] [INFO ] Implicit Places using invariants in 1021 ms returned [73, 90, 96, 99, 101, 102, 105, 106, 159, 175, 181, 184, 186, 191, 192, 245, 261, 267, 270, 272, 277, 278, 331, 347, 353, 356, 358, 363, 364, 417, 433, 439, 442, 444, 449, 450, 503, 519, 525, 528, 530, 535, 536, 589, 605, 611, 614, 616, 621, 622, 675, 691, 697, 700, 702, 707, 708, 761, 777, 783, 786, 788, 793, 794, 847, 863, 869, 872, 874]
[2026-05-22 22:50:15] [INFO ] Actually due to overlaps returned [105, 191, 277, 363, 449, 535, 621, 707, 793, 106, 192, 278, 364, 450, 536, 622, 708, 794, 90, 96, 101, 175, 181, 186, 261, 267, 272, 347, 353, 358, 433, 439, 444, 519, 525, 530, 605, 611, 616, 691, 697, 702, 777, 783, 788, 863, 869, 874, 73, 102, 159, 245, 331, 417, 503, 589, 675, 761, 847]
Discarding 59 places :
Implicit Place search using SMT only with invariants took 1027 ms to find 59 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 879/1362 places, 2008/2358 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 839 transition count 1968
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 839 transition count 1968
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 90 place count 829 transition count 1958
Iterating global reduction 0 with 10 rules applied. Total rules applied 100 place count 829 transition count 1958
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 3 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 140 place count 809 transition count 1938
Free-agglomeration rule applied 30 times.
Iterating global reduction 0 with 30 rules applied. Total rules applied 170 place count 809 transition count 1908
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 200 place count 779 transition count 1908
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 1 with 10 rules applied. Total rules applied 210 place count 779 transition count 1898
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 220 place count 769 transition count 1898
Applied a total of 220 rules in 226 ms. Remains 769 /879 variables (removed 110) and now considering 1898/2008 (removed 110) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12743403789630885348.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18278629680471046915.kers'
[2026-05-22 22:50:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12743403789630885348.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18278629680471046915.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 1898 rows 769 cols 7756 entries
Finished phase 1 with 179 SingleSign rule and 511 generalized
[2026-05-22 22:50:15] [INFO ] Computed 79 invariants in 56 ms
Computed 79 P flows in 56 ms.
Exported basis to /tmp/petrispot-output-18278629680471046915.kers
Total runtime 57 ms.
[2026-05-22 22:50:16] [INFO ] Implicit Places using invariants in 661 ms returned []
[2026-05-22 22:50:16] [INFO ] Invariant cache hit.
[2026-05-22 22:50:18] [INFO ] Implicit Places using invariants and state equation in 2106 ms returned []
Implicit Place search using SMT with State Equation took 2772 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 769/1362 places, 1898/2358 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 5759 ms. Remains : 769/1362 places, 1898/2358 transitions.
RANDOM walk for 40000 steps (647 resets) in 213 ms. (186 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (86 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 268085 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :0 out of 1
Probabilistic random walk after 268085 steps, saw 62872 distinct states, run finished after 3001 ms. (steps per millisecond=89 ) properties seen :0
[2026-05-22 22:50:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 66/67 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 42/109 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 64/173 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/175 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/175 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 81/256 variables, 9/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/256 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 38/294 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/294 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 24/318 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/318 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 24/342 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/342 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 24/366 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/366 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 60/426 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/426 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/428 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/428 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 243/671 variables, 25/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/671 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 33/704 variables, 6/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/704 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 65/769 variables, 14/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/769 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/769 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 1898/2667 variables, 769/849 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2667 variables, 0/849 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 0/2667 variables, 0/849 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2667/2667 variables, and 849 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1918 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 52/52 constraints, State Equation: 769/769 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 66/67 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 42/109 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 64/173 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/175 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/175 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 81/256 variables, 9/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/256 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 38/294 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/294 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 24/318 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/318 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 24/342 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/342 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 24/366 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/366 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 60/426 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/426 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/428 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/428 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 243/671 variables, 25/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/671 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 33/704 variables, 6/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/704 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 65/769 variables, 14/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/769 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/769 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 1898/2667 variables, 769/849 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2667 variables, 1/850 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/2667 variables, 0/850 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 0/2667 variables, 0/850 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2667/2667 variables, and 850 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1241 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 52/52 constraints, State Equation: 769/769 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3175ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 108 ms.
Support contains 1 out of 769 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 769/769 places, 1898/1898 transitions.
Applied a total of 0 rules in 36 ms. Remains 769 /769 variables (removed 0) and now considering 1898/1898 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 769/769 places, 1898/1898 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 769/769 places, 1898/1898 transitions.
Applied a total of 0 rules in 35 ms. Remains 769 /769 variables (removed 0) and now considering 1898/1898 (removed 0) transitions.
[2026-05-22 22:50:25] [INFO ] Invariant cache hit.
[2026-05-22 22:50:25] [INFO ] Implicit Places using invariants in 610 ms returned []
[2026-05-22 22:50:25] [INFO ] Invariant cache hit.
[2026-05-22 22:50:27] [INFO ] Implicit Places using invariants and state equation in 1837 ms returned []
Implicit Place search using SMT with State Equation took 2471 ms to find 0 implicit places.
[2026-05-22 22:50:27] [INFO ] Redundant transitions in 39 ms returned []
Running 1849 sub problems to find dead transitions.
[2026-05-22 22:50:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/768 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 1849 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/768 variables, 52/77 constraints. Problems are: Problem set: 0 solved, 1849 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 768/2667 variables, and 77 constraints, problems are : Problem set: 0 solved, 1849 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 25/27 constraints, Generalized P Invariants (flows): 52/52 constraints, State Equation: 0/769 constraints, PredecessorRefiner: 1849/1849 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1849 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/768 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 1849 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/768 variables, 52/77 constraints. Problems are: Problem set: 0 solved, 1849 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 768/2667 variables, and 77 constraints, problems are : Problem set: 0 solved, 1849 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 25/27 constraints, Generalized P Invariants (flows): 52/52 constraints, State Equation: 0/769 constraints, PredecessorRefiner: 0/1849 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60681ms problems are : Problem set: 0 solved, 1849 unsolved
Search for dead transitions found 0 dead transitions in 60684ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63241 ms. Remains : 769/769 places, 1898/1898 transitions.
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 280 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Knowledge-based reduction took 100698 ms.
Stuttering acceptance computed with spot in 261 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 1 out of 3921 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 3921/3921 places, 4723/4723 transitions.
Applied a total of 0 rules in 473 ms. Remains 3921 /3921 variables (removed 0) and now considering 4723/4723 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13251598625994920028.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13183140406564087751.kers'
[2026-05-22 22:51:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13251598625994920028.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13183140406564087751.kers]
Culled 0 columns in 9 ms.
// Phase 1: matrix 4723 rows 3921 cols 14557 entries
Finished phase 1 with 2551 SingleSign rule and 948 generalized
[2026-05-22 22:51:29] [INFO ] Computed 422 invariants in 92 ms
Computed 422 P flows in 93 ms.
Exported basis to /tmp/petrispot-output-13183140406564087751.kers
Total runtime 102 ms.
[2026-05-22 22:51:32] [INFO ] Implicit Places using invariants in 2916 ms returned []
[2026-05-22 22:51:32] [INFO ] Invariant cache hit.
[2026-05-22 22:51:51] [INFO ] Implicit Places using invariants and state equation in 18848 ms returned []
Implicit Place search using SMT with State Equation took 21781 ms to find 0 implicit places.
Running 4722 sub problems to find dead transitions.
[2026-05-22 22:51:51] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/3920 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 4722 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3920/8644 variables, and 255 constraints, problems are : Problem set: 0 solved, 4722 unsolved in 30098 ms.
Refiners :[Positive P Invariants (semi-flows): 0/86 constraints, Generalized P Invariants (flows): 255/336 constraints, State Equation: 0/3921 constraints, PredecessorRefiner: 4722/4722 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4722 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3920 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 4722 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3920/8644 variables, and 255 constraints, problems are : Problem set: 0 solved, 4722 unsolved in 30079 ms.
Refiners :[Positive P Invariants (semi-flows): 0/86 constraints, Generalized P Invariants (flows): 255/336 constraints, State Equation: 0/3921 constraints, PredecessorRefiner: 0/4722 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62828ms problems are : Problem set: 0 solved, 4722 unsolved
Search for dead transitions found 0 dead transitions in 62837ms
Finished structural reductions in LTL mode , in 1 iterations and 85118 ms. Remains : 3921/3921 places, 4723/4723 transitions.
Computed a total of 161 stabilizing places and 161 stable transitions
Computed a total of 161 stabilizing places and 161 stable transitions
Knowledge based reduction with 1 factoid took 81 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (48 resets) in 471 ms. (84 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 114082 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :0 out of 1
Probabilistic random walk after 114082 steps, saw 27091 distinct states, run finished after 3001 ms. (steps per millisecond=38 ) properties seen :0
[2026-05-22 22:52:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 192/193 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/193 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1412/1605 variables, 86/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1605 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1605 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2167/3772 variables, 278/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3772/8644 variables, and 380 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5020 ms.
Refiners :[Positive P Invariants (semi-flows): 86/86 constraints, Generalized P Invariants (flows): 289/336 constraints, State Equation: 0/3921 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 192/193 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/193 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1412/1605 variables, 86/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1605 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1605 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2167/3772 variables, 278/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3772 variables, 4/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3772 variables, 2/382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3772 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 149/3921 variables, 47/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3921 variables, 1/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3921 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SMT process timed out in 10038ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 3921 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3921/3921 places, 4723/4723 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 733 transitions
Trivial Post-agglo rules discarded 733 transitions
Performed 733 trivial Post agglomeration. Transition count delta: 733
Iterating post reduction 0 with 733 rules applied. Total rules applied 733 place count 3921 transition count 3990
Reduce places removed 733 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 736 rules applied. Total rules applied 1469 place count 3188 transition count 3987
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 1472 place count 3186 transition count 3986
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1473 place count 3185 transition count 3986
Performed 1063 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1063 Pre rules applied. Total rules applied 1473 place count 3185 transition count 2923
Deduced a syphon composed of 1063 places in 9 ms
Ensure Unique test removed 104 places
Reduce places removed 1167 places and 0 transitions.
Iterating global reduction 4 with 2230 rules applied. Total rules applied 3703 place count 2018 transition count 2923
Discarding 10 places :
Implicit places reduction removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 4 with 74 rules applied. Total rules applied 3777 place count 2008 transition count 2859
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 5 with 64 rules applied. Total rules applied 3841 place count 1944 transition count 2859
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 41 Pre rules applied. Total rules applied 3841 place count 1944 transition count 2818
Deduced a syphon composed of 41 places in 10 ms
Ensure Unique test removed 41 places
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 6 with 123 rules applied. Total rules applied 3964 place count 1862 transition count 2818
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 40 Pre rules applied. Total rules applied 3964 place count 1862 transition count 2778
Deduced a syphon composed of 40 places in 9 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 6 with 80 rules applied. Total rules applied 4044 place count 1822 transition count 2778
Performed 312 Post agglomeration using F-continuation condition.Transition count delta: 312
Deduced a syphon composed of 312 places in 6 ms
Ensure Unique test removed 2 places
Reduce places removed 314 places and 0 transitions.
Iterating global reduction 6 with 626 rules applied. Total rules applied 4670 place count 1508 transition count 2466
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 4674 place count 1504 transition count 2462
Ensure Unique test removed 1 places
Iterating global reduction 6 with 5 rules applied. Total rules applied 4679 place count 1503 transition count 2462
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 6 with 1 rules applied. Total rules applied 4680 place count 1503 transition count 2461
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 4681 place count 1502 transition count 2461
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 4681 place count 1502 transition count 2460
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 4683 place count 1501 transition count 2460
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 4685 place count 1499 transition count 2458
Iterating global reduction 8 with 2 rules applied. Total rules applied 4687 place count 1499 transition count 2458
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 8 with 2 rules applied. Total rules applied 4689 place count 1499 transition count 2456
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 4690 place count 1498 transition count 2456
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 4692 place count 1497 transition count 2461
Free-agglomeration rule applied 11 times.
Iterating global reduction 10 with 11 rules applied. Total rules applied 4703 place count 1497 transition count 2450
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 10 with 11 rules applied. Total rules applied 4714 place count 1486 transition count 2450
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 11 with 9 rules applied. Total rules applied 4723 place count 1486 transition count 2441
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 11 with 9 rules applied. Total rules applied 4732 place count 1477 transition count 2441
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 12 with 10 rules applied. Total rules applied 4742 place count 1477 transition count 2441
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 4743 place count 1476 transition count 2440
Reduce places removed 20 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 12 with 30 rules applied. Total rules applied 4773 place count 1456 transition count 2430
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 13 with 10 rules applied. Total rules applied 4783 place count 1446 transition count 2430
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 30 Pre rules applied. Total rules applied 4783 place count 1446 transition count 2400
Deduced a syphon composed of 30 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 14 with 61 rules applied. Total rules applied 4844 place count 1415 transition count 2400
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 14 with 11 rules applied. Total rules applied 4855 place count 1404 transition count 2400
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 1 Pre rules applied. Total rules applied 4855 place count 1404 transition count 2399
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 4857 place count 1403 transition count 2399
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 5 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 15 with 42 rules applied. Total rules applied 4899 place count 1382 transition count 2378
Discarding 10 places :
Symmetric choice reduction at 15 with 10 rule applications. Total rules 4909 place count 1372 transition count 2368
Iterating global reduction 15 with 10 rules applied. Total rules applied 4919 place count 1372 transition count 2368
Free-agglomeration rule applied 10 times.
Iterating global reduction 15 with 10 rules applied. Total rules applied 4929 place count 1372 transition count 2358
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 15 with 10 rules applied. Total rules applied 4939 place count 1362 transition count 2358
Applied a total of 4939 rules in 1244 ms. Remains 1362 /3921 variables (removed 2559) and now considering 2358/4723 (removed 2365) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1244 ms. Remains : 1362/3921 places, 2358/4723 transitions.
RANDOM walk for 40000 steps (387 resets) in 333 ms. (119 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (36 resets) in 130 ms. (305 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 160695 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :0 out of 1
Probabilistic random walk after 160695 steps, saw 36814 distinct states, run finished after 3001 ms. (steps per millisecond=53 ) 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-2287054723259530529.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9853443494862066777.kers'
[2026-05-22 22:53:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2287054723259530529.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9853443494862066777.kers]
Culling duplicate invariants (modulo rational): removing 23 columns.
Culled 23 columns in 4 ms.
// Phase 1: matrix 2358 rows 1339 cols 9269 entries
Finished phase 1 with 327 SingleSign rule and 803 generalized
[2026-05-22 22:53:11] [INFO ] Computed 232 invariants in 67 ms
Computed 232 P flows in 67 ms.
Exported basis to /tmp/petrispot-output-9853443494862066777.kers
Total runtime 72 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/20 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/21 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/21 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 88/109 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 46/155 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/155 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 74/229 variables, 12/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/229 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 48/277 variables, 11/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/277 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/279 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/279 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 63/342 variables, 11/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/342 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 29/371 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/371 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 27/398 variables, 4/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/398 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 67/465 variables, 11/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/465 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 29/494 variables, 6/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/494 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 27/521 variables, 4/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/521 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 67/588 variables, 11/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/588 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 29/617 variables, 6/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/617 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 27/644 variables, 4/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/644 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 67/711 variables, 11/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/711 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 29/740 variables, 6/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/740 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 27/767 variables, 4/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/767 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 67/834 variables, 11/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/834 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 29/863 variables, 6/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/863 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 27/890 variables, 4/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/890 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 67/957 variables, 11/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/957 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (OVERLAPS) 29/986 variables, 6/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/986 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (OVERLAPS) 27/1013 variables, 4/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1013 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 67/1080 variables, 11/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1080 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (OVERLAPS) 26/1106 variables, 5/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1106 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (OVERLAPS) 26/1132 variables, 3/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1132 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (OVERLAPS) 63/1195 variables, 9/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1195 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (OVERLAPS) 26/1221 variables, 5/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1221 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (OVERLAPS) 26/1247 variables, 3/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1247 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (OVERLAPS) 42/1289 variables, 10/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1289 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (OVERLAPS) 12/1301 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1301 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (OVERLAPS) 7/1308 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1308 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (OVERLAPS) 46/1354 variables, 6/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1354 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (OVERLAPS) 2/1356 variables, 2/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1356 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (OVERLAPS) 1/1357 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1357 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (OVERLAPS) 5/1362 variables, 4/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1362 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (OVERLAPS) 2358/3720 variables, 1362/1594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/3720 variables, 0/1594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (OVERLAPS) 0/3720 variables, 0/1594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3720/3720 variables, and 1594 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4748 ms.
Refiners :[Positive P Invariants (semi-flows): 104/104 constraints, Generalized P Invariants (flows): 128/128 constraints, State Equation: 1362/1362 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/20 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/21 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/21 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 88/109 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 46/155 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/155 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 74/229 variables, 12/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/229 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 48/277 variables, 11/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/277 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/279 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/279 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 63/342 variables, 11/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/342 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 29/371 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/371 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 27/398 variables, 4/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/398 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 67/465 variables, 11/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/465 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 29/494 variables, 6/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/494 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 27/521 variables, 4/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/521 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 67/588 variables, 11/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/588 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 29/617 variables, 6/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/617 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 27/644 variables, 4/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/644 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 67/711 variables, 11/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/711 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 29/740 variables, 6/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/740 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 27/767 variables, 4/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/767 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 67/834 variables, 11/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/834 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 29/863 variables, 6/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/863 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 27/890 variables, 4/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/890 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 67/957 variables, 11/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/957 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (OVERLAPS) 29/986 variables, 6/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/986 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (OVERLAPS) 27/1013 variables, 4/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1013 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 67/1080 variables, 11/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1080 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (OVERLAPS) 26/1106 variables, 5/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1106 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (OVERLAPS) 26/1132 variables, 3/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1132 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (OVERLAPS) 63/1195 variables, 9/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1195 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (OVERLAPS) 26/1221 variables, 5/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1221 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (OVERLAPS) 26/1247 variables, 3/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1247 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (OVERLAPS) 42/1289 variables, 10/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1289 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (OVERLAPS) 12/1301 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1301 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (OVERLAPS) 7/1308 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1308 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (OVERLAPS) 46/1354 variables, 6/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1354 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (OVERLAPS) 2/1356 variables, 2/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1356 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (OVERLAPS) 1/1357 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1357 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (OVERLAPS) 5/1362 variables, 4/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1362 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (OVERLAPS) 2358/3720 variables, 1362/1594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/3720 variables, 1/1595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/3720 variables, 0/1595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (OVERLAPS) 0/3720 variables, 0/1595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3720/3720 variables, and 1595 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3712 ms.
Refiners :[Positive P Invariants (semi-flows): 104/104 constraints, Generalized P Invariants (flows): 128/128 constraints, State Equation: 1362/1362 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8565ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 188 ms.
Support contains 1 out of 1362 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1362/1362 places, 2358/2358 transitions.
Applied a total of 0 rules in 64 ms. Remains 1362 /1362 variables (removed 0) and now considering 2358/2358 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 1362/1362 places, 2358/2358 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1362/1362 places, 2358/2358 transitions.
Applied a total of 0 rules in 66 ms. Remains 1362 /1362 variables (removed 0) and now considering 2358/2358 (removed 0) transitions.
[2026-05-22 22:53:20] [INFO ] Invariant cache hit.
[2026-05-22 22:53:22] [INFO ] Implicit Places using invariants in 1615 ms returned [1, 18, 19, 31, 48, 66, 137, 141, 150, 151, 153, 170, 188, 257, 261, 262, 273, 274, 276, 293, 311, 380, 384, 385, 396, 397, 399, 416, 434, 503, 507, 508, 519, 520, 522, 539, 557, 626, 630, 631, 642, 643, 645, 662, 680, 749, 753, 754, 765, 766, 768, 785, 803, 872, 876, 877, 888, 889, 891, 908, 926, 995, 999, 1000, 1011, 1012, 1014, 1031, 1049, 1118, 1122, 1123, 1134, 1135, 1137, 1154, 1172, 1241, 1245, 1246, 1249, 1260, 1261, 1262, 1280, 1301, 1302, 1303, 1304]
[2026-05-22 22:53:22] [INFO ] Actually due to overlaps returned [1280, 1262, 48, 170, 293, 416, 539, 662, 785, 908, 1031, 1154, 31, 153, 276, 399, 522, 645, 768, 891, 1014, 1137, 150, 273, 396, 519, 642, 765, 888, 1011, 1134, 1260, 1301, 151, 274, 397, 520, 643, 766, 889, 1012, 1135, 1261, 1302, 1, 18, 261, 262, 384, 385, 507, 508, 630, 631, 753, 754, 876, 877, 999, 1000, 1122, 1123, 1245, 1246, 66, 188, 311, 434, 557, 680, 803, 926, 1049, 1172, 1303, 19, 1249, 1304]
Discarding 78 places :
Implicit Place search using SMT only with invariants took 1624 ms to find 78 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1284/1362 places, 2358/2358 transitions.
Discarding 10 places :
Implicit places reduction removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 172 transitions
Trivial Post-agglo rules discarded 172 transitions
Performed 172 trivial Post agglomeration. Transition count delta: 172
Iterating post reduction 0 with 182 rules applied. Total rules applied 182 place count 1274 transition count 2186
Reduce places removed 172 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 183 rules applied. Total rules applied 365 place count 1102 transition count 2175
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 366 place count 1101 transition count 2175
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 366 place count 1101 transition count 2128
Deduced a syphon composed of 47 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 95 rules applied. Total rules applied 461 place count 1053 transition count 2128
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 3 with 12 rules applied. Total rules applied 473 place count 1049 transition count 2120
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 481 place count 1041 transition count 2120
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 484 place count 1038 transition count 2117
Iterating global reduction 5 with 3 rules applied. Total rules applied 487 place count 1038 transition count 2117
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 490 place count 1038 transition count 2114
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 13 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 6 with 132 rules applied. Total rules applied 622 place count 972 transition count 2048
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 632 place count 962 transition count 2038
Iterating global reduction 6 with 10 rules applied. Total rules applied 642 place count 962 transition count 2038
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 652 place count 962 transition count 2028
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 656 place count 960 transition count 2029
Free-agglomeration rule (complex) applied 21 times.
Iterating global reduction 7 with 21 rules applied. Total rules applied 677 place count 960 transition count 2008
Ensure Unique test removed 1 places
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 7 with 22 rules applied. Total rules applied 699 place count 938 transition count 2008
Partial Free-agglomeration rule applied 30 times.
Drop transitions (Partial Free agglomeration) removed 30 transitions
Iterating global reduction 8 with 30 rules applied. Total rules applied 729 place count 938 transition count 2008
Applied a total of 729 rules in 378 ms. Remains 938 /1284 variables (removed 346) and now considering 2008/2358 (removed 350) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-784412491798501045.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16488674321198026494.kers'
[2026-05-22 22:53:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-784412491798501045.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16488674321198026494.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 2008 rows 937 cols 8229 entries
Finished phase 1 with 247 SingleSign rule and 553 generalized
[2026-05-22 22:53:22] [INFO ] Computed 138 invariants in 26 ms
Computed 138 P flows in 27 ms.
Exported basis to /tmp/petrispot-output-16488674321198026494.kers
Total runtime 32 ms.
[2026-05-22 22:53:23] [INFO ] Implicit Places using invariants in 1156 ms returned [73, 90, 96, 99, 101, 102, 105, 106, 159, 175, 181, 184, 186, 191, 192, 245, 261, 267, 270, 272, 277, 278, 331, 347, 353, 356, 358, 363, 364, 417, 433, 439, 442, 444, 449, 450, 503, 519, 525, 528, 530, 535, 536, 589, 605, 611, 614, 616, 621, 622, 675, 691, 697, 700, 702, 707, 708, 761, 777, 783, 786, 788, 793, 794, 847, 863, 869, 872, 874]
[2026-05-22 22:53:23] [INFO ] Actually due to overlaps returned [105, 191, 277, 363, 449, 535, 621, 707, 793, 106, 192, 278, 364, 450, 536, 622, 708, 794, 90, 96, 101, 175, 181, 186, 261, 267, 272, 347, 353, 358, 433, 439, 444, 519, 525, 530, 605, 611, 616, 691, 697, 702, 777, 783, 788, 863, 869, 874, 73, 102, 159, 245, 331, 417, 503, 589, 675, 761, 847]
Discarding 59 places :
Implicit Place search using SMT only with invariants took 1168 ms to find 59 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 879/1362 places, 2008/2358 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 839 transition count 1968
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 839 transition count 1968
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 90 place count 829 transition count 1958
Iterating global reduction 0 with 10 rules applied. Total rules applied 100 place count 829 transition count 1958
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 4 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 140 place count 809 transition count 1938
Free-agglomeration rule applied 30 times.
Iterating global reduction 0 with 30 rules applied. Total rules applied 170 place count 809 transition count 1908
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 200 place count 779 transition count 1908
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 1 with 10 rules applied. Total rules applied 210 place count 779 transition count 1898
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 220 place count 769 transition count 1898
Applied a total of 220 rules in 221 ms. Remains 769 /879 variables (removed 110) and now considering 1898/2008 (removed 110) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4093084916312319054.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9856260474962289348.kers'
[2026-05-22 22:53:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4093084916312319054.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9856260474962289348.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 1898 rows 769 cols 7756 entries
Finished phase 1 with 179 SingleSign rule and 511 generalized
[2026-05-22 22:53:24] [INFO ] Computed 79 invariants in 36 ms
Computed 79 P flows in 61 ms.
Exported basis to /tmp/petrispot-output-9856260474962289348.kers
Total runtime 65 ms.
[2026-05-22 22:53:25] [INFO ] Implicit Places using invariants in 883 ms returned []
[2026-05-22 22:53:25] [INFO ] Invariant cache hit.
[2026-05-22 22:53:27] [INFO ] Implicit Places using invariants and state equation in 2034 ms returned []
Implicit Place search using SMT with State Equation took 2933 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 769/1362 places, 1898/2358 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 6390 ms. Remains : 769/1362 places, 1898/2358 transitions.
RANDOM walk for 40000 steps (676 resets) in 220 ms. (180 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (87 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 266085 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :0 out of 1
Probabilistic random walk after 266085 steps, saw 62411 distinct states, run finished after 3001 ms. (steps per millisecond=88 ) properties seen :0
[2026-05-22 22:53:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 66/67 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 42/109 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 64/173 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/175 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/175 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 81/256 variables, 9/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/256 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 38/294 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/294 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 24/318 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/318 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 24/342 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/342 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 24/366 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/366 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 60/426 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/426 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/428 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/428 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 243/671 variables, 25/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/671 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 33/704 variables, 6/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/704 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 65/769 variables, 14/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/769 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/769 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 1898/2667 variables, 769/849 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2667 variables, 0/849 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 0/2667 variables, 0/849 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2667/2667 variables, and 849 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2073 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 52/52 constraints, State Equation: 769/769 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 66/67 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 42/109 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 64/173 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/175 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/175 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 81/256 variables, 9/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/256 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 38/294 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/294 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 24/318 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/318 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 24/342 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/342 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 24/366 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/366 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 60/426 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/426 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/428 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/428 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 243/671 variables, 25/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/671 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 33/704 variables, 6/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/704 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 65/769 variables, 14/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/769 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/769 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 1898/2667 variables, 769/849 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2667 variables, 1/850 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/2667 variables, 0/850 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 0/2667 variables, 0/850 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2667/2667 variables, and 850 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1667 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 52/52 constraints, State Equation: 769/769 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3747ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 119 ms.
Support contains 1 out of 769 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 769/769 places, 1898/1898 transitions.
Applied a total of 0 rules in 36 ms. Remains 769 /769 variables (removed 0) and now considering 1898/1898 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 769/769 places, 1898/1898 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 769/769 places, 1898/1898 transitions.
Applied a total of 0 rules in 35 ms. Remains 769 /769 variables (removed 0) and now considering 1898/1898 (removed 0) transitions.
[2026-05-22 22:53:34] [INFO ] Invariant cache hit.
[2026-05-22 22:53:34] [INFO ] Implicit Places using invariants in 694 ms returned []
[2026-05-22 22:53:34] [INFO ] Invariant cache hit.
[2026-05-22 22:53:36] [INFO ] Implicit Places using invariants and state equation in 2132 ms returned []
Implicit Place search using SMT with State Equation took 2834 ms to find 0 implicit places.
[2026-05-22 22:53:36] [INFO ] Redundant transitions in 35 ms returned []
Running 1849 sub problems to find dead transitions.
[2026-05-22 22:53:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/768 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 1849 unsolved
SMT process timed out in 30641ms, After SMT, problems are : Problem set: 0 solved, 1849 unsolved
Search for dead transitions found 0 dead transitions in 30644ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33566 ms. Remains : 769/769 places, 1898/1898 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 50 ms. Remains 769 /769 variables (removed 0) and now considering 1898/1898 (removed 0) transitions.
Running SMT prover for 1 properties.
[2026-05-22 22:54:07] [INFO ] Invariant cache hit.
[2026-05-22 22:54:07] [INFO ] [Real]Absence check using 27 positive place invariants in 16 ms returned sat
[2026-05-22 22:54:07] [INFO ] [Real]Absence check using 27 positive and 52 generalized place invariants in 41 ms returned sat
[2026-05-22 22:54:08] [INFO ] After 1029ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-22 22:54:08] [INFO ] [Nat]Absence check using 27 positive place invariants in 10 ms returned sat
[2026-05-22 22:54:08] [INFO ] [Nat]Absence check using 27 positive and 52 generalized place invariants in 20 ms returned sat
[2026-05-22 22:54:09] [INFO ] After 755ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-22 22:54:09] [INFO ] After 893ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-22 22:54:09] [INFO ] After 1183ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 2289 ms.
Knowledge based reduction with 1 factoid took 106 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 250 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Knowledge-based reduction took 76246 ms.
Stuttering acceptance computed with spot in 258 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 265 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 25000 reset in 706 ms.
Product exploration explored 100000 steps with 25000 reset in 607 ms.
Spot run failed in 74 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin1523777665791067242
[2026-05-22 22:54:12] [INFO ] Built C files in 71ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1523777665791067242
Running compilation step : cd /tmp/ltsmin1523777665791067242;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1523777665791067242;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1523777665791067242;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 1 out of 3921 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3921/3921 places, 4723/4723 transitions.
Applied a total of 0 rules in 483 ms. Remains 3921 /3921 variables (removed 0) and now considering 4723/4723 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4851377961874784756.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1759073196146166560.kers'
[2026-05-22 22:54:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4851377961874784756.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1759073196146166560.kers]
Culled 0 columns in 5 ms.
// Phase 1: matrix 4723 rows 3921 cols 14557 entries
Finished phase 1 with 2551 SingleSign rule and 948 generalized
[2026-05-22 22:54:15] [INFO ] Computed 422 invariants in 75 ms
Computed 422 P flows in 76 ms.
Exported basis to /tmp/petrispot-output-1759073196146166560.kers
Total runtime 80 ms.
[2026-05-22 22:54:18] [INFO ] Implicit Places using invariants in 2729 ms returned []
[2026-05-22 22:54:18] [INFO ] Invariant cache hit.
[2026-05-22 22:54:36] [INFO ] Implicit Places using invariants and state equation in 17611 ms returned []
Implicit Place search using SMT with State Equation took 20372 ms to find 0 implicit places.
Running 4722 sub problems to find dead transitions.
[2026-05-22 22:54:36] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/3920 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 4722 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3920/8644 variables, and 255 constraints, problems are : Problem set: 0 solved, 4722 unsolved in 30103 ms.
Refiners :[Positive P Invariants (semi-flows): 0/86 constraints, Generalized P Invariants (flows): 255/336 constraints, State Equation: 0/3921 constraints, PredecessorRefiner: 4722/4722 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4722 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3920 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 4722 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3920/8644 variables, and 255 constraints, problems are : Problem set: 0 solved, 4722 unsolved in 30097 ms.
Refiners :[Positive P Invariants (semi-flows): 0/86 constraints, Generalized P Invariants (flows): 255/336 constraints, State Equation: 0/3921 constraints, PredecessorRefiner: 0/4722 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62560ms problems are : Problem set: 0 solved, 4722 unsolved
Search for dead transitions found 0 dead transitions in 62570ms
Finished structural reductions in LTL mode , in 1 iterations and 83451 ms. Remains : 3921/3921 places, 4723/4723 transitions.
Built C files in :
/tmp/ltsmin15943619819620139574
[2026-05-22 22:55:38] [INFO ] Built C files in 71ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15943619819620139574
Running compilation step : cd /tmp/ltsmin15943619819620139574;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15943619819620139574;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15943619819620139574;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-22 22:55:42] [INFO ] Flatten gal took : 98 ms
[2026-05-22 22:55:42] [INFO ] Flatten gal took : 115 ms
[2026-05-22 22:55:42] [INFO ] Time to serialize gal into /tmp/LTL11784713976595952252.gal : 23 ms
[2026-05-22 22:55:42] [INFO ] Time to serialize properties into /tmp/LTL489798589895695489.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11784713976595952252.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4001366880444422600.hoa' '-atoms' '/tmp/LTL489798589895695489.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL489798589895695489.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4001366880444422600.hoa
Detected timeout of ITS tools.
[2026-05-22 22:55:57] [INFO ] Flatten gal took : 78 ms
[2026-05-22 22:55:57] [INFO ] Flatten gal took : 82 ms
[2026-05-22 22:55:57] [INFO ] Time to serialize gal into /tmp/LTL7881501057722698657.gal : 19 ms
[2026-05-22 22:55:57] [INFO ] Time to serialize properties into /tmp/LTL14631238083167082157.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7881501057722698657.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14631238083167082157.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((G("((p1350==1)&&(p1601==1))"))U(X(X(X("(p257!=1)"))))))
Formula 0 simplified : F!"((p1350==1)&&(p1601==1))" R XXX!"(p257!=1)"
Detected timeout of ITS tools.
[2026-05-22 22:56:12] [INFO ] Flatten gal took : 112 ms
[2026-05-22 22:56:12] [INFO ] Applying decomposition
[2026-05-22 22:56:12] [INFO ] Flatten gal took : 109 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph16156086232498088945.txt' '-o' '/tmp/graph16156086232498088945.bin' '-w' '/tmp/graph16156086232498088945.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16156086232498088945.bin' '-l' '-1' '-v' '-w' '/tmp/graph16156086232498088945.weights' '-q' '0' '-e' '0.001'
[2026-05-22 22:56:13] [INFO ] Decomposing Gal with order
[2026-05-22 22:56:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 22:56:14] [INFO ] Removed a total of 3443 redundant transitions.
[2026-05-22 22:56:14] [INFO ] Flatten gal took : 190 ms
[2026-05-22 22:56:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 70 ms.
[2026-05-22 22:56:14] [INFO ] Time to serialize gal into /tmp/LTL7868775006929590356.gal : 48 ms
[2026-05-22 22:56:14] [INFO ] Time to serialize properties into /tmp/LTL10078658420585466348.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7868775006929590356.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10078658420585466348.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((G("((i7.u469.p1350==1)&&(i7.u561.p1601==1))"))U(X(X(X("(i4.u85.p257!=1)"))))))
Formula 0 simplified : F!"((i7.u469.p1350==1)&&(i7.u561.p1601==1))" R XXX!"(i4.u85.p257!=1)"
Detected timeout of ITS tools.
Treatment of property ASLink-PT-10b-LTLFireability-02 finished in 498605 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||F(p1)||(X(G(p2))&&F(p3))))'
Support contains 3 out of 3954 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3954/3954 places, 4876/4876 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 3950 transition count 4864
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 3950 transition count 4864
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 3948 transition count 4862
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 3948 transition count 4862
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 3946 transition count 4853
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 3946 transition count 4853
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 3944 transition count 4851
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 3944 transition count 4851
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 3942 transition count 4842
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 3942 transition count 4842
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 3941 transition count 4834
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 3941 transition count 4834
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 3940 transition count 4833
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 3940 transition count 4833
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 3939 transition count 4825
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 3939 transition count 4825
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 3938 transition count 4817
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 3938 transition count 4817
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 3937 transition count 4816
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 3937 transition count 4816
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 3936 transition count 4808
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 3936 transition count 4808
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 3935 transition count 4800
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 3935 transition count 4800
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 3934 transition count 4799
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 3934 transition count 4799
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 3933 transition count 4791
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 3933 transition count 4791
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 3932 transition count 4783
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 3932 transition count 4783
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 3931 transition count 4782
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 3931 transition count 4782
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 3930 transition count 4774
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 3930 transition count 4774
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 3929 transition count 4766
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 3929 transition count 4766
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 3928 transition count 4765
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 3928 transition count 4765
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 3927 transition count 4757
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 3927 transition count 4757
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 3926 transition count 4749
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 3926 transition count 4749
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 3925 transition count 4748
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 3925 transition count 4748
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 3924 transition count 4740
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 3924 transition count 4740
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 3923 transition count 4732
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 3923 transition count 4732
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 3922 transition count 4731
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 3922 transition count 4731
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 3921 transition count 4723
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 3921 transition count 4723
Applied a total of 66 rules in 12513 ms. Remains 3921 /3954 variables (removed 33) and now considering 4723/4876 (removed 153) transitions.
[2026-05-22 22:56:42] [INFO ] Invariant cache hit.
[2026-05-22 22:56:44] [INFO ] Implicit Places using invariants in 2780 ms returned []
[2026-05-22 22:56:44] [INFO ] Invariant cache hit.
[2026-05-22 22:57:01] [INFO ] Implicit Places using invariants and state equation in 16224 ms returned []
Implicit Place search using SMT with State Equation took 19012 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 3921/3954 places, 4723/4876 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31527 ms. Remains : 3921/3954 places, 4723/4876 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||F(p1)||(X(G(p2))&&F(p3))))'
Stuttering acceptance computed with spot in 329 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : ASLink-PT-10b-LTLFireability-03
Product exploration explored 100000 steps with 50000 reset in 1038 ms.
Product exploration explored 100000 steps with 50000 reset in 1046 ms.
Computed a total of 161 stabilizing places and 161 stable transitions
Computed a total of 161 stabilizing places and 161 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 16 factoid took 27 ms. Proved property starting from automaton with 6 states, 13 edges and 4 AP (stutter sensitive
Knowledge-based reduction took 60 ms.
FORMULA ASLink-PT-10b-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-10b-LTLFireability-03 finished in 34106 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(p1))))'
Support contains 2 out of 3954 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3954/3954 places, 4876/4876 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 3951 transition count 4865
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 3951 transition count 4865
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 3949 transition count 4863
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 3949 transition count 4863
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 3947 transition count 4854
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 3947 transition count 4854
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 3945 transition count 4852
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 3945 transition count 4852
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 3943 transition count 4843
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 3943 transition count 4843
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 3942 transition count 4835
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 3942 transition count 4835
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 3941 transition count 4834
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 3941 transition count 4834
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 3940 transition count 4826
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 3940 transition count 4826
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 3939 transition count 4818
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 3939 transition count 4818
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 3938 transition count 4817
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 3938 transition count 4817
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 3937 transition count 4809
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 3937 transition count 4809
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 3936 transition count 4801
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 3936 transition count 4801
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 3935 transition count 4800
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 3935 transition count 4800
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 3934 transition count 4792
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 3934 transition count 4792
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 3933 transition count 4784
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 3933 transition count 4784
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 3932 transition count 4783
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 3932 transition count 4783
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 3931 transition count 4775
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 3931 transition count 4775
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 3930 transition count 4767
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 3930 transition count 4767
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 3929 transition count 4766
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 3929 transition count 4766
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 3928 transition count 4758
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 3928 transition count 4758
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 3927 transition count 4750
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 3927 transition count 4750
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 3926 transition count 4749
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 3926 transition count 4749
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 3925 transition count 4741
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 3925 transition count 4741
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 3924 transition count 4733
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 3924 transition count 4733
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 3923 transition count 4732
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 3923 transition count 4732
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 3922 transition count 4724
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 3922 transition count 4724
Applied a total of 64 rules in 12460 ms. Remains 3922 /3954 variables (removed 32) and now considering 4724/4876 (removed 152) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10349955896927126493.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11835743637079934297.kers'
[2026-05-22 22:57:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10349955896927126493.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11835743637079934297.kers]
Culled 0 columns in 10 ms.
// Phase 1: matrix 4724 rows 3922 cols 14559 entries
Finished phase 1 with 2552 SingleSign rule and 948 generalized
[2026-05-22 22:57:16] [INFO ] Computed 422 invariants in 91 ms
Computed 422 P flows in 92 ms.
Exported basis to /tmp/petrispot-output-11835743637079934297.kers
Total runtime 105 ms.
[2026-05-22 22:57:19] [INFO ] Implicit Places using invariants in 3162 ms returned []
[2026-05-22 22:57:19] [INFO ] Invariant cache hit.
[2026-05-22 22:57:33] [INFO ] Implicit Places using invariants and state equation in 14215 ms returned []
Implicit Place search using SMT with State Equation took 17401 ms to find 0 implicit places.
Running 4723 sub problems to find dead transitions.
[2026-05-22 22:57:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3921 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 4723 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3921/8646 variables, and 255 constraints, problems are : Problem set: 0 solved, 4723 unsolved in 30133 ms.
Refiners :[Positive P Invariants (semi-flows): 0/86 constraints, Generalized P Invariants (flows): 255/336 constraints, State Equation: 0/3922 constraints, PredecessorRefiner: 4723/4723 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4723 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3921 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 4723 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3921/8646 variables, and 255 constraints, problems are : Problem set: 0 solved, 4723 unsolved in 30086 ms.
Refiners :[Positive P Invariants (semi-flows): 0/86 constraints, Generalized P Invariants (flows): 255/336 constraints, State Equation: 0/3922 constraints, PredecessorRefiner: 0/4723 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62660ms problems are : Problem set: 0 solved, 4723 unsolved
Search for dead transitions found 0 dead transitions in 62676ms
Starting structural reductions in LTL mode, iteration 1 : 3922/3954 places, 4724/4876 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 92562 ms. Remains : 3922/3954 places, 4724/4876 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(p1))))'
Stuttering acceptance computed with spot in 166 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ASLink-PT-10b-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-10b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-10b-LTLFireability-04 finished in 92809 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))||G(p1)||(p1&&F((p2 U (G(p2)||(p2&&(X(!p3) U ((p0&&X(!p3))||X(G(!p3)))))))))))'
Support contains 5 out of 3954 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3954/3954 places, 4876/4876 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 3950 transition count 4864
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 3950 transition count 4864
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 3948 transition count 4862
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 3948 transition count 4862
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 3946 transition count 4853
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 3946 transition count 4853
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 3945 transition count 4852
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 3945 transition count 4852
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 3944 transition count 4851
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 3944 transition count 4851
Applied a total of 20 rules in 2808 ms. Remains 3944 /3954 variables (removed 10) and now considering 4851/4876 (removed 25) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15706290549455125476.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2054346637748928533.kers'
[2026-05-22 22:58:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15706290549455125476.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2054346637748928533.kers]
Culled 0 columns in 10 ms.
// Phase 1: matrix 4851 rows 3944 cols 15053 entries
Finished phase 1 with 2560 SingleSign rule and 962 generalized
[2026-05-22 22:58:39] [INFO ] Computed 422 invariants in 96 ms
Computed 422 P flows in 96 ms.
Exported basis to /tmp/petrispot-output-2054346637748928533.kers
Total runtime 102 ms.
[2026-05-22 22:58:42] [INFO ] Implicit Places using invariants in 3000 ms returned []
[2026-05-22 22:58:42] [INFO ] Invariant cache hit.
[2026-05-22 22:58:59] [INFO ] Implicit Places using invariants and state equation in 17496 ms returned []
Implicit Place search using SMT with State Equation took 20506 ms to find 0 implicit places.
Running 4850 sub problems to find dead transitions.
[2026-05-22 22:58:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3943 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 4850 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3943/8795 variables, and 255 constraints, problems are : Problem set: 0 solved, 4850 unsolved in 30114 ms.
Refiners :[Positive P Invariants (semi-flows): 0/86 constraints, Generalized P Invariants (flows): 255/336 constraints, State Equation: 0/3944 constraints, PredecessorRefiner: 4850/4850 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4850 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3943 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 4850 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3943/8795 variables, and 255 constraints, problems are : Problem set: 0 solved, 4850 unsolved in 30111 ms.
Refiners :[Positive P Invariants (semi-flows): 0/86 constraints, Generalized P Invariants (flows): 255/336 constraints, State Equation: 0/3944 constraints, PredecessorRefiner: 0/4850 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63110ms problems are : Problem set: 0 solved, 4850 unsolved
Search for dead transitions found 0 dead transitions in 63127ms
Starting structural reductions in LTL mode, iteration 1 : 3944/3954 places, 4851/4876 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 86464 ms. Remains : 3944/3954 places, 4851/4876 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))||G(p1)||(p1&&F((p2 U (G(p2)||(p2&&(X(!p3) U ((p0&&X(!p3))||X(G(!p3)))))))))))'
Stuttering acceptance computed with spot in 1189 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) p3 (NOT p0)), (AND (NOT p1) (NOT p2) p3 (NOT p0)), (NOT p0), true, (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0) p3), (AND (NOT p2) (NOT p0) p3), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0) p3), (AND (NOT p1) (NOT p2) (NOT p0) p3), (NOT p2), (AND (NOT p2) p3), (AND (NOT p2) p3), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) p3), (AND (NOT p1) (NOT p2) p3)]
Running random walk in product with property : ASLink-PT-10b-LTLFireability-05
Product exploration explored 100000 steps with 33465 reset in 895 ms.
Product exploration explored 100000 steps with 33313 reset in 836 ms.
Computed a total of 161 stabilizing places and 161 stable transitions
Computed a total of 161 stabilizing places and 161 stable transitions
Knowledge based reduction with 40 factoid took 307 ms. Reduced automaton from 19 states, 75 edges and 4 AP (stutter sensitive) to 9 states, 32 edges and 4 AP (stutter sensitive).
RANDOM walk for 40000 steps (43 resets) in 498 ms. (80 steps per ms) remains 12/29 properties
BEST_FIRST walk for 40003 steps (8 resets) in 60 ms. (655 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 67 ms. (588 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 60 ms. (655 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 60 ms. (655 steps per ms) remains 12/12 properties
[2026-05-22 23:00:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 123/128 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 1352/1480 variables, 83/86 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1480 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 2283/3763 variables, 280/366 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 6 (INCLUDED_ONLY) 0/3763 variables, 2/368 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3763/8795 variables, and 368 constraints, problems are : Problem set: 0 solved, 12 unsolved in 5021 ms.
Refiners :[Positive P Invariants (semi-flows): 86/86 constraints, Generalized P Invariants (flows): 280/336 constraints, State Equation: 0/3944 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 123/128 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 1352/1480 variables, 83/86 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1480 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 2283/3763 variables, 280/366 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3763 variables, 2/368 constraints. Problems are: Problem set: 0 solved, 12 unsolved
SMT process timed out in 10190ms, After SMT, problems are : Problem set: 0 solved, 12 unsolved
Fused 12 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 3944 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3944/3944 places, 4851/4851 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 734 transitions
Trivial Post-agglo rules discarded 734 transitions
Performed 734 trivial Post agglomeration. Transition count delta: 734
Iterating post reduction 0 with 734 rules applied. Total rules applied 734 place count 3944 transition count 4117
Reduce places removed 734 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 737 rules applied. Total rules applied 1471 place count 3210 transition count 4114
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1473 place count 3208 transition count 4114
Performed 1068 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1068 Pre rules applied. Total rules applied 1473 place count 3208 transition count 3046
Deduced a syphon composed of 1068 places in 10 ms
Ensure Unique test removed 104 places
Reduce places removed 1172 places and 0 transitions.
Iterating global reduction 3 with 2240 rules applied. Total rules applied 3713 place count 2036 transition count 3046
Discarding 10 places :
Implicit places reduction removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 3 with 74 rules applied. Total rules applied 3787 place count 2026 transition count 2982
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 4 with 64 rules applied. Total rules applied 3851 place count 1962 transition count 2982
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 41 Pre rules applied. Total rules applied 3851 place count 1962 transition count 2941
Deduced a syphon composed of 41 places in 9 ms
Ensure Unique test removed 41 places
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 5 with 123 rules applied. Total rules applied 3974 place count 1880 transition count 2941
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 40 Pre rules applied. Total rules applied 3974 place count 1880 transition count 2901
Deduced a syphon composed of 40 places in 10 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 5 with 80 rules applied. Total rules applied 4054 place count 1840 transition count 2901
Performed 312 Post agglomeration using F-continuation condition.Transition count delta: 312
Deduced a syphon composed of 312 places in 7 ms
Ensure Unique test removed 2 places
Reduce places removed 314 places and 0 transitions.
Iterating global reduction 5 with 626 rules applied. Total rules applied 4680 place count 1526 transition count 2589
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 4684 place count 1522 transition count 2585
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 4689 place count 1521 transition count 2585
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 4690 place count 1521 transition count 2584
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 4691 place count 1520 transition count 2584
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 4691 place count 1520 transition count 2583
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 4693 place count 1519 transition count 2583
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 4695 place count 1517 transition count 2581
Iterating global reduction 7 with 2 rules applied. Total rules applied 4697 place count 1517 transition count 2581
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 7 with 2 rules applied. Total rules applied 4699 place count 1517 transition count 2579
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 4700 place count 1516 transition count 2579
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 4702 place count 1515 transition count 2584
Free-agglomeration rule applied 11 times.
Iterating global reduction 9 with 11 rules applied. Total rules applied 4713 place count 1515 transition count 2573
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 9 with 11 rules applied. Total rules applied 4724 place count 1504 transition count 2573
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 10 with 9 rules applied. Total rules applied 4733 place count 1504 transition count 2564
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 10 with 9 rules applied. Total rules applied 4742 place count 1495 transition count 2564
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 11 with 10 rules applied. Total rules applied 4752 place count 1495 transition count 2564
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 4753 place count 1494 transition count 2563
Reduce places removed 20 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 11 with 30 rules applied. Total rules applied 4783 place count 1474 transition count 2553
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 12 with 10 rules applied. Total rules applied 4793 place count 1464 transition count 2553
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 30 Pre rules applied. Total rules applied 4793 place count 1464 transition count 2523
Deduced a syphon composed of 30 places in 7 ms
Ensure Unique test removed 1 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 13 with 61 rules applied. Total rules applied 4854 place count 1433 transition count 2523
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 13 with 11 rules applied. Total rules applied 4865 place count 1422 transition count 2523
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 1 Pre rules applied. Total rules applied 4865 place count 1422 transition count 2522
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 4867 place count 1421 transition count 2522
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 6 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 14 with 42 rules applied. Total rules applied 4909 place count 1400 transition count 2501
Discarding 10 places :
Symmetric choice reduction at 14 with 10 rule applications. Total rules 4919 place count 1390 transition count 2491
Iterating global reduction 14 with 10 rules applied. Total rules applied 4929 place count 1390 transition count 2491
Free-agglomeration rule applied 10 times.
Iterating global reduction 14 with 10 rules applied. Total rules applied 4939 place count 1390 transition count 2481
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 14 with 10 rules applied. Total rules applied 4949 place count 1380 transition count 2481
Applied a total of 4949 rules in 1353 ms. Remains 1380 /3944 variables (removed 2564) and now considering 2481/4851 (removed 2370) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1353 ms. Remains : 1380/3944 places, 2481/4851 transitions.
RANDOM walk for 40000 steps (370 resets) in 437 ms. (91 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (34 resets) in 136 ms. (291 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (36 resets) in 93 ms. (425 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (33 resets) in 87 ms. (454 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (33 resets) in 91 ms. (434 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (32 resets) in 88 ms. (449 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (32 resets) in 88 ms. (449 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (31 resets) in 91 ms. (434 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (35 resets) in 89 ms. (444 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (31 resets) in 87 ms. (454 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (35 resets) in 89 ms. (444 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (32 resets) in 89 ms. (444 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (33 resets) in 88 ms. (449 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 116848 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :0 out of 12
Probabilistic random walk after 116848 steps, saw 27524 distinct states, run finished after 3001 ms. (steps per millisecond=38 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16733508905192821414.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15171441714134609724.kers'
[2026-05-22 23:00:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16733508905192821414.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15171441714134609724.kers]
Culling duplicate invariants (modulo rational): removing 22 columns.
Culled 22 columns in 1 ms.
// Phase 1: matrix 2481 rows 1358 cols 9759 entries
Finished phase 1 with 354 SingleSign rule and 794 generalized
[2026-05-22 23:00:21] [INFO ] Computed 232 invariants in 24 ms
Computed 232 P flows in 24 ms.
Exported basis to /tmp/petrispot-output-15171441714134609724.kers
Total runtime 26 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 77/82 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 50/132 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 2/134 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 2/136 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/136 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 177/313 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/313 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 79/392 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/392 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (OVERLAPS) 4/396 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/396 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (OVERLAPS) 1/397 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/397 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 17 (OVERLAPS) 188/585 variables, 30/87 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/585 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 19 (OVERLAPS) 119/704 variables, 20/107 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/704 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 21 (OVERLAPS) 6/710 variables, 6/113 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/710 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 23 (OVERLAPS) 155/865 variables, 28/141 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/865 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 25 (OVERLAPS) 47/912 variables, 10/151 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/912 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 27 (OVERLAPS) 27/939 variables, 4/155 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/939 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 29 (OVERLAPS) 75/1014 variables, 11/166 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1014 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 31 (OVERLAPS) 38/1052 variables, 7/173 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1052 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 33 (OVERLAPS) 41/1093 variables, 5/178 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1093 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 35 (OVERLAPS) 151/1244 variables, 22/200 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1244 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 37 (OVERLAPS) 58/1302 variables, 12/212 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1302 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 39 (OVERLAPS) 27/1329 variables, 4/216 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1329 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 41 (OVERLAPS) 49/1378 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1378 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 43 (OVERLAPS) 2/1380 variables, 2/232 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1380 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 45 (OVERLAPS) 2481/3861 variables, 1380/1612 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/3861 variables, 0/1612 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 47 (OVERLAPS) 0/3861 variables, 0/1612 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3861/3861 variables, and 1612 constraints, problems are : Problem set: 0 solved, 12 unsolved in 16741 ms.
Refiners :[Positive P Invariants (semi-flows): 103/103 constraints, Generalized P Invariants (flows): 129/129 constraints, State Equation: 1380/1380 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 77/82 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 50/132 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 2/134 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 2/136 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/136 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 177/313 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/313 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 79/392 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/392 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (OVERLAPS) 4/396 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/396 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (OVERLAPS) 1/397 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/397 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 17 (OVERLAPS) 188/585 variables, 30/87 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/585 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/585 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 20 (OVERLAPS) 119/704 variables, 20/108 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/704 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 22 (OVERLAPS) 6/710 variables, 6/114 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/710 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 24 (OVERLAPS) 155/865 variables, 28/142 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/865 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 26 (OVERLAPS) 47/912 variables, 10/152 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/912 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 28 (OVERLAPS) 27/939 variables, 4/156 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/939 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 30 (OVERLAPS) 75/1014 variables, 11/167 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1014 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 32 (OVERLAPS) 38/1052 variables, 7/174 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1052 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 34 (OVERLAPS) 41/1093 variables, 5/179 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1093 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 36 (OVERLAPS) 151/1244 variables, 22/201 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1244 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 38 (OVERLAPS) 58/1302 variables, 12/213 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1302 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 40 (OVERLAPS) 27/1329 variables, 4/217 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1329 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 42 (OVERLAPS) 49/1378 variables, 14/231 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1378 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 44 (OVERLAPS) 2/1380 variables, 2/233 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1380 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 46 (OVERLAPS) 2481/3861 variables, 1380/1613 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/3861 variables, 12/1625 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/3861 variables, 0/1625 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 49 (OVERLAPS) 0/3861 variables, 0/1625 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3861/3861 variables, and 1625 constraints, problems are : Problem set: 0 solved, 12 unsolved in 25516 ms.
Refiners :[Positive P Invariants (semi-flows): 103/103 constraints, Generalized P Invariants (flows): 129/129 constraints, State Equation: 1380/1380 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42313ms problems are : Problem set: 0 solved, 12 unsolved
Fused 12 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 5198 ms.
Support contains 5 out of 1380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1380/1380 places, 2481/2481 transitions.
Applied a total of 0 rules in 63 ms. Remains 1380 /1380 variables (removed 0) and now considering 2481/2481 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 1380/1380 places, 2481/2481 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1380/1380 places, 2481/2481 transitions.
Applied a total of 0 rules in 64 ms. Remains 1380 /1380 variables (removed 0) and now considering 2481/2481 (removed 0) transitions.
[2026-05-22 23:01:09] [INFO ] Invariant cache hit.
[2026-05-22 23:01:10] [INFO ] Implicit Places using invariants in 1229 ms returned [1, 18, 19, 31, 48, 66, 135, 139, 148, 149, 151, 168, 186, 255, 259, 260, 271, 272, 274, 291, 309, 378, 382, 383, 394, 395, 397, 414, 432, 501, 505, 506, 517, 518, 520, 537, 555, 624, 628, 629, 640, 641, 643, 661, 679, 748, 752, 754, 765, 766, 768, 785, 803, 873, 877, 878, 889, 890, 892, 909, 927, 996, 1000, 1001, 1012, 1013, 1015, 1032, 1050, 1120, 1124, 1125, 1136, 1137, 1139, 1156, 1174, 1243, 1247, 1248, 1251, 1262, 1263, 1264, 1298, 1319, 1320, 1321, 1322]
[2026-05-22 23:01:10] [INFO ] Actually due to overlaps returned [1298, 1264, 48, 168, 291, 414, 537, 661, 785, 909, 1032, 1156, 31, 151, 274, 397, 520, 643, 768, 892, 1015, 1139, 148, 271, 394, 517, 640, 765, 889, 1012, 1136, 1262, 1319, 149, 272, 395, 518, 641, 766, 890, 1013, 1137, 1263, 1320, 1, 18, 259, 260, 382, 383, 505, 506, 628, 629, 752, 754, 877, 878, 1000, 1001, 1124, 1125, 1247, 1248, 66, 186, 309, 432, 555, 679, 803, 927, 1050, 1174, 1321, 19, 1251, 1322]
Discarding 78 places :
Implicit Place search using SMT only with invariants took 1236 ms to find 78 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1302/1380 places, 2481/2481 transitions.
Discarding 10 places :
Implicit places reduction removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 173 transitions
Trivial Post-agglo rules discarded 173 transitions
Performed 173 trivial Post agglomeration. Transition count delta: 173
Iterating post reduction 0 with 183 rules applied. Total rules applied 183 place count 1292 transition count 2308
Reduce places removed 173 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 183 rules applied. Total rules applied 366 place count 1119 transition count 2298
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 47 Pre rules applied. Total rules applied 366 place count 1119 transition count 2251
Deduced a syphon composed of 47 places in 8 ms
Ensure Unique test removed 1 places
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 95 rules applied. Total rules applied 461 place count 1071 transition count 2251
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 473 place count 1067 transition count 2243
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 481 place count 1059 transition count 2243
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 484 place count 1056 transition count 2240
Iterating global reduction 4 with 3 rules applied. Total rules applied 487 place count 1056 transition count 2240
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 490 place count 1056 transition count 2237
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 4 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 5 with 128 rules applied. Total rules applied 618 place count 992 transition count 2173
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 628 place count 982 transition count 2163
Iterating global reduction 5 with 10 rules applied. Total rules applied 638 place count 982 transition count 2163
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 648 place count 982 transition count 2153
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 652 place count 980 transition count 2154
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 6 with 20 rules applied. Total rules applied 672 place count 980 transition count 2134
Ensure Unique test removed 1 places
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 6 with 21 rules applied. Total rules applied 693 place count 959 transition count 2134
Partial Free-agglomeration rule applied 30 times.
Drop transitions (Partial Free agglomeration) removed 30 transitions
Iterating global reduction 7 with 30 rules applied. Total rules applied 723 place count 959 transition count 2134
Applied a total of 723 rules in 382 ms. Remains 959 /1302 variables (removed 343) and now considering 2134/2481 (removed 347) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1959543416279850281.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4707487935809847652.kers'
[2026-05-22 23:01:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1959543416279850281.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4707487935809847652.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 4 ms.
// Phase 1: matrix 2134 rows 958 cols 8711 entries
Finished phase 1 with 272 SingleSign rule and 549 generalized
[2026-05-22 23:01:11] [INFO ] Computed 138 invariants in 53 ms
Computed 138 P flows in 54 ms.
Exported basis to /tmp/petrispot-output-4707487935809847652.kers
Total runtime 56 ms.
[2026-05-22 23:01:12] [INFO ] Implicit Places using invariants in 1618 ms returned [73, 89, 95, 98, 100, 101, 104, 105, 158, 174, 180, 183, 185, 190, 191, 244, 260, 266, 269, 271, 276, 277, 330, 346, 352, 355, 357, 362, 363, 416, 432, 438, 441, 443, 448, 450, 505, 521, 527, 530, 532, 538, 539, 593, 609, 615, 618, 620, 625, 626, 679, 695, 701, 704, 706, 711, 712, 766, 782, 788, 791, 793, 798, 799, 852, 868, 874, 877, 879]
[2026-05-22 23:01:12] [INFO ] Actually due to overlaps returned [104, 190, 276, 362, 448, 538, 625, 711, 798, 105, 191, 277, 363, 450, 539, 626, 712, 799, 89, 95, 100, 174, 180, 185, 260, 266, 271, 346, 352, 357, 432, 438, 443, 521, 527, 532, 609, 615, 620, 695, 701, 706, 782, 788, 793, 868, 874, 879, 73, 101, 158, 244, 330, 416, 505, 593, 679, 766, 852]
Discarding 59 places :
Implicit Place search using SMT only with invariants took 1635 ms to find 59 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 900/1380 places, 2134/2481 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 859 transition count 2093
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 859 transition count 2093
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 92 place count 849 transition count 2083
Iterating global reduction 0 with 10 rules applied. Total rules applied 102 place count 849 transition count 2083
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 3 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 142 place count 829 transition count 2063
Free-agglomeration rule applied 30 times.
Iterating global reduction 0 with 30 rules applied. Total rules applied 172 place count 829 transition count 2033
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 202 place count 799 transition count 2033
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 1 with 10 rules applied. Total rules applied 212 place count 799 transition count 2023
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 222 place count 789 transition count 2023
Applied a total of 222 rules in 224 ms. Remains 789 /900 variables (removed 111) and now considering 2023/2134 (removed 111) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10196245556603701589.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8331671078051604315.kers'
[2026-05-22 23:01:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10196245556603701589.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8331671078051604315.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 2023 rows 789 cols 8246 entries
Finished phase 1 with 161 SingleSign rule and 549 generalized
[2026-05-22 23:01:12] [INFO ] Computed 79 invariants in 18 ms
Computed 79 P flows in 19 ms.
Exported basis to /tmp/petrispot-output-8331671078051604315.kers
Total runtime 33 ms.
[2026-05-22 23:01:13] [INFO ] Implicit Places using invariants in 652 ms returned []
[2026-05-22 23:01:13] [INFO ] Invariant cache hit.
[2026-05-22 23:01:16] [INFO ] Implicit Places using invariants and state equation in 2384 ms returned []
Implicit Place search using SMT with State Equation took 3038 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 789/1380 places, 2023/2481 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 6579 ms. Remains : 789/1380 places, 2023/2481 transitions.
RANDOM walk for 40000 steps (634 resets) in 399 ms. (100 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (81 resets) in 98 ms. (404 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (85 resets) in 95 ms. (416 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (66 resets) in 95 ms. (416 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (80 resets) in 69 ms. (571 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (69 resets) in 64 ms. (615 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (73 resets) in 67 ms. (588 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (72 resets) in 75 ms. (526 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (77 resets) in 70 ms. (563 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (67 resets) in 62 ms. (634 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (78 resets) in 72 ms. (548 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (72 resets) in 58 ms. (678 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (72 resets) in 63 ms. (625 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 174513 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :1 out of 12
Probabilistic random walk after 174513 steps, saw 41768 distinct states, run finished after 3001 ms. (steps per millisecond=58 ) properties seen :1
[2026-05-22 23:01:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 85/90 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 38/128 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 24/152 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 31/183 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 238/421 variables, 23/30 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/421 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 63/484 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/484 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (OVERLAPS) 24/508 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/508 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (OVERLAPS) 184/692 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/692 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (OVERLAPS) 21/713 variables, 5/66 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/713 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 19 (OVERLAPS) 66/779 variables, 10/76 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/779 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 21 (OVERLAPS) 5/784 variables, 2/78 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/784 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 23 (OVERLAPS) 5/789 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/789 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 25 (OVERLAPS) 2023/2812 variables, 789/868 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2812 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 11 unsolved
All remaining problems are real, not stopping.
At refinement iteration 27 (OVERLAPS) 0/2812 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2812/2812 variables, and 868 constraints, problems are : Problem set: 0 solved, 11 unsolved in 4805 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 54/54 constraints, State Equation: 789/789 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 85/90 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 38/128 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 24/152 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 31/183 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 238/421 variables, 23/30 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/421 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 63/484 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/484 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (OVERLAPS) 24/508 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/508 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (OVERLAPS) 184/692 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/692 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (OVERLAPS) 21/713 variables, 5/66 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/713 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 19 (OVERLAPS) 66/779 variables, 10/76 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/779 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 21 (OVERLAPS) 5/784 variables, 2/78 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/784 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 23 (OVERLAPS) 5/789 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/789 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 25 (OVERLAPS) 2023/2812 variables, 789/868 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2812 variables, 11/879 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2812 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 28 (OVERLAPS) 0/2812 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2812/2812 variables, and 879 constraints, problems are : Problem set: 0 solved, 11 unsolved in 13772 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 54/54 constraints, State Equation: 789/789 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18609ms problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 6 different solutions.
Parikh walk visited 5 properties in 9023 ms.
Support contains 5 out of 789 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 789/789 places, 2023/2023 transitions.
Applied a total of 0 rules in 39 ms. Remains 789 /789 variables (removed 0) and now considering 2023/2023 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 789/789 places, 2023/2023 transitions.
Knowledge based reduction with 40 factoid took 821 ms. Reduced automaton from 9 states, 32 edges and 4 AP (stutter sensitive) to 9 states, 32 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 657 ms :[(AND (NOT p1) (NOT p2) p3), (AND (NOT p1) (NOT p2) p3), (AND (NOT p1) (NOT p2) p3), (NOT p2), (AND (NOT p2) p3), (AND (NOT p2) p3), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) p3), (AND (NOT p1) (NOT p2) p3)]
Knowledge-based reduction took 102656 ms.
Stuttering acceptance computed with spot in 672 ms :[(AND (NOT p1) (NOT p2) p3), (AND (NOT p1) (NOT p2) p3), (AND (NOT p1) (NOT p2) p3), (NOT p2), (AND (NOT p2) p3), (AND (NOT p2) p3), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) p3), (AND (NOT p1) (NOT p2) p3)]
Support contains 5 out of 3944 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3944/3944 places, 4851/4851 transitions.
Applied a total of 0 rules in 520 ms. Remains 3944 /3944 variables (removed 0) and now considering 4851/4851 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5857721801461798962.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16215498545234559678.kers'
[2026-05-22 23:01:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5857721801461798962.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16215498545234559678.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 4851 rows 3944 cols 15053 entries
Finished phase 1 with 2560 SingleSign rule and 962 generalized
[2026-05-22 23:01:49] [INFO ] Computed 422 invariants in 42 ms
Computed 422 P flows in 43 ms.
Exported basis to /tmp/petrispot-output-16215498545234559678.kers
Total runtime 52 ms.
[2026-05-22 23:01:52] [INFO ] Implicit Places using invariants in 2912 ms returned []
[2026-05-22 23:01:52] [INFO ] Invariant cache hit.
[2026-05-22 23:02:12] [INFO ] Implicit Places using invariants and state equation in 19611 ms returned []
Implicit Place search using SMT with State Equation took 22532 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 23053 ms. Remains : 3944/3944 places, 4851/4851 transitions.
Computed a total of 161 stabilizing places and 161 stable transitions
Computed a total of 161 stabilizing places and 161 stable transitions
Knowledge based reduction with 1 factoid took 136 ms. Reduced automaton from 9 states, 32 edges and 4 AP (stutter sensitive) to 9 states, 32 edges and 4 AP (stutter sensitive).
RANDOM walk for 40000 steps (44 resets) in 552 ms. (72 steps per ms) remains 17/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 49 ms. (80 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 17/17 properties
[2026-05-22 23:02:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 123/128 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 1352/1480 variables, 83/86 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1480 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 2283/3763 variables, 280/366 constraints. Problems are: Problem set: 0 solved, 17 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/3763 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 181/3944 variables, 56/422 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3944/8795 variables, and 422 constraints, problems are : Problem set: 0 solved, 17 unsolved in 5016 ms.
Refiners :[Positive P Invariants (semi-flows): 86/86 constraints, Generalized P Invariants (flows): 336/336 constraints, State Equation: 0/3944 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 123/128 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 1352/1480 variables, 83/87 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1480 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1480 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 2283/3763 variables, 280/368 constraints. Problems are: Problem set: 0 solved, 17 unsolved
SMT process timed out in 10297ms, After SMT, problems are : Problem set: 0 solved, 17 unsolved
Fused 17 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 3944 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3944/3944 places, 4851/4851 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 734 transitions
Trivial Post-agglo rules discarded 734 transitions
Performed 734 trivial Post agglomeration. Transition count delta: 734
Iterating post reduction 0 with 734 rules applied. Total rules applied 734 place count 3944 transition count 4117
Reduce places removed 734 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 737 rules applied. Total rules applied 1471 place count 3210 transition count 4114
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1473 place count 3208 transition count 4114
Performed 1068 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1068 Pre rules applied. Total rules applied 1473 place count 3208 transition count 3046
Deduced a syphon composed of 1068 places in 11 ms
Ensure Unique test removed 104 places
Reduce places removed 1172 places and 0 transitions.
Iterating global reduction 3 with 2240 rules applied. Total rules applied 3713 place count 2036 transition count 3046
Discarding 10 places :
Implicit places reduction removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 3 with 74 rules applied. Total rules applied 3787 place count 2026 transition count 2982
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 4 with 64 rules applied. Total rules applied 3851 place count 1962 transition count 2982
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 41 Pre rules applied. Total rules applied 3851 place count 1962 transition count 2941
Deduced a syphon composed of 41 places in 10 ms
Ensure Unique test removed 41 places
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 5 with 123 rules applied. Total rules applied 3974 place count 1880 transition count 2941
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 40 Pre rules applied. Total rules applied 3974 place count 1880 transition count 2901
Deduced a syphon composed of 40 places in 10 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 5 with 80 rules applied. Total rules applied 4054 place count 1840 transition count 2901
Performed 312 Post agglomeration using F-continuation condition.Transition count delta: 312
Deduced a syphon composed of 312 places in 7 ms
Ensure Unique test removed 2 places
Reduce places removed 314 places and 0 transitions.
Iterating global reduction 5 with 626 rules applied. Total rules applied 4680 place count 1526 transition count 2589
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 4684 place count 1522 transition count 2585
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 4689 place count 1521 transition count 2585
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 4690 place count 1521 transition count 2584
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 4691 place count 1520 transition count 2584
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 4691 place count 1520 transition count 2583
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 4693 place count 1519 transition count 2583
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 4695 place count 1517 transition count 2581
Iterating global reduction 7 with 2 rules applied. Total rules applied 4697 place count 1517 transition count 2581
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 7 with 2 rules applied. Total rules applied 4699 place count 1517 transition count 2579
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 4700 place count 1516 transition count 2579
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 4702 place count 1515 transition count 2584
Free-agglomeration rule applied 11 times.
Iterating global reduction 9 with 11 rules applied. Total rules applied 4713 place count 1515 transition count 2573
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 9 with 11 rules applied. Total rules applied 4724 place count 1504 transition count 2573
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 10 with 9 rules applied. Total rules applied 4733 place count 1504 transition count 2564
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 10 with 9 rules applied. Total rules applied 4742 place count 1495 transition count 2564
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 11 with 10 rules applied. Total rules applied 4752 place count 1495 transition count 2564
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 4753 place count 1494 transition count 2563
Reduce places removed 20 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 11 with 30 rules applied. Total rules applied 4783 place count 1474 transition count 2553
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 12 with 10 rules applied. Total rules applied 4793 place count 1464 transition count 2553
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 30 Pre rules applied. Total rules applied 4793 place count 1464 transition count 2523
Deduced a syphon composed of 30 places in 22 ms
Ensure Unique test removed 1 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 13 with 61 rules applied. Total rules applied 4854 place count 1433 transition count 2523
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 13 with 11 rules applied. Total rules applied 4865 place count 1422 transition count 2523
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 1 Pre rules applied. Total rules applied 4865 place count 1422 transition count 2522
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 4867 place count 1421 transition count 2522
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 6 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 14 with 42 rules applied. Total rules applied 4909 place count 1400 transition count 2501
Discarding 10 places :
Symmetric choice reduction at 14 with 10 rule applications. Total rules 4919 place count 1390 transition count 2491
Iterating global reduction 14 with 10 rules applied. Total rules applied 4929 place count 1390 transition count 2491
Free-agglomeration rule applied 10 times.
Iterating global reduction 14 with 10 rules applied. Total rules applied 4939 place count 1390 transition count 2481
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 14 with 10 rules applied. Total rules applied 4949 place count 1380 transition count 2481
Applied a total of 4949 rules in 1343 ms. Remains 1380 /3944 variables (removed 2564) and now considering 2481/4851 (removed 2370) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1343 ms. Remains : 1380/3944 places, 2481/4851 transitions.
RANDOM walk for 40000 steps (378 resets) in 581 ms. (68 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
Interrupted probabilistic random walk after 106816 steps, run timeout after 3011 ms. (steps per millisecond=35 ) properties seen :0 out of 17
Probabilistic random walk after 106816 steps, saw 25132 distinct states, run finished after 3014 ms. (steps per millisecond=35 ) 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-17015427386908549596.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-492989905689824944.kers'
[2026-05-22 23:02:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17015427386908549596.kers, --Pflows, --basisKERS=/tmp/petrispot-output-492989905689824944.kers]
Culling duplicate invariants (modulo rational): removing 22 columns.
Culled 22 columns in 1 ms.
// Phase 1: matrix 2481 rows 1358 cols 9759 entries
Finished phase 1 with 354 SingleSign rule and 794 generalized
[2026-05-22 23:02:28] [INFO ] Computed 232 invariants in 25 ms
Computed 232 P flows in 25 ms.
Exported basis to /tmp/petrispot-output-492989905689824944.kers
Total runtime 27 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 77/82 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 50/132 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 2/134 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 2/136 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/136 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 177/313 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/313 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (OVERLAPS) 79/392 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/392 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (OVERLAPS) 4/396 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/396 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 15 (OVERLAPS) 1/397 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/397 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 17 (OVERLAPS) 188/585 variables, 30/87 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/585 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 19 (OVERLAPS) 119/704 variables, 20/107 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/704 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 21 (OVERLAPS) 6/710 variables, 6/113 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/710 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 23 (OVERLAPS) 155/865 variables, 28/141 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/865 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 25 (OVERLAPS) 47/912 variables, 10/151 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/912 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 27 (OVERLAPS) 27/939 variables, 4/155 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/939 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 29 (OVERLAPS) 75/1014 variables, 11/166 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1014 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 31 (OVERLAPS) 38/1052 variables, 7/173 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1052 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 33 (OVERLAPS) 41/1093 variables, 5/178 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1093 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 35 (OVERLAPS) 151/1244 variables, 22/200 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1244 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 37 (OVERLAPS) 58/1302 variables, 12/212 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1302 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 39 (OVERLAPS) 27/1329 variables, 4/216 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1329 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 41 (OVERLAPS) 49/1378 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1378 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 43 (OVERLAPS) 2/1380 variables, 2/232 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1380 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 45 (OVERLAPS) 2481/3861 variables, 1380/1612 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/3861 variables, 0/1612 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 47 (OVERLAPS) 0/3861 variables, 0/1612 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3861/3861 variables, and 1612 constraints, problems are : Problem set: 0 solved, 17 unsolved in 12131 ms.
Refiners :[Positive P Invariants (semi-flows): 103/103 constraints, Generalized P Invariants (flows): 129/129 constraints, State Equation: 1380/1380 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 77/82 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 50/132 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 2/134 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 2/136 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/136 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 177/313 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/313 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (OVERLAPS) 79/392 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/392 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (OVERLAPS) 4/396 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/396 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 15 (OVERLAPS) 1/397 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/397 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 17 (OVERLAPS) 188/585 variables, 30/87 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/585 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 19 (OVERLAPS) 119/704 variables, 20/107 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/704 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 21 (OVERLAPS) 6/710 variables, 6/113 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/710 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 23 (OVERLAPS) 155/865 variables, 28/141 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/865 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 25 (OVERLAPS) 47/912 variables, 10/151 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/912 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 27 (OVERLAPS) 27/939 variables, 4/155 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/939 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 29 (OVERLAPS) 75/1014 variables, 11/166 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1014 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 31 (OVERLAPS) 38/1052 variables, 7/173 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1052 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 33 (OVERLAPS) 41/1093 variables, 5/178 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1093 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 35 (OVERLAPS) 151/1244 variables, 22/200 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1244 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 37 (OVERLAPS) 58/1302 variables, 12/212 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1302 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 39 (OVERLAPS) 27/1329 variables, 4/216 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1329 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 41 (OVERLAPS) 49/1378 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1378 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 43 (OVERLAPS) 2/1380 variables, 2/232 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1380 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 45 (OVERLAPS) 2481/3861 variables, 1380/1612 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/3861 variables, 17/1629 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/3861 variables, 0/1629 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 48 (OVERLAPS) 0/3861 variables, 0/1629 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3861/3861 variables, and 1629 constraints, problems are : Problem set: 0 solved, 17 unsolved in 38849 ms.
Refiners :[Positive P Invariants (semi-flows): 103/103 constraints, Generalized P Invariants (flows): 129/129 constraints, State Equation: 1380/1380 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 51029ms problems are : Problem set: 0 solved, 17 unsolved
Fused 17 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 1199 ms.
Support contains 5 out of 1380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1380/1380 places, 2481/2481 transitions.
Applied a total of 0 rules in 62 ms. Remains 1380 /1380 variables (removed 0) and now considering 2481/2481 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 1380/1380 places, 2481/2481 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1380/1380 places, 2481/2481 transitions.
Applied a total of 0 rules in 61 ms. Remains 1380 /1380 variables (removed 0) and now considering 2481/2481 (removed 0) transitions.
[2026-05-22 23:03:20] [INFO ] Invariant cache hit.
[2026-05-22 23:03:21] [INFO ] Implicit Places using invariants in 1215 ms returned [1, 18, 19, 31, 48, 66, 135, 139, 148, 149, 151, 168, 186, 255, 259, 260, 271, 272, 274, 291, 309, 378, 382, 383, 394, 395, 397, 414, 432, 501, 505, 506, 517, 518, 520, 537, 555, 624, 628, 629, 640, 641, 643, 661, 679, 748, 752, 754, 765, 766, 768, 785, 803, 873, 877, 878, 889, 890, 892, 909, 927, 996, 1000, 1001, 1012, 1013, 1015, 1032, 1050, 1120, 1124, 1125, 1136, 1137, 1139, 1156, 1174, 1243, 1247, 1248, 1251, 1262, 1263, 1264, 1298, 1319, 1320, 1321, 1322]
[2026-05-22 23:03:21] [INFO ] Actually due to overlaps returned [1298, 1264, 48, 168, 291, 414, 537, 661, 785, 909, 1032, 1156, 31, 151, 274, 397, 520, 643, 768, 892, 1015, 1139, 148, 271, 394, 517, 640, 765, 889, 1012, 1136, 1262, 1319, 149, 272, 395, 518, 641, 766, 890, 1013, 1137, 1263, 1320, 1, 18, 259, 260, 382, 383, 505, 506, 628, 629, 752, 754, 877, 878, 1000, 1001, 1124, 1125, 1247, 1248, 66, 186, 309, 432, 555, 679, 803, 927, 1050, 1174, 1321, 19, 1251, 1322]
Discarding 78 places :
Implicit Place search using SMT only with invariants took 1222 ms to find 78 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1302/1380 places, 2481/2481 transitions.
Discarding 10 places :
Implicit places reduction removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 173 transitions
Trivial Post-agglo rules discarded 173 transitions
Performed 173 trivial Post agglomeration. Transition count delta: 173
Iterating post reduction 0 with 183 rules applied. Total rules applied 183 place count 1292 transition count 2308
Reduce places removed 173 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 183 rules applied. Total rules applied 366 place count 1119 transition count 2298
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 47 Pre rules applied. Total rules applied 366 place count 1119 transition count 2251
Deduced a syphon composed of 47 places in 6 ms
Ensure Unique test removed 1 places
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 95 rules applied. Total rules applied 461 place count 1071 transition count 2251
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 473 place count 1067 transition count 2243
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 481 place count 1059 transition count 2243
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 484 place count 1056 transition count 2240
Iterating global reduction 4 with 3 rules applied. Total rules applied 487 place count 1056 transition count 2240
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 490 place count 1056 transition count 2237
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 4 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 5 with 128 rules applied. Total rules applied 618 place count 992 transition count 2173
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 628 place count 982 transition count 2163
Iterating global reduction 5 with 10 rules applied. Total rules applied 638 place count 982 transition count 2163
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 648 place count 982 transition count 2153
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 652 place count 980 transition count 2154
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 6 with 20 rules applied. Total rules applied 672 place count 980 transition count 2134
Ensure Unique test removed 1 places
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 6 with 21 rules applied. Total rules applied 693 place count 959 transition count 2134
Partial Free-agglomeration rule applied 30 times.
Drop transitions (Partial Free agglomeration) removed 30 transitions
Iterating global reduction 7 with 30 rules applied. Total rules applied 723 place count 959 transition count 2134
Applied a total of 723 rules in 348 ms. Remains 959 /1302 variables (removed 343) and now considering 2134/2481 (removed 347) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12313967264805266303.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5719668446509912508.kers'
[2026-05-22 23:03:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12313967264805266303.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5719668446509912508.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 2134 rows 958 cols 8711 entries
Finished phase 1 with 272 SingleSign rule and 549 generalized
[2026-05-22 23:03:21] [INFO ] Computed 138 invariants in 18 ms
Computed 138 P flows in 18 ms.
Exported basis to /tmp/petrispot-output-5719668446509912508.kers
Total runtime 23 ms.
[2026-05-22 23:03:23] [INFO ] Implicit Places using invariants in 1115 ms returned [73, 89, 95, 98, 100, 101, 104, 105, 158, 174, 180, 183, 185, 190, 191, 244, 260, 266, 269, 271, 276, 277, 330, 346, 352, 355, 357, 362, 363, 416, 432, 438, 441, 443, 448, 450, 505, 521, 527, 530, 532, 538, 539, 593, 609, 615, 618, 620, 625, 626, 679, 695, 701, 704, 706, 711, 712, 766, 782, 788, 791, 793, 798, 799, 852, 868, 874, 877, 879]
[2026-05-22 23:03:23] [INFO ] Actually due to overlaps returned [104, 190, 276, 362, 448, 538, 625, 711, 798, 105, 191, 277, 363, 450, 539, 626, 712, 799, 89, 95, 100, 174, 180, 185, 260, 266, 271, 346, 352, 357, 432, 438, 443, 521, 527, 532, 609, 615, 620, 695, 701, 706, 782, 788, 793, 868, 874, 879, 73, 101, 158, 244, 330, 416, 505, 593, 679, 766, 852]
Discarding 59 places :
Implicit Place search using SMT only with invariants took 1123 ms to find 59 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 900/1380 places, 2134/2481 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 859 transition count 2093
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 859 transition count 2093
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 92 place count 849 transition count 2083
Iterating global reduction 0 with 10 rules applied. Total rules applied 102 place count 849 transition count 2083
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 4 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 142 place count 829 transition count 2063
Free-agglomeration rule applied 30 times.
Iterating global reduction 0 with 30 rules applied. Total rules applied 172 place count 829 transition count 2033
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 202 place count 799 transition count 2033
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 1 with 10 rules applied. Total rules applied 212 place count 799 transition count 2023
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 222 place count 789 transition count 2023
Applied a total of 222 rules in 234 ms. Remains 789 /900 variables (removed 111) and now considering 2023/2134 (removed 111) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15219380827650445643.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7329408689937509390.kers'
[2026-05-22 23:03:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15219380827650445643.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7329408689937509390.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 2023 rows 789 cols 8246 entries
Finished phase 1 with 161 SingleSign rule and 549 generalized
[2026-05-22 23:03:23] [INFO ] Computed 79 invariants in 54 ms
Computed 79 P flows in 55 ms.
Exported basis to /tmp/petrispot-output-7329408689937509390.kers
Total runtime 59 ms.
[2026-05-22 23:03:24] [INFO ] Implicit Places using invariants in 746 ms returned []
[2026-05-22 23:03:24] [INFO ] Invariant cache hit.
[2026-05-22 23:03:26] [INFO ] Implicit Places using invariants and state equation in 2210 ms returned []
Implicit Place search using SMT with State Equation took 2972 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 789/1380 places, 2023/2481 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 5960 ms. Remains : 789/1380 places, 2023/2481 transitions.
RANDOM walk for 40000 steps (612 resets) in 537 ms. (74 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (8 resets) in 10 ms. (363 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (8 resets) in 8 ms. (444 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
Interrupted probabilistic random walk after 179440 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :6 out of 17
Probabilistic random walk after 179440 steps, saw 42648 distinct states, run finished after 3001 ms. (steps per millisecond=59 ) properties seen :6
[2026-05-22 23:03:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 85/90 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 38/128 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 24/152 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 31/183 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 238/421 variables, 23/30 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/421 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 63/484 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/484 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (OVERLAPS) 24/508 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/508 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (OVERLAPS) 184/692 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/692 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (OVERLAPS) 21/713 variables, 5/66 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/713 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 19 (OVERLAPS) 66/779 variables, 10/76 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/779 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 21 (OVERLAPS) 5/784 variables, 2/78 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/784 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 23 (OVERLAPS) 5/789 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/789 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 25 (OVERLAPS) 2023/2812 variables, 789/868 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2812 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 11 unsolved
All remaining problems are real, not stopping.
At refinement iteration 27 (OVERLAPS) 0/2812 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2812/2812 variables, and 868 constraints, problems are : Problem set: 0 solved, 11 unsolved in 5657 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 54/54 constraints, State Equation: 789/789 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 85/90 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 38/128 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 24/152 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 31/183 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 238/421 variables, 23/30 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/421 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 63/484 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/484 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (OVERLAPS) 24/508 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/508 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (OVERLAPS) 184/692 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/692 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (OVERLAPS) 21/713 variables, 5/66 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/713 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 19 (OVERLAPS) 66/779 variables, 10/76 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/779 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 21 (OVERLAPS) 5/784 variables, 2/78 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/784 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 23 (OVERLAPS) 5/789 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/789 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 25 (OVERLAPS) 2023/2812 variables, 789/868 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2812 variables, 11/879 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2812 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 28 (OVERLAPS) 0/2812 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2812/2812 variables, and 879 constraints, problems are : Problem set: 0 solved, 11 unsolved in 18908 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 54/54 constraints, State Equation: 789/789 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 24592ms problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 4 different solutions.
Parikh walk visited 5 properties in 5944 ms.
Support contains 5 out of 789 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 789/789 places, 2023/2023 transitions.
Applied a total of 0 rules in 36 ms. Remains 789 /789 variables (removed 0) and now considering 2023/2023 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 789/789 places, 2023/2023 transitions.
Knowledge based reduction with 1 factoid took 547 ms. Reduced automaton from 9 states, 32 edges and 4 AP (stutter sensitive) to 9 states, 32 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 641 ms :[(AND (NOT p1) (NOT p2) p3), (AND (NOT p1) (NOT p2) p3), (AND (NOT p1) (NOT p2) p3), (NOT p2), (AND (NOT p2) p3), (AND (NOT p2) p3), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) p3), (AND (NOT p1) (NOT p2) p3)]
Knowledge-based reduction took 108774 ms.
Stuttering acceptance computed with spot in 498 ms :[(AND (NOT p1) (NOT p2) p3), (AND (NOT p1) (NOT p2) p3), (AND (NOT p1) (NOT p2) p3), (NOT p2), (AND (NOT p2) p3), (AND (NOT p2) p3), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) p3), (AND (NOT p1) (NOT p2) p3)]
Stuttering acceptance computed with spot in 567 ms :[(AND (NOT p1) (NOT p2) p3), (AND (NOT p1) (NOT p2) p3), (AND (NOT p1) (NOT p2) p3), (NOT p2), (AND (NOT p2) p3), (AND (NOT p2) p3), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) p3), (AND (NOT p1) (NOT p2) p3)]
Product exploration explored 100000 steps with 19951 reset in 565 ms.
Product exploration explored 100000 steps with 20005 reset in 596 ms.
Spot run failed in 87 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin8028303334011776508
[2026-05-22 23:04:03] [INFO ] Built C files in 86ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8028303334011776508
Running compilation step : cd /tmp/ltsmin8028303334011776508;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8028303334011776508;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8028303334011776508;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 5 out of 3944 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3944/3944 places, 4851/4851 transitions.
Applied a total of 0 rules in 475 ms. Remains 3944 /3944 variables (removed 0) and now considering 4851/4851 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10974878191359442565.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10361503639868358946.kers'
[2026-05-22 23:04:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10974878191359442565.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10361503639868358946.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 4851 rows 3944 cols 15053 entries
Finished phase 1 with 2560 SingleSign rule and 962 generalized
[2026-05-22 23:04:07] [INFO ] Computed 422 invariants in 42 ms
Computed 422 P flows in 56 ms.
Exported basis to /tmp/petrispot-output-10361503639868358946.kers
Total runtime 65 ms.
[2026-05-22 23:04:10] [INFO ] Implicit Places using invariants in 2854 ms returned []
[2026-05-22 23:04:10] [INFO ] Invariant cache hit.
[2026-05-22 23:04:29] [INFO ] Implicit Places using invariants and state equation in 19283 ms returned []
Implicit Place search using SMT with State Equation took 22157 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 22644 ms. Remains : 3944/3944 places, 4851/4851 transitions.
Built C files in :
/tmp/ltsmin5794219839944799752
[2026-05-22 23:04:29] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5794219839944799752
Running compilation step : cd /tmp/ltsmin5794219839944799752;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5794219839944799752;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5794219839944799752;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-22 23:04:32] [INFO ] Flatten gal took : 74 ms
[2026-05-22 23:04:32] [INFO ] Flatten gal took : 75 ms
[2026-05-22 23:04:32] [INFO ] Time to serialize gal into /tmp/LTL18223191338175000444.gal : 16 ms
[2026-05-22 23:04:32] [INFO ] Time to serialize properties into /tmp/LTL9201947555205679349.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18223191338175000444.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9724952965569416827.hoa' '-atoms' '/tmp/LTL9201947555205679349.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL9201947555205679349.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9724952965569416827.hoa
Detected timeout of ITS tools.
[2026-05-22 23:04:47] [INFO ] Flatten gal took : 73 ms
[2026-05-22 23:04:48] [INFO ] Flatten gal took : 82 ms
[2026-05-22 23:04:48] [INFO ] Time to serialize gal into /tmp/LTL5195685002383259432.gal : 16 ms
[2026-05-22 23:04:48] [INFO ] Time to serialize properties into /tmp/LTL1073505902709267911.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5195685002383259432.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1073505902709267911.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((((X(X("(p4072==1)")))||(G("(p2398!=1)")))||(F(("(p3328!=1)")U((G("(p3328!=1)"))||(("(p3328!=1)")&&((X(!("((p2089==1)&&(p2546==1))")...258
Formula 0 simplified : XX!"(p4072==1)" & F!"(p2398!=1)" & G((X"((p2089==1)&&(p2546==1))" R (XF"((p2089==1)&&(p2546==1))" & (!"(p4072==1)" | X"((p2089==1)&&...187
Detected timeout of ITS tools.
[2026-05-22 23:05:03] [INFO ] Flatten gal took : 68 ms
[2026-05-22 23:05:03] [INFO ] Applying decomposition
[2026-05-22 23:05:03] [INFO ] Flatten gal took : 72 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph18402865893682252974.txt' '-o' '/tmp/graph18402865893682252974.bin' '-w' '/tmp/graph18402865893682252974.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph18402865893682252974.bin' '-l' '-1' '-v' '-w' '/tmp/graph18402865893682252974.weights' '-q' '0' '-e' '0.001'
[2026-05-22 23:05:03] [INFO ] Decomposing Gal with order
[2026-05-22 23:05:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 23:05:04] [INFO ] Removed a total of 3688 redundant transitions.
[2026-05-22 23:05:04] [INFO ] Flatten gal took : 112 ms
[2026-05-22 23:05:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 3 labels/synchronizations in 16 ms.
[2026-05-22 23:05:04] [INFO ] Time to serialize gal into /tmp/LTL3153772163303249948.gal : 25 ms
[2026-05-22 23:05:04] [INFO ] Time to serialize properties into /tmp/LTL8536399167586991183.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3153772163303249948.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8536399167586991183.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((((X(X("(i44.u1428.p4072==1)")))||(G("(i18.u841.p2398!=1)")))||(F(("(i36.u1165.p3328!=1)")U((G("(i36.u1165.p3328!=1)"))||(("(i36.u11...371
Formula 0 simplified : XX!"(i44.u1428.p4072==1)" & F!"(i18.u841.p2398!=1)" & G((X"((i25.u732.p2089==1)&&(i25.u890.p2546==1))" R (XF"((i25.u732.p2089==1)&&(...280
Detected timeout of ITS tools.
Treatment of property ASLink-PT-10b-LTLFireability-05 finished in 403001 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 1 out of 3954 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3954/3954 places, 4876/4876 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 3951 transition count 4865
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 3951 transition count 4865
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 3950 transition count 4864
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 3950 transition count 4864
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 3949 transition count 4856
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 3949 transition count 4856
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 3948 transition count 4855
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 3948 transition count 4855
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 3947 transition count 4847
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 3947 transition count 4847
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 3946 transition count 4839
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 3946 transition count 4839
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 3945 transition count 4838
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 3945 transition count 4838
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 3944 transition count 4830
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 3944 transition count 4830
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 3943 transition count 4822
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 3943 transition count 4822
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 3942 transition count 4821
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 3942 transition count 4821
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 3941 transition count 4813
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 3941 transition count 4813
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 3940 transition count 4805
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 3940 transition count 4805
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 3939 transition count 4804
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 3939 transition count 4804
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 3938 transition count 4796
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 3938 transition count 4796
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 3937 transition count 4788
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 3937 transition count 4788
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 3936 transition count 4787
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 3936 transition count 4787
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 3935 transition count 4779
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 3935 transition count 4779
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 3934 transition count 4771
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 3934 transition count 4771
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 3933 transition count 4770
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 3933 transition count 4770
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 3932 transition count 4762
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 3932 transition count 4762
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 3931 transition count 4754
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 3931 transition count 4754
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 3930 transition count 4753
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 3930 transition count 4753
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 3929 transition count 4745
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 3929 transition count 4745
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 3928 transition count 4737
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 3928 transition count 4737
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 3927 transition count 4736
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 3927 transition count 4736
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 3926 transition count 4728
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 3926 transition count 4728
Applied a total of 56 rules in 12737 ms. Remains 3926 /3954 variables (removed 28) and now considering 4728/4876 (removed 148) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18348383090122336512.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12196965296046238636.kers'
[2026-05-22 23:05:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18348383090122336512.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12196965296046238636.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 4728 rows 3926 cols 14570 entries
Finished phase 1 with 2555 SingleSign rule and 949 generalized
[2026-05-22 23:05:32] [INFO ] Computed 422 invariants in 41 ms
Computed 422 P flows in 41 ms.
Exported basis to /tmp/petrispot-output-12196965296046238636.kers
Total runtime 52 ms.
[2026-05-22 23:05:35] [INFO ] Implicit Places using invariants in 2860 ms returned []
[2026-05-22 23:05:35] [INFO ] Invariant cache hit.
[2026-05-22 23:05:50] [INFO ] Implicit Places using invariants and state equation in 15405 ms returned []
Implicit Place search using SMT with State Equation took 18286 ms to find 0 implicit places.
Running 4727 sub problems to find dead transitions.
[2026-05-22 23:05:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3925 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 4727 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3925/8654 variables, and 255 constraints, problems are : Problem set: 0 solved, 4727 unsolved in 30094 ms.
Refiners :[Positive P Invariants (semi-flows): 0/86 constraints, Generalized P Invariants (flows): 255/336 constraints, State Equation: 0/3926 constraints, PredecessorRefiner: 4727/4727 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4727 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3925 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 4727 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3925/8654 variables, and 255 constraints, problems are : Problem set: 0 solved, 4727 unsolved in 30089 ms.
Refiners :[Positive P Invariants (semi-flows): 0/86 constraints, Generalized P Invariants (flows): 255/336 constraints, State Equation: 0/3926 constraints, PredecessorRefiner: 0/4727 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62746ms problems are : Problem set: 0 solved, 4727 unsolved
Search for dead transitions found 0 dead transitions in 62762ms
Starting structural reductions in LTL mode, iteration 1 : 3926/3954 places, 4728/4876 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 93808 ms. Remains : 3926/3954 places, 4728/4876 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Stuttering acceptance computed with spot in 203 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-10b-LTLFireability-06
Product exploration explored 100000 steps with 25000 reset in 744 ms.
Product exploration explored 100000 steps with 25000 reset in 594 ms.
Computed a total of 161 stabilizing places and 161 stable transitions
Computed a total of 161 stabilizing places and 161 stable transitions
Knowledge based reduction with 1 factoid took 68 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (48 resets) in 405 ms. (98 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 118213 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :0 out of 1
Probabilistic random walk after 118213 steps, saw 27754 distinct states, run finished after 3001 ms. (steps per millisecond=39 ) properties seen :0
[2026-05-22 23:06:58] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 105/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1431/1537 variables, 86/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1537 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2249/3786 variables, 290/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3786 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 140/3926 variables, 45/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3926 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4728/8654 variables, 3926/4348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/8654 variables, 0/4348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/8654 variables, 0/4348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8654/8654 variables, and 4348 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2527 ms.
Refiners :[Positive P Invariants (semi-flows): 86/86 constraints, Generalized P Invariants (flows): 336/336 constraints, State Equation: 3926/3926 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 105/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1431/1537 variables, 86/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1537 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2249/3786 variables, 290/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3786 variables, 3/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3786 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 140/3926 variables, 45/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3926 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 8654/8654 variables, and 4351 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4991 ms.
Refiners :[Positive P Invariants (semi-flows): 86/86 constraints, Generalized P Invariants (flows): 336/336 constraints, State Equation: 3926/3926 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7560ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 312 ms.
Support contains 1 out of 3926 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3926/3926 places, 4728/4728 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 736 transitions
Trivial Post-agglo rules discarded 736 transitions
Performed 736 trivial Post agglomeration. Transition count delta: 736
Iterating post reduction 0 with 736 rules applied. Total rules applied 736 place count 3926 transition count 3992
Reduce places removed 736 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 739 rules applied. Total rules applied 1475 place count 3190 transition count 3989
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1477 place count 3188 transition count 3989
Performed 1064 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1064 Pre rules applied. Total rules applied 1477 place count 3188 transition count 2925
Deduced a syphon composed of 1064 places in 10 ms
Ensure Unique test removed 104 places
Reduce places removed 1168 places and 0 transitions.
Iterating global reduction 3 with 2232 rules applied. Total rules applied 3709 place count 2020 transition count 2925
Discarding 10 places :
Implicit places reduction removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 3 with 74 rules applied. Total rules applied 3783 place count 2010 transition count 2861
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 4 with 64 rules applied. Total rules applied 3847 place count 1946 transition count 2861
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 41 Pre rules applied. Total rules applied 3847 place count 1946 transition count 2820
Deduced a syphon composed of 41 places in 9 ms
Ensure Unique test removed 41 places
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 5 with 123 rules applied. Total rules applied 3970 place count 1864 transition count 2820
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 40 Pre rules applied. Total rules applied 3970 place count 1864 transition count 2780
Deduced a syphon composed of 40 places in 8 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 5 with 80 rules applied. Total rules applied 4050 place count 1824 transition count 2780
Performed 313 Post agglomeration using F-continuation condition.Transition count delta: 313
Deduced a syphon composed of 313 places in 6 ms
Ensure Unique test removed 1 places
Reduce places removed 314 places and 0 transitions.
Iterating global reduction 5 with 627 rules applied. Total rules applied 4677 place count 1510 transition count 2467
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 4681 place count 1506 transition count 2463
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 4686 place count 1505 transition count 2463
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 4686 place count 1505 transition count 2462
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 4688 place count 1504 transition count 2462
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 4690 place count 1502 transition count 2460
Iterating global reduction 5 with 2 rules applied. Total rules applied 4692 place count 1502 transition count 2460
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 5 with 2 rules applied. Total rules applied 4694 place count 1502 transition count 2458
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 4695 place count 1501 transition count 2458
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 4697 place count 1500 transition count 2463
Free-agglomeration rule applied 11 times.
Iterating global reduction 7 with 11 rules applied. Total rules applied 4708 place count 1500 transition count 2452
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 4719 place count 1489 transition count 2452
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 8 with 9 rules applied. Total rules applied 4728 place count 1489 transition count 2443
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 8 with 9 rules applied. Total rules applied 4737 place count 1480 transition count 2443
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 9 with 10 rules applied. Total rules applied 4747 place count 1480 transition count 2443
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 4748 place count 1479 transition count 2442
Reduce places removed 20 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 9 with 30 rules applied. Total rules applied 4778 place count 1459 transition count 2432
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 10 with 10 rules applied. Total rules applied 4788 place count 1449 transition count 2432
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 30 Pre rules applied. Total rules applied 4788 place count 1449 transition count 2402
Deduced a syphon composed of 30 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 11 with 61 rules applied. Total rules applied 4849 place count 1418 transition count 2402
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 11 with 11 rules applied. Total rules applied 4860 place count 1407 transition count 2402
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 4860 place count 1407 transition count 2401
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 4862 place count 1406 transition count 2401
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 6 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 12 with 42 rules applied. Total rules applied 4904 place count 1385 transition count 2380
Discarding 10 places :
Symmetric choice reduction at 12 with 10 rule applications. Total rules 4914 place count 1375 transition count 2370
Iterating global reduction 12 with 10 rules applied. Total rules applied 4924 place count 1375 transition count 2370
Free-agglomeration rule applied 10 times.
Iterating global reduction 12 with 10 rules applied. Total rules applied 4934 place count 1375 transition count 2360
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 12 with 10 rules applied. Total rules applied 4944 place count 1365 transition count 2360
Applied a total of 4944 rules in 1167 ms. Remains 1365 /3926 variables (removed 2561) and now considering 2360/4728 (removed 2368) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1167 ms. Remains : 1365/3926 places, 2360/4728 transitions.
RANDOM walk for 24336 steps (220 resets) in 250 ms. (96 steps per ms) remains 0/1 properties
Knowledge based reduction with 1 factoid took 68 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 12747 ms.
Stuttering acceptance computed with spot in 232 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 3926 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3926/3926 places, 4728/4728 transitions.
Applied a total of 0 rules in 468 ms. Remains 3926 /3926 variables (removed 0) and now considering 4728/4728 (removed 0) transitions.
[2026-05-22 23:07:08] [INFO ] Invariant cache hit.
[2026-05-22 23:07:10] [INFO ] Implicit Places using invariants in 2592 ms returned []
[2026-05-22 23:07:10] [INFO ] Invariant cache hit.
[2026-05-22 23:07:30] [INFO ] Implicit Places using invariants and state equation in 19113 ms returned []
Implicit Place search using SMT with State Equation took 21714 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 22184 ms. Remains : 3926/3926 places, 4728/4728 transitions.
Computed a total of 161 stabilizing places and 161 stable transitions
Computed a total of 161 stabilizing places and 161 stable transitions
Knowledge based reduction with 1 factoid took 96 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (47 resets) in 387 ms. (103 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 143 ms. (277 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 114454 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :0 out of 1
Probabilistic random walk after 114454 steps, saw 27183 distinct states, run finished after 3001 ms. (steps per millisecond=38 ) properties seen :0
[2026-05-22 23:07:33] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 105/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1431/1537 variables, 86/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1537 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2249/3786 variables, 290/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3786 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 140/3926 variables, 45/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3926 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4728/8654 variables, 3926/4348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/8654 variables, 0/4348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/8654 variables, 0/4348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8654/8654 variables, and 4348 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2620 ms.
Refiners :[Positive P Invariants (semi-flows): 86/86 constraints, Generalized P Invariants (flows): 336/336 constraints, State Equation: 3926/3926 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 105/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1431/1537 variables, 86/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1537 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2249/3786 variables, 290/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3786 variables, 3/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3786 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 140/3926 variables, 45/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3926 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 8654/8654 variables, and 4351 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5039 ms.
Refiners :[Positive P Invariants (semi-flows): 86/86 constraints, Generalized P Invariants (flows): 336/336 constraints, State Equation: 3926/3926 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7676ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 3926 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3926/3926 places, 4728/4728 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 736 transitions
Trivial Post-agglo rules discarded 736 transitions
Performed 736 trivial Post agglomeration. Transition count delta: 736
Iterating post reduction 0 with 736 rules applied. Total rules applied 736 place count 3926 transition count 3992
Reduce places removed 736 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 739 rules applied. Total rules applied 1475 place count 3190 transition count 3989
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1477 place count 3188 transition count 3989
Performed 1064 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1064 Pre rules applied. Total rules applied 1477 place count 3188 transition count 2925
Deduced a syphon composed of 1064 places in 8 ms
Ensure Unique test removed 104 places
Reduce places removed 1168 places and 0 transitions.
Iterating global reduction 3 with 2232 rules applied. Total rules applied 3709 place count 2020 transition count 2925
Discarding 10 places :
Implicit places reduction removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 3 with 74 rules applied. Total rules applied 3783 place count 2010 transition count 2861
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 4 with 64 rules applied. Total rules applied 3847 place count 1946 transition count 2861
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 41 Pre rules applied. Total rules applied 3847 place count 1946 transition count 2820
Deduced a syphon composed of 41 places in 9 ms
Ensure Unique test removed 41 places
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 5 with 123 rules applied. Total rules applied 3970 place count 1864 transition count 2820
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 40 Pre rules applied. Total rules applied 3970 place count 1864 transition count 2780
Deduced a syphon composed of 40 places in 21 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 5 with 80 rules applied. Total rules applied 4050 place count 1824 transition count 2780
Performed 313 Post agglomeration using F-continuation condition.Transition count delta: 313
Deduced a syphon composed of 313 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 314 places and 0 transitions.
Iterating global reduction 5 with 627 rules applied. Total rules applied 4677 place count 1510 transition count 2467
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 4681 place count 1506 transition count 2463
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 4686 place count 1505 transition count 2463
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 4686 place count 1505 transition count 2462
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 4688 place count 1504 transition count 2462
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 4690 place count 1502 transition count 2460
Iterating global reduction 5 with 2 rules applied. Total rules applied 4692 place count 1502 transition count 2460
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 5 with 2 rules applied. Total rules applied 4694 place count 1502 transition count 2458
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 4695 place count 1501 transition count 2458
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 4697 place count 1500 transition count 2463
Free-agglomeration rule applied 11 times.
Iterating global reduction 7 with 11 rules applied. Total rules applied 4708 place count 1500 transition count 2452
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 4719 place count 1489 transition count 2452
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 8 with 9 rules applied. Total rules applied 4728 place count 1489 transition count 2443
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 8 with 9 rules applied. Total rules applied 4737 place count 1480 transition count 2443
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 9 with 10 rules applied. Total rules applied 4747 place count 1480 transition count 2443
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 4748 place count 1479 transition count 2442
Reduce places removed 20 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 9 with 30 rules applied. Total rules applied 4778 place count 1459 transition count 2432
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 10 with 10 rules applied. Total rules applied 4788 place count 1449 transition count 2432
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 30 Pre rules applied. Total rules applied 4788 place count 1449 transition count 2402
Deduced a syphon composed of 30 places in 6 ms
Ensure Unique test removed 1 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 11 with 61 rules applied. Total rules applied 4849 place count 1418 transition count 2402
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 11 with 11 rules applied. Total rules applied 4860 place count 1407 transition count 2402
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 4860 place count 1407 transition count 2401
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 4862 place count 1406 transition count 2401
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 6 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 12 with 42 rules applied. Total rules applied 4904 place count 1385 transition count 2380
Discarding 10 places :
Symmetric choice reduction at 12 with 10 rule applications. Total rules 4914 place count 1375 transition count 2370
Iterating global reduction 12 with 10 rules applied. Total rules applied 4924 place count 1375 transition count 2370
Free-agglomeration rule applied 10 times.
Iterating global reduction 12 with 10 rules applied. Total rules applied 4934 place count 1375 transition count 2360
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 12 with 10 rules applied. Total rules applied 4944 place count 1365 transition count 2360
Applied a total of 4944 rules in 1235 ms. Remains 1365 /3926 variables (removed 2561) and now considering 2360/4728 (removed 2368) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1235 ms. Remains : 1365/3926 places, 2360/4728 transitions.
RANDOM walk for 22449 steps (211 resets) in 184 ms. (121 steps per ms) remains 0/1 properties
Knowledge based reduction with 1 factoid took 109 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 257 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 12748 ms.
Stuttering acceptance computed with spot in 265 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 197 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 687 ms.
Product exploration explored 100000 steps with 25000 reset in 651 ms.
Spot run failed in 87 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin14089149984703125047
[2026-05-22 23:07:44] [INFO ] Built C files in 80ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14089149984703125047
Running compilation step : cd /tmp/ltsmin14089149984703125047;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14089149984703125047;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14089149984703125047;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 1 out of 3926 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3926/3926 places, 4728/4728 transitions.
Applied a total of 0 rules in 514 ms. Remains 3926 /3926 variables (removed 0) and now considering 4728/4728 (removed 0) transitions.
[2026-05-22 23:07:48] [INFO ] Invariant cache hit.
[2026-05-22 23:07:51] [INFO ] Implicit Places using invariants in 2824 ms returned []
[2026-05-22 23:07:51] [INFO ] Invariant cache hit.
[2026-05-22 23:08:07] [INFO ] Implicit Places using invariants and state equation in 16663 ms returned []
Implicit Place search using SMT with State Equation took 19495 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 20011 ms. Remains : 3926/3926 places, 4728/4728 transitions.
Built C files in :
/tmp/ltsmin14134304970517067820
[2026-05-22 23:08:08] [INFO ] Built C files in 75ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14134304970517067820
Running compilation step : cd /tmp/ltsmin14134304970517067820;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14134304970517067820;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14134304970517067820;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-22 23:08:11] [INFO ] Flatten gal took : 91 ms
[2026-05-22 23:08:11] [INFO ] Flatten gal took : 101 ms
[2026-05-22 23:08:11] [INFO ] Time to serialize gal into /tmp/LTL14213823237794472686.gal : 22 ms
[2026-05-22 23:08:11] [INFO ] Time to serialize properties into /tmp/LTL5704306214054504211.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14213823237794472686.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16057970495846520332.hoa' '-atoms' '/tmp/LTL5704306214054504211.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL5704306214054504211.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16057970495846520332.hoa
Detected timeout of ITS tools.
[2026-05-22 23:08:26] [INFO ] Flatten gal took : 81 ms
[2026-05-22 23:08:26] [INFO ] Flatten gal took : 83 ms
[2026-05-22 23:08:26] [INFO ] Time to serialize gal into /tmp/LTL5765402324735525270.gal : 20 ms
[2026-05-22 23:08:26] [INFO ] Time to serialize properties into /tmp/LTL16769529804364395325.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5765402324735525270.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16769529804364395325.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F("(p4321==0)"))))))
Formula 0 simplified : XXXG!"(p4321==0)"
Detected timeout of ITS tools.
[2026-05-22 23:08:41] [INFO ] Flatten gal took : 72 ms
[2026-05-22 23:08:41] [INFO ] Applying decomposition
[2026-05-22 23:08:41] [INFO ] Flatten gal took : 106 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph9346248379958187534.txt' '-o' '/tmp/graph9346248379958187534.bin' '-w' '/tmp/graph9346248379958187534.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9346248379958187534.bin' '-l' '-1' '-v' '-w' '/tmp/graph9346248379958187534.weights' '-q' '0' '-e' '0.001'
[2026-05-22 23:08:42] [INFO ] Decomposing Gal with order
[2026-05-22 23:08:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 23:08:42] [INFO ] Removed a total of 3457 redundant transitions.
[2026-05-22 23:08:43] [INFO ] Flatten gal took : 119 ms
[2026-05-22 23:08:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 13 labels/synchronizations in 29 ms.
[2026-05-22 23:08:43] [INFO ] Time to serialize gal into /tmp/LTL4065612273875585591.gal : 36 ms
[2026-05-22 23:08:43] [INFO ] Time to serialize properties into /tmp/LTL17615004911659860842.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4065612273875585591.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17615004911659860842.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F("(i32.i0.i4.u1477.p4321==0)"))))))
Formula 0 simplified : XXXG!"(i32.i0.i4.u1477.p4321==0)"
Detected timeout of ITS tools.
Treatment of property ASLink-PT-10b-LTLFireability-06 finished in 218735 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)||X((G(p2)||X(X(p3))))||p0)))'
Support contains 5 out of 3954 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3954/3954 places, 4876/4876 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 3950 transition count 4864
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 3950 transition count 4864
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 3948 transition count 4862
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 3948 transition count 4862
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 3946 transition count 4853
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 3946 transition count 4853
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 3944 transition count 4851
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 3944 transition count 4851
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 3942 transition count 4842
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 3942 transition count 4842
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 3941 transition count 4834
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 3941 transition count 4834
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 3940 transition count 4833
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 3940 transition count 4833
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 3939 transition count 4825
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 3939 transition count 4825
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 3938 transition count 4817
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 3938 transition count 4817
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 3937 transition count 4816
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 3937 transition count 4816
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 3936 transition count 4808
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 3936 transition count 4808
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 3935 transition count 4800
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 3935 transition count 4800
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 3934 transition count 4799
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 3934 transition count 4799
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 3933 transition count 4791
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 3933 transition count 4791
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 3932 transition count 4783
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 3932 transition count 4783
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 3931 transition count 4782
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 3931 transition count 4782
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 3930 transition count 4774
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 3930 transition count 4774
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 3929 transition count 4766
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 3929 transition count 4766
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 3928 transition count 4765
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 3928 transition count 4765
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 3927 transition count 4757
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 3927 transition count 4757
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 3926 transition count 4749
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 3926 transition count 4749
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 3925 transition count 4748
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 3925 transition count 4748
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 3924 transition count 4740
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 3924 transition count 4740
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 3923 transition count 4732
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 3923 transition count 4732
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 3922 transition count 4731
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 3922 transition count 4731
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 3921 transition count 4723
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 3921 transition count 4723
Applied a total of 66 rules in 12542 ms. Remains 3921 /3954 variables (removed 33) and now considering 4723/4876 (removed 153) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10766036249068844469.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9082159019716776493.kers'
[2026-05-22 23:09:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10766036249068844469.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9082159019716776493.kers]
Culled 0 columns in 10 ms.
// Phase 1: matrix 4723 rows 3921 cols 14557 entries
Finished phase 1 with 2551 SingleSign rule and 948 generalized
[2026-05-22 23:09:10] [INFO ] Computed 422 invariants in 94 ms
Computed 422 P flows in 95 ms.
Exported basis to /tmp/petrispot-output-9082159019716776493.kers
Total runtime 112 ms.
[2026-05-22 23:09:13] [INFO ] Implicit Places using invariants in 2716 ms returned []
[2026-05-22 23:09:13] [INFO ] Invariant cache hit.
[2026-05-22 23:09:28] [INFO ] Implicit Places using invariants and state equation in 14707 ms returned []
Implicit Place search using SMT with State Equation took 17473 ms to find 0 implicit places.
Running 4722 sub problems to find dead transitions.
[2026-05-22 23:09:28] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/3920 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 4722 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3920/8644 variables, and 255 constraints, problems are : Problem set: 0 solved, 4722 unsolved in 30096 ms.
Refiners :[Positive P Invariants (semi-flows): 0/86 constraints, Generalized P Invariants (flows): 255/336 constraints, State Equation: 0/3921 constraints, PredecessorRefiner: 4722/4722 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4722 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3920 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 4722 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3920/8644 variables, and 255 constraints, problems are : Problem set: 0 solved, 4722 unsolved in 30101 ms.
Refiners :[Positive P Invariants (semi-flows): 0/86 constraints, Generalized P Invariants (flows): 255/336 constraints, State Equation: 0/3921 constraints, PredecessorRefiner: 0/4722 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62907ms problems are : Problem set: 0 solved, 4722 unsolved
Search for dead transitions found 0 dead transitions in 62917ms
Starting structural reductions in LTL mode, iteration 1 : 3921/3954 places, 4723/4876 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 92958 ms. Remains : 3921/3954 places, 4723/4876 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)||X((G(p2)||X(X(p3))))||p0)))'
Stuttering acceptance computed with spot in 766 ms :[(NOT p3), (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p1) (NOT p3)), (NOT p1), (NOT p3), true, (AND (NOT p3) (NOT p2)), (NOT p2), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ASLink-PT-10b-LTLFireability-09
Product exploration explored 100000 steps with 50000 reset in 942 ms.
Product exploration explored 100000 steps with 50000 reset in 973 ms.
Computed a total of 161 stabilizing places and 161 stable transitions
Computed a total of 161 stabilizing places and 161 stable transitions
Knowledge based reduction with 11 factoid took 105 ms. Proved property starting from automaton with 16 states, 36 edges and 4 AP (stutter sensitive
Knowledge-based reduction took 130 ms.
FORMULA ASLink-PT-10b-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-10b-LTLFireability-09 finished in 95912 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(p0)))))'
Support contains 1 out of 3954 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3954/3954 places, 4876/4876 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 3950 transition count 4864
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 3950 transition count 4864
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 3948 transition count 4862
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 3948 transition count 4862
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 3946 transition count 4853
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 3946 transition count 4853
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 3944 transition count 4851
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 3944 transition count 4851
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 3942 transition count 4842
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 3942 transition count 4842
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 3941 transition count 4834
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 3941 transition count 4834
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 3940 transition count 4833
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 3940 transition count 4833
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 3939 transition count 4825
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 3939 transition count 4825
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 3938 transition count 4817
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 3938 transition count 4817
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 3937 transition count 4816
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 3937 transition count 4816
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 3936 transition count 4808
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 3936 transition count 4808
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 3935 transition count 4800
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 3935 transition count 4800
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 3934 transition count 4799
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 3934 transition count 4799
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 3933 transition count 4791
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 3933 transition count 4791
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 3932 transition count 4783
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 3932 transition count 4783
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 3931 transition count 4782
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 3931 transition count 4782
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 3930 transition count 4774
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 3930 transition count 4774
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 3929 transition count 4766
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 3929 transition count 4766
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 3928 transition count 4765
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 3928 transition count 4765
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 3927 transition count 4757
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 3927 transition count 4757
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 3926 transition count 4749
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 3926 transition count 4749
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 3925 transition count 4748
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 3925 transition count 4748
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 3924 transition count 4740
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 3924 transition count 4740
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 3923 transition count 4732
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 3923 transition count 4732
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 3922 transition count 4731
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 3922 transition count 4731
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 3921 transition count 4723
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 3921 transition count 4723
Applied a total of 66 rules in 12214 ms. Remains 3921 /3954 variables (removed 33) and now considering 4723/4876 (removed 153) transitions.
[2026-05-22 23:10:46] [INFO ] Invariant cache hit.
[2026-05-22 23:10:49] [INFO ] Implicit Places using invariants in 2793 ms returned []
[2026-05-22 23:10:49] [INFO ] Invariant cache hit.
[2026-05-22 23:11:05] [INFO ] Implicit Places using invariants and state equation in 16830 ms returned []
Implicit Place search using SMT with State Equation took 19626 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 3921/3954 places, 4723/4876 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31841 ms. Remains : 3921/3954 places, 4723/4876 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(p0)))))'
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : ASLink-PT-10b-LTLFireability-11
Product exploration explored 100000 steps with 20000 reset in 524 ms.
Product exploration explored 100000 steps with 20000 reset in 561 ms.
Computed a total of 161 stabilizing places and 161 stable transitions
Computed a total of 161 stabilizing places and 161 stable transitions
Knowledge based reduction with 1 factoid took 73 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (43 resets) in 349 ms. (114 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 117928 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :0 out of 1
Probabilistic random walk after 117928 steps, saw 27705 distinct states, run finished after 3001 ms. (steps per millisecond=39 ) properties seen :0
[2026-05-22 23:11:10] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1399/1451 variables, 85/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1451 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2289/3740 variables, 280/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3740 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 181/3921 variables, 56/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3921 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4723/8644 variables, 3921/4343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/8644 variables, 0/4343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/8644 variables, 0/4343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8644/8644 variables, and 4343 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2616 ms.
Refiners :[Positive P Invariants (semi-flows): 86/86 constraints, Generalized P Invariants (flows): 336/336 constraints, State Equation: 3921/3921 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1399/1451 variables, 85/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1451 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1451 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2289/3740 variables, 280/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3740 variables, 1/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3740 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 181/3921 variables, 56/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3921 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 8644/8644 variables, and 4345 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3849 ms.
Refiners :[Positive P Invariants (semi-flows): 86/86 constraints, Generalized P Invariants (flows): 336/336 constraints, State Equation: 3921/3921 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6480ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 3921 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3921/3921 places, 4723/4723 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 734 transitions
Trivial Post-agglo rules discarded 734 transitions
Performed 734 trivial Post agglomeration. Transition count delta: 734
Iterating post reduction 0 with 734 rules applied. Total rules applied 734 place count 3921 transition count 3989
Reduce places removed 734 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 737 rules applied. Total rules applied 1471 place count 3187 transition count 3986
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1473 place count 3185 transition count 3986
Performed 1063 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1063 Pre rules applied. Total rules applied 1473 place count 3185 transition count 2923
Deduced a syphon composed of 1063 places in 9 ms
Ensure Unique test removed 104 places
Reduce places removed 1167 places and 0 transitions.
Iterating global reduction 3 with 2230 rules applied. Total rules applied 3703 place count 2018 transition count 2923
Discarding 10 places :
Implicit places reduction removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 3 with 74 rules applied. Total rules applied 3777 place count 2008 transition count 2859
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 4 with 64 rules applied. Total rules applied 3841 place count 1944 transition count 2859
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 41 Pre rules applied. Total rules applied 3841 place count 1944 transition count 2818
Deduced a syphon composed of 41 places in 7 ms
Ensure Unique test removed 41 places
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 5 with 123 rules applied. Total rules applied 3964 place count 1862 transition count 2818
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 40 Pre rules applied. Total rules applied 3964 place count 1862 transition count 2778
Deduced a syphon composed of 40 places in 8 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 5 with 80 rules applied. Total rules applied 4044 place count 1822 transition count 2778
Performed 312 Post agglomeration using F-continuation condition.Transition count delta: 312
Deduced a syphon composed of 312 places in 5 ms
Ensure Unique test removed 2 places
Reduce places removed 314 places and 0 transitions.
Iterating global reduction 5 with 626 rules applied. Total rules applied 4670 place count 1508 transition count 2466
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 4674 place count 1504 transition count 2462
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 4679 place count 1503 transition count 2462
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 4680 place count 1503 transition count 2461
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 4681 place count 1502 transition count 2461
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 4681 place count 1502 transition count 2460
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 4683 place count 1501 transition count 2460
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 4685 place count 1499 transition count 2458
Iterating global reduction 7 with 2 rules applied. Total rules applied 4687 place count 1499 transition count 2458
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 7 with 2 rules applied. Total rules applied 4689 place count 1499 transition count 2456
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 4690 place count 1498 transition count 2456
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 4692 place count 1497 transition count 2461
Free-agglomeration rule applied 11 times.
Iterating global reduction 9 with 11 rules applied. Total rules applied 4703 place count 1497 transition count 2450
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 9 with 11 rules applied. Total rules applied 4714 place count 1486 transition count 2450
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 10 with 9 rules applied. Total rules applied 4723 place count 1486 transition count 2441
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 10 with 9 rules applied. Total rules applied 4732 place count 1477 transition count 2441
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 11 with 10 rules applied. Total rules applied 4742 place count 1477 transition count 2441
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 4743 place count 1476 transition count 2440
Reduce places removed 20 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 11 with 30 rules applied. Total rules applied 4773 place count 1456 transition count 2430
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 12 with 10 rules applied. Total rules applied 4783 place count 1446 transition count 2430
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 30 Pre rules applied. Total rules applied 4783 place count 1446 transition count 2400
Deduced a syphon composed of 30 places in 6 ms
Ensure Unique test removed 1 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 13 with 61 rules applied. Total rules applied 4844 place count 1415 transition count 2400
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 13 with 11 rules applied. Total rules applied 4855 place count 1404 transition count 2400
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 1 Pre rules applied. Total rules applied 4855 place count 1404 transition count 2399
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 4857 place count 1403 transition count 2399
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 6 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 14 with 42 rules applied. Total rules applied 4899 place count 1382 transition count 2378
Discarding 10 places :
Symmetric choice reduction at 14 with 10 rule applications. Total rules 4909 place count 1372 transition count 2368
Iterating global reduction 14 with 10 rules applied. Total rules applied 4919 place count 1372 transition count 2368
Free-agglomeration rule applied 10 times.
Iterating global reduction 14 with 10 rules applied. Total rules applied 4929 place count 1372 transition count 2358
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 14 with 10 rules applied. Total rules applied 4939 place count 1362 transition count 2358
Applied a total of 4939 rules in 1198 ms. Remains 1362 /3921 variables (removed 2559) and now considering 2358/4723 (removed 2365) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1198 ms. Remains : 1362/3921 places, 2358/4723 transitions.
RANDOM walk for 40000 steps (388 resets) in 286 ms. (139 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (34 resets) in 94 ms. (421 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 161123 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :0 out of 1
Probabilistic random walk after 161123 steps, saw 36929 distinct states, run finished after 3006 ms. (steps per millisecond=53 ) 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-3100430162137880171.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1125868293005877771.kers'
[2026-05-22 23:11:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3100430162137880171.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1125868293005877771.kers]
Culling duplicate invariants (modulo rational): removing 23 columns.
Culled 23 columns in 5 ms.
// Phase 1: matrix 2358 rows 1339 cols 9269 entries
Finished phase 1 with 327 SingleSign rule and 803 generalized
[2026-05-22 23:11:21] [INFO ] Computed 232 invariants in 72 ms
Computed 232 P flows in 73 ms.
Exported basis to /tmp/petrispot-output-1125868293005877771.kers
Total runtime 78 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 19/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 25/45 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/46 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/47 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/47 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 58/105 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/105 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 16/121 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/121 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/122 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/122 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 48/170 variables, 7/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/170 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 73/243 variables, 9/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/243 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 4/247 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/247 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1/248 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/248 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 106/354 variables, 18/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/354 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 28/382 variables, 8/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/382 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 2/384 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/384 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 125/509 variables, 12/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/509 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 95/604 variables, 15/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/604 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 18/622 variables, 5/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/622 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 199/821 variables, 29/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/821 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 87/908 variables, 18/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/908 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 54/962 variables, 8/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/962 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 116/1078 variables, 25/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1078 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 28/1106 variables, 7/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1106 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 26/1132 variables, 3/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1132 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 63/1195 variables, 9/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1195 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (OVERLAPS) 26/1221 variables, 5/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1221 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (OVERLAPS) 26/1247 variables, 3/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1247 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 42/1289 variables, 10/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1289 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (OVERLAPS) 12/1301 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1301 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (OVERLAPS) 7/1308 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1308 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (OVERLAPS) 46/1354 variables, 6/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1354 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (OVERLAPS) 2/1356 variables, 2/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1356 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (OVERLAPS) 1/1357 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1357 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (OVERLAPS) 5/1362 variables, 4/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1362 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (OVERLAPS) 2358/3720 variables, 1362/1594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/3720 variables, 0/1594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (OVERLAPS) 0/3720 variables, 0/1594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3720/3720 variables, and 1594 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1922 ms.
Refiners :[Positive P Invariants (semi-flows): 104/104 constraints, Generalized P Invariants (flows): 128/128 constraints, State Equation: 1362/1362 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 19/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 25/45 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/46 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/47 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/47 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 58/105 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/105 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 16/121 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/121 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/122 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/122 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 48/170 variables, 7/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/170 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 73/243 variables, 9/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/243 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 4/247 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/247 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1/248 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/248 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 106/354 variables, 18/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/354 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 28/382 variables, 8/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/382 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 2/384 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/384 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 125/509 variables, 12/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/509 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 95/604 variables, 15/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/604 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 18/622 variables, 5/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/622 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 199/821 variables, 29/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/821 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 87/908 variables, 18/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/908 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 54/962 variables, 8/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/962 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 116/1078 variables, 25/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1078 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 28/1106 variables, 7/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1106 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 26/1132 variables, 3/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1132 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 63/1195 variables, 9/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1195 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (OVERLAPS) 26/1221 variables, 5/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1221 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (OVERLAPS) 26/1247 variables, 3/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1247 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 42/1289 variables, 10/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1289 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (OVERLAPS) 12/1301 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1301 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (OVERLAPS) 7/1308 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1308 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (OVERLAPS) 46/1354 variables, 6/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1354 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (OVERLAPS) 2/1356 variables, 2/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1356 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (OVERLAPS) 1/1357 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1357 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (OVERLAPS) 5/1362 variables, 4/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1362 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (OVERLAPS) 2358/3720 variables, 1362/1594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/3720 variables, 1/1595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/3720 variables, 0/1595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (OVERLAPS) 0/3720 variables, 0/1595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3720/3720 variables, and 1595 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3544 ms.
Refiners :[Positive P Invariants (semi-flows): 104/104 constraints, Generalized P Invariants (flows): 128/128 constraints, State Equation: 1362/1362 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5604ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 160 ms.
Support contains 1 out of 1362 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1362/1362 places, 2358/2358 transitions.
Applied a total of 0 rules in 66 ms. Remains 1362 /1362 variables (removed 0) and now considering 2358/2358 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 1362/1362 places, 2358/2358 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1362/1362 places, 2358/2358 transitions.
Applied a total of 0 rules in 66 ms. Remains 1362 /1362 variables (removed 0) and now considering 2358/2358 (removed 0) transitions.
[2026-05-22 23:11:27] [INFO ] Invariant cache hit.
[2026-05-22 23:11:28] [INFO ] Implicit Places using invariants in 1449 ms returned [1, 18, 19, 31, 48, 66, 135, 139, 148, 149, 151, 168, 186, 255, 259, 260, 271, 272, 274, 291, 309, 378, 382, 383, 394, 395, 397, 414, 432, 501, 505, 506, 517, 518, 520, 539, 557, 626, 630, 631, 642, 643, 645, 662, 680, 749, 753, 754, 765, 766, 768, 785, 803, 872, 876, 877, 888, 889, 891, 908, 926, 995, 999, 1000, 1011, 1012, 1014, 1031, 1049, 1118, 1122, 1123, 1134, 1135, 1137, 1154, 1172, 1241, 1245, 1246, 1249, 1260, 1261, 1262, 1280, 1301, 1302, 1303, 1304]
[2026-05-22 23:11:28] [INFO ] Actually due to overlaps returned [1280, 1262, 48, 168, 291, 414, 539, 662, 785, 908, 1031, 1154, 31, 151, 274, 397, 520, 645, 768, 891, 1014, 1137, 148, 271, 394, 517, 642, 765, 888, 1011, 1134, 1260, 1301, 149, 272, 395, 518, 643, 766, 889, 1012, 1135, 1261, 1302, 1, 18, 259, 260, 382, 383, 505, 506, 630, 631, 753, 754, 876, 877, 999, 1000, 1122, 1123, 1245, 1246, 66, 186, 309, 432, 557, 680, 803, 926, 1049, 1172, 1303, 19, 1249, 1304]
Discarding 78 places :
Implicit Place search using SMT only with invariants took 1454 ms to find 78 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1284/1362 places, 2358/2358 transitions.
Discarding 10 places :
Implicit places reduction removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 173 transitions
Trivial Post-agglo rules discarded 173 transitions
Performed 173 trivial Post agglomeration. Transition count delta: 173
Iterating post reduction 0 with 183 rules applied. Total rules applied 183 place count 1274 transition count 2185
Reduce places removed 173 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 183 rules applied. Total rules applied 366 place count 1101 transition count 2175
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 47 Pre rules applied. Total rules applied 366 place count 1101 transition count 2128
Deduced a syphon composed of 47 places in 8 ms
Ensure Unique test removed 1 places
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 95 rules applied. Total rules applied 461 place count 1053 transition count 2128
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 473 place count 1049 transition count 2120
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 481 place count 1041 transition count 2120
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 484 place count 1038 transition count 2117
Iterating global reduction 4 with 3 rules applied. Total rules applied 487 place count 1038 transition count 2117
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 490 place count 1038 transition count 2114
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 5 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 5 with 132 rules applied. Total rules applied 622 place count 972 transition count 2048
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 632 place count 962 transition count 2038
Iterating global reduction 5 with 10 rules applied. Total rules applied 642 place count 962 transition count 2038
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 652 place count 962 transition count 2028
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 656 place count 960 transition count 2029
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 6 with 20 rules applied. Total rules applied 676 place count 960 transition count 2009
Ensure Unique test removed 1 places
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 6 with 21 rules applied. Total rules applied 697 place count 939 transition count 2009
Partial Free-agglomeration rule applied 30 times.
Drop transitions (Partial Free agglomeration) removed 30 transitions
Iterating global reduction 7 with 30 rules applied. Total rules applied 727 place count 939 transition count 2009
Applied a total of 727 rules in 364 ms. Remains 939 /1284 variables (removed 345) and now considering 2009/2358 (removed 349) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6990061665556166334.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16980453253077557321.kers'
[2026-05-22 23:11:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6990061665556166334.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16980453253077557321.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 3 ms.
// Phase 1: matrix 2009 rows 938 cols 8231 entries
Finished phase 1 with 248 SingleSign rule and 553 generalized
[2026-05-22 23:11:29] [INFO ] Computed 138 invariants in 56 ms
Computed 138 P flows in 56 ms.
Exported basis to /tmp/petrispot-output-16980453253077557321.kers
Total runtime 61 ms.
[2026-05-22 23:11:30] [INFO ] Implicit Places using invariants in 1132 ms returned [73, 89, 95, 98, 100, 101, 104, 105, 158, 174, 180, 183, 185, 190, 191, 244, 260, 266, 269, 271, 276, 277, 330, 346, 352, 355, 357, 362, 363, 418, 434, 440, 443, 445, 450, 451, 504, 520, 526, 529, 531, 536, 537, 590, 606, 612, 615, 617, 622, 623, 676, 692, 698, 701, 703, 708, 709, 762, 778, 784, 787, 789, 794, 795, 848, 864, 870, 873, 875]
[2026-05-22 23:11:30] [INFO ] Actually due to overlaps returned [104, 190, 276, 362, 450, 536, 622, 708, 794, 105, 191, 277, 363, 451, 537, 623, 709, 795, 89, 95, 100, 174, 180, 185, 260, 266, 271, 346, 352, 357, 434, 440, 445, 520, 526, 531, 606, 612, 617, 692, 698, 703, 778, 784, 789, 864, 870, 875, 73, 101, 158, 244, 330, 418, 504, 590, 676, 762, 848]
Discarding 59 places :
Implicit Place search using SMT only with invariants took 1136 ms to find 59 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 880/1362 places, 2009/2358 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 840 transition count 1969
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 840 transition count 1969
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 90 place count 830 transition count 1959
Iterating global reduction 0 with 10 rules applied. Total rules applied 100 place count 830 transition count 1959
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 4 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 140 place count 810 transition count 1939
Free-agglomeration rule applied 30 times.
Iterating global reduction 0 with 30 rules applied. Total rules applied 170 place count 810 transition count 1909
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 200 place count 780 transition count 1909
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 1 with 10 rules applied. Total rules applied 210 place count 780 transition count 1899
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 220 place count 770 transition count 1899
Applied a total of 220 rules in 227 ms. Remains 770 /880 variables (removed 110) and now considering 1899/2009 (removed 110) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15607704044962329129.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13481833870627263539.kers'
[2026-05-22 23:11:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15607704044962329129.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13481833870627263539.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 1899 rows 770 cols 7758 entries
Finished phase 1 with 181 SingleSign rule and 510 generalized
[2026-05-22 23:11:30] [INFO ] Computed 79 invariants in 55 ms
Computed 79 P flows in 55 ms.
Exported basis to /tmp/petrispot-output-13481833870627263539.kers
Total runtime 60 ms.
[2026-05-22 23:11:31] [INFO ] Implicit Places using invariants in 870 ms returned []
[2026-05-22 23:11:31] [INFO ] Invariant cache hit.
[2026-05-22 23:11:33] [INFO ] Implicit Places using invariants and state equation in 2148 ms returned []
Implicit Place search using SMT with State Equation took 3023 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 770/1362 places, 1899/2358 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 6271 ms. Remains : 770/1362 places, 1899/2358 transitions.
RANDOM walk for 40000 steps (617 resets) in 225 ms. (176 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (84 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 259699 steps, run timeout after 3001 ms. (steps per millisecond=86 ) properties seen :0 out of 1
Probabilistic random walk after 259699 steps, saw 60916 distinct states, run finished after 3001 ms. (steps per millisecond=86 ) properties seen :0
[2026-05-22 23:11:36] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 24/82 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 24/106 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 60/166 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/166 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/168 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/168 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 282/450 variables, 23/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/450 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 104/554 variables, 12/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/554 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/556 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/556 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 179/735 variables, 26/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/735 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 19/754 variables, 4/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/754 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 4/758 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/758 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 12/770 variables, 3/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/770 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 1899/2669 variables, 770/849 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2669 variables, 0/849 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/2669 variables, 0/849 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2669/2669 variables, and 849 constraints, problems are : Problem set: 0 solved, 1 unsolved in 695 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 52/52 constraints, State Equation: 770/770 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 24/82 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 24/106 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 60/166 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/166 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/168 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/168 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 282/450 variables, 23/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/450 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 104/554 variables, 12/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/554 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/556 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/556 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 179/735 variables, 26/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/735 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/735 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 19/754 variables, 4/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/754 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 4/758 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/758 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 12/770 variables, 3/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/770 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 1899/2669 variables, 770/850 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2669 variables, 1/851 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2669 variables, 0/851 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/2669 variables, 0/851 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2669/2669 variables, and 851 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1666 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 52/52 constraints, State Equation: 770/770 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2365ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 66 ms.
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1899/1899 transitions.
Applied a total of 0 rules in 38 ms. Remains 770 /770 variables (removed 0) and now considering 1899/1899 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 770/770 places, 1899/1899 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1899/1899 transitions.
Applied a total of 0 rules in 37 ms. Remains 770 /770 variables (removed 0) and now considering 1899/1899 (removed 0) transitions.
[2026-05-22 23:11:39] [INFO ] Invariant cache hit.
[2026-05-22 23:11:39] [INFO ] Implicit Places using invariants in 830 ms returned []
[2026-05-22 23:11:39] [INFO ] Invariant cache hit.
[2026-05-22 23:11:42] [INFO ] Implicit Places using invariants and state equation in 2131 ms returned []
Implicit Place search using SMT with State Equation took 2965 ms to find 0 implicit places.
[2026-05-22 23:11:42] [INFO ] Redundant transitions in 75 ms returned []
Running 1850 sub problems to find dead transitions.
[2026-05-22 23:11:42] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/769 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 1850 unsolved
SMT process timed out in 30662ms, After SMT, problems are : Problem set: 0 solved, 1850 unsolved
Search for dead transitions found 0 dead transitions in 30665ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33758 ms. Remains : 770/770 places, 1899/1899 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 43 ms. Remains 770 /770 variables (removed 0) and now considering 1899/1899 (removed 0) transitions.
Running SMT prover for 1 properties.
[2026-05-22 23:12:12] [INFO ] Invariant cache hit.
[2026-05-22 23:12:13] [INFO ] After 166ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-22 23:12:13] [INFO ] [Nat]Absence check using 27 positive place invariants in 10 ms returned sat
[2026-05-22 23:12:13] [INFO ] [Nat]Absence check using 27 positive and 52 generalized place invariants in 16 ms returned sat
[2026-05-22 23:12:13] [INFO ] After 706ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-22 23:12:14] [INFO ] After 882ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-22 23:12:14] [INFO ] After 1193ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 1426 ms.
Knowledge based reduction with 1 factoid took 101 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 344 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Knowledge-based reduction took 67446 ms.
Stuttering acceptance computed with spot in 325 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Support contains 1 out of 3921 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3921/3921 places, 4723/4723 transitions.
Applied a total of 0 rules in 546 ms. Remains 3921 /3921 variables (removed 0) and now considering 4723/4723 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-698015472380743609.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13649571405785973245.kers'
[2026-05-22 23:12:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-698015472380743609.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13649571405785973245.kers]
Culled 0 columns in 4 ms.
// Phase 1: matrix 4723 rows 3921 cols 14557 entries
Finished phase 1 with 2551 SingleSign rule and 948 generalized
[2026-05-22 23:12:15] [INFO ] Computed 422 invariants in 74 ms
Computed 422 P flows in 74 ms.
Exported basis to /tmp/petrispot-output-13649571405785973245.kers
Total runtime 84 ms.
[2026-05-22 23:12:18] [INFO ] Implicit Places using invariants in 2940 ms returned []
[2026-05-22 23:12:18] [INFO ] Invariant cache hit.
[2026-05-22 23:12:35] [INFO ] Implicit Places using invariants and state equation in 17024 ms returned []
Implicit Place search using SMT with State Equation took 19978 ms to find 0 implicit places.
Running 4722 sub problems to find dead transitions.
[2026-05-22 23:12:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3920 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 4722 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3920/8644 variables, and 255 constraints, problems are : Problem set: 0 solved, 4722 unsolved in 30083 ms.
Refiners :[Positive P Invariants (semi-flows): 0/86 constraints, Generalized P Invariants (flows): 255/336 constraints, State Equation: 0/3921 constraints, PredecessorRefiner: 4722/4722 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4722 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3920 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 4722 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3920/8644 variables, and 255 constraints, problems are : Problem set: 0 solved, 4722 unsolved in 30119 ms.
Refiners :[Positive P Invariants (semi-flows): 0/86 constraints, Generalized P Invariants (flows): 255/336 constraints, State Equation: 0/3921 constraints, PredecessorRefiner: 0/4722 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62821ms problems are : Problem set: 0 solved, 4722 unsolved
Search for dead transitions found 0 dead transitions in 62839ms
Finished structural reductions in LTL mode , in 1 iterations and 83385 ms. Remains : 3921/3921 places, 4723/4723 transitions.
Computed a total of 161 stabilizing places and 161 stable transitions
Computed a total of 161 stabilizing places and 161 stable transitions
Knowledge based reduction with 1 factoid took 93 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (51 resets) in 345 ms. (115 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 116853 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :0 out of 1
Probabilistic random walk after 116853 steps, saw 27560 distinct states, run finished after 3001 ms. (steps per millisecond=38 ) properties seen :0
[2026-05-22 23:13:41] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1399/1451 variables, 85/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1451 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2289/3740 variables, 280/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3740 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 181/3921 variables, 56/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3921 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 8644/8644 variables, and 4343 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2475 ms.
Refiners :[Positive P Invariants (semi-flows): 86/86 constraints, Generalized P Invariants (flows): 336/336 constraints, State Equation: 3921/3921 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1399/1451 variables, 85/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1451 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1451 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2289/3740 variables, 280/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3740 variables, 1/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3740 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 181/3921 variables, 56/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3921 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 8644/8644 variables, and 4345 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4138 ms.
Refiners :[Positive P Invariants (semi-flows): 86/86 constraints, Generalized P Invariants (flows): 336/336 constraints, State Equation: 3921/3921 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6628ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 3921 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3921/3921 places, 4723/4723 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 734 transitions
Trivial Post-agglo rules discarded 734 transitions
Performed 734 trivial Post agglomeration. Transition count delta: 734
Iterating post reduction 0 with 734 rules applied. Total rules applied 734 place count 3921 transition count 3989
Reduce places removed 734 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 737 rules applied. Total rules applied 1471 place count 3187 transition count 3986
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1473 place count 3185 transition count 3986
Performed 1063 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1063 Pre rules applied. Total rules applied 1473 place count 3185 transition count 2923
Deduced a syphon composed of 1063 places in 11 ms
Ensure Unique test removed 104 places
Reduce places removed 1167 places and 0 transitions.
Iterating global reduction 3 with 2230 rules applied. Total rules applied 3703 place count 2018 transition count 2923
Discarding 10 places :
Implicit places reduction removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 3 with 74 rules applied. Total rules applied 3777 place count 2008 transition count 2859
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 4 with 64 rules applied. Total rules applied 3841 place count 1944 transition count 2859
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 41 Pre rules applied. Total rules applied 3841 place count 1944 transition count 2818
Deduced a syphon composed of 41 places in 8 ms
Ensure Unique test removed 41 places
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 5 with 123 rules applied. Total rules applied 3964 place count 1862 transition count 2818
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 40 Pre rules applied. Total rules applied 3964 place count 1862 transition count 2778
Deduced a syphon composed of 40 places in 9 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 5 with 80 rules applied. Total rules applied 4044 place count 1822 transition count 2778
Performed 312 Post agglomeration using F-continuation condition.Transition count delta: 312
Deduced a syphon composed of 312 places in 6 ms
Ensure Unique test removed 2 places
Reduce places removed 314 places and 0 transitions.
Iterating global reduction 5 with 626 rules applied. Total rules applied 4670 place count 1508 transition count 2466
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 4674 place count 1504 transition count 2462
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 4679 place count 1503 transition count 2462
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 4680 place count 1503 transition count 2461
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 4681 place count 1502 transition count 2461
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 4681 place count 1502 transition count 2460
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 4683 place count 1501 transition count 2460
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 4685 place count 1499 transition count 2458
Iterating global reduction 7 with 2 rules applied. Total rules applied 4687 place count 1499 transition count 2458
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 7 with 2 rules applied. Total rules applied 4689 place count 1499 transition count 2456
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 4690 place count 1498 transition count 2456
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 4692 place count 1497 transition count 2461
Free-agglomeration rule applied 11 times.
Iterating global reduction 9 with 11 rules applied. Total rules applied 4703 place count 1497 transition count 2450
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 9 with 11 rules applied. Total rules applied 4714 place count 1486 transition count 2450
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 10 with 9 rules applied. Total rules applied 4723 place count 1486 transition count 2441
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 10 with 9 rules applied. Total rules applied 4732 place count 1477 transition count 2441
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 11 with 10 rules applied. Total rules applied 4742 place count 1477 transition count 2441
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 4743 place count 1476 transition count 2440
Reduce places removed 20 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 11 with 30 rules applied. Total rules applied 4773 place count 1456 transition count 2430
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 12 with 10 rules applied. Total rules applied 4783 place count 1446 transition count 2430
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 30 Pre rules applied. Total rules applied 4783 place count 1446 transition count 2400
Deduced a syphon composed of 30 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 13 with 61 rules applied. Total rules applied 4844 place count 1415 transition count 2400
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 13 with 11 rules applied. Total rules applied 4855 place count 1404 transition count 2400
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 1 Pre rules applied. Total rules applied 4855 place count 1404 transition count 2399
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 4857 place count 1403 transition count 2399
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 4 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 14 with 42 rules applied. Total rules applied 4899 place count 1382 transition count 2378
Discarding 10 places :
Symmetric choice reduction at 14 with 10 rule applications. Total rules 4909 place count 1372 transition count 2368
Iterating global reduction 14 with 10 rules applied. Total rules applied 4919 place count 1372 transition count 2368
Free-agglomeration rule applied 10 times.
Iterating global reduction 14 with 10 rules applied. Total rules applied 4929 place count 1372 transition count 2358
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 14 with 10 rules applied. Total rules applied 4939 place count 1362 transition count 2358
Applied a total of 4939 rules in 1244 ms. Remains 1362 /3921 variables (removed 2559) and now considering 2358/4723 (removed 2365) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1244 ms. Remains : 1362/3921 places, 2358/4723 transitions.
RANDOM walk for 40000 steps (376 resets) in 310 ms. (128 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (35 resets) in 97 ms. (408 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 163741 steps, run timeout after 3001 ms. (steps per millisecond=54 ) properties seen :0 out of 1
Probabilistic random walk after 163741 steps, saw 37542 distinct states, run finished after 3003 ms. (steps per millisecond=54 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9067310092250835173.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3790328048351090762.kers'
[2026-05-22 23:13:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9067310092250835173.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3790328048351090762.kers]
Culling duplicate invariants (modulo rational): removing 23 columns.
Culled 23 columns in 4 ms.
// Phase 1: matrix 2358 rows 1339 cols 9269 entries
Finished phase 1 with 327 SingleSign rule and 803 generalized
[2026-05-22 23:13:52] [INFO ] Computed 232 invariants in 72 ms
Computed 232 P flows in 73 ms.
Exported basis to /tmp/petrispot-output-3790328048351090762.kers
Total runtime 79 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 19/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 25/45 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/46 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/47 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/47 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 58/105 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/105 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 16/121 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/121 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/122 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/122 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 48/170 variables, 7/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/170 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 73/243 variables, 9/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/243 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 4/247 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/247 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1/248 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/248 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 106/354 variables, 18/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/354 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 28/382 variables, 8/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/382 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 2/384 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/384 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 125/509 variables, 12/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/509 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 95/604 variables, 15/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/604 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 18/622 variables, 5/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/622 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 199/821 variables, 29/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/821 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 87/908 variables, 18/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/908 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 54/962 variables, 8/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/962 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 116/1078 variables, 25/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1078 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 28/1106 variables, 7/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1106 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 26/1132 variables, 3/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1132 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 63/1195 variables, 9/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1195 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (OVERLAPS) 26/1221 variables, 5/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1221 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (OVERLAPS) 26/1247 variables, 3/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1247 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 42/1289 variables, 10/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1289 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (OVERLAPS) 12/1301 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1301 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (OVERLAPS) 7/1308 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1308 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (OVERLAPS) 46/1354 variables, 6/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1354 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (OVERLAPS) 2/1356 variables, 2/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1356 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (OVERLAPS) 1/1357 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1357 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (OVERLAPS) 5/1362 variables, 4/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1362 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (OVERLAPS) 2358/3720 variables, 1362/1594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/3720 variables, 0/1594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (OVERLAPS) 0/3720 variables, 0/1594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3720/3720 variables, and 1594 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1838 ms.
Refiners :[Positive P Invariants (semi-flows): 104/104 constraints, Generalized P Invariants (flows): 128/128 constraints, State Equation: 1362/1362 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 19/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 25/45 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/46 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/47 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/47 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 58/105 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/105 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 16/121 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/121 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/122 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/122 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 48/170 variables, 7/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/170 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 73/243 variables, 9/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/243 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 4/247 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/247 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1/248 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/248 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 106/354 variables, 18/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/354 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 28/382 variables, 8/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/382 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 2/384 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/384 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 125/509 variables, 12/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/509 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 95/604 variables, 15/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/604 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 18/622 variables, 5/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/622 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 199/821 variables, 29/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/821 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 87/908 variables, 18/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/908 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 54/962 variables, 8/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/962 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 116/1078 variables, 25/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1078 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 28/1106 variables, 7/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1106 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 26/1132 variables, 3/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1132 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 63/1195 variables, 9/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1195 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (OVERLAPS) 26/1221 variables, 5/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1221 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (OVERLAPS) 26/1247 variables, 3/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1247 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 42/1289 variables, 10/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1289 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (OVERLAPS) 12/1301 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1301 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (OVERLAPS) 7/1308 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1308 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (OVERLAPS) 46/1354 variables, 6/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1354 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (OVERLAPS) 2/1356 variables, 2/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1356 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (OVERLAPS) 1/1357 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1357 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (OVERLAPS) 5/1362 variables, 4/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1362 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (OVERLAPS) 2358/3720 variables, 1362/1594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/3720 variables, 1/1595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/3720 variables, 0/1595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (OVERLAPS) 0/3720 variables, 0/1595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3720/3720 variables, and 1595 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3210 ms.
Refiners :[Positive P Invariants (semi-flows): 104/104 constraints, Generalized P Invariants (flows): 128/128 constraints, State Equation: 1362/1362 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5159ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 152 ms.
Support contains 1 out of 1362 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1362/1362 places, 2358/2358 transitions.
Applied a total of 0 rules in 64 ms. Remains 1362 /1362 variables (removed 0) and now considering 2358/2358 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 1362/1362 places, 2358/2358 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1362/1362 places, 2358/2358 transitions.
Applied a total of 0 rules in 63 ms. Remains 1362 /1362 variables (removed 0) and now considering 2358/2358 (removed 0) transitions.
[2026-05-22 23:13:58] [INFO ] Invariant cache hit.
[2026-05-22 23:13:59] [INFO ] Implicit Places using invariants in 1322 ms returned [1, 18, 19, 31, 48, 66, 135, 139, 148, 149, 151, 168, 186, 255, 259, 260, 271, 272, 274, 291, 309, 378, 382, 383, 394, 395, 397, 414, 432, 501, 505, 506, 517, 518, 520, 539, 557, 626, 630, 631, 642, 643, 645, 662, 680, 749, 753, 754, 765, 766, 768, 785, 803, 872, 876, 877, 888, 889, 891, 908, 926, 995, 999, 1000, 1011, 1012, 1014, 1031, 1049, 1118, 1122, 1123, 1134, 1135, 1137, 1154, 1172, 1241, 1245, 1246, 1249, 1260, 1261, 1262, 1280, 1301, 1302, 1303, 1304]
[2026-05-22 23:13:59] [INFO ] Actually due to overlaps returned [1280, 1262, 48, 168, 291, 414, 539, 662, 785, 908, 1031, 1154, 31, 151, 274, 397, 520, 645, 768, 891, 1014, 1137, 148, 271, 394, 517, 642, 765, 888, 1011, 1134, 1260, 1301, 149, 272, 395, 518, 643, 766, 889, 1012, 1135, 1261, 1302, 1, 18, 259, 260, 382, 383, 505, 506, 630, 631, 753, 754, 876, 877, 999, 1000, 1122, 1123, 1245, 1246, 66, 186, 309, 432, 557, 680, 803, 926, 1049, 1172, 1303, 19, 1249, 1304]
Discarding 78 places :
Implicit Place search using SMT only with invariants took 1337 ms to find 78 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1284/1362 places, 2358/2358 transitions.
Discarding 10 places :
Implicit places reduction removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 173 transitions
Trivial Post-agglo rules discarded 173 transitions
Performed 173 trivial Post agglomeration. Transition count delta: 173
Iterating post reduction 0 with 183 rules applied. Total rules applied 183 place count 1274 transition count 2185
Reduce places removed 173 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 183 rules applied. Total rules applied 366 place count 1101 transition count 2175
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 47 Pre rules applied. Total rules applied 366 place count 1101 transition count 2128
Deduced a syphon composed of 47 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 95 rules applied. Total rules applied 461 place count 1053 transition count 2128
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 473 place count 1049 transition count 2120
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 481 place count 1041 transition count 2120
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 484 place count 1038 transition count 2117
Iterating global reduction 4 with 3 rules applied. Total rules applied 487 place count 1038 transition count 2117
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 490 place count 1038 transition count 2114
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 4 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 5 with 132 rules applied. Total rules applied 622 place count 972 transition count 2048
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 632 place count 962 transition count 2038
Iterating global reduction 5 with 10 rules applied. Total rules applied 642 place count 962 transition count 2038
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 652 place count 962 transition count 2028
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 656 place count 960 transition count 2029
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 6 with 20 rules applied. Total rules applied 676 place count 960 transition count 2009
Ensure Unique test removed 1 places
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 6 with 21 rules applied. Total rules applied 697 place count 939 transition count 2009
Partial Free-agglomeration rule applied 30 times.
Drop transitions (Partial Free agglomeration) removed 30 transitions
Iterating global reduction 7 with 30 rules applied. Total rules applied 727 place count 939 transition count 2009
Applied a total of 727 rules in 315 ms. Remains 939 /1284 variables (removed 345) and now considering 2009/2358 (removed 349) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7841514858557899138.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9503664319096664417.kers'
[2026-05-22 23:13:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7841514858557899138.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9503664319096664417.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 3 ms.
// Phase 1: matrix 2009 rows 938 cols 8231 entries
Finished phase 1 with 248 SingleSign rule and 553 generalized
[2026-05-22 23:13:59] [INFO ] Computed 138 invariants in 55 ms
Computed 138 P flows in 56 ms.
Exported basis to /tmp/petrispot-output-9503664319096664417.kers
Total runtime 60 ms.
[2026-05-22 23:14:00] [INFO ] Implicit Places using invariants in 953 ms returned [73, 89, 95, 98, 100, 101, 104, 105, 158, 174, 180, 183, 185, 190, 191, 244, 260, 266, 269, 271, 276, 277, 330, 346, 352, 355, 357, 362, 363, 418, 434, 440, 443, 445, 450, 451, 504, 520, 526, 529, 531, 536, 537, 590, 606, 612, 615, 617, 622, 623, 676, 692, 698, 701, 703, 708, 709, 762, 778, 784, 787, 789, 794, 795, 848, 864, 870, 873, 875]
[2026-05-22 23:14:00] [INFO ] Actually due to overlaps returned [104, 190, 276, 362, 450, 536, 622, 708, 794, 105, 191, 277, 363, 451, 537, 623, 709, 795, 89, 95, 100, 174, 180, 185, 260, 266, 271, 346, 352, 357, 434, 440, 445, 520, 526, 531, 606, 612, 617, 692, 698, 703, 778, 784, 789, 864, 870, 875, 73, 101, 158, 244, 330, 418, 504, 590, 676, 762, 848]
Discarding 59 places :
Implicit Place search using SMT only with invariants took 969 ms to find 59 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 880/1362 places, 2009/2358 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 840 transition count 1969
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 840 transition count 1969
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 90 place count 830 transition count 1959
Iterating global reduction 0 with 10 rules applied. Total rules applied 100 place count 830 transition count 1959
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 4 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 140 place count 810 transition count 1939
Free-agglomeration rule applied 30 times.
Iterating global reduction 0 with 30 rules applied. Total rules applied 170 place count 810 transition count 1909
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 200 place count 780 transition count 1909
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 1 with 10 rules applied. Total rules applied 210 place count 780 transition count 1899
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 220 place count 770 transition count 1899
Applied a total of 220 rules in 206 ms. Remains 770 /880 variables (removed 110) and now considering 1899/2009 (removed 110) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1163504107113428842.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5131926720692709282.kers'
[2026-05-22 23:14:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1163504107113428842.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5131926720692709282.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1899 rows 770 cols 7758 entries
Finished phase 1 with 181 SingleSign rule and 510 generalized
[2026-05-22 23:14:01] [INFO ] Computed 79 invariants in 19 ms
Computed 79 P flows in 19 ms.
Exported basis to /tmp/petrispot-output-5131926720692709282.kers
Total runtime 21 ms.
[2026-05-22 23:14:01] [INFO ] Implicit Places using invariants in 608 ms returned []
[2026-05-22 23:14:01] [INFO ] Invariant cache hit.
[2026-05-22 23:14:03] [INFO ] Implicit Places using invariants and state equation in 2130 ms returned []
Implicit Place search using SMT with State Equation took 2749 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 770/1362 places, 1899/2358 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 5641 ms. Remains : 770/1362 places, 1899/2358 transitions.
RANDOM walk for 40000 steps (641 resets) in 306 ms. (130 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (84 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 268121 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :0 out of 1
Probabilistic random walk after 268121 steps, saw 62879 distinct states, run finished after 3001 ms. (steps per millisecond=89 ) properties seen :0
[2026-05-22 23:14:06] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 24/82 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 24/106 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 60/166 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/166 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/168 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/168 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 282/450 variables, 23/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/450 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 104/554 variables, 12/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/554 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/556 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/556 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 179/735 variables, 26/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/735 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 19/754 variables, 4/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/754 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 4/758 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/758 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 12/770 variables, 3/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/770 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 1899/2669 variables, 770/849 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2669 variables, 0/849 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/2669 variables, 0/849 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2669/2669 variables, and 849 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1254 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 52/52 constraints, State Equation: 770/770 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 24/82 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 24/106 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 60/166 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/166 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/168 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/168 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 282/450 variables, 23/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/450 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 104/554 variables, 12/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/554 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/556 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/556 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 179/735 variables, 26/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/735 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/735 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 19/754 variables, 4/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/754 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 4/758 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/758 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 12/770 variables, 3/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/770 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 1899/2669 variables, 770/850 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2669 variables, 1/851 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2669 variables, 0/851 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/2669 variables, 0/851 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2669/2669 variables, and 851 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1349 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 52/52 constraints, State Equation: 770/770 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2608ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 56 ms.
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1899/1899 transitions.
Applied a total of 0 rules in 36 ms. Remains 770 /770 variables (removed 0) and now considering 1899/1899 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 770/770 places, 1899/1899 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1899/1899 transitions.
Applied a total of 0 rules in 35 ms. Remains 770 /770 variables (removed 0) and now considering 1899/1899 (removed 0) transitions.
[2026-05-22 23:14:09] [INFO ] Invariant cache hit.
[2026-05-22 23:14:10] [INFO ] Implicit Places using invariants in 756 ms returned []
[2026-05-22 23:14:10] [INFO ] Invariant cache hit.
[2026-05-22 23:14:12] [INFO ] Implicit Places using invariants and state equation in 2178 ms returned []
Implicit Place search using SMT with State Equation took 2936 ms to find 0 implicit places.
[2026-05-22 23:14:12] [INFO ] Redundant transitions in 75 ms returned []
Running 1850 sub problems to find dead transitions.
[2026-05-22 23:14:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/769 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 1850 unsolved
SMT process timed out in 30640ms, After SMT, problems are : Problem set: 0 solved, 1850 unsolved
Search for dead transitions found 0 dead transitions in 30643ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33701 ms. Remains : 770/770 places, 1899/1899 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 40 ms. Remains 770 /770 variables (removed 0) and now considering 1899/1899 (removed 0) transitions.
Running SMT prover for 1 properties.
[2026-05-22 23:14:43] [INFO ] Invariant cache hit.
[2026-05-22 23:14:43] [INFO ] After 179ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-22 23:14:43] [INFO ] [Nat]Absence check using 27 positive place invariants in 11 ms returned sat
[2026-05-22 23:14:43] [INFO ] [Nat]Absence check using 27 positive and 52 generalized place invariants in 40 ms returned sat
[2026-05-22 23:14:44] [INFO ] After 858ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-22 23:14:44] [INFO ] After 991ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-22 23:14:44] [INFO ] After 1296ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 1552 ms.
Knowledge based reduction with 1 factoid took 81 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 252 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Knowledge-based reduction took 66751 ms.
Stuttering acceptance computed with spot in 178 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Stuttering acceptance computed with spot in 177 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Product exploration explored 100000 steps with 20000 reset in 595 ms.
Product exploration explored 100000 steps with 20000 reset in 588 ms.
Spot run failed in 84 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin3703760160911830289
[2026-05-22 23:14:46] [INFO ] Built C files in 77ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3703760160911830289
Running compilation step : cd /tmp/ltsmin3703760160911830289;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3703760160911830289;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3703760160911830289;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 1 out of 3921 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3921/3921 places, 4723/4723 transitions.
Applied a total of 0 rules in 502 ms. Remains 3921 /3921 variables (removed 0) and now considering 4723/4723 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16988399471569171384.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7568736031583991345.kers'
[2026-05-22 23:14:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16988399471569171384.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7568736031583991345.kers]
Culled 0 columns in 7 ms.
// Phase 1: matrix 4723 rows 3921 cols 14557 entries
Finished phase 1 with 2551 SingleSign rule and 948 generalized
[2026-05-22 23:14:50] [INFO ] Computed 422 invariants in 78 ms
Computed 422 P flows in 79 ms.
Exported basis to /tmp/petrispot-output-7568736031583991345.kers
Total runtime 88 ms.
[2026-05-22 23:14:53] [INFO ] Implicit Places using invariants in 2949 ms returned []
[2026-05-22 23:14:53] [INFO ] Invariant cache hit.
[2026-05-22 23:15:09] [INFO ] Implicit Places using invariants and state equation in 16322 ms returned []
Implicit Place search using SMT with State Equation took 19290 ms to find 0 implicit places.
Running 4722 sub problems to find dead transitions.
[2026-05-22 23:15:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3920 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 4722 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3920/8644 variables, and 255 constraints, problems are : Problem set: 0 solved, 4722 unsolved in 30092 ms.
Refiners :[Positive P Invariants (semi-flows): 0/86 constraints, Generalized P Invariants (flows): 255/336 constraints, State Equation: 0/3921 constraints, PredecessorRefiner: 4722/4722 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4722 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3920 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 4722 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3920/8644 variables, and 255 constraints, problems are : Problem set: 0 solved, 4722 unsolved in 30099 ms.
Refiners :[Positive P Invariants (semi-flows): 0/86 constraints, Generalized P Invariants (flows): 255/336 constraints, State Equation: 0/3921 constraints, PredecessorRefiner: 0/4722 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62786ms problems are : Problem set: 0 solved, 4722 unsolved
Search for dead transitions found 0 dead transitions in 62801ms
Finished structural reductions in LTL mode , in 1 iterations and 82616 ms. Remains : 3921/3921 places, 4723/4723 transitions.
Built C files in :
/tmp/ltsmin15539482819541022120
[2026-05-22 23:16:12] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15539482819541022120
Running compilation step : cd /tmp/ltsmin15539482819541022120;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15539482819541022120;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15539482819541022120;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-22 23:16:15] [INFO ] Flatten gal took : 75 ms
[2026-05-22 23:16:15] [INFO ] Flatten gal took : 78 ms
[2026-05-22 23:16:15] [INFO ] Time to serialize gal into /tmp/LTL17294105307489744709.gal : 17 ms
[2026-05-22 23:16:15] [INFO ] Time to serialize properties into /tmp/LTL9296435638606190075.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17294105307489744709.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5316859553121519288.hoa' '-atoms' '/tmp/LTL9296435638606190075.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL9296435638606190075.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5316859553121519288.hoa
Detected timeout of ITS tools.
[2026-05-22 23:16:31] [INFO ] Flatten gal took : 69 ms
[2026-05-22 23:16:31] [INFO ] Flatten gal took : 73 ms
[2026-05-22 23:16:31] [INFO ] Time to serialize gal into /tmp/LTL1371498675841466951.gal : 18 ms
[2026-05-22 23:16:31] [INFO ] Time to serialize properties into /tmp/LTL12373471069403523347.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1371498675841466951.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12373471069403523347.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X("(p1683==0)"))))))
Formula 0 simplified : XXXX!"(p1683==0)"
Detected timeout of ITS tools.
[2026-05-22 23:16:46] [INFO ] Flatten gal took : 79 ms
[2026-05-22 23:16:46] [INFO ] Applying decomposition
[2026-05-22 23:16:46] [INFO ] Flatten gal took : 84 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph5650316893467878276.txt' '-o' '/tmp/graph5650316893467878276.bin' '-w' '/tmp/graph5650316893467878276.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5650316893467878276.bin' '-l' '-1' '-v' '-w' '/tmp/graph5650316893467878276.weights' '-q' '0' '-e' '0.001'
[2026-05-22 23:16:46] [INFO ] Decomposing Gal with order
[2026-05-22 23:16:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 23:16:47] [INFO ] Removed a total of 3463 redundant transitions.
[2026-05-22 23:16:47] [INFO ] Flatten gal took : 165 ms
[2026-05-22 23:16:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 7 labels/synchronizations in 24 ms.
[2026-05-22 23:16:47] [INFO ] Time to serialize gal into /tmp/LTL4373609087019378678.gal : 41 ms
[2026-05-22 23:16:47] [INFO ] Time to serialize properties into /tmp/LTL9344676057533755239.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4373609087019378678.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9344676057533755239.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X("(i22.u591.p1683==0)"))))))
Formula 0 simplified : XXXX!"(i22.u591.p1683==0)"
Detected timeout of ITS tools.
Treatment of property ASLink-PT-10b-LTLFireability-11 finished in 388628 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 3954 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3954/3954 places, 4876/4876 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 739 transitions
Trivial Post-agglo rules discarded 739 transitions
Performed 739 trivial Post agglomeration. Transition count delta: 739
Iterating post reduction 0 with 739 rules applied. Total rules applied 739 place count 3953 transition count 4136
Reduce places removed 739 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 742 rules applied. Total rules applied 1481 place count 3214 transition count 4133
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1483 place count 3212 transition count 4133
Performed 1072 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1072 Pre rules applied. Total rules applied 1483 place count 3212 transition count 3061
Deduced a syphon composed of 1072 places in 9 ms
Ensure Unique test removed 104 places
Reduce places removed 1176 places and 0 transitions.
Iterating global reduction 3 with 2248 rules applied. Total rules applied 3731 place count 2036 transition count 3061
Discarding 10 places :
Implicit places reduction removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 3 with 74 rules applied. Total rules applied 3805 place count 2026 transition count 2997
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 4 with 64 rules applied. Total rules applied 3869 place count 1962 transition count 2997
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 41 Pre rules applied. Total rules applied 3869 place count 1962 transition count 2956
Deduced a syphon composed of 41 places in 8 ms
Ensure Unique test removed 41 places
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 5 with 123 rules applied. Total rules applied 3992 place count 1880 transition count 2956
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 40 Pre rules applied. Total rules applied 3992 place count 1880 transition count 2916
Deduced a syphon composed of 40 places in 9 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 5 with 80 rules applied. Total rules applied 4072 place count 1840 transition count 2916
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 4075 place count 1837 transition count 2905
Iterating global reduction 5 with 3 rules applied. Total rules applied 4078 place count 1837 transition count 2905
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 4078 place count 1837 transition count 2904
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 4080 place count 1836 transition count 2904
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 4082 place count 1834 transition count 2895
Iterating global reduction 5 with 2 rules applied. Total rules applied 4084 place count 1834 transition count 2895
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 4085 place count 1833 transition count 2887
Iterating global reduction 5 with 1 rules applied. Total rules applied 4086 place count 1833 transition count 2887
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 4087 place count 1832 transition count 2879
Iterating global reduction 5 with 1 rules applied. Total rules applied 4088 place count 1832 transition count 2879
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 4089 place count 1831 transition count 2871
Iterating global reduction 5 with 1 rules applied. Total rules applied 4090 place count 1831 transition count 2871
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 4091 place count 1830 transition count 2863
Iterating global reduction 5 with 1 rules applied. Total rules applied 4092 place count 1830 transition count 2863
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 4093 place count 1829 transition count 2855
Iterating global reduction 5 with 1 rules applied. Total rules applied 4094 place count 1829 transition count 2855
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 4095 place count 1828 transition count 2847
Iterating global reduction 5 with 1 rules applied. Total rules applied 4096 place count 1828 transition count 2847
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 4097 place count 1827 transition count 2839
Iterating global reduction 5 with 1 rules applied. Total rules applied 4098 place count 1827 transition count 2839
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 4099 place count 1826 transition count 2831
Iterating global reduction 5 with 1 rules applied. Total rules applied 4100 place count 1826 transition count 2831
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 4101 place count 1825 transition count 2823
Iterating global reduction 5 with 1 rules applied. Total rules applied 4102 place count 1825 transition count 2823
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 4103 place count 1824 transition count 2815
Iterating global reduction 5 with 1 rules applied. Total rules applied 4104 place count 1824 transition count 2815
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 4105 place count 1823 transition count 2807
Iterating global reduction 5 with 1 rules applied. Total rules applied 4106 place count 1823 transition count 2807
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 4107 place count 1822 transition count 2799
Iterating global reduction 5 with 1 rules applied. Total rules applied 4108 place count 1822 transition count 2799
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 4109 place count 1821 transition count 2791
Iterating global reduction 5 with 1 rules applied. Total rules applied 4110 place count 1821 transition count 2791
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 4111 place count 1820 transition count 2783
Iterating global reduction 5 with 1 rules applied. Total rules applied 4112 place count 1820 transition count 2783
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 4113 place count 1819 transition count 2775
Iterating global reduction 5 with 1 rules applied. Total rules applied 4114 place count 1819 transition count 2775
Performed 309 Post agglomeration using F-continuation condition.Transition count delta: 309
Deduced a syphon composed of 309 places in 5 ms
Ensure Unique test removed 2 places
Reduce places removed 311 places and 0 transitions.
Iterating global reduction 5 with 620 rules applied. Total rules applied 4734 place count 1508 transition count 2466
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 4738 place count 1504 transition count 2462
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 4743 place count 1503 transition count 2462
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 4744 place count 1503 transition count 2461
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 4745 place count 1502 transition count 2461
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 4745 place count 1502 transition count 2460
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 4747 place count 1501 transition count 2460
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 4749 place count 1499 transition count 2458
Iterating global reduction 7 with 2 rules applied. Total rules applied 4751 place count 1499 transition count 2458
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 7 with 2 rules applied. Total rules applied 4753 place count 1499 transition count 2456
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 4754 place count 1498 transition count 2456
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 4756 place count 1497 transition count 2461
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 4758 place count 1495 transition count 2459
Reduce places removed 20 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 9 with 30 rules applied. Total rules applied 4788 place count 1475 transition count 2449
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 10 with 10 rules applied. Total rules applied 4798 place count 1465 transition count 2449
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 30 Pre rules applied. Total rules applied 4798 place count 1465 transition count 2419
Deduced a syphon composed of 30 places in 7 ms
Ensure Unique test removed 1 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 11 with 61 rules applied. Total rules applied 4859 place count 1434 transition count 2419
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 11 with 21 rules applied. Total rules applied 4880 place count 1413 transition count 2419
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 4880 place count 1413 transition count 2418
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 4882 place count 1412 transition count 2418
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 6 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 12 with 62 rules applied. Total rules applied 4944 place count 1381 transition count 2387
Discarding 20 places :
Symmetric choice reduction at 12 with 20 rule applications. Total rules 4964 place count 1361 transition count 2367
Iterating global reduction 12 with 20 rules applied. Total rules applied 4984 place count 1361 transition count 2367
Discarding 10 places :
Symmetric choice reduction at 12 with 10 rule applications. Total rules 4994 place count 1351 transition count 2357
Iterating global reduction 12 with 10 rules applied. Total rules applied 5004 place count 1351 transition count 2357
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 12 with 10 rules applied. Total rules applied 5014 place count 1351 transition count 2347
Applied a total of 5014 rules in 2708 ms. Remains 1351 /3954 variables (removed 2603) and now considering 2347/4876 (removed 2529) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7611422219438032698.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15034810711789683213.kers'
[2026-05-22 23:17:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7611422219438032698.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15034810711789683213.kers]
Culling duplicate invariants (modulo rational): removing 32 columns.
Culled 32 columns in 5 ms.
// Phase 1: matrix 2347 rows 1319 cols 9129 entries
Finished phase 1 with 297 SingleSign rule and 832 generalized
[2026-05-22 23:17:05] [INFO ] Computed 222 invariants in 70 ms
Computed 222 P flows in 71 ms.
Exported basis to /tmp/petrispot-output-15034810711789683213.kers
Total runtime 73 ms.
[2026-05-22 23:17:07] [INFO ] Implicit Places using invariants in 1953 ms returned [1, 18, 19, 31, 48, 66, 86, 137, 147, 148, 150, 167, 185, 205, 256, 257, 269, 270, 272, 289, 307, 327, 378, 379, 391, 392, 394, 411, 429, 449, 500, 501, 513, 514, 516, 533, 551, 571, 622, 623, 635, 636, 638, 655, 673, 693, 744, 745, 757, 758, 760, 777, 795, 815, 866, 867, 879, 880, 882, 899, 917, 938, 989, 990, 1002, 1003, 1005, 1022, 1040, 1060, 1111, 1112, 1124, 1125, 1127, 1144, 1162, 1182, 1233, 1234, 1237, 1248, 1249, 1250, 1268, 1289, 1290, 1291, 1292]
Discarding 89 places :
Implicit Place search using SMT only with invariants took 1957 ms to find 89 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1262/3954 places, 2347/4876 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 163 transitions
Trivial Post-agglo rules discarded 163 transitions
Performed 163 trivial Post agglomeration. Transition count delta: 163
Iterating post reduction 0 with 163 rules applied. Total rules applied 163 place count 1262 transition count 2184
Reduce places removed 163 places and 0 transitions.
Iterating post reduction 1 with 163 rules applied. Total rules applied 326 place count 1099 transition count 2184
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 47 Pre rules applied. Total rules applied 326 place count 1099 transition count 2137
Deduced a syphon composed of 47 places in 6 ms
Ensure Unique test removed 1 places
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 95 rules applied. Total rules applied 421 place count 1051 transition count 2137
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 433 place count 1047 transition count 2129
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 441 place count 1039 transition count 2129
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 444 place count 1036 transition count 2126
Iterating global reduction 4 with 3 rules applied. Total rules applied 447 place count 1036 transition count 2126
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 450 place count 1036 transition count 2123
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 5 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 5 with 152 rules applied. Total rules applied 602 place count 960 transition count 2047
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 606 place count 958 transition count 2048
Applied a total of 606 rules in 237 ms. Remains 958 /1262 variables (removed 304) and now considering 2048/2347 (removed 299) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2078867258260504233.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12340563556199602583.kers'
[2026-05-22 23:17:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2078867258260504233.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12340563556199602583.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 2048 rows 958 cols 8247 entries
Finished phase 1 with 264 SingleSign rule and 566 generalized
[2026-05-22 23:17:07] [INFO ] Computed 128 invariants in 59 ms
Computed 128 P flows in 59 ms.
Exported basis to /tmp/petrispot-output-12340563556199602583.kers
Total runtime 61 ms.
[2026-05-22 23:17:08] [INFO ] Implicit Places using invariants in 966 ms returned [88, 94, 99, 174, 180, 185, 262, 268, 273, 350, 356, 361, 438, 444, 449, 526, 532, 537, 614, 620, 625, 703, 709, 714, 791, 797, 802, 879, 885, 890, 955]
Discarding 31 places :
Implicit Place search using SMT only with invariants took 971 ms to find 31 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 927/3954 places, 2048/4876 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 927 transition count 2047
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 926 transition count 2047
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 22 place count 906 transition count 2027
Iterating global reduction 2 with 20 rules applied. Total rules applied 42 place count 906 transition count 2027
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 62 place count 886 transition count 2007
Iterating global reduction 2 with 20 rules applied. Total rules applied 82 place count 886 transition count 2007
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 92 place count 876 transition count 1997
Iterating global reduction 2 with 10 rules applied. Total rules applied 102 place count 876 transition count 1997
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 3 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 122 place count 866 transition count 1987
Applied a total of 122 rules in 196 ms. Remains 866 /927 variables (removed 61) and now considering 1987/2048 (removed 61) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4202289543697957922.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12198798604384859749.kers'
[2026-05-22 23:17:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4202289543697957922.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12198798604384859749.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 1987 rows 866 cols 8022 entries
Finished phase 1 with 244 SingleSign rule and 525 generalized
[2026-05-22 23:17:08] [INFO ] Computed 97 invariants in 65 ms
Computed 97 P flows in 66 ms.
Exported basis to /tmp/petrispot-output-12198798604384859749.kers
Total runtime 69 ms.
[2026-05-22 23:17:09] [INFO ] Implicit Places using invariants in 726 ms returned []
[2026-05-22 23:17:09] [INFO ] Invariant cache hit.
[2026-05-22 23:17:11] [INFO ] Implicit Places using invariants and state equation in 2242 ms returned []
Implicit Place search using SMT with State Equation took 3004 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 866/3954 places, 1987/4876 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 9074 ms. Remains : 866/3954 places, 1987/4876 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-10b-LTLFireability-13
Stuttering criterion allowed to conclude after 100 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-10b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-10b-LTLFireability-13 finished in 9164 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||(!p1 U (p2||G(!p1)))))))'
Support contains 3 out of 3954 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3954/3954 places, 4876/4876 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 738 transitions
Trivial Post-agglo rules discarded 738 transitions
Performed 738 trivial Post agglomeration. Transition count delta: 738
Iterating post reduction 0 with 738 rules applied. Total rules applied 738 place count 3953 transition count 4137
Reduce places removed 738 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 741 rules applied. Total rules applied 1479 place count 3215 transition count 4134
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1481 place count 3213 transition count 4134
Performed 1073 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1073 Pre rules applied. Total rules applied 1481 place count 3213 transition count 3061
Deduced a syphon composed of 1073 places in 11 ms
Ensure Unique test removed 104 places
Reduce places removed 1177 places and 0 transitions.
Iterating global reduction 3 with 2250 rules applied. Total rules applied 3731 place count 2036 transition count 3061
Discarding 10 places :
Implicit places reduction removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 3 with 74 rules applied. Total rules applied 3805 place count 2026 transition count 2997
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 4 with 64 rules applied. Total rules applied 3869 place count 1962 transition count 2997
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 41 Pre rules applied. Total rules applied 3869 place count 1962 transition count 2956
Deduced a syphon composed of 41 places in 10 ms
Ensure Unique test removed 41 places
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 5 with 123 rules applied. Total rules applied 3992 place count 1880 transition count 2956
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 40 Pre rules applied. Total rules applied 3992 place count 1880 transition count 2916
Deduced a syphon composed of 40 places in 10 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 5 with 80 rules applied. Total rules applied 4072 place count 1840 transition count 2916
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 4074 place count 1838 transition count 2906
Iterating global reduction 5 with 2 rules applied. Total rules applied 4076 place count 1838 transition count 2906
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 4078 place count 1836 transition count 2897
Iterating global reduction 5 with 2 rules applied. Total rules applied 4080 place count 1836 transition count 2897
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 4081 place count 1835 transition count 2889
Iterating global reduction 5 with 1 rules applied. Total rules applied 4082 place count 1835 transition count 2889
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 4083 place count 1834 transition count 2881
Iterating global reduction 5 with 1 rules applied. Total rules applied 4084 place count 1834 transition count 2881
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 4085 place count 1833 transition count 2873
Iterating global reduction 5 with 1 rules applied. Total rules applied 4086 place count 1833 transition count 2873
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 4087 place count 1832 transition count 2865
Iterating global reduction 5 with 1 rules applied. Total rules applied 4088 place count 1832 transition count 2865
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 4089 place count 1831 transition count 2857
Iterating global reduction 5 with 1 rules applied. Total rules applied 4090 place count 1831 transition count 2857
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 4091 place count 1830 transition count 2849
Iterating global reduction 5 with 1 rules applied. Total rules applied 4092 place count 1830 transition count 2849
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 4093 place count 1829 transition count 2841
Iterating global reduction 5 with 1 rules applied. Total rules applied 4094 place count 1829 transition count 2841
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 4095 place count 1828 transition count 2833
Iterating global reduction 5 with 1 rules applied. Total rules applied 4096 place count 1828 transition count 2833
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 4097 place count 1827 transition count 2825
Iterating global reduction 5 with 1 rules applied. Total rules applied 4098 place count 1827 transition count 2825
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 4099 place count 1826 transition count 2817
Iterating global reduction 5 with 1 rules applied. Total rules applied 4100 place count 1826 transition count 2817
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 4101 place count 1825 transition count 2809
Iterating global reduction 5 with 1 rules applied. Total rules applied 4102 place count 1825 transition count 2809
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 4103 place count 1824 transition count 2801
Iterating global reduction 5 with 1 rules applied. Total rules applied 4104 place count 1824 transition count 2801
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 4105 place count 1823 transition count 2793
Iterating global reduction 5 with 1 rules applied. Total rules applied 4106 place count 1823 transition count 2793
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 4107 place count 1822 transition count 2785
Iterating global reduction 5 with 1 rules applied. Total rules applied 4108 place count 1822 transition count 2785
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 4109 place count 1821 transition count 2777
Iterating global reduction 5 with 1 rules applied. Total rules applied 4110 place count 1821 transition count 2777
Performed 307 Post agglomeration using F-continuation condition.Transition count delta: 307
Deduced a syphon composed of 307 places in 5 ms
Ensure Unique test removed 2 places
Reduce places removed 309 places and 0 transitions.
Iterating global reduction 5 with 616 rules applied. Total rules applied 4726 place count 1512 transition count 2470
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 4730 place count 1508 transition count 2466
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 4735 place count 1507 transition count 2466
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 4736 place count 1507 transition count 2465
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 4737 place count 1506 transition count 2465
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 4737 place count 1506 transition count 2464
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 4739 place count 1505 transition count 2464
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 4741 place count 1503 transition count 2462
Iterating global reduction 7 with 2 rules applied. Total rules applied 4743 place count 1503 transition count 2462
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 7 with 2 rules applied. Total rules applied 4745 place count 1503 transition count 2460
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 4746 place count 1502 transition count 2460
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 4748 place count 1501 transition count 2465
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 4750 place count 1499 transition count 2463
Reduce places removed 19 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 9 with 28 rules applied. Total rules applied 4778 place count 1480 transition count 2454
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 10 with 9 rules applied. Total rules applied 4787 place count 1471 transition count 2454
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 28 Pre rules applied. Total rules applied 4787 place count 1471 transition count 2426
Deduced a syphon composed of 28 places in 7 ms
Ensure Unique test removed 1 places
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 11 with 57 rules applied. Total rules applied 4844 place count 1442 transition count 2426
Discarding 20 places :
Implicit places reduction removed 20 places
Iterating post reduction 11 with 20 rules applied. Total rules applied 4864 place count 1422 transition count 2426
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 4864 place count 1422 transition count 2425
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 4866 place count 1421 transition count 2425
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 6 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 12 with 60 rules applied. Total rules applied 4926 place count 1391 transition count 2395
Discarding 19 places :
Symmetric choice reduction at 12 with 19 rule applications. Total rules 4945 place count 1372 transition count 2376
Iterating global reduction 12 with 19 rules applied. Total rules applied 4964 place count 1372 transition count 2376
Discarding 9 places :
Symmetric choice reduction at 12 with 9 rule applications. Total rules 4973 place count 1363 transition count 2367
Iterating global reduction 12 with 9 rules applied. Total rules applied 4982 place count 1363 transition count 2367
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 12 with 9 rules applied. Total rules applied 4991 place count 1363 transition count 2358
Applied a total of 4991 rules in 2601 ms. Remains 1363 /3954 variables (removed 2591) and now considering 2358/4876 (removed 2518) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2889891010417475877.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5073059529643761751.kers'
[2026-05-22 23:17:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2889891010417475877.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5073059529643761751.kers]
Culling duplicate invariants (modulo rational): removing 28 columns.
Culled 28 columns in 4 ms.
// Phase 1: matrix 2358 rows 1335 cols 9174 entries
Finished phase 1 with 323 SingleSign rule and 816 generalized
[2026-05-22 23:17:14] [INFO ] Computed 224 invariants in 68 ms
Computed 224 P flows in 68 ms.
Exported basis to /tmp/petrispot-output-5073059529643761751.kers
Total runtime 79 ms.
[2026-05-22 23:17:16] [INFO ] Implicit Places using invariants in 1518 ms returned [1, 18, 19, 31, 48, 66, 86, 137, 147, 148, 150, 167, 185, 205, 256, 257, 269, 270, 272, 289, 307, 327, 378, 379, 391, 392, 394, 411, 429, 449, 500, 501, 513, 514, 516, 533, 551, 571, 622, 623, 635, 636, 638, 655, 673, 693, 744, 745, 757, 758, 760, 777, 795, 872, 889, 890, 893, 910, 928, 948, 1001, 1014, 1015, 1017, 1034, 1052, 1072, 1123, 1124, 1136, 1137, 1139, 1156, 1174, 1194, 1245, 1246, 1249, 1260, 1261, 1262, 1280, 1301, 1302, 1303, 1304]
Discarding 86 places :
Implicit Place search using SMT only with invariants took 1523 ms to find 86 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1277/3954 places, 2358/4876 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 0 with 160 rules applied. Total rules applied 160 place count 1277 transition count 2198
Reduce places removed 160 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 161 rules applied. Total rules applied 321 place count 1117 transition count 2197
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 322 place count 1116 transition count 2197
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 322 place count 1116 transition count 2150
Deduced a syphon composed of 47 places in 7 ms
Ensure Unique test removed 1 places
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 95 rules applied. Total rules applied 417 place count 1068 transition count 2150
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 3 with 12 rules applied. Total rules applied 429 place count 1064 transition count 2142
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 437 place count 1056 transition count 2142
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 440 place count 1053 transition count 2139
Iterating global reduction 5 with 3 rules applied. Total rules applied 443 place count 1053 transition count 2139
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 446 place count 1053 transition count 2136
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 5 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 6 with 150 rules applied. Total rules applied 596 place count 978 transition count 2061
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 600 place count 976 transition count 2062
Applied a total of 600 rules in 237 ms. Remains 976 /1277 variables (removed 301) and now considering 2062/2358 (removed 296) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6927342483188936049.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12040593429231247702.kers'
[2026-05-22 23:17:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6927342483188936049.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12040593429231247702.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 2062 rows 976 cols 8289 entries
Finished phase 1 with 278 SingleSign rule and 565 generalized
[2026-05-22 23:17:16] [INFO ] Computed 133 invariants in 58 ms
Computed 133 P flows in 59 ms.
Exported basis to /tmp/petrispot-output-12040593429231247702.kers
Total runtime 64 ms.
[2026-05-22 23:17:17] [INFO ] Implicit Places using invariants in 962 ms returned [88, 94, 99, 174, 180, 185, 262, 268, 273, 350, 356, 361, 438, 444, 449, 526, 532, 537, 617, 623, 628, 718, 724, 729, 809, 815, 820, 897, 903, 908, 973]
Discarding 31 places :
Implicit Place search using SMT only with invariants took 965 ms to find 31 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 945/3954 places, 2062/4876 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 945 transition count 2061
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 944 transition count 2061
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 22 place count 924 transition count 2041
Iterating global reduction 2 with 20 rules applied. Total rules applied 42 place count 924 transition count 2041
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 62 place count 904 transition count 2021
Iterating global reduction 2 with 20 rules applied. Total rules applied 82 place count 904 transition count 2021
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 92 place count 894 transition count 2011
Iterating global reduction 2 with 10 rules applied. Total rules applied 102 place count 894 transition count 2011
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 4 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 122 place count 884 transition count 2001
Applied a total of 122 rules in 207 ms. Remains 884 /945 variables (removed 61) and now considering 2001/2062 (removed 61) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6259616252070136542.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8204884239108256647.kers'
[2026-05-22 23:17:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6259616252070136542.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8204884239108256647.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 2001 rows 884 cols 8064 entries
Finished phase 1 with 259 SingleSign rule and 523 generalized
[2026-05-22 23:17:17] [INFO ] Computed 102 invariants in 50 ms
Computed 102 P flows in 51 ms.
Exported basis to /tmp/petrispot-output-8204884239108256647.kers
Total runtime 55 ms.
[2026-05-22 23:17:18] [INFO ] Implicit Places using invariants in 894 ms returned []
[2026-05-22 23:17:18] [INFO ] Invariant cache hit.
[2026-05-22 23:17:19] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-22 23:17:22] [INFO ] Implicit Places using invariants and state equation in 3766 ms returned []
Implicit Place search using SMT with State Equation took 4670 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 884/3954 places, 2001/4876 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 10204 ms. Remains : 884/3954 places, 2001/4876 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||(!p1 U (p2||G(!p1)))))))'
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1)]
Running random walk in product with property : ASLink-PT-10b-LTLFireability-14
Product exploration explored 100000 steps with 939 reset in 412 ms.
Product exploration explored 100000 steps with 979 reset in 418 ms.
Computed a total of 4 stabilizing places and 3 stable transitions
Computed a total of 4 stabilizing places and 3 stable transitions
Detected a total of 4/884 stabilizing places and 3/2001 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge based reduction with 6 factoid took 322 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
RANDOM walk for 4635 steps (35 resets) in 33 ms. (136 steps per ms) remains 0/5 properties
Knowledge based reduction with 6 factoid took 276 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Knowledge-based reduction took 773 ms.
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Support contains 3 out of 884 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 884/884 places, 2001/2001 transitions.
Applied a total of 0 rules in 80 ms. Remains 884 /884 variables (removed 0) and now considering 2001/2001 (removed 0) transitions.
[2026-05-22 23:17:24] [INFO ] Invariant cache hit.
[2026-05-22 23:17:24] [INFO ] Implicit Places using invariants in 899 ms returned []
[2026-05-22 23:17:24] [INFO ] Invariant cache hit.
[2026-05-22 23:17:25] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-22 23:17:29] [INFO ] Implicit Places using invariants and state equation in 4043 ms returned []
Implicit Place search using SMT with State Equation took 4977 ms to find 0 implicit places.
[2026-05-22 23:17:29] [INFO ] Redundant transitions in 39 ms returned []
Running 1936 sub problems to find dead transitions.
[2026-05-22 23:17:29] [INFO ] Invariant cache hit.
[2026-05-22 23:17:29] [INFO ] State equation strengthened by 5 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/872 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1936 unsolved
SMT process timed out in 30590ms, After SMT, problems are : Problem set: 0 solved, 1936 unsolved
Search for dead transitions found 0 dead transitions in 30592ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 35696 ms. Remains : 884/884 places, 2001/2001 transitions.
Computed a total of 4 stabilizing places and 3 stable transitions
Computed a total of 4 stabilizing places and 3 stable transitions
Detected a total of 4/884 stabilizing places and 3/2001 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge based reduction with 6 factoid took 354 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
RANDOM walk for 3448 steps (35 resets) in 32 ms. (104 steps per ms) remains 0/5 properties
Knowledge based reduction with 6 factoid took 452 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Knowledge-based reduction took 1002 ms.
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Product exploration explored 100000 steps with 925 reset in 364 ms.
Product exploration explored 100000 steps with 962 reset in 359 ms.
Built C files in :
/tmp/ltsmin779819117929315346
[2026-05-22 23:18:01] [INFO ] Too many transitions (2001) to apply POR reductions. Disabling POR matrices.
[2026-05-22 23:18:01] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin779819117929315346
Running compilation step : cd /tmp/ltsmin779819117929315346;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin779819117929315346;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin779819117929315346;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 3 out of 884 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 884/884 places, 2001/2001 transitions.
Applied a total of 0 rules in 89 ms. Remains 884 /884 variables (removed 0) and now considering 2001/2001 (removed 0) transitions.
[2026-05-22 23:18:04] [INFO ] Invariant cache hit.
[2026-05-22 23:18:05] [INFO ] Implicit Places using invariants in 833 ms returned []
[2026-05-22 23:18:05] [INFO ] Invariant cache hit.
[2026-05-22 23:18:06] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-22 23:18:09] [INFO ] Implicit Places using invariants and state equation in 3771 ms returned []
Implicit Place search using SMT with State Equation took 4606 ms to find 0 implicit places.
[2026-05-22 23:18:09] [INFO ] Redundant transitions in 58 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4771 ms. Remains : 884/884 places, 2001/2001 transitions.
Built C files in :
/tmp/ltsmin14322441070741188442
[2026-05-22 23:18:09] [INFO ] Too many transitions (2001) to apply POR reductions. Disabling POR matrices.
[2026-05-22 23:18:09] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14322441070741188442
Running compilation step : cd /tmp/ltsmin14322441070741188442;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14322441070741188442;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14322441070741188442;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-22 23:18:12] [INFO ] Flatten gal took : 39 ms
[2026-05-22 23:18:12] [INFO ] Flatten gal took : 36 ms
[2026-05-22 23:18:12] [INFO ] Time to serialize gal into /tmp/LTL4317134007416207976.gal : 7 ms
[2026-05-22 23:18:12] [INFO ] Time to serialize properties into /tmp/LTL6003692035020286606.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4317134007416207976.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5261828324786679587.hoa' '-atoms' '/tmp/LTL6003692035020286606.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL6003692035020286606.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5261828324786679587.hoa
Detected timeout of ITS tools.
[2026-05-22 23:18:27] [INFO ] Flatten gal took : 36 ms
[2026-05-22 23:18:28] [INFO ] Flatten gal took : 33 ms
[2026-05-22 23:18:28] [INFO ] Time to serialize gal into /tmp/LTL14557990313680526712.gal : 7 ms
[2026-05-22 23:18:28] [INFO ] Time to serialize properties into /tmp/LTL3835439279803234612.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14557990313680526712.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3835439279803234612.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F(("(p2841!=1)")||((!("((p3193==1)&&(p3197==1))"))U(("((p2841!=1)&&(!((p3193==1)&&(p3197==1))))")||(G(!("((p3193==1)&&(p3197==1))...165
Formula 0 simplified : FG(!"(p2841!=1)" & ("((p3193==1)&&(p3197==1))" M !"((p2841!=1)&&(!((p3193==1)&&(p3197==1))))"))
Detected timeout of ITS tools.
[2026-05-22 23:18:43] [INFO ] Flatten gal took : 67 ms
[2026-05-22 23:18:43] [INFO ] Applying decomposition
[2026-05-22 23:18:43] [INFO ] Flatten gal took : 37 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph8717119651255354152.txt' '-o' '/tmp/graph8717119651255354152.bin' '-w' '/tmp/graph8717119651255354152.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8717119651255354152.bin' '-l' '-1' '-v' '-w' '/tmp/graph8717119651255354152.weights' '-q' '0' '-e' '0.001'
[2026-05-22 23:18:43] [INFO ] Decomposing Gal with order
[2026-05-22 23:18:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 23:18:43] [INFO ] Removed a total of 3936 redundant transitions.
[2026-05-22 23:18:43] [INFO ] Flatten gal took : 63 ms
[2026-05-22 23:18:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 121 labels/synchronizations in 19 ms.
[2026-05-22 23:18:43] [INFO ] Time to serialize gal into /tmp/LTL14677369399905698984.gal : 8 ms
[2026-05-22 23:18:43] [INFO ] Time to serialize properties into /tmp/LTL12785051164799535351.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14677369399905698984.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12785051164799535351.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G(F(("(i14.i1.u138.p2841!=1)")||((!("((i14.i0.u158.p3193==1)&&(i15.u177.p3197==1))"))U(("((i14.i1.u138.p2841!=1)&&(!((i14.i0.u158.p...252
Formula 0 simplified : FG(!"(i14.i1.u138.p2841!=1)" & ("((i14.i0.u158.p3193==1)&&(i15.u177.p3197==1))" M !"((i14.i1.u138.p2841!=1)&&(!((i14.i0.u158.p3193==...184
Detected timeout of ITS tools.
Treatment of property ASLink-PT-10b-LTLFireability-14 finished in 106633 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X((p1 U X((p1&&X(F(p2))))))))'
Support contains 5 out of 3954 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3954/3954 places, 4876/4876 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 3950 transition count 4864
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 3950 transition count 4864
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 3948 transition count 4862
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 3948 transition count 4862
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 3946 transition count 4853
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 3946 transition count 4853
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 3944 transition count 4851
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 3944 transition count 4851
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 3942 transition count 4842
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 3942 transition count 4842
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 3941 transition count 4834
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 3941 transition count 4834
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 3940 transition count 4833
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 3940 transition count 4833
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 3939 transition count 4825
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 3939 transition count 4825
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 3938 transition count 4817
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 3938 transition count 4817
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 3937 transition count 4816
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 3937 transition count 4816
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 3936 transition count 4808
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 3936 transition count 4808
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 3935 transition count 4800
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 3935 transition count 4800
Applied a total of 38 rules in 6108 ms. Remains 3935 /3954 variables (removed 19) and now considering 4800/4876 (removed 76) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14898823882857327472.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17380133925046031876.kers'
[2026-05-22 23:19:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14898823882857327472.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17380133925046031876.kers]
Culled 0 columns in 10 ms.
// Phase 1: matrix 4800 rows 3935 cols 14855 entries
Finished phase 1 with 2557 SingleSign rule and 956 generalized
[2026-05-22 23:19:04] [INFO ] Computed 422 invariants in 95 ms
Computed 422 P flows in 95 ms.
Exported basis to /tmp/petrispot-output-17380133925046031876.kers
Total runtime 107 ms.
[2026-05-22 23:19:07] [INFO ] Implicit Places using invariants in 2881 ms returned []
[2026-05-22 23:19:07] [INFO ] Invariant cache hit.
[2026-05-22 23:19:32] [INFO ] Implicit Places using invariants and state equation in 24743 ms returned []
Implicit Place search using SMT with State Equation took 27632 ms to find 0 implicit places.
Running 4799 sub problems to find dead transitions.
[2026-05-22 23:19:32] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/3934 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 4799 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3934/8735 variables, and 255 constraints, problems are : Problem set: 0 solved, 4799 unsolved in 30078 ms.
Refiners :[Positive P Invariants (semi-flows): 0/86 constraints, Generalized P Invariants (flows): 255/336 constraints, State Equation: 0/3935 constraints, PredecessorRefiner: 4799/4799 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4799 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3934 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 4799 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3934/8735 variables, and 255 constraints, problems are : Problem set: 0 solved, 4799 unsolved in 30100 ms.
Refiners :[Positive P Invariants (semi-flows): 0/86 constraints, Generalized P Invariants (flows): 255/336 constraints, State Equation: 0/3935 constraints, PredecessorRefiner: 0/4799 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62642ms problems are : Problem set: 0 solved, 4799 unsolved
Search for dead transitions found 0 dead transitions in 62656ms
Starting structural reductions in LTL mode, iteration 1 : 3935/3954 places, 4800/4876 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 96406 ms. Remains : 3935/3954 places, 4800/4876 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X((p1 U X((p1&&X(F(p2))))))))'
Stuttering acceptance computed with spot in 475 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), true, (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : ASLink-PT-10b-LTLFireability-15
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-10b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-10b-LTLFireability-15 finished in 96991 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Spot run failed in 72 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(X(X(p1)))))'
Spot run failed in 68 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))||G(p1)||(p1&&F((p2 U (G(p2)||(p2&&(X(!p3) U ((p0&&X(!p3))||X(G(!p3)))))))))))'
Spot run failed in 60 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Spot run failed in 62 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(p0)))))'
Spot run failed in 54 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||(!p1 U (p2||G(!p1)))))))'
Spot run failed in 79 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-22 23:20:36] [INFO ] Flatten gal took : 106 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin553618006267819873
[2026-05-22 23:20:36] [INFO ] Too many transitions (4876) to apply POR reductions. Disabling POR matrices.
[2026-05-22 23:20:36] [INFO ] Applying decomposition
[2026-05-22 23:20:36] [INFO ] Built C files in 74ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin553618006267819873
Running compilation step : cd /tmp/ltsmin553618006267819873;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '120' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2026-05-22 23:20:36] [INFO ] Flatten gal took : 79 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph5939854811280677272.txt' '-o' '/tmp/graph5939854811280677272.bin' '-w' '/tmp/graph5939854811280677272.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5939854811280677272.bin' '-l' '-1' '-v' '-w' '/tmp/graph5939854811280677272.weights' '-q' '0' '-e' '0.001'
[2026-05-22 23:20:36] [INFO ] Decomposing Gal with order
[2026-05-22 23:20:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 23:20:37] [INFO ] Removed a total of 3722 redundant transitions.
[2026-05-22 23:20:37] [INFO ] Flatten gal took : 188 ms
[2026-05-22 23:20:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 17 labels/synchronizations in 55 ms.
[2026-05-22 23:20:37] [INFO ] Time to serialize gal into /tmp/LTLFireability13157253739264627125.gal : 34 ms
[2026-05-22 23:20:37] [INFO ] Time to serialize properties into /tmp/LTLFireability7570943214782482360.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13157253739264627125.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7570943214782482360.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 6 LTL properties
Checking formula 0 : !((G(F("((i18.i6.i1.u723.p2067!=1)||(i1.i1.i0.u48.p143!=1))"))))
Formula 0 simplified : FG!"((i18.i6.i1.u723.p2067!=1)||(i1.i1.i0.u48.p143!=1))"
Compilation finished in 16671 ms.
Running link step : cd /tmp/ltsmin553618006267819873;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 111 ms.
Running LTSmin : cd /tmp/ltsmin553618006267819873;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>100 s) on command cd /tmp/ltsmin553618006267819873;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin553618006267819873;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '([]((LTLAPp1==true)) U X(X(X((LTLAPp2==true)))))' '--buchi-type=spotba'
LTSmin run took 1666 ms.
FORMULA ASLink-PT-10b-LTLFireability-02 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin553618006267819873;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '(X(X((LTLAPp3==true)))||[]((LTLAPp4==true))||((LTLAPp4==true)&&<>(((LTLAPp5==true) U ([]((LTLAPp5==true))||((LTLAPp5==true)&&(X(!(LTLAPp6==true)) U (((LTLAPp3==true)&&X(!(LTLAPp6==true)))||X([](!(LTLAPp6==true)))))))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>100 s) on command cd /tmp/ltsmin553618006267819873;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '(X(X((LTLAPp3==true)))||[]((LTLAPp4==true))||((LTLAPp4==true)&&<>(((LTLAPp5==true) U ([]((LTLAPp5==true))||((LTLAPp5==true)&&(X(!(LTLAPp6==true)) U (((LTLAPp3==true)&&X(!(LTLAPp6==true)))||X([](!(LTLAPp6==true)))))))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin553618006267819873;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X(X(X(<>((LTLAPp7==true)))))' '--buchi-type=spotba'
LTSmin run took 1574 ms.
FORMULA ASLink-PT-10b-LTLFireability-06 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin553618006267819873;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X(X(X(X((LTLAPp8==true)))))' '--buchi-type=spotba'
LTSmin run took 1601 ms.
FORMULA ASLink-PT-10b-LTLFireability-11 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin553618006267819873;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '[](<>(((LTLAPp9==true)||(!(LTLAPp10==true) U ((LTLAPp11==true)||[](!(LTLAPp10==true)))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>100 s) on command cd /tmp/ltsmin553618006267819873;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '[](<>(((LTLAPp9==true)||(!(LTLAPp10==true) U ((LTLAPp11==true)||[](!(LTLAPp10==true)))))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 4800 s
Running LTSmin : cd /tmp/ltsmin553618006267819873;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'

BK_TIME_CONFINEMENT_REACHED

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

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