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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.7K Mar 5 14:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Mar 5 14:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Mar 5 14:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 5 14:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 07:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 07:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 07:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 5 14:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Mar 5 14:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Mar 5 14:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 42K Mar 5 14:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:09 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 795K 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-05b-LTLCardinality-00
FORMULA_NAME ASLink-PT-05b-LTLCardinality-01
FORMULA_NAME ASLink-PT-05b-LTLCardinality-02
FORMULA_NAME ASLink-PT-05b-LTLCardinality-03
FORMULA_NAME ASLink-PT-05b-LTLCardinality-04
FORMULA_NAME ASLink-PT-05b-LTLCardinality-05
FORMULA_NAME ASLink-PT-05b-LTLCardinality-06
FORMULA_NAME ASLink-PT-05b-LTLCardinality-07
FORMULA_NAME ASLink-PT-05b-LTLCardinality-08
FORMULA_NAME ASLink-PT-05b-LTLCardinality-09
FORMULA_NAME ASLink-PT-05b-LTLCardinality-10
FORMULA_NAME ASLink-PT-05b-LTLCardinality-11
FORMULA_NAME ASLink-PT-05b-LTLCardinality-12
FORMULA_NAME ASLink-PT-05b-LTLCardinality-13
FORMULA_NAME ASLink-PT-05b-LTLCardinality-14
FORMULA_NAME ASLink-PT-05b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779476892728

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-05b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-22 19:08:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-22 19:08:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 19:08:14] [INFO ] Load time of PNML (sax parser for PT used): 178 ms
[2026-05-22 19:08:14] [INFO ] Transformed 2430 places.
[2026-05-22 19:08:14] [INFO ] Transformed 3040 transitions.
[2026-05-22 19:08:14] [INFO ] Found NUPN structural information;
[2026-05-22 19:08:14] [INFO ] Parsed PT model containing 2430 places and 3040 transitions and 9292 arcs in 318 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ASLink-PT-05b-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05b-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05b-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05b-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05b-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05b-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 2430 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2430/2430 places, 3040/3040 transitions.
Discarding 149 places :
Symmetric choice reduction at 0 with 149 rule applications. Total rules 149 place count 2281 transition count 2891
Iterating global reduction 0 with 149 rules applied. Total rules applied 298 place count 2281 transition count 2891
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 299 place count 2281 transition count 2890
Discarding 55 places :
Symmetric choice reduction at 1 with 55 rule applications. Total rules 354 place count 2226 transition count 2807
Iterating global reduction 1 with 55 rules applied. Total rules applied 409 place count 2226 transition count 2807
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 426 place count 2226 transition count 2790
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 434 place count 2218 transition count 2782
Iterating global reduction 2 with 8 rules applied. Total rules applied 442 place count 2218 transition count 2782
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 446 place count 2214 transition count 2771
Iterating global reduction 2 with 4 rules applied. Total rules applied 450 place count 2214 transition count 2771
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 453 place count 2211 transition count 2768
Iterating global reduction 2 with 3 rules applied. Total rules applied 456 place count 2211 transition count 2768
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 459 place count 2208 transition count 2758
Iterating global reduction 2 with 3 rules applied. Total rules applied 462 place count 2208 transition count 2758
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 463 place count 2207 transition count 2750
Iterating global reduction 2 with 1 rules applied. Total rules applied 464 place count 2207 transition count 2750
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 465 place count 2206 transition count 2749
Iterating global reduction 2 with 1 rules applied. Total rules applied 466 place count 2206 transition count 2749
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 467 place count 2205 transition count 2741
Iterating global reduction 2 with 1 rules applied. Total rules applied 468 place count 2205 transition count 2741
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 469 place count 2204 transition count 2733
Iterating global reduction 2 with 1 rules applied. Total rules applied 470 place count 2204 transition count 2733
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 471 place count 2203 transition count 2732
Iterating global reduction 2 with 1 rules applied. Total rules applied 472 place count 2203 transition count 2732
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 473 place count 2202 transition count 2724
Iterating global reduction 2 with 1 rules applied. Total rules applied 474 place count 2202 transition count 2724
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 475 place count 2201 transition count 2716
Iterating global reduction 2 with 1 rules applied. Total rules applied 476 place count 2201 transition count 2716
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 477 place count 2200 transition count 2715
Iterating global reduction 2 with 1 rules applied. Total rules applied 478 place count 2200 transition count 2715
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 479 place count 2199 transition count 2707
Iterating global reduction 2 with 1 rules applied. Total rules applied 480 place count 2199 transition count 2707
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 481 place count 2198 transition count 2699
Iterating global reduction 2 with 1 rules applied. Total rules applied 482 place count 2198 transition count 2699
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 483 place count 2197 transition count 2698
Iterating global reduction 2 with 1 rules applied. Total rules applied 484 place count 2197 transition count 2698
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 485 place count 2196 transition count 2690
Iterating global reduction 2 with 1 rules applied. Total rules applied 486 place count 2196 transition count 2690
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 487 place count 2195 transition count 2682
Iterating global reduction 2 with 1 rules applied. Total rules applied 488 place count 2195 transition count 2682
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 489 place count 2194 transition count 2681
Iterating global reduction 2 with 1 rules applied. Total rules applied 490 place count 2194 transition count 2681
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 491 place count 2193 transition count 2673
Iterating global reduction 2 with 1 rules applied. Total rules applied 492 place count 2193 transition count 2673
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 493 place count 2192 transition count 2665
Iterating global reduction 2 with 1 rules applied. Total rules applied 494 place count 2192 transition count 2665
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 495 place count 2191 transition count 2664
Iterating global reduction 2 with 1 rules applied. Total rules applied 496 place count 2191 transition count 2664
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 497 place count 2190 transition count 2656
Iterating global reduction 2 with 1 rules applied. Total rules applied 498 place count 2190 transition count 2656
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 499 place count 2189 transition count 2648
Iterating global reduction 2 with 1 rules applied. Total rules applied 500 place count 2189 transition count 2648
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 501 place count 2188 transition count 2647
Iterating global reduction 2 with 1 rules applied. Total rules applied 502 place count 2188 transition count 2647
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 503 place count 2187 transition count 2639
Iterating global reduction 2 with 1 rules applied. Total rules applied 504 place count 2187 transition count 2639
Applied a total of 504 rules in 4054 ms. Remains 2187 /2430 variables (removed 243) and now considering 2639/3040 (removed 401) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10681464718953092294.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14883824990031589512.kers'
[2026-05-22 19:08:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10681464718953092294.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14883824990031589512.kers]
Culled 0 columns in 5 ms.
// Phase 1: matrix 2639 rows 2187 cols 8166 entries
Finished phase 1 with 1398 SingleSign rule and 551 generalized
[2026-05-22 19:08:19] [INFO ] Computed 238 invariants in 46 ms
Computed 238 P flows in 47 ms.
Exported basis to /tmp/petrispot-output-14883824990031589512.kers
Total runtime 50 ms.
[2026-05-22 19:08:21] [INFO ] Implicit Places using invariants in 2619 ms returned [2021, 2032, 2043, 2051, 2067, 2075, 2086, 2094, 2102, 2113]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 2708 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2177/2430 places, 2639/3040 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 2165 transition count 2627
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 2165 transition count 2627
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 34 place count 2155 transition count 2617
Iterating global reduction 0 with 10 rules applied. Total rules applied 44 place count 2155 transition count 2617
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 52 place count 2147 transition count 2609
Iterating global reduction 0 with 8 rules applied. Total rules applied 60 place count 2147 transition count 2609
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 64 place count 2143 transition count 2605
Iterating global reduction 0 with 4 rules applied. Total rules applied 68 place count 2143 transition count 2605
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 70 place count 2141 transition count 2603
Iterating global reduction 0 with 2 rules applied. Total rules applied 72 place count 2141 transition count 2603
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 74 place count 2139 transition count 2601
Iterating global reduction 0 with 2 rules applied. Total rules applied 76 place count 2139 transition count 2601
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 78 place count 2137 transition count 2599
Iterating global reduction 0 with 2 rules applied. Total rules applied 80 place count 2137 transition count 2599
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 82 place count 2135 transition count 2597
Iterating global reduction 0 with 2 rules applied. Total rules applied 84 place count 2135 transition count 2597
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 2134 transition count 2596
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 2134 transition count 2596
Applied a total of 86 rules in 1176 ms. Remains 2134 /2177 variables (removed 43) and now considering 2596/2639 (removed 43) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1521961878214553154.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-798594096368206849.kers'
[2026-05-22 19:08:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1521961878214553154.kers, --Pflows, --basisKERS=/tmp/petrispot-output-798594096368206849.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 2596 rows 2134 cols 8028 entries
Finished phase 1 with 1387 SingleSign rule and 519 generalized
[2026-05-22 19:08:22] [INFO ] Computed 228 invariants in 22 ms
Computed 228 P flows in 22 ms.
Exported basis to /tmp/petrispot-output-798594096368206849.kers
Total runtime 28 ms.
[2026-05-22 19:08:24] [INFO ] Implicit Places using invariants in 2028 ms returned []
[2026-05-22 19:08:24] [INFO ] Invariant cache hit.
[2026-05-22 19:08:32] [INFO ] Implicit Places using invariants and state equation in 7297 ms returned []
Implicit Place search using SMT with State Equation took 9359 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 2134/2430 places, 2596/3040 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 17314 ms. Remains : 2134/2430 places, 2596/3040 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2134/2134 places, 2596/2596 transitions.
Applied a total of 0 rules in 150 ms. Remains 2134 /2134 variables (removed 0) and now considering 2596/2596 (removed 0) transitions.
[2026-05-22 19:08:32] [INFO ] Invariant cache hit.
[2026-05-22 19:08:34] [INFO ] Implicit Places using invariants in 1913 ms returned []
[2026-05-22 19:08:34] [INFO ] Invariant cache hit.
[2026-05-22 19:08:41] [INFO ] Implicit Places using invariants and state equation in 7320 ms returned []
Implicit Place search using SMT with State Equation took 9253 ms to find 0 implicit places.
Running 2595 sub problems to find dead transitions.
[2026-05-22 19:08:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2133 variables, 137/137 constraints. Problems are: Problem set: 0 solved, 2595 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2133/4730 variables, and 137 constraints, problems are : Problem set: 0 solved, 2595 unsolved in 30115 ms.
Refiners :[Positive P Invariants (semi-flows): 0/49 constraints, Generalized P Invariants (flows): 137/179 constraints, State Equation: 0/2134 constraints, PredecessorRefiner: 2595/2595 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2595 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2133 variables, 137/137 constraints. Problems are: Problem set: 0 solved, 2595 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2133/4730 variables, and 137 constraints, problems are : Problem set: 0 solved, 2595 unsolved in 30060 ms.
Refiners :[Positive P Invariants (semi-flows): 0/49 constraints, Generalized P Invariants (flows): 137/179 constraints, State Equation: 0/2134 constraints, PredecessorRefiner: 0/2595 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61342ms problems are : Problem set: 0 solved, 2595 unsolved
Search for dead transitions found 0 dead transitions in 61369ms
Finished structural reductions in LTL mode , in 1 iterations and 70823 ms. Remains : 2134/2134 places, 2596/2596 transitions.
Support contains 42 out of 2134 places after structural reductions.
[2026-05-22 19:09:43] [INFO ] Flatten gal took : 180 ms
[2026-05-22 19:09:43] [INFO ] Flatten gal took : 114 ms
[2026-05-22 19:09:43] [INFO ] Input system was already deterministic with 2596 transitions.
Support contains 40 out of 2134 places (down from 42) after GAL structural reductions.
RANDOM walk for 40000 steps (67 resets) in 1569 ms. (25 steps per ms) remains 6/22 properties
BEST_FIRST walk for 40002 steps (9 resets) in 180 ms. (221 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (9 resets) in 131 ms. (303 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (9 resets) in 203 ms. (196 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (10 resets) in 332 ms. (120 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (11 resets) in 191 ms. (208 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (9 resets) in 190 ms. (209 steps per ms) remains 6/6 properties
[2026-05-22 19:09:44] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 167/177 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 653/830 variables, 42/49 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/830 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1231/2061 variables, 153/202 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2061 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 73/2134 variables, 26/228 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2134 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 2596/4730 variables, 2134/2362 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4730 variables, 0/2362 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/4730 variables, 0/2362 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4730/4730 variables, and 2362 constraints, problems are : Problem set: 0 solved, 6 unsolved in 3133 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, Generalized P Invariants (flows): 179/179 constraints, State Equation: 2134/2134 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 167/177 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 653/830 variables, 42/49 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/830 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1231/2061 variables, 153/202 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SMT process timed out in 8427ms, After SMT, problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 10 out of 2134 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2134/2134 places, 2596/2596 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 388 transitions
Trivial Post-agglo rules discarded 388 transitions
Performed 388 trivial Post agglomeration. Transition count delta: 388
Iterating post reduction 0 with 388 rules applied. Total rules applied 388 place count 2134 transition count 2208
Reduce places removed 388 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 393 rules applied. Total rules applied 781 place count 1746 transition count 2203
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 786 place count 1743 transition count 2201
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 788 place count 1741 transition count 2201
Performed 568 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 568 Pre rules applied. Total rules applied 788 place count 1741 transition count 1633
Deduced a syphon composed of 568 places in 3 ms
Ensure Unique test removed 51 places
Reduce places removed 619 places and 0 transitions.
Iterating global reduction 4 with 1187 rules applied. Total rules applied 1975 place count 1122 transition count 1633
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 4 with 38 rules applied. Total rules applied 2013 place count 1117 transition count 1600
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 5 with 33 rules applied. Total rules applied 2046 place count 1084 transition count 1600
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 19 Pre rules applied. Total rules applied 2046 place count 1084 transition count 1581
Deduced a syphon composed of 19 places in 4 ms
Ensure Unique test removed 18 places
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 6 with 56 rules applied. Total rules applied 2102 place count 1047 transition count 1581
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 17 Pre rules applied. Total rules applied 2102 place count 1047 transition count 1564
Deduced a syphon composed of 17 places in 3 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 6 with 34 rules applied. Total rules applied 2136 place count 1030 transition count 1564
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2137 place count 1029 transition count 1563
Iterating global reduction 6 with 1 rules applied. Total rules applied 2138 place count 1029 transition count 1563
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2139 place count 1028 transition count 1562
Iterating global reduction 6 with 1 rules applied. Total rules applied 2140 place count 1028 transition count 1562
Performed 174 Post agglomeration using F-continuation condition.Transition count delta: 174
Deduced a syphon composed of 174 places in 4 ms
Ensure Unique test removed 3 places
Reduce places removed 177 places and 0 transitions.
Iterating global reduction 6 with 351 rules applied. Total rules applied 2491 place count 851 transition count 1388
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 2495 place count 847 transition count 1384
Ensure Unique test removed 1 places
Iterating global reduction 6 with 5 rules applied. Total rules applied 2500 place count 846 transition count 1384
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 2500 place count 846 transition count 1383
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 2502 place count 845 transition count 1383
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 2504 place count 843 transition count 1381
Iterating global reduction 6 with 2 rules applied. Total rules applied 2506 place count 843 transition count 1381
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 2508 place count 843 transition count 1379
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2509 place count 842 transition count 1379
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 2511 place count 841 transition count 1384
Free-agglomeration rule applied 6 times.
Iterating global reduction 8 with 6 rules applied. Total rules applied 2517 place count 841 transition count 1378
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 2523 place count 835 transition count 1378
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 9 with 4 rules applied. Total rules applied 2527 place count 835 transition count 1374
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 2531 place count 831 transition count 1374
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 2535 place count 831 transition count 1374
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 2536 place count 830 transition count 1373
Reduce places removed 10 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 10 with 15 rules applied. Total rules applied 2551 place count 820 transition count 1368
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 11 with 5 rules applied. Total rules applied 2556 place count 815 transition count 1368
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 15 Pre rules applied. Total rules applied 2556 place count 815 transition count 1353
Deduced a syphon composed of 15 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 12 with 31 rules applied. Total rules applied 2587 place count 799 transition count 1353
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 12 with 6 rules applied. Total rules applied 2593 place count 793 transition count 1353
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 2593 place count 793 transition count 1352
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 2595 place count 792 transition count 1352
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 13 with 22 rules applied. Total rules applied 2617 place count 781 transition count 1341
Discarding 5 places :
Symmetric choice reduction at 13 with 5 rule applications. Total rules 2622 place count 776 transition count 1336
Iterating global reduction 13 with 5 rules applied. Total rules applied 2627 place count 776 transition count 1336
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 2628 place count 775 transition count 1335
Iterating global reduction 13 with 1 rules applied. Total rules applied 2629 place count 775 transition count 1335
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 2630 place count 775 transition count 1334
Free-agglomeration rule applied 4 times.
Iterating global reduction 14 with 4 rules applied. Total rules applied 2634 place count 775 transition count 1330
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 2638 place count 771 transition count 1330
Applied a total of 2638 rules in 927 ms. Remains 771 /2134 variables (removed 1363) and now considering 1330/2596 (removed 1266) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 927 ms. Remains : 771/2134 places, 1330/2596 transitions.
RANDOM walk for 40000 steps (478 resets) in 493 ms. (80 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40002 steps (69 resets) in 216 ms. (184 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (72 resets) in 189 ms. (210 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (85 resets) in 164 ms. (242 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (93 resets) in 91 ms. (434 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (84 resets) in 119 ms. (333 steps per ms) remains 5/5 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16204076836485907392.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16166398445592909456.kers'
[2026-05-22 19:09:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16204076836485907392.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16166398445592909456.kers]
Culling duplicate invariants (modulo rational): removing 13 columns.
Culled 13 columns in 0 ms.
// Phase 1: matrix 1330 rows 758 cols 5207 entries
Finished phase 1 with 199 SingleSign rule and 439 generalized
[2026-05-22 19:09:54] [INFO ] Computed 133 invariants in 10 ms
Computed 133 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-16166398445592909456.kers
Total runtime 11 ms.
[2026-05-22 19:09:54] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 58/67 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 60/127 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 23/150 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 202/352 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 82/434 variables, 16/65 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/434 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 2/436 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/436 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 208/644 variables, 30/97 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/644 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 59/703 variables, 14/111 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/703 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 28/731 variables, 5/116 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/731 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 40/771 variables, 17/133 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/771 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 1330/2101 variables, 771/904 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2101 variables, 1/905 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2101 variables, 0/905 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (OVERLAPS) 0/2101 variables, 0/905 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2101/2101 variables, and 905 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1654 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, Generalized P Invariants (flows): 80/80 constraints, State Equation: 771/771 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 58/67 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 60/127 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 23/150 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 202/352 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 82/434 variables, 16/65 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/434 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/434 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 2/436 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/436 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 208/644 variables, 30/98 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/644 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 59/703 variables, 14/112 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/703 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 28/731 variables, 5/117 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/731 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 40/771 variables, 17/134 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/771 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 1330/2101 variables, 771/905 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2101 variables, 1/906 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2101 variables, 5/911 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2101 variables, 1/912 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2101 variables, 0/912 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (OVERLAPS) 0/2101 variables, 0/912 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2101/2101 variables, and 912 constraints, problems are : Problem set: 0 solved, 5 unsolved in 4955 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, Generalized P Invariants (flows): 80/80 constraints, State Equation: 771/771 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6639ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 3539 ms.
Support contains 9 out of 771 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 771/771 places, 1330/1330 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 771 transition count 1329
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 770 transition count 1329
Applied a total of 2 rules in 37 ms. Remains 770 /771 variables (removed 1) and now considering 1329/1330 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 770/771 places, 1329/1330 transitions.
RANDOM walk for 40000 steps (472 resets) in 286 ms. (139 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (73 resets) in 106 ms. (373 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (76 resets) in 109 ms. (363 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (84 resets) in 112 ms. (354 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (92 resets) in 106 ms. (373 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (84 resets) in 92 ms. (430 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 240464 steps, run timeout after 3001 ms. (steps per millisecond=80 ) properties seen :0 out of 5
Probabilistic random walk after 240464 steps, saw 53158 distinct states, run finished after 3010 ms. (steps per millisecond=79 ) 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-9309075517040685685.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14898173114837716279.kers'
[2026-05-22 19:10:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9309075517040685685.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14898173114837716279.kers]
Culling duplicate invariants (modulo rational): removing 13 columns.
Culled 13 columns in 9 ms.
// Phase 1: matrix 1329 rows 757 cols 5205 entries
Finished phase 1 with 198 SingleSign rule and 439 generalized
[2026-05-22 19:10:08] [INFO ] Computed 133 invariants in 19 ms
Computed 133 P flows in 20 ms.
Exported basis to /tmp/petrispot-output-14898173114837716279.kers
Total runtime 22 ms.
[2026-05-22 19:10:08] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 58/67 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 60/127 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 23/150 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 202/352 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 82/434 variables, 16/65 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/434 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 2/436 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/436 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 207/643 variables, 30/97 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/643 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 59/702 variables, 14/111 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/702 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 28/730 variables, 5/116 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/730 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 40/770 variables, 17/133 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/770 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 1329/2099 variables, 770/903 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2099 variables, 1/904 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2099 variables, 0/904 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (OVERLAPS) 0/2099 variables, 0/904 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2099/2099 variables, and 904 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1654 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, Generalized P Invariants (flows): 80/80 constraints, State Equation: 770/770 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 58/67 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 60/127 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 23/150 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 202/352 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 82/434 variables, 16/65 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/434 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/434 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 2/436 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/436 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 207/643 variables, 30/98 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/643 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 59/702 variables, 14/112 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/702 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 28/730 variables, 5/117 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/730 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 40/770 variables, 17/134 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/770 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 1329/2099 variables, 770/904 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2099 variables, 1/905 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2099 variables, 5/910 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2099 variables, 1/911 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2099 variables, 0/911 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (OVERLAPS) 0/2099 variables, 0/911 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2099/2099 variables, and 911 constraints, problems are : Problem set: 0 solved, 5 unsolved in 4469 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, Generalized P Invariants (flows): 80/80 constraints, State Equation: 770/770 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6166ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 5012 ms.
Support contains 9 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1329/1329 transitions.
Applied a total of 0 rules in 27 ms. Remains 770 /770 variables (removed 0) and now considering 1329/1329 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 770/770 places, 1329/1329 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1329/1329 transitions.
Applied a total of 0 rules in 27 ms. Remains 770 /770 variables (removed 0) and now considering 1329/1329 (removed 0) transitions.
[2026-05-22 19:10:19] [INFO ] Invariant cache hit.
[2026-05-22 19:10:19] [INFO ] Implicit Places using invariants in 683 ms returned [2, 19, 20, 52, 70, 90, 108, 142, 148, 157, 158, 160, 177, 196, 265, 269, 270, 281, 282, 284, 301, 319, 388, 392, 393, 404, 405, 407, 424, 442, 480, 514, 518, 519, 530, 531, 533, 550, 568, 638, 642, 643, 646, 657, 658, 659, 677, 681, 699, 700, 701, 702, 723, 755, 758]
[2026-05-22 19:10:19] [INFO ] Actually due to overlaps returned [677, 659, 52, 177, 301, 424, 550, 160, 284, 407, 533, 157, 281, 404, 530, 657, 699, 158, 282, 405, 531, 658, 700, 2, 19, 269, 270, 392, 393, 518, 519, 642, 643, 196, 319, 442, 568, 681, 701, 20, 70, 90, 142, 480, 646, 702, 723, 755]
Discarding 48 places :
Implicit Place search using SMT only with invariants took 686 ms to find 48 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 722/770 places, 1329/1329 transitions.
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 716 transition count 1245
Reduce places removed 84 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 92 rules applied. Total rules applied 182 place count 632 transition count 1237
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 186 place count 628 transition count 1237
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 30 Pre rules applied. Total rules applied 186 place count 628 transition count 1207
Deduced a syphon composed of 30 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 61 rules applied. Total rules applied 247 place count 597 transition count 1207
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 259 place count 593 transition count 1199
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 267 place count 585 transition count 1199
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 271 place count 581 transition count 1195
Iterating global reduction 5 with 4 rules applied. Total rules applied 275 place count 581 transition count 1195
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 278 place count 581 transition count 1192
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 6 with 74 rules applied. Total rules applied 352 place count 544 transition count 1155
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 356 place count 540 transition count 1151
Iterating global reduction 6 with 4 rules applied. Total rules applied 360 place count 540 transition count 1151
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 364 place count 540 transition count 1147
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 368 place count 538 transition count 1148
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 369 place count 538 transition count 1147
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 370 place count 537 transition count 1147
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 8 with 10 rules applied. Total rules applied 380 place count 537 transition count 1137
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 8 with 11 rules applied. Total rules applied 391 place count 526 transition count 1137
Partial Free-agglomeration rule applied 14 times.
Drop transitions (Partial Free agglomeration) removed 14 transitions
Iterating global reduction 9 with 14 rules applied. Total rules applied 405 place count 526 transition count 1137
Applied a total of 405 rules in 193 ms. Remains 526 /722 variables (removed 196) and now considering 1137/1329 (removed 192) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13883772244742906753.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7298049244086432621.kers'
[2026-05-22 19:10:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13883772244742906753.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7298049244086432621.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 1137 rows 525 cols 4623 entries
Finished phase 1 with 155 SingleSign rule and 298 generalized
[2026-05-22 19:10:20] [INFO ] Computed 73 invariants in 8 ms
Computed 73 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-7298049244086432621.kers
Total runtime 9 ms.
[2026-05-22 19:10:20] [INFO ] Implicit Places using invariants in 517 ms returned [100, 106, 109, 111, 114, 117, 118, 172, 188, 194, 197, 199, 204, 205, 257, 274, 280, 283, 285, 290, 291, 344, 362, 368, 371, 373, 378, 379, 432, 448, 454, 457]
[2026-05-22 19:10:20] [INFO ] Actually due to overlaps returned [117, 204, 290, 378, 118, 205, 291, 379, 106, 111, 188, 194, 199, 274, 280, 285, 362, 368, 373, 448, 454, 100, 114, 172, 257, 344, 432, 457]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 519 ms to find 28 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 498/770 places, 1137/1329 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 481 transition count 1120
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 481 transition count 1120
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 38 place count 477 transition count 1116
Iterating global reduction 0 with 4 rules applied. Total rules applied 42 place count 477 transition count 1116
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 60 place count 468 transition count 1107
Free-agglomeration rule applied 14 times.
Iterating global reduction 0 with 14 rules applied. Total rules applied 74 place count 468 transition count 1093
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 88 place count 454 transition count 1093
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 92 place count 454 transition count 1089
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 96 place count 450 transition count 1089
Applied a total of 96 rules in 80 ms. Remains 450 /498 variables (removed 48) and now considering 1089/1137 (removed 48) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9280928638375554802.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12119411435313816336.kers'
[2026-05-22 19:10:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9280928638375554802.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12119411435313816336.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1089 rows 450 cols 4408 entries
Finished phase 1 with 110 SingleSign rule and 295 generalized
[2026-05-22 19:10:20] [INFO ] Computed 45 invariants in 8 ms
Computed 45 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-12119411435313816336.kers
Total runtime 10 ms.
[2026-05-22 19:10:21] [INFO ] Implicit Places using invariants in 533 ms returned []
[2026-05-22 19:10:21] [INFO ] Invariant cache hit.
[2026-05-22 19:10:22] [INFO ] Implicit Places using invariants and state equation in 1211 ms returned []
Implicit Place search using SMT with State Equation took 1755 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 450/770 places, 1089/1329 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 3261 ms. Remains : 450/770 places, 1089/1329 transitions.
RANDOM walk for 40000 steps (710 resets) in 220 ms. (180 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (124 resets) in 66 ms. (597 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (125 resets) in 62 ms. (634 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (161 resets) in 61 ms. (645 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (166 resets) in 46 ms. (851 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (173 resets) in 60 ms. (655 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 270513 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :0 out of 5
Probabilistic random walk after 270513 steps, saw 70760 distinct states, run finished after 3002 ms. (steps per millisecond=90 ) properties seen :0
[2026-05-22 19:10:25] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 124/133 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 27/160 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 183/343 variables, 17/28 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/343 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 60/403 variables, 7/35 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/403 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 47/450 variables, 10/45 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/450 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 1089/1539 variables, 450/495 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1539 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/1539 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1539/1539 variables, and 495 constraints, problems are : Problem set: 0 solved, 5 unsolved in 814 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 450/450 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 124/133 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 27/160 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 183/343 variables, 17/28 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/343 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/343 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 60/403 variables, 7/36 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/403 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 47/450 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/450 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 1089/1539 variables, 450/496 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1539 variables, 5/501 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1539 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/1539 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1539/1539 variables, and 501 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2281 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 450/450 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3136ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 4074 ms.
Support contains 9 out of 450 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 450/450 places, 1089/1089 transitions.
Applied a total of 0 rules in 14 ms. Remains 450 /450 variables (removed 0) and now considering 1089/1089 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 450/450 places, 1089/1089 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 450/450 places, 1089/1089 transitions.
Applied a total of 0 rules in 15 ms. Remains 450 /450 variables (removed 0) and now considering 1089/1089 (removed 0) transitions.
[2026-05-22 19:10:32] [INFO ] Invariant cache hit.
[2026-05-22 19:10:33] [INFO ] Implicit Places using invariants in 462 ms returned []
[2026-05-22 19:10:33] [INFO ] Invariant cache hit.
[2026-05-22 19:10:34] [INFO ] Implicit Places using invariants and state equation in 1097 ms returned []
Implicit Place search using SMT with State Equation took 1561 ms to find 0 implicit places.
[2026-05-22 19:10:34] [INFO ] Redundant transitions in 104 ms returned []
Running 1059 sub problems to find dead transitions.
[2026-05-22 19:10:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/448 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1059 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/448 variables, 26/39 constraints. Problems are: Problem set: 0 solved, 1059 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 448/1539 variables, and 39 constraints, problems are : Problem set: 0 solved, 1059 unsolved in 30064 ms.
Refiners :[Positive P Invariants (semi-flows): 13/18 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/450 constraints, PredecessorRefiner: 1059/1059 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1059 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/448 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1059 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/448 variables, 26/39 constraints. Problems are: Problem set: 0 solved, 1059 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/448 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1059 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 448/1539 variables, and 40 constraints, problems are : Problem set: 0 solved, 1059 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 13/18 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/450 constraints, PredecessorRefiner: 0/1059 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60392ms problems are : Problem set: 0 solved, 1059 unsolved
Search for dead transitions found 0 dead transitions in 60395ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62094 ms. Remains : 450/450 places, 1089/1089 transitions.
Computed a total of 86 stabilizing places and 86 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 2134 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2134/2134 places, 2596/2596 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 392 transitions
Trivial Post-agglo rules discarded 392 transitions
Performed 392 trivial Post agglomeration. Transition count delta: 392
Iterating post reduction 0 with 392 rules applied. Total rules applied 392 place count 2133 transition count 2203
Reduce places removed 392 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 397 rules applied. Total rules applied 789 place count 1741 transition count 2198
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 792 place count 1738 transition count 2198
Performed 576 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 576 Pre rules applied. Total rules applied 792 place count 1738 transition count 1622
Deduced a syphon composed of 576 places in 3 ms
Ensure Unique test removed 54 places
Reduce places removed 630 places and 0 transitions.
Iterating global reduction 3 with 1206 rules applied. Total rules applied 1998 place count 1108 transition count 1622
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 3 with 39 rules applied. Total rules applied 2037 place count 1103 transition count 1588
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 4 with 34 rules applied. Total rules applied 2071 place count 1069 transition count 1588
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 21 Pre rules applied. Total rules applied 2071 place count 1069 transition count 1567
Deduced a syphon composed of 21 places in 3 ms
Ensure Unique test removed 21 places
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 5 with 63 rules applied. Total rules applied 2134 place count 1027 transition count 1567
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 20 Pre rules applied. Total rules applied 2134 place count 1027 transition count 1547
Deduced a syphon composed of 20 places in 3 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 2174 place count 1007 transition count 1547
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 2176 place count 1005 transition count 1540
Iterating global reduction 5 with 2 rules applied. Total rules applied 2178 place count 1005 transition count 1540
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2179 place count 1004 transition count 1539
Iterating global reduction 5 with 1 rules applied. Total rules applied 2180 place count 1004 transition count 1539
Performed 170 Post agglomeration using F-continuation condition.Transition count delta: 170
Deduced a syphon composed of 170 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 171 places and 0 transitions.
Iterating global reduction 5 with 341 rules applied. Total rules applied 2521 place count 833 transition count 1369
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 2525 place count 829 transition count 1365
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 2530 place count 828 transition count 1365
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 2530 place count 828 transition count 1364
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 2532 place count 827 transition count 1364
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 2534 place count 825 transition count 1362
Iterating global reduction 5 with 2 rules applied. Total rules applied 2536 place count 825 transition count 1362
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 2538 place count 825 transition count 1360
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2539 place count 824 transition count 1360
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 2541 place count 823 transition count 1365
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 2543 place count 821 transition count 1363
Reduce places removed 10 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 7 with 15 rules applied. Total rules applied 2558 place count 811 transition count 1358
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 2563 place count 806 transition count 1358
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 15 Pre rules applied. Total rules applied 2563 place count 806 transition count 1343
Deduced a syphon composed of 15 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 9 with 31 rules applied. Total rules applied 2594 place count 790 transition count 1343
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 9 with 11 rules applied. Total rules applied 2605 place count 779 transition count 1343
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 2605 place count 779 transition count 1342
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 2607 place count 778 transition count 1342
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 10 with 32 rules applied. Total rules applied 2639 place count 762 transition count 1326
Discarding 10 places :
Symmetric choice reduction at 10 with 10 rule applications. Total rules 2649 place count 752 transition count 1316
Iterating global reduction 10 with 10 rules applied. Total rules applied 2659 place count 752 transition count 1316
Discarding 5 places :
Symmetric choice reduction at 10 with 5 rule applications. Total rules 2664 place count 747 transition count 1311
Iterating global reduction 10 with 5 rules applied. Total rules applied 2669 place count 747 transition count 1311
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 2674 place count 747 transition count 1306
Applied a total of 2674 rules in 564 ms. Remains 747 /2134 variables (removed 1387) and now considering 1306/2596 (removed 1290) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18445216095966526294.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7124871942302867261.kers'
[2026-05-22 19:11:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18445216095966526294.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7124871942302867261.kers]
Culling duplicate invariants (modulo rational): removing 17 columns.
Culled 17 columns in 0 ms.
// Phase 1: matrix 1306 rows 730 cols 5084 entries
Finished phase 1 with 167 SingleSign rule and 456 generalized
[2026-05-22 19:11:36] [INFO ] Computed 124 invariants in 23 ms
Computed 124 P flows in 27 ms.
Exported basis to /tmp/petrispot-output-7124871942302867261.kers
Total runtime 28 ms.
[2026-05-22 19:11:36] [INFO ] Implicit Places using invariants in 749 ms returned [1, 18, 19, 31, 48, 66, 86, 137, 147, 148, 150, 167, 185, 205, 256, 257, 269, 270, 272, 289, 307, 327, 379, 380, 392, 393, 395, 412, 430, 450, 501, 502, 514, 515, 517, 534, 552, 572, 623, 624, 627, 638, 639, 640, 658, 662, 680, 681, 682, 683, 705]
Discarding 51 places :
Implicit Place search using SMT only with invariants took 751 ms to find 51 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 696/2134 places, 1306/2596 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 87 transitions
Trivial Post-agglo rules discarded 87 transitions
Performed 87 trivial Post agglomeration. Transition count delta: 87
Iterating post reduction 0 with 87 rules applied. Total rules applied 87 place count 696 transition count 1219
Reduce places removed 87 places and 0 transitions.
Iterating post reduction 1 with 87 rules applied. Total rules applied 174 place count 609 transition count 1219
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 174 place count 609 transition count 1192
Deduced a syphon composed of 27 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 55 rules applied. Total rules applied 229 place count 581 transition count 1192
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 241 place count 577 transition count 1184
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 249 place count 569 transition count 1184
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 253 place count 565 transition count 1180
Iterating global reduction 4 with 4 rules applied. Total rules applied 257 place count 565 transition count 1180
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 260 place count 565 transition count 1177
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 5 with 76 rules applied. Total rules applied 336 place count 527 transition count 1139
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 340 place count 525 transition count 1140
Applied a total of 340 rules in 68 ms. Remains 525 /696 variables (removed 171) and now considering 1140/1306 (removed 166) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7504291462095328661.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1548942850392590017.kers'
[2026-05-22 19:11:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7504291462095328661.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1548942850392590017.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1140 rows 525 cols 4576 entries
Finished phase 1 with 160 SingleSign rule and 297 generalized
[2026-05-22 19:11:36] [INFO ] Computed 68 invariants in 8 ms
Computed 68 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-1548942850392590017.kers
Total runtime 24 ms.
[2026-05-22 19:11:37] [INFO ] Implicit Places using invariants in 757 ms returned [92, 100, 106, 181, 187, 192, 270, 276, 281, 358, 364, 369, 446, 452, 457, 522]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 764 ms to find 16 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 509/2134 places, 1140/2596 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 509 transition count 1139
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 508 transition count 1139
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 11 place count 499 transition count 1130
Iterating global reduction 2 with 9 rules applied. Total rules applied 20 place count 499 transition count 1130
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 29 place count 490 transition count 1121
Iterating global reduction 2 with 9 rules applied. Total rules applied 38 place count 490 transition count 1121
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 43 place count 485 transition count 1116
Iterating global reduction 2 with 5 rules applied. Total rules applied 48 place count 485 transition count 1116
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 484 transition count 1115
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 484 transition count 1115
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 483 transition count 1114
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 483 transition count 1114
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 62 place count 478 transition count 1109
Applied a total of 62 rules in 92 ms. Remains 478 /509 variables (removed 31) and now considering 1109/1140 (removed 31) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2614427597151210550.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2208143187143961638.kers'
[2026-05-22 19:11:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2614427597151210550.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2208143187143961638.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1109 rows 478 cols 4462 entries
Finished phase 1 with 149 SingleSign rule and 277 generalized
[2026-05-22 19:11:37] [INFO ] Computed 52 invariants in 25 ms
Computed 52 P flows in 39 ms.
Exported basis to /tmp/petrispot-output-2208143187143961638.kers
Total runtime 40 ms.
[2026-05-22 19:11:38] [INFO ] Implicit Places using invariants in 551 ms returned []
[2026-05-22 19:11:38] [INFO ] Invariant cache hit.
[2026-05-22 19:11:39] [INFO ] Implicit Places using invariants and state equation in 1309 ms returned []
Implicit Place search using SMT with State Equation took 1875 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 478/2134 places, 1109/2596 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 4127 ms. Remains : 478/2134 places, 1109/2596 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 222 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-05b-LTLCardinality-00
Stuttering criterion allowed to conclude after 49 steps with 0 reset in 2 ms.
FORMULA ASLink-PT-05b-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-05b-LTLCardinality-00 finished in 4515 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&&X((X(p1)&&G(p2))))))'
Support contains 4 out of 2134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2134/2134 places, 2596/2596 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 2130 transition count 2587
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 2130 transition count 2587
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 2130 transition count 2586
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 12 place count 2127 transition count 2583
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 2127 transition count 2583
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 2126 transition count 2582
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 2126 transition count 2582
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 2125 transition count 2581
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 2125 transition count 2581
Applied a total of 19 rules in 611 ms. Remains 2125 /2134 variables (removed 9) and now considering 2581/2596 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3830922285322196488.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2679597193034997834.kers'
[2026-05-22 19:11:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3830922285322196488.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2679597193034997834.kers]
Culled 0 columns in 5 ms.
// Phase 1: matrix 2581 rows 2125 cols 7983 entries
Finished phase 1 with 1376 SingleSign rule and 521 generalized
[2026-05-22 19:11:40] [INFO ] Computed 228 invariants in 52 ms
Computed 228 P flows in 58 ms.
Exported basis to /tmp/petrispot-output-2679597193034997834.kers
Total runtime 63 ms.
[2026-05-22 19:11:42] [INFO ] Implicit Places using invariants in 1738 ms returned [2038]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1757 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2124/2134 places, 2581/2596 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 2123 transition count 2580
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 2123 transition count 2580
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 2122 transition count 2579
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 2122 transition count 2579
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 2121 transition count 2578
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 2121 transition count 2578
Applied a total of 6 rules in 545 ms. Remains 2121 /2124 variables (removed 3) and now considering 2578/2581 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9860382435472424476.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10038657217893665699.kers'
[2026-05-22 19:11:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9860382435472424476.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10038657217893665699.kers]
Culled 0 columns in 5 ms.
// Phase 1: matrix 2578 rows 2121 cols 7972 entries
Finished phase 1 with 1376 SingleSign rule and 518 generalized
[2026-05-22 19:11:42] [INFO ] Computed 227 invariants in 55 ms
Computed 227 P flows in 56 ms.
Exported basis to /tmp/petrispot-output-10038657217893665699.kers
Total runtime 60 ms.
[2026-05-22 19:11:44] [INFO ] Implicit Places using invariants in 1680 ms returned []
[2026-05-22 19:11:44] [INFO ] Invariant cache hit.
[2026-05-22 19:11:50] [INFO ] Implicit Places using invariants and state equation in 5776 ms returned []
Implicit Place search using SMT with State Equation took 7460 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 2121/2134 places, 2578/2596 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 10375 ms. Remains : 2121/2134 places, 2578/2596 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(p0)&&G(p1)))&&p2)))'
Stuttering acceptance computed with spot in 337 ms :[true, (OR (NOT p2) (NOT p1) (NOT p0)), (OR (NOT p2) (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ASLink-PT-05b-LTLCardinality-02
Product exploration explored 100000 steps with 211 reset in 482 ms.
Product exploration explored 100000 steps with 174 reset in 488 ms.
Computed a total of 86 stabilizing places and 86 stable transitions
Computed a total of 86 stabilizing places and 86 stable transitions
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (78 resets) in 414 ms. (96 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (9 resets) in 363 ms. (109 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (11 resets) in 75 ms. (526 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (10 resets) in 69 ms. (571 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 122450 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :0 out of 3
Probabilistic random walk after 122450 steps, saw 24761 distinct states, run finished after 3007 ms. (steps per millisecond=40 ) properties seen :0
[2026-05-22 19:11:55] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 43/47 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 723/770 variables, 44/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/770 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1249/2019 variables, 149/195 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2019 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 102/2121 variables, 32/227 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2121 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 2578/4699 variables, 2121/2348 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4699 variables, 0/2348 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/4699 variables, 0/2348 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4699/4699 variables, and 2348 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2007 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, Generalized P Invariants (flows): 181/181 constraints, State Equation: 2121/2121 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 43/47 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 723/770 variables, 44/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/770 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1249/2019 variables, 149/195 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2019 variables, 3/198 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2019 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 102/2121 variables, 32/230 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2121 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 2578/4699 variables, 2121/2351 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4699 variables, 3/2354 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4699/4699 variables, and 2355 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, Generalized P Invariants (flows): 181/181 constraints, State Equation: 2121/2121 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7059ms problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 2121 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2121/2121 places, 2578/2578 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 387 transitions
Trivial Post-agglo rules discarded 387 transitions
Performed 387 trivial Post agglomeration. Transition count delta: 387
Iterating post reduction 0 with 387 rules applied. Total rules applied 387 place count 2121 transition count 2191
Reduce places removed 387 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 390 rules applied. Total rules applied 777 place count 1734 transition count 2188
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 781 place count 1732 transition count 2186
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 783 place count 1730 transition count 2186
Performed 571 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 571 Pre rules applied. Total rules applied 783 place count 1730 transition count 1615
Deduced a syphon composed of 571 places in 4 ms
Ensure Unique test removed 52 places
Reduce places removed 623 places and 0 transitions.
Iterating global reduction 4 with 1194 rules applied. Total rules applied 1977 place count 1107 transition count 1615
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 4 with 36 rules applied. Total rules applied 2013 place count 1103 transition count 1583
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 5 with 32 rules applied. Total rules applied 2045 place count 1071 transition count 1583
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 20 Pre rules applied. Total rules applied 2045 place count 1071 transition count 1563
Deduced a syphon composed of 20 places in 4 ms
Ensure Unique test removed 20 places
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 6 with 60 rules applied. Total rules applied 2105 place count 1031 transition count 1563
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 19 Pre rules applied. Total rules applied 2105 place count 1031 transition count 1544
Deduced a syphon composed of 19 places in 3 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 6 with 38 rules applied. Total rules applied 2143 place count 1012 transition count 1544
Performed 172 Post agglomeration using F-continuation condition.Transition count delta: 172
Deduced a syphon composed of 172 places in 2 ms
Ensure Unique test removed 3 places
Reduce places removed 175 places and 0 transitions.
Iterating global reduction 6 with 347 rules applied. Total rules applied 2490 place count 837 transition count 1372
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 2494 place count 833 transition count 1368
Ensure Unique test removed 1 places
Iterating global reduction 6 with 5 rules applied. Total rules applied 2499 place count 832 transition count 1368
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 2500 place count 832 transition count 1367
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2501 place count 831 transition count 1367
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 2501 place count 831 transition count 1366
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 2503 place count 830 transition count 1366
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 2505 place count 828 transition count 1364
Iterating global reduction 8 with 2 rules applied. Total rules applied 2507 place count 828 transition count 1364
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 2509 place count 828 transition count 1362
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 2510 place count 827 transition count 1362
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 2512 place count 826 transition count 1367
Free-agglomeration rule applied 6 times.
Iterating global reduction 10 with 6 rules applied. Total rules applied 2518 place count 826 transition count 1361
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 2524 place count 820 transition count 1361
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 11 with 4 rules applied. Total rules applied 2528 place count 820 transition count 1357
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 2532 place count 816 transition count 1357
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 12 with 5 rules applied. Total rules applied 2537 place count 816 transition count 1357
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 2538 place count 815 transition count 1356
Reduce places removed 10 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 12 with 15 rules applied. Total rules applied 2553 place count 805 transition count 1351
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 13 with 5 rules applied. Total rules applied 2558 place count 800 transition count 1351
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 15 Pre rules applied. Total rules applied 2558 place count 800 transition count 1336
Deduced a syphon composed of 15 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 14 with 31 rules applied. Total rules applied 2589 place count 784 transition count 1336
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 14 with 6 rules applied. Total rules applied 2595 place count 778 transition count 1336
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 1 Pre rules applied. Total rules applied 2595 place count 778 transition count 1335
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 2597 place count 777 transition count 1335
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 15 with 22 rules applied. Total rules applied 2619 place count 766 transition count 1324
Discarding 5 places :
Symmetric choice reduction at 15 with 5 rule applications. Total rules 2624 place count 761 transition count 1319
Iterating global reduction 15 with 5 rules applied. Total rules applied 2629 place count 761 transition count 1319
Free-agglomeration rule applied 5 times.
Iterating global reduction 15 with 5 rules applied. Total rules applied 2634 place count 761 transition count 1314
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 15 with 5 rules applied. Total rules applied 2639 place count 756 transition count 1314
Applied a total of 2639 rules in 549 ms. Remains 756 /2121 variables (removed 1365) and now considering 1314/2578 (removed 1264) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 550 ms. Remains : 756/2121 places, 1314/2578 transitions.
RANDOM walk for 40000 steps (469 resets) in 255 ms. (156 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (68 resets) in 86 ms. (459 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (71 resets) in 128 ms. (310 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (79 resets) in 102 ms. (388 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 150910 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :0 out of 3
Probabilistic random walk after 150910 steps, saw 33454 distinct states, run finished after 3001 ms. (steps per millisecond=50 ) 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-18100280539955585342.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11975780390122735328.kers'
[2026-05-22 19:12:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18100280539955585342.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11975780390122735328.kers]
Culling duplicate invariants (modulo rational): removing 12 columns.
Culled 12 columns in 1 ms.
// Phase 1: matrix 1314 rows 744 cols 5162 entries
Finished phase 1 with 206 SingleSign rule and 420 generalized
[2026-05-22 19:12:05] [INFO ] Computed 130 invariants in 13 ms
Computed 130 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-11975780390122735328.kers
Total runtime 15 ms.
[2026-05-22 19:12:06] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 8/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 20/32 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 6/38 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 143/181 variables, 17/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/181 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 64/245 variables, 15/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/245 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 28/273 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/273 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 174/447 variables, 28/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/447 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 97/544 variables, 15/84 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/544 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 28/572 variables, 5/89 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/572 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 111/683 variables, 23/112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/683 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 33/716 variables, 7/119 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/716 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 18/734 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/734 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 22/756 variables, 9/130 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/756 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 1314/2070 variables, 756/886 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2070 variables, 1/887 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2070 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (OVERLAPS) 0/2070 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2070/2070 variables, and 887 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1077 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, Generalized P Invariants (flows): 77/77 constraints, State Equation: 756/756 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 8/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 20/32 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 6/38 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 143/181 variables, 17/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/181 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 64/245 variables, 15/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/245 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 28/273 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/273 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 174/447 variables, 28/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/447 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 97/544 variables, 15/84 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/544 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 28/572 variables, 5/89 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/572 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 111/683 variables, 23/112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/683 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 33/716 variables, 7/119 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/716 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 18/734 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/734 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 22/756 variables, 9/130 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/756 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 1314/2070 variables, 756/886 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2070 variables, 1/887 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2070 variables, 3/890 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2070 variables, 0/890 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (OVERLAPS) 0/2070 variables, 0/890 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2070/2070 variables, and 890 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2507 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, Generalized P Invariants (flows): 77/77 constraints, State Equation: 756/756 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3685ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2216 ms.
Support contains 4 out of 756 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 756/756 places, 1314/1314 transitions.
Applied a total of 0 rules in 24 ms. Remains 756 /756 variables (removed 0) and now considering 1314/1314 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 756/756 places, 1314/1314 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 756/756 places, 1314/1314 transitions.
Applied a total of 0 rules in 23 ms. Remains 756 /756 variables (removed 0) and now considering 1314/1314 (removed 0) transitions.
[2026-05-22 19:12:11] [INFO ] Invariant cache hit.
[2026-05-22 19:12:12] [INFO ] Implicit Places using invariants in 1092 ms returned [2, 19, 20, 33, 50, 68, 138, 142, 151, 152, 154, 171, 189, 258, 262, 263, 274, 275, 277, 294, 312, 381, 385, 386, 397, 398, 400, 417, 435, 473, 507, 511, 512, 523, 524, 526, 543, 561, 630, 634, 635, 638, 649, 650, 651, 669, 690, 691, 692, 693, 741, 744]
[2026-05-22 19:12:13] [INFO ] Actually due to overlaps returned [669, 651, 50, 171, 294, 417, 543, 33, 154, 277, 400, 526, 151, 274, 397, 523, 649, 690, 152, 275, 398, 524, 650, 691, 2, 19, 262, 263, 385, 386, 511, 512, 634, 635, 68, 189, 312, 435, 561, 692, 20, 473, 638, 693, 741]
Discarding 45 places :
Implicit Place search using SMT only with invariants took 1110 ms to find 45 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 711/756 places, 1314/1314 transitions.
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 91 transitions
Trivial Post-agglo rules discarded 91 transitions
Performed 91 trivial Post agglomeration. Transition count delta: 91
Iterating post reduction 0 with 97 rules applied. Total rules applied 97 place count 705 transition count 1223
Reduce places removed 91 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 99 rules applied. Total rules applied 196 place count 614 transition count 1215
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 199 place count 611 transition count 1215
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 199 place count 611 transition count 1187
Deduced a syphon composed of 28 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 57 rules applied. Total rules applied 256 place count 582 transition count 1187
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 268 place count 578 transition count 1179
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 276 place count 570 transition count 1179
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 279 place count 567 transition count 1176
Iterating global reduction 5 with 3 rules applied. Total rules applied 282 place count 567 transition count 1176
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 285 place count 567 transition count 1173
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 2 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 6 with 72 rules applied. Total rules applied 357 place count 531 transition count 1137
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 362 place count 526 transition count 1132
Iterating global reduction 6 with 5 rules applied. Total rules applied 367 place count 526 transition count 1132
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 372 place count 526 transition count 1127
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 376 place count 524 transition count 1128
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 7 with 10 rules applied. Total rules applied 386 place count 524 transition count 1118
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 397 place count 513 transition count 1118
Partial Free-agglomeration rule applied 14 times.
Drop transitions (Partial Free agglomeration) removed 14 transitions
Iterating global reduction 8 with 14 rules applied. Total rules applied 411 place count 513 transition count 1118
Applied a total of 411 rules in 127 ms. Remains 513 /711 variables (removed 198) and now considering 1118/1314 (removed 196) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11644306197322695141.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18103418875063498011.kers'
[2026-05-22 19:12:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11644306197322695141.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18103418875063498011.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 1118 rows 512 cols 4559 entries
Finished phase 1 with 155 SingleSign rule and 285 generalized
[2026-05-22 19:12:13] [INFO ] Computed 73 invariants in 7 ms
Computed 73 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-18103418875063498011.kers
Total runtime 9 ms.
[2026-05-22 19:12:13] [INFO ] Implicit Places using invariants in 759 ms returned [75, 92, 98, 101, 103, 104, 107, 108, 161, 177, 183, 186, 188, 193, 194, 247, 263, 269, 272, 274, 279, 280, 333, 351, 357, 360, 362, 367, 368, 421, 437, 443, 446, 448]
[2026-05-22 19:12:13] [INFO ] Actually due to overlaps returned [107, 193, 279, 367, 108, 194, 280, 368, 98, 103, 177, 183, 188, 263, 269, 274, 351, 357, 362, 437, 443, 448, 75, 92, 104, 161, 247, 333, 421]
Discarding 29 places :
Implicit Place search using SMT only with invariants took 766 ms to find 29 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 484/756 places, 1118/1314 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 465 transition count 1099
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 465 transition count 1099
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 42 place count 461 transition count 1095
Iterating global reduction 0 with 4 rules applied. Total rules applied 46 place count 461 transition count 1095
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 66 place count 451 transition count 1085
Free-agglomeration rule applied 15 times.
Iterating global reduction 0 with 15 rules applied. Total rules applied 81 place count 451 transition count 1070
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 96 place count 436 transition count 1070
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 101 place count 436 transition count 1065
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 106 place count 431 transition count 1065
Applied a total of 106 rules in 88 ms. Remains 431 /484 variables (removed 53) and now considering 1065/1118 (removed 53) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4990154503503933926.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13500182916335610416.kers'
[2026-05-22 19:12:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4990154503503933926.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13500182916335610416.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1065 rows 431 cols 4344 entries
Finished phase 1 with 102 SingleSign rule and 285 generalized
[2026-05-22 19:12:14] [INFO ] Computed 44 invariants in 7 ms
Computed 44 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-13500182916335610416.kers
Total runtime 9 ms.
[2026-05-22 19:12:14] [INFO ] Implicit Places using invariants in 576 ms returned []
[2026-05-22 19:12:14] [INFO ] Invariant cache hit.
[2026-05-22 19:12:15] [INFO ] Implicit Places using invariants and state equation in 1374 ms returned []
Implicit Place search using SMT with State Equation took 1984 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 431/756 places, 1065/1314 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 4102 ms. Remains : 431/756 places, 1065/1314 transitions.
RANDOM walk for 40000 steps (771 resets) in 199 ms. (200 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (136 resets) in 51 ms. (769 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (121 resets) in 78 ms. (506 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (144 resets) in 88 ms. (449 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 129907 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :0 out of 3
Probabilistic random walk after 129907 steps, saw 34964 distinct states, run finished after 3013 ms. (steps per millisecond=43 ) properties seen :0
[2026-05-22 19:12:19] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 50/54 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 38/92 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 163/255 variables, 14/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 84/339 variables, 8/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/339 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 86/425 variables, 14/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/425 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/426 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/426 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 5/431 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/431 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 1065/1496 variables, 431/475 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1496 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/1496 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1496/1496 variables, and 475 constraints, problems are : Problem set: 0 solved, 3 unsolved in 581 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 431/431 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 50/54 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 38/92 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 163/255 variables, 14/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 84/339 variables, 8/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/339 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 86/425 variables, 14/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/425 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/426 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/426 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 5/431 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/431 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 1065/1496 variables, 431/475 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1496 variables, 3/478 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1496 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/1496 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1496/1496 variables, and 478 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1432 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 431/431 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2036ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 873 ms.
Support contains 4 out of 431 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 431/431 places, 1065/1065 transitions.
Applied a total of 0 rules in 14 ms. Remains 431 /431 variables (removed 0) and now considering 1065/1065 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 431/431 places, 1065/1065 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 431/431 places, 1065/1065 transitions.
Applied a total of 0 rules in 15 ms. Remains 431 /431 variables (removed 0) and now considering 1065/1065 (removed 0) transitions.
[2026-05-22 19:12:22] [INFO ] Invariant cache hit.
[2026-05-22 19:12:22] [INFO ] Implicit Places using invariants in 541 ms returned []
[2026-05-22 19:12:22] [INFO ] Invariant cache hit.
[2026-05-22 19:12:23] [INFO ] Implicit Places using invariants and state equation in 1114 ms returned []
Implicit Place search using SMT with State Equation took 1700 ms to find 0 implicit places.
[2026-05-22 19:12:23] [INFO ] Redundant transitions in 28 ms returned []
Running 1035 sub problems to find dead transitions.
[2026-05-22 19:12:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/429 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1035 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/429 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1035 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 429/1496 variables, and 38 constraints, problems are : Problem set: 0 solved, 1035 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/431 constraints, PredecessorRefiner: 1035/1035 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1035 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/429 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1035 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/429 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1035 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/429 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1035 unsolved
At refinement iteration 3 (OVERLAPS) 2/431 variables, 5/43 constraints. Problems are: Problem set: 0 solved, 1035 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/431 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1035 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 431/1496 variables, and 44 constraints, problems are : Problem set: 0 solved, 1035 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 0/431 constraints, PredecessorRefiner: 0/1035 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60393ms problems are : Problem set: 0 solved, 1035 unsolved
Search for dead transitions found 0 dead transitions in 60395ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62149 ms. Remains : 431/431 places, 1065/1065 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 21 ms. Remains 431 /431 variables (removed 0) and now considering 1065/1065 (removed 0) transitions.
Running SMT prover for 3 properties.
[2026-05-22 19:13:24] [INFO ] Invariant cache hit.
[2026-05-22 19:13:24] [INFO ] After 115ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2026-05-22 19:13:24] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2026-05-22 19:13:24] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 12 ms returned sat
[2026-05-22 19:13:25] [INFO ] After 734ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2026-05-22 19:13:25] [INFO ] After 940ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2026-05-22 19:13:25] [INFO ] After 1219ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 1380 ms.
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 305 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Knowledge-based reduction took 94327 ms.
Stuttering acceptance computed with spot in 236 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Support contains 4 out of 2121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2121/2121 places, 2578/2578 transitions.
Applied a total of 0 rules in 101 ms. Remains 2121 /2121 variables (removed 0) and now considering 2578/2578 (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-11987925410385447847.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3631985151454531119.kers'
[2026-05-22 19:13:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11987925410385447847.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3631985151454531119.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 2578 rows 2121 cols 7972 entries
Finished phase 1 with 1376 SingleSign rule and 518 generalized
[2026-05-22 19:13:26] [INFO ] Computed 227 invariants in 35 ms
Computed 227 P flows in 50 ms.
Exported basis to /tmp/petrispot-output-3631985151454531119.kers
Total runtime 52 ms.
[2026-05-22 19:13:28] [INFO ] Implicit Places using invariants in 2461 ms returned []
[2026-05-22 19:13:28] [INFO ] Invariant cache hit.
[2026-05-22 19:13:35] [INFO ] Implicit Places using invariants and state equation in 6790 ms returned []
Implicit Place search using SMT with State Equation took 9279 ms to find 0 implicit places.
Running 2577 sub problems to find dead transitions.
[2026-05-22 19:13:35] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/2120 variables, 134/134 constraints. Problems are: Problem set: 0 solved, 2577 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2120/4699 variables, and 134 constraints, problems are : Problem set: 0 solved, 2577 unsolved in 30068 ms.
Refiners :[Positive P Invariants (semi-flows): 0/46 constraints, Generalized P Invariants (flows): 134/181 constraints, State Equation: 0/2121 constraints, PredecessorRefiner: 2577/2577 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2577 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2120 variables, 134/134 constraints. Problems are: Problem set: 0 solved, 2577 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 2120/4699 variables, and 134 constraints, problems are : Problem set: 0 solved, 2577 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 0/46 constraints, Generalized P Invariants (flows): 134/181 constraints, State Equation: 0/2121 constraints, PredecessorRefiner: 0/2577 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61000ms problems are : Problem set: 0 solved, 2577 unsolved
Search for dead transitions found 0 dead transitions in 61014ms
Finished structural reductions in LTL mode , in 1 iterations and 70404 ms. Remains : 2121/2121 places, 2578/2578 transitions.
Computed a total of 86 stabilizing places and 86 stable transitions
Computed a total of 86 stabilizing places and 86 stable transitions
Knowledge based reduction with 1 factoid took 47 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (79 resets) in 252 ms. (158 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (9 resets) in 65 ms. (606 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (10 resets) in 52 ms. (754 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 116654 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :0 out of 3
Probabilistic random walk after 116654 steps, saw 23905 distinct states, run finished after 3001 ms. (steps per millisecond=38 ) properties seen :0
[2026-05-22 19:14:39] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 43/47 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 723/770 variables, 44/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/770 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1249/2019 variables, 149/195 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2019 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 102/2121 variables, 32/227 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2121 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 2578/4699 variables, 2121/2348 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4699 variables, 0/2348 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/4699 variables, 0/2348 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4699/4699 variables, and 2348 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2165 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, Generalized P Invariants (flows): 181/181 constraints, State Equation: 2121/2121 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 43/47 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 723/770 variables, 44/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/770 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1249/2019 variables, 149/195 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2019 variables, 3/198 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2019 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 102/2121 variables, 32/230 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2121 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 2578/4699 variables, 2121/2351 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4699 variables, 3/2354 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4699/4699 variables, and 2355 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5038 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, Generalized P Invariants (flows): 181/181 constraints, State Equation: 2121/2121 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7231ms problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 2121 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2121/2121 places, 2578/2578 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 387 transitions
Trivial Post-agglo rules discarded 387 transitions
Performed 387 trivial Post agglomeration. Transition count delta: 387
Iterating post reduction 0 with 387 rules applied. Total rules applied 387 place count 2121 transition count 2191
Reduce places removed 387 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 390 rules applied. Total rules applied 777 place count 1734 transition count 2188
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 781 place count 1732 transition count 2186
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 783 place count 1730 transition count 2186
Performed 571 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 571 Pre rules applied. Total rules applied 783 place count 1730 transition count 1615
Deduced a syphon composed of 571 places in 3 ms
Ensure Unique test removed 52 places
Reduce places removed 623 places and 0 transitions.
Iterating global reduction 4 with 1194 rules applied. Total rules applied 1977 place count 1107 transition count 1615
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 4 with 36 rules applied. Total rules applied 2013 place count 1103 transition count 1583
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 5 with 32 rules applied. Total rules applied 2045 place count 1071 transition count 1583
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 20 Pre rules applied. Total rules applied 2045 place count 1071 transition count 1563
Deduced a syphon composed of 20 places in 3 ms
Ensure Unique test removed 20 places
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 6 with 60 rules applied. Total rules applied 2105 place count 1031 transition count 1563
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 19 Pre rules applied. Total rules applied 2105 place count 1031 transition count 1544
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 6 with 38 rules applied. Total rules applied 2143 place count 1012 transition count 1544
Performed 172 Post agglomeration using F-continuation condition.Transition count delta: 172
Deduced a syphon composed of 172 places in 2 ms
Ensure Unique test removed 3 places
Reduce places removed 175 places and 0 transitions.
Iterating global reduction 6 with 347 rules applied. Total rules applied 2490 place count 837 transition count 1372
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 2494 place count 833 transition count 1368
Ensure Unique test removed 1 places
Iterating global reduction 6 with 5 rules applied. Total rules applied 2499 place count 832 transition count 1368
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 2500 place count 832 transition count 1367
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2501 place count 831 transition count 1367
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 2501 place count 831 transition count 1366
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 2503 place count 830 transition count 1366
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 2505 place count 828 transition count 1364
Iterating global reduction 8 with 2 rules applied. Total rules applied 2507 place count 828 transition count 1364
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 2509 place count 828 transition count 1362
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 2510 place count 827 transition count 1362
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 2512 place count 826 transition count 1367
Free-agglomeration rule applied 6 times.
Iterating global reduction 10 with 6 rules applied. Total rules applied 2518 place count 826 transition count 1361
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 2524 place count 820 transition count 1361
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 11 with 4 rules applied. Total rules applied 2528 place count 820 transition count 1357
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 2532 place count 816 transition count 1357
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 12 with 5 rules applied. Total rules applied 2537 place count 816 transition count 1357
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 2538 place count 815 transition count 1356
Reduce places removed 10 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 12 with 15 rules applied. Total rules applied 2553 place count 805 transition count 1351
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 13 with 5 rules applied. Total rules applied 2558 place count 800 transition count 1351
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 15 Pre rules applied. Total rules applied 2558 place count 800 transition count 1336
Deduced a syphon composed of 15 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 14 with 31 rules applied. Total rules applied 2589 place count 784 transition count 1336
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 14 with 6 rules applied. Total rules applied 2595 place count 778 transition count 1336
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 1 Pre rules applied. Total rules applied 2595 place count 778 transition count 1335
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 2597 place count 777 transition count 1335
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 15 with 22 rules applied. Total rules applied 2619 place count 766 transition count 1324
Discarding 5 places :
Symmetric choice reduction at 15 with 5 rule applications. Total rules 2624 place count 761 transition count 1319
Iterating global reduction 15 with 5 rules applied. Total rules applied 2629 place count 761 transition count 1319
Free-agglomeration rule applied 5 times.
Iterating global reduction 15 with 5 rules applied. Total rules applied 2634 place count 761 transition count 1314
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 15 with 5 rules applied. Total rules applied 2639 place count 756 transition count 1314
Applied a total of 2639 rules in 482 ms. Remains 756 /2121 variables (removed 1365) and now considering 1314/2578 (removed 1264) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 482 ms. Remains : 756/2121 places, 1314/2578 transitions.
RANDOM walk for 40000 steps (469 resets) in 288 ms. (138 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (71 resets) in 85 ms. (465 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (74 resets) in 87 ms. (454 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (74 resets) in 72 ms. (548 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 211918 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :0 out of 3
Probabilistic random walk after 211918 steps, saw 46412 distinct states, run finished after 3001 ms. (steps per millisecond=70 ) 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-14536034757903651953.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-924262163389032133.kers'
[2026-05-22 19:14:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14536034757903651953.kers, --Pflows, --basisKERS=/tmp/petrispot-output-924262163389032133.kers]
Culling duplicate invariants (modulo rational): removing 12 columns.
Culled 12 columns in 3 ms.
// Phase 1: matrix 1314 rows 744 cols 5162 entries
Finished phase 1 with 206 SingleSign rule and 420 generalized
[2026-05-22 19:14:50] [INFO ] Computed 130 invariants in 30 ms
Computed 130 P flows in 31 ms.
Exported basis to /tmp/petrispot-output-924262163389032133.kers
Total runtime 32 ms.
[2026-05-22 19:14:50] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 8/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 20/32 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 6/38 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 143/181 variables, 17/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/181 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 64/245 variables, 15/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/245 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 28/273 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/273 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 174/447 variables, 28/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/447 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 97/544 variables, 15/84 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/544 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 28/572 variables, 5/89 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/572 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 111/683 variables, 23/112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/683 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 33/716 variables, 7/119 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/716 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 18/734 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/734 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 22/756 variables, 9/130 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/756 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 1314/2070 variables, 756/886 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2070 variables, 1/887 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2070 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (OVERLAPS) 0/2070 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2070/2070 variables, and 887 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1292 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, Generalized P Invariants (flows): 77/77 constraints, State Equation: 756/756 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 8/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 20/32 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 6/38 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 143/181 variables, 17/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/181 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 64/245 variables, 15/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/245 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 28/273 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/273 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 174/447 variables, 28/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/447 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 97/544 variables, 15/84 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/544 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 28/572 variables, 5/89 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/572 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 111/683 variables, 23/112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/683 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 33/716 variables, 7/119 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/716 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 18/734 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/734 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 22/756 variables, 9/130 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/756 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 1314/2070 variables, 756/886 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2070 variables, 1/887 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2070 variables, 3/890 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2070 variables, 0/890 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (OVERLAPS) 0/2070 variables, 0/890 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2070/2070 variables, and 890 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2708 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, Generalized P Invariants (flows): 77/77 constraints, State Equation: 756/756 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4067ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2200 ms.
Support contains 4 out of 756 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 756/756 places, 1314/1314 transitions.
Applied a total of 0 rules in 23 ms. Remains 756 /756 variables (removed 0) and now considering 1314/1314 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 756/756 places, 1314/1314 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 756/756 places, 1314/1314 transitions.
Applied a total of 0 rules in 22 ms. Remains 756 /756 variables (removed 0) and now considering 1314/1314 (removed 0) transitions.
[2026-05-22 19:14:57] [INFO ] Invariant cache hit.
[2026-05-22 19:14:57] [INFO ] Implicit Places using invariants in 714 ms returned [2, 19, 20, 33, 50, 68, 138, 142, 151, 152, 154, 171, 189, 258, 262, 263, 274, 275, 277, 294, 312, 381, 385, 386, 397, 398, 400, 417, 435, 473, 507, 511, 512, 523, 524, 526, 543, 561, 630, 634, 635, 638, 649, 650, 651, 669, 690, 691, 692, 693, 741, 744]
[2026-05-22 19:14:57] [INFO ] Actually due to overlaps returned [669, 651, 50, 171, 294, 417, 543, 33, 154, 277, 400, 526, 151, 274, 397, 523, 649, 690, 152, 275, 398, 524, 650, 691, 2, 19, 262, 263, 385, 386, 511, 512, 634, 635, 68, 189, 312, 435, 561, 692, 20, 473, 638, 693, 741]
Discarding 45 places :
Implicit Place search using SMT only with invariants took 716 ms to find 45 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 711/756 places, 1314/1314 transitions.
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 91 transitions
Trivial Post-agglo rules discarded 91 transitions
Performed 91 trivial Post agglomeration. Transition count delta: 91
Iterating post reduction 0 with 97 rules applied. Total rules applied 97 place count 705 transition count 1223
Reduce places removed 91 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 99 rules applied. Total rules applied 196 place count 614 transition count 1215
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 199 place count 611 transition count 1215
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 199 place count 611 transition count 1187
Deduced a syphon composed of 28 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 57 rules applied. Total rules applied 256 place count 582 transition count 1187
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 268 place count 578 transition count 1179
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 276 place count 570 transition count 1179
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 279 place count 567 transition count 1176
Iterating global reduction 5 with 3 rules applied. Total rules applied 282 place count 567 transition count 1176
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 285 place count 567 transition count 1173
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 6 with 72 rules applied. Total rules applied 357 place count 531 transition count 1137
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 362 place count 526 transition count 1132
Iterating global reduction 6 with 5 rules applied. Total rules applied 367 place count 526 transition count 1132
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 372 place count 526 transition count 1127
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 376 place count 524 transition count 1128
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 7 with 10 rules applied. Total rules applied 386 place count 524 transition count 1118
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 397 place count 513 transition count 1118
Partial Free-agglomeration rule applied 14 times.
Drop transitions (Partial Free agglomeration) removed 14 transitions
Iterating global reduction 8 with 14 rules applied. Total rules applied 411 place count 513 transition count 1118
Applied a total of 411 rules in 140 ms. Remains 513 /711 variables (removed 198) and now considering 1118/1314 (removed 196) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-739048151747629135.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-963744713646773744.kers'
[2026-05-22 19:14:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-739048151747629135.kers, --Pflows, --basisKERS=/tmp/petrispot-output-963744713646773744.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 10 ms.
// Phase 1: matrix 1118 rows 512 cols 4559 entries
Finished phase 1 with 155 SingleSign rule and 285 generalized
[2026-05-22 19:14:58] [INFO ] Computed 73 invariants in 36 ms
Computed 73 P flows in 37 ms.
Exported basis to /tmp/petrispot-output-963744713646773744.kers
Total runtime 39 ms.
[2026-05-22 19:14:58] [INFO ] Implicit Places using invariants in 620 ms returned [75, 92, 98, 101, 103, 104, 107, 108, 161, 177, 183, 186, 188, 193, 194, 247, 263, 269, 272, 274, 279, 280, 333, 351, 357, 360, 362, 367, 368, 421, 437, 443, 446, 448]
[2026-05-22 19:14:58] [INFO ] Actually due to overlaps returned [107, 193, 279, 367, 108, 194, 280, 368, 98, 103, 177, 183, 188, 263, 269, 274, 351, 357, 362, 437, 443, 448, 75, 92, 104, 161, 247, 333, 421]
Discarding 29 places :
Implicit Place search using SMT only with invariants took 635 ms to find 29 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 484/756 places, 1118/1314 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 465 transition count 1099
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 465 transition count 1099
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 42 place count 461 transition count 1095
Iterating global reduction 0 with 4 rules applied. Total rules applied 46 place count 461 transition count 1095
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 66 place count 451 transition count 1085
Free-agglomeration rule applied 15 times.
Iterating global reduction 0 with 15 rules applied. Total rules applied 81 place count 451 transition count 1070
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 96 place count 436 transition count 1070
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 101 place count 436 transition count 1065
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 106 place count 431 transition count 1065
Applied a total of 106 rules in 83 ms. Remains 431 /484 variables (removed 53) and now considering 1065/1118 (removed 53) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11656898646614403332.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4598759242129062051.kers'
[2026-05-22 19:14:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11656898646614403332.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4598759242129062051.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1065 rows 431 cols 4344 entries
Finished phase 1 with 102 SingleSign rule and 285 generalized
[2026-05-22 19:14:58] [INFO ] Computed 44 invariants in 8 ms
Computed 44 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-4598759242129062051.kers
Total runtime 10 ms.
[2026-05-22 19:14:59] [INFO ] Implicit Places using invariants in 482 ms returned []
[2026-05-22 19:14:59] [INFO ] Invariant cache hit.
[2026-05-22 19:15:00] [INFO ] Implicit Places using invariants and state equation in 979 ms returned []
Implicit Place search using SMT with State Equation took 1463 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 431/756 places, 1065/1314 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 3059 ms. Remains : 431/756 places, 1065/1314 transitions.
RANDOM walk for 40000 steps (723 resets) in 245 ms. (162 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (132 resets) in 62 ms. (634 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (132 resets) in 67 ms. (588 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (134 resets) in 81 ms. (487 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 175077 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :0 out of 3
Probabilistic random walk after 175077 steps, saw 45641 distinct states, run finished after 3013 ms. (steps per millisecond=58 ) properties seen :0
[2026-05-22 19:15:03] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 50/54 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 38/92 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 163/255 variables, 14/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 84/339 variables, 8/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/339 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 86/425 variables, 14/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/425 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/426 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/426 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 5/431 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/431 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 1065/1496 variables, 431/475 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1496 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/1496 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1496/1496 variables, and 475 constraints, problems are : Problem set: 0 solved, 3 unsolved in 724 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 431/431 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 50/54 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 38/92 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 163/255 variables, 14/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 84/339 variables, 8/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/339 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 86/425 variables, 14/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/425 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/426 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/426 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 5/431 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/431 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 1065/1496 variables, 431/475 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1496 variables, 3/478 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1496 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/1496 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1496/1496 variables, and 478 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1523 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 431/431 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2283ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 877 ms.
Support contains 4 out of 431 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 431/431 places, 1065/1065 transitions.
Applied a total of 0 rules in 13 ms. Remains 431 /431 variables (removed 0) and now considering 1065/1065 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 431/431 places, 1065/1065 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 431/431 places, 1065/1065 transitions.
Applied a total of 0 rules in 14 ms. Remains 431 /431 variables (removed 0) and now considering 1065/1065 (removed 0) transitions.
[2026-05-22 19:15:06] [INFO ] Invariant cache hit.
[2026-05-22 19:15:07] [INFO ] Implicit Places using invariants in 583 ms returned []
[2026-05-22 19:15:07] [INFO ] Invariant cache hit.
[2026-05-22 19:15:08] [INFO ] Implicit Places using invariants and state equation in 1154 ms returned []
Implicit Place search using SMT with State Equation took 1761 ms to find 0 implicit places.
[2026-05-22 19:15:08] [INFO ] Redundant transitions in 38 ms returned []
Running 1035 sub problems to find dead transitions.
[2026-05-22 19:15:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/429 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1035 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/429 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1035 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 429/1496 variables, and 38 constraints, problems are : Problem set: 0 solved, 1035 unsolved in 30065 ms.
Refiners :[Positive P Invariants (semi-flows): 10/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/431 constraints, PredecessorRefiner: 1035/1035 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1035 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/429 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1035 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/429 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1035 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/429 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1035 unsolved
At refinement iteration 3 (OVERLAPS) 2/431 variables, 5/43 constraints. Problems are: Problem set: 0 solved, 1035 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/431 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1035 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 431/1496 variables, and 44 constraints, problems are : Problem set: 0 solved, 1035 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 0/431 constraints, PredecessorRefiner: 0/1035 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60442ms problems are : Problem set: 0 solved, 1035 unsolved
Search for dead transitions found 0 dead transitions in 60444ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62277 ms. Remains : 431/431 places, 1065/1065 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 13 ms. Remains 431 /431 variables (removed 0) and now considering 1065/1065 (removed 0) transitions.
Running SMT prover for 3 properties.
[2026-05-22 19:16:08] [INFO ] Invariant cache hit.
[2026-05-22 19:16:08] [INFO ] After 119ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2026-05-22 19:16:09] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2026-05-22 19:16:09] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 15 ms returned sat
[2026-05-22 19:16:10] [INFO ] After 949ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2026-05-22 19:16:10] [INFO ] After 1261ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2026-05-22 19:16:10] [INFO ] After 1641ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 1782 ms.
Knowledge based reduction with 1 factoid took 75 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 236 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Knowledge-based reduction took 94232 ms.
Stuttering acceptance computed with spot in 292 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 215 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 192 reset in 367 ms.
Product exploration explored 100000 steps with 206 reset in 389 ms.
Spot run failed in 100 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/ltsmin4903629430405319122
[2026-05-22 19:16:12] [INFO ] Built C files in 70ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4903629430405319122
Running compilation step : cd /tmp/ltsmin4903629430405319122;'/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/ltsmin4903629430405319122;'/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/ltsmin4903629430405319122;'/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 4 out of 2121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2121/2121 places, 2578/2578 transitions.
Applied a total of 0 rules in 152 ms. Remains 2121 /2121 variables (removed 0) and now considering 2578/2578 (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-10390862864383384538.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5305810528052979976.kers'
[2026-05-22 19:16:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10390862864383384538.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5305810528052979976.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 2578 rows 2121 cols 7972 entries
Finished phase 1 with 1376 SingleSign rule and 518 generalized
[2026-05-22 19:16:18] [INFO ] Computed 227 invariants in 18 ms
Computed 227 P flows in 43 ms.
Exported basis to /tmp/petrispot-output-5305810528052979976.kers
Total runtime 45 ms.
[2026-05-22 19:16:22] [INFO ] Implicit Places using invariants in 4146 ms returned []
[2026-05-22 19:16:22] [INFO ] Invariant cache hit.
[2026-05-22 19:16:28] [INFO ] Implicit Places using invariants and state equation in 6296 ms returned []
Implicit Place search using SMT with State Equation took 10450 ms to find 0 implicit places.
Running 2577 sub problems to find dead transitions.
[2026-05-22 19:16:28] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/2120 variables, 134/134 constraints. Problems are: Problem set: 0 solved, 2577 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2120/4699 variables, and 134 constraints, problems are : Problem set: 0 solved, 2577 unsolved in 30073 ms.
Refiners :[Positive P Invariants (semi-flows): 0/46 constraints, Generalized P Invariants (flows): 134/181 constraints, State Equation: 0/2121 constraints, PredecessorRefiner: 2577/2577 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2577 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2120 variables, 134/134 constraints. Problems are: Problem set: 0 solved, 2577 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2120/4699 variables, and 134 constraints, problems are : Problem set: 0 solved, 2577 unsolved in 30070 ms.
Refiners :[Positive P Invariants (semi-flows): 0/46 constraints, Generalized P Invariants (flows): 134/181 constraints, State Equation: 0/2121 constraints, PredecessorRefiner: 0/2577 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61039ms problems are : Problem set: 0 solved, 2577 unsolved
Search for dead transitions found 0 dead transitions in 61046ms
Finished structural reductions in LTL mode , in 1 iterations and 71673 ms. Remains : 2121/2121 places, 2578/2578 transitions.
Built C files in :
/tmp/ltsmin17792981674555405954
[2026-05-22 19:17:29] [INFO ] Built C files in 63ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17792981674555405954
Running compilation step : cd /tmp/ltsmin17792981674555405954;'/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/ltsmin17792981674555405954;'/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/ltsmin17792981674555405954;'/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 19:17:33] [INFO ] Flatten gal took : 68 ms
[2026-05-22 19:17:33] [INFO ] Flatten gal took : 64 ms
[2026-05-22 19:17:33] [INFO ] Time to serialize gal into /tmp/LTL5709038408718151307.gal : 23 ms
[2026-05-22 19:17:33] [INFO ] Time to serialize properties into /tmp/LTL10992381552206873957.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5709038408718151307.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9681647120718224949.hoa' '-atoms' '/tmp/LTL10992381552206873957.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/LTL10992381552206873957.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9681647120718224949.hoa
Detected timeout of ITS tools.
[2026-05-22 19:17:48] [INFO ] Flatten gal took : 49 ms
[2026-05-22 19:17:48] [INFO ] Flatten gal took : 49 ms
[2026-05-22 19:17:48] [INFO ] Time to serialize gal into /tmp/LTL1616025762523145621.gal : 19 ms
[2026-05-22 19:17:48] [INFO ] Time to serialize properties into /tmp/LTL12667617255760217838.ltl : 18 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/LTL1616025762523145621.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12667617255760217838.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("(((p2388==0)||(p279==1))||((p1445==0)||(p55==1)))"))&&(G("((p1445==0)||(p55==1))"))))&&("((p2388==0)||(p279==1))"))))
Formula 0 simplified : X(!"((p2388==0)||(p279==1))" | X(X!"(((p2388==0)||(p279==1))||((p1445==0)||(p55==1)))" | F!"((p1445==0)||(p55==1))"))
Detected timeout of ITS tools.
[2026-05-22 19:18:03] [INFO ] Flatten gal took : 90 ms
[2026-05-22 19:18:03] [INFO ] Applying decomposition
[2026-05-22 19:18:03] [INFO ] Flatten gal took : 53 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/graph1537121307864329653.txt' '-o' '/tmp/graph1537121307864329653.bin' '-w' '/tmp/graph1537121307864329653.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1537121307864329653.bin' '-l' '-1' '-v' '-w' '/tmp/graph1537121307864329653.weights' '-q' '0' '-e' '0.001'
[2026-05-22 19:18:04] [INFO ] Decomposing Gal with order
[2026-05-22 19:18:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 19:18:04] [INFO ] Removed a total of 1934 redundant transitions.
[2026-05-22 19:18:04] [INFO ] Flatten gal took : 214 ms
[2026-05-22 19:18:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 13 labels/synchronizations in 35 ms.
[2026-05-22 19:18:04] [INFO ] Time to serialize gal into /tmp/LTL1951259671137749302.gal : 34 ms
[2026-05-22 19:18:04] [INFO ] Time to serialize properties into /tmp/LTL5682475778348068097.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/LTL1951259671137749302.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5682475778348068097.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("(((i24.u794.p2388==0)||(i3.i0.i0.u91.p279==1))||((i15.i1.i0.u495.p1445==0)||(i0.i0.i0.u18.p55==1)))"))&&(G("((i15.i1.i0.u4...250
Formula 0 simplified : X(!"((i24.u794.p2388==0)||(i3.i0.i0.u91.p279==1))" | X(X!"(((i24.u794.p2388==0)||(i3.i0.i0.u91.p279==1))||((i15.i1.i0.u495.p1445==0)...240
Detected timeout of ITS tools.
Treatment of property ASLink-PT-05b-LTLCardinality-02 finished in 399901 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)||G(p1)))'
Support contains 3 out of 2134 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2134/2134 places, 2596/2596 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 392 transitions
Trivial Post-agglo rules discarded 392 transitions
Performed 392 trivial Post agglomeration. Transition count delta: 392
Iterating post reduction 0 with 392 rules applied. Total rules applied 392 place count 2133 transition count 2203
Reduce places removed 392 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 397 rules applied. Total rules applied 789 place count 1741 transition count 2198
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 792 place count 1738 transition count 2198
Performed 574 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 574 Pre rules applied. Total rules applied 792 place count 1738 transition count 1624
Deduced a syphon composed of 574 places in 4 ms
Ensure Unique test removed 54 places
Reduce places removed 628 places and 0 transitions.
Iterating global reduction 3 with 1202 rules applied. Total rules applied 1994 place count 1110 transition count 1624
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 3 with 39 rules applied. Total rules applied 2033 place count 1105 transition count 1590
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 4 with 34 rules applied. Total rules applied 2067 place count 1071 transition count 1590
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 21 Pre rules applied. Total rules applied 2067 place count 1071 transition count 1569
Deduced a syphon composed of 21 places in 2 ms
Ensure Unique test removed 21 places
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 5 with 63 rules applied. Total rules applied 2130 place count 1029 transition count 1569
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 20 Pre rules applied. Total rules applied 2130 place count 1029 transition count 1549
Deduced a syphon composed of 20 places in 3 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 2170 place count 1009 transition count 1549
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 2172 place count 1007 transition count 1542
Iterating global reduction 5 with 2 rules applied. Total rules applied 2174 place count 1007 transition count 1542
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2175 place count 1006 transition count 1541
Iterating global reduction 5 with 1 rules applied. Total rules applied 2176 place count 1006 transition count 1541
Performed 169 Post agglomeration using F-continuation condition.Transition count delta: 169
Deduced a syphon composed of 169 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 170 places and 0 transitions.
Iterating global reduction 5 with 339 rules applied. Total rules applied 2515 place count 836 transition count 1372
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 2519 place count 832 transition count 1368
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 2524 place count 831 transition count 1368
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 2524 place count 831 transition count 1367
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 2526 place count 830 transition count 1367
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 2528 place count 828 transition count 1365
Iterating global reduction 5 with 2 rules applied. Total rules applied 2530 place count 828 transition count 1365
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 2532 place count 828 transition count 1363
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2533 place count 827 transition count 1363
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 2535 place count 826 transition count 1368
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 2536 place count 826 transition count 1368
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 2538 place count 824 transition count 1366
Reduce places removed 10 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 7 with 15 rules applied. Total rules applied 2553 place count 814 transition count 1361
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 2558 place count 809 transition count 1361
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 15 Pre rules applied. Total rules applied 2558 place count 809 transition count 1346
Deduced a syphon composed of 15 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 9 with 31 rules applied. Total rules applied 2589 place count 793 transition count 1346
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 9 with 11 rules applied. Total rules applied 2600 place count 782 transition count 1346
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 2600 place count 782 transition count 1345
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 2602 place count 781 transition count 1345
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 10 with 32 rules applied. Total rules applied 2634 place count 765 transition count 1329
Discarding 10 places :
Symmetric choice reduction at 10 with 10 rule applications. Total rules 2644 place count 755 transition count 1319
Iterating global reduction 10 with 10 rules applied. Total rules applied 2654 place count 755 transition count 1319
Discarding 5 places :
Symmetric choice reduction at 10 with 5 rule applications. Total rules 2659 place count 750 transition count 1314
Iterating global reduction 10 with 5 rules applied. Total rules applied 2664 place count 750 transition count 1314
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 2669 place count 750 transition count 1309
Applied a total of 2669 rules in 486 ms. Remains 750 /2134 variables (removed 1384) and now considering 1309/2596 (removed 1287) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12478079326642722212.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1738128202484214391.kers'
[2026-05-22 19:18:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12478079326642722212.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1738128202484214391.kers]
Culling duplicate invariants (modulo rational): removing 17 columns.
Culled 17 columns in 2 ms.
// Phase 1: matrix 1309 rows 733 cols 5090 entries
Finished phase 1 with 170 SingleSign rule and 456 generalized
[2026-05-22 19:18:20] [INFO ] Computed 124 invariants in 31 ms
Computed 124 P flows in 32 ms.
Exported basis to /tmp/petrispot-output-1738128202484214391.kers
Total runtime 35 ms.
[2026-05-22 19:18:21] [INFO ] Implicit Places using invariants in 746 ms returned [1, 18, 19, 31, 48, 66, 86, 137, 147, 148, 150, 167, 185, 205, 256, 257, 269, 270, 272, 289, 307, 327, 380, 381, 393, 394, 396, 413, 431, 451, 502, 503, 515, 516, 518, 535, 553, 573, 626, 627, 630, 641, 642, 643, 661, 665, 683, 684, 685, 686, 708]
Discarding 51 places :
Implicit Place search using SMT only with invariants took 748 ms to find 51 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 699/2134 places, 1309/2596 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 89 transitions
Trivial Post-agglo rules discarded 89 transitions
Performed 89 trivial Post agglomeration. Transition count delta: 89
Iterating post reduction 0 with 89 rules applied. Total rules applied 89 place count 699 transition count 1220
Reduce places removed 89 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 92 rules applied. Total rules applied 181 place count 610 transition count 1217
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 184 place count 607 transition count 1217
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 184 place count 607 transition count 1191
Deduced a syphon composed of 26 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 53 rules applied. Total rules applied 237 place count 580 transition count 1191
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 249 place count 576 transition count 1183
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 257 place count 568 transition count 1183
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 261 place count 564 transition count 1179
Iterating global reduction 5 with 4 rules applied. Total rules applied 265 place count 564 transition count 1179
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 268 place count 564 transition count 1176
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 6 with 80 rules applied. Total rules applied 348 place count 524 transition count 1136
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 352 place count 522 transition count 1137
Applied a total of 352 rules in 61 ms. Remains 522 /699 variables (removed 177) and now considering 1137/1309 (removed 172) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13394343778596620596.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17803079372547202999.kers'
[2026-05-22 19:18:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13394343778596620596.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17803079372547202999.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1137 rows 522 cols 4570 entries
Finished phase 1 with 157 SingleSign rule and 297 generalized
[2026-05-22 19:18:21] [INFO ] Computed 68 invariants in 8 ms
Computed 68 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-17803079372547202999.kers
Total runtime 12 ms.
[2026-05-22 19:18:21] [INFO ] Implicit Places using invariants in 608 ms returned [88, 94, 99, 174, 180, 185, 264, 270, 353, 359, 364, 441, 449, 454, 519]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 622 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 507/2134 places, 1137/2596 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 507 transition count 1136
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 506 transition count 1136
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 11 place count 497 transition count 1127
Iterating global reduction 2 with 9 rules applied. Total rules applied 20 place count 497 transition count 1127
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 29 place count 488 transition count 1118
Iterating global reduction 2 with 9 rules applied. Total rules applied 38 place count 488 transition count 1118
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 43 place count 483 transition count 1113
Iterating global reduction 2 with 5 rules applied. Total rules applied 48 place count 483 transition count 1113
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 58 place count 478 transition count 1108
Applied a total of 58 rules in 57 ms. Remains 478 /507 variables (removed 29) and now considering 1108/1137 (removed 29) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7542210929890802519.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14885925193086650273.kers'
[2026-05-22 19:18:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7542210929890802519.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14885925193086650273.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1108 rows 478 cols 4462 entries
Finished phase 1 with 149 SingleSign rule and 276 generalized
[2026-05-22 19:18:21] [INFO ] Computed 53 invariants in 7 ms
Computed 53 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-14885925193086650273.kers
Total runtime 9 ms.
[2026-05-22 19:18:22] [INFO ] Implicit Places using invariants in 582 ms returned []
[2026-05-22 19:18:22] [INFO ] Invariant cache hit.
[2026-05-22 19:18:23] [INFO ] Implicit Places using invariants and state equation in 1144 ms returned []
Implicit Place search using SMT with State Equation took 1767 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 478/2134 places, 1108/2596 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 3741 ms. Remains : 478/2134 places, 1108/2596 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)||G(p1)))'
Stuttering acceptance computed with spot in 192 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ASLink-PT-05b-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 13706 steps with 184 reset in 33 ms.
FORMULA ASLink-PT-05b-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-05b-LTLCardinality-03 finished in 4040 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 (p1&&G(!p0)&&X(p2)))))'
Support contains 6 out of 2134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2134/2134 places, 2596/2596 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 2131 transition count 2588
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 2131 transition count 2588
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 2131 transition count 2587
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 2129 transition count 2585
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 2129 transition count 2585
Applied a total of 11 rules in 351 ms. Remains 2129 /2134 variables (removed 5) and now considering 2585/2596 (removed 11) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4635998865561325980.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5094831813255798456.kers'
[2026-05-22 19:18:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4635998865561325980.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5094831813255798456.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 2585 rows 2129 cols 7994 entries
Finished phase 1 with 1379 SingleSign rule and 522 generalized
[2026-05-22 19:18:24] [INFO ] Computed 228 invariants in 19 ms
Computed 228 P flows in 20 ms.
Exported basis to /tmp/petrispot-output-5094831813255798456.kers
Total runtime 25 ms.
[2026-05-22 19:18:25] [INFO ] Implicit Places using invariants in 1669 ms returned [2040]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1676 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2128/2134 places, 2585/2596 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 2127 transition count 2584
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 2127 transition count 2584
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 2126 transition count 2583
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 2126 transition count 2583
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 2125 transition count 2582
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 2125 transition count 2582
Applied a total of 6 rules in 432 ms. Remains 2125 /2128 variables (removed 3) and now considering 2582/2585 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1438193661359494391.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10821094558437445388.kers'
[2026-05-22 19:18:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1438193661359494391.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10821094558437445388.kers]
Culled 0 columns in 5 ms.
// Phase 1: matrix 2582 rows 2125 cols 7983 entries
Finished phase 1 with 1379 SingleSign rule and 519 generalized
[2026-05-22 19:18:26] [INFO ] Computed 227 invariants in 50 ms
Computed 227 P flows in 50 ms.
Exported basis to /tmp/petrispot-output-10821094558437445388.kers
Total runtime 67 ms.
[2026-05-22 19:18:28] [INFO ] Implicit Places using invariants in 1706 ms returned []
[2026-05-22 19:18:28] [INFO ] Invariant cache hit.
[2026-05-22 19:18:35] [INFO ] Implicit Places using invariants and state equation in 7344 ms returned []
Implicit Place search using SMT with State Equation took 9067 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 2125/2134 places, 2582/2596 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 11526 ms. Remains : 2125/2134 places, 2582/2596 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 (G(!p0)&&X(p1)&&p2))))'
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p2) (NOT p1) p0), true, (OR (NOT p2) (NOT p1) p0)]
Running random walk in product with property : ASLink-PT-05b-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 299 steps with 0 reset in 2 ms.
FORMULA ASLink-PT-05b-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-05b-LTLCardinality-05 finished in 11755 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 p1)&&X(F(p2))))'
Support contains 5 out of 2134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2134/2134 places, 2596/2596 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 2131 transition count 2593
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 2131 transition count 2593
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 2131 transition count 2592
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 2129 transition count 2590
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 2129 transition count 2590
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 2128 transition count 2589
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 2128 transition count 2589
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 2127 transition count 2588
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 2127 transition count 2588
Applied a total of 15 rules in 595 ms. Remains 2127 /2134 variables (removed 7) and now considering 2588/2596 (removed 8) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7257126867397006401.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17758008320619181056.kers'
[2026-05-22 19:18:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7257126867397006401.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17758008320619181056.kers]
Culled 0 columns in 5 ms.
// Phase 1: matrix 2588 rows 2127 cols 8009 entries
Finished phase 1 with 1380 SingleSign rule and 519 generalized
[2026-05-22 19:18:36] [INFO ] Computed 228 invariants in 52 ms
Computed 228 P flows in 52 ms.
Exported basis to /tmp/petrispot-output-17758008320619181056.kers
Total runtime 55 ms.
[2026-05-22 19:18:38] [INFO ] Implicit Places using invariants in 1887 ms returned [2040]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1891 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2126/2134 places, 2588/2596 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 2125 transition count 2587
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 2125 transition count 2587
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 2124 transition count 2586
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 2124 transition count 2586
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 2123 transition count 2585
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 2123 transition count 2585
Applied a total of 6 rules in 475 ms. Remains 2123 /2126 variables (removed 3) and now considering 2585/2588 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15831029283060931043.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-434177399942062994.kers'
[2026-05-22 19:18:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15831029283060931043.kers, --Pflows, --basisKERS=/tmp/petrispot-output-434177399942062994.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 2585 rows 2123 cols 7998 entries
Finished phase 1 with 1380 SingleSign rule and 516 generalized
[2026-05-22 19:18:38] [INFO ] Computed 227 invariants in 20 ms
Computed 227 P flows in 20 ms.
Exported basis to /tmp/petrispot-output-434177399942062994.kers
Total runtime 22 ms.
[2026-05-22 19:18:40] [INFO ] Implicit Places using invariants in 1636 ms returned []
[2026-05-22 19:18:40] [INFO ] Invariant cache hit.
[2026-05-22 19:18:48] [INFO ] Implicit Places using invariants and state equation in 7965 ms returned []
Implicit Place search using SMT with State Equation took 9640 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 2123/2134 places, 2585/2596 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 12605 ms. Remains : 2123/2134 places, 2585/2596 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 p1)&&X(F(p2))))'
Stuttering acceptance computed with spot in 174 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : ASLink-PT-05b-LTLCardinality-06
Stuttering criterion allowed to conclude after 297 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-05b-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-05b-LTLCardinality-06 finished in 12851 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)))'
Support contains 2 out of 2134 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2134/2134 places, 2596/2596 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 394 transitions
Trivial Post-agglo rules discarded 394 transitions
Performed 394 trivial Post agglomeration. Transition count delta: 394
Iterating post reduction 0 with 394 rules applied. Total rules applied 394 place count 2133 transition count 2201
Reduce places removed 394 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 399 rules applied. Total rules applied 793 place count 1739 transition count 2196
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 796 place count 1736 transition count 2196
Performed 573 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 573 Pre rules applied. Total rules applied 796 place count 1736 transition count 1623
Deduced a syphon composed of 573 places in 3 ms
Ensure Unique test removed 53 places
Reduce places removed 626 places and 0 transitions.
Iterating global reduction 3 with 1199 rules applied. Total rules applied 1995 place count 1110 transition count 1623
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 3 with 39 rules applied. Total rules applied 2034 place count 1104 transition count 1590
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 4 with 33 rules applied. Total rules applied 2067 place count 1071 transition count 1590
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 21 Pre rules applied. Total rules applied 2067 place count 1071 transition count 1569
Deduced a syphon composed of 21 places in 3 ms
Ensure Unique test removed 21 places
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 5 with 63 rules applied. Total rules applied 2130 place count 1029 transition count 1569
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 20 Pre rules applied. Total rules applied 2130 place count 1029 transition count 1549
Deduced a syphon composed of 20 places in 3 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 2170 place count 1009 transition count 1549
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 2172 place count 1007 transition count 1542
Iterating global reduction 5 with 2 rules applied. Total rules applied 2174 place count 1007 transition count 1542
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2175 place count 1006 transition count 1541
Iterating global reduction 5 with 1 rules applied. Total rules applied 2176 place count 1006 transition count 1541
Performed 170 Post agglomeration using F-continuation condition.Transition count delta: 170
Deduced a syphon composed of 170 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 171 places and 0 transitions.
Iterating global reduction 5 with 341 rules applied. Total rules applied 2517 place count 835 transition count 1371
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 2521 place count 831 transition count 1367
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 2526 place count 830 transition count 1367
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 2526 place count 830 transition count 1366
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 2528 place count 829 transition count 1366
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 2530 place count 827 transition count 1364
Iterating global reduction 5 with 2 rules applied. Total rules applied 2532 place count 827 transition count 1364
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 2534 place count 827 transition count 1362
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2535 place count 826 transition count 1362
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 2537 place count 825 transition count 1367
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 2539 place count 823 transition count 1365
Reduce places removed 10 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 7 with 15 rules applied. Total rules applied 2554 place count 813 transition count 1360
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 2559 place count 808 transition count 1360
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 15 Pre rules applied. Total rules applied 2559 place count 808 transition count 1345
Deduced a syphon composed of 15 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 9 with 31 rules applied. Total rules applied 2590 place count 792 transition count 1345
Discarding 10 places :
Implicit places reduction removed 10 places
Iterating post reduction 9 with 10 rules applied. Total rules applied 2600 place count 782 transition count 1345
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 2600 place count 782 transition count 1344
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 2602 place count 781 transition count 1344
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 10 with 30 rules applied. Total rules applied 2632 place count 766 transition count 1329
Discarding 9 places :
Symmetric choice reduction at 10 with 9 rule applications. Total rules 2641 place count 757 transition count 1320
Iterating global reduction 10 with 9 rules applied. Total rules applied 2650 place count 757 transition count 1320
Discarding 5 places :
Symmetric choice reduction at 10 with 5 rule applications. Total rules 2655 place count 752 transition count 1315
Iterating global reduction 10 with 5 rules applied. Total rules applied 2660 place count 752 transition count 1315
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 2665 place count 752 transition count 1310
Applied a total of 2665 rules in 441 ms. Remains 752 /2134 variables (removed 1382) and now considering 1310/2596 (removed 1286) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13754291128097005073.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5322861917324778690.kers'
[2026-05-22 19:18:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13754291128097005073.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5322861917324778690.kers]
Culling duplicate invariants (modulo rational): removing 16 columns.
Culled 16 columns in 2 ms.
// Phase 1: matrix 1310 rows 736 cols 5106 entries
Finished phase 1 with 160 SingleSign rule and 467 generalized
[2026-05-22 19:18:48] [INFO ] Computed 125 invariants in 31 ms
Computed 125 P flows in 32 ms.
Exported basis to /tmp/petrispot-output-5322861917324778690.kers
Total runtime 35 ms.
[2026-05-22 19:18:49] [INFO ] Implicit Places using invariants in 962 ms returned [1, 18, 19, 31, 48, 66, 86, 137, 147, 148, 150, 167, 185, 205, 256, 257, 269, 270, 272, 289, 307, 326, 378, 379, 391, 392, 394, 411, 429, 449, 498, 505, 506, 518, 519, 521, 538, 556, 576, 628, 629, 632, 643, 644, 645, 663, 667, 685, 686, 687, 688, 710]
Discarding 52 places :
Implicit Place search using SMT only with invariants took 977 ms to find 52 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 700/2134 places, 1310/2596 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 700 transition count 1220
Reduce places removed 90 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 91 rules applied. Total rules applied 181 place count 610 transition count 1219
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 182 place count 609 transition count 1219
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 182 place count 609 transition count 1192
Deduced a syphon composed of 27 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 55 rules applied. Total rules applied 237 place count 581 transition count 1192
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 249 place count 577 transition count 1184
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 257 place count 569 transition count 1184
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 261 place count 565 transition count 1180
Iterating global reduction 5 with 4 rules applied. Total rules applied 265 place count 565 transition count 1180
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 268 place count 565 transition count 1177
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 6 with 84 rules applied. Total rules applied 352 place count 523 transition count 1135
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 356 place count 521 transition count 1136
Applied a total of 356 rules in 67 ms. Remains 521 /700 variables (removed 179) and now considering 1136/1310 (removed 174) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6395755469014560684.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3743575830634566524.kers'
[2026-05-22 19:18:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6395755469014560684.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3743575830634566524.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1136 rows 521 cols 4568 entries
Finished phase 1 with 156 SingleSign rule and 297 generalized
[2026-05-22 19:18:50] [INFO ] Computed 68 invariants in 28 ms
Computed 68 P flows in 29 ms.
Exported basis to /tmp/petrispot-output-3743575830634566524.kers
Total runtime 30 ms.
[2026-05-22 19:18:50] [INFO ] Implicit Places using invariants in 666 ms returned [88, 94, 99, 174, 180, 185, 262, 268, 273, 350, 356, 361, 442, 448, 453, 518]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 690 ms to find 16 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 505/2134 places, 1136/2596 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 505 transition count 1135
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 504 transition count 1135
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 12 place count 494 transition count 1125
Iterating global reduction 2 with 10 rules applied. Total rules applied 22 place count 494 transition count 1125
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 32 place count 484 transition count 1115
Iterating global reduction 2 with 10 rules applied. Total rules applied 42 place count 484 transition count 1115
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 47 place count 479 transition count 1110
Iterating global reduction 2 with 5 rules applied. Total rules applied 52 place count 479 transition count 1110
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 62 place count 474 transition count 1105
Applied a total of 62 rules in 60 ms. Remains 474 /505 variables (removed 31) and now considering 1105/1136 (removed 31) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17709513859539779394.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8019255543714163335.kers'
[2026-05-22 19:18:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17709513859539779394.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8019255543714163335.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1105 rows 474 cols 4453 entries
Finished phase 1 with 146 SingleSign rule and 276 generalized
[2026-05-22 19:18:50] [INFO ] Computed 52 invariants in 21 ms
Computed 52 P flows in 21 ms.
Exported basis to /tmp/petrispot-output-8019255543714163335.kers
Total runtime 24 ms.
[2026-05-22 19:18:51] [INFO ] Implicit Places using invariants in 665 ms returned []
[2026-05-22 19:18:51] [INFO ] Invariant cache hit.
[2026-05-22 19:18:52] [INFO ] Implicit Places using invariants and state equation in 1107 ms returned []
Implicit Place search using SMT with State Equation took 1778 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 474/2134 places, 1105/2596 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 4013 ms. Remains : 474/2134 places, 1105/2596 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 84 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-05b-LTLCardinality-08
Stuttering criterion allowed to conclude after 89 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-05b-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-05b-LTLCardinality-08 finished in 4145 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(F(p0)))'
Support contains 2 out of 2134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2134/2134 places, 2596/2596 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 2130 transition count 2587
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 2130 transition count 2587
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 2130 transition count 2586
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 12 place count 2127 transition count 2583
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 2127 transition count 2583
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 2126 transition count 2582
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 2126 transition count 2582
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 2125 transition count 2581
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 2125 transition count 2581
Applied a total of 19 rules in 570 ms. Remains 2125 /2134 variables (removed 9) and now considering 2581/2596 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5163019444865167971.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13649409000759691484.kers'
[2026-05-22 19:18:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5163019444865167971.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13649409000759691484.kers]
Culled 0 columns in 6 ms.
// Phase 1: matrix 2581 rows 2125 cols 7983 entries
Finished phase 1 with 1376 SingleSign rule and 521 generalized
[2026-05-22 19:18:53] [INFO ] Computed 228 invariants in 56 ms
Computed 228 P flows in 56 ms.
Exported basis to /tmp/petrispot-output-13649409000759691484.kers
Total runtime 61 ms.
[2026-05-22 19:18:55] [INFO ] Implicit Places using invariants in 1890 ms returned []
[2026-05-22 19:18:55] [INFO ] Invariant cache hit.
[2026-05-22 19:19:04] [INFO ] Implicit Places using invariants and state equation in 9846 ms returned []
Implicit Place search using SMT with State Equation took 11741 ms to find 0 implicit places.
Running 2580 sub problems to find dead transitions.
[2026-05-22 19:19:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2124 variables, 135/135 constraints. Problems are: Problem set: 0 solved, 2580 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2124/4706 variables, and 135 constraints, problems are : Problem set: 0 solved, 2580 unsolved in 30081 ms.
Refiners :[Positive P Invariants (semi-flows): 0/46 constraints, Generalized P Invariants (flows): 135/182 constraints, State Equation: 0/2125 constraints, PredecessorRefiner: 2580/2580 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2580 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2124 variables, 135/135 constraints. Problems are: Problem set: 0 solved, 2580 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2124/4706 variables, and 135 constraints, problems are : Problem set: 0 solved, 2580 unsolved in 30091 ms.
Refiners :[Positive P Invariants (semi-flows): 0/46 constraints, Generalized P Invariants (flows): 135/182 constraints, State Equation: 0/2125 constraints, PredecessorRefiner: 0/2580 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61124ms problems are : Problem set: 0 solved, 2580 unsolved
Search for dead transitions found 0 dead transitions in 61133ms
Starting structural reductions in LTL mode, iteration 1 : 2125/2134 places, 2581/2596 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 73458 ms. Remains : 2125/2134 places, 2581/2596 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(F(p0)))'
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-05b-LTLCardinality-09
Stuttering criterion allowed to conclude after 460 steps with 0 reset in 2 ms.
FORMULA ASLink-PT-05b-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-05b-LTLCardinality-09 finished in 73630 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((X(p1)||p0))))'
Support contains 4 out of 2134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2134/2134 places, 2596/2596 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 2131 transition count 2588
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 2131 transition count 2588
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 2128 transition count 2585
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 2128 transition count 2585
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 2127 transition count 2584
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 2127 transition count 2584
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 2126 transition count 2583
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 2126 transition count 2583
Applied a total of 16 rules in 546 ms. Remains 2126 /2134 variables (removed 8) and now considering 2583/2596 (removed 13) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10863433274509221804.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9288775216283867721.kers'
[2026-05-22 19:20:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10863433274509221804.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9288775216283867721.kers]
Culled 0 columns in 5 ms.
// Phase 1: matrix 2583 rows 2126 cols 7987 entries
Finished phase 1 with 1378 SingleSign rule and 520 generalized
[2026-05-22 19:20:06] [INFO ] Computed 228 invariants in 55 ms
Computed 228 P flows in 55 ms.
Exported basis to /tmp/petrispot-output-9288775216283867721.kers
Total runtime 60 ms.
[2026-05-22 19:20:08] [INFO ] Implicit Places using invariants in 1625 ms returned [2039]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1652 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2125/2134 places, 2583/2596 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 2124 transition count 2582
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 2124 transition count 2582
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 2123 transition count 2581
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 2123 transition count 2581
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 2122 transition count 2580
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 2122 transition count 2580
Applied a total of 6 rules in 442 ms. Remains 2122 /2125 variables (removed 3) and now considering 2580/2583 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13935229010694963685.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8797758534357686195.kers'
[2026-05-22 19:20:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13935229010694963685.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8797758534357686195.kers]
Culled 0 columns in 5 ms.
// Phase 1: matrix 2580 rows 2122 cols 7976 entries
Finished phase 1 with 1378 SingleSign rule and 517 generalized
[2026-05-22 19:20:08] [INFO ] Computed 227 invariants in 54 ms
Computed 227 P flows in 55 ms.
Exported basis to /tmp/petrispot-output-8797758534357686195.kers
Total runtime 57 ms.
[2026-05-22 19:20:10] [INFO ] Implicit Places using invariants in 1545 ms returned []
[2026-05-22 19:20:10] [INFO ] Invariant cache hit.
[2026-05-22 19:20:20] [INFO ] Implicit Places using invariants and state equation in 10235 ms returned []
Implicit Place search using SMT with State Equation took 11795 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 2122/2134 places, 2580/2596 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 14437 ms. Remains : 2122/2134 places, 2580/2596 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((X(p1)||p0))))'
Stuttering acceptance computed with spot in 176 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ASLink-PT-05b-LTLCardinality-12
Product exploration explored 100000 steps with 178 reset in 441 ms.
Product exploration explored 100000 steps with 204 reset in 373 ms.
Computed a total of 86 stabilizing places and 86 stable transitions
Computed a total of 86 stabilizing places and 86 stable transitions
Knowledge based reduction with 6 factoid took 77 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
RANDOM walk for 6041 steps (9 resets) in 70 ms. (85 steps per ms) remains 0/4 properties
Knowledge based reduction with 6 factoid took 129 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 488 ms.
Stuttering acceptance computed with spot in 223 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 2122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2122/2122 places, 2580/2580 transitions.
Applied a total of 0 rules in 159 ms. Remains 2122 /2122 variables (removed 0) and now considering 2580/2580 (removed 0) transitions.
[2026-05-22 19:20:22] [INFO ] Invariant cache hit.
[2026-05-22 19:20:24] [INFO ] Implicit Places using invariants in 1630 ms returned []
[2026-05-22 19:20:24] [INFO ] Invariant cache hit.
[2026-05-22 19:20:34] [INFO ] Implicit Places using invariants and state equation in 9808 ms returned []
Implicit Place search using SMT with State Equation took 11457 ms to find 0 implicit places.
Running 2579 sub problems to find dead transitions.
[2026-05-22 19:20:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2121 variables, 135/135 constraints. Problems are: Problem set: 0 solved, 2579 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2121/4702 variables, and 135 constraints, problems are : Problem set: 0 solved, 2579 unsolved in 30081 ms.
Refiners :[Positive P Invariants (semi-flows): 0/48 constraints, Generalized P Invariants (flows): 135/179 constraints, State Equation: 0/2122 constraints, PredecessorRefiner: 2579/2579 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2579 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2121 variables, 135/135 constraints. Problems are: Problem set: 0 solved, 2579 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2121/4702 variables, and 135 constraints, problems are : Problem set: 0 solved, 2579 unsolved in 30061 ms.
Refiners :[Positive P Invariants (semi-flows): 0/48 constraints, Generalized P Invariants (flows): 135/179 constraints, State Equation: 0/2122 constraints, PredecessorRefiner: 0/2579 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60990ms problems are : Problem set: 0 solved, 2579 unsolved
Search for dead transitions found 0 dead transitions in 60996ms
Finished structural reductions in LTL mode , in 1 iterations and 72624 ms. Remains : 2122/2122 places, 2580/2580 transitions.
Computed a total of 86 stabilizing places and 86 stable transitions
Computed a total of 86 stabilizing places and 86 stable transitions
Knowledge based reduction with 6 factoid took 55 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
RANDOM walk for 13902 steps (28 resets) in 128 ms. (107 steps per ms) remains 0/4 properties
Knowledge based reduction with 6 factoid took 94 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 399 ms.
Stuttering acceptance computed with spot in 160 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 170 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 200 reset in 374 ms.
Product exploration explored 100000 steps with 198 reset in 378 ms.
Spot run failed in 39 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/ltsmin10239665294282201260
[2026-05-22 19:21:36] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10239665294282201260
Running compilation step : cd /tmp/ltsmin10239665294282201260;'/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/ltsmin10239665294282201260;'/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/ltsmin10239665294282201260;'/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 4 out of 2122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2122/2122 places, 2580/2580 transitions.
Applied a total of 0 rules in 119 ms. Remains 2122 /2122 variables (removed 0) and now considering 2580/2580 (removed 0) transitions.
[2026-05-22 19:21:39] [INFO ] Invariant cache hit.
[2026-05-22 19:21:41] [INFO ] Implicit Places using invariants in 1190 ms returned []
[2026-05-22 19:21:41] [INFO ] Invariant cache hit.
[2026-05-22 19:21:50] [INFO ] Implicit Places using invariants and state equation in 9708 ms returned []
Implicit Place search using SMT with State Equation took 10903 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 11023 ms. Remains : 2122/2122 places, 2580/2580 transitions.
Built C files in :
/tmp/ltsmin946436297456610199
[2026-05-22 19:21:50] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin946436297456610199
Running compilation step : cd /tmp/ltsmin946436297456610199;'/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/ltsmin946436297456610199;'/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/ltsmin946436297456610199;'/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 19:21:53] [INFO ] Flatten gal took : 45 ms
[2026-05-22 19:21:54] [INFO ] Flatten gal took : 45 ms
[2026-05-22 19:21:54] [INFO ] Time to serialize gal into /tmp/LTL3837526377730379562.gal : 28 ms
[2026-05-22 19:21:54] [INFO ] Time to serialize properties into /tmp/LTL16251720616071345174.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/LTL3837526377730379562.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1175474982555782449.hoa' '-atoms' '/tmp/LTL16251720616071345174.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/LTL16251720616071345174.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1175474982555782449.hoa
Detected timeout of ITS tools.
[2026-05-22 19:22:09] [INFO ] Flatten gal took : 44 ms
[2026-05-22 19:22:09] [INFO ] Flatten gal took : 44 ms
[2026-05-22 19:22:09] [INFO ] Time to serialize gal into /tmp/LTL808507477194396582.gal : 10 ms
[2026-05-22 19:22:09] [INFO ] Time to serialize properties into /tmp/LTL1556640074211025074.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/LTL808507477194396582.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1556640074211025074.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...274
Read 1 LTL properties
Checking formula 0 : !((X(G(("((p2148==0)||(p213==1))")||(X("((p1976==0)||(p752==1))"))))))
Formula 0 simplified : XF(!"((p2148==0)||(p213==1))" & X!"((p1976==0)||(p752==1))")
Detected timeout of ITS tools.
[2026-05-22 19:22:24] [INFO ] Flatten gal took : 38 ms
[2026-05-22 19:22:24] [INFO ] Applying decomposition
[2026-05-22 19:22:24] [INFO ] Flatten gal took : 38 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/graph11059400679211255382.txt' '-o' '/tmp/graph11059400679211255382.bin' '-w' '/tmp/graph11059400679211255382.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11059400679211255382.bin' '-l' '-1' '-v' '-w' '/tmp/graph11059400679211255382.weights' '-q' '0' '-e' '0.001'
[2026-05-22 19:22:24] [INFO ] Decomposing Gal with order
[2026-05-22 19:22:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 19:22:24] [INFO ] Removed a total of 1932 redundant transitions.
[2026-05-22 19:22:24] [INFO ] Flatten gal took : 94 ms
[2026-05-22 19:22:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 13 labels/synchronizations in 76 ms.
[2026-05-22 19:22:24] [INFO ] Time to serialize gal into /tmp/LTL11955285741397053440.gal : 31 ms
[2026-05-22 19:22:24] [INFO ] Time to serialize properties into /tmp/LTL17711608964446751237.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/LTL11955285741397053440.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17711608964446751237.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 : !((X(G(("((i23.u739.p2148==0)||(i1.i1.i2.u66.p213==1))")||(X("((i24.i2.i6.u686.p1976==0)||(i5.i0.i3.u260.p752==1))"))))))
Formula 0 simplified : XF(!"((i23.u739.p2148==0)||(i1.i1.i2.u66.p213==1))" & X!"((i24.i2.i6.u686.p1976==0)||(i5.i0.i3.u260.p752==1))")
Detected timeout of ITS tools.
Treatment of property ASLink-PT-05b-LTLCardinality-12 finished in 153764 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((X(F(p0)) U (F((G(F(!p1))||(!p2&&F(!p1)))) U X(p3))))))'
Support contains 8 out of 2134 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2134/2134 places, 2596/2596 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 389 transitions
Trivial Post-agglo rules discarded 389 transitions
Performed 389 trivial Post agglomeration. Transition count delta: 389
Iterating post reduction 0 with 389 rules applied. Total rules applied 389 place count 2133 transition count 2206
Reduce places removed 389 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 394 rules applied. Total rules applied 783 place count 1744 transition count 2201
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 787 place count 1741 transition count 2200
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 788 place count 1740 transition count 2200
Performed 572 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 572 Pre rules applied. Total rules applied 788 place count 1740 transition count 1628
Deduced a syphon composed of 572 places in 3 ms
Ensure Unique test removed 53 places
Reduce places removed 625 places and 0 transitions.
Iterating global reduction 4 with 1197 rules applied. Total rules applied 1985 place count 1115 transition count 1628
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 4 with 38 rules applied. Total rules applied 2023 place count 1110 transition count 1595
Reduce places removed 33 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 34 rules applied. Total rules applied 2057 place count 1077 transition count 1594
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2058 place count 1076 transition count 1594
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 20 Pre rules applied. Total rules applied 2058 place count 1076 transition count 1574
Deduced a syphon composed of 20 places in 4 ms
Ensure Unique test removed 19 places
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 7 with 59 rules applied. Total rules applied 2117 place count 1037 transition count 1574
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 18 Pre rules applied. Total rules applied 2117 place count 1037 transition count 1556
Deduced a syphon composed of 18 places in 3 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 7 with 36 rules applied. Total rules applied 2153 place count 1019 transition count 1556
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 2155 place count 1017 transition count 1549
Iterating global reduction 7 with 2 rules applied. Total rules applied 2157 place count 1017 transition count 1549
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2158 place count 1016 transition count 1548
Iterating global reduction 7 with 1 rules applied. Total rules applied 2159 place count 1016 transition count 1548
Performed 171 Post agglomeration using F-continuation condition.Transition count delta: 171
Deduced a syphon composed of 171 places in 2 ms
Ensure Unique test removed 2 places
Reduce places removed 173 places and 0 transitions.
Iterating global reduction 7 with 344 rules applied. Total rules applied 2503 place count 843 transition count 1377
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2507 place count 839 transition count 1373
Ensure Unique test removed 1 places
Iterating global reduction 7 with 5 rules applied. Total rules applied 2512 place count 838 transition count 1373
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 2512 place count 838 transition count 1372
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 2514 place count 837 transition count 1372
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 2516 place count 835 transition count 1370
Iterating global reduction 7 with 2 rules applied. Total rules applied 2518 place count 835 transition count 1370
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 2520 place count 835 transition count 1368
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2521 place count 834 transition count 1368
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2523 place count 833 transition count 1373
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2525 place count 831 transition count 1371
Reduce places removed 10 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 9 with 15 rules applied. Total rules applied 2540 place count 821 transition count 1366
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 2545 place count 816 transition count 1366
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 14 Pre rules applied. Total rules applied 2545 place count 816 transition count 1352
Deduced a syphon composed of 14 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 11 with 29 rules applied. Total rules applied 2574 place count 801 transition count 1352
Discarding 10 places :
Implicit places reduction removed 10 places
Iterating post reduction 11 with 10 rules applied. Total rules applied 2584 place count 791 transition count 1352
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 2584 place count 791 transition count 1351
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 2586 place count 790 transition count 1351
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 12 with 30 rules applied. Total rules applied 2616 place count 775 transition count 1336
Discarding 9 places :
Symmetric choice reduction at 12 with 9 rule applications. Total rules 2625 place count 766 transition count 1327
Iterating global reduction 12 with 9 rules applied. Total rules applied 2634 place count 766 transition count 1327
Discarding 4 places :
Symmetric choice reduction at 12 with 4 rule applications. Total rules 2638 place count 762 transition count 1323
Iterating global reduction 12 with 4 rules applied. Total rules applied 2642 place count 762 transition count 1323
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 2646 place count 762 transition count 1319
Applied a total of 2646 rules in 445 ms. Remains 762 /2134 variables (removed 1372) and now considering 1319/2596 (removed 1277) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16287583158790937232.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10772448475891053695.kers'
[2026-05-22 19:22:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16287583158790937232.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10772448475891053695.kers]
Culling duplicate invariants (modulo rational): removing 16 columns.
Culled 16 columns in 2 ms.
// Phase 1: matrix 1319 rows 746 cols 5125 entries
Finished phase 1 with 177 SingleSign rule and 458 generalized
[2026-05-22 19:22:40] [INFO ] Computed 127 invariants in 34 ms
Computed 127 P flows in 34 ms.
Exported basis to /tmp/petrispot-output-10772448475891053695.kers
Total runtime 36 ms.
[2026-05-22 19:22:41] [INFO ] Implicit Places using invariants in 874 ms returned [1, 18, 19, 31, 48, 66, 86, 105, 140, 150, 151, 153, 170, 189, 209, 260, 261, 273, 274, 278, 313, 332, 384, 385, 397, 398, 400, 417, 435, 455, 506, 507, 519, 520, 522, 539, 558, 619, 638, 639, 642, 653, 654, 655, 673, 677, 695, 696, 697, 698, 720]
[2026-05-22 19:22:41] [INFO ] Actually due to overlaps returned [673, 655, 48, 170, 417, 539, 31, 150, 153, 273, 278, 397, 400, 519, 522, 653, 695, 151, 274, 398, 520, 654, 696, 1, 18, 260, 261, 384, 385, 506, 507, 638, 639, 558, 677, 697, 19, 66, 86, 140, 189, 209, 313, 332, 435, 455, 642, 698, 720]
Discarding 49 places :
Implicit Place search using SMT only with invariants took 877 ms to find 49 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 713/2134 places, 1319/2596 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 86 rules applied. Total rules applied 86 place count 711 transition count 1235
Reduce places removed 84 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 86 rules applied. Total rules applied 172 place count 627 transition count 1233
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 174 place count 625 transition count 1233
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 174 place count 625 transition count 1206
Deduced a syphon composed of 27 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 55 rules applied. Total rules applied 229 place count 597 transition count 1206
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 241 place count 593 transition count 1198
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 249 place count 585 transition count 1198
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 253 place count 581 transition count 1194
Iterating global reduction 5 with 4 rules applied. Total rules applied 257 place count 581 transition count 1194
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 260 place count 581 transition count 1191
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 6 with 76 rules applied. Total rules applied 336 place count 543 transition count 1153
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 340 place count 541 transition count 1154
Applied a total of 340 rules in 66 ms. Remains 541 /713 variables (removed 172) and now considering 1154/1319 (removed 165) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13056240602427068091.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8520543982620725734.kers'
[2026-05-22 19:22:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13056240602427068091.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8520543982620725734.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1154 rows 541 cols 4620 entries
Finished phase 1 with 165 SingleSign rule and 305 generalized
[2026-05-22 19:22:41] [INFO ] Computed 71 invariants in 10 ms
Computed 71 P flows in 24 ms.
Exported basis to /tmp/petrispot-output-8520543982620725734.kers
Total runtime 25 ms.
[2026-05-22 19:22:41] [INFO ] Implicit Places using invariants in 502 ms returned [90, 96, 101, 177, 183, 188, 272, 280, 286, 364, 370, 375, 456, 469, 538]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 505 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 526/2134 places, 1154/2596 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 526 transition count 1153
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 525 transition count 1153
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 11 place count 516 transition count 1144
Iterating global reduction 2 with 9 rules applied. Total rules applied 20 place count 516 transition count 1144
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 29 place count 507 transition count 1135
Iterating global reduction 2 with 9 rules applied. Total rules applied 38 place count 507 transition count 1135
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 42 place count 503 transition count 1131
Iterating global reduction 2 with 4 rules applied. Total rules applied 46 place count 503 transition count 1131
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 502 transition count 1130
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 502 transition count 1130
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 501 transition count 1129
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 501 transition count 1129
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 60 place count 496 transition count 1124
Applied a total of 60 rules in 90 ms. Remains 496 /526 variables (removed 30) and now considering 1124/1154 (removed 30) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18220801527255638578.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13218857552931645913.kers'
[2026-05-22 19:22:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18220801527255638578.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13218857552931645913.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1124 rows 496 cols 4506 entries
Finished phase 1 with 170 SingleSign rule and 270 generalized
[2026-05-22 19:22:42] [INFO ] Computed 56 invariants in 10 ms
Computed 56 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-13218857552931645913.kers
Total runtime 13 ms.
[2026-05-22 19:22:42] [INFO ] Implicit Places using invariants in 392 ms returned []
[2026-05-22 19:22:42] [INFO ] Invariant cache hit.
[2026-05-22 19:22:43] [INFO ] Implicit Places using invariants and state equation in 971 ms returned []
Implicit Place search using SMT with State Equation took 1364 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 496/2134 places, 1124/2596 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 3349 ms. Remains : 496/2134 places, 1124/2596 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((X(F(p0)) U (F((G(F(!p1))||(!p2&&F(!p1)))) U X(p3))))))'
Stuttering acceptance computed with spot in 381 ms :[(NOT p3), (NOT p3), (AND (NOT p3) p2 (NOT p0) p1), (AND p1 (NOT p3) (NOT p0)), (AND (NOT p0) p1 (NOT p3)), false]
Running random walk in product with property : ASLink-PT-05b-LTLCardinality-13
Product exploration explored 100000 steps with 39969 reset in 361 ms.
Product exploration explored 100000 steps with 40110 reset in 370 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 18 factoid took 150 ms. Reduced automaton from 6 states, 15 edges and 4 AP (stutter insensitive) to 5 states, 14 edges and 4 AP (stutter insensitive).
RANDOM walk for 40000 steps (532 resets) in 408 ms. (97 steps per ms) remains 6/9 properties
BEST_FIRST walk for 40003 steps (99 resets) in 271 ms. (147 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (112 resets) in 192 ms. (207 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (117 resets) in 148 ms. (268 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (114 resets) in 152 ms. (261 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (101 resets) in 54 ms. (727 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (128 resets) in 56 ms. (701 steps per ms) remains 6/6 properties
[2026-05-22 19:22:45] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 175/183 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 49/232 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 6/238 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 220/458 variables, 32/47 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/458 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 27/485 variables, 5/52 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/485 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 11/496 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/496 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 1124/1620 variables, 496/552 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1620 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/1620 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1620/1620 variables, and 552 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1033 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 36/36 constraints, State Equation: 496/496 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 175/183 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 49/232 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 6/238 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 220/458 variables, 32/49 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/458 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 27/485 variables, 5/54 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/485 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 11/496 variables, 4/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/496 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 1124/1620 variables, 496/554 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1620 variables, 6/560 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1620 variables, 1/561 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1620 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 0/1620 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1620/1620 variables, and 561 constraints, problems are : Problem set: 0 solved, 6 unsolved in 4010 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 36/36 constraints, State Equation: 496/496 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5080ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 4159 ms.
Support contains 8 out of 496 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 496/496 places, 1124/1124 transitions.
Free-agglomeration rule applied 24 times.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 496 transition count 1100
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 29 rules applied. Total rules applied 53 place count 472 transition count 1095
Free-agglomeration rule (complex) applied 15 times.
Iterating global reduction 1 with 15 rules applied. Total rules applied 68 place count 472 transition count 1080
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 83 place count 457 transition count 1080
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 457 transition count 1080
Applied a total of 84 rules in 57 ms. Remains 457 /496 variables (removed 39) and now considering 1080/1124 (removed 44) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 457/496 places, 1080/1124 transitions.
RANDOM walk for 40000 steps (668 resets) in 219 ms. (181 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (128 resets) in 74 ms. (533 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (152 resets) in 61 ms. (645 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (150 resets) in 62 ms. (634 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (151 resets) in 75 ms. (526 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (131 resets) in 54 ms. (727 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (157 resets) in 56 ms. (701 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 189560 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :0 out of 6
Probabilistic random walk after 189560 steps, saw 60742 distinct states, run finished after 3003 ms. (steps per millisecond=63 ) 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-16610895240639736052.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13742243160302269063.kers'
[2026-05-22 19:22:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16610895240639736052.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13742243160302269063.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1080 rows 457 cols 4487 entries
Finished phase 1 with 148 SingleSign rule and 253 generalized
[2026-05-22 19:22:57] [INFO ] Computed 56 invariants in 8 ms
Computed 56 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-13742243160302269063.kers
Total runtime 9 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 163/171 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 48/219 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 6/225 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 190/415 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/415 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 27/442 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/442 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 15/457 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/457 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 1080/1537 variables, 457/513 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1537 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/1537 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1537/1537 variables, and 513 constraints, problems are : Problem set: 0 solved, 6 unsolved in 975 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 36/36 constraints, State Equation: 457/457 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 163/171 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 48/219 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 6/225 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/225 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 190/415 variables, 31/48 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/415 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 27/442 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/442 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 15/457 variables, 5/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/457 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 1080/1537 variables, 457/515 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1537 variables, 6/521 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1537 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 0/1537 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1537/1537 variables, and 521 constraints, problems are : Problem set: 0 solved, 6 unsolved in 7774 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 36/36 constraints, State Equation: 457/457 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8829ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 4338 ms.
Support contains 8 out of 457 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 457/457 places, 1080/1080 transitions.
Applied a total of 0 rules in 16 ms. Remains 457 /457 variables (removed 0) and now considering 1080/1080 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 457/457 places, 1080/1080 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 457/457 places, 1080/1080 transitions.
Applied a total of 0 rules in 13 ms. Remains 457 /457 variables (removed 0) and now considering 1080/1080 (removed 0) transitions.
[2026-05-22 19:23:11] [INFO ] Invariant cache hit.
[2026-05-22 19:23:11] [INFO ] Implicit Places using invariants in 544 ms returned [90, 91, 162, 163, 240, 241, 313, 314, 393]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 547 ms to find 9 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 448/457 places, 1080/1080 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 447 transition count 1079
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 447 transition count 1079
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 447 transition count 1078
Applied a total of 3 rules in 44 ms. Remains 447 /448 variables (removed 1) and now considering 1078/1080 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10563133465729727853.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14455478867994004823.kers'
[2026-05-22 19:23:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10563133465729727853.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14455478867994004823.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1078 rows 447 cols 4369 entries
Finished phase 1 with 137 SingleSign rule and 263 generalized
[2026-05-22 19:23:11] [INFO ] Computed 47 invariants in 8 ms
Computed 47 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-14455478867994004823.kers
Total runtime 10 ms.
[2026-05-22 19:23:12] [INFO ] Implicit Places using invariants in 555 ms returned []
[2026-05-22 19:23:12] [INFO ] Invariant cache hit.
[2026-05-22 19:23:13] [INFO ] Implicit Places using invariants and state equation in 1274 ms returned []
Implicit Place search using SMT with State Equation took 1832 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 447/457 places, 1078/1080 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2437 ms. Remains : 447/457 places, 1078/1080 transitions.
RANDOM walk for 40000 steps (681 resets) in 286 ms. (139 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (124 resets) in 89 ms. (444 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (154 resets) in 113 ms. (350 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (149 resets) in 109 ms. (363 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (151 resets) in 79 ms. (500 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (121 resets) in 78 ms. (506 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (159 resets) in 84 ms. (470 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 200144 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 6
Probabilistic random walk after 200144 steps, saw 65832 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
[2026-05-22 19:23:16] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 162/170 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 48/218 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/218 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 6/224 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 183/407 variables, 24/39 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/407 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 27/434 variables, 5/44 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/434 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 13/447 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/447 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 1078/1525 variables, 447/494 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1525 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/1525 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1525/1525 variables, and 494 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1359 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 447/447 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 162/170 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 48/218 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 6/224 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 183/407 variables, 24/41 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/407 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 27/434 variables, 5/46 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/434 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 13/447 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/447 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/447 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 1078/1525 variables, 447/497 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1525 variables, 6/503 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1525 variables, 1/504 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1525 variables, 1/505 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1525 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 0/1525 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1525/1525 variables, and 505 constraints, problems are : Problem set: 0 solved, 6 unsolved in 11779 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 447/447 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 13170ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 10208 ms.
Support contains 8 out of 447 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 447/447 places, 1078/1078 transitions.
Applied a total of 0 rules in 18 ms. Remains 447 /447 variables (removed 0) and now considering 1078/1078 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 447/447 places, 1078/1078 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 447/447 places, 1078/1078 transitions.
Applied a total of 0 rules in 17 ms. Remains 447 /447 variables (removed 0) and now considering 1078/1078 (removed 0) transitions.
[2026-05-22 19:23:40] [INFO ] Invariant cache hit.
[2026-05-22 19:23:40] [INFO ] Implicit Places using invariants in 361 ms returned []
[2026-05-22 19:23:40] [INFO ] Invariant cache hit.
[2026-05-22 19:23:41] [INFO ] Implicit Places using invariants and state equation in 1212 ms returned []
Implicit Place search using SMT with State Equation took 1576 ms to find 0 implicit places.
[2026-05-22 19:23:41] [INFO ] Redundant transitions in 28 ms returned []
Running 1048 sub problems to find dead transitions.
[2026-05-22 19:23:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1048 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 1048 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 445/1525 variables, and 40 constraints, problems are : Problem set: 0 solved, 1048 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 16/20 constraints, Generalized P Invariants (flows): 24/27 constraints, State Equation: 0/447 constraints, PredecessorRefiner: 1048/1048 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1048 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1048 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 1048 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/445 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1048 unsolved
At refinement iteration 3 (OVERLAPS) 2/447 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 1048 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/447 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 1048 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 447/1525 variables, and 47 constraints, problems are : Problem set: 0 solved, 1048 unsolved in 30079 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 0/447 constraints, PredecessorRefiner: 0/1048 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60375ms problems are : Problem set: 0 solved, 1048 unsolved
Search for dead transitions found 0 dead transitions in 60377ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62009 ms. Remains : 447/447 places, 1078/1078 transitions.
Knowledge based reduction with 18 factoid took 128 ms. Reduced automaton from 5 states, 14 edges and 4 AP (stutter insensitive) to 5 states, 14 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 236 ms :[(NOT p3), (NOT p3), (AND (NOT p3) (NOT p0) p1), (AND (NOT p0) p1 (NOT p3)), false]
Knowledge-based reduction took 117938 ms.
Stuttering acceptance computed with spot in 199 ms :[(NOT p3), (NOT p3), (AND (NOT p3) (NOT p0) p1), (AND (NOT p0) p1 (NOT p3)), false]
Support contains 8 out of 496 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 496/496 places, 1124/1124 transitions.
Applied a total of 0 rules in 21 ms. Remains 496 /496 variables (removed 0) and now considering 1124/1124 (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-15564366454018362908.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9674539894992442288.kers'
[2026-05-22 19:24:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15564366454018362908.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9674539894992442288.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1124 rows 496 cols 4506 entries
Finished phase 1 with 170 SingleSign rule and 270 generalized
[2026-05-22 19:24:42] [INFO ] Computed 56 invariants in 13 ms
Computed 56 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-9674539894992442288.kers
Total runtime 15 ms.
[2026-05-22 19:24:43] [INFO ] Implicit Places using invariants in 576 ms returned []
[2026-05-22 19:24:43] [INFO ] Invariant cache hit.
[2026-05-22 19:24:44] [INFO ] Implicit Places using invariants and state equation in 1140 ms returned []
Implicit Place search using SMT with State Equation took 1746 ms to find 0 implicit places.
[2026-05-22 19:24:44] [INFO ] Redundant transitions in 12 ms returned []
Running 1084 sub problems to find dead transitions.
[2026-05-22 19:24:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/489 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/489 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 489/1620 variables, and 38 constraints, problems are : Problem set: 0 solved, 1084 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 12/20 constraints, Generalized P Invariants (flows): 26/36 constraints, State Equation: 0/496 constraints, PredecessorRefiner: 1084/1084 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1084 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/489 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/489 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/489 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
At refinement iteration 3 (OVERLAPS) 4/493 variables, 8/46 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/493 variables, 4/50 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 493/1620 variables, and 51 constraints, problems are : Problem set: 0 solved, 1084 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 30/36 constraints, State Equation: 0/496 constraints, PredecessorRefiner: 0/1084 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60303ms problems are : Problem set: 0 solved, 1084 unsolved
Search for dead transitions found 0 dead transitions in 60317ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62109 ms. Remains : 496/496 places, 1124/1124 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 19 factoid took 117 ms. Reduced automaton from 5 states, 14 edges and 4 AP (stutter insensitive) to 5 states, 14 edges and 4 AP (stutter insensitive).
RANDOM walk for 40000 steps (544 resets) in 222 ms. (179 steps per ms) remains 6/9 properties
BEST_FIRST walk for 40004 steps (94 resets) in 45 ms. (869 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (114 resets) in 58 ms. (677 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (119 resets) in 50 ms. (784 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (116 resets) in 58 ms. (678 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (97 resets) in 46 ms. (851 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (115 resets) in 50 ms. (784 steps per ms) remains 6/6 properties
[2026-05-22 19:25:45] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 175/183 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 49/232 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 6/238 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 220/458 variables, 32/47 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/458 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 27/485 variables, 5/52 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/485 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 11/496 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/496 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 1124/1620 variables, 496/552 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1620 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/1620 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1620/1620 variables, and 552 constraints, problems are : Problem set: 0 solved, 6 unsolved in 893 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 36/36 constraints, State Equation: 496/496 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 175/183 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 49/232 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 6/238 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 220/458 variables, 32/49 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/458 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 27/485 variables, 5/54 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/485 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 11/496 variables, 4/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/496 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 1124/1620 variables, 496/554 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1620 variables, 6/560 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1620 variables, 1/561 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1620 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 0/1620 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1620/1620 variables, and 561 constraints, problems are : Problem set: 0 solved, 6 unsolved in 4194 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 36/36 constraints, State Equation: 496/496 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5135ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 4153 ms.
Support contains 8 out of 496 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 496/496 places, 1124/1124 transitions.
Free-agglomeration rule applied 24 times.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 496 transition count 1100
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 29 rules applied. Total rules applied 53 place count 472 transition count 1095
Free-agglomeration rule (complex) applied 15 times.
Iterating global reduction 1 with 15 rules applied. Total rules applied 68 place count 472 transition count 1080
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 83 place count 457 transition count 1080
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 457 transition count 1080
Applied a total of 84 rules in 68 ms. Remains 457 /496 variables (removed 39) and now considering 1080/1124 (removed 44) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 457/496 places, 1080/1124 transitions.
RANDOM walk for 40000 steps (683 resets) in 216 ms. (184 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (118 resets) in 84 ms. (470 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (151 resets) in 98 ms. (404 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (149 resets) in 66 ms. (597 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (157 resets) in 71 ms. (555 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (114 resets) in 54 ms. (727 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (147 resets) in 69 ms. (571 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 218572 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :0 out of 6
Probabilistic random walk after 218572 steps, saw 75144 distinct states, run finished after 3001 ms. (steps per millisecond=72 ) 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-3324585505162418377.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11262288011183030450.kers'
[2026-05-22 19:25:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3324585505162418377.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11262288011183030450.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1080 rows 457 cols 4487 entries
Finished phase 1 with 148 SingleSign rule and 253 generalized
[2026-05-22 19:25:57] [INFO ] Computed 56 invariants in 8 ms
Computed 56 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-11262288011183030450.kers
Total runtime 10 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 163/171 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 48/219 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 6/225 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 190/415 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/415 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 27/442 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/442 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 15/457 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/457 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 1080/1537 variables, 457/513 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1537 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/1537 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1537/1537 variables, and 513 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1162 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 36/36 constraints, State Equation: 457/457 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 163/171 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 48/219 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 6/225 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/225 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 190/415 variables, 31/48 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/415 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 27/442 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/442 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 15/457 variables, 5/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/457 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 1080/1537 variables, 457/515 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1537 variables, 6/521 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1537 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 0/1537 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1537/1537 variables, and 521 constraints, problems are : Problem set: 0 solved, 6 unsolved in 7725 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 36/36 constraints, State Equation: 457/457 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8908ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 6932 ms.
Support contains 8 out of 457 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 457/457 places, 1080/1080 transitions.
Applied a total of 0 rules in 15 ms. Remains 457 /457 variables (removed 0) and now considering 1080/1080 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 457/457 places, 1080/1080 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 457/457 places, 1080/1080 transitions.
Applied a total of 0 rules in 15 ms. Remains 457 /457 variables (removed 0) and now considering 1080/1080 (removed 0) transitions.
[2026-05-22 19:26:13] [INFO ] Invariant cache hit.
[2026-05-22 19:26:14] [INFO ] Implicit Places using invariants in 416 ms returned [90, 91, 162, 163, 240, 241, 313, 314, 393]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 418 ms to find 9 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 448/457 places, 1080/1080 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 447 transition count 1079
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 447 transition count 1079
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 447 transition count 1078
Applied a total of 3 rules in 35 ms. Remains 447 /448 variables (removed 1) and now considering 1078/1080 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15194309421313083784.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12458235178116186202.kers'
[2026-05-22 19:26:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15194309421313083784.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12458235178116186202.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1078 rows 447 cols 4369 entries
Finished phase 1 with 137 SingleSign rule and 263 generalized
[2026-05-22 19:26:14] [INFO ] Computed 47 invariants in 8 ms
Computed 47 P flows in 21 ms.
Exported basis to /tmp/petrispot-output-12458235178116186202.kers
Total runtime 23 ms.
[2026-05-22 19:26:14] [INFO ] Implicit Places using invariants in 511 ms returned []
[2026-05-22 19:26:14] [INFO ] Invariant cache hit.
[2026-05-22 19:26:15] [INFO ] Implicit Places using invariants and state equation in 1093 ms returned []
Implicit Place search using SMT with State Equation took 1610 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 447/457 places, 1078/1080 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2078 ms. Remains : 447/457 places, 1078/1080 transitions.
RANDOM walk for 40000 steps (692 resets) in 262 ms. (152 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (127 resets) in 66 ms. (597 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (147 resets) in 86 ms. (459 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (150 resets) in 77 ms. (512 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (150 resets) in 108 ms. (367 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (118 resets) in 77 ms. (512 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (154 resets) in 73 ms. (540 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 166802 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :0 out of 6
Probabilistic random walk after 166802 steps, saw 50047 distinct states, run finished after 3001 ms. (steps per millisecond=55 ) properties seen :0
[2026-05-22 19:26:19] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 162/170 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 48/218 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/218 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 6/224 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 183/407 variables, 24/39 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/407 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 27/434 variables, 5/44 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/434 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 13/447 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/447 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 1078/1525 variables, 447/494 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1525 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/1525 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1525/1525 variables, and 494 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1095 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 447/447 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 162/170 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 48/218 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 6/224 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 183/407 variables, 24/41 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/407 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 27/434 variables, 5/46 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/434 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 13/447 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/447 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/447 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 1078/1525 variables, 447/497 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1525 variables, 6/503 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1525 variables, 1/504 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1525 variables, 1/505 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1525 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 0/1525 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1525/1525 variables, and 505 constraints, problems are : Problem set: 0 solved, 6 unsolved in 11635 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 447/447 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 12750ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 11246 ms.
Support contains 8 out of 447 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 447/447 places, 1078/1078 transitions.
Applied a total of 0 rules in 15 ms. Remains 447 /447 variables (removed 0) and now considering 1078/1078 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 447/447 places, 1078/1078 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 447/447 places, 1078/1078 transitions.
Applied a total of 0 rules in 15 ms. Remains 447 /447 variables (removed 0) and now considering 1078/1078 (removed 0) transitions.
[2026-05-22 19:26:43] [INFO ] Invariant cache hit.
[2026-05-22 19:26:43] [INFO ] Implicit Places using invariants in 414 ms returned []
[2026-05-22 19:26:43] [INFO ] Invariant cache hit.
[2026-05-22 19:26:44] [INFO ] Implicit Places using invariants and state equation in 1161 ms returned []
Implicit Place search using SMT with State Equation took 1593 ms to find 0 implicit places.
[2026-05-22 19:26:44] [INFO ] Redundant transitions in 27 ms returned []
Running 1048 sub problems to find dead transitions.
[2026-05-22 19:26:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1048 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 1048 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 445/1525 variables, and 40 constraints, problems are : Problem set: 0 solved, 1048 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 16/20 constraints, Generalized P Invariants (flows): 24/27 constraints, State Equation: 0/447 constraints, PredecessorRefiner: 1048/1048 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1048 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1048 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 1048 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/445 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1048 unsolved
At refinement iteration 3 (OVERLAPS) 2/447 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 1048 unsolved
SMT process timed out in 60349ms, After SMT, problems are : Problem set: 0 solved, 1048 unsolved
Search for dead transitions found 0 dead transitions in 60352ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61998 ms. Remains : 447/447 places, 1078/1078 transitions.
Knowledge based reduction with 19 factoid took 170 ms. Reduced automaton from 5 states, 14 edges and 4 AP (stutter insensitive) to 5 states, 14 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 309 ms :[(NOT p3), (NOT p3), (AND (NOT p3) (NOT p0) p1), (AND (NOT p0) p1 (NOT p3)), false]
Knowledge-based reduction took 120615 ms.
Stuttering acceptance computed with spot in 254 ms :[(NOT p3), (NOT p3), (AND (NOT p3) (NOT p0) p1), (AND (NOT p0) p1 (NOT p3)), false]
Stuttering acceptance computed with spot in 367 ms :[(NOT p3), (NOT p3), (AND (NOT p3) (NOT p0) p1), (AND (NOT p0) p1 (NOT p3)), false]
Product exploration explored 100000 steps with 1378 reset in 254 ms.
Product exploration explored 100000 steps with 1407 reset in 363 ms.
Built C files in :
/tmp/ltsmin11320848909865375273
[2026-05-22 19:27:46] [INFO ] Computing symmetric may disable matrix : 1124 transitions.
[2026-05-22 19:27:46] [INFO ] Computation of Complete disable matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 19:27:46] [INFO ] Computing symmetric may enable matrix : 1124 transitions.
[2026-05-22 19:27:46] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 19:27:47] [INFO ] Computing Do-Not-Accords matrix : 1124 transitions.
[2026-05-22 19:27:47] [INFO ] Computation of Completed DNA matrix. took 34 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 19:27:47] [INFO ] Built C files in 280ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11320848909865375273
Running compilation step : cd /tmp/ltsmin11320848909865375273;'/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/ltsmin11320848909865375273;'/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/ltsmin11320848909865375273;'/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 8 out of 496 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 496/496 places, 1124/1124 transitions.
Applied a total of 0 rules in 32 ms. Remains 496 /496 variables (removed 0) and now considering 1124/1124 (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-3924753885473572672.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17121687014342201272.kers'
[2026-05-22 19:27:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3924753885473572672.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17121687014342201272.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1124 rows 496 cols 4506 entries
Finished phase 1 with 170 SingleSign rule and 270 generalized
[2026-05-22 19:27:50] [INFO ] Computed 56 invariants in 8 ms
Computed 56 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-17121687014342201272.kers
Total runtime 10 ms.
[2026-05-22 19:27:50] [INFO ] Implicit Places using invariants in 554 ms returned []
[2026-05-22 19:27:50] [INFO ] Invariant cache hit.
[2026-05-22 19:27:51] [INFO ] Implicit Places using invariants and state equation in 1125 ms returned []
Implicit Place search using SMT with State Equation took 1698 ms to find 0 implicit places.
[2026-05-22 19:27:51] [INFO ] Redundant transitions in 10 ms returned []
Running 1084 sub problems to find dead transitions.
[2026-05-22 19:27:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/489 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/489 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 489/1620 variables, and 38 constraints, problems are : Problem set: 0 solved, 1084 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 12/20 constraints, Generalized P Invariants (flows): 26/36 constraints, State Equation: 0/496 constraints, PredecessorRefiner: 1084/1084 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1084 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/489 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/489 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 489/1620 variables, and 38 constraints, problems are : Problem set: 0 solved, 1084 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 12/20 constraints, Generalized P Invariants (flows): 26/36 constraints, State Equation: 0/496 constraints, PredecessorRefiner: 0/1084 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60329ms problems are : Problem set: 0 solved, 1084 unsolved
Search for dead transitions found 0 dead transitions in 60331ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62092 ms. Remains : 496/496 places, 1124/1124 transitions.
Built C files in :
/tmp/ltsmin16284148279822880030
[2026-05-22 19:28:52] [INFO ] Computing symmetric may disable matrix : 1124 transitions.
[2026-05-22 19:28:52] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 19:28:52] [INFO ] Computing symmetric may enable matrix : 1124 transitions.
[2026-05-22 19:28:52] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 19:28:52] [INFO ] Computing Do-Not-Accords matrix : 1124 transitions.
[2026-05-22 19:28:52] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 19:28:52] [INFO ] Built C files in 265ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16284148279822880030
Running compilation step : cd /tmp/ltsmin16284148279822880030;'/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/ltsmin16284148279822880030;'/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/ltsmin16284148279822880030;'/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 19:28:55] [INFO ] Flatten gal took : 20 ms
[2026-05-22 19:28:55] [INFO ] Flatten gal took : 19 ms
[2026-05-22 19:28:55] [INFO ] Time to serialize gal into /tmp/LTL16437681760019897063.gal : 5 ms
[2026-05-22 19:28:55] [INFO ] Time to serialize properties into /tmp/LTL11682705667869063593.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/LTL16437681760019897063.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10442274913034642769.hoa' '-atoms' '/tmp/LTL11682705667869063593.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/LTL11682705667869063593.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10442274913034642769.hoa
Detected timeout of ITS tools.
[2026-05-22 19:29:10] [INFO ] Flatten gal took : 18 ms
[2026-05-22 19:29:10] [INFO ] Flatten gal took : 21 ms
[2026-05-22 19:29:10] [INFO ] Time to serialize gal into /tmp/LTL9987167299504097910.gal : 5 ms
[2026-05-22 19:29:10] [INFO ] Time to serialize properties into /tmp/LTL6389892340171435103.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/LTL9987167299504097910.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6389892340171435103.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 : !((F(G((X(F("((p261==0)||(p539==1))")))U((F((G(F(!("((p1985==0)||(p1466==1))"))))||((!("((p1364==0)||(p1930==1))"))&&(F(!("((p1985==0)...211
Formula 0 simplified : GF(XG!"((p261==0)||(p539==1))" R (G(FG"((p1985==0)||(p1466==1))" & ("((p1364==0)||(p1930==1))" | G"((p1985==0)||(p1466==1))")) R X!"...181
Detected timeout of ITS tools.
[2026-05-22 19:29:25] [INFO ] Flatten gal took : 18 ms
[2026-05-22 19:29:25] [INFO ] Applying decomposition
[2026-05-22 19:29:25] [INFO ] Flatten gal took : 18 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/graph13345262524173920596.txt' '-o' '/tmp/graph13345262524173920596.bin' '-w' '/tmp/graph13345262524173920596.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13345262524173920596.bin' '-l' '-1' '-v' '-w' '/tmp/graph13345262524173920596.weights' '-q' '0' '-e' '0.001'
[2026-05-22 19:29:25] [INFO ] Decomposing Gal with order
[2026-05-22 19:29:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 19:29:26] [INFO ] Removed a total of 2178 redundant transitions.
[2026-05-22 19:29:26] [INFO ] Flatten gal took : 39 ms
[2026-05-22 19:29:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 68 labels/synchronizations in 9 ms.
[2026-05-22 19:29:26] [INFO ] Time to serialize gal into /tmp/LTL12071663772441510218.gal : 7 ms
[2026-05-22 19:29:26] [INFO ] Time to serialize properties into /tmp/LTL1275711658621324609.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/LTL12071663772441510218.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1275711658621324609.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 : !((F(G((X(F("((i1.u26.p261==0)||(i3.u36.p539==1))")))U((F((G(F(!("((i9.u106.p1985==0)||(i8.u83.p1466==1))"))))||((!("((i7.u78.p1364==0...286
Formula 0 simplified : GF(XG!"((i1.u26.p261==0)||(i3.u36.p539==1))" R (G(FG"((i9.u106.p1985==0)||(i8.u83.p1466==1))" & ("((i7.u78.p1364==0)||(i10.u105.p193...256
Detected timeout of ITS tools.
Treatment of property ASLink-PT-05b-LTLCardinality-13 finished in 421096 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((G(p1)||p0))))'
Support contains 4 out of 2134 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2134/2134 places, 2596/2596 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 390 transitions
Trivial Post-agglo rules discarded 390 transitions
Performed 390 trivial Post agglomeration. Transition count delta: 390
Iterating post reduction 0 with 390 rules applied. Total rules applied 390 place count 2133 transition count 2205
Reduce places removed 390 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 395 rules applied. Total rules applied 785 place count 1743 transition count 2200
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 790 place count 1740 transition count 2198
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 792 place count 1738 transition count 2198
Performed 573 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 573 Pre rules applied. Total rules applied 792 place count 1738 transition count 1625
Deduced a syphon composed of 573 places in 3 ms
Ensure Unique test removed 54 places
Reduce places removed 627 places and 0 transitions.
Iterating global reduction 4 with 1200 rules applied. Total rules applied 1992 place count 1111 transition count 1625
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 4 with 39 rules applied. Total rules applied 2031 place count 1106 transition count 1591
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 5 with 34 rules applied. Total rules applied 2065 place count 1072 transition count 1591
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 21 Pre rules applied. Total rules applied 2065 place count 1072 transition count 1570
Deduced a syphon composed of 21 places in 4 ms
Ensure Unique test removed 20 places
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 6 with 62 rules applied. Total rules applied 2127 place count 1031 transition count 1570
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 6 with 1 rules applied. Total rules applied 2128 place count 1030 transition count 1570
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 19 Pre rules applied. Total rules applied 2128 place count 1030 transition count 1551
Deduced a syphon composed of 19 places in 4 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 7 with 38 rules applied. Total rules applied 2166 place count 1011 transition count 1551
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 2168 place count 1009 transition count 1544
Iterating global reduction 7 with 2 rules applied. Total rules applied 2170 place count 1009 transition count 1544
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2171 place count 1008 transition count 1543
Iterating global reduction 7 with 1 rules applied. Total rules applied 2172 place count 1008 transition count 1543
Performed 169 Post agglomeration using F-continuation condition.Transition count delta: 169
Deduced a syphon composed of 169 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 170 places and 0 transitions.
Iterating global reduction 7 with 339 rules applied. Total rules applied 2511 place count 838 transition count 1374
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2515 place count 834 transition count 1370
Ensure Unique test removed 1 places
Iterating global reduction 7 with 5 rules applied. Total rules applied 2520 place count 833 transition count 1370
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 2520 place count 833 transition count 1369
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 2522 place count 832 transition count 1369
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 2524 place count 830 transition count 1367
Iterating global reduction 7 with 2 rules applied. Total rules applied 2526 place count 830 transition count 1367
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 2528 place count 830 transition count 1365
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2529 place count 829 transition count 1365
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2531 place count 828 transition count 1370
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2533 place count 826 transition count 1368
Reduce places removed 10 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 9 with 15 rules applied. Total rules applied 2548 place count 816 transition count 1363
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 2553 place count 811 transition count 1363
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 15 Pre rules applied. Total rules applied 2553 place count 811 transition count 1348
Deduced a syphon composed of 15 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 11 with 31 rules applied. Total rules applied 2584 place count 795 transition count 1348
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 11 with 11 rules applied. Total rules applied 2595 place count 784 transition count 1348
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 2595 place count 784 transition count 1347
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 2597 place count 783 transition count 1347
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 12 with 32 rules applied. Total rules applied 2629 place count 767 transition count 1331
Discarding 10 places :
Symmetric choice reduction at 12 with 10 rule applications. Total rules 2639 place count 757 transition count 1321
Iterating global reduction 12 with 10 rules applied. Total rules applied 2649 place count 757 transition count 1321
Discarding 5 places :
Symmetric choice reduction at 12 with 5 rule applications. Total rules 2654 place count 752 transition count 1316
Iterating global reduction 12 with 5 rules applied. Total rules applied 2659 place count 752 transition count 1316
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 12 with 5 rules applied. Total rules applied 2664 place count 752 transition count 1311
Applied a total of 2664 rules in 490 ms. Remains 752 /2134 variables (removed 1382) and now considering 1311/2596 (removed 1285) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18129730539921533997.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2935827095328988968.kers'
[2026-05-22 19:29:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18129730539921533997.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2935827095328988968.kers]
Culling duplicate invariants (modulo rational): removing 17 columns.
Culled 17 columns in 0 ms.
// Phase 1: matrix 1311 rows 735 cols 5094 entries
Finished phase 1 with 172 SingleSign rule and 456 generalized
[2026-05-22 19:29:41] [INFO ] Computed 124 invariants in 11 ms
Computed 124 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-2935827095328988968.kers
Total runtime 17 ms.
[2026-05-22 19:29:42] [INFO ] Implicit Places using invariants in 850 ms returned [1, 18, 19, 31, 48, 66, 86, 137, 147, 148, 150, 167, 185, 205, 256, 257, 269, 270, 272, 289, 307, 326, 384, 385, 397, 398, 400, 417, 435, 455, 506, 507, 519, 520, 522, 539, 557, 577, 628, 629, 632, 643, 644, 645, 663, 667, 685, 686, 687, 688, 710]
Discarding 51 places :
Implicit Place search using SMT only with invariants took 869 ms to find 51 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 701/2134 places, 1311/2596 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 89 transitions
Trivial Post-agglo rules discarded 89 transitions
Performed 89 trivial Post agglomeration. Transition count delta: 89
Iterating post reduction 0 with 89 rules applied. Total rules applied 89 place count 701 transition count 1222
Reduce places removed 89 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 91 rules applied. Total rules applied 180 place count 612 transition count 1220
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 182 place count 610 transition count 1220
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 182 place count 610 transition count 1194
Deduced a syphon composed of 26 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 53 rules applied. Total rules applied 235 place count 583 transition count 1194
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 247 place count 579 transition count 1186
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 255 place count 571 transition count 1186
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 259 place count 567 transition count 1182
Iterating global reduction 5 with 4 rules applied. Total rules applied 263 place count 567 transition count 1182
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 266 place count 567 transition count 1179
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 6 with 82 rules applied. Total rules applied 348 place count 526 transition count 1138
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 352 place count 524 transition count 1139
Applied a total of 352 rules in 94 ms. Remains 524 /701 variables (removed 177) and now considering 1139/1311 (removed 172) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8740225642049881911.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15810388090595661560.kers'
[2026-05-22 19:29:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8740225642049881911.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15810388090595661560.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1139 rows 524 cols 4574 entries
Finished phase 1 with 159 SingleSign rule and 297 generalized
[2026-05-22 19:29:42] [INFO ] Computed 68 invariants in 24 ms
Computed 68 P flows in 25 ms.
Exported basis to /tmp/petrispot-output-15810388090595661560.kers
Total runtime 28 ms.
[2026-05-22 19:29:43] [INFO ] Implicit Places using invariants in 599 ms returned [88, 94, 99, 174, 180, 185, 275, 280, 357, 363, 368, 445, 451, 456, 521]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 608 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 509/2134 places, 1139/2596 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 509 transition count 1138
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 508 transition count 1138
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 11 place count 499 transition count 1129
Iterating global reduction 2 with 9 rules applied. Total rules applied 20 place count 499 transition count 1129
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 29 place count 490 transition count 1120
Iterating global reduction 2 with 9 rules applied. Total rules applied 38 place count 490 transition count 1120
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 42 place count 486 transition count 1116
Iterating global reduction 2 with 4 rules applied. Total rules applied 46 place count 486 transition count 1116
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 56 place count 481 transition count 1111
Applied a total of 56 rules in 54 ms. Remains 481 /509 variables (removed 28) and now considering 1111/1139 (removed 28) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13325548903226118616.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10882135790094347175.kers'
[2026-05-22 19:29:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13325548903226118616.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10882135790094347175.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1111 rows 481 cols 4470 entries
Finished phase 1 with 150 SingleSign rule and 278 generalized
[2026-05-22 19:29:43] [INFO ] Computed 53 invariants in 8 ms
Computed 53 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-10882135790094347175.kers
Total runtime 9 ms.
[2026-05-22 19:29:44] [INFO ] Implicit Places using invariants in 806 ms returned []
[2026-05-22 19:29:44] [INFO ] Invariant cache hit.
[2026-05-22 19:29:45] [INFO ] Implicit Places using invariants and state equation in 1603 ms returned []
Implicit Place search using SMT with State Equation took 2444 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 481/2134 places, 1111/2596 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 4560 ms. Remains : 481/2134 places, 1111/2596 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((G(p1)||p0))))'
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ASLink-PT-05b-LTLCardinality-15
Product exploration explored 100000 steps with 1374 reset in 221 ms.
Product exploration explored 100000 steps with 1412 reset in 308 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 7 factoid took 139 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (577 resets) in 137 ms. (289 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40002 steps (115 resets) in 73 ms. (540 steps per ms) remains 1/1 properties
[2026-05-22 19:29:46] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 91/128 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/130 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 231/361 variables, 21/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/361 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 48/409 variables, 7/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/409 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/413 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/413 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 68/481 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/481 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1111/1592 variables, 481/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1592 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1592 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1592/1592 variables, and 534 constraints, problems are : Problem set: 0 solved, 1 unsolved in 426 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 481/481 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 91/128 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/130 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Int declared 361/1592 variables, and 28 constraints, problems are : Problem set: 1 solved, 0 unsolved in 106 ms.
Refiners :[Positive P Invariants (semi-flows): 7/15 constraints, Generalized P Invariants (flows): 21/38 constraints, State Equation: 0/481 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 546ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge based reduction with 8 factoid took 117 ms. Proved property starting from automaton with 2 states, 4 edges and 2 AP (stutter insensitive
Knowledge-based reduction took 897 ms.
FORMULA ASLink-PT-05b-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-05b-LTLCardinality-15 finished in 6137 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&&X((X(p1)&&G(p2))))))'
Spot run failed in 38 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(G((X(p1)||p0))))'
Spot run failed in 58 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' '!(F(G((X(F(p0)) U (F((G(F(!p1))||(!p2&&F(!p1)))) U X(p3))))))'
Spot run failed in 36 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 19:29:47] [INFO ] Flatten gal took : 68 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6771401211919655454
[2026-05-22 19:29:47] [INFO ] Too many transitions (2596) to apply POR reductions. Disabling POR matrices.
[2026-05-22 19:29:47] [INFO ] Applying decomposition
[2026-05-22 19:29:47] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6771401211919655454
Running compilation step : cd /tmp/ltsmin6771401211919655454;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '240' '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 19:29:47] [INFO ] Flatten gal took : 36 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/graph12316345990218032964.txt' '-o' '/tmp/graph12316345990218032964.bin' '-w' '/tmp/graph12316345990218032964.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12316345990218032964.bin' '-l' '-1' '-v' '-w' '/tmp/graph12316345990218032964.weights' '-q' '0' '-e' '0.001'
[2026-05-22 19:29:47] [INFO ] Decomposing Gal with order
[2026-05-22 19:29:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 19:29:48] [INFO ] Removed a total of 1945 redundant transitions.
[2026-05-22 19:29:48] [INFO ] Flatten gal took : 94 ms
[2026-05-22 19:29:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 27 ms.
[2026-05-22 19:29:48] [INFO ] Time to serialize gal into /tmp/LTLCardinality12699459945871786630.gal : 27 ms
[2026-05-22 19:29:48] [INFO ] Time to serialize properties into /tmp/LTLCardinality1866403598631080532.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/LTLCardinality12699459945871786630.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality1866403598631080532.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 3 LTL properties
Checking formula 0 : !((X(("((i31.u802.p2388==0)||(i8.i0.i0.u93.p279==1))")&&(X((X("(((i31.u802.p2388==0)||(i8.i0.i0.u93.p279==1))||((i23.i0.i0.u500.p1445=...238
Formula 0 simplified : X(!"((i31.u802.p2388==0)||(i8.i0.i0.u93.p279==1))" | X(X!"(((i31.u802.p2388==0)||(i8.i0.i0.u93.p279==1))||((i23.i0.i0.u500.p1445==0)...228
Compilation finished in 5805 ms.
Running link step : cd /tmp/ltsmin6771401211919655454;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 98 ms.
Running LTSmin : cd /tmp/ltsmin6771401211919655454;'/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(((LTLAPp0==true)&&X((X((LTLAPp1==true))&&[]((LTLAPp2==true))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin6771401211919655454;'/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(((LTLAPp0==true)&&X((X((LTLAPp1==true))&&[]((LTLAPp2==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin6771401211919655454;'/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((LTLAPp4==true))||(LTLAPp3==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin6771401211919655454;'/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((LTLAPp4==true))||(LTLAPp3==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin6771401211919655454;'/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(<>((LTLAPp5==true))) U (<>(([](<>(!(LTLAPp6==true)))||(!(LTLAPp7==true)&&<>(!(LTLAPp6==true))))) U X((LTLAPp8==true))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin6771401211919655454;'/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(<>((LTLAPp5==true))) U (<>(([](<>(!(LTLAPp6==true)))||(!(LTLAPp7==true)&&<>(!(LTLAPp6==true))))) U X((LTLAPp8==true))))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin6771401211919655454;'/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(((LTLAPp0==true)&&X((X((LTLAPp1==true))&&[]((LTLAPp2==true))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-22 19:56:59] [INFO ] Applying decomposition
[2026-05-22 19:56:59] [INFO ] Flatten gal took : 50 ms
[2026-05-22 19:56:59] [INFO ] Decomposing Gal with order
[2026-05-22 19:56:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 19:56:59] [INFO ] Removed a total of 1773 redundant transitions.
[2026-05-22 19:56:59] [INFO ] Flatten gal took : 88 ms
[2026-05-22 19:57:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 2877 labels/synchronizations in 54 ms.
[2026-05-22 19:57:00] [INFO ] Time to serialize gal into /tmp/LTLCardinality3803034217445899761.gal : 16 ms
[2026-05-22 19:57:00] [INFO ] Time to serialize properties into /tmp/LTLCardinality4875926280714587870.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/LTLCardinality3803034217445899761.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality4875926280714587870.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...276
Read 3 LTL properties
Checking formula 0 : !((X(("((i1.i1.i20.u287.p2388==0)||(i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i1.u29.p279==1))")&&(X((X("(((i1.i1.i20.u287.p2388==0)||(i0.i0.i0...380
Formula 0 simplified : X(!"((i1.i1.i20.u287.p2388==0)||(i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i1.u29.p279==1))" | X(X!"(((i1.i1.i20.u287.p2388==0)||(i0.i0.i0.i0...370

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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-05b.tgz
mv ASLink-PT-05b execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;