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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 644K
-rw-r--r-- 1 mcc users 7.6K Mar 7 11:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Mar 7 11:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Mar 7 11:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Mar 7 11:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 10:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 10:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 10:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 10:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Mar 7 11:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 152K Mar 7 11:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Mar 7 11:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Mar 7 11:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 15 10:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 10:39 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 179K 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-36b-LTLFireability-00
FORMULA_NAME GPUForwardProgress-PT-36b-LTLFireability-01
FORMULA_NAME GPUForwardProgress-PT-36b-LTLFireability-02
FORMULA_NAME GPUForwardProgress-PT-36b-LTLFireability-03
FORMULA_NAME GPUForwardProgress-PT-36b-LTLFireability-04
FORMULA_NAME GPUForwardProgress-PT-36b-LTLFireability-05
FORMULA_NAME GPUForwardProgress-PT-36b-LTLFireability-06
FORMULA_NAME GPUForwardProgress-PT-36b-LTLFireability-07
FORMULA_NAME GPUForwardProgress-PT-36b-LTLFireability-08
FORMULA_NAME GPUForwardProgress-PT-36b-LTLFireability-09
FORMULA_NAME GPUForwardProgress-PT-36b-LTLFireability-10
FORMULA_NAME GPUForwardProgress-PT-36b-LTLFireability-11
FORMULA_NAME GPUForwardProgress-PT-36b-LTLFireability-12
FORMULA_NAME GPUForwardProgress-PT-36b-LTLFireability-13
FORMULA_NAME GPUForwardProgress-PT-36b-LTLFireability-14
FORMULA_NAME GPUForwardProgress-PT-36b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779733414811

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-36b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-25 18:23:36] [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 18:23:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 18:23:36] [INFO ] Load time of PNML (sax parser for PT used): 98 ms
[2026-05-25 18:23:36] [INFO ] Transformed 720 places.
[2026-05-25 18:23:36] [INFO ] Transformed 757 transitions.
[2026-05-25 18:23:36] [INFO ] Found NUPN structural information;
[2026-05-25 18:23:36] [INFO ] Parsed PT model containing 720 places and 757 transitions and 1877 arcs in 199 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA GPUForwardProgress-PT-36b-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-36b-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-36b-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 720 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 720/720 places, 757/757 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 719 transition count 757
Discarding 75 places :
Symmetric choice reduction at 1 with 75 rule applications. Total rules 76 place count 644 transition count 682
Iterating global reduction 1 with 75 rules applied. Total rules applied 151 place count 644 transition count 682
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 183 place count 612 transition count 650
Iterating global reduction 1 with 32 rules applied. Total rules applied 215 place count 612 transition count 650
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 244 place count 612 transition count 621
Applied a total of 244 rules in 168 ms. Remains 612 /720 variables (removed 108) and now considering 621/757 (removed 136) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18252970898755079036.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8332321274438278473.kers'
[2026-05-25 18:23:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18252970898755079036.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8332321274438278473.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 621 rows 612 cols 1603 entries
Finished phase 1 with 574 SingleSign rule and 1 generalized
[2026-05-25 18:23:36] [INFO ] Computed 37 invariants in 3 ms
Computed 37 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-8332321274438278473.kers
Total runtime 4 ms.
[2026-05-25 18:23:37] [INFO ] Implicit Places using invariants in 396 ms returned []
[2026-05-25 18:23:37] [INFO ] Invariant cache hit.
[2026-05-25 18:23:37] [INFO ] Implicit Places using invariants and state equation in 533 ms returned []
Implicit Place search using SMT with State Equation took 964 ms to find 0 implicit places.
Running 620 sub problems to find dead transitions.
[2026-05-25 18:23:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/611 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/611 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 2 (OVERLAPS) 621/1232 variables, 611/648 constraints. Problems are: Problem set: 0 solved, 620 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1232/1233 variables, and 648 constraints, problems are : Problem set: 0 solved, 620 unsolved in 30028 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 611/612 constraints, PredecessorRefiner: 620/620 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 620 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/611 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/611 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 2 (OVERLAPS) 621/1232 variables, 611/648 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1232 variables, 620/1268 constraints. Problems are: Problem set: 0 solved, 620 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1232/1233 variables, and 1268 constraints, problems are : Problem set: 0 solved, 620 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 611/612 constraints, PredecessorRefiner: 620/620 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60266ms problems are : Problem set: 0 solved, 620 unsolved
Search for dead transitions found 0 dead transitions in 60281ms
Starting structural reductions in LTL mode, iteration 1 : 612/720 places, 621/757 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61455 ms. Remains : 612/720 places, 621/757 transitions.
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 621/621 transitions.
Applied a total of 0 rules in 15 ms. Remains 612 /612 variables (removed 0) and now considering 621/621 (removed 0) transitions.
[2026-05-25 18:24:37] [INFO ] Invariant cache hit.
[2026-05-25 18:24:38] [INFO ] Implicit Places using invariants in 150 ms returned []
[2026-05-25 18:24:38] [INFO ] Invariant cache hit.
[2026-05-25 18:24:38] [INFO ] Implicit Places using invariants and state equation in 483 ms returned []
Implicit Place search using SMT with State Equation took 635 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 651 ms. Remains : 612/612 places, 621/621 transitions.
Support contains 30 out of 612 places after structural reductions.
[2026-05-25 18:24:38] [INFO ] Flatten gal took : 64 ms
[2026-05-25 18:24:38] [INFO ] Flatten gal took : 31 ms
[2026-05-25 18:24:38] [INFO ] Input system was already deterministic with 621 transitions.
RANDOM walk for 40000 steps (130 resets) in 1062 ms. (37 steps per ms) remains 6/28 properties
BEST_FIRST walk for 40004 steps (14 resets) in 103 ms. (384 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (12 resets) in 59 ms. (666 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (12 resets) in 79 ms. (500 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (14 resets) in 161 ms. (246 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (13 resets) in 270 ms. (147 steps per ms) remains 4/6 properties
[2026-05-25 18:24:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 107/111 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 500/611 variables, 33/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/611 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 621/1232 variables, 611/648 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1232 variables, 0/648 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1/1233 variables, 1/649 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1233 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/1233 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1233/1233 variables, and 649 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1023 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 612/612 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 107/111 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 500/611 variables, 33/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/611 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 621/1232 variables, 611/648 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1232 variables, 4/652 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1232 variables, 0/652 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1/1233 variables, 1/653 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1233 variables, 0/653 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/1233 variables, 0/653 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1233/1233 variables, and 653 constraints, problems are : Problem set: 0 solved, 4 unsolved in 884 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 612/612 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1919ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Finished Parikh walk after 173 steps, including 0 resets, run visited all 4 properties in 5 ms. (steps per millisecond=34 )
Parikh walk visited 4 properties in 14 ms.
FORMULA GPUForwardProgress-PT-36b-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 114 stabilizing places and 114 stable transitions
Graph (complete) has 954 edges and 612 vertex of which 572 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.24 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)&&F(p1))))'
Support contains 2 out of 612 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 612/612 places, 621/621 transitions.
Graph (trivial) has 505 edges and 612 vertex of which 6 / 612 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 948 edges and 607 vertex of which 567 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.3 ms
Discarding 40 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 291 transitions
Trivial Post-agglo rules discarded 291 transitions
Performed 291 trivial Post agglomeration. Transition count delta: 291
Iterating post reduction 0 with 291 rules applied. Total rules applied 293 place count 566 transition count 320
Reduce places removed 291 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 302 rules applied. Total rules applied 595 place count 275 transition count 309
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 601 place count 270 transition count 308
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 602 place count 269 transition count 308
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 76 Pre rules applied. Total rules applied 602 place count 269 transition count 232
Deduced a syphon composed of 76 places in 1 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 4 with 152 rules applied. Total rules applied 754 place count 193 transition count 232
Discarding 36 places :
Symmetric choice reduction at 4 with 36 rule applications. Total rules 790 place count 157 transition count 196
Iterating global reduction 4 with 36 rules applied. Total rules applied 826 place count 157 transition count 196
Performed 109 Post agglomeration using F-continuation condition.Transition count delta: 109
Deduced a syphon composed of 109 places in 0 ms
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 4 with 218 rules applied. Total rules applied 1044 place count 48 transition count 87
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1045 place count 48 transition count 86
Discarding 34 places :
Symmetric choice reduction at 5 with 34 rule applications. Total rules 1079 place count 14 transition count 19
Iterating global reduction 5 with 34 rules applied. Total rules applied 1113 place count 14 transition count 19
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1117 place count 12 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1118 place count 11 transition count 17
Applied a total of 1118 rules in 66 ms. Remains 11 /612 variables (removed 601) and now considering 17/621 (removed 604) transitions.
[2026-05-25 18:24:41] [INFO ] Flow matrix only has 16 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-13992086530828759374.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8690645578347465685.kers'
[2026-05-25 18:24:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13992086530828759374.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8690645578347465685.kers]
Normalized transition count is 15 out of 16 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 15 rows 11 cols 36 entries
Finished phase 1 with 11 SingleSign rule and 0 generalized
[2026-05-25 18:24:41] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8690645578347465685.kers
Total runtime 0 ms.
[2026-05-25 18:24:41] [INFO ] Implicit Places using invariants in 20 ms returned []
[2026-05-25 18:24:41] [INFO ] Flow matrix only has 16 transitions (discarded 1 similar events)
[2026-05-25 18:24:41] [INFO ] Invariant cache hit.
[2026-05-25 18:24:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 18:24:41] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2026-05-25 18:24:41] [INFO ] Redundant transitions in 11 ms returned []
Running 10 sub problems to find dead transitions.
[2026-05-25 18:24:41] [INFO ] Flow matrix only has 16 transitions (discarded 1 similar events)
[2026-05-25 18:24:41] [INFO ] Invariant cache hit.
[2026-05-25 18:24:41] [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) 15/23 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 3/26 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 1/27 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/27 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 27/27 variables, and 12 constraints, problems are : Problem set: 0 solved, 10 unsolved in 141 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) 15/23 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 3/26 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 8/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 1/27 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/27 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 0/27 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 27/27 variables, and 22 constraints, problems are : Problem set: 0 solved, 10 unsolved in 133 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 278ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 279ms
Starting structural reductions in SI_LTL mode, iteration 1 : 11/612 places, 17/621 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 410 ms. Remains : 11/612 places, 17/621 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)&&F(p1))))'
Stuttering acceptance computed with spot in 747 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-36b-LTLFireability-00
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 3 ms.
FORMULA GPUForwardProgress-PT-36b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36b-LTLFireability-00 finished in 1242 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 612 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 612/612 places, 621/621 transitions.
Graph (trivial) has 508 edges and 612 vertex of which 6 / 612 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 948 edges and 607 vertex of which 567 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.4 ms
Discarding 40 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 294 transitions
Trivial Post-agglo rules discarded 294 transitions
Performed 294 trivial Post agglomeration. Transition count delta: 294
Iterating post reduction 0 with 294 rules applied. Total rules applied 296 place count 566 transition count 317
Reduce places removed 294 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 304 rules applied. Total rules applied 600 place count 272 transition count 307
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 604 place count 268 transition count 307
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 77 Pre rules applied. Total rules applied 604 place count 268 transition count 230
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 3 with 154 rules applied. Total rules applied 758 place count 191 transition count 230
Discarding 36 places :
Symmetric choice reduction at 3 with 36 rule applications. Total rules 794 place count 155 transition count 194
Iterating global reduction 3 with 36 rules applied. Total rules applied 830 place count 155 transition count 194
Performed 109 Post agglomeration using F-continuation condition.Transition count delta: 109
Deduced a syphon composed of 109 places in 0 ms
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 3 with 218 rules applied. Total rules applied 1048 place count 46 transition count 85
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1049 place count 46 transition count 84
Discarding 35 places :
Symmetric choice reduction at 4 with 35 rule applications. Total rules 1084 place count 11 transition count 15
Iterating global reduction 4 with 35 rules applied. Total rules applied 1119 place count 11 transition count 15
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1123 place count 9 transition count 14
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 1125 place count 9 transition count 14
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1126 place count 8 transition count 13
Applied a total of 1126 rules in 36 ms. Remains 8 /612 variables (removed 604) and now considering 13/621 (removed 608) transitions.
[2026-05-25 18:24:43] [INFO ] Flow matrix only has 12 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-17389463245358587809.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12481761659244618572.kers'
[2026-05-25 18:24:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17389463245358587809.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12481761659244618572.kers]
Normalized transition count is 11 out of 12 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 11 rows 8 cols 26 entries
Finished phase 1 with 8 SingleSign rule and 0 generalized
[2026-05-25 18:24:43] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12481761659244618572.kers
Total runtime 0 ms.
[2026-05-25 18:24:43] [INFO ] Implicit Places using invariants in 20 ms returned []
[2026-05-25 18:24:43] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
[2026-05-25 18:24:43] [INFO ] Invariant cache hit.
[2026-05-25 18:24:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 18:24:43] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2026-05-25 18:24:43] [INFO ] Redundant transitions in 13 ms returned []
Running 7 sub problems to find dead transitions.
[2026-05-25 18:24:43] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
[2026-05-25 18:24:43] [INFO ] Invariant cache hit.
[2026-05-25 18:24:43] [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) 11/17 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 2/19 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1/20 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/20 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/20 variables, and 9 constraints, problems are : Problem set: 0 solved, 7 unsolved in 70 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) 11/17 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 2/19 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 1/20 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/20 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 0/20 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 20/20 variables, and 16 constraints, problems are : Problem set: 0 solved, 7 unsolved in 102 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 173ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 174ms
Starting structural reductions in SI_LTL mode, iteration 1 : 8/612 places, 13/621 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 273 ms. Remains : 8/612 places, 13/621 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 34 ms :[(NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-36b-LTLFireability-01
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-36b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36b-LTLFireability-01 finished in 335 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((p0||F((X(p1)&&F(p2)))) U p3))))'
Support contains 4 out of 612 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 621/621 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 603 transition count 612
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 603 transition count 612
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 23 place count 603 transition count 607
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 25 place count 601 transition count 605
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 601 transition count 605
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 601 transition count 603
Applied a total of 29 rules in 86 ms. Remains 601 /612 variables (removed 11) and now considering 603/621 (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-17732332283032541391.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13029147257933380728.kers'
[2026-05-25 18:24:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17732332283032541391.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13029147257933380728.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 603 rows 601 cols 1567 entries
Finished phase 1 with 563 SingleSign rule and 1 generalized
[2026-05-25 18:24:43] [INFO ] Computed 37 invariants in 8 ms
Computed 37 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-13029147257933380728.kers
Total runtime 12 ms.
[2026-05-25 18:24:43] [INFO ] Implicit Places using invariants in 157 ms returned []
[2026-05-25 18:24:43] [INFO ] Invariant cache hit.
[2026-05-25 18:24:44] [INFO ] Implicit Places using invariants and state equation in 470 ms returned []
Implicit Place search using SMT with State Equation took 631 ms to find 0 implicit places.
Running 602 sub problems to find dead transitions.
[2026-05-25 18:24:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/600 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/600 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 2 (OVERLAPS) 603/1203 variables, 600/637 constraints. Problems are: Problem set: 0 solved, 602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1203/1204 variables, and 637 constraints, problems are : Problem set: 0 solved, 602 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 600/601 constraints, PredecessorRefiner: 602/602 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 602 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/600 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/600 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 2 (OVERLAPS) 603/1203 variables, 600/637 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1203 variables, 602/1239 constraints. Problems are: Problem set: 0 solved, 602 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1203/1204 variables, and 1239 constraints, problems are : Problem set: 0 solved, 602 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 600/601 constraints, PredecessorRefiner: 602/602 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60172ms problems are : Problem set: 0 solved, 602 unsolved
Search for dead transitions found 0 dead transitions in 60179ms
Starting structural reductions in LTL mode, iteration 1 : 601/612 places, 603/621 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60902 ms. Remains : 601/612 places, 603/621 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((p0||F((X(p1)&&F(p2)))) U p3))))'
Stuttering acceptance computed with spot in 234 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p1), (NOT p2)]
Running random walk in product with property : GPUForwardProgress-PT-36b-LTLFireability-02
Stuttering criterion allowed to conclude after 297 steps with 0 reset in 7 ms.
FORMULA GPUForwardProgress-PT-36b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36b-LTLFireability-02 finished in 61203 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 1 out of 612 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 621/621 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 603 transition count 612
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 603 transition count 612
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 22 place count 603 transition count 608
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 24 place count 601 transition count 606
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 601 transition count 606
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 28 place count 601 transition count 604
Applied a total of 28 rules in 58 ms. Remains 601 /612 variables (removed 11) and now considering 604/621 (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-3913448053987565636.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11639494382406477742.kers'
[2026-05-25 18:25:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3913448053987565636.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11639494382406477742.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 604 rows 601 cols 1569 entries
Finished phase 1 with 563 SingleSign rule and 1 generalized
[2026-05-25 18:25:44] [INFO ] Computed 37 invariants in 8 ms
Computed 37 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-11639494382406477742.kers
Total runtime 9 ms.
[2026-05-25 18:25:44] [INFO ] Implicit Places using invariants in 158 ms returned []
[2026-05-25 18:25:44] [INFO ] Invariant cache hit.
[2026-05-25 18:25:45] [INFO ] Implicit Places using invariants and state equation in 481 ms returned []
Implicit Place search using SMT with State Equation took 642 ms to find 0 implicit places.
Running 603 sub problems to find dead transitions.
[2026-05-25 18:25:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/600 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/600 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 2 (OVERLAPS) 604/1204 variables, 600/637 constraints. Problems are: Problem set: 0 solved, 603 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1204/1205 variables, and 637 constraints, problems are : Problem set: 0 solved, 603 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 600/601 constraints, PredecessorRefiner: 603/603 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 603 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/600 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/600 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 2 (OVERLAPS) 604/1204 variables, 600/637 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1204 variables, 603/1240 constraints. Problems are: Problem set: 0 solved, 603 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1204/1205 variables, and 1240 constraints, problems are : Problem set: 0 solved, 603 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 600/601 constraints, PredecessorRefiner: 603/603 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60112ms problems are : Problem set: 0 solved, 603 unsolved
Search for dead transitions found 0 dead transitions in 60115ms
Starting structural reductions in LTL mode, iteration 1 : 601/612 places, 604/621 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60820 ms. Remains : 601/612 places, 604/621 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Stuttering acceptance computed with spot in 174 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-36b-LTLFireability-03
Product exploration explored 100000 steps with 25000 reset in 210 ms.
Product exploration explored 100000 steps with 25000 reset in 191 ms.
Computed a total of 111 stabilizing places and 111 stable transitions
Graph (complete) has 937 edges and 601 vertex of which 561 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.15 ms
Computed a total of 111 stabilizing places and 111 stable transitions
Knowledge based reduction with 1 factoid took 80 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
RANDOM walk for 23158 steps (75 resets) in 113 ms. (203 steps per ms) remains 0/1 properties
Knowledge based reduction with 1 factoid took 86 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 393 ms.
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 601 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 601/601 places, 604/604 transitions.
Applied a total of 0 rules in 20 ms. Remains 601 /601 variables (removed 0) and now considering 604/604 (removed 0) transitions.
[2026-05-25 18:26:46] [INFO ] Invariant cache hit.
[2026-05-25 18:26:46] [INFO ] Implicit Places using invariants in 233 ms returned []
[2026-05-25 18:26:46] [INFO ] Invariant cache hit.
[2026-05-25 18:26:47] [INFO ] Implicit Places using invariants and state equation in 490 ms returned []
Implicit Place search using SMT with State Equation took 725 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 746 ms. Remains : 601/601 places, 604/604 transitions.
Computed a total of 111 stabilizing places and 111 stable transitions
Graph (complete) has 937 edges and 601 vertex of which 561 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.13 ms
Computed a total of 111 stabilizing places and 111 stable transitions
Knowledge based reduction with 1 factoid took 51 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (129 resets) in 139 ms. (285 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (15 resets) in 123 ms. (322 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1063734 steps, run timeout after 3001 ms. (steps per millisecond=354 ) properties seen :0 out of 1
Probabilistic random walk after 1063734 steps, saw 395499 distinct states, run finished after 3007 ms. (steps per millisecond=353 ) properties seen :0
[2026-05-25 18:26:50] [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) 63/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 536/600 variables, 36/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/600 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 604/1204 variables, 600/637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1204 variables, 0/637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/1205 variables, 1/638 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1205 variables, 0/638 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1205 variables, 0/638 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1205/1205 variables, and 638 constraints, problems are : Problem set: 0 solved, 1 unsolved in 415 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 601/601 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) 63/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 536/600 variables, 36/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/600 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 604/1204 variables, 600/637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1204 variables, 1/638 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1204 variables, 0/638 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/1205 variables, 1/639 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1205 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1205 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1205/1205 variables, and 639 constraints, problems are : Problem set: 0 solved, 1 unsolved in 379 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 601/601 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 799ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 51 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=51 )
Parikh walk visited 1 properties in 1 ms.
Knowledge based reduction with 1 factoid took 75 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 4209 ms.
Stuttering acceptance computed with spot in 181 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 182 ms.
Product exploration explored 100000 steps with 25000 reset in 199 ms.
Spot run failed in 76 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/ltsmin8794994848032592605
[2026-05-25 18:26:52] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8794994848032592605
Running compilation step : cd /tmp/ltsmin8794994848032592605;'/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 1026 ms.
Running link step : cd /tmp/ltsmin8794994848032592605;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin8794994848032592605;'/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/stateBased13433079655928357231.hoa' '--buchi-type=spotba'
LTSmin run took 78 ms.
FORMULA GPUForwardProgress-PT-36b-LTLFireability-03 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property GPUForwardProgress-PT-36b-LTLFireability-03 finished in 68987 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 612 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 612/612 places, 621/621 transitions.
Graph (trivial) has 510 edges and 612 vertex of which 6 / 612 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 948 edges and 607 vertex of which 567 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.4 ms
Discarding 40 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 295 transitions
Trivial Post-agglo rules discarded 295 transitions
Performed 295 trivial Post agglomeration. Transition count delta: 295
Iterating post reduction 0 with 295 rules applied. Total rules applied 297 place count 566 transition count 316
Reduce places removed 295 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 307 rules applied. Total rules applied 604 place count 271 transition count 304
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 609 place count 266 transition count 304
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 77 Pre rules applied. Total rules applied 609 place count 266 transition count 227
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 3 with 154 rules applied. Total rules applied 763 place count 189 transition count 227
Discarding 36 places :
Symmetric choice reduction at 3 with 36 rule applications. Total rules 799 place count 153 transition count 191
Iterating global reduction 3 with 36 rules applied. Total rules applied 835 place count 153 transition count 191
Performed 108 Post agglomeration using F-continuation condition.Transition count delta: 108
Deduced a syphon composed of 108 places in 0 ms
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 3 with 216 rules applied. Total rules applied 1051 place count 45 transition count 83
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1052 place count 45 transition count 82
Discarding 36 places :
Symmetric choice reduction at 4 with 36 rule applications. Total rules 1088 place count 9 transition count 11
Iterating global reduction 4 with 36 rules applied. Total rules applied 1124 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 1126 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 1127 place count 7 transition count 9
Applied a total of 1127 rules in 32 ms. Remains 7 /612 variables (removed 605) and now considering 9/621 (removed 612) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5561928646159977239.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13485186063082788315.kers'
[2026-05-25 18:26:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5561928646159977239.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13485186063082788315.kers]
Normalized transition count is 8 out of 9 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 8 rows 7 cols 17 entries
Finished phase 1 with 7 SingleSign rule and 0 generalized
[2026-05-25 18:26:53] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13485186063082788315.kers
Total runtime 0 ms.
[2026-05-25 18:26:53] [INFO ] Implicit Places using invariants in 20 ms returned []
[2026-05-25 18:26:53] [INFO ] Invariant cache hit.
[2026-05-25 18:26:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 18:26:53] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2026-05-25 18:26:53] [INFO ] Redundant transitions in 15 ms returned []
Running 5 sub problems to find dead transitions.
[2026-05-25 18:26:53] [INFO ] Invariant cache hit.
[2026-05-25 18:26:53] [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 61 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 125ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 125ms
Starting structural reductions in SI_LTL mode, iteration 1 : 7/612 places, 9/621 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 218 ms. Remains : 7/612 places, 9/621 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 43 ms :[(NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-36b-LTLFireability-04
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-36b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36b-LTLFireability-04 finished in 291 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) U G(p1)))))'
Support contains 2 out of 612 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 621/621 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 602 transition count 611
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 602 transition count 611
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 25 place count 602 transition count 606
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 27 place count 600 transition count 604
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 600 transition count 604
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 600 transition count 602
Applied a total of 31 rules in 42 ms. Remains 600 /612 variables (removed 12) and now considering 602/621 (removed 19) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14310113205840469920.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1252256865252635777.kers'
[2026-05-25 18:26:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14310113205840469920.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1252256865252635777.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 602 rows 600 cols 1565 entries
Finished phase 1 with 562 SingleSign rule and 1 generalized
[2026-05-25 18:26:53] [INFO ] Computed 37 invariants in 3 ms
Computed 37 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-1252256865252635777.kers
Total runtime 4 ms.
[2026-05-25 18:26:54] [INFO ] Implicit Places using invariants in 152 ms returned []
[2026-05-25 18:26:54] [INFO ] Invariant cache hit.
[2026-05-25 18:26:54] [INFO ] Implicit Places using invariants and state equation in 452 ms returned []
Implicit Place search using SMT with State Equation took 606 ms to find 0 implicit places.
Running 601 sub problems to find dead transitions.
[2026-05-25 18:26:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/599 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/599 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 2 (OVERLAPS) 602/1201 variables, 599/636 constraints. Problems are: Problem set: 0 solved, 601 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1201/1202 variables, and 636 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 599/600 constraints, PredecessorRefiner: 601/601 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 601 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/599 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/599 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 2 (OVERLAPS) 602/1201 variables, 599/636 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1201 variables, 601/1237 constraints. Problems are: Problem set: 0 solved, 601 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1201/1202 variables, and 1237 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 599/600 constraints, PredecessorRefiner: 601/601 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60125ms problems are : Problem set: 0 solved, 601 unsolved
Search for dead transitions found 0 dead transitions in 60126ms
Starting structural reductions in LTL mode, iteration 1 : 600/612 places, 602/621 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60784 ms. Remains : 600/612 places, 602/621 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) U G(p1)))))'
Stuttering acceptance computed with spot in 210 ms :[(NOT p1), (NOT p1), (NOT p1), true, (AND p1 (NOT p0)), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-36b-LTLFireability-05
Product exploration explored 100000 steps with 19976 reset in 156 ms.
Product exploration explored 100000 steps with 20031 reset in 185 ms.
Computed a total of 111 stabilizing places and 111 stable transitions
Graph (complete) has 935 edges and 600 vertex of which 560 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.4 ms
Computed a total of 111 stabilizing places and 111 stable transitions
Detected a total of 111/600 stabilizing places and 111/602 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge based reduction with 8 factoid took 61 ms. Reduced automaton from 6 states, 12 edges and 2 AP (stutter sensitive) to 6 states, 12 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (129 resets) in 288 ms. (138 steps per ms) remains 1/6 properties
BEST_FIRST walk for 9396 steps (0 resets) in 15 ms. (587 steps per ms) remains 0/1 properties
Knowledge based reduction with 8 factoid took 196 ms. Reduced automaton from 6 states, 12 edges and 2 AP (stutter sensitive) to 6 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 249 ms :[(NOT p1), (NOT p1), (NOT p1), true, (AND (NOT p0) p1), (NOT p1)]
[2026-05-25 18:27:55] [INFO ] Invariant cache hit.
[2026-05-25 18:27:56] [INFO ] [Real]Absence check using 0 positive and 37 generalized place invariants in 12 ms returned sat
[2026-05-25 18:27:56] [INFO ] [Real]Absence check using state equation in 370 ms returned sat
[2026-05-25 18:27:56] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 18:27:56] [INFO ] [Nat]Absence check using 0 positive and 37 generalized place invariants in 11 ms returned sat
[2026-05-25 18:27:57] [INFO ] [Nat]Absence check using state equation in 396 ms returned sat
[2026-05-25 18:27:57] [INFO ] Computed and/alt/rep : 596/782/596 causal constraints (skipped 5 transitions) in 28 ms.
[2026-05-25 18:28:03] [INFO ] Added : 572 causal constraints over 115 iterations in 6543 ms. Result :sat
Could not prove EG (NOT p1)
Knowledge-based reduction took 8420 ms.
Stuttering acceptance computed with spot in 238 ms :[(NOT p1), (NOT p1), (NOT p1), true, (AND (NOT p0) p1), (NOT p1)]
Support contains 2 out of 600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 600/600 places, 602/602 transitions.
Applied a total of 0 rules in 15 ms. Remains 600 /600 variables (removed 0) and now considering 602/602 (removed 0) transitions.
[2026-05-25 18:28:03] [INFO ] Invariant cache hit.
[2026-05-25 18:28:04] [INFO ] Implicit Places using invariants in 132 ms returned []
[2026-05-25 18:28:04] [INFO ] Invariant cache hit.
[2026-05-25 18:28:04] [INFO ] Implicit Places using invariants and state equation in 443 ms returned []
Implicit Place search using SMT with State Equation took 577 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 593 ms. Remains : 600/600 places, 602/602 transitions.
Computed a total of 111 stabilizing places and 111 stable transitions
Graph (complete) has 935 edges and 600 vertex of which 560 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.9 ms
Computed a total of 111 stabilizing places and 111 stable transitions
Detected a total of 111/600 stabilizing places and 111/602 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge based reduction with 8 factoid took 62 ms. Reduced automaton from 6 states, 12 edges and 2 AP (stutter sensitive) to 6 states, 12 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (128 resets) in 91 ms. (434 steps per ms) remains 1/6 properties
BEST_FIRST walk for 12675 steps (1 resets) in 10 ms. (1152 steps per ms) remains 0/1 properties
Knowledge based reduction with 8 factoid took 138 ms. Reduced automaton from 6 states, 12 edges and 2 AP (stutter sensitive) to 6 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 223 ms :[(NOT p1), (NOT p1), (NOT p1), true, (AND (NOT p0) p1), (NOT p1)]
[2026-05-25 18:28:04] [INFO ] Invariant cache hit.
[2026-05-25 18:28:05] [INFO ] [Real]Absence check using 0 positive and 37 generalized place invariants in 12 ms returned sat
[2026-05-25 18:28:05] [INFO ] [Real]Absence check using state equation in 359 ms returned sat
[2026-05-25 18:28:05] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 18:28:05] [INFO ] [Nat]Absence check using 0 positive and 37 generalized place invariants in 11 ms returned sat
[2026-05-25 18:28:06] [INFO ] [Nat]Absence check using state equation in 414 ms returned sat
[2026-05-25 18:28:06] [INFO ] Computed and/alt/rep : 596/782/596 causal constraints (skipped 5 transitions) in 30 ms.
[2026-05-25 18:28:12] [INFO ] Added : 572 causal constraints over 115 iterations in 6503 ms. Result :sat
Could not prove EG (NOT p1)
Knowledge-based reduction took 8201 ms.
Stuttering acceptance computed with spot in 218 ms :[(NOT p1), (NOT p1), (NOT p1), true, (AND (NOT p0) p1), (NOT p1)]
Stuttering acceptance computed with spot in 203 ms :[(NOT p1), (NOT p1), (NOT p1), true, (AND (NOT p0) p1), (NOT p1)]
Product exploration explored 100000 steps with 19966 reset in 143 ms.
Product exploration explored 100000 steps with 19943 reset in 146 ms.
Spot run failed in 49 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/ltsmin13648465506459052837
[2026-05-25 18:28:13] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13648465506459052837
Running compilation step : cd /tmp/ltsmin13648465506459052837;'/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 891 ms.
Running link step : cd /tmp/ltsmin13648465506459052837;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin13648465506459052837;'/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/stateBased12236962077465687367.hoa' '--buchi-type=spotba'
LTSmin run took 174 ms.
FORMULA GPUForwardProgress-PT-36b-LTLFireability-05 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property GPUForwardProgress-PT-36b-LTLFireability-05 finished in 80748 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(X(X(X(p1))))))))'
Support contains 2 out of 612 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 621/621 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 603 transition count 612
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 603 transition count 612
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 22 place count 603 transition count 608
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 24 place count 601 transition count 606
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 601 transition count 606
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 28 place count 601 transition count 604
Applied a total of 28 rules in 40 ms. Remains 601 /612 variables (removed 11) and now considering 604/621 (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-10205374117703878962.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3088177057571768348.kers'
[2026-05-25 18:28:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10205374117703878962.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3088177057571768348.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 604 rows 601 cols 1569 entries
Finished phase 1 with 563 SingleSign rule and 1 generalized
[2026-05-25 18:28:14] [INFO ] Computed 37 invariants in 5 ms
Computed 37 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-3088177057571768348.kers
Total runtime 7 ms.
[2026-05-25 18:28:14] [INFO ] Implicit Places using invariants in 151 ms returned []
[2026-05-25 18:28:14] [INFO ] Invariant cache hit.
[2026-05-25 18:28:15] [INFO ] Implicit Places using invariants and state equation in 454 ms returned []
Implicit Place search using SMT with State Equation took 607 ms to find 0 implicit places.
Running 603 sub problems to find dead transitions.
[2026-05-25 18:28:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/600 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/600 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 2 (OVERLAPS) 604/1204 variables, 600/637 constraints. Problems are: Problem set: 0 solved, 603 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1204/1205 variables, and 637 constraints, problems are : Problem set: 0 solved, 603 unsolved in 30013 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 600/601 constraints, PredecessorRefiner: 603/603 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 603 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/600 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/600 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 2 (OVERLAPS) 604/1204 variables, 600/637 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1204 variables, 603/1240 constraints. Problems are: Problem set: 0 solved, 603 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1204/1205 variables, and 1240 constraints, problems are : Problem set: 0 solved, 603 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 600/601 constraints, PredecessorRefiner: 603/603 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60115ms problems are : Problem set: 0 solved, 603 unsolved
Search for dead transitions found 0 dead transitions in 60119ms
Starting structural reductions in LTL mode, iteration 1 : 601/612 places, 604/621 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60774 ms. Remains : 601/612 places, 604/621 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(X(X(X(p1))))))))'
Stuttering acceptance computed with spot in 280 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : GPUForwardProgress-PT-36b-LTLFireability-06
Product exploration explored 100000 steps with 327 reset in 238 ms.
Product exploration explored 100000 steps with 325 reset in 210 ms.
Computed a total of 111 stabilizing places and 111 stable transitions
Graph (complete) has 937 edges and 601 vertex of which 561 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.4 ms
Computed a total of 111 stabilizing places and 111 stable transitions
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (128 resets) in 146 ms. (272 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (13 resets) in 49 ms. (800 steps per ms) remains 1/1 properties
[2026-05-25 18:29:16] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 30/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 569/600 variables, 36/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/600 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 604/1204 variables, 600/637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1204 variables, 0/637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/1205 variables, 1/638 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1205 variables, 0/638 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1205 variables, 0/638 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1205/1205 variables, and 638 constraints, problems are : Problem set: 0 solved, 1 unsolved in 264 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 601/601 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) 30/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 569/600 variables, 36/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/600 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 604/1204 variables, 600/637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1204 variables, 1/638 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1204 variables, 0/638 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/1205 variables, 1/639 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1205 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1205 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1205/1205 variables, and 639 constraints, problems are : Problem set: 0 solved, 1 unsolved in 362 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 601/601 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 632ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 39 ms.
Support contains 1 out of 601 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 601/601 places, 604/604 transitions.
Graph (trivial) has 491 edges and 601 vertex of which 6 / 601 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 930 edges and 596 vertex of which 556 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Discarding 40 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 290 transitions
Trivial Post-agglo rules discarded 290 transitions
Performed 290 trivial Post agglomeration. Transition count delta: 290
Iterating post reduction 0 with 292 rules applied. Total rules applied 294 place count 556 transition count 302
Reduce places removed 290 places and 0 transitions.
Iterating post reduction 1 with 290 rules applied. Total rules applied 584 place count 266 transition count 302
Performed 75 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 75 Pre rules applied. Total rules applied 584 place count 266 transition count 227
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 150 rules applied. Total rules applied 734 place count 191 transition count 227
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 771 place count 154 transition count 190
Iterating global reduction 2 with 37 rules applied. Total rules applied 808 place count 154 transition count 190
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 808 place count 154 transition count 189
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 810 place count 153 transition count 189
Performed 109 Post agglomeration using F-continuation condition.Transition count delta: 109
Deduced a syphon composed of 109 places in 0 ms
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 2 with 218 rules applied. Total rules applied 1028 place count 44 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 122 edges and 44 vertex of which 43 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 2 rules applied. Total rules applied 1030 place count 43 transition count 79
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1032 place count 43 transition count 77
Discarding 34 places :
Symmetric choice reduction at 4 with 34 rule applications. Total rules 1066 place count 9 transition count 9
Iterating global reduction 4 with 34 rules applied. Total rules applied 1100 place count 9 transition count 9
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 5 rules applied. Total rules applied 1105 place count 6 transition count 7
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 8 edges and 6 vertex of which 5 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 2 rules applied. Total rules applied 1107 place count 5 transition count 6
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1108 place count 5 transition count 5
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 1109 place count 5 transition count 4
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1110 place count 4 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1111 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1111 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1113 place count 2 transition count 2
Applied a total of 1113 rules in 21 ms. Remains 2 /601 variables (removed 599) and now considering 2/604 (removed 602) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 2/601 places, 2/604 transitions.
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 265 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Knowledge-based reduction took 1222 ms.
Stuttering acceptance computed with spot in 263 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 2 out of 601 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 601/601 places, 604/604 transitions.
Applied a total of 0 rules in 18 ms. Remains 601 /601 variables (removed 0) and now considering 604/604 (removed 0) transitions.
[2026-05-25 18:29:17] [INFO ] Invariant cache hit.
[2026-05-25 18:29:17] [INFO ] Implicit Places using invariants in 144 ms returned []
[2026-05-25 18:29:17] [INFO ] Invariant cache hit.
[2026-05-25 18:29:18] [INFO ] Implicit Places using invariants and state equation in 437 ms returned []
Implicit Place search using SMT with State Equation took 583 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 603 ms. Remains : 601/601 places, 604/604 transitions.
Computed a total of 111 stabilizing places and 111 stable transitions
Graph (complete) has 937 edges and 601 vertex of which 561 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.4 ms
Computed a total of 111 stabilizing places and 111 stable transitions
Knowledge based reduction with 3 factoid took 65 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (127 resets) in 133 ms. (298 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (13 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
[2026-05-25 18:29:18] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 30/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 569/600 variables, 36/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/600 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 604/1204 variables, 600/637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1204 variables, 0/637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/1205 variables, 1/638 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1205 variables, 0/638 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1205 variables, 0/638 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1205/1205 variables, and 638 constraints, problems are : Problem set: 0 solved, 1 unsolved in 263 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 601/601 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) 30/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 569/600 variables, 36/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/600 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 604/1204 variables, 600/637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1204 variables, 1/638 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1204 variables, 0/638 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/1205 variables, 1/639 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1205 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1205 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1205/1205 variables, and 639 constraints, problems are : Problem set: 0 solved, 1 unsolved in 344 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 601/601 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 613ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 1843 steps, including 10 resets, run visited all 1 properties in 6 ms. (steps per millisecond=307 )
Parikh walk visited 1 properties in 6 ms.
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 273 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Knowledge-based reduction took 1134 ms.
Stuttering acceptance computed with spot in 264 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 280 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 324 reset in 174 ms.
Product exploration explored 100000 steps with 327 reset in 178 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/ltsmin9212731195458027215
[2026-05-25 18:29:20] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9212731195458027215
Running compilation step : cd /tmp/ltsmin9212731195458027215;'/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 952 ms.
Running link step : cd /tmp/ltsmin9212731195458027215;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin9212731195458027215;'/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/stateBased5269171378455731473.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 601 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 601/601 places, 604/604 transitions.
Applied a total of 0 rules in 11 ms. Remains 601 /601 variables (removed 0) and now considering 604/604 (removed 0) transitions.
[2026-05-25 18:29:35] [INFO ] Invariant cache hit.
[2026-05-25 18:29:35] [INFO ] Implicit Places using invariants in 134 ms returned []
[2026-05-25 18:29:35] [INFO ] Invariant cache hit.
[2026-05-25 18:29:35] [INFO ] Implicit Places using invariants and state equation in 459 ms returned []
Implicit Place search using SMT with State Equation took 595 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 608 ms. Remains : 601/601 places, 604/604 transitions.
Built C files in :
/tmp/ltsmin2121977804585422696
[2026-05-25 18:29:35] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2121977804585422696
Running compilation step : cd /tmp/ltsmin2121977804585422696;'/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 901 ms.
Running link step : cd /tmp/ltsmin2121977804585422696;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin2121977804585422696;'/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/stateBased11058723090269831624.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-25 18:29:51] [INFO ] Flatten gal took : 25 ms
[2026-05-25 18:29:51] [INFO ] Flatten gal took : 28 ms
[2026-05-25 18:29:51] [INFO ] Time to serialize gal into /tmp/LTL16253477056390382110.gal : 6 ms
[2026-05-25 18:29:51] [INFO ] Time to serialize properties into /tmp/LTL10275053633507496249.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16253477056390382110.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2563840188930933286.hoa' '-atoms' '/tmp/LTL10275053633507496249.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL10275053633507496249.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2563840188930933286.hoa
Detected timeout of ITS tools.
[2026-05-25 18:30:06] [INFO ] Flatten gal took : 20 ms
[2026-05-25 18:30:06] [INFO ] Flatten gal took : 20 ms
[2026-05-25 18:30:06] [INFO ] Time to serialize gal into /tmp/LTL14370569732403055615.gal : 5 ms
[2026-05-25 18:30:06] [INFO ] Time to serialize properties into /tmp/LTL14949192200795802817.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14370569732403055615.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14949192200795802817.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(G(("(p64==0)")||(X(X(X(X("(p461==0)")))))))))
Formula 0 simplified : XF(!"(p64==0)" & XXXX!"(p461==0)")
Detected timeout of ITS tools.
[2026-05-25 18:30:21] [INFO ] Flatten gal took : 19 ms
[2026-05-25 18:30:21] [INFO ] Applying decomposition
[2026-05-25 18:30:21] [INFO ] Flatten gal took : 43 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph9351742371875854647.txt' '-o' '/tmp/graph9351742371875854647.bin' '-w' '/tmp/graph9351742371875854647.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9351742371875854647.bin' '-l' '-1' '-v' '-w' '/tmp/graph9351742371875854647.weights' '-q' '0' '-e' '0.001'
[2026-05-25 18:30:21] [INFO ] Decomposing Gal with order
[2026-05-25 18:30:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 18:30:21] [INFO ] Removed a total of 183 redundant transitions.
[2026-05-25 18:30:21] [INFO ] Flatten gal took : 221 ms
[2026-05-25 18:30:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 22 ms.
[2026-05-25 18:30:22] [INFO ] Time to serialize gal into /tmp/LTL13862612808734023423.gal : 25 ms
[2026-05-25 18:30:22] [INFO ] Time to serialize properties into /tmp/LTL14476827316557385089.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13862612808734023423.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14476827316557385089.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(G(("(i3.u25.p64==0)")||(X(X(X(X("(i24.u164.p461==0)")))))))))
Formula 0 simplified : XF(!"(i3.u25.p64==0)" & XXXX!"(i24.u164.p461==0)")
Reverse transition relation is NOT exact ! Due to transitions t547, i1.t273, i1.u138.t264, i2.i0.t542, i2.i0.i1.u22.t535, i3.t529, i3.u28.t520, i4.t506, i4...1057
Computing Next relation with stutter on 3.00189e+17 deadlock states
302 unique states visited
302 strongly connected components in search stack
303 transitions explored
302 items max in DFS search stack
935 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,9.47002,264256,1,0,574155,308,5606,653065,149,867,1412902
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-36b-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property GPUForwardProgress-PT-36b-LTLFireability-06 finished in 138133 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||F((X(X(X(p2)))&&p1))))))'
Support contains 3 out of 612 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 621/621 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 603 transition count 612
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 603 transition count 612
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 22 place count 603 transition count 608
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 24 place count 601 transition count 606
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 601 transition count 606
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 28 place count 601 transition count 604
Applied a total of 28 rules in 37 ms. Remains 601 /612 variables (removed 11) and now considering 604/621 (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-17578046263255736165.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8403366937245420818.kers'
[2026-05-25 18:30:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17578046263255736165.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8403366937245420818.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 604 rows 601 cols 1569 entries
Finished phase 1 with 563 SingleSign rule and 1 generalized
[2026-05-25 18:30:32] [INFO ] Computed 37 invariants in 5 ms
Computed 37 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-8403366937245420818.kers
Total runtime 7 ms.
[2026-05-25 18:30:32] [INFO ] Implicit Places using invariants in 156 ms returned []
[2026-05-25 18:30:32] [INFO ] Invariant cache hit.
[2026-05-25 18:30:33] [INFO ] Implicit Places using invariants and state equation in 427 ms returned []
Implicit Place search using SMT with State Equation took 585 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 601/612 places, 604/621 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 622 ms. Remains : 601/612 places, 604/621 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||F((X(X(X(p2)))&&p1))))))'
Stuttering acceptance computed with spot in 379 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : GPUForwardProgress-PT-36b-LTLFireability-08
Product exploration explored 100000 steps with 20098 reset in 167 ms.
Product exploration explored 100000 steps with 19956 reset in 147 ms.
Computed a total of 111 stabilizing places and 111 stable transitions
Graph (complete) has 937 edges and 601 vertex of which 561 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.2 ms
Computed a total of 111 stabilizing places and 111 stable transitions
Knowledge based reduction with 13 factoid took 87 ms. Reduced automaton from 9 states, 35 edges and 3 AP (stutter sensitive) to 9 states, 35 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (129 resets) in 333 ms. (119 steps per ms) remains 2/11 properties
BEST_FIRST walk for 40004 steps (12 resets) in 83 ms. (476 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (12 resets) in 155 ms. (256 steps per ms) remains 2/2 properties
[2026-05-25 18:30:34] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 89/92 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 508/600 variables, 34/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/600 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 604/1204 variables, 600/637 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1204 variables, 0/637 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/1205 variables, 1/638 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1205 variables, 0/638 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/1205 variables, 0/638 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1205/1205 variables, and 638 constraints, problems are : Problem set: 0 solved, 2 unsolved in 322 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 601/601 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 89/92 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 508/600 variables, 34/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/600 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 604/1204 variables, 600/637 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1204 variables, 2/639 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1204 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf1 is UNSAT
Problem apf7 is UNSAT
After SMT solving in domain Int declared 1205/1205 variables, and 640 constraints, problems are : Problem set: 2 solved, 0 unsolved in 343 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 601/601 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 678ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge based reduction with 15 factoid took 208 ms. Reduced automaton from 9 states, 35 edges and 3 AP (stutter sensitive) to 9 states, 27 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 326 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Knowledge-based reduction took 1507 ms.
Stuttering acceptance computed with spot in 369 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 3 out of 601 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 601/601 places, 604/604 transitions.
Applied a total of 0 rules in 15 ms. Remains 601 /601 variables (removed 0) and now considering 604/604 (removed 0) transitions.
[2026-05-25 18:30:35] [INFO ] Invariant cache hit.
[2026-05-25 18:30:36] [INFO ] Implicit Places using invariants in 139 ms returned []
[2026-05-25 18:30:36] [INFO ] Invariant cache hit.
[2026-05-25 18:30:36] [INFO ] Implicit Places using invariants and state equation in 450 ms returned []
Implicit Place search using SMT with State Equation took 591 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 607 ms. Remains : 601/601 places, 604/604 transitions.
Computed a total of 111 stabilizing places and 111 stable transitions
Graph (complete) has 937 edges and 601 vertex of which 561 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.3 ms
Computed a total of 111 stabilizing places and 111 stable transitions
Knowledge based reduction with 13 factoid took 87 ms. Reduced automaton from 9 states, 27 edges and 3 AP (stutter sensitive) to 9 states, 27 edges and 3 AP (stutter sensitive).
RANDOM walk for 31636 steps (102 resets) in 85 ms. (367 steps per ms) remains 0/9 properties
Knowledge based reduction with 13 factoid took 198 ms. Reduced automaton from 9 states, 27 edges and 3 AP (stutter sensitive) to 9 states, 27 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 378 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Knowledge-based reduction took 710 ms.
Stuttering acceptance computed with spot in 391 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 399 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 19994 reset in 150 ms.
Product exploration explored 100000 steps with 19860 reset in 142 ms.
Spot run failed in 47 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/ltsmin6714232201141005909
[2026-05-25 18:30:38] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6714232201141005909
Running compilation step : cd /tmp/ltsmin6714232201141005909;'/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 893 ms.
Running link step : cd /tmp/ltsmin6714232201141005909;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin6714232201141005909;'/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/stateBased13370672263747555431.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 601 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 601/601 places, 604/604 transitions.
Applied a total of 0 rules in 11 ms. Remains 601 /601 variables (removed 0) and now considering 604/604 (removed 0) transitions.
[2026-05-25 18:30:53] [INFO ] Invariant cache hit.
[2026-05-25 18:30:53] [INFO ] Implicit Places using invariants in 186 ms returned []
[2026-05-25 18:30:53] [INFO ] Invariant cache hit.
[2026-05-25 18:30:54] [INFO ] Implicit Places using invariants and state equation in 422 ms returned []
Implicit Place search using SMT with State Equation took 626 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 639 ms. Remains : 601/601 places, 604/604 transitions.
Built C files in :
/tmp/ltsmin17496005567145612876
[2026-05-25 18:30:54] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17496005567145612876
Running compilation step : cd /tmp/ltsmin17496005567145612876;'/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 876 ms.
Running link step : cd /tmp/ltsmin17496005567145612876;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin17496005567145612876;'/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/stateBased7721017086888085372.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-25 18:31:09] [INFO ] Flatten gal took : 15 ms
[2026-05-25 18:31:09] [INFO ] Flatten gal took : 13 ms
[2026-05-25 18:31:09] [INFO ] Time to serialize gal into /tmp/LTL4462105767948036409.gal : 3 ms
[2026-05-25 18:31:09] [INFO ] Time to serialize properties into /tmp/LTL7264206257638222821.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4462105767948036409.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3835874543647241338.hoa' '-atoms' '/tmp/LTL7264206257638222821.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL7264206257638222821.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3835874543647241338.hoa
Detected timeout of ITS tools.
[2026-05-25 18:31:24] [INFO ] Flatten gal took : 37 ms
[2026-05-25 18:31:24] [INFO ] Flatten gal took : 12 ms
[2026-05-25 18:31:24] [INFO ] Time to serialize gal into /tmp/LTL15081075601811117371.gal : 19 ms
[2026-05-25 18:31:24] [INFO ] Time to serialize properties into /tmp/LTL10379293310937031206.ltl : 13 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15081075601811117371.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10379293310937031206.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G(("(p625==1)")||(F(("((p410==0)&&(p262==0))")&&(X(X(X("(p625==0)"))))))))))
Formula 0 simplified : G(F!"(p625==1)" & FG(!"((p410==0)&&(p262==0))" | XXX!"(p625==0)"))
Detected timeout of ITS tools.
[2026-05-25 18:31:39] [INFO ] Flatten gal took : 10 ms
[2026-05-25 18:31:39] [INFO ] Applying decomposition
[2026-05-25 18:31:39] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph11573726154429566297.txt' '-o' '/tmp/graph11573726154429566297.bin' '-w' '/tmp/graph11573726154429566297.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11573726154429566297.bin' '-l' '-1' '-v' '-w' '/tmp/graph11573726154429566297.weights' '-q' '0' '-e' '0.001'
[2026-05-25 18:31:39] [INFO ] Decomposing Gal with order
[2026-05-25 18:31:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 18:31:39] [INFO ] Removed a total of 187 redundant transitions.
[2026-05-25 18:31:39] [INFO ] Flatten gal took : 55 ms
[2026-05-25 18:31:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2026-05-25 18:31:39] [INFO ] Time to serialize gal into /tmp/LTL1859234207930281358.gal : 6 ms
[2026-05-25 18:31:39] [INFO ] Time to serialize properties into /tmp/LTL2755206945258567606.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1859234207930281358.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2755206945258567606.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F(G(("(i32.u225.p625==1)")||(F(("((i21.u149.p410==0)&&(i14.u96.p262==0))")&&(X(X(X("(i32.u225.p625==0)"))))))))))
Formula 0 simplified : G(F!"(i32.u225.p625==1)" & FG(!"((i21.u149.p410==0)&&(i14.u96.p262==0))" | XXX!"(i32.u225.p625==0)"))
Reverse transition relation is NOT exact ! Due to transitions t547, i0.t287, i0.u139.t280, i2.t542, i2.t535, i3.t529, i3.t520, i4.t513, i4.t506, i5.t499, i...1041
Computing Next relation with stutter on 3.00189e+17 deadlock states
299 unique states visited
298 strongly connected components in search stack
301 transitions explored
299 items max in DFS search stack
1089 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,10.9952,294972,1,0,623820,318,5876,757855,155,897,1313237
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-36b-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property GPUForwardProgress-PT-36b-LTLFireability-08 finished in 79327 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||((p1 U G(p2))&&F((p3||G(p0))))) U X(p2)))'
Support contains 4 out of 612 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 621/621 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 602 transition count 611
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 602 transition count 611
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 25 place count 602 transition count 606
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 27 place count 600 transition count 604
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 600 transition count 604
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 600 transition count 602
Applied a total of 31 rules in 32 ms. Remains 600 /612 variables (removed 12) and now considering 602/621 (removed 19) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15795190550507362079.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15860509867829635540.kers'
[2026-05-25 18:31:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15795190550507362079.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15860509867829635540.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 602 rows 600 cols 1565 entries
Finished phase 1 with 562 SingleSign rule and 1 generalized
[2026-05-25 18:31:52] [INFO ] Computed 37 invariants in 2 ms
Computed 37 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-15860509867829635540.kers
Total runtime 15 ms.
[2026-05-25 18:31:52] [INFO ] Implicit Places using invariants in 248 ms returned []
[2026-05-25 18:31:52] [INFO ] Invariant cache hit.
[2026-05-25 18:31:52] [INFO ] Implicit Places using invariants and state equation in 441 ms returned []
Implicit Place search using SMT with State Equation took 730 ms to find 0 implicit places.
Running 601 sub problems to find dead transitions.
[2026-05-25 18:31:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/599 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/599 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 2 (OVERLAPS) 602/1201 variables, 599/636 constraints. Problems are: Problem set: 0 solved, 601 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1201/1202 variables, and 636 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 599/600 constraints, PredecessorRefiner: 601/601 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 601 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/599 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/599 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 2 (OVERLAPS) 602/1201 variables, 599/636 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1201 variables, 601/1237 constraints. Problems are: Problem set: 0 solved, 601 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1201/1202 variables, and 1237 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 599/600 constraints, PredecessorRefiner: 601/601 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60110ms problems are : Problem set: 0 solved, 601 unsolved
Search for dead transitions found 0 dead transitions in 60112ms
Starting structural reductions in LTL mode, iteration 1 : 600/612 places, 602/621 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60875 ms. Remains : 600/612 places, 602/621 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||((p1 U G(p2))&&F((p3||G(p0))))) U X(p2)))'
Stuttering acceptance computed with spot in 381 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p3) (NOT p2) (NOT p0)), (NOT p2), true, (NOT p2), (NOT p2), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : GPUForwardProgress-PT-36b-LTLFireability-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-36b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36b-LTLFireability-09 finished in 61317 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||(F(p1)&&X(X(X(F(p2))))))))'
Support contains 5 out of 612 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 621/621 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 603 transition count 612
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 603 transition count 612
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 22 place count 603 transition count 608
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 24 place count 601 transition count 606
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 601 transition count 606
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 28 place count 601 transition count 604
Applied a total of 28 rules in 41 ms. Remains 601 /612 variables (removed 11) and now considering 604/621 (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-13208324775065708963.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5622740320060670787.kers'
[2026-05-25 18:32:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13208324775065708963.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5622740320060670787.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 604 rows 601 cols 1569 entries
Finished phase 1 with 563 SingleSign rule and 1 generalized
[2026-05-25 18:32:53] [INFO ] Computed 37 invariants in 6 ms
Computed 37 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-5622740320060670787.kers
Total runtime 8 ms.
[2026-05-25 18:32:53] [INFO ] Implicit Places using invariants in 155 ms returned []
[2026-05-25 18:32:53] [INFO ] Invariant cache hit.
[2026-05-25 18:32:53] [INFO ] Implicit Places using invariants and state equation in 402 ms returned []
Implicit Place search using SMT with State Equation took 559 ms to find 0 implicit places.
Running 603 sub problems to find dead transitions.
[2026-05-25 18:32:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/600 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/600 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 2 (OVERLAPS) 604/1204 variables, 600/637 constraints. Problems are: Problem set: 0 solved, 603 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1204/1205 variables, and 637 constraints, problems are : Problem set: 0 solved, 603 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 600/601 constraints, PredecessorRefiner: 603/603 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 603 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/600 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/600 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 2 (OVERLAPS) 604/1204 variables, 600/637 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1204 variables, 603/1240 constraints. Problems are: Problem set: 0 solved, 603 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1204/1205 variables, and 1240 constraints, problems are : Problem set: 0 solved, 603 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 600/601 constraints, PredecessorRefiner: 603/603 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60113ms problems are : Problem set: 0 solved, 603 unsolved
Search for dead transitions found 0 dead transitions in 60115ms
Starting structural reductions in LTL mode, iteration 1 : 601/612 places, 604/621 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60717 ms. Remains : 601/612 places, 604/621 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||(F(p1)&&X(X(X(F(p2))))))))'
Stuttering acceptance computed with spot in 207 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p1), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : GPUForwardProgress-PT-36b-LTLFireability-11
Stuttering criterion allowed to conclude after 297 steps with 0 reset in 2 ms.
FORMULA GPUForwardProgress-PT-36b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36b-LTLFireability-11 finished in 60969 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(G(p0)))))'
Support contains 1 out of 612 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 621/621 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 603 transition count 612
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 603 transition count 612
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 23 place count 603 transition count 607
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 602 transition count 606
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 602 transition count 606
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 26 place count 602 transition count 605
Applied a total of 26 rules in 41 ms. Remains 602 /612 variables (removed 10) and now considering 605/621 (removed 16) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13507722011979347048.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1734411199114796744.kers'
[2026-05-25 18:33:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13507722011979347048.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1734411199114796744.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 605 rows 602 cols 1571 entries
Finished phase 1 with 564 SingleSign rule and 1 generalized
[2026-05-25 18:33:54] [INFO ] Computed 37 invariants in 5 ms
Computed 37 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-1734411199114796744.kers
Total runtime 7 ms.
[2026-05-25 18:33:54] [INFO ] Implicit Places using invariants in 149 ms returned []
[2026-05-25 18:33:54] [INFO ] Invariant cache hit.
[2026-05-25 18:33:54] [INFO ] Implicit Places using invariants and state equation in 450 ms returned []
Implicit Place search using SMT with State Equation took 601 ms to find 0 implicit places.
Running 604 sub problems to find dead transitions.
[2026-05-25 18:33:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/601 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/601 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 2 (OVERLAPS) 605/1206 variables, 601/638 constraints. Problems are: Problem set: 0 solved, 604 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1206/1207 variables, and 638 constraints, problems are : Problem set: 0 solved, 604 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 601/602 constraints, PredecessorRefiner: 604/604 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 604 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/601 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/601 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 2 (OVERLAPS) 605/1206 variables, 601/638 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1206 variables, 604/1242 constraints. Problems are: Problem set: 0 solved, 604 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1206/1207 variables, and 1242 constraints, problems are : Problem set: 0 solved, 604 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 601/602 constraints, PredecessorRefiner: 604/604 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60118ms problems are : Problem set: 0 solved, 604 unsolved
Search for dead transitions found 0 dead transitions in 60121ms
Starting structural reductions in LTL mode, iteration 1 : 602/612 places, 605/621 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60768 ms. Remains : 602/612 places, 605/621 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(G(p0)))))'
Stuttering acceptance computed with spot in 179 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-36b-LTLFireability-12
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-36b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36b-LTLFireability-12 finished in 60981 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)&&F(G(p1)))))'
Support contains 2 out of 612 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 612/612 places, 621/621 transitions.
Graph (trivial) has 507 edges and 612 vertex of which 6 / 612 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 948 edges and 607 vertex of which 567 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.2 ms
Discarding 40 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 292 transitions
Trivial Post-agglo rules discarded 292 transitions
Performed 292 trivial Post agglomeration. Transition count delta: 292
Iterating post reduction 0 with 292 rules applied. Total rules applied 294 place count 566 transition count 319
Reduce places removed 292 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 304 rules applied. Total rules applied 598 place count 274 transition count 307
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 604 place count 269 transition count 306
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 605 place count 268 transition count 306
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 76 Pre rules applied. Total rules applied 605 place count 268 transition count 230
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 4 with 152 rules applied. Total rules applied 757 place count 192 transition count 230
Discarding 35 places :
Symmetric choice reduction at 4 with 35 rule applications. Total rules 792 place count 157 transition count 195
Iterating global reduction 4 with 35 rules applied. Total rules applied 827 place count 157 transition count 195
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 4 with 222 rules applied. Total rules applied 1049 place count 46 transition count 84
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1050 place count 46 transition count 83
Discarding 35 places :
Symmetric choice reduction at 5 with 35 rule applications. Total rules 1085 place count 11 transition count 14
Iterating global reduction 5 with 35 rules applied. Total rules applied 1120 place count 11 transition count 14
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 1122 place count 10 transition count 13
Applied a total of 1122 rules in 28 ms. Remains 10 /612 variables (removed 602) and now considering 13/621 (removed 608) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1358652941252486533.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13548478238218879872.kers'
[2026-05-25 18:34:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1358652941252486533.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13548478238218879872.kers]
Normalized transition count is 12 out of 13 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 12 rows 10 cols 30 entries
Finished phase 1 with 10 SingleSign rule and 0 generalized
[2026-05-25 18:34:55] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13548478238218879872.kers
Total runtime 0 ms.
[2026-05-25 18:34:55] [INFO ] Implicit Places using invariants in 21 ms returned []
[2026-05-25 18:34:55] [INFO ] Invariant cache hit.
[2026-05-25 18:34:55] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-25 18:34:55] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2026-05-25 18:34:55] [INFO ] Redundant transitions in 13 ms returned []
Running 12 sub problems to find dead transitions.
[2026-05-25 18:34:55] [INFO ] Invariant cache hit.
[2026-05-25 18:34:55] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 1/22 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 1/23 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/23 variables, and 14 constraints, problems are : Problem set: 0 solved, 12 unsolved in 123 ms.
Refiners :[State Equation: 10/10 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 12/24 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 1/22 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 1/23 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/23 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 0/23 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/23 variables, and 26 constraints, problems are : Problem set: 0 solved, 12 unsolved in 164 ms.
Refiners :[State Equation: 10/10 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 290ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 290ms
Starting structural reductions in SI_LTL mode, iteration 1 : 10/612 places, 13/621 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 382 ms. Remains : 10/612 places, 13/621 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)&&F(G(p1)))))'
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-36b-LTLFireability-13
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-36b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36b-LTLFireability-13 finished in 548 ms.
All properties solved by simple procedures.
Total runtime 679826 ms.

BK_STOP 1779734095896

--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-36b"
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-36b, 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-177961074200516"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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