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.r146-tall-177961074200436.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 GPUForwardProgress-PT-16b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961074200436
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 6.7K Mar 7 11:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Mar 7 11:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Mar 7 11:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Mar 7 11:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 10:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 10:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 10:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 10:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K Mar 7 11:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Mar 7 11:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Mar 7 11:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Mar 7 11:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 10:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 10:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 84K 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 GPUForwardProgress-PT-16b-LTLFireability-00
FORMULA_NAME GPUForwardProgress-PT-16b-LTLFireability-01
FORMULA_NAME GPUForwardProgress-PT-16b-LTLFireability-02
FORMULA_NAME GPUForwardProgress-PT-16b-LTLFireability-03
FORMULA_NAME GPUForwardProgress-PT-16b-LTLFireability-04
FORMULA_NAME GPUForwardProgress-PT-16b-LTLFireability-05
FORMULA_NAME GPUForwardProgress-PT-16b-LTLFireability-06
FORMULA_NAME GPUForwardProgress-PT-16b-LTLFireability-07
FORMULA_NAME GPUForwardProgress-PT-16b-LTLFireability-08
FORMULA_NAME GPUForwardProgress-PT-16b-LTLFireability-09
FORMULA_NAME GPUForwardProgress-PT-16b-LTLFireability-10
FORMULA_NAME GPUForwardProgress-PT-16b-LTLFireability-11
FORMULA_NAME GPUForwardProgress-PT-16b-LTLFireability-12
FORMULA_NAME GPUForwardProgress-PT-16b-LTLFireability-13
FORMULA_NAME GPUForwardProgress-PT-16b-LTLFireability-14
FORMULA_NAME GPUForwardProgress-PT-16b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779726638988

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPUForwardProgress-PT-16b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-25 16:30:40] [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-25 16:30:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 16:30:40] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2026-05-25 16:30:40] [INFO ] Transformed 340 places.
[2026-05-25 16:30:40] [INFO ] Transformed 357 transitions.
[2026-05-25 16:30:40] [INFO ] Found NUPN structural information;
[2026-05-25 16:30:40] [INFO ] Parsed PT model containing 340 places and 357 transitions and 877 arcs in 170 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA GPUForwardProgress-PT-16b-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-16b-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 340 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 340/340 places, 357/357 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 339 transition count 357
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 32 place count 308 transition count 326
Iterating global reduction 1 with 31 rules applied. Total rules applied 63 place count 308 transition count 326
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 74 place count 297 transition count 315
Iterating global reduction 1 with 11 rules applied. Total rules applied 85 place count 297 transition count 315
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 94 place count 297 transition count 306
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 95 place count 296 transition count 305
Iterating global reduction 2 with 1 rules applied. Total rules applied 96 place count 296 transition count 305
Applied a total of 96 rules in 83 ms. Remains 296 /340 variables (removed 44) and now considering 305/357 (removed 52) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-132143888681609449.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8030552554349769200.kers'
[2026-05-25 16:30:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-132143888681609449.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8030552554349769200.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 305 rows 296 cols 771 entries
Finished phase 1 with 278 SingleSign rule and 1 generalized
[2026-05-25 16:30:40] [INFO ] Computed 17 invariants in 2 ms
Computed 17 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-8030552554349769200.kers
Total runtime 3 ms.
[2026-05-25 16:30:40] [INFO ] Implicit Places using invariants in 233 ms returned []
[2026-05-25 16:30:40] [INFO ] Invariant cache hit.
[2026-05-25 16:30:41] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 485 ms to find 0 implicit places.
Running 304 sub problems to find dead transitions.
[2026-05-25 16:30:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/295 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/295 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 2 (OVERLAPS) 305/600 variables, 295/312 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/600 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 4 (OVERLAPS) 1/601 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/601 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 6 (OVERLAPS) 0/601 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 304 unsolved
No progress, stopping.
After SMT solving in domain Real declared 601/601 variables, and 313 constraints, problems are : Problem set: 0 solved, 304 unsolved in 27493 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 296/296 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 304 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/295 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/295 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 2 (OVERLAPS) 305/600 variables, 295/312 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/600 variables, 304/616 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/600 variables, 0/616 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 5 (OVERLAPS) 1/601 variables, 1/617 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/601 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 601/601 variables, and 617 constraints, problems are : Problem set: 0 solved, 304 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 296/296 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57612ms problems are : Problem set: 0 solved, 304 unsolved
Search for dead transitions found 0 dead transitions in 57626ms
Starting structural reductions in LTL mode, iteration 1 : 296/340 places, 305/357 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58245 ms. Remains : 296/340 places, 305/357 transitions.
Starting structural reductions in LTL mode, iteration 0 : 296/296 places, 305/305 transitions.
Applied a total of 0 rules in 7 ms. Remains 296 /296 variables (removed 0) and now considering 305/305 (removed 0) transitions.
[2026-05-25 16:31:38] [INFO ] Invariant cache hit.
[2026-05-25 16:31:38] [INFO ] Implicit Places using invariants in 72 ms returned []
[2026-05-25 16:31:38] [INFO ] Invariant cache hit.
[2026-05-25 16:31:38] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 248 ms. Remains : 296/296 places, 305/305 transitions.
Support contains 33 out of 296 places after structural reductions.
[2026-05-25 16:31:39] [INFO ] Flatten gal took : 54 ms
[2026-05-25 16:31:39] [INFO ] Flatten gal took : 20 ms
[2026-05-25 16:31:39] [INFO ] Input system was already deterministic with 305 transitions.
Reduction of identical properties reduced properties to check from 30 to 29
RANDOM walk for 40000 steps (274 resets) in 1605 ms. (24 steps per ms) remains 2/29 properties
BEST_FIRST walk for 40003 steps (33 resets) in 123 ms. (322 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (32 resets) in 239 ms. (166 steps per ms) remains 1/2 properties
[2026-05-25 16:31:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 32/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 262/295 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 305/600 variables, 295/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/600 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/601 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/601 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/601 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 601/601 variables, and 313 constraints, problems are : Problem set: 0 solved, 1 unsolved in 222 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 296/296 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 32/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 262/295 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 305/600 variables, 295/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/600 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/600 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/601 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/601 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/601 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 601/601 variables, and 314 constraints, problems are : Problem set: 0 solved, 1 unsolved in 203 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 296/296 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 430ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 76 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=76 )
Parikh walk visited 1 properties in 7 ms.
Computed a total of 56 stabilizing places and 56 stable transitions
Graph (complete) has 458 edges and 296 vertex of which 276 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.9 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(p0) U p1) U (p0&&(F(p0) U p1)))))'
Support contains 2 out of 296 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 296/296 places, 305/305 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 284 transition count 293
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 284 transition count 293
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 28 place count 284 transition count 289
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 31 place count 281 transition count 286
Iterating global reduction 1 with 3 rules applied. Total rules applied 34 place count 281 transition count 286
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 37 place count 281 transition count 283
Applied a total of 37 rules in 17 ms. Remains 281 /296 variables (removed 15) and now considering 283/305 (removed 22) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17397032026511972138.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8838039817838840346.kers'
[2026-05-25 16:31:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17397032026511972138.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8838039817838840346.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 283 rows 281 cols 727 entries
Finished phase 1 with 263 SingleSign rule and 1 generalized
[2026-05-25 16:31:40] [INFO ] Computed 17 invariants in 1 ms
Computed 17 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8838039817838840346.kers
Total runtime 1 ms.
[2026-05-25 16:31:40] [INFO ] Implicit Places using invariants in 79 ms returned []
[2026-05-25 16:31:40] [INFO ] Invariant cache hit.
[2026-05-25 16:31:41] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
Running 282 sub problems to find dead transitions.
[2026-05-25 16:31:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/280 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/280 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (OVERLAPS) 283/563 variables, 280/297 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/563 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (OVERLAPS) 1/564 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/564 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (OVERLAPS) 0/564 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 282 unsolved
No progress, stopping.
After SMT solving in domain Real declared 564/564 variables, and 298 constraints, problems are : Problem set: 0 solved, 282 unsolved in 23346 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 281/281 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 282 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/280 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/280 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (OVERLAPS) 283/563 variables, 280/297 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/563 variables, 282/579 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/563 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (OVERLAPS) 1/564 variables, 1/580 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/564 variables, 0/580 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 7 (OVERLAPS) 0/564 variables, 0/580 constraints. Problems are: Problem set: 0 solved, 282 unsolved
No progress, stopping.
After SMT solving in domain Int declared 564/564 variables, and 580 constraints, problems are : Problem set: 0 solved, 282 unsolved in 29223 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 281/281 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 52602ms problems are : Problem set: 0 solved, 282 unsolved
Search for dead transitions found 0 dead transitions in 52603ms
Starting structural reductions in LTL mode, iteration 1 : 281/296 places, 283/305 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52884 ms. Remains : 281/296 places, 283/305 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(p0) U p1) U (p0&&(F(p0) U p1)))))'
Stuttering acceptance computed with spot in 313 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-16b-LTLFireability-00
Stuttering criterion allowed to conclude after 137 steps with 0 reset in 2 ms.
FORMULA GPUForwardProgress-PT-16b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-16b-LTLFireability-00 finished in 53277 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((G(p0)||(p0&&F((!p1&&X(!p1)))))) U (p1||F(p2)))))'
Support contains 5 out of 296 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 296/296 places, 305/305 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 284 transition count 293
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 284 transition count 293
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 28 place count 284 transition count 289
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 30 place count 282 transition count 287
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 282 transition count 287
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 34 place count 282 transition count 285
Applied a total of 34 rules in 22 ms. Remains 282 /296 variables (removed 14) and now considering 285/305 (removed 20) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10384451937822795366.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8804329300587355422.kers'
[2026-05-25 16:32:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10384451937822795366.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8804329300587355422.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 285 rows 282 cols 731 entries
Finished phase 1 with 264 SingleSign rule and 1 generalized
[2026-05-25 16:32:34] [INFO ] Computed 17 invariants in 1 ms
Computed 17 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8804329300587355422.kers
Total runtime 4 ms.
[2026-05-25 16:32:34] [INFO ] Implicit Places using invariants in 89 ms returned []
[2026-05-25 16:32:34] [INFO ] Invariant cache hit.
[2026-05-25 16:32:34] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
Running 284 sub problems to find dead transitions.
[2026-05-25 16:32:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/281 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/281 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (OVERLAPS) 285/566 variables, 281/298 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/566 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (OVERLAPS) 1/567 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/567 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (OVERLAPS) 0/567 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Real declared 567/567 variables, and 299 constraints, problems are : Problem set: 0 solved, 284 unsolved in 23708 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 282/282 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 0/0 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/281 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/281 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (OVERLAPS) 285/566 variables, 281/298 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/566 variables, 284/582 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/566 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (OVERLAPS) 1/567 variables, 1/583 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/567 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (OVERLAPS) 0/567 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Int declared 567/567 variables, and 583 constraints, problems are : Problem set: 0 solved, 284 unsolved in 28913 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 282/282 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 52650ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 52652ms
Starting structural reductions in LTL mode, iteration 1 : 282/296 places, 285/305 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52939 ms. Remains : 282/296 places, 285/305 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((G(p0)||(p0&&F((!p1&&X(!p1)))))) U (F(p2)||p1))))'
Stuttering acceptance computed with spot in 218 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Running random walk in product with property : GPUForwardProgress-PT-16b-LTLFireability-01
Product exploration explored 100000 steps with 28724 reset in 209 ms.
Product exploration explored 100000 steps with 28613 reset in 204 ms.
Computed a total of 51 stabilizing places and 51 stable transitions
Graph (complete) has 438 edges and 282 vertex of which 262 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.6 ms
Computed a total of 51 stabilizing places and 51 stable transitions
Detected a total of 51/282 stabilizing places and 51/285 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge based reduction with 20 factoid took 79 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter sensitive) to 5 states, 16 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (276 resets) in 366 ms. (108 steps per ms) remains 1/9 properties
BEST_FIRST walk for 40001 steps (29 resets) in 124 ms. (320 steps per ms) remains 1/1 properties
[2026-05-25 16:33:28] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 81/86 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 195/281 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/281 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 285/566 variables, 281/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/566 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf7 is UNSAT
After SMT solving in domain Real declared 567/567 variables, and 299 constraints, problems are : Problem set: 1 solved, 0 unsolved in 145 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 282/282 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 155ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge based reduction with 21 factoid took 253 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter sensitive) to 5 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 234 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
[2026-05-25 16:33:28] [INFO ] Invariant cache hit.
[2026-05-25 16:33:28] [INFO ] [Real]Absence check using 0 positive and 17 generalized place invariants in 5 ms returned sat
[2026-05-25 16:33:29] [INFO ] [Real]Absence check using state equation in 691 ms returned sat
[2026-05-25 16:33:29] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 16:33:29] [INFO ] [Nat]Absence check using 0 positive and 17 generalized place invariants in 6 ms returned sat
[2026-05-25 16:33:30] [INFO ] [Nat]Absence check using state equation in 959 ms returned sat
[2026-05-25 16:33:30] [INFO ] Computed and/alt/rep : 279/367/279 causal constraints (skipped 5 transitions) in 17 ms.
[2026-05-25 16:33:31] [INFO ] Added : 73 causal constraints over 15 iterations in 639 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Knowledge-based reduction took 3491 ms.
Stuttering acceptance computed with spot in 202 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
Support contains 5 out of 282 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 282/282 places, 285/285 transitions.
Applied a total of 0 rules in 13 ms. Remains 282 /282 variables (removed 0) and now considering 285/285 (removed 0) transitions.
[2026-05-25 16:33:31] [INFO ] Invariant cache hit.
[2026-05-25 16:33:31] [INFO ] Implicit Places using invariants in 70 ms returned []
[2026-05-25 16:33:31] [INFO ] Invariant cache hit.
[2026-05-25 16:33:31] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 238 ms. Remains : 282/282 places, 285/285 transitions.
Computed a total of 51 stabilizing places and 51 stable transitions
Graph (complete) has 438 edges and 282 vertex of which 262 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.8 ms
Computed a total of 51 stabilizing places and 51 stable transitions
Detected a total of 51/282 stabilizing places and 51/285 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge based reduction with 18 factoid took 85 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter sensitive) to 5 states, 14 edges and 3 AP (stutter sensitive).
RANDOM walk for 27338 steps (192 resets) in 157 ms. (173 steps per ms) remains 0/8 properties
Knowledge based reduction with 18 factoid took 252 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter sensitive) to 5 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 224 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
[2026-05-25 16:33:32] [INFO ] Invariant cache hit.
[2026-05-25 16:33:32] [INFO ] [Real]Absence check using 0 positive and 17 generalized place invariants in 5 ms returned sat
[2026-05-25 16:33:33] [INFO ] [Real]Absence check using state equation in 688 ms returned sat
[2026-05-25 16:33:33] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 16:33:33] [INFO ] [Nat]Absence check using 0 positive and 17 generalized place invariants in 5 ms returned sat
[2026-05-25 16:33:34] [INFO ] [Nat]Absence check using state equation in 954 ms returned sat
[2026-05-25 16:33:34] [INFO ] Computed and/alt/rep : 279/367/279 causal constraints (skipped 5 transitions) in 15 ms.
[2026-05-25 16:33:34] [INFO ] Added : 73 causal constraints over 15 iterations in 636 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Knowledge-based reduction took 3206 ms.
Stuttering acceptance computed with spot in 194 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
Stuttering acceptance computed with spot in 220 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
Product exploration explored 100000 steps with 28539 reset in 134 ms.
Product exploration explored 100000 steps with 28528 reset in 130 ms.
Spot run failed in 71 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin883848039382249982
[2026-05-25 16:33:35] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin883848039382249982
Running compilation step : cd /tmp/ltsmin883848039382249982;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 508 ms.
Running link step : cd /tmp/ltsmin883848039382249982;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin883848039382249982;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased12781753039354564225.hoa' '--buchi-type=spotba'
LTSmin run took 52 ms.
FORMULA GPUForwardProgress-PT-16b-LTLFireability-01 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property GPUForwardProgress-PT-16b-LTLFireability-01 finished in 62231 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 U (p1||G(!p0))))))'
Support contains 5 out of 296 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 296/296 places, 305/305 transitions.
Graph (trivial) has 247 edges and 296 vertex of which 6 / 296 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 452 edges and 291 vertex of which 271 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.2 ms
Discarding 20 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 138 transitions
Trivial Post-agglo rules discarded 138 transitions
Performed 138 trivial Post agglomeration. Transition count delta: 138
Iterating post reduction 0 with 138 rules applied. Total rules applied 140 place count 270 transition count 157
Reduce places removed 138 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 149 rules applied. Total rules applied 289 place count 132 transition count 146
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 293 place count 128 transition count 146
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 293 place count 128 transition count 111
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 363 place count 93 transition count 111
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 378 place count 78 transition count 96
Iterating global reduction 3 with 15 rules applied. Total rules applied 393 place count 78 transition count 96
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 491 place count 29 transition count 47
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 492 place count 29 transition count 46
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 507 place count 14 transition count 17
Iterating global reduction 4 with 15 rules applied. Total rules applied 522 place count 14 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 524 place count 13 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 525 place count 12 transition count 15
Applied a total of 525 rules in 34 ms. Remains 12 /296 variables (removed 284) and now considering 15/305 (removed 290) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16818666151991882537.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1436047362018525202.kers'
[2026-05-25 16:33:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16818666151991882537.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1436047362018525202.kers]
Normalized transition count is 14 out of 15 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 14 rows 12 cols 46 entries
Finished phase 1 with 12 SingleSign rule and 0 generalized
[2026-05-25 16:33:36] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1436047362018525202.kers
Total runtime 0 ms.
[2026-05-25 16:33:36] [INFO ] Implicit Places using invariants in 16 ms returned []
[2026-05-25 16:33:36] [INFO ] Invariant cache hit.
[2026-05-25 16:33:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 16:33:36] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2026-05-25 16:33:36] [INFO ] Redundant transitions in 12 ms returned []
Running 11 sub problems to find dead transitions.
[2026-05-25 16:33:36] [INFO ] Invariant cache hit.
[2026-05-25 16:33:36] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 14/22 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 4/26 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 1/27 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 0/27 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 27/27 variables, and 13 constraints, problems are : Problem set: 0 solved, 11 unsolved in 126 ms.
Refiners :[State Equation: 12/12 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 14/22 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 4/26 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 10/23 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 1/27 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/27 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 0/27 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 27/27 variables, and 24 constraints, problems are : Problem set: 0 solved, 11 unsolved in 137 ms.
Refiners :[State Equation: 12/12 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 268ms problems are : Problem set: 0 solved, 11 unsolved
Search for dead transitions found 0 dead transitions in 268ms
Starting structural reductions in SI_LTL mode, iteration 1 : 12/296 places, 15/305 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 360 ms. Remains : 12/296 places, 15/305 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 U (G(!p0)||p1)))))'
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : GPUForwardProgress-PT-16b-LTLFireability-03
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-16b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-16b-LTLFireability-03 finished in 447 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 296 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 296/296 places, 305/305 transitions.
Graph (trivial) has 252 edges and 296 vertex of which 6 / 296 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 452 edges and 291 vertex of which 271 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Discarding 20 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 140 transitions
Trivial Post-agglo rules discarded 140 transitions
Performed 140 trivial Post agglomeration. Transition count delta: 140
Iterating post reduction 0 with 140 rules applied. Total rules applied 142 place count 270 transition count 155
Reduce places removed 140 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 151 rules applied. Total rules applied 293 place count 130 transition count 144
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 297 place count 126 transition count 144
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 36 Pre rules applied. Total rules applied 297 place count 126 transition count 108
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 369 place count 90 transition count 108
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 384 place count 75 transition count 93
Iterating global reduction 3 with 15 rules applied. Total rules applied 399 place count 75 transition count 93
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 499 place count 25 transition count 43
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 500 place count 25 transition count 42
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 516 place count 9 transition count 11
Iterating global reduction 4 with 16 rules applied. Total rules applied 532 place count 9 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 534 place count 8 transition count 10
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 535 place count 7 transition count 9
Applied a total of 535 rules in 49 ms. Remains 7 /296 variables (removed 289) and now considering 9/305 (removed 296) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10768157807377899498.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4630888107857491244.kers'
[2026-05-25 16:33:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10768157807377899498.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4630888107857491244.kers]
Normalized transition count is 8 out of 9 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 8 rows 7 cols 16 entries
Finished phase 1 with 7 SingleSign rule and 0 generalized
[2026-05-25 16:33:36] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4630888107857491244.kers
Total runtime 0 ms.
[2026-05-25 16:33:36] [INFO ] Implicit Places using invariants in 16 ms returned []
[2026-05-25 16:33:36] [INFO ] Invariant cache hit.
[2026-05-25 16:33:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 16:33:36] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2026-05-25 16:33:36] [INFO ] Redundant transitions in 11 ms returned []
Running 5 sub problems to find dead transitions.
[2026-05-25 16:33:36] [INFO ] Invariant cache hit.
[2026-05-25 16:33:36] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 8/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 2/15 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1/16 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/16 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 16/16 variables, and 8 constraints, problems are : Problem set: 0 solved, 5 unsolved in 60 ms.
Refiners :[State Equation: 7/7 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 8/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 2/15 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 1/16 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/16 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 16/16 variables, and 13 constraints, problems are : Problem set: 0 solved, 5 unsolved in 68 ms.
Refiners :[State Equation: 7/7 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 131ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 131ms
Starting structural reductions in SI_LTL mode, iteration 1 : 7/296 places, 9/305 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 236 ms. Remains : 7/296 places, 9/305 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 44 ms :[(NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-16b-LTLFireability-04
Stuttering criterion allowed to conclude after 6 steps with 1 reset in 0 ms.
FORMULA GPUForwardProgress-PT-16b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-16b-LTLFireability-04 finished in 309 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(!(((p0 U p1)&&p2) U X(X(X(p0)))))))'
Support contains 5 out of 296 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 296/296 places, 305/305 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 283 transition count 292
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 283 transition count 292
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 30 place count 283 transition count 288
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 33 place count 280 transition count 285
Iterating global reduction 1 with 3 rules applied. Total rules applied 36 place count 280 transition count 285
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 39 place count 280 transition count 282
Applied a total of 39 rules in 23 ms. Remains 280 /296 variables (removed 16) and now considering 282/305 (removed 23) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7616358384685510043.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16884334121803365324.kers'
[2026-05-25 16:33:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7616358384685510043.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16884334121803365324.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 282 rows 280 cols 725 entries
Finished phase 1 with 262 SingleSign rule and 1 generalized
[2026-05-25 16:33:37] [INFO ] Computed 17 invariants in 1 ms
Computed 17 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16884334121803365324.kers
Total runtime 1 ms.
[2026-05-25 16:33:37] [INFO ] Implicit Places using invariants in 80 ms returned []
[2026-05-25 16:33:37] [INFO ] Invariant cache hit.
[2026-05-25 16:33:37] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
Running 281 sub problems to find dead transitions.
[2026-05-25 16:33:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/279 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/279 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (OVERLAPS) 282/561 variables, 279/296 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/561 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 4 (OVERLAPS) 1/562 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/562 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 6 (OVERLAPS) 0/562 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 281 unsolved
No progress, stopping.
After SMT solving in domain Real declared 562/562 variables, and 297 constraints, problems are : Problem set: 0 solved, 281 unsolved in 22662 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 281 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/279 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/279 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (OVERLAPS) 282/561 variables, 279/296 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/561 variables, 281/577 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/561 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 5 (OVERLAPS) 1/562 variables, 1/578 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/562 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 7 (OVERLAPS) 0/562 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 281 unsolved
No progress, stopping.
After SMT solving in domain Int declared 562/562 variables, and 578 constraints, problems are : Problem set: 0 solved, 281 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 52717ms problems are : Problem set: 0 solved, 281 unsolved
Search for dead transitions found 0 dead transitions in 52719ms
Starting structural reductions in LTL mode, iteration 1 : 280/296 places, 282/305 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52978 ms. Remains : 280/296 places, 282/305 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(!(((p0 U p1)&&p2) U X(X(X(p0)))))))'
Stuttering acceptance computed with spot in 793 ms :[p0, p0, p0, (AND p0 p1), p0, p0, (AND p0 p1), (AND p0 p1), p0, p0, (AND p0 p1), p0, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Running random walk in product with property : GPUForwardProgress-PT-16b-LTLFireability-05
Product exploration explored 100000 steps with 20000 reset in 109 ms.
Product exploration explored 100000 steps with 20000 reset in 110 ms.
Computed a total of 51 stabilizing places and 51 stable transitions
Graph (complete) has 435 edges and 280 vertex of which 260 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.3 ms
Computed a total of 51 stabilizing places and 51 stable transitions
Knowledge based reduction with 12 factoid took 547 ms. Reduced automaton from 17 states, 57 edges and 3 AP (stutter sensitive) to 17 states, 57 edges and 3 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 8 to 6
RANDOM walk for 40000 steps (273 resets) in 167 ms. (238 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40003 steps (33 resets) in 269 ms. (148 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (37 resets) in 83 ms. (476 steps per ms) remains 2/2 properties
[2026-05-25 16:34:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 94/99 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 180/279 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 282/561 variables, 279/296 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/561 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/562 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/562 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/562 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 562/562 variables, and 297 constraints, problems are : Problem set: 0 solved, 2 unsolved in 245 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 94/99 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 180/279 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 282/561 variables, 279/296 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/561 variables, 2/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/561 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/562 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/562 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/562 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 562/562 variables, and 299 constraints, problems are : Problem set: 0 solved, 2 unsolved in 340 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 590ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 158 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=52 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 4 ms.
Knowledge based reduction with 12 factoid took 640 ms. Reduced automaton from 17 states, 57 edges and 3 AP (stutter sensitive) to 17 states, 57 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 791 ms :[p0, p0, p0, (AND p0 p1), p0, p0, (AND p0 p1), (AND p0 p1), p0, p0, (AND p0 p1), p0, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Knowledge-based reduction took 2750 ms.
Stuttering acceptance computed with spot in 818 ms :[p0, p0, p0, (AND p0 p1), p0, p0, (AND p0 p1), (AND p0 p1), p0, p0, (AND p0 p1), p0, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Support contains 5 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 282/282 transitions.
Applied a total of 0 rules in 8 ms. Remains 280 /280 variables (removed 0) and now considering 282/282 (removed 0) transitions.
[2026-05-25 16:34:34] [INFO ] Invariant cache hit.
[2026-05-25 16:34:34] [INFO ] Implicit Places using invariants in 69 ms returned []
[2026-05-25 16:34:34] [INFO ] Invariant cache hit.
[2026-05-25 16:34:34] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 226 ms. Remains : 280/280 places, 282/282 transitions.
Computed a total of 51 stabilizing places and 51 stable transitions
Graph (complete) has 435 edges and 280 vertex of which 260 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.2 ms
Computed a total of 51 stabilizing places and 51 stable transitions
Knowledge based reduction with 12 factoid took 535 ms. Reduced automaton from 17 states, 57 edges and 3 AP (stutter sensitive) to 17 states, 57 edges and 3 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 8 to 6
RANDOM walk for 40000 steps (277 resets) in 230 ms. (173 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40003 steps (32 resets) in 81 ms. (487 steps per ms) remains 1/2 properties
[2026-05-25 16:34:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 94/99 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 180/279 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 282/561 variables, 279/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/561 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/562 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/562 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/562 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 562/562 variables, and 297 constraints, problems are : Problem set: 0 solved, 1 unsolved in 198 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 94/99 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 180/279 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 282/561 variables, 279/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/561 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/561 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/562 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/562 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/562 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 562/562 variables, and 298 constraints, problems are : Problem set: 0 solved, 1 unsolved in 236 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 438ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 158 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=79 )
Parikh walk visited 1 properties in 10 ms.
Knowledge based reduction with 12 factoid took 635 ms. Reduced automaton from 17 states, 57 edges and 3 AP (stutter sensitive) to 17 states, 57 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 787 ms :[p0, p0, p0, (AND p0 p1), p0, p0, (AND p0 p1), (AND p0 p1), p0, p0, (AND p0 p1), p0, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Knowledge-based reduction took 2518 ms.
Stuttering acceptance computed with spot in 799 ms :[p0, p0, p0, (AND p0 p1), p0, p0, (AND p0 p1), (AND p0 p1), p0, p0, (AND p0 p1), p0, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 850 ms :[p0, p0, p0, (AND p0 p1), p0, p0, (AND p0 p1), (AND p0 p1), p0, p0, (AND p0 p1), p0, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Product exploration explored 100000 steps with 20000 reset in 96 ms.
Product exploration explored 100000 steps with 20000 reset in 102 ms.
Spot run failed in 45 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin12758889544805796679
[2026-05-25 16:34:39] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12758889544805796679
Running compilation step : cd /tmp/ltsmin12758889544805796679;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 410 ms.
Running link step : cd /tmp/ltsmin12758889544805796679;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin12758889544805796679;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased6588252152421230636.hoa' '--buchi-type=spotba'
LTSmin run took 34 ms.
FORMULA GPUForwardProgress-PT-16b-LTLFireability-05 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property GPUForwardProgress-PT-16b-LTLFireability-05 finished in 62809 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(G(((p2||X(!p0))&&p1)))))'
Support contains 5 out of 296 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 296/296 places, 305/305 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 284 transition count 293
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 284 transition count 293
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 28 place count 284 transition count 289
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 31 place count 281 transition count 286
Iterating global reduction 1 with 3 rules applied. Total rules applied 34 place count 281 transition count 286
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 37 place count 281 transition count 283
Applied a total of 37 rules in 16 ms. Remains 281 /296 variables (removed 15) and now considering 283/305 (removed 22) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9853223715016032431.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3386071129613519582.kers'
[2026-05-25 16:34:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9853223715016032431.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3386071129613519582.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 283 rows 281 cols 727 entries
Finished phase 1 with 263 SingleSign rule and 1 generalized
[2026-05-25 16:34:39] [INFO ] Computed 17 invariants in 1 ms
Computed 17 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3386071129613519582.kers
Total runtime 2 ms.
[2026-05-25 16:34:40] [INFO ] Implicit Places using invariants in 85 ms returned []
[2026-05-25 16:34:40] [INFO ] Invariant cache hit.
[2026-05-25 16:34:40] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
Running 282 sub problems to find dead transitions.
[2026-05-25 16:34:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/280 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/280 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (OVERLAPS) 283/563 variables, 280/297 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/563 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (OVERLAPS) 1/564 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/564 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (OVERLAPS) 0/564 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 282 unsolved
No progress, stopping.
After SMT solving in domain Real declared 564/564 variables, and 298 constraints, problems are : Problem set: 0 solved, 282 unsolved in 22439 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 281/281 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 282 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/280 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/280 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (OVERLAPS) 283/563 variables, 280/297 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/563 variables, 282/579 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/563 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (OVERLAPS) 1/564 variables, 1/580 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/564 variables, 0/580 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 7 (OVERLAPS) 0/564 variables, 0/580 constraints. Problems are: Problem set: 0 solved, 282 unsolved
No progress, stopping.
After SMT solving in domain Int declared 564/564 variables, and 580 constraints, problems are : Problem set: 0 solved, 282 unsolved in 28992 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 281/281 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 51458ms problems are : Problem set: 0 solved, 282 unsolved
Search for dead transitions found 0 dead transitions in 51459ms
Starting structural reductions in LTL mode, iteration 1 : 281/296 places, 283/305 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51710 ms. Remains : 281/296 places, 283/305 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(G(((p2||X(!p0))&&p1)))))'
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p1) (AND p0 (NOT p2))), (OR (NOT p1) (AND p0 (NOT p2))), true, (AND p1 p0), (OR (AND p0 (NOT p2)) (AND p0 (NOT p1)))]
Running random walk in product with property : GPUForwardProgress-PT-16b-LTLFireability-06
Entered a terminal (fully accepting) state of product in 27 steps with 0 reset in 8 ms.
FORMULA GPUForwardProgress-PT-16b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-16b-LTLFireability-06 finished in 51915 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)||G(p1))) U p0))'
Support contains 2 out of 296 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 296/296 places, 305/305 transitions.
Graph (trivial) has 250 edges and 296 vertex of which 6 / 296 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 452 edges and 291 vertex of which 271 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Discarding 20 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 139 transitions
Trivial Post-agglo rules discarded 139 transitions
Performed 139 trivial Post agglomeration. Transition count delta: 139
Iterating post reduction 0 with 139 rules applied. Total rules applied 141 place count 270 transition count 156
Reduce places removed 139 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 146 rules applied. Total rules applied 287 place count 131 transition count 149
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 289 place count 129 transition count 149
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 36 Pre rules applied. Total rules applied 289 place count 129 transition count 113
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 361 place count 93 transition count 113
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 376 place count 78 transition count 98
Iterating global reduction 3 with 15 rules applied. Total rules applied 391 place count 78 transition count 98
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 489 place count 29 transition count 49
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 490 place count 29 transition count 48
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 504 place count 15 transition count 21
Iterating global reduction 4 with 14 rules applied. Total rules applied 518 place count 15 transition count 21
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 1
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 524 place count 12 transition count 20
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 528 place count 12 transition count 20
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 529 place count 11 transition count 19
Applied a total of 529 rules in 15 ms. Remains 11 /296 variables (removed 285) and now considering 19/305 (removed 286) transitions.
[2026-05-25 16:35:31] [INFO ] Flow matrix only has 17 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-8516396678594033464.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5220440185849706599.kers'
[2026-05-25 16:35:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8516396678594033464.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5220440185849706599.kers]
Normalized transition count is 16 out of 17 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 16 rows 11 cols 40 entries
Finished phase 1 with 11 SingleSign rule and 0 generalized
[2026-05-25 16:35:31] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5220440185849706599.kers
Total runtime 0 ms.
[2026-05-25 16:35:31] [INFO ] Implicit Places using invariants in 29 ms returned []
[2026-05-25 16:35:31] [INFO ] Flow matrix only has 17 transitions (discarded 2 similar events)
[2026-05-25 16:35:31] [INFO ] Invariant cache hit.
[2026-05-25 16:35:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 16:35:31] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2026-05-25 16:35:31] [INFO ] Redundant transitions in 13 ms returned []
Running 10 sub problems to find dead transitions.
[2026-05-25 16:35:31] [INFO ] Flow matrix only has 17 transitions (discarded 2 similar events)
[2026-05-25 16:35:31] [INFO ] Invariant cache hit.
[2026-05-25 16:35:31] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 16/24 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 3/27 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 1/28 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/28 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 28/28 variables, and 12 constraints, problems are : Problem set: 0 solved, 10 unsolved in 109 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 16/24 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 3/27 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 8/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 1/28 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 0/28 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 28/28 variables, and 22 constraints, problems are : Problem set: 0 solved, 10 unsolved in 134 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 291ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 291ms
Starting structural reductions in SI_LTL mode, iteration 1 : 11/296 places, 19/305 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 392 ms. Remains : 11/296 places, 19/305 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)||G(p1))) U p0))'
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-16b-LTLFireability-07
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-16b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-16b-LTLFireability-07 finished in 489 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(G((p0||X(G(p1)))))))'
Support contains 2 out of 296 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 296/296 places, 305/305 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 283 transition count 292
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 283 transition count 292
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 30 place count 283 transition count 288
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 33 place count 280 transition count 285
Iterating global reduction 1 with 3 rules applied. Total rules applied 36 place count 280 transition count 285
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 39 place count 280 transition count 282
Applied a total of 39 rules in 16 ms. Remains 280 /296 variables (removed 16) and now considering 282/305 (removed 23) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10592572773874610227.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2563865779286450544.kers'
[2026-05-25 16:35:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10592572773874610227.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2563865779286450544.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 282 rows 280 cols 725 entries
Finished phase 1 with 262 SingleSign rule and 1 generalized
[2026-05-25 16:35:32] [INFO ] Computed 17 invariants in 1 ms
Computed 17 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2563865779286450544.kers
Total runtime 2 ms.
[2026-05-25 16:35:32] [INFO ] Implicit Places using invariants in 108 ms returned []
[2026-05-25 16:35:32] [INFO ] Invariant cache hit.
[2026-05-25 16:35:32] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
Running 281 sub problems to find dead transitions.
[2026-05-25 16:35:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/279 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/279 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (OVERLAPS) 282/561 variables, 279/296 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/561 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 4 (OVERLAPS) 1/562 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/562 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 6 (OVERLAPS) 0/562 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 281 unsolved
No progress, stopping.
After SMT solving in domain Real declared 562/562 variables, and 297 constraints, problems are : Problem set: 0 solved, 281 unsolved in 22825 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 281 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/279 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/279 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (OVERLAPS) 282/561 variables, 279/296 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/561 variables, 281/577 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/561 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 5 (OVERLAPS) 1/562 variables, 1/578 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/562 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 7 (OVERLAPS) 0/562 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 281 unsolved
No progress, stopping.
After SMT solving in domain Int declared 562/562 variables, and 578 constraints, problems are : Problem set: 0 solved, 281 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 52860ms problems are : Problem set: 0 solved, 281 unsolved
Search for dead transitions found 0 dead transitions in 52861ms
Starting structural reductions in LTL mode, iteration 1 : 280/296 places, 282/305 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53180 ms. Remains : 280/296 places, 282/305 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(G((p0||X(G(p1)))))))'
Stuttering acceptance computed with spot in 201 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPUForwardProgress-PT-16b-LTLFireability-09
Entered a terminal (fully accepting) state of product in 114 steps with 0 reset in 2 ms.
FORMULA GPUForwardProgress-PT-16b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-16b-LTLFireability-09 finished in 53411 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 1 out of 296 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 296/296 places, 305/305 transitions.
Graph (trivial) has 252 edges and 296 vertex of which 6 / 296 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 452 edges and 291 vertex of which 271 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.2 ms
Discarding 20 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 139 transitions
Trivial Post-agglo rules discarded 139 transitions
Performed 139 trivial Post agglomeration. Transition count delta: 139
Iterating post reduction 0 with 139 rules applied. Total rules applied 141 place count 270 transition count 156
Reduce places removed 139 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 150 rules applied. Total rules applied 291 place count 131 transition count 145
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 296 place count 127 transition count 144
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 297 place count 126 transition count 144
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 35 Pre rules applied. Total rules applied 297 place count 126 transition count 109
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 4 with 70 rules applied. Total rules applied 367 place count 91 transition count 109
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 382 place count 76 transition count 94
Iterating global reduction 4 with 15 rules applied. Total rules applied 397 place count 76 transition count 94
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 4 with 102 rules applied. Total rules applied 499 place count 25 transition count 43
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 500 place count 25 transition count 42
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 515 place count 10 transition count 13
Iterating global reduction 5 with 15 rules applied. Total rules applied 530 place count 10 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 532 place count 9 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 533 place count 8 transition count 11
Applied a total of 533 rules in 21 ms. Remains 8 /296 variables (removed 288) and now considering 11/305 (removed 294) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6460745825074642584.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13797522736199048092.kers'
[2026-05-25 16:36:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6460745825074642584.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13797522736199048092.kers]
Normalized transition count is 10 out of 11 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 10 rows 8 cols 24 entries
Finished phase 1 with 8 SingleSign rule and 0 generalized
[2026-05-25 16:36:25] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13797522736199048092.kers
Total runtime 0 ms.
[2026-05-25 16:36:25] [INFO ] Implicit Places using invariants in 23 ms returned []
[2026-05-25 16:36:25] [INFO ] Invariant cache hit.
[2026-05-25 16:36:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 16:36:25] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2026-05-25 16:36:25] [INFO ] Redundant transitions in 13 ms returned []
Running 7 sub problems to find dead transitions.
[2026-05-25 16:36:25] [INFO ] Invariant cache hit.
[2026-05-25 16:36:25] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 10/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 2/18 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1/19 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/19 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 19/19 variables, and 9 constraints, problems are : Problem set: 0 solved, 7 unsolved in 77 ms.
Refiners :[State Equation: 8/8 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 10/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 2/18 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 1/19 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/19 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 0/19 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 19/19 variables, and 16 constraints, problems are : Problem set: 0 solved, 7 unsolved in 91 ms.
Refiners :[State Equation: 8/8 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 170ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 170ms
Starting structural reductions in SI_LTL mode, iteration 1 : 8/296 places, 11/305 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 259 ms. Remains : 8/296 places, 11/305 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 26 ms :[(NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-16b-LTLFireability-10
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-16b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-16b-LTLFireability-10 finished in 309 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(X(p0))) U ((p1&&X(X(X(p2))))||X(X(X(G(p2))))))))'
Support contains 3 out of 296 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 296/296 places, 305/305 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 286 transition count 295
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 286 transition count 295
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 23 place count 286 transition count 292
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 25 place count 284 transition count 290
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 284 transition count 290
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 29 place count 284 transition count 288
Applied a total of 29 rules in 19 ms. Remains 284 /296 variables (removed 12) and now considering 288/305 (removed 17) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12101506408779088916.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17505225344943083542.kers'
[2026-05-25 16:36:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12101506408779088916.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17505225344943083542.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 288 rows 284 cols 737 entries
Finished phase 1 with 266 SingleSign rule and 1 generalized
[2026-05-25 16:36:26] [INFO ] Computed 17 invariants in 2 ms
Computed 17 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-17505225344943083542.kers
Total runtime 3 ms.
[2026-05-25 16:36:26] [INFO ] Implicit Places using invariants in 75 ms returned []
[2026-05-25 16:36:26] [INFO ] Invariant cache hit.
[2026-05-25 16:36:26] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
Running 287 sub problems to find dead transitions.
[2026-05-25 16:36:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/283 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 2 (OVERLAPS) 288/571 variables, 283/300 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/571 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 4 (OVERLAPS) 1/572 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/572 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 6 (OVERLAPS) 0/572 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 287 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 301 constraints, problems are : Problem set: 0 solved, 287 unsolved in 23706 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 284/284 constraints, PredecessorRefiner: 287/287 constraints, Known Traps: 0/0 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/283 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/283 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 2 (OVERLAPS) 288/571 variables, 283/300 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/571 variables, 287/587 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/571 variables, 0/587 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 5 (OVERLAPS) 1/572 variables, 1/588 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 7 (OVERLAPS) 0/572 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 287 unsolved
No progress, stopping.
After SMT solving in domain Int declared 572/572 variables, and 588 constraints, problems are : Problem set: 0 solved, 287 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 284/284 constraints, PredecessorRefiner: 287/287 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53741ms problems are : Problem set: 0 solved, 287 unsolved
Search for dead transitions found 0 dead transitions in 53741ms
Starting structural reductions in LTL mode, iteration 1 : 284/296 places, 288/305 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54028 ms. Remains : 284/296 places, 288/305 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(X(p0))) U (X(X(X(G(p1))))||(p2&&X(X(X(p1))))))))'
Stuttering acceptance computed with spot in 771 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-16b-LTLFireability-11
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-16b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-16b-LTLFireability-11 finished in 54883 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)&&X(X(G(p1)))))'
Support contains 2 out of 296 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 296/296 places, 305/305 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 283 transition count 292
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 283 transition count 292
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 30 place count 283 transition count 288
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 33 place count 280 transition count 285
Iterating global reduction 1 with 3 rules applied. Total rules applied 36 place count 280 transition count 285
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 39 place count 280 transition count 282
Applied a total of 39 rules in 14 ms. Remains 280 /296 variables (removed 16) and now considering 282/305 (removed 23) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12703120417300933557.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12749032405456875912.kers'
[2026-05-25 16:37:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12703120417300933557.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12749032405456875912.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 282 rows 280 cols 725 entries
Finished phase 1 with 262 SingleSign rule and 1 generalized
[2026-05-25 16:37:20] [INFO ] Computed 17 invariants in 3 ms
Computed 17 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-12749032405456875912.kers
Total runtime 5 ms.
[2026-05-25 16:37:21] [INFO ] Implicit Places using invariants in 88 ms returned []
[2026-05-25 16:37:21] [INFO ] Invariant cache hit.
[2026-05-25 16:37:21] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
Running 281 sub problems to find dead transitions.
[2026-05-25 16:37:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/279 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/279 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (OVERLAPS) 282/561 variables, 279/296 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/561 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 4 (OVERLAPS) 1/562 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/562 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 6 (OVERLAPS) 0/562 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 281 unsolved
No progress, stopping.
After SMT solving in domain Real declared 562/562 variables, and 297 constraints, problems are : Problem set: 0 solved, 281 unsolved in 22682 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 281 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/279 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/279 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (OVERLAPS) 282/561 variables, 279/296 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/561 variables, 281/577 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/561 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 5 (OVERLAPS) 1/562 variables, 1/578 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/562 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 7 (OVERLAPS) 0/562 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 281 unsolved
No progress, stopping.
After SMT solving in domain Int declared 562/562 variables, and 578 constraints, problems are : Problem set: 0 solved, 281 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 52727ms problems are : Problem set: 0 solved, 281 unsolved
Search for dead transitions found 0 dead transitions in 52728ms
Starting structural reductions in LTL mode, iteration 1 : 280/296 places, 282/305 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53000 ms. Remains : 280/296 places, 282/305 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)&&X(X(G(p1)))))'
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : GPUForwardProgress-PT-16b-LTLFireability-12
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-16b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-16b-LTLFireability-12 finished in 53196 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 1 out of 296 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 296/296 places, 305/305 transitions.
Graph (trivial) has 252 edges and 296 vertex of which 6 / 296 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 452 edges and 291 vertex of which 271 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.2 ms
Discarding 20 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 140 transitions
Trivial Post-agglo rules discarded 140 transitions
Performed 140 trivial Post agglomeration. Transition count delta: 140
Iterating post reduction 0 with 140 rules applied. Total rules applied 142 place count 270 transition count 155
Reduce places removed 140 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 151 rules applied. Total rules applied 293 place count 130 transition count 144
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 297 place count 126 transition count 144
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 36 Pre rules applied. Total rules applied 297 place count 126 transition count 108
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 369 place count 90 transition count 108
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 384 place count 75 transition count 93
Iterating global reduction 3 with 15 rules applied. Total rules applied 399 place count 75 transition count 93
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 499 place count 25 transition count 43
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 500 place count 25 transition count 42
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 515 place count 10 transition count 13
Iterating global reduction 4 with 15 rules applied. Total rules applied 530 place count 10 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 532 place count 9 transition count 12
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 533 place count 9 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 534 place count 8 transition count 11
Applied a total of 534 rules in 17 ms. Remains 8 /296 variables (removed 288) and now considering 11/305 (removed 294) transitions.
[2026-05-25 16:38:14] [INFO ] Flow matrix only has 10 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-4672880155758886558.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7626685030119031588.kers'
[2026-05-25 16:38:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4672880155758886558.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7626685030119031588.kers]
Normalized transition count is 9 out of 10 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 9 rows 8 cols 20 entries
Finished phase 1 with 8 SingleSign rule and 0 generalized
[2026-05-25 16:38:14] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7626685030119031588.kers
Total runtime 0 ms.
[2026-05-25 16:38:14] [INFO ] Implicit Places using invariants in 28 ms returned []
[2026-05-25 16:38:14] [INFO ] Flow matrix only has 10 transitions (discarded 1 similar events)
[2026-05-25 16:38:14] [INFO ] Invariant cache hit.
[2026-05-25 16:38:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 16:38:14] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2026-05-25 16:38:14] [INFO ] Redundant transitions in 13 ms returned []
Running 6 sub problems to find dead transitions.
[2026-05-25 16:38:14] [INFO ] Flow matrix only has 10 transitions (discarded 1 similar events)
[2026-05-25 16:38:14] [INFO ] Invariant cache hit.
[2026-05-25 16:38:14] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 9/15 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 2/17 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1/18 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/18 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18/18 variables, and 9 constraints, problems are : Problem set: 0 solved, 6 unsolved in 62 ms.
Refiners :[State Equation: 8/8 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 9/15 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 2/17 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/17 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 1/18 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/18 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 0/18 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 18/18 variables, and 15 constraints, problems are : Problem set: 0 solved, 6 unsolved in 78 ms.
Refiners :[State Equation: 8/8 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 150ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 150ms
Starting structural reductions in SI_LTL mode, iteration 1 : 8/296 places, 11/305 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 235 ms. Remains : 8/296 places, 11/305 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 : GPUForwardProgress-PT-16b-LTLFireability-13
Stuttering criterion allowed to conclude after 13 steps with 1 reset in 1 ms.
FORMULA GPUForwardProgress-PT-16b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-16b-LTLFireability-13 finished in 336 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)&&F(p1)&&X(X((!p1 U (p2||G(!p1)))))))'
Support contains 3 out of 296 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 296/296 places, 305/305 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 285 transition count 294
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 285 transition count 294
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 25 place count 285 transition count 291
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 27 place count 283 transition count 289
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 283 transition count 289
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 31 place count 283 transition count 287
Applied a total of 31 rules in 19 ms. Remains 283 /296 variables (removed 13) and now considering 287/305 (removed 18) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18222436941747048801.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17973536724551888879.kers'
[2026-05-25 16:38:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18222436941747048801.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17973536724551888879.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 287 rows 283 cols 735 entries
Finished phase 1 with 265 SingleSign rule and 1 generalized
[2026-05-25 16:38:14] [INFO ] Computed 17 invariants in 3 ms
Computed 17 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-17973536724551888879.kers
Total runtime 4 ms.
[2026-05-25 16:38:14] [INFO ] Implicit Places using invariants in 83 ms returned []
[2026-05-25 16:38:14] [INFO ] Invariant cache hit.
[2026-05-25 16:38:14] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
Running 286 sub problems to find dead transitions.
[2026-05-25 16:38:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/282 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/282 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (OVERLAPS) 287/569 variables, 282/299 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/569 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 1/570 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/570 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (OVERLAPS) 0/570 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Real declared 570/570 variables, and 300 constraints, problems are : Problem set: 0 solved, 286 unsolved in 23608 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 283/283 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 286 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/282 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/282 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (OVERLAPS) 287/569 variables, 282/299 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/569 variables, 286/585 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/569 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (OVERLAPS) 1/570 variables, 1/586 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/570 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (OVERLAPS) 0/570 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Int declared 570/570 variables, and 586 constraints, problems are : Problem set: 0 solved, 286 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 283/283 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53647ms problems are : Problem set: 0 solved, 286 unsolved
Search for dead transitions found 0 dead transitions in 53648ms
Starting structural reductions in LTL mode, iteration 1 : 283/296 places, 287/305 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53944 ms. Remains : 283/296 places, 287/305 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)&&F(p1)&&X(X((!p1 U (p2||G(!p1)))))))'
Stuttering acceptance computed with spot in 234 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (NOT p1), (NOT p0), (AND p1 (NOT p2)), (AND p1 (NOT p2)), true]
Running random walk in product with property : GPUForwardProgress-PT-16b-LTLFireability-14
Stuttering criterion allowed to conclude after 137 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-16b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-16b-LTLFireability-14 finished in 54219 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(p0)))&&F((p1&&X(p1)))))'
Support contains 2 out of 296 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 296/296 places, 305/305 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 284 transition count 293
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 284 transition count 293
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 28 place count 284 transition count 289
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 30 place count 282 transition count 287
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 282 transition count 287
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 34 place count 282 transition count 285
Applied a total of 34 rules in 13 ms. Remains 282 /296 variables (removed 14) and now considering 285/305 (removed 20) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16183202154666141370.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13792651485166707852.kers'
[2026-05-25 16:39:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16183202154666141370.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13792651485166707852.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 285 rows 282 cols 731 entries
Finished phase 1 with 264 SingleSign rule and 1 generalized
[2026-05-25 16:39:08] [INFO ] Computed 17 invariants in 3 ms
Computed 17 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-13792651485166707852.kers
Total runtime 3 ms.
[2026-05-25 16:39:08] [INFO ] Implicit Places using invariants in 83 ms returned []
[2026-05-25 16:39:08] [INFO ] Invariant cache hit.
[2026-05-25 16:39:08] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
Running 284 sub problems to find dead transitions.
[2026-05-25 16:39:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/281 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/281 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (OVERLAPS) 285/566 variables, 281/298 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/566 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (OVERLAPS) 1/567 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/567 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (OVERLAPS) 0/567 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Real declared 567/567 variables, and 299 constraints, problems are : Problem set: 0 solved, 284 unsolved in 23198 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 282/282 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 0/0 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/281 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/281 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (OVERLAPS) 285/566 variables, 281/298 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/566 variables, 284/582 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/566 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (OVERLAPS) 1/567 variables, 1/583 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/567 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (OVERLAPS) 0/567 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Int declared 567/567 variables, and 583 constraints, problems are : Problem set: 0 solved, 284 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 282/282 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53243ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 53244ms
Starting structural reductions in LTL mode, iteration 1 : 282/296 places, 285/305 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53517 ms. Remains : 282/296 places, 285/305 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(p0)))&&F((p1&&X(p1)))))'
Stuttering acceptance computed with spot in 275 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1), (NOT p0), (NOT p0), true]
Running random walk in product with property : GPUForwardProgress-PT-16b-LTLFireability-15
Stuttering criterion allowed to conclude after 137 steps with 0 reset in 2 ms.
FORMULA GPUForwardProgress-PT-16b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-16b-LTLFireability-15 finished in 53832 ms.
All properties solved by simple procedures.
Total runtime 562362 ms.

BK_STOP 1779727202537

--------------------
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="GPUForwardProgress-PT-16b"
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 GPUForwardProgress-PT-16b, 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 r146-tall-177961074200436"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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