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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 792K
-rw-r--r-- 1 mcc users 6.3K Mar 7 07:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Mar 7 07:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Mar 7 07:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 7 07:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 15 10:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 10:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 10:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 10:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 7 07:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Mar 7 07:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Mar 7 07:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Mar 7 07:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 10:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 10:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 391K 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 FunctionPointer-PT-b032-LTLFireability-00
FORMULA_NAME FunctionPointer-PT-b032-LTLFireability-01
FORMULA_NAME FunctionPointer-PT-b032-LTLFireability-02
FORMULA_NAME FunctionPointer-PT-b032-LTLFireability-03
FORMULA_NAME FunctionPointer-PT-b032-LTLFireability-04
FORMULA_NAME FunctionPointer-PT-b032-LTLFireability-05
FORMULA_NAME FunctionPointer-PT-b032-LTLFireability-06
FORMULA_NAME FunctionPointer-PT-b032-LTLFireability-07
FORMULA_NAME FunctionPointer-PT-b032-LTLFireability-08
FORMULA_NAME FunctionPointer-PT-b032-LTLFireability-09
FORMULA_NAME FunctionPointer-PT-b032-LTLFireability-10
FORMULA_NAME FunctionPointer-PT-b032-LTLFireability-11
FORMULA_NAME FunctionPointer-PT-b032-LTLFireability-12
FORMULA_NAME FunctionPointer-PT-b032-LTLFireability-13
FORMULA_NAME FunctionPointer-PT-b032-LTLFireability-14
FORMULA_NAME FunctionPointer-PT-b032-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779675497031

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-b032
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-25 02:18:18] [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 02:18:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 02:18:18] [INFO ] Load time of PNML (sax parser for PT used): 104 ms
[2026-05-25 02:18:18] [INFO ] Transformed 306 places.
[2026-05-25 02:18:18] [INFO ] Transformed 840 transitions.
[2026-05-25 02:18:18] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 194 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 1 formulas.
Deduced a syphon composed of 84 places in 5 ms
Reduce places removed 84 places and 192 transitions.
FORMULA FunctionPointer-PT-b032-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b032-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b032-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b032-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 648/648 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 212 transition count 648
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 30 place count 192 transition count 550
Iterating global reduction 1 with 20 rules applied. Total rules applied 50 place count 192 transition count 550
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 88 place count 192 transition count 512
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 100 place count 180 transition count 488
Iterating global reduction 2 with 12 rules applied. Total rules applied 112 place count 180 transition count 488
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 128 place count 180 transition count 472
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 134 place count 174 transition count 460
Iterating global reduction 3 with 6 rules applied. Total rules applied 140 place count 174 transition count 460
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 145 place count 169 transition count 440
Iterating global reduction 3 with 5 rules applied. Total rules applied 150 place count 169 transition count 440
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 154 place count 165 transition count 432
Iterating global reduction 3 with 4 rules applied. Total rules applied 158 place count 165 transition count 432
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 159 place count 164 transition count 428
Iterating global reduction 3 with 1 rules applied. Total rules applied 160 place count 164 transition count 428
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 161 place count 163 transition count 424
Iterating global reduction 3 with 1 rules applied. Total rules applied 162 place count 163 transition count 424
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 163 place count 162 transition count 422
Iterating global reduction 3 with 1 rules applied. Total rules applied 164 place count 162 transition count 422
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 165 place count 161 transition count 420
Iterating global reduction 3 with 1 rules applied. Total rules applied 166 place count 161 transition count 420
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 167 place count 160 transition count 418
Iterating global reduction 3 with 1 rules applied. Total rules applied 168 place count 160 transition count 418
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 169 place count 159 transition count 416
Iterating global reduction 3 with 1 rules applied. Total rules applied 170 place count 159 transition count 416
Applied a total of 170 rules in 91 ms. Remains 159 /222 variables (removed 63) and now considering 416/648 (removed 232) transitions.
[2026-05-25 02:18:18] [INFO ] Flow matrix only has 279 transitions (discarded 137 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14744760815289688570.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16469983324867131451.kers'
[2026-05-25 02:18:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14744760815289688570.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16469983324867131451.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 279 rows 159 cols 756 entries
Finished phase 1 with 156 SingleSign rule and 1 generalized
[2026-05-25 02:18:18] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16469983324867131451.kers
Total runtime 2 ms.
[2026-05-25 02:18:18] [INFO ] Implicit Places using invariants in 253 ms returned []
[2026-05-25 02:18:18] [INFO ] Flow matrix only has 279 transitions (discarded 137 similar events)
[2026-05-25 02:18:18] [INFO ] Invariant cache hit.
[2026-05-25 02:18:18] [INFO ] State equation strengthened by 58 read => feed constraints.
[2026-05-25 02:18:19] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 557 ms to find 0 implicit places.
Running 414 sub problems to find dead transitions.
[2026-05-25 02:18:19] [INFO ] Flow matrix only has 279 transitions (discarded 137 similar events)
[2026-05-25 02:18:19] [INFO ] Invariant cache hit.
[2026-05-25 02:18:19] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 3 (OVERLAPS) 279/438 variables, 159/161 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/438 variables, 58/219 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/438 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 414 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/438 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 414 unsolved
No progress, stopping.
After SMT solving in domain Real declared 438/438 variables, and 219 constraints, problems are : Problem set: 0 solved, 414 unsolved in 14528 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 159/159 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 414/414 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 414 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 3 (OVERLAPS) 279/438 variables, 159/161 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/438 variables, 58/219 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/438 variables, 414/633 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/438 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 414 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 438/438 variables, and 633 constraints, problems are : Problem set: 0 solved, 414 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 159/159 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 414/414 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44891ms problems are : Problem set: 0 solved, 414 unsolved
Search for dead transitions found 0 dead transitions in 44903ms
Starting structural reductions in LTL mode, iteration 1 : 159/222 places, 416/648 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45582 ms. Remains : 159/222 places, 416/648 transitions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 416/416 transitions.
Applied a total of 0 rules in 4 ms. Remains 159 /159 variables (removed 0) and now considering 416/416 (removed 0) transitions.
[2026-05-25 02:19:04] [INFO ] Flow matrix only has 279 transitions (discarded 137 similar events)
[2026-05-25 02:19:04] [INFO ] Invariant cache hit.
[2026-05-25 02:19:04] [INFO ] Implicit Places using invariants in 88 ms returned []
[2026-05-25 02:19:04] [INFO ] Flow matrix only has 279 transitions (discarded 137 similar events)
[2026-05-25 02:19:04] [INFO ] Invariant cache hit.
[2026-05-25 02:19:04] [INFO ] State equation strengthened by 58 read => feed constraints.
[2026-05-25 02:19:04] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 311 ms. Remains : 159/159 places, 416/416 transitions.
Support contains 24 out of 159 places after structural reductions.
[2026-05-25 02:19:04] [INFO ] Flatten gal took : 46 ms
[2026-05-25 02:19:04] [INFO ] Flatten gal took : 23 ms
[2026-05-25 02:19:04] [INFO ] Input system was already deterministic with 416 transitions.
Reduction of identical properties reduced properties to check from 20 to 19
RANDOM walk for 40031 steps (31 resets) in 1066 ms. (37 steps per ms) remains 0/19 properties
FORMULA FunctionPointer-PT-b032-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 24 stabilizing places and 64 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 3 out of 159 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 159/159 places, 416/416 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 149 transition count 382
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 149 transition count 382
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 36 place count 149 transition count 366
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 41 place count 144 transition count 354
Iterating global reduction 1 with 5 rules applied. Total rules applied 46 place count 144 transition count 354
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 51 place count 139 transition count 336
Iterating global reduction 1 with 5 rules applied. Total rules applied 56 place count 139 transition count 336
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 61 place count 134 transition count 318
Iterating global reduction 1 with 5 rules applied. Total rules applied 66 place count 134 transition count 318
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 71 place count 129 transition count 308
Iterating global reduction 1 with 5 rules applied. Total rules applied 76 place count 129 transition count 308
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 81 place count 124 transition count 296
Iterating global reduction 1 with 5 rules applied. Total rules applied 86 place count 124 transition count 296
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 91 place count 119 transition count 284
Iterating global reduction 1 with 5 rules applied. Total rules applied 96 place count 119 transition count 284
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 101 place count 114 transition count 274
Iterating global reduction 1 with 5 rules applied. Total rules applied 106 place count 114 transition count 274
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 110 place count 110 transition count 266
Iterating global reduction 1 with 4 rules applied. Total rules applied 114 place count 110 transition count 266
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 115 place count 109 transition count 264
Iterating global reduction 1 with 1 rules applied. Total rules applied 116 place count 109 transition count 264
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 117 place count 108 transition count 262
Iterating global reduction 1 with 1 rules applied. Total rules applied 118 place count 108 transition count 262
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 119 place count 107 transition count 260
Iterating global reduction 1 with 1 rules applied. Total rules applied 120 place count 107 transition count 260
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 124 place count 107 transition count 256
Applied a total of 124 rules in 79 ms. Remains 107 /159 variables (removed 52) and now considering 256/416 (removed 160) transitions.
[2026-05-25 02:19:05] [INFO ] Flow matrix only has 175 transitions (discarded 81 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12519008104118366479.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13132674766215130146.kers'
[2026-05-25 02:19:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12519008104118366479.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13132674766215130146.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 175 rows 107 cols 484 entries
Finished phase 1 with 104 SingleSign rule and 1 generalized
[2026-05-25 02:19:05] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-13132674766215130146.kers
Total runtime 2 ms.
[2026-05-25 02:19:05] [INFO ] Implicit Places using invariants in 78 ms returned []
[2026-05-25 02:19:05] [INFO ] Flow matrix only has 175 transitions (discarded 81 similar events)
[2026-05-25 02:19:05] [INFO ] Invariant cache hit.
[2026-05-25 02:19:05] [INFO ] State equation strengthened by 42 read => feed constraints.
[2026-05-25 02:19:05] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
[2026-05-25 02:19:05] [INFO ] Redundant transitions in 12 ms returned []
Running 254 sub problems to find dead transitions.
[2026-05-25 02:19:05] [INFO ] Flow matrix only has 175 transitions (discarded 81 similar events)
[2026-05-25 02:19:05] [INFO ] Invariant cache hit.
[2026-05-25 02:19:05] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (OVERLAPS) 175/282 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/282 variables, 42/151 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/282 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 254 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/282 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Real declared 282/282 variables, and 151 constraints, problems are : Problem set: 0 solved, 254 unsolved in 6154 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 107/107 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 254 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (OVERLAPS) 175/282 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/282 variables, 42/151 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/282 variables, 254/405 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/282 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 7 (OVERLAPS) 0/282 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Int declared 282/282 variables, and 405 constraints, problems are : Problem set: 0 solved, 254 unsolved in 26132 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 107/107 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32373ms problems are : Problem set: 0 solved, 254 unsolved
Search for dead transitions found 0 dead transitions in 32374ms
Starting structural reductions in SI_LTL mode, iteration 1 : 107/159 places, 256/416 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 32760 ms. Remains : 107/159 places, 256/416 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Stuttering acceptance computed with spot in 270 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FunctionPointer-PT-b032-LTLFireability-00
Stuttering criterion allowed to conclude after 40 steps with 0 reset in 3 ms.
FORMULA FunctionPointer-PT-b032-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b032-LTLFireability-00 finished in 33122 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 159 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 159/159 places, 416/416 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 148 transition count 374
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 148 transition count 374
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 30 place count 148 transition count 366
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 36 place count 142 transition count 352
Iterating global reduction 1 with 6 rules applied. Total rules applied 42 place count 142 transition count 352
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 48 place count 136 transition count 330
Iterating global reduction 1 with 6 rules applied. Total rules applied 54 place count 136 transition count 330
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 60 place count 130 transition count 308
Iterating global reduction 1 with 6 rules applied. Total rules applied 66 place count 130 transition count 308
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 72 place count 124 transition count 296
Iterating global reduction 1 with 6 rules applied. Total rules applied 78 place count 124 transition count 296
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 84 place count 118 transition count 282
Iterating global reduction 1 with 6 rules applied. Total rules applied 90 place count 118 transition count 282
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 96 place count 112 transition count 268
Iterating global reduction 1 with 6 rules applied. Total rules applied 102 place count 112 transition count 268
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 108 place count 106 transition count 256
Iterating global reduction 1 with 6 rules applied. Total rules applied 114 place count 106 transition count 256
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 119 place count 101 transition count 246
Iterating global reduction 1 with 5 rules applied. Total rules applied 124 place count 101 transition count 246
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 125 place count 100 transition count 244
Iterating global reduction 1 with 1 rules applied. Total rules applied 126 place count 100 transition count 244
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 127 place count 99 transition count 242
Iterating global reduction 1 with 1 rules applied. Total rules applied 128 place count 99 transition count 242
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 129 place count 98 transition count 240
Iterating global reduction 1 with 1 rules applied. Total rules applied 130 place count 98 transition count 240
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 132 place count 98 transition count 238
Applied a total of 132 rules in 52 ms. Remains 98 /159 variables (removed 61) and now considering 238/416 (removed 178) transitions.
[2026-05-25 02:19:38] [INFO ] Flow matrix only has 160 transitions (discarded 78 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4254225111106718953.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11171446002382762626.kers'
[2026-05-25 02:19:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4254225111106718953.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11171446002382762626.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 160 rows 98 cols 442 entries
Finished phase 1 with 95 SingleSign rule and 1 generalized
[2026-05-25 02:19:38] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11171446002382762626.kers
Total runtime 1 ms.
[2026-05-25 02:19:38] [INFO ] Implicit Places using invariants in 65 ms returned []
[2026-05-25 02:19:38] [INFO ] Flow matrix only has 160 transitions (discarded 78 similar events)
[2026-05-25 02:19:38] [INFO ] Invariant cache hit.
[2026-05-25 02:19:38] [INFO ] State equation strengthened by 37 read => feed constraints.
[2026-05-25 02:19:38] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
[2026-05-25 02:19:38] [INFO ] Redundant transitions in 4 ms returned []
Running 236 sub problems to find dead transitions.
[2026-05-25 02:19:38] [INFO ] Flow matrix only has 160 transitions (discarded 78 similar events)
[2026-05-25 02:19:38] [INFO ] Invariant cache hit.
[2026-05-25 02:19:38] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (OVERLAPS) 160/258 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 37/137 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 236 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/258 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 137 constraints, problems are : Problem set: 0 solved, 236 unsolved in 5417 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 236 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (OVERLAPS) 160/258 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 37/137 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 236/373 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 3/376 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 1/377 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 236 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 258/258 variables, and 377 constraints, problems are : Problem set: 0 solved, 236 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 35485ms problems are : Problem set: 0 solved, 236 unsolved
Search for dead transitions found 0 dead transitions in 35487ms
Starting structural reductions in SI_LTL mode, iteration 1 : 98/159 places, 238/416 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 35840 ms. Remains : 98/159 places, 238/416 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 36 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b032-LTLFireability-01
Stuttering criterion allowed to conclude after 80 steps with 0 reset in 3 ms.
FORMULA FunctionPointer-PT-b032-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b032-LTLFireability-01 finished in 35905 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((X(X(X(G(p1))))&&p0))&&(!p2 U (p3||G(!p2)))))'
Support contains 7 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 416/416 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 150 transition count 380
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 150 transition count 380
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 26 place count 150 transition count 372
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 31 place count 145 transition count 360
Iterating global reduction 1 with 5 rules applied. Total rules applied 36 place count 145 transition count 360
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 41 place count 140 transition count 342
Iterating global reduction 1 with 5 rules applied. Total rules applied 46 place count 140 transition count 342
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 51 place count 135 transition count 324
Iterating global reduction 1 with 5 rules applied. Total rules applied 56 place count 135 transition count 324
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 61 place count 130 transition count 314
Iterating global reduction 1 with 5 rules applied. Total rules applied 66 place count 130 transition count 314
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 71 place count 125 transition count 302
Iterating global reduction 1 with 5 rules applied. Total rules applied 76 place count 125 transition count 302
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 81 place count 120 transition count 290
Iterating global reduction 1 with 5 rules applied. Total rules applied 86 place count 120 transition count 290
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 90 place count 116 transition count 282
Iterating global reduction 1 with 4 rules applied. Total rules applied 94 place count 116 transition count 282
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 98 place count 112 transition count 274
Iterating global reduction 1 with 4 rules applied. Total rules applied 102 place count 112 transition count 274
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 103 place count 111 transition count 272
Iterating global reduction 1 with 1 rules applied. Total rules applied 104 place count 111 transition count 272
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 110 transition count 270
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 110 transition count 270
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 109 transition count 268
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 109 transition count 268
Applied a total of 108 rules in 18 ms. Remains 109 /159 variables (removed 50) and now considering 268/416 (removed 148) transitions.
[2026-05-25 02:20:14] [INFO ] Flow matrix only has 184 transitions (discarded 84 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15196493802070883859.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15581964753353758322.kers'
[2026-05-25 02:20:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15196493802070883859.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15581964753353758322.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 184 rows 109 cols 508 entries
Finished phase 1 with 106 SingleSign rule and 1 generalized
[2026-05-25 02:20:14] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15581964753353758322.kers
Total runtime 1 ms.
[2026-05-25 02:20:14] [INFO ] Implicit Places using invariants in 66 ms returned []
[2026-05-25 02:20:14] [INFO ] Flow matrix only has 184 transitions (discarded 84 similar events)
[2026-05-25 02:20:14] [INFO ] Invariant cache hit.
[2026-05-25 02:20:14] [INFO ] State equation strengthened by 44 read => feed constraints.
[2026-05-25 02:20:14] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
Running 266 sub problems to find dead transitions.
[2026-05-25 02:20:14] [INFO ] Flow matrix only has 184 transitions (discarded 84 similar events)
[2026-05-25 02:20:14] [INFO ] Invariant cache hit.
[2026-05-25 02:20:14] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (OVERLAPS) 184/293 variables, 109/111 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/293 variables, 44/155 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 266 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/293 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 266 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 155 constraints, problems are : Problem set: 0 solved, 266 unsolved in 6626 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 109/109 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 266 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (OVERLAPS) 184/293 variables, 109/111 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/293 variables, 44/155 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 266/421 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/293 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 266 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 293/293 variables, and 422 constraints, problems are : Problem set: 0 solved, 266 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 109/109 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 36726ms problems are : Problem set: 0 solved, 266 unsolved
Search for dead transitions found 0 dead transitions in 36728ms
Starting structural reductions in LTL mode, iteration 1 : 109/159 places, 268/416 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36986 ms. Remains : 109/159 places, 268/416 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((X(X(X(G(p1))))&&p0))&&(!p2 U (p3||G(!p2)))))'
Stuttering acceptance computed with spot in 277 ms :[(OR (NOT p1) (NOT p0) (AND p2 (NOT p3))), true, (OR (NOT p0) (NOT p1)), (AND (NOT p3) p2), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : FunctionPointer-PT-b032-LTLFireability-03
Entered a terminal (fully accepting) state of product in 35 steps with 1 reset in 1 ms.
FORMULA FunctionPointer-PT-b032-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b032-LTLFireability-03 finished in 37299 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(((X(!p0)&&G(!p1))||G(!p0))))'
Support contains 3 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 416/416 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 149 transition count 388
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 149 transition count 388
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 42 place count 149 transition count 366
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 46 place count 145 transition count 356
Iterating global reduction 1 with 4 rules applied. Total rules applied 50 place count 145 transition count 356
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 54 place count 141 transition count 342
Iterating global reduction 1 with 4 rules applied. Total rules applied 58 place count 141 transition count 342
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 62 place count 137 transition count 328
Iterating global reduction 1 with 4 rules applied. Total rules applied 66 place count 137 transition count 328
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 70 place count 133 transition count 320
Iterating global reduction 1 with 4 rules applied. Total rules applied 74 place count 133 transition count 320
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 78 place count 129 transition count 310
Iterating global reduction 1 with 4 rules applied. Total rules applied 82 place count 129 transition count 310
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 86 place count 125 transition count 300
Iterating global reduction 1 with 4 rules applied. Total rules applied 90 place count 125 transition count 300
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 94 place count 121 transition count 292
Iterating global reduction 1 with 4 rules applied. Total rules applied 98 place count 121 transition count 292
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 101 place count 118 transition count 286
Iterating global reduction 1 with 3 rules applied. Total rules applied 104 place count 118 transition count 286
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 117 transition count 284
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 117 transition count 284
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 116 transition count 282
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 116 transition count 282
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 109 place count 115 transition count 280
Iterating global reduction 1 with 1 rules applied. Total rules applied 110 place count 115 transition count 280
Applied a total of 110 rules in 14 ms. Remains 115 /159 variables (removed 44) and now considering 280/416 (removed 136) transitions.
[2026-05-25 02:20:51] [INFO ] Flow matrix only has 189 transitions (discarded 91 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11145587024822472991.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-74555961051517536.kers'
[2026-05-25 02:20:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11145587024822472991.kers, --Pflows, --basisKERS=/tmp/petrispot-output-74555961051517536.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 189 rows 115 cols 520 entries
Finished phase 1 with 112 SingleSign rule and 1 generalized
[2026-05-25 02:20:51] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-74555961051517536.kers
Total runtime 1 ms.
[2026-05-25 02:20:51] [INFO ] Implicit Places using invariants in 75 ms returned []
[2026-05-25 02:20:51] [INFO ] Flow matrix only has 189 transitions (discarded 91 similar events)
[2026-05-25 02:20:51] [INFO ] Invariant cache hit.
[2026-05-25 02:20:51] [INFO ] State equation strengthened by 43 read => feed constraints.
[2026-05-25 02:20:51] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
Running 278 sub problems to find dead transitions.
[2026-05-25 02:20:51] [INFO ] Flow matrix only has 189 transitions (discarded 91 similar events)
[2026-05-25 02:20:51] [INFO ] Invariant cache hit.
[2026-05-25 02:20:51] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 3 (OVERLAPS) 189/304 variables, 115/117 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 43/160 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 278 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/304 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 278 unsolved
No progress, stopping.
After SMT solving in domain Real declared 304/304 variables, and 160 constraints, problems are : Problem set: 0 solved, 278 unsolved in 7251 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 115/115 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 278/278 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 278 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 3 (OVERLAPS) 189/304 variables, 115/117 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 43/160 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 278/438 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 7 (OVERLAPS) 0/304 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 278 unsolved
No progress, stopping.
After SMT solving in domain Int declared 304/304 variables, and 438 constraints, problems are : Problem set: 0 solved, 278 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 115/115 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 278/278 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37335ms problems are : Problem set: 0 solved, 278 unsolved
Search for dead transitions found 0 dead transitions in 37336ms
Starting structural reductions in LTL mode, iteration 1 : 115/159 places, 280/416 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37653 ms. Remains : 115/159 places, 280/416 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)||(X(p0)&&G(p1)))))'
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-b032-LTLFireability-04
Product exploration explored 100000 steps with 1807 reset in 392 ms.
Product exploration explored 100000 steps with 1814 reset in 375 ms.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge based reduction with 13 factoid took 67 ms. Reduced automaton from 3 states, 13 edges and 2 AP (stutter sensitive) to 3 states, 13 edges and 2 AP (stutter sensitive).
RANDOM walk for 40036 steps (27 resets) in 297 ms. (134 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 118 ms. (336 steps per ms) remains 1/1 properties
[2026-05-25 02:21:30] [INFO ] Flow matrix only has 189 transitions (discarded 91 similar events)
[2026-05-25 02:21:30] [INFO ] Invariant cache hit.
[2026-05-25 02:21:30] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 60/63 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 204/267 variables, 85/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 43/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 6/273 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/274 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/274 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/274 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 30/304 variables, 26/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/304 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/304 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 304/304 variables, and 160 constraints, problems are : Problem set: 0 solved, 1 unsolved in 129 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 115/115 constraints, ReadFeed: 43/43 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 60/63 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 204/267 variables, 85/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 43/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/273 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/274 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/274 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/274 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 30/304 variables, 26/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/304 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/304 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 304/304 variables, and 161 constraints, problems are : Problem set: 0 solved, 1 unsolved in 172 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 115/115 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 305ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 68 ms.
Support contains 3 out of 115 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 280/280 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 115 transition count 274
Applied a total of 6 rules in 14 ms. Remains 115 /115 variables (removed 0) and now considering 274/280 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 115/115 places, 274/280 transitions.
RANDOM walk for 40039 steps (42 resets) in 82 ms. (482 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1645471 steps, run timeout after 3010 ms. (steps per millisecond=546 ) properties seen :0 out of 1
Probabilistic random walk after 1645471 steps, saw 1011551 distinct states, run finished after 3016 ms. (steps per millisecond=545 ) properties seen :0
[2026-05-25 02:21:33] [INFO ] Flow matrix only has 186 transitions (discarded 88 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1890447193329506005.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17593757694329766146.kers'
[2026-05-25 02:21:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1890447193329506005.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17593757694329766146.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 186 rows 115 cols 514 entries
Finished phase 1 with 112 SingleSign rule and 1 generalized
[2026-05-25 02:21:33] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17593757694329766146.kers
Total runtime 1 ms.
[2026-05-25 02:21:33] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 60/63 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 201/264 variables, 85/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 43/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/264 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 6/270 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/271 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/271 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/271 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 29/300 variables, 25/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/300 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/301 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/301 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/301 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 301/301 variables, and 160 constraints, problems are : Problem set: 0 solved, 1 unsolved in 150 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 115/115 constraints, ReadFeed: 43/43 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 60/63 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 201/264 variables, 85/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 43/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/264 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/264 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/270 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/271 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/271 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/271 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 29/300 variables, 25/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/300 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/301 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/301 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/301 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 301/301 variables, and 161 constraints, problems are : Problem set: 0 solved, 1 unsolved in 212 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 115/115 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 371ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 49 ms.
Support contains 3 out of 115 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 274/274 transitions.
Applied a total of 0 rules in 6 ms. Remains 115 /115 variables (removed 0) and now considering 274/274 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 115/115 places, 274/274 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 274/274 transitions.
Applied a total of 0 rules in 6 ms. Remains 115 /115 variables (removed 0) and now considering 274/274 (removed 0) transitions.
[2026-05-25 02:21:34] [INFO ] Flow matrix only has 186 transitions (discarded 88 similar events)
[2026-05-25 02:21:34] [INFO ] Invariant cache hit.
[2026-05-25 02:21:34] [INFO ] Implicit Places using invariants in 72 ms returned []
[2026-05-25 02:21:34] [INFO ] Flow matrix only has 186 transitions (discarded 88 similar events)
[2026-05-25 02:21:34] [INFO ] Invariant cache hit.
[2026-05-25 02:21:34] [INFO ] State equation strengthened by 43 read => feed constraints.
[2026-05-25 02:21:34] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
[2026-05-25 02:21:34] [INFO ] Redundant transitions in 5 ms returned []
Running 272 sub problems to find dead transitions.
[2026-05-25 02:21:34] [INFO ] Flow matrix only has 186 transitions (discarded 88 similar events)
[2026-05-25 02:21:34] [INFO ] Invariant cache hit.
[2026-05-25 02:21:34] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (OVERLAPS) 186/301 variables, 115/117 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/301 variables, 43/160 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/301 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 272 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/301 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 272 unsolved
No progress, stopping.
After SMT solving in domain Real declared 301/301 variables, and 160 constraints, problems are : Problem set: 0 solved, 272 unsolved in 7232 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 115/115 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 272 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (OVERLAPS) 186/301 variables, 115/117 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/301 variables, 43/160 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/301 variables, 272/432 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/301 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 272 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 301/301 variables, and 433 constraints, problems are : Problem set: 0 solved, 272 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 115/115 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 37315ms problems are : Problem set: 0 solved, 272 unsolved
Search for dead transitions found 0 dead transitions in 37316ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37625 ms. Remains : 115/115 places, 274/274 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 165 edges and 115 vertex of which 24 / 115 are part of one of the 8 SCC in 1 ms
Free SCC test removed 16 places
Drop transitions (Empty/Sink Transition effects.) removed 40 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 112 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 99 transition count 155
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 15 place count 92 transition count 155
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 15 place count 92 transition count 135
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 55 place count 72 transition count 135
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 62 place count 65 transition count 128
Iterating global reduction 2 with 7 rules applied. Total rules applied 69 place count 65 transition count 128
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 83 place count 65 transition count 114
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 113 place count 50 transition count 99
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 120 place count 43 transition count 85
Iterating global reduction 3 with 7 rules applied. Total rules applied 127 place count 43 transition count 85
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 134 place count 36 transition count 71
Iterating global reduction 3 with 7 rules applied. Total rules applied 141 place count 36 transition count 71
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 148 place count 29 transition count 57
Iterating global reduction 3 with 7 rules applied. Total rules applied 155 place count 29 transition count 57
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 162 place count 29 transition count 50
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 162 place count 29 transition count 49
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 164 place count 28 transition count 49
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 170 place count 25 transition count 49
Applied a total of 170 rules in 19 ms. Remains 25 /115 variables (removed 90) and now considering 49/274 (removed 225) transitions.
Running SMT prover for 1 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1556979359328477799.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16018110322871756372.kers'
[2026-05-25 02:22:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1556979359328477799.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16018110322871756372.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 49 rows 25 cols 164 entries
Finished phase 1 with 22 SingleSign rule and 1 generalized
[2026-05-25 02:22:12] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16018110322871756372.kers
Total runtime 0 ms.
[2026-05-25 02:22:12] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 02:22:12] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 6 ms returned sat
[2026-05-25 02:22:12] [INFO ] After 14ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2026-05-25 02:22:12] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-25 02:22:12] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-25 02:22:12] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-25 02:22:12] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2026-05-25 02:22:12] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2026-05-25 02:22:12] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-25 02:22:12] [INFO ] After 4ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-25 02:22:12] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-25 02:22:12] [INFO ] After 53ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 135 ms.
Knowledge based reduction with 13 factoid took 129 ms. Reduced automaton from 3 states, 13 edges and 2 AP (stutter sensitive) to 3 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 42123 ms.
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 280/280 transitions.
Applied a total of 0 rules in 5 ms. Remains 115 /115 variables (removed 0) and now considering 280/280 (removed 0) transitions.
[2026-05-25 02:22:12] [INFO ] Flow matrix only has 189 transitions (discarded 91 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15141598245900885215.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7989496620894969038.kers'
[2026-05-25 02:22:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15141598245900885215.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7989496620894969038.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 189 rows 115 cols 520 entries
Finished phase 1 with 112 SingleSign rule and 1 generalized
[2026-05-25 02:22:12] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7989496620894969038.kers
Total runtime 1 ms.
[2026-05-25 02:22:12] [INFO ] Implicit Places using invariants in 81 ms returned []
[2026-05-25 02:22:12] [INFO ] Flow matrix only has 189 transitions (discarded 91 similar events)
[2026-05-25 02:22:12] [INFO ] Invariant cache hit.
[2026-05-25 02:22:12] [INFO ] State equation strengthened by 43 read => feed constraints.
[2026-05-25 02:22:12] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
Running 278 sub problems to find dead transitions.
[2026-05-25 02:22:12] [INFO ] Flow matrix only has 189 transitions (discarded 91 similar events)
[2026-05-25 02:22:12] [INFO ] Invariant cache hit.
[2026-05-25 02:22:12] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 3 (OVERLAPS) 189/304 variables, 115/117 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 43/160 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 278 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/304 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 278 unsolved
No progress, stopping.
After SMT solving in domain Real declared 304/304 variables, and 160 constraints, problems are : Problem set: 0 solved, 278 unsolved in 7263 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 115/115 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 278/278 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 278 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 3 (OVERLAPS) 189/304 variables, 115/117 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 43/160 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 278/438 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 7 (OVERLAPS) 0/304 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 278 unsolved
No progress, stopping.
After SMT solving in domain Int declared 304/304 variables, and 438 constraints, problems are : Problem set: 0 solved, 278 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 115/115 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 278/278 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37347ms problems are : Problem set: 0 solved, 278 unsolved
Search for dead transitions found 0 dead transitions in 37349ms
Finished structural reductions in LTL mode , in 1 iterations and 37669 ms. Remains : 115/115 places, 280/280 transitions.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge based reduction with 13 factoid took 54 ms. Reduced automaton from 3 states, 13 edges and 2 AP (stutter sensitive) to 3 states, 13 edges and 2 AP (stutter sensitive).
RANDOM walk for 40024 steps (29 resets) in 88 ms. (449 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 49 ms. (800 steps per ms) remains 1/1 properties
[2026-05-25 02:22:50] [INFO ] Flow matrix only has 189 transitions (discarded 91 similar events)
[2026-05-25 02:22:50] [INFO ] Invariant cache hit.
[2026-05-25 02:22:50] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 60/63 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 204/267 variables, 85/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 43/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 6/273 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/274 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/274 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/274 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 30/304 variables, 26/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/304 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/304 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 304/304 variables, and 160 constraints, problems are : Problem set: 0 solved, 1 unsolved in 128 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 115/115 constraints, ReadFeed: 43/43 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 60/63 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 204/267 variables, 85/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 43/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/273 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/274 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/274 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/274 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 30/304 variables, 26/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/304 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/304 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 304/304 variables, and 161 constraints, problems are : Problem set: 0 solved, 1 unsolved in 167 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 115/115 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 297ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 48 ms.
Support contains 3 out of 115 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 280/280 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 115 transition count 274
Applied a total of 6 rules in 11 ms. Remains 115 /115 variables (removed 0) and now considering 274/280 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 115/115 places, 274/280 transitions.
RANDOM walk for 40055 steps (50 resets) in 75 ms. (527 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1738402 steps, run timeout after 3001 ms. (steps per millisecond=579 ) properties seen :0 out of 1
Probabilistic random walk after 1738402 steps, saw 1072644 distinct states, run finished after 3001 ms. (steps per millisecond=579 ) properties seen :0
[2026-05-25 02:22:53] [INFO ] Flow matrix only has 186 transitions (discarded 88 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3177858701562788988.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9763301542875872806.kers'
[2026-05-25 02:22:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3177858701562788988.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9763301542875872806.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 186 rows 115 cols 514 entries
Finished phase 1 with 112 SingleSign rule and 1 generalized
[2026-05-25 02:22:53] [INFO ] Computed 2 invariants in 2 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9763301542875872806.kers
Total runtime 2 ms.
[2026-05-25 02:22:53] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 60/63 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 201/264 variables, 85/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 43/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/264 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 6/270 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/271 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/271 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/271 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 29/300 variables, 25/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/300 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/301 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/301 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/301 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 301/301 variables, and 160 constraints, problems are : Problem set: 0 solved, 1 unsolved in 149 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 115/115 constraints, ReadFeed: 43/43 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 60/63 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 201/264 variables, 85/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 43/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/264 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/264 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/270 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/271 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/271 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/271 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 29/300 variables, 25/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/300 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/301 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/301 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/301 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 301/301 variables, and 161 constraints, problems are : Problem set: 0 solved, 1 unsolved in 212 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 115/115 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 371ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 63 ms.
Support contains 3 out of 115 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 274/274 transitions.
Applied a total of 0 rules in 6 ms. Remains 115 /115 variables (removed 0) and now considering 274/274 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 115/115 places, 274/274 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 274/274 transitions.
Applied a total of 0 rules in 6 ms. Remains 115 /115 variables (removed 0) and now considering 274/274 (removed 0) transitions.
[2026-05-25 02:22:54] [INFO ] Flow matrix only has 186 transitions (discarded 88 similar events)
[2026-05-25 02:22:54] [INFO ] Invariant cache hit.
[2026-05-25 02:22:54] [INFO ] Implicit Places using invariants in 69 ms returned []
[2026-05-25 02:22:54] [INFO ] Flow matrix only has 186 transitions (discarded 88 similar events)
[2026-05-25 02:22:54] [INFO ] Invariant cache hit.
[2026-05-25 02:22:54] [INFO ] State equation strengthened by 43 read => feed constraints.
[2026-05-25 02:22:54] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
[2026-05-25 02:22:54] [INFO ] Redundant transitions in 3 ms returned []
Running 272 sub problems to find dead transitions.
[2026-05-25 02:22:54] [INFO ] Flow matrix only has 186 transitions (discarded 88 similar events)
[2026-05-25 02:22:54] [INFO ] Invariant cache hit.
[2026-05-25 02:22:54] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (OVERLAPS) 186/301 variables, 115/117 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/301 variables, 43/160 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/301 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 272 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/301 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 272 unsolved
No progress, stopping.
After SMT solving in domain Real declared 301/301 variables, and 160 constraints, problems are : Problem set: 0 solved, 272 unsolved in 7368 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 115/115 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 272 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (OVERLAPS) 186/301 variables, 115/117 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/301 variables, 43/160 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/301 variables, 272/432 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/301 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 272 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 301/301 variables, and 433 constraints, problems are : Problem set: 0 solved, 272 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 115/115 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 37454ms problems are : Problem set: 0 solved, 272 unsolved
Search for dead transitions found 0 dead transitions in 37455ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37764 ms. Remains : 115/115 places, 274/274 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 165 edges and 115 vertex of which 24 / 115 are part of one of the 8 SCC in 0 ms
Free SCC test removed 16 places
Drop transitions (Empty/Sink Transition effects.) removed 40 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 112 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 99 transition count 155
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 15 place count 92 transition count 155
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 15 place count 92 transition count 135
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 55 place count 72 transition count 135
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 62 place count 65 transition count 128
Iterating global reduction 2 with 7 rules applied. Total rules applied 69 place count 65 transition count 128
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 83 place count 65 transition count 114
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 113 place count 50 transition count 99
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 120 place count 43 transition count 85
Iterating global reduction 3 with 7 rules applied. Total rules applied 127 place count 43 transition count 85
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 134 place count 36 transition count 71
Iterating global reduction 3 with 7 rules applied. Total rules applied 141 place count 36 transition count 71
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 148 place count 29 transition count 57
Iterating global reduction 3 with 7 rules applied. Total rules applied 155 place count 29 transition count 57
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 162 place count 29 transition count 50
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 162 place count 29 transition count 49
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 164 place count 28 transition count 49
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 170 place count 25 transition count 49
Applied a total of 170 rules in 11 ms. Remains 25 /115 variables (removed 90) and now considering 49/274 (removed 225) transitions.
Running SMT prover for 1 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15979350518054657881.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15073488650735143220.kers'
[2026-05-25 02:23:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15979350518054657881.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15073488650735143220.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 49 rows 25 cols 164 entries
Finished phase 1 with 22 SingleSign rule and 1 generalized
[2026-05-25 02:23:31] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15073488650735143220.kers
Total runtime 0 ms.
[2026-05-25 02:23:31] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2026-05-25 02:23:31] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-25 02:23:31] [INFO ] After 16ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2026-05-25 02:23:31] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-25 02:23:31] [INFO ] After 4ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-25 02:23:31] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-25 02:23:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2026-05-25 02:23:31] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2026-05-25 02:23:31] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-25 02:23:32] [INFO ] After 4ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-25 02:23:32] [INFO ] After 10ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-25 02:23:32] [INFO ] After 45ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 106 ms.
Knowledge based reduction with 13 factoid took 129 ms. Reduced automaton from 3 states, 13 edges and 2 AP (stutter sensitive) to 3 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 42058 ms.
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1916 reset in 288 ms.
Product exploration explored 100000 steps with 1860 reset in 287 ms.
Spot run failed in 77 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/ltsmin7740804580079383084
[2026-05-25 02:23:33] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7740804580079383084
Running compilation step : cd /tmp/ltsmin7740804580079383084;'/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 534 ms.
Running link step : cd /tmp/ltsmin7740804580079383084;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin7740804580079383084;'/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/stateBased16287059002702270076.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 280/280 transitions.
Applied a total of 0 rules in 1 ms. Remains 115 /115 variables (removed 0) and now considering 280/280 (removed 0) transitions.
[2026-05-25 02:23:48] [INFO ] Flow matrix only has 189 transitions (discarded 91 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-613470784777804664.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7414148787797299728.kers'
[2026-05-25 02:23:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-613470784777804664.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7414148787797299728.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 189 rows 115 cols 520 entries
Finished phase 1 with 112 SingleSign rule and 1 generalized
[2026-05-25 02:23:48] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7414148787797299728.kers
Total runtime 1 ms.
[2026-05-25 02:23:48] [INFO ] Implicit Places using invariants in 71 ms returned []
[2026-05-25 02:23:48] [INFO ] Flow matrix only has 189 transitions (discarded 91 similar events)
[2026-05-25 02:23:48] [INFO ] Invariant cache hit.
[2026-05-25 02:23:48] [INFO ] State equation strengthened by 43 read => feed constraints.
[2026-05-25 02:23:48] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
Running 278 sub problems to find dead transitions.
[2026-05-25 02:23:48] [INFO ] Flow matrix only has 189 transitions (discarded 91 similar events)
[2026-05-25 02:23:48] [INFO ] Invariant cache hit.
[2026-05-25 02:23:48] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 3 (OVERLAPS) 189/304 variables, 115/117 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 43/160 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 278 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/304 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 278 unsolved
No progress, stopping.
After SMT solving in domain Real declared 304/304 variables, and 160 constraints, problems are : Problem set: 0 solved, 278 unsolved in 7148 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 115/115 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 278/278 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 278 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 3 (OVERLAPS) 189/304 variables, 115/117 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 43/160 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 278/438 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 7 (OVERLAPS) 0/304 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 278 unsolved
No progress, stopping.
After SMT solving in domain Int declared 304/304 variables, and 438 constraints, problems are : Problem set: 0 solved, 278 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 115/115 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 278/278 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37230ms problems are : Problem set: 0 solved, 278 unsolved
Search for dead transitions found 0 dead transitions in 37231ms
Finished structural reductions in LTL mode , in 1 iterations and 37526 ms. Remains : 115/115 places, 280/280 transitions.
Built C files in :
/tmp/ltsmin11873950641019607771
[2026-05-25 02:24:25] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11873950641019607771
Running compilation step : cd /tmp/ltsmin11873950641019607771;'/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 408 ms.
Running link step : cd /tmp/ltsmin11873950641019607771;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin11873950641019607771;'/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/stateBased14745953004963419099.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-25 02:24:40] [INFO ] Flatten gal took : 13 ms
[2026-05-25 02:24:40] [INFO ] Flatten gal took : 13 ms
[2026-05-25 02:24:40] [INFO ] Time to serialize gal into /tmp/LTL14846324996301141214.gal : 4 ms
[2026-05-25 02:24:40] [INFO ] Time to serialize properties into /tmp/LTL17575106719744075314.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/LTL14846324996301141214.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5798086267142343103.hoa' '-atoms' '/tmp/LTL17575106719744075314.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/LTL17575106719744075314.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5798086267142343103.hoa
Detected timeout of ITS tools.
[2026-05-25 02:24:55] [INFO ] Flatten gal took : 12 ms
[2026-05-25 02:24:55] [INFO ] Flatten gal took : 11 ms
[2026-05-25 02:24:55] [INFO ] Time to serialize gal into /tmp/LTL10170978423786181113.gal : 2 ms
[2026-05-25 02:24:55] [INFO ] Time to serialize properties into /tmp/LTL10401958632545533162.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10170978423786181113.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10401958632545533162.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("((s0<1)||(l183<1))"))||((X("((s0<1)||(l183<1))"))&&(G("((s0<1)||(l178<1))"))))))
Formula 0 simplified : G(F!"((s0<1)||(l183<1))" & (X!"((s0<1)||(l183<1))" | F!"((s0<1)||(l178<1))"))
Detected timeout of ITS tools.
[2026-05-25 02:25:10] [INFO ] Flatten gal took : 10 ms
[2026-05-25 02:25:10] [INFO ] Applying decomposition
[2026-05-25 02:25:10] [INFO ] Flatten gal took : 10 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/graph13708331900467405378.txt' '-o' '/tmp/graph13708331900467405378.bin' '-w' '/tmp/graph13708331900467405378.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13708331900467405378.bin' '-l' '-1' '-v' '-w' '/tmp/graph13708331900467405378.weights' '-q' '0' '-e' '0.001'
[2026-05-25 02:25:11] [INFO ] Decomposing Gal with order
[2026-05-25 02:25:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 02:25:11] [INFO ] Removed a total of 462 redundant transitions.
[2026-05-25 02:25:11] [INFO ] Flatten gal took : 65 ms
[2026-05-25 02:25:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 156 labels/synchronizations in 10 ms.
[2026-05-25 02:25:11] [INFO ] Time to serialize gal into /tmp/LTL4374846372471704540.gal : 4 ms
[2026-05-25 02:25:11] [INFO ] Time to serialize properties into /tmp/LTL2196326327483950604.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/LTL4374846372471704540.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2196326327483950604.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("((i0.u0.s0<1)||(i10.u25.l183<1))"))||((X("((i0.u0.s0<1)||(i10.u25.l183<1))"))&&(G("((i0.u0.s0<1)||(i10.u27.l178<1))"))))))
Formula 0 simplified : G(F!"((i0.u0.s0<1)||(i10.u25.l183<1))" & (X!"((i0.u0.s0<1)||(i10.u25.l183<1))" | F!"((i0.u0.s0<1)||(i10.u27.l178<1))"))
Detected timeout of ITS tools.
Treatment of property FunctionPointer-PT-b032-LTLFireability-04 finished in 274543 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||G(p1))))))'
Support contains 4 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 416/416 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 148 transition count 374
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 148 transition count 374
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 32 place count 148 transition count 364
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 37 place count 143 transition count 352
Iterating global reduction 1 with 5 rules applied. Total rules applied 42 place count 143 transition count 352
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 47 place count 138 transition count 332
Iterating global reduction 1 with 5 rules applied. Total rules applied 52 place count 138 transition count 332
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 57 place count 133 transition count 314
Iterating global reduction 1 with 5 rules applied. Total rules applied 62 place count 133 transition count 314
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 67 place count 128 transition count 304
Iterating global reduction 1 with 5 rules applied. Total rules applied 72 place count 128 transition count 304
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 77 place count 123 transition count 294
Iterating global reduction 1 with 5 rules applied. Total rules applied 82 place count 123 transition count 294
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 87 place count 118 transition count 284
Iterating global reduction 1 with 5 rules applied. Total rules applied 92 place count 118 transition count 284
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 97 place count 113 transition count 274
Iterating global reduction 1 with 5 rules applied. Total rules applied 102 place count 113 transition count 274
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 106 place count 109 transition count 266
Iterating global reduction 1 with 4 rules applied. Total rules applied 110 place count 109 transition count 266
Applied a total of 110 rules in 20 ms. Remains 109 /159 variables (removed 50) and now considering 266/416 (removed 150) transitions.
[2026-05-25 02:25:26] [INFO ] Flow matrix only has 181 transitions (discarded 85 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14033757450389204732.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14472333288450111444.kers'
[2026-05-25 02:25:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14033757450389204732.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14472333288450111444.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 181 rows 109 cols 504 entries
Finished phase 1 with 106 SingleSign rule and 1 generalized
[2026-05-25 02:25:26] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14472333288450111444.kers
Total runtime 1 ms.
[2026-05-25 02:25:26] [INFO ] Implicit Places using invariants in 74 ms returned []
[2026-05-25 02:25:26] [INFO ] Flow matrix only has 181 transitions (discarded 85 similar events)
[2026-05-25 02:25:26] [INFO ] Invariant cache hit.
[2026-05-25 02:25:26] [INFO ] State equation strengthened by 41 read => feed constraints.
[2026-05-25 02:25:26] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
Running 264 sub problems to find dead transitions.
[2026-05-25 02:25:26] [INFO ] Flow matrix only has 181 transitions (discarded 85 similar events)
[2026-05-25 02:25:26] [INFO ] Invariant cache hit.
[2026-05-25 02:25:26] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (OVERLAPS) 181/290 variables, 109/111 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/290 variables, 41/152 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/290 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 264 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/290 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Real declared 290/290 variables, and 152 constraints, problems are : Problem set: 0 solved, 264 unsolved in 6628 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 109/109 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 264 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (OVERLAPS) 181/290 variables, 109/111 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/290 variables, 41/152 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/290 variables, 264/416 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 7 (OVERLAPS) 0/290 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Int declared 290/290 variables, and 416 constraints, problems are : Problem set: 0 solved, 264 unsolved in 27432 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 109/109 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34119ms problems are : Problem set: 0 solved, 264 unsolved
Search for dead transitions found 0 dead transitions in 34120ms
Starting structural reductions in LTL mode, iteration 1 : 109/159 places, 266/416 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34440 ms. Remains : 109/159 places, 266/416 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(p0)||p1)))))'
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-b032-LTLFireability-07
Stuttering criterion allowed to conclude after 58 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b032-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b032-LTLFireability-07 finished in 34590 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))||G(p1)))'
Support contains 4 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 416/416 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 147 transition count 372
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 147 transition count 372
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 34 place count 147 transition count 362
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 40 place count 141 transition count 348
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 141 transition count 348
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 52 place count 135 transition count 326
Iterating global reduction 1 with 6 rules applied. Total rules applied 58 place count 135 transition count 326
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 64 place count 129 transition count 304
Iterating global reduction 1 with 6 rules applied. Total rules applied 70 place count 129 transition count 304
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 76 place count 123 transition count 292
Iterating global reduction 1 with 6 rules applied. Total rules applied 82 place count 123 transition count 292
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 88 place count 117 transition count 278
Iterating global reduction 1 with 6 rules applied. Total rules applied 94 place count 117 transition count 278
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 100 place count 111 transition count 264
Iterating global reduction 1 with 6 rules applied. Total rules applied 106 place count 111 transition count 264
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 112 place count 105 transition count 252
Iterating global reduction 1 with 6 rules applied. Total rules applied 118 place count 105 transition count 252
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 122 place count 101 transition count 244
Iterating global reduction 1 with 4 rules applied. Total rules applied 126 place count 101 transition count 244
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 127 place count 100 transition count 242
Iterating global reduction 1 with 1 rules applied. Total rules applied 128 place count 100 transition count 242
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 129 place count 99 transition count 240
Iterating global reduction 1 with 1 rules applied. Total rules applied 130 place count 99 transition count 240
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 131 place count 98 transition count 238
Iterating global reduction 1 with 1 rules applied. Total rules applied 132 place count 98 transition count 238
Applied a total of 132 rules in 19 ms. Remains 98 /159 variables (removed 61) and now considering 238/416 (removed 178) transitions.
[2026-05-25 02:26:00] [INFO ] Flow matrix only has 162 transitions (discarded 76 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14539278171994608246.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-912769771239644106.kers'
[2026-05-25 02:26:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14539278171994608246.kers, --Pflows, --basisKERS=/tmp/petrispot-output-912769771239644106.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 162 rows 98 cols 448 entries
Finished phase 1 with 95 SingleSign rule and 1 generalized
[2026-05-25 02:26:00] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-912769771239644106.kers
Total runtime 1 ms.
[2026-05-25 02:26:00] [INFO ] Implicit Places using invariants in 65 ms returned []
[2026-05-25 02:26:00] [INFO ] Flow matrix only has 162 transitions (discarded 76 similar events)
[2026-05-25 02:26:00] [INFO ] Invariant cache hit.
[2026-05-25 02:26:00] [INFO ] State equation strengthened by 39 read => feed constraints.
[2026-05-25 02:26:01] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
Running 236 sub problems to find dead transitions.
[2026-05-25 02:26:01] [INFO ] Flow matrix only has 162 transitions (discarded 76 similar events)
[2026-05-25 02:26:01] [INFO ] Invariant cache hit.
[2026-05-25 02:26:01] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (OVERLAPS) 162/260 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 39/139 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 236 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/260 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Real declared 260/260 variables, and 139 constraints, problems are : Problem set: 0 solved, 236 unsolved in 5685 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 236 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (OVERLAPS) 162/260 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 39/139 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 236/375 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/260 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 8 (OVERLAPS) 0/260 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Int declared 260/260 variables, and 376 constraints, problems are : Problem set: 0 solved, 236 unsolved in 22132 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 27864ms problems are : Problem set: 0 solved, 236 unsolved
Search for dead transitions found 0 dead transitions in 27865ms
Starting structural reductions in LTL mode, iteration 1 : 98/159 places, 238/416 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28152 ms. Remains : 98/159 places, 238/416 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))||G(p1)))'
Stuttering acceptance computed with spot in 261 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p0), true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : FunctionPointer-PT-b032-LTLFireability-08
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-b032-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b032-LTLFireability-08 finished in 28437 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||X((X((!p0||X(F(!p1)))) U (!p0&&X((!p0||X(F(!p1)))))))))))'
Support contains 3 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 416/416 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 149 transition count 382
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 149 transition count 382
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 34 place count 149 transition count 368
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 39 place count 144 transition count 356
Iterating global reduction 1 with 5 rules applied. Total rules applied 44 place count 144 transition count 356
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 49 place count 139 transition count 338
Iterating global reduction 1 with 5 rules applied. Total rules applied 54 place count 139 transition count 338
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 59 place count 134 transition count 320
Iterating global reduction 1 with 5 rules applied. Total rules applied 64 place count 134 transition count 320
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 69 place count 129 transition count 310
Iterating global reduction 1 with 5 rules applied. Total rules applied 74 place count 129 transition count 310
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 79 place count 124 transition count 298
Iterating global reduction 1 with 5 rules applied. Total rules applied 84 place count 124 transition count 298
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 89 place count 119 transition count 286
Iterating global reduction 1 with 5 rules applied. Total rules applied 94 place count 119 transition count 286
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 99 place count 114 transition count 276
Iterating global reduction 1 with 5 rules applied. Total rules applied 104 place count 114 transition count 276
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 108 place count 110 transition count 268
Iterating global reduction 1 with 4 rules applied. Total rules applied 112 place count 110 transition count 268
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 113 place count 109 transition count 266
Iterating global reduction 1 with 1 rules applied. Total rules applied 114 place count 109 transition count 266
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 115 place count 108 transition count 264
Iterating global reduction 1 with 1 rules applied. Total rules applied 116 place count 108 transition count 264
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 117 place count 107 transition count 262
Iterating global reduction 1 with 1 rules applied. Total rules applied 118 place count 107 transition count 262
Applied a total of 118 rules in 16 ms. Remains 107 /159 variables (removed 52) and now considering 262/416 (removed 154) transitions.
[2026-05-25 02:26:29] [INFO ] Flow matrix only has 176 transitions (discarded 86 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14456836859745249717.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17419602963069706698.kers'
[2026-05-25 02:26:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14456836859745249717.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17419602963069706698.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 176 rows 107 cols 484 entries
Finished phase 1 with 104 SingleSign rule and 1 generalized
[2026-05-25 02:26:29] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17419602963069706698.kers
Total runtime 2 ms.
[2026-05-25 02:26:29] [INFO ] Implicit Places using invariants in 70 ms returned []
[2026-05-25 02:26:29] [INFO ] Flow matrix only has 176 transitions (discarded 86 similar events)
[2026-05-25 02:26:29] [INFO ] Invariant cache hit.
[2026-05-25 02:26:29] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-25 02:26:29] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
Running 260 sub problems to find dead transitions.
[2026-05-25 02:26:29] [INFO ] Flow matrix only has 176 transitions (discarded 86 similar events)
[2026-05-25 02:26:29] [INFO ] Invariant cache hit.
[2026-05-25 02:26:29] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 176/283 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 40/149 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 260 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/283 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 283/283 variables, and 149 constraints, problems are : Problem set: 0 solved, 260 unsolved in 6401 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 107/107 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 176/283 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 40/149 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 260/409 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (OVERLAPS) 0/283 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Int declared 283/283 variables, and 409 constraints, problems are : Problem set: 0 solved, 260 unsolved in 28180 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 107/107 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34655ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 34657ms
Starting structural reductions in LTL mode, iteration 1 : 107/159 places, 262/416 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34991 ms. Remains : 107/159 places, 262/416 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X((X((!p0||X(F(!p1)))) U (!p0&&X((!p0||X(F(!p1)))))))||!p0))))'
Stuttering acceptance computed with spot in 267 ms :[p0, p0, p0, p0, (AND p0 p1), p1]
Running random walk in product with property : FunctionPointer-PT-b032-LTLFireability-09
Stuttering criterion allowed to conclude after 31117 steps with 4458 reset in 57 ms.
FORMULA FunctionPointer-PT-b032-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b032-LTLFireability-09 finished in 35347 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&F(p1))))'
Support contains 3 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 416/416 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 149 transition count 376
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 149 transition count 376
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 28 place count 149 transition count 368
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 34 place count 143 transition count 354
Iterating global reduction 1 with 6 rules applied. Total rules applied 40 place count 143 transition count 354
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 46 place count 137 transition count 332
Iterating global reduction 1 with 6 rules applied. Total rules applied 52 place count 137 transition count 332
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 58 place count 131 transition count 310
Iterating global reduction 1 with 6 rules applied. Total rules applied 64 place count 131 transition count 310
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 70 place count 125 transition count 298
Iterating global reduction 1 with 6 rules applied. Total rules applied 76 place count 125 transition count 298
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 82 place count 119 transition count 284
Iterating global reduction 1 with 6 rules applied. Total rules applied 88 place count 119 transition count 284
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 94 place count 113 transition count 270
Iterating global reduction 1 with 6 rules applied. Total rules applied 100 place count 113 transition count 270
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 106 place count 107 transition count 258
Iterating global reduction 1 with 6 rules applied. Total rules applied 112 place count 107 transition count 258
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 117 place count 102 transition count 248
Iterating global reduction 1 with 5 rules applied. Total rules applied 122 place count 102 transition count 248
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 123 place count 101 transition count 246
Iterating global reduction 1 with 1 rules applied. Total rules applied 124 place count 101 transition count 246
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 125 place count 100 transition count 244
Iterating global reduction 1 with 1 rules applied. Total rules applied 126 place count 100 transition count 244
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 127 place count 99 transition count 242
Iterating global reduction 1 with 1 rules applied. Total rules applied 128 place count 99 transition count 242
Applied a total of 128 rules in 17 ms. Remains 99 /159 variables (removed 60) and now considering 242/416 (removed 174) transitions.
[2026-05-25 02:27:04] [INFO ] Flow matrix only has 164 transitions (discarded 78 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2864232951837295606.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4206023994999274929.kers'
[2026-05-25 02:27:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2864232951837295606.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4206023994999274929.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 164 rows 99 cols 452 entries
Finished phase 1 with 96 SingleSign rule and 1 generalized
[2026-05-25 02:27:04] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4206023994999274929.kers
Total runtime 1 ms.
[2026-05-25 02:27:04] [INFO ] Implicit Places using invariants in 66 ms returned []
[2026-05-25 02:27:04] [INFO ] Flow matrix only has 164 transitions (discarded 78 similar events)
[2026-05-25 02:27:04] [INFO ] Invariant cache hit.
[2026-05-25 02:27:04] [INFO ] State equation strengthened by 39 read => feed constraints.
[2026-05-25 02:27:04] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
Running 240 sub problems to find dead transitions.
[2026-05-25 02:27:04] [INFO ] Flow matrix only has 164 transitions (discarded 78 similar events)
[2026-05-25 02:27:04] [INFO ] Invariant cache hit.
[2026-05-25 02:27:04] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (OVERLAPS) 164/263 variables, 99/101 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 39/140 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 240 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/263 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 240 unsolved
No progress, stopping.
After SMT solving in domain Real declared 263/263 variables, and 140 constraints, problems are : Problem set: 0 solved, 240 unsolved in 5922 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 240 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (OVERLAPS) 164/263 variables, 99/101 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 39/140 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 240/380 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 4/384 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 8 (OVERLAPS) 0/263 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 240 unsolved
No progress, stopping.
After SMT solving in domain Int declared 263/263 variables, and 384 constraints, problems are : Problem set: 0 solved, 240 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 35989ms problems are : Problem set: 0 solved, 240 unsolved
Search for dead transitions found 0 dead transitions in 35990ms
Starting structural reductions in LTL mode, iteration 1 : 99/159 places, 242/416 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36273 ms. Remains : 99/159 places, 242/416 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&F(p1))))'
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-b032-LTLFireability-11
Stuttering criterion allowed to conclude after 44 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-b032-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b032-LTLFireability-11 finished in 36468 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 2 out of 159 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 159/159 places, 416/416 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 147 transition count 372
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 147 transition count 372
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 34 place count 147 transition count 362
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 40 place count 141 transition count 348
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 141 transition count 348
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 52 place count 135 transition count 326
Iterating global reduction 1 with 6 rules applied. Total rules applied 58 place count 135 transition count 326
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 64 place count 129 transition count 304
Iterating global reduction 1 with 6 rules applied. Total rules applied 70 place count 129 transition count 304
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 76 place count 123 transition count 292
Iterating global reduction 1 with 6 rules applied. Total rules applied 82 place count 123 transition count 292
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 88 place count 117 transition count 278
Iterating global reduction 1 with 6 rules applied. Total rules applied 94 place count 117 transition count 278
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 99 place count 112 transition count 266
Iterating global reduction 1 with 5 rules applied. Total rules applied 104 place count 112 transition count 266
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 109 place count 107 transition count 256
Iterating global reduction 1 with 5 rules applied. Total rules applied 114 place count 107 transition count 256
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 118 place count 103 transition count 248
Iterating global reduction 1 with 4 rules applied. Total rules applied 122 place count 103 transition count 248
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 123 place count 102 transition count 246
Iterating global reduction 1 with 1 rules applied. Total rules applied 124 place count 102 transition count 246
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 125 place count 101 transition count 244
Iterating global reduction 1 with 1 rules applied. Total rules applied 126 place count 101 transition count 244
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 127 place count 100 transition count 242
Iterating global reduction 1 with 1 rules applied. Total rules applied 128 place count 100 transition count 242
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 130 place count 100 transition count 240
Applied a total of 130 rules in 34 ms. Remains 100 /159 variables (removed 59) and now considering 240/416 (removed 176) transitions.
[2026-05-25 02:27:41] [INFO ] Flow matrix only has 164 transitions (discarded 76 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12835760476687553356.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8988645575227972638.kers'
[2026-05-25 02:27:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12835760476687553356.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8988645575227972638.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 164 rows 100 cols 456 entries
Finished phase 1 with 97 SingleSign rule and 1 generalized
[2026-05-25 02:27:41] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8988645575227972638.kers
Total runtime 1 ms.
[2026-05-25 02:27:41] [INFO ] Implicit Places using invariants in 70 ms returned []
[2026-05-25 02:27:41] [INFO ] Flow matrix only has 164 transitions (discarded 76 similar events)
[2026-05-25 02:27:41] [INFO ] Invariant cache hit.
[2026-05-25 02:27:41] [INFO ] State equation strengthened by 39 read => feed constraints.
[2026-05-25 02:27:41] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
[2026-05-25 02:27:41] [INFO ] Redundant transitions in 0 ms returned []
Running 238 sub problems to find dead transitions.
[2026-05-25 02:27:41] [INFO ] Flow matrix only has 164 transitions (discarded 76 similar events)
[2026-05-25 02:27:41] [INFO ] Invariant cache hit.
[2026-05-25 02:27:41] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (OVERLAPS) 164/264 variables, 100/102 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 39/141 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/264 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 238 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/264 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Real declared 264/264 variables, and 141 constraints, problems are : Problem set: 0 solved, 238 unsolved in 5868 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 238 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (OVERLAPS) 164/264 variables, 100/102 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 39/141 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/264 variables, 238/379 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/264 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (OVERLAPS) 0/264 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Int declared 264/264 variables, and 379 constraints, problems are : Problem set: 0 solved, 238 unsolved in 21082 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 26996ms problems are : Problem set: 0 solved, 238 unsolved
Search for dead transitions found 0 dead transitions in 26997ms
Starting structural reductions in SI_LTL mode, iteration 1 : 100/159 places, 240/416 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 27333 ms. Remains : 100/159 places, 240/416 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 48 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b032-LTLFireability-12
Product exploration explored 100000 steps with 980 reset in 263 ms.
Stack based approach found an accepted trace after 58766 steps with 572 reset with depth 479 and stack size 479 in 170 ms.
FORMULA FunctionPointer-PT-b032-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-b032-LTLFireability-12 finished in 27852 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 159 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 159/159 places, 416/416 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 148 transition count 374
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 148 transition count 374
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 30 place count 148 transition count 366
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 36 place count 142 transition count 352
Iterating global reduction 1 with 6 rules applied. Total rules applied 42 place count 142 transition count 352
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 48 place count 136 transition count 330
Iterating global reduction 1 with 6 rules applied. Total rules applied 54 place count 136 transition count 330
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 60 place count 130 transition count 308
Iterating global reduction 1 with 6 rules applied. Total rules applied 66 place count 130 transition count 308
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 72 place count 124 transition count 296
Iterating global reduction 1 with 6 rules applied. Total rules applied 78 place count 124 transition count 296
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 84 place count 118 transition count 282
Iterating global reduction 1 with 6 rules applied. Total rules applied 90 place count 118 transition count 282
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 96 place count 112 transition count 268
Iterating global reduction 1 with 6 rules applied. Total rules applied 102 place count 112 transition count 268
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 108 place count 106 transition count 256
Iterating global reduction 1 with 6 rules applied. Total rules applied 114 place count 106 transition count 256
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 119 place count 101 transition count 246
Iterating global reduction 1 with 5 rules applied. Total rules applied 124 place count 101 transition count 246
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 125 place count 100 transition count 244
Iterating global reduction 1 with 1 rules applied. Total rules applied 126 place count 100 transition count 244
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 127 place count 99 transition count 242
Iterating global reduction 1 with 1 rules applied. Total rules applied 128 place count 99 transition count 242
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 129 place count 98 transition count 240
Iterating global reduction 1 with 1 rules applied. Total rules applied 130 place count 98 transition count 240
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 132 place count 98 transition count 238
Applied a total of 132 rules in 29 ms. Remains 98 /159 variables (removed 61) and now considering 238/416 (removed 178) transitions.
[2026-05-25 02:28:08] [INFO ] Flow matrix only has 160 transitions (discarded 78 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8022588963667945769.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10567174991454874799.kers'
[2026-05-25 02:28:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8022588963667945769.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10567174991454874799.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 160 rows 98 cols 442 entries
Finished phase 1 with 95 SingleSign rule and 1 generalized
[2026-05-25 02:28:08] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10567174991454874799.kers
Total runtime 1 ms.
[2026-05-25 02:28:08] [INFO ] Implicit Places using invariants in 69 ms returned []
[2026-05-25 02:28:08] [INFO ] Flow matrix only has 160 transitions (discarded 78 similar events)
[2026-05-25 02:28:08] [INFO ] Invariant cache hit.
[2026-05-25 02:28:09] [INFO ] State equation strengthened by 37 read => feed constraints.
[2026-05-25 02:28:09] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
[2026-05-25 02:28:09] [INFO ] Redundant transitions in 1 ms returned []
Running 236 sub problems to find dead transitions.
[2026-05-25 02:28:09] [INFO ] Flow matrix only has 160 transitions (discarded 78 similar events)
[2026-05-25 02:28:09] [INFO ] Invariant cache hit.
[2026-05-25 02:28:09] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (OVERLAPS) 160/258 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 37/137 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 236 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/258 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 137 constraints, problems are : Problem set: 0 solved, 236 unsolved in 5359 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 236 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (OVERLAPS) 160/258 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 37/137 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 236/373 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 8 (OVERLAPS) 0/258 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 374 constraints, problems are : Problem set: 0 solved, 236 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 35414ms problems are : Problem set: 0 solved, 236 unsolved
Search for dead transitions found 0 dead transitions in 35415ms
Starting structural reductions in SI_LTL mode, iteration 1 : 98/159 places, 238/416 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 35736 ms. Remains : 98/159 places, 238/416 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b032-LTLFireability-13
Stuttering criterion allowed to conclude after 54 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-b032-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b032-LTLFireability-13 finished in 35840 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 159 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 159/159 places, 416/416 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 148 transition count 374
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 148 transition count 374
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 32 place count 148 transition count 364
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 37 place count 143 transition count 354
Iterating global reduction 1 with 5 rules applied. Total rules applied 42 place count 143 transition count 354
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 47 place count 138 transition count 336
Iterating global reduction 1 with 5 rules applied. Total rules applied 52 place count 138 transition count 336
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 57 place count 133 transition count 316
Iterating global reduction 1 with 5 rules applied. Total rules applied 62 place count 133 transition count 316
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 67 place count 128 transition count 306
Iterating global reduction 1 with 5 rules applied. Total rules applied 72 place count 128 transition count 306
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 77 place count 123 transition count 294
Iterating global reduction 1 with 5 rules applied. Total rules applied 82 place count 123 transition count 294
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 87 place count 118 transition count 282
Iterating global reduction 1 with 5 rules applied. Total rules applied 92 place count 118 transition count 282
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 97 place count 113 transition count 272
Iterating global reduction 1 with 5 rules applied. Total rules applied 102 place count 113 transition count 272
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 107 place count 108 transition count 262
Iterating global reduction 1 with 5 rules applied. Total rules applied 112 place count 108 transition count 262
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 113 place count 107 transition count 260
Iterating global reduction 1 with 1 rules applied. Total rules applied 114 place count 107 transition count 260
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 115 place count 106 transition count 258
Iterating global reduction 1 with 1 rules applied. Total rules applied 116 place count 106 transition count 258
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 117 place count 105 transition count 256
Iterating global reduction 1 with 1 rules applied. Total rules applied 118 place count 105 transition count 256
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 122 place count 105 transition count 252
Applied a total of 122 rules in 31 ms. Remains 105 /159 variables (removed 54) and now considering 252/416 (removed 164) transitions.
[2026-05-25 02:28:44] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8600944217690799671.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9238484770215728154.kers'
[2026-05-25 02:28:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8600944217690799671.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9238484770215728154.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 171 rows 105 cols 474 entries
Finished phase 1 with 102 SingleSign rule and 1 generalized
[2026-05-25 02:28:44] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9238484770215728154.kers
Total runtime 1 ms.
[2026-05-25 02:28:44] [INFO ] Implicit Places using invariants in 70 ms returned []
[2026-05-25 02:28:44] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
[2026-05-25 02:28:44] [INFO ] Invariant cache hit.
[2026-05-25 02:28:44] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-25 02:28:45] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
[2026-05-25 02:28:45] [INFO ] Redundant transitions in 1 ms returned []
Running 250 sub problems to find dead transitions.
[2026-05-25 02:28:45] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
[2026-05-25 02:28:45] [INFO ] Invariant cache hit.
[2026-05-25 02:28:45] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 3 (OVERLAPS) 171/276 variables, 105/107 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 40/147 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 250 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/276 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 250 unsolved
No progress, stopping.
After SMT solving in domain Real declared 276/276 variables, and 147 constraints, problems are : Problem set: 0 solved, 250 unsolved in 5921 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 105/105 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 250 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 3 (OVERLAPS) 171/276 variables, 105/107 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 40/147 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 250/397 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 7 (OVERLAPS) 0/276 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 250 unsolved
No progress, stopping.
After SMT solving in domain Int declared 276/276 variables, and 397 constraints, problems are : Problem set: 0 solved, 250 unsolved in 28390 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 105/105 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34360ms problems are : Problem set: 0 solved, 250 unsolved
Search for dead transitions found 0 dead transitions in 34361ms
Starting structural reductions in SI_LTL mode, iteration 1 : 105/159 places, 252/416 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 34675 ms. Remains : 105/159 places, 252/416 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b032-LTLFireability-15
Stuttering criterion allowed to conclude after 183 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b032-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b032-LTLFireability-15 finished in 34771 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(((X(!p0)&&G(!p1))||G(!p0))))'
Spot run failed in 39 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-25 02:29:19] [INFO ] Flatten gal took : 15 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10857581550923290007
[2026-05-25 02:29:19] [INFO ] Applying decomposition
[2026-05-25 02:29:19] [INFO ] Computing symmetric may disable matrix : 416 transitions.
[2026-05-25 02:29:19] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 02:29:19] [INFO ] Computing symmetric may enable matrix : 416 transitions.
[2026-05-25 02:29:19] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 02:29:19] [INFO ] Flatten gal took : 17 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/graph5651509724610413320.txt' '-o' '/tmp/graph5651509724610413320.bin' '-w' '/tmp/graph5651509724610413320.weights'
[2026-05-25 02:29:19] [INFO ] Computing Do-Not-Accords matrix : 416 transitions.
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5651509724610413320.bin' '-l' '-1' '-v' '-w' '/tmp/graph5651509724610413320.weights' '-q' '0' '-e' '0.001'
[2026-05-25 02:29:19] [INFO ] Decomposing Gal with order
[2026-05-25 02:29:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 02:29:19] [INFO ] Computation of Completed DNA matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 02:29:19] [INFO ] Built C files in 84ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10857581550923290007
Running compilation step : cd /tmp/ltsmin10857581550923290007;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2026-05-25 02:29:19] [INFO ] Removed a total of 730 redundant transitions.
[2026-05-25 02:29:19] [INFO ] Flatten gal took : 44 ms
[2026-05-25 02:29:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 243 labels/synchronizations in 18 ms.
[2026-05-25 02:29:19] [INFO ] Time to serialize gal into /tmp/LTLFireability6710834222279823075.gal : 8 ms
[2026-05-25 02:29:19] [INFO ] Time to serialize properties into /tmp/LTLFireability7290490440322530740.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/LTLFireability6710834222279823075.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7290490440322530740.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(((X(!("((i5.i0.u0.s0>=1)&&(i10.u41.l183>=1))")))&&(G(!("((i5.i0.u0.s0>=1)&&(i10.u39.l178>=1))"))))||(G(!("((i5.i0.u0.s0>=1)&&(i10...176
Formula 0 simplified : G(F"((i5.i0.u0.s0>=1)&&(i10.u41.l183>=1))" & (X"((i5.i0.u0.s0>=1)&&(i10.u41.l183>=1))" | F"((i5.i0.u0.s0>=1)&&(i10.u39.l178>=1))"))
Compilation finished in 867 ms.
Running link step : cd /tmp/ltsmin10857581550923290007;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin10857581550923290007;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '<>(((X(!(LTLAPp0==true))&&[](!(LTLAPp1==true)))||[](!(LTLAPp0==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-25 02:53:05] [INFO ] Flatten gal took : 130 ms
[2026-05-25 02:53:05] [INFO ] Time to serialize gal into /tmp/LTLFireability16446342288177186278.gal : 15 ms
[2026-05-25 02:53:05] [INFO ] Time to serialize properties into /tmp/LTLFireability16883022344853595193.ltl : 5 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/LTLFireability16446342288177186278.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16883022344853595193.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...299
Read 1 LTL properties
Checking formula 0 : !((F(((X(!("((s0>=1)&&(l183>=1))")))&&(G(!("((s0>=1)&&(l178>=1))"))))||(G(!("((s0>=1)&&(l183>=1))"))))))
Formula 0 simplified : G(F"((s0>=1)&&(l183>=1))" & (X"((s0>=1)&&(l183>=1))" | F"((s0>=1)&&(l178>=1))"))
Detected timeout of ITS tools.
[2026-05-25 03:16:53] [INFO ] Flatten gal took : 302 ms
[2026-05-25 03:16:53] [INFO ] Input system was already deterministic with 416 transitions.
[2026-05-25 03:16:54] [INFO ] Transformed 159 places.
[2026-05-25 03:16:54] [INFO ] Transformed 416 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2026-05-25 03:16:54] [INFO ] Time to serialize gal into /tmp/LTLFireability6667049239285431214.gal : 5 ms
[2026-05-25 03:16:54] [INFO ] Time to serialize properties into /tmp/LTLFireability7766687887297226590.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability6667049239285431214.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7766687887297226590.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--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...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(((X(!("((s0>=1)&&(l183>=1))")))&&(G(!("((s0>=1)&&(l178>=1))"))))||(G(!("((s0>=1)&&(l183>=1))"))))))
Formula 0 simplified : G(F"((s0>=1)&&(l183>=1))" & (X"((s0>=1)&&(l183>=1))" | F"((s0>=1)&&(l178>=1))"))

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FunctionPointer-PT-b032"
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 FunctionPointer-PT-b032, 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-177961074000092"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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