Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 628K
-rw-r--r-- 1 mcc users 9.0K Mar 6 16:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 104K Mar 6 16:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Mar 6 16:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Mar 6 16:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Mar 15 09:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 09:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 09:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 09:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 6 16:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Mar 6 16:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Mar 6 16:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Mar 6 16:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 09:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 09:16 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 111K 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 DiscoveryGPU-PT-15b-LTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-15b-LTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-15b-LTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-15b-LTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-15b-LTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-15b-LTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-15b-LTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-15b-LTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-15b-LTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-15b-LTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-15b-LTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-15b-LTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-15b-LTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-15b-LTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-15b-LTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-15b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779606381737

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-15b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-24 07:06:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-24 07:06:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 07:06:23] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2026-05-24 07:06:23] [INFO ] Transformed 436 places.
[2026-05-24 07:06:23] [INFO ] Transformed 464 transitions.
[2026-05-24 07:06:23] [INFO ] Found NUPN structural information;
[2026-05-24 07:06:23] [INFO ] Parsed PT model containing 436 places and 464 transitions and 1214 arcs in 176 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Support contains 44 out of 436 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 436/436 places, 464/464 transitions.
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 406 transition count 464
Discarding 69 places :
Symmetric choice reduction at 1 with 69 rule applications. Total rules 99 place count 337 transition count 395
Iterating global reduction 1 with 69 rules applied. Total rules applied 168 place count 337 transition count 395
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 183 place count 322 transition count 380
Iterating global reduction 1 with 15 rules applied. Total rules applied 198 place count 322 transition count 380
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 211 place count 309 transition count 367
Iterating global reduction 1 with 13 rules applied. Total rules applied 224 place count 309 transition count 367
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 234 place count 299 transition count 357
Iterating global reduction 1 with 10 rules applied. Total rules applied 244 place count 299 transition count 357
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 251 place count 292 transition count 343
Iterating global reduction 1 with 7 rules applied. Total rules applied 258 place count 292 transition count 343
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 264 place count 286 transition count 337
Iterating global reduction 1 with 6 rules applied. Total rules applied 270 place count 286 transition count 337
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 276 place count 280 transition count 331
Iterating global reduction 1 with 6 rules applied. Total rules applied 282 place count 280 transition count 331
Applied a total of 282 rules in 116 ms. Remains 280 /436 variables (removed 156) and now considering 331/464 (removed 133) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1180952999897522134.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-205724863334632190.kers'
[2026-05-24 07:06:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1180952999897522134.kers, --Pflows, --basisKERS=/tmp/petrispot-output-205724863334632190.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 331 rows 280 cols 887 entries
Finished phase 1 with 278 SingleSign rule and 0 generalized
[2026-05-24 07:06:23] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-205724863334632190.kers
Total runtime 2 ms.
[2026-05-24 07:06:23] [INFO ] Implicit Places using invariants in 253 ms returned []
[2026-05-24 07:06:23] [INFO ] Invariant cache hit.
[2026-05-24 07:06:23] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 519 ms to find 0 implicit places.
Running 330 sub problems to find dead transitions.
[2026-05-24 07:06:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/279 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 1 (OVERLAPS) 1/280 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/280 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 3 (OVERLAPS) 331/611 variables, 280/282 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/611 variables, 15/297 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/611 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 6 (OVERLAPS) 0/611 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 330 unsolved
No progress, stopping.
After SMT solving in domain Real declared 611/611 variables, and 297 constraints, problems are : Problem set: 0 solved, 330 unsolved in 28437 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 330/330 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 330 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/279 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 1 (OVERLAPS) 1/280 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/280 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/280 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 4 (OVERLAPS) 331/611 variables, 280/297 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/611 variables, 330/627 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/611 variables, 0/627 constraints. Problems are: Problem set: 0 solved, 330 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 611/611 variables, and 627 constraints, problems are : Problem set: 0 solved, 330 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 330/330 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 58636ms problems are : Problem set: 0 solved, 330 unsolved
Search for dead transitions found 0 dead transitions in 58647ms
Starting structural reductions in LTL mode, iteration 1 : 280/436 places, 331/464 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59313 ms. Remains : 280/436 places, 331/464 transitions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 331/331 transitions.
Applied a total of 0 rules in 5 ms. Remains 280 /280 variables (removed 0) and now considering 331/331 (removed 0) transitions.
[2026-05-24 07:07:22] [INFO ] Invariant cache hit.
[2026-05-24 07:07:22] [INFO ] Implicit Places using invariants in 72 ms returned []
[2026-05-24 07:07:22] [INFO ] Invariant cache hit.
[2026-05-24 07:07:22] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 225 ms. Remains : 280/280 places, 331/331 transitions.
Support contains 44 out of 280 places after structural reductions.
[2026-05-24 07:07:22] [INFO ] Flatten gal took : 43 ms
[2026-05-24 07:07:23] [INFO ] Flatten gal took : 19 ms
[2026-05-24 07:07:23] [INFO ] Input system was already deterministic with 331 transitions.
RANDOM walk for 31240 steps (63 resets) in 1201 ms. (25 steps per ms) remains 0/40 properties
FORMULA DiscoveryGPU-PT-15b-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA DiscoveryGPU-PT-15b-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 51 stabilizing places and 51 stable transitions
Graph (complete) has 556 edges and 280 vertex of which 277 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.12 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((G(p1)||p0))))'
Support contains 3 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 331/331 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 265 transition count 315
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 265 transition count 315
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 39 place count 256 transition count 302
Iterating global reduction 0 with 9 rules applied. Total rules applied 48 place count 256 transition count 302
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 55 place count 249 transition count 294
Iterating global reduction 0 with 7 rules applied. Total rules applied 62 place count 249 transition count 294
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 68 place count 243 transition count 287
Iterating global reduction 0 with 6 rules applied. Total rules applied 74 place count 243 transition count 287
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 76 place count 241 transition count 285
Iterating global reduction 0 with 2 rules applied. Total rules applied 78 place count 241 transition count 285
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 240 transition count 284
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 240 transition count 284
Applied a total of 80 rules in 32 ms. Remains 240 /280 variables (removed 40) and now considering 284/331 (removed 47) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6125768783458159488.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17619184697803135962.kers'
[2026-05-24 07:07:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6125768783458159488.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17619184697803135962.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 284 rows 240 cols 769 entries
Finished phase 1 with 238 SingleSign rule and 0 generalized
[2026-05-24 07:07:24] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17619184697803135962.kers
Total runtime 1 ms.
[2026-05-24 07:07:24] [INFO ] Implicit Places using invariants in 64 ms returned []
[2026-05-24 07:07:24] [INFO ] Invariant cache hit.
[2026-05-24 07:07:24] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
Running 283 sub problems to find dead transitions.
[2026-05-24 07:07:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (OVERLAPS) 1/240 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (OVERLAPS) 284/524 variables, 240/242 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/524 variables, 15/257 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/524 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (OVERLAPS) 0/524 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 283 unsolved
No progress, stopping.
After SMT solving in domain Real declared 524/524 variables, and 257 constraints, problems are : Problem set: 0 solved, 283 unsolved in 20699 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 283 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (OVERLAPS) 1/240 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (OVERLAPS) 284/524 variables, 240/257 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/524 variables, 283/540 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/524 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (OVERLAPS) 0/524 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 283 unsolved
No progress, stopping.
After SMT solving in domain Int declared 524/524 variables, and 540 constraints, problems are : Problem set: 0 solved, 283 unsolved in 27979 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48752ms problems are : Problem set: 0 solved, 283 unsolved
Search for dead transitions found 0 dead transitions in 48756ms
Starting structural reductions in LTL mode, iteration 1 : 240/280 places, 284/331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49041 ms. Remains : 240/280 places, 284/331 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((G(p1)||p0))))'
Stuttering acceptance computed with spot in 221 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-15b-LTLFireability-00
Entered a terminal (fully accepting) state of product in 168 steps with 0 reset in 4 ms.
FORMULA DiscoveryGPU-PT-15b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15b-LTLFireability-00 finished in 49358 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&F(p1)))'
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 331/331 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 266 transition count 317
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 266 transition count 317
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 36 place count 258 transition count 305
Iterating global reduction 0 with 8 rules applied. Total rules applied 44 place count 258 transition count 305
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 50 place count 252 transition count 298
Iterating global reduction 0 with 6 rules applied. Total rules applied 56 place count 252 transition count 298
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 62 place count 246 transition count 291
Iterating global reduction 0 with 6 rules applied. Total rules applied 68 place count 246 transition count 291
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 70 place count 244 transition count 289
Iterating global reduction 0 with 2 rules applied. Total rules applied 72 place count 244 transition count 289
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 243 transition count 288
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 243 transition count 288
Applied a total of 74 rules in 28 ms. Remains 243 /280 variables (removed 37) and now considering 288/331 (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-16735890640873372151.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4050236753763016385.kers'
[2026-05-24 07:08:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16735890640873372151.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4050236753763016385.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 288 rows 243 cols 779 entries
Finished phase 1 with 241 SingleSign rule and 0 generalized
[2026-05-24 07:08:13] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4050236753763016385.kers
Total runtime 1 ms.
[2026-05-24 07:08:13] [INFO ] Implicit Places using invariants in 108 ms returned []
[2026-05-24 07:08:13] [INFO ] Invariant cache hit.
[2026-05-24 07:08:13] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
Running 287 sub problems to find dead transitions.
[2026-05-24 07:08:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (OVERLAPS) 1/243 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/243 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 3 (OVERLAPS) 288/531 variables, 243/245 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/531 variables, 15/260 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 6 (OVERLAPS) 0/531 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 287 unsolved
No progress, stopping.
After SMT solving in domain Real declared 531/531 variables, and 260 constraints, problems are : Problem set: 0 solved, 287 unsolved in 20512 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 287/287 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 287 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (OVERLAPS) 1/243 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/243 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 4 (OVERLAPS) 288/531 variables, 243/260 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 287/547 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 0/547 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 7 (OVERLAPS) 0/531 variables, 0/547 constraints. Problems are: Problem set: 0 solved, 287 unsolved
No progress, stopping.
After SMT solving in domain Int declared 531/531 variables, and 547 constraints, problems are : Problem set: 0 solved, 287 unsolved in 26157 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 287/287 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46725ms problems are : Problem set: 0 solved, 287 unsolved
Search for dead transitions found 0 dead transitions in 46726ms
Starting structural reductions in LTL mode, iteration 1 : 243/280 places, 288/331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47022 ms. Remains : 243/280 places, 288/331 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&F(p1)))'
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : DiscoveryGPU-PT-15b-LTLFireability-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-15b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15b-LTLFireability-01 finished in 47194 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(p1) U ((X(p1)&&(p2||G(p3)))||X(G(p1))))))'
Support contains 6 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 331/331 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 267 transition count 317
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 267 transition count 317
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 34 place count 259 transition count 306
Iterating global reduction 0 with 8 rules applied. Total rules applied 42 place count 259 transition count 306
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 48 place count 253 transition count 299
Iterating global reduction 0 with 6 rules applied. Total rules applied 54 place count 253 transition count 299
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 59 place count 248 transition count 293
Iterating global reduction 0 with 5 rules applied. Total rules applied 64 place count 248 transition count 293
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 66 place count 246 transition count 291
Iterating global reduction 0 with 2 rules applied. Total rules applied 68 place count 246 transition count 291
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 245 transition count 290
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 245 transition count 290
Applied a total of 70 rules in 25 ms. Remains 245 /280 variables (removed 35) and now considering 290/331 (removed 41) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16722140534342348854.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3921417739513305802.kers'
[2026-05-24 07:09:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16722140534342348854.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3921417739513305802.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 290 rows 245 cols 783 entries
Finished phase 1 with 243 SingleSign rule and 0 generalized
[2026-05-24 07:09:00] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3921417739513305802.kers
Total runtime 2 ms.
[2026-05-24 07:09:00] [INFO ] Implicit Places using invariants in 72 ms returned []
[2026-05-24 07:09:00] [INFO ] Invariant cache hit.
[2026-05-24 07:09:00] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
Running 289 sub problems to find dead transitions.
[2026-05-24 07:09:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/244 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 1/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (OVERLAPS) 290/535 variables, 245/247 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/535 variables, 15/262 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/535 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (OVERLAPS) 0/535 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 262 constraints, problems are : Problem set: 0 solved, 289 unsolved in 20946 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 289 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/244 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 1/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/245 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 290/535 variables, 245/262 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/535 variables, 289/551 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/535 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (OVERLAPS) 0/535 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Int declared 535/535 variables, and 551 constraints, problems are : Problem set: 0 solved, 289 unsolved in 29354 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50337ms problems are : Problem set: 0 solved, 289 unsolved
Search for dead transitions found 0 dead transitions in 50337ms
Starting structural reductions in LTL mode, iteration 1 : 245/280 places, 290/331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50582 ms. Remains : 245/280 places, 290/331 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&(X(p1) U ((X(p1)&&(p2||G(p3)))||X(G(p1))))))'
Stuttering acceptance computed with spot in 290 ms :[(OR (NOT p0) (NOT p1)), (AND (NOT p0) p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p3)), true, (AND (NOT p3) (NOT p1)), (NOT p3)]
Running random walk in product with property : DiscoveryGPU-PT-15b-LTLFireability-02
Entered a terminal (fully accepting) state of product in 7 steps with 3 reset in 1 ms.
FORMULA DiscoveryGPU-PT-15b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15b-LTLFireability-02 finished in 50922 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 3 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 331/331 transitions.
Graph (complete) has 556 edges and 280 vertex of which 277 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 45 place count 276 transition count 283
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 1 with 44 rules applied. Total rules applied 89 place count 232 transition count 283
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 44 Pre rules applied. Total rules applied 89 place count 232 transition count 239
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 177 place count 188 transition count 239
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 185 place count 180 transition count 229
Iterating global reduction 2 with 8 rules applied. Total rules applied 193 place count 180 transition count 229
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 198 place count 175 transition count 222
Iterating global reduction 2 with 5 rules applied. Total rules applied 203 place count 175 transition count 222
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 206 place count 172 transition count 218
Iterating global reduction 2 with 3 rules applied. Total rules applied 209 place count 172 transition count 218
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 210 place count 171 transition count 217
Iterating global reduction 2 with 1 rules applied. Total rules applied 211 place count 171 transition count 217
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 134 rules applied. Total rules applied 345 place count 104 transition count 150
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 358 place count 91 transition count 125
Iterating global reduction 2 with 13 rules applied. Total rules applied 371 place count 91 transition count 125
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 384 place count 78 transition count 110
Iterating global reduction 2 with 13 rules applied. Total rules applied 397 place count 78 transition count 110
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 410 place count 65 transition count 85
Iterating global reduction 2 with 13 rules applied. Total rules applied 423 place count 65 transition count 85
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 436 place count 52 transition count 71
Iterating global reduction 2 with 13 rules applied. Total rules applied 449 place count 52 transition count 71
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 462 place count 39 transition count 46
Iterating global reduction 2 with 13 rules applied. Total rules applied 475 place count 39 transition count 46
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 488 place count 26 transition count 32
Iterating global reduction 2 with 13 rules applied. Total rules applied 501 place count 26 transition count 32
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 503 place count 24 transition count 29
Iterating global reduction 2 with 2 rules applied. Total rules applied 505 place count 24 transition count 29
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 506 place count 23 transition count 28
Iterating global reduction 2 with 1 rules applied. Total rules applied 507 place count 23 transition count 28
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 508 place count 23 transition count 27
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 509 place count 23 transition count 27
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 511 place count 21 transition count 25
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 513 place count 20 transition count 24
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 514 place count 19 transition count 24
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 514 place count 19 transition count 21
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 520 place count 16 transition count 21
Applied a total of 520 rules in 68 ms. Remains 16 /280 variables (removed 264) and now considering 21/331 (removed 310) transitions.
[2026-05-24 07:09:51] [INFO ] Flow matrix only has 19 transitions (discarded 2 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14046077986544538803.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5982757120131813566.kers'
[2026-05-24 07:09:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14046077986544538803.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5982757120131813566.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 19 rows 15 cols 47 entries
Finished phase 1 with 15 SingleSign rule and 0 generalized
[2026-05-24 07:09:51] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-5982757120131813566.kers
Total runtime 3 ms.
[2026-05-24 07:09:51] [INFO ] Implicit Places using invariants in 22 ms returned []
[2026-05-24 07:09:51] [INFO ] Flow matrix only has 19 transitions (discarded 2 similar events)
[2026-05-24 07:09:51] [INFO ] Invariant cache hit.
[2026-05-24 07:09:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 07:09:51] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2026-05-24 07:09:51] [INFO ] Redundant transitions in 0 ms returned []
Running 19 sub problems to find dead transitions.
[2026-05-24 07:09:51] [INFO ] Flow matrix only has 19 transitions (discarded 2 similar events)
[2026-05-24 07:09:51] [INFO ] Invariant cache hit.
[2026-05-24 07:09:51] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 1/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 19/34 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 1/35 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/35 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 0/35 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 35/35 variables, and 18 constraints, problems are : Problem set: 0 solved, 19 unsolved in 203 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 16/16 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 1/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 19/34 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 19/36 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/34 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 1/35 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/35 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 0/35 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 35/35 variables, and 37 constraints, problems are : Problem set: 0 solved, 19 unsolved in 327 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 16/16 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 537ms problems are : Problem set: 0 solved, 19 unsolved
Search for dead transitions found 0 dead transitions in 538ms
Starting structural reductions in SI_LTL mode, iteration 1 : 16/280 places, 21/331 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 659 ms. Remains : 16/280 places, 21/331 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 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-15b-LTLFireability-03
Product exploration explored 100000 steps with 701 reset in 199 ms.
Stack based approach found an accepted trace after 9489 steps with 66 reset with depth 47 and stack size 37 in 17 ms.
FORMULA DiscoveryGPU-PT-15b-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-15b-LTLFireability-03 finished in 978 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)||X((F(p1) U X(p2))))))'
Support contains 5 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 331/331 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 267 transition count 317
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 267 transition count 317
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 33 place count 260 transition count 308
Iterating global reduction 0 with 7 rules applied. Total rules applied 40 place count 260 transition count 308
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 45 place count 255 transition count 302
Iterating global reduction 0 with 5 rules applied. Total rules applied 50 place count 255 transition count 302
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 54 place count 251 transition count 297
Iterating global reduction 0 with 4 rules applied. Total rules applied 58 place count 251 transition count 297
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 249 transition count 295
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 249 transition count 295
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 248 transition count 294
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 248 transition count 294
Applied a total of 64 rules in 25 ms. Remains 248 /280 variables (removed 32) and now considering 294/331 (removed 37) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8506308572867218381.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17447202602530040443.kers'
[2026-05-24 07:09:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8506308572867218381.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17447202602530040443.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 294 rows 248 cols 795 entries
Finished phase 1 with 246 SingleSign rule and 0 generalized
[2026-05-24 07:09:52] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17447202602530040443.kers
Total runtime 2 ms.
[2026-05-24 07:09:52] [INFO ] Implicit Places using invariants in 113 ms returned []
[2026-05-24 07:09:52] [INFO ] Invariant cache hit.
[2026-05-24 07:09:52] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
Running 293 sub problems to find dead transitions.
[2026-05-24 07:09:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/247 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (OVERLAPS) 1/248 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/248 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (OVERLAPS) 294/542 variables, 248/250 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/542 variables, 15/265 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/542 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 6 (OVERLAPS) 0/542 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 293 unsolved
No progress, stopping.
After SMT solving in domain Real declared 542/542 variables, and 265 constraints, problems are : Problem set: 0 solved, 293 unsolved in 21551 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 248/248 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 293 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/247 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (OVERLAPS) 1/248 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/248 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/248 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (OVERLAPS) 294/542 variables, 248/265 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/542 variables, 293/558 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/542 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 7 (OVERLAPS) 0/542 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 293 unsolved
No progress, stopping.
After SMT solving in domain Int declared 542/542 variables, and 558 constraints, problems are : Problem set: 0 solved, 293 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 248/248 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 51611ms problems are : Problem set: 0 solved, 293 unsolved
Search for dead transitions found 0 dead transitions in 51612ms
Starting structural reductions in LTL mode, iteration 1 : 248/280 places, 294/331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51867 ms. Remains : 248/280 places, 294/331 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)||X((F(p1) U X(p2))))))'
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-15b-LTLFireability-04
Product exploration explored 100000 steps with 1024 reset in 193 ms.
Stack based approach found an accepted trace after 66 steps with 0 reset with depth 67 and stack size 67 in 0 ms.
FORMULA DiscoveryGPU-PT-15b-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-15b-LTLFireability-04 finished in 52286 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(p0) U p1) U p2)||G((F(p4)&&p3))))'
Support contains 5 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 331/331 transitions.
Graph (complete) has 556 edges and 280 vertex of which 277 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 45 place count 276 transition count 283
Reduce places removed 44 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 46 rules applied. Total rules applied 91 place count 232 transition count 281
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 93 place count 230 transition count 281
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 43 Pre rules applied. Total rules applied 93 place count 230 transition count 238
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 179 place count 187 transition count 238
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 186 place count 180 transition count 229
Iterating global reduction 3 with 7 rules applied. Total rules applied 193 place count 180 transition count 229
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 193 place count 180 transition count 228
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 195 place count 179 transition count 228
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 199 place count 175 transition count 223
Iterating global reduction 3 with 4 rules applied. Total rules applied 203 place count 175 transition count 223
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 205 place count 173 transition count 220
Iterating global reduction 3 with 2 rules applied. Total rules applied 207 place count 173 transition count 220
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 208 place count 172 transition count 219
Iterating global reduction 3 with 1 rules applied. Total rules applied 209 place count 172 transition count 219
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 3 with 130 rules applied. Total rules applied 339 place count 107 transition count 154
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 351 place count 95 transition count 131
Iterating global reduction 3 with 12 rules applied. Total rules applied 363 place count 95 transition count 131
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 375 place count 83 transition count 117
Iterating global reduction 3 with 12 rules applied. Total rules applied 387 place count 83 transition count 117
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 397 place count 73 transition count 98
Iterating global reduction 3 with 10 rules applied. Total rules applied 407 place count 73 transition count 98
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 417 place count 63 transition count 87
Iterating global reduction 3 with 10 rules applied. Total rules applied 427 place count 63 transition count 87
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 437 place count 53 transition count 68
Iterating global reduction 3 with 10 rules applied. Total rules applied 447 place count 53 transition count 68
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 457 place count 43 transition count 57
Iterating global reduction 3 with 10 rules applied. Total rules applied 467 place count 43 transition count 57
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 469 place count 41 transition count 54
Iterating global reduction 3 with 2 rules applied. Total rules applied 471 place count 41 transition count 54
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 472 place count 40 transition count 53
Iterating global reduction 3 with 1 rules applied. Total rules applied 473 place count 40 transition count 53
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 474 place count 40 transition count 53
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 476 place count 38 transition count 51
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 63 edges and 37 vertex of which 36 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) 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 3 with 4 rules applied. Total rules applied 480 place count 36 transition count 48
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 482 place count 34 transition count 48
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 490 place count 30 transition count 44
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 5 with 5 rules applied. Total rules applied 495 place count 25 transition count 39
Applied a total of 495 rules in 56 ms. Remains 25 /280 variables (removed 255) and now considering 39/331 (removed 292) transitions.
[2026-05-24 07:10:44] [INFO ] Flow matrix only has 33 transitions (discarded 6 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10986491086238242562.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5518753081971524043.kers'
[2026-05-24 07:10:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10986491086238242562.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5518753081971524043.kers]
Normalized transition count is 32 out of 33 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 32 rows 24 cols 68 entries
Finished phase 1 with 24 SingleSign rule and 0 generalized
[2026-05-24 07:10:44] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5518753081971524043.kers
Total runtime 1 ms.
[2026-05-24 07:10:44] [INFO ] Implicit Places using invariants in 27 ms returned []
[2026-05-24 07:10:44] [INFO ] Flow matrix only has 33 transitions (discarded 6 similar events)
[2026-05-24 07:10:44] [INFO ] Invariant cache hit.
[2026-05-24 07:10:44] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2026-05-24 07:10:44] [INFO ] Redundant transitions in 0 ms returned []
Running 28 sub problems to find dead transitions.
[2026-05-24 07:10:44] [INFO ] Flow matrix only has 33 transitions (discarded 6 similar events)
[2026-05-24 07:10:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 1/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 32/52 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 5/57 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/57 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 0/57 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 57/58 variables, and 26 constraints, problems are : Problem set: 0 solved, 28 unsolved in 313 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 1/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 32/52 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 28/49 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (OVERLAPS) 5/57 variables, 5/54 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/57 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (OVERLAPS) 0/57 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 57/58 variables, and 54 constraints, problems are : Problem set: 0 solved, 28 unsolved in 364 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 682ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 682ms
Starting structural reductions in SI_LTL mode, iteration 1 : 25/280 places, 39/331 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 801 ms. Remains : 25/280 places, 39/331 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(p0) U p1) U p2)||G((F(p4)&&p3))))'
Stuttering acceptance computed with spot in 374 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p4))), (NOT p0), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p4)), (OR (AND (NOT p0) (NOT p4)) (AND (NOT p0) (NOT p3))), (AND (NOT p1) (NOT p4)), (OR (AND (NOT p1) (NOT p4)) (AND (NOT p1) (NOT p3))), (AND (NOT p2) (NOT p4))]
Running random walk in product with property : DiscoveryGPU-PT-15b-LTLFireability-05
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-15b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15b-LTLFireability-05 finished in 1216 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0||G(p1)))||F(p2)))'
Support contains 3 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 331/331 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 266 transition count 316
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 266 transition count 316
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 36 place count 258 transition count 304
Iterating global reduction 0 with 8 rules applied. Total rules applied 44 place count 258 transition count 304
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 51 place count 251 transition count 296
Iterating global reduction 0 with 7 rules applied. Total rules applied 58 place count 251 transition count 296
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 64 place count 245 transition count 289
Iterating global reduction 0 with 6 rules applied. Total rules applied 70 place count 245 transition count 289
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 72 place count 243 transition count 287
Iterating global reduction 0 with 2 rules applied. Total rules applied 74 place count 243 transition count 287
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 242 transition count 286
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 242 transition count 286
Applied a total of 76 rules in 18 ms. Remains 242 /280 variables (removed 38) and now considering 286/331 (removed 45) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10574746395519590324.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5508918750824053939.kers'
[2026-05-24 07:10:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10574746395519590324.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5508918750824053939.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 286 rows 242 cols 773 entries
Finished phase 1 with 240 SingleSign rule and 0 generalized
[2026-05-24 07:10:45] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5508918750824053939.kers
Total runtime 1 ms.
[2026-05-24 07:10:46] [INFO ] Implicit Places using invariants in 68 ms returned []
[2026-05-24 07:10:46] [INFO ] Invariant cache hit.
[2026-05-24 07:10:46] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
Running 285 sub problems to find dead transitions.
[2026-05-24 07:10:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/241 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 1 (OVERLAPS) 1/242 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/242 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 3 (OVERLAPS) 286/528 variables, 242/244 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/528 variables, 15/259 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/528 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 6 (OVERLAPS) 0/528 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 285 unsolved
No progress, stopping.
After SMT solving in domain Real declared 528/528 variables, and 259 constraints, problems are : Problem set: 0 solved, 285 unsolved in 20689 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 242/242 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 285 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/241 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 1 (OVERLAPS) 1/242 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/242 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 4 (OVERLAPS) 286/528 variables, 242/259 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/528 variables, 285/544 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/528 variables, 0/544 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 7 (OVERLAPS) 0/528 variables, 0/544 constraints. Problems are: Problem set: 0 solved, 285 unsolved
No progress, stopping.
After SMT solving in domain Int declared 528/528 variables, and 544 constraints, problems are : Problem set: 0 solved, 285 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 242/242 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50748ms problems are : Problem set: 0 solved, 285 unsolved
Search for dead transitions found 0 dead transitions in 50750ms
Starting structural reductions in LTL mode, iteration 1 : 242/280 places, 286/331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50993 ms. Remains : 242/280 places, 286/331 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0||G(p1)))||F(p2)))'
Stuttering acceptance computed with spot in 148 ms :[(NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-15b-LTLFireability-07
Product exploration explored 100000 steps with 8829 reset in 102 ms.
Product exploration explored 100000 steps with 8827 reset in 106 ms.
Computed a total of 49 stabilizing places and 49 stable transitions
Graph (complete) has 491 edges and 242 vertex of which 241 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Computed a total of 49 stabilizing places and 49 stable transitions
Detected a total of 49/242 stabilizing places and 49/286 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge based reduction with 11 factoid took 49 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 5 states, 13 edges and 3 AP (stutter insensitive).
Reduction of identical properties reduced properties to check from 9 to 8
RANDOM walk for 40000 steps (80 resets) in 257 ms. (155 steps per ms) remains 1/8 properties
BEST_FIRST walk for 40003 steps (12 resets) in 90 ms. (439 steps per ms) remains 1/1 properties
[2026-05-24 07:11:37] [INFO ] Invariant cache hit.
Problem apf3 is UNSAT
After SMT solving in domain Real declared 3/528 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 14 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, State Equation: 0/242 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge based reduction with 12 factoid took 124 ms. Reduced automaton from 5 states, 13 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p2), (NOT p2)]
[2026-05-24 07:11:37] [INFO ] Invariant cache hit.
[2026-05-24 07:11:37] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2026-05-24 07:11:37] [INFO ] [Real]Absence check using state equation in 211 ms returned sat
[2026-05-24 07:11:38] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 07:11:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-24 07:11:38] [INFO ] [Nat]Absence check using state equation in 448 ms returned sat
[2026-05-24 07:11:39] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1023 ms
[2026-05-24 07:11:39] [INFO ] Computed and/alt/rep : 280/481/280 causal constraints (skipped 5 transitions) in 11 ms.
[2026-05-24 07:11:39] [INFO ] Added : 32 causal constraints over 7 iterations in 143 ms. Result :sat
Could not prove EG (NOT p2)
Knowledge-based reduction took 2421 ms.
Stuttering acceptance computed with spot in 60 ms :[(NOT p2), (NOT p2)]
Support contains 1 out of 242 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 242/242 places, 286/286 transitions.
Graph (complete) has 491 edges and 242 vertex of which 241 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 240 transition count 256
Reduce places removed 28 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 29 rules applied. Total rules applied 58 place count 212 transition count 255
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 59 place count 211 transition count 255
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 49 Pre rules applied. Total rules applied 59 place count 211 transition count 206
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 157 place count 162 transition count 206
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 277 place count 102 transition count 146
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 291 place count 88 transition count 118
Iterating global reduction 3 with 14 rules applied. Total rules applied 305 place count 88 transition count 118
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 319 place count 74 transition count 104
Iterating global reduction 3 with 14 rules applied. Total rules applied 333 place count 74 transition count 104
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 345 place count 62 transition count 80
Iterating global reduction 3 with 12 rules applied. Total rules applied 357 place count 62 transition count 80
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 369 place count 50 transition count 68
Iterating global reduction 3 with 12 rules applied. Total rules applied 381 place count 50 transition count 68
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 393 place count 38 transition count 44
Iterating global reduction 3 with 12 rules applied. Total rules applied 405 place count 38 transition count 44
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 417 place count 26 transition count 32
Iterating global reduction 3 with 12 rules applied. Total rules applied 429 place count 26 transition count 32
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 430 place count 26 transition count 31
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 431 place count 26 transition count 31
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 433 place count 24 transition count 29
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 435 place count 23 transition count 28
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 436 place count 22 transition count 28
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 436 place count 22 transition count 24
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 444 place count 18 transition count 24
Applied a total of 444 rules in 25 ms. Remains 18 /242 variables (removed 224) and now considering 24/286 (removed 262) transitions.
[2026-05-24 07:11:39] [INFO ] Flow matrix only has 21 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-561621488835832884.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10896450941756469627.kers'
[2026-05-24 07:11:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-561621488835832884.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10896450941756469627.kers]
Normalized transition count is 20 out of 21 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 20 rows 18 cols 36 entries
Finished phase 1 with 17 SingleSign rule and 0 generalized
[2026-05-24 07:11:39] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10896450941756469627.kers
Total runtime 0 ms.
[2026-05-24 07:11:39] [INFO ] Implicit Places using invariants in 19 ms returned []
[2026-05-24 07:11:39] [INFO ] Flow matrix only has 21 transitions (discarded 3 similar events)
[2026-05-24 07:11:39] [INFO ] Invariant cache hit.
[2026-05-24 07:11:39] [INFO ] State equation strengthened by 15 read => feed constraints.
[2026-05-24 07:11:39] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2026-05-24 07:11:39] [INFO ] Redundant transitions in 0 ms returned []
Running 23 sub problems to find dead transitions.
[2026-05-24 07:11:39] [INFO ] Flow matrix only has 21 transitions (discarded 3 similar events)
[2026-05-24 07:11:39] [INFO ] Invariant cache hit.
[2026-05-24 07:11:39] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 1/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 20/38 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 14/33 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (OVERLAPS) 1/39 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (OVERLAPS) 0/39 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 34 constraints, problems are : Problem set: 0 solved, 23 unsolved in 223 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 18/18 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 1/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 20/38 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 14/33 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 1/39 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (OVERLAPS) 0/39 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 57 constraints, problems are : Problem set: 0 solved, 23 unsolved in 250 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 18/18 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 478ms problems are : Problem set: 0 solved, 23 unsolved
Search for dead transitions found 0 dead transitions in 478ms
Starting structural reductions in SI_LTL mode, iteration 1 : 18/242 places, 24/286 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 550 ms. Remains : 18/242 places, 24/286 transitions.
Computed a total of 18 stabilizing places and 20 stable transitions
Computed a total of 18 stabilizing places and 20 stable transitions
Detected a total of 18/18 stabilizing places and 20/24 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge based reduction with 4 factoid took 46 ms. Proved property starting from automaton with 2 states, 3 edges and 1 AP (stutter insensitive
Knowledge-based reduction took 50 ms.
FORMULA DiscoveryGPU-PT-15b-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-15b-LTLFireability-07 finished in 54476 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 331/331 transitions.
Graph (complete) has 556 edges and 280 vertex of which 277 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 276 transition count 282
Reduce places removed 45 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 46 rules applied. Total rules applied 92 place count 231 transition count 281
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 93 place count 230 transition count 281
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 93 place count 230 transition count 237
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 181 place count 186 transition count 237
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 189 place count 178 transition count 227
Iterating global reduction 3 with 8 rules applied. Total rules applied 197 place count 178 transition count 227
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 197 place count 178 transition count 226
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 199 place count 177 transition count 226
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 204 place count 172 transition count 219
Iterating global reduction 3 with 5 rules applied. Total rules applied 209 place count 172 transition count 219
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 212 place count 169 transition count 215
Iterating global reduction 3 with 3 rules applied. Total rules applied 215 place count 169 transition count 215
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 216 place count 168 transition count 214
Iterating global reduction 3 with 1 rules applied. Total rules applied 217 place count 168 transition count 214
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 3 with 134 rules applied. Total rules applied 351 place count 101 transition count 147
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 365 place count 87 transition count 120
Iterating global reduction 3 with 14 rules applied. Total rules applied 379 place count 87 transition count 120
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 393 place count 73 transition count 104
Iterating global reduction 3 with 14 rules applied. Total rules applied 407 place count 73 transition count 104
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 421 place count 59 transition count 77
Iterating global reduction 3 with 14 rules applied. Total rules applied 435 place count 59 transition count 77
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 449 place count 45 transition count 62
Iterating global reduction 3 with 14 rules applied. Total rules applied 463 place count 45 transition count 62
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 476 place count 32 transition count 37
Iterating global reduction 3 with 13 rules applied. Total rules applied 489 place count 32 transition count 37
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 502 place count 19 transition count 23
Iterating global reduction 3 with 13 rules applied. Total rules applied 515 place count 19 transition count 23
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 517 place count 17 transition count 20
Iterating global reduction 3 with 2 rules applied. Total rules applied 519 place count 17 transition count 20
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 520 place count 16 transition count 19
Iterating global reduction 3 with 1 rules applied. Total rules applied 521 place count 16 transition count 19
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 522 place count 16 transition count 18
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 524 place count 14 transition count 16
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 14 edges and 12 vertex of which 9 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 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 3 with 4 rules applied. Total rules applied 528 place count 9 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 529 place count 8 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 529 place count 8 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 531 place count 7 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 533 place count 6 transition count 11
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 535 place count 6 transition count 9
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 537 place count 4 transition count 7
Applied a total of 537 rules in 25 ms. Remains 4 /280 variables (removed 276) and now considering 7/331 (removed 324) transitions.
[2026-05-24 07:11:40] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1128001395149944607.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1009273619736067994.kers'
[2026-05-24 07:11:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1128001395149944607.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1009273619736067994.kers]
Normalized transition count is 5 out of 6 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 5 rows 4 cols 9 entries
Finished phase 1 with 4 SingleSign rule and 0 generalized
[2026-05-24 07:11:40] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1009273619736067994.kers
Total runtime 0 ms.
[2026-05-24 07:11:40] [INFO ] Implicit Places using invariants in 18 ms returned []
[2026-05-24 07:11:40] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
[2026-05-24 07:11:40] [INFO ] Invariant cache hit.
[2026-05-24 07:11:40] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2026-05-24 07:11:40] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2026-05-24 07:11:40] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
[2026-05-24 07:11:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2/9 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 9/10 variables, and 4 constraints, problems are : Problem set: 0 solved, 4 unsolved in 29 ms.
Refiners :[State Equation: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 2/9 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/9 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/9 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/9 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 9/10 variables, and 8 constraints, problems are : Problem set: 0 solved, 4 unsolved in 36 ms.
Refiners :[State Equation: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 67ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 67ms
Starting structural reductions in SI_LTL mode, iteration 1 : 4/280 places, 7/331 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 129 ms. Remains : 4/280 places, 7/331 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-15b-LTLFireability-08
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-15b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15b-LTLFireability-08 finished in 183 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(p0))'
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 331/331 transitions.
Graph (complete) has 556 edges and 280 vertex of which 277 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 45 place count 276 transition count 283
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 1 with 44 rules applied. Total rules applied 89 place count 232 transition count 283
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 89 place count 232 transition count 238
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 179 place count 187 transition count 238
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 187 place count 179 transition count 228
Iterating global reduction 2 with 8 rules applied. Total rules applied 195 place count 179 transition count 228
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 200 place count 174 transition count 221
Iterating global reduction 2 with 5 rules applied. Total rules applied 205 place count 174 transition count 221
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 208 place count 171 transition count 217
Iterating global reduction 2 with 3 rules applied. Total rules applied 211 place count 171 transition count 217
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 212 place count 170 transition count 216
Iterating global reduction 2 with 1 rules applied. Total rules applied 213 place count 170 transition count 216
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 0 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 2 with 136 rules applied. Total rules applied 349 place count 102 transition count 148
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 363 place count 88 transition count 121
Iterating global reduction 2 with 14 rules applied. Total rules applied 377 place count 88 transition count 121
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 390 place count 75 transition count 106
Iterating global reduction 2 with 13 rules applied. Total rules applied 403 place count 75 transition count 106
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 416 place count 62 transition count 81
Iterating global reduction 2 with 13 rules applied. Total rules applied 429 place count 62 transition count 81
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 442 place count 49 transition count 67
Iterating global reduction 2 with 13 rules applied. Total rules applied 455 place count 49 transition count 67
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 468 place count 36 transition count 42
Iterating global reduction 2 with 13 rules applied. Total rules applied 481 place count 36 transition count 42
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 494 place count 23 transition count 28
Iterating global reduction 2 with 13 rules applied. Total rules applied 507 place count 23 transition count 28
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 509 place count 21 transition count 25
Iterating global reduction 2 with 2 rules applied. Total rules applied 511 place count 21 transition count 25
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 512 place count 20 transition count 24
Iterating global reduction 2 with 1 rules applied. Total rules applied 513 place count 20 transition count 24
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 514 place count 20 transition count 23
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 516 place count 18 transition count 21
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 518 place count 17 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 519 place count 16 transition count 20
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 519 place count 16 transition count 17
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 525 place count 13 transition count 17
Applied a total of 525 rules in 27 ms. Remains 13 /280 variables (removed 267) and now considering 17/331 (removed 314) transitions.
[2026-05-24 07:11:40] [INFO ] Flow matrix only has 15 transitions (discarded 2 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8824181029488738243.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13295927626074481326.kers'
[2026-05-24 07:11:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8824181029488738243.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13295927626074481326.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 15 rows 12 cols 37 entries
Finished phase 1 with 12 SingleSign rule and 0 generalized
[2026-05-24 07:11:40] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13295927626074481326.kers
Total runtime 0 ms.
[2026-05-24 07:11:40] [INFO ] Implicit Places using invariants in 17 ms returned []
[2026-05-24 07:11:40] [INFO ] Flow matrix only has 15 transitions (discarded 2 similar events)
[2026-05-24 07:11:40] [INFO ] Invariant cache hit.
[2026-05-24 07:11:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 07:11:40] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2026-05-24 07:11:40] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
[2026-05-24 07:11:40] [INFO ] Flow matrix only has 15 transitions (discarded 2 similar events)
[2026-05-24 07:11:40] [INFO ] Invariant cache hit.
[2026-05-24 07:11:40] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 1/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 15/28 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 0/28 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 28/28 variables, and 15 constraints, problems are : Problem set: 0 solved, 16 unsolved in 124 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 13/13 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 1/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 15/28 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 16/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 0/28 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 28/28 variables, and 31 constraints, problems are : Problem set: 0 solved, 16 unsolved in 171 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 13/13 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 296ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 297ms
Starting structural reductions in SI_LTL mode, iteration 1 : 13/280 places, 17/331 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 418 ms. Remains : 13/280 places, 17/331 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(p0))'
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-15b-LTLFireability-09
Stuttering criterion allowed to conclude after 157 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-15b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15b-LTLFireability-09 finished in 476 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X((X(X((G(p0) U p1)))&&(p2 U G(p0))))))))'
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 331/331 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 268 transition count 318
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 268 transition count 318
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 32 place count 260 transition count 306
Iterating global reduction 0 with 8 rules applied. Total rules applied 40 place count 260 transition count 306
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 47 place count 253 transition count 298
Iterating global reduction 0 with 7 rules applied. Total rules applied 54 place count 253 transition count 298
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 60 place count 247 transition count 291
Iterating global reduction 0 with 6 rules applied. Total rules applied 66 place count 247 transition count 291
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 68 place count 245 transition count 289
Iterating global reduction 0 with 2 rules applied. Total rules applied 70 place count 245 transition count 289
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 244 transition count 288
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 244 transition count 288
Applied a total of 72 rules in 25 ms. Remains 244 /280 variables (removed 36) and now considering 288/331 (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-8219544751418729890.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15743319707484160277.kers'
[2026-05-24 07:11:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8219544751418729890.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15743319707484160277.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 288 rows 244 cols 777 entries
Finished phase 1 with 242 SingleSign rule and 0 generalized
[2026-05-24 07:11:41] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15743319707484160277.kers
Total runtime 2 ms.
[2026-05-24 07:11:41] [INFO ] Implicit Places using invariants in 67 ms returned []
[2026-05-24 07:11:41] [INFO ] Invariant cache hit.
[2026-05-24 07:11:41] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
Running 287 sub problems to find dead transitions.
[2026-05-24 07:11:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/243 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (OVERLAPS) 1/244 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/244 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 3 (OVERLAPS) 288/532 variables, 244/246 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/532 variables, 15/261 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/532 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 6 (OVERLAPS) 0/532 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 287 unsolved
No progress, stopping.
After SMT solving in domain Real declared 532/532 variables, and 261 constraints, problems are : Problem set: 0 solved, 287 unsolved in 20868 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 244/244 constraints, PredecessorRefiner: 287/287 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 287 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/243 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (OVERLAPS) 1/244 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/244 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/244 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 4 (OVERLAPS) 288/532 variables, 244/261 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/532 variables, 287/548 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/532 variables, 0/548 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 7 (OVERLAPS) 0/532 variables, 0/548 constraints. Problems are: Problem set: 0 solved, 287 unsolved
No progress, stopping.
After SMT solving in domain Int declared 532/532 variables, and 548 constraints, problems are : Problem set: 0 solved, 287 unsolved in 25913 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 244/244 constraints, PredecessorRefiner: 287/287 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46833ms problems are : Problem set: 0 solved, 287 unsolved
Search for dead transitions found 0 dead transitions in 46834ms
Starting structural reductions in LTL mode, iteration 1 : 244/280 places, 288/331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47083 ms. Remains : 244/280 places, 288/331 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X((X(X((G(p0) U p1)))&&(p2 U G(p0))))))))'
Stuttering acceptance computed with spot in 395 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p0), (NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-15b-LTLFireability-10
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-15b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15b-LTLFireability-10 finished in 47519 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) U X(((F(p1) U X(p2)) U X(p3)))))'
Support contains 5 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 331/331 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 267 transition count 317
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 267 transition count 317
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 33 place count 260 transition count 306
Iterating global reduction 0 with 7 rules applied. Total rules applied 40 place count 260 transition count 306
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 45 place count 255 transition count 301
Iterating global reduction 0 with 5 rules applied. Total rules applied 50 place count 255 transition count 301
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 54 place count 251 transition count 297
Iterating global reduction 0 with 4 rules applied. Total rules applied 58 place count 251 transition count 297
Applied a total of 58 rules in 14 ms. Remains 251 /280 variables (removed 29) and now considering 297/331 (removed 34) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13068139059274815962.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10373770323766388432.kers'
[2026-05-24 07:12:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13068139059274815962.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10373770323766388432.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 297 rows 251 cols 805 entries
Finished phase 1 with 249 SingleSign rule and 0 generalized
[2026-05-24 07:12:28] [INFO ] Computed 2 invariants in 3 ms
Computed 2 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-10373770323766388432.kers
Total runtime 4 ms.
[2026-05-24 07:12:28] [INFO ] Implicit Places using invariants in 68 ms returned []
[2026-05-24 07:12:28] [INFO ] Invariant cache hit.
[2026-05-24 07:12:28] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
Running 296 sub problems to find dead transitions.
[2026-05-24 07:12:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 1 (OVERLAPS) 1/251 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/251 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 3 (OVERLAPS) 297/548 variables, 251/253 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/548 variables, 15/268 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 6 (OVERLAPS) 0/548 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 296 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 268 constraints, problems are : Problem set: 0 solved, 296 unsolved in 21742 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 251/251 constraints, PredecessorRefiner: 296/296 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 296 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 1 (OVERLAPS) 1/251 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/251 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/251 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 4 (OVERLAPS) 297/548 variables, 251/268 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 296/564 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 7 (OVERLAPS) 0/548 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 296 unsolved
No progress, stopping.
After SMT solving in domain Int declared 548/548 variables, and 564 constraints, problems are : Problem set: 0 solved, 296 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 251/251 constraints, PredecessorRefiner: 296/296 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 51787ms problems are : Problem set: 0 solved, 296 unsolved
Search for dead transitions found 0 dead transitions in 51788ms
Starting structural reductions in LTL mode, iteration 1 : 251/280 places, 297/331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52020 ms. Remains : 251/280 places, 297/331 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) U X(((F(p1) U X(p2)) U X(p3)))))'
Stuttering acceptance computed with spot in 546 ms :[(NOT p3), (NOT p3), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p3), (NOT p3), (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p3), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-15b-LTLFireability-11
Product exploration explored 100000 steps with 571 reset in 193 ms.
Stack based approach found an accepted trace after 308 steps with 2 reset with depth 144 and stack size 144 in 1 ms.
FORMULA DiscoveryGPU-PT-15b-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-15b-LTLFireability-11 finished in 52823 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(p0))&&(G(F(!p1))||(F(!p1)&&F(p2)))))))'
Support contains 5 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 331/331 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 265 transition count 315
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 265 transition count 315
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 39 place count 256 transition count 302
Iterating global reduction 0 with 9 rules applied. Total rules applied 48 place count 256 transition count 302
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 54 place count 250 transition count 295
Iterating global reduction 0 with 6 rules applied. Total rules applied 60 place count 250 transition count 295
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 66 place count 244 transition count 288
Iterating global reduction 0 with 6 rules applied. Total rules applied 72 place count 244 transition count 288
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 74 place count 242 transition count 286
Iterating global reduction 0 with 2 rules applied. Total rules applied 76 place count 242 transition count 286
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 241 transition count 285
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 241 transition count 285
Applied a total of 78 rules in 17 ms. Remains 241 /280 variables (removed 39) and now considering 285/331 (removed 46) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6629216724525718373.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17667323911222660920.kers'
[2026-05-24 07:13:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6629216724525718373.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17667323911222660920.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 285 rows 241 cols 771 entries
Finished phase 1 with 239 SingleSign rule and 0 generalized
[2026-05-24 07:13:21] [INFO ] Computed 2 invariants in 4 ms
Computed 2 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-17667323911222660920.kers
Total runtime 4 ms.
[2026-05-24 07:13:21] [INFO ] Implicit Places using invariants in 69 ms returned []
[2026-05-24 07:13:21] [INFO ] Invariant cache hit.
[2026-05-24 07:13:21] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
Running 284 sub problems to find dead transitions.
[2026-05-24 07:13:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/241 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/241 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (OVERLAPS) 285/526 variables, 241/243 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/526 variables, 15/258 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/526 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (OVERLAPS) 0/526 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Real declared 526/526 variables, and 258 constraints, problems are : Problem set: 0 solved, 284 unsolved in 21171 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 284 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/241 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/241 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (OVERLAPS) 285/526 variables, 241/258 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/526 variables, 284/542 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/526 variables, 0/542 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (OVERLAPS) 0/526 variables, 0/542 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Int declared 526/526 variables, and 542 constraints, problems are : Problem set: 0 solved, 284 unsolved in 28807 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50020ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 50021ms
Starting structural reductions in LTL mode, iteration 1 : 241/280 places, 285/331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50247 ms. Remains : 241/280 places, 285/331 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((F(G(p0))&&(G(F(p1))||(F(p1)&&F(p2)))))))'
Stuttering acceptance computed with spot in 286 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-15b-LTLFireability-13
Stuttering criterion allowed to conclude after 468 steps with 0 reset in 3 ms.
FORMULA DiscoveryGPU-PT-15b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15b-LTLFireability-13 finished in 50591 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 U (G(p0)||X((G((p1||X(p1)))||(F(G(!p1))&&(p1||X(p1)))))))))'
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 331/331 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 265 transition count 315
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 265 transition count 315
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 39 place count 256 transition count 302
Iterating global reduction 0 with 9 rules applied. Total rules applied 48 place count 256 transition count 302
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 55 place count 249 transition count 294
Iterating global reduction 0 with 7 rules applied. Total rules applied 62 place count 249 transition count 294
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 68 place count 243 transition count 287
Iterating global reduction 0 with 6 rules applied. Total rules applied 74 place count 243 transition count 287
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 76 place count 241 transition count 285
Iterating global reduction 0 with 2 rules applied. Total rules applied 78 place count 241 transition count 285
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 240 transition count 284
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 240 transition count 284
Applied a total of 80 rules in 26 ms. Remains 240 /280 variables (removed 40) and now considering 284/331 (removed 47) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17812584064685198907.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14511591926728624524.kers'
[2026-05-24 07:14:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17812584064685198907.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14511591926728624524.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 284 rows 240 cols 769 entries
Finished phase 1 with 238 SingleSign rule and 0 generalized
[2026-05-24 07:14:12] [INFO ] Computed 2 invariants in 3 ms
Computed 2 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-14511591926728624524.kers
Total runtime 3 ms.
[2026-05-24 07:14:12] [INFO ] Implicit Places using invariants in 81 ms returned []
[2026-05-24 07:14:12] [INFO ] Invariant cache hit.
[2026-05-24 07:14:12] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
Running 283 sub problems to find dead transitions.
[2026-05-24 07:14:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (OVERLAPS) 1/240 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (OVERLAPS) 284/524 variables, 240/242 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/524 variables, 15/257 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/524 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (OVERLAPS) 0/524 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 283 unsolved
No progress, stopping.
After SMT solving in domain Real declared 524/524 variables, and 257 constraints, problems are : Problem set: 0 solved, 283 unsolved in 20404 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 283 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (OVERLAPS) 1/240 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (OVERLAPS) 284/524 variables, 240/257 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/524 variables, 283/540 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/524 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (OVERLAPS) 0/524 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 283 unsolved
No progress, stopping.
After SMT solving in domain Int declared 524/524 variables, and 540 constraints, problems are : Problem set: 0 solved, 283 unsolved in 28073 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48511ms problems are : Problem set: 0 solved, 283 unsolved
Search for dead transitions found 0 dead transitions in 48512ms
Starting structural reductions in LTL mode, iteration 1 : 240/280 places, 284/331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48766 ms. Remains : 240/280 places, 284/331 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (G(p0)||X((G((p1||X(p1)))||(F(G(!p1))&&(p1||X(p1)))))))))'
Stuttering acceptance computed with spot in 444 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), false, true, (NOT p1), (AND (NOT p0) (NOT p1)), false, false, p1]
Running random walk in product with property : DiscoveryGPU-PT-15b-LTLFireability-14
Stuttering criterion allowed to conclude after 14969 steps with 30 reset in 37 ms.
FORMULA DiscoveryGPU-PT-15b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15b-LTLFireability-14 finished in 49281 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(((p1 U G(p2))&&p0))))'
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 331/331 transitions.
Graph (complete) has 556 edges and 280 vertex of which 277 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 44 place count 276 transition count 284
Reduce places removed 43 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 45 rules applied. Total rules applied 89 place count 233 transition count 282
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 91 place count 231 transition count 282
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 91 place count 231 transition count 237
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 181 place count 186 transition count 237
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 189 place count 178 transition count 227
Iterating global reduction 3 with 8 rules applied. Total rules applied 197 place count 178 transition count 227
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 202 place count 173 transition count 220
Iterating global reduction 3 with 5 rules applied. Total rules applied 207 place count 173 transition count 220
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 210 place count 170 transition count 216
Iterating global reduction 3 with 3 rules applied. Total rules applied 213 place count 170 transition count 216
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 214 place count 169 transition count 215
Iterating global reduction 3 with 1 rules applied. Total rules applied 215 place count 169 transition count 215
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 0 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 132 rules applied. Total rules applied 347 place count 103 transition count 149
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 361 place count 89 transition count 122
Iterating global reduction 3 with 14 rules applied. Total rules applied 375 place count 89 transition count 122
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 389 place count 75 transition count 106
Iterating global reduction 3 with 14 rules applied. Total rules applied 403 place count 75 transition count 106
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 415 place count 63 transition count 83
Iterating global reduction 3 with 12 rules applied. Total rules applied 427 place count 63 transition count 83
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 439 place count 51 transition count 70
Iterating global reduction 3 with 12 rules applied. Total rules applied 451 place count 51 transition count 70
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 462 place count 40 transition count 49
Iterating global reduction 3 with 11 rules applied. Total rules applied 473 place count 40 transition count 49
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 484 place count 29 transition count 37
Iterating global reduction 3 with 11 rules applied. Total rules applied 495 place count 29 transition count 37
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 496 place count 28 transition count 36
Iterating global reduction 3 with 1 rules applied. Total rules applied 497 place count 28 transition count 36
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 498 place count 28 transition count 35
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 500 place count 26 transition count 33
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 502 place count 25 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 503 place count 24 transition count 32
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 503 place count 24 transition count 28
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 511 place count 20 transition count 28
Applied a total of 511 rules in 26 ms. Remains 20 /280 variables (removed 260) and now considering 28/331 (removed 303) transitions.
[2026-05-24 07:15:01] [INFO ] Flow matrix only has 24 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15975120927566386276.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1607351008568843320.kers'
[2026-05-24 07:15:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15975120927566386276.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1607351008568843320.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 24 rows 19 cols 58 entries
Finished phase 1 with 19 SingleSign rule and 0 generalized
[2026-05-24 07:15:01] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1607351008568843320.kers
Total runtime 0 ms.
[2026-05-24 07:15:01] [INFO ] Implicit Places using invariants in 22 ms returned []
[2026-05-24 07:15:01] [INFO ] Flow matrix only has 24 transitions (discarded 4 similar events)
[2026-05-24 07:15:01] [INFO ] Invariant cache hit.
[2026-05-24 07:15:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 07:15:01] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2026-05-24 07:15:01] [INFO ] Redundant transitions in 0 ms returned []
Running 27 sub problems to find dead transitions.
[2026-05-24 07:15:01] [INFO ] Flow matrix only has 24 transitions (discarded 4 similar events)
[2026-05-24 07:15:01] [INFO ] Invariant cache hit.
[2026-05-24 07:15:01] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 1/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 24/44 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (OVERLAPS) 0/44 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 44/44 variables, and 22 constraints, problems are : Problem set: 0 solved, 27 unsolved in 254 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 1/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 24/44 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 27/49 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (OVERLAPS) 0/44 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 44/44 variables, and 49 constraints, problems are : Problem set: 0 solved, 27 unsolved in 341 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 598ms problems are : Problem set: 0 solved, 27 unsolved
Search for dead transitions found 0 dead transitions in 599ms
Starting structural reductions in SI_LTL mode, iteration 1 : 20/280 places, 28/331 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 694 ms. Remains : 20/280 places, 28/331 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(((p1 U G(p2))&&p0))))'
Stuttering acceptance computed with spot in 174 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p2), (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-15b-LTLFireability-15
Stuttering criterion allowed to conclude after 204 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-15b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15b-LTLFireability-15 finished in 902 ms.
All properties solved by simple procedures.
Total runtime 519272 ms.

BK_STOP 1779606902245

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ 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 LTLFireability -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="DiscoveryGPU-PT-15b"
export BK_EXAMINATION="LTLFireability"
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 DiscoveryGPU-PT-15b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r098-tall-177955695500388"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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