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.r082-smll-177946993600220.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 DBSingleClientW-PT-d2m07, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r082-smll-177946993600220
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 6.9K Mar 6 18:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Mar 6 18:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Mar 6 18:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Mar 6 18:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 08:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 08:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 15 08:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 08:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Mar 6 18:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 86K Mar 6 18:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Mar 6 18:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 112K Mar 6 18:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 08:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 08:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 1.6M 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 DBSingleClientW-PT-d2m07-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779609186949

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d2m07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-24 07:53:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-24 07:53:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 07:53:09] [INFO ] Load time of PNML (sax parser for PT used): 492 ms
[2026-05-24 07:53:09] [INFO ] Transformed 4763 places.
[2026-05-24 07:53:09] [INFO ] Transformed 2478 transitions.
[2026-05-24 07:53:09] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 691 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 26 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 3580 places in 23 ms
Reduce places removed 3580 places and 0 transitions.
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 1183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1183/1183 places, 2478/2478 transitions.
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 199 transitions.
Iterating post reduction 0 with 245 rules applied. Total rules applied 245 place count 1137 transition count 2279
Discarding 369 places :
Symmetric choice reduction at 1 with 369 rule applications. Total rules 614 place count 768 transition count 1402
Iterating global reduction 1 with 369 rules applied. Total rules applied 983 place count 768 transition count 1402
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 1039 place count 768 transition count 1346
Discarding 294 places :
Symmetric choice reduction at 2 with 294 rule applications. Total rules 1333 place count 474 transition count 1052
Iterating global reduction 2 with 294 rules applied. Total rules applied 1627 place count 474 transition count 1052
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 1634 place count 474 transition count 1045
Discarding 212 places :
Symmetric choice reduction at 3 with 212 rule applications. Total rules 1846 place count 262 transition count 752
Iterating global reduction 3 with 212 rules applied. Total rules applied 2058 place count 262 transition count 752
Ensure Unique test removed 216 transitions
Reduce isomorphic transitions removed 216 transitions.
Iterating post reduction 3 with 216 rules applied. Total rules applied 2274 place count 262 transition count 536
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 2290 place count 246 transition count 512
Iterating global reduction 4 with 16 rules applied. Total rules applied 2306 place count 246 transition count 512
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 2313 place count 246 transition count 505
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 2323 place count 236 transition count 495
Iterating global reduction 5 with 10 rules applied. Total rules applied 2333 place count 236 transition count 495
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2334 place count 236 transition count 494
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 2343 place count 227 transition count 485
Iterating global reduction 6 with 9 rules applied. Total rules applied 2352 place count 227 transition count 485
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 2362 place count 227 transition count 475
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 2364 place count 225 transition count 471
Iterating global reduction 7 with 2 rules applied. Total rules applied 2366 place count 225 transition count 471
Applied a total of 2366 rules in 286 ms. Remains 225 /1183 variables (removed 958) and now considering 471/2478 (removed 2007) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3645119819113998165.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10497970216135554665.kers'
[2026-05-24 07:53:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3645119819113998165.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10497970216135554665.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 471 rows 225 cols 1358 entries
Finished phase 1 with 221 SingleSign rule and 2 generalized
[2026-05-24 07:53:10] [INFO ] Computed 2 invariants in 2 ms
Computed 2 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-10497970216135554665.kers
Total runtime 4 ms.
[2026-05-24 07:53:10] [INFO ] Implicit Places using invariants in 617 ms returned []
[2026-05-24 07:53:10] [INFO ] Invariant cache hit.
[2026-05-24 07:53:11] [INFO ] State equation strengthened by 248 read => feed constraints.
[2026-05-24 07:53:12] [INFO ] Implicit Places using invariants and state equation in 1835 ms returned []
Implicit Place search using SMT with State Equation took 2499 ms to find 0 implicit places.
Running 470 sub problems to find dead transitions.
[2026-05-24 07:53:12] [INFO ] Invariant cache hit.
[2026-05-24 07:53:12] [INFO ] State equation strengthened by 248 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/224 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 1 (OVERLAPS) 1/225 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/225 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 4 (OVERLAPS) 471/696 variables, 225/227 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/696 variables, 248/475 constraints. Problems are: Problem set: 0 solved, 470 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 696/696 variables, and 475 constraints, problems are : Problem set: 0 solved, 470 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 225/225 constraints, ReadFeed: 248/248 constraints, PredecessorRefiner: 470/470 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 470 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/224 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 1 (OVERLAPS) 1/225 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/225 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 4 (OVERLAPS) 471/696 variables, 225/227 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/696 variables, 248/475 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/696 variables, 470/945 constraints. Problems are: Problem set: 0 solved, 470 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 696/696 variables, and 945 constraints, problems are : Problem set: 0 solved, 470 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 225/225 constraints, ReadFeed: 248/248 constraints, PredecessorRefiner: 470/470 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61304ms problems are : Problem set: 0 solved, 470 unsolved
Search for dead transitions found 0 dead transitions in 61331ms
Starting structural reductions in LTL mode, iteration 1 : 225/1183 places, 471/2478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64164 ms. Remains : 225/1183 places, 471/2478 transitions.
Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 471/471 transitions.
Applied a total of 0 rules in 6 ms. Remains 225 /225 variables (removed 0) and now considering 471/471 (removed 0) transitions.
[2026-05-24 07:54:13] [INFO ] Invariant cache hit.
[2026-05-24 07:54:14] [INFO ] Implicit Places using invariants in 236 ms returned []
[2026-05-24 07:54:14] [INFO ] Invariant cache hit.
[2026-05-24 07:54:14] [INFO ] State equation strengthened by 248 read => feed constraints.
[2026-05-24 07:54:16] [INFO ] Implicit Places using invariants and state equation in 1808 ms returned []
Implicit Place search using SMT with State Equation took 2047 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 2054 ms. Remains : 225/225 places, 471/471 transitions.
Support contains 41 out of 225 places after structural reductions.
[2026-05-24 07:54:16] [INFO ] Flatten gal took : 110 ms
[2026-05-24 07:54:16] [INFO ] Flatten gal took : 79 ms
[2026-05-24 07:54:16] [INFO ] Input system was already deterministic with 471 transitions.
Reduction of identical properties reduced properties to check from 39 to 38
RANDOM walk for 40000 steps (9264 resets) in 4685 ms. (8 steps per ms) remains 36/38 properties
BEST_FIRST walk for 4003 steps (173 resets) in 50 ms. (78 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (193 resets) in 59 ms. (66 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (370 resets) in 86 ms. (46 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (182 resets) in 53 ms. (74 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (170 resets) in 57 ms. (69 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (400 resets) in 48 ms. (81 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (346 resets) in 56 ms. (70 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (190 resets) in 31 ms. (125 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (171 resets) in 18 ms. (210 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (186 resets) in 25 ms. (153 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (203 resets) in 20 ms. (190 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (200 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (362 resets) in 25 ms. (153 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (176 resets) in 19 ms. (200 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (366 resets) in 22 ms. (173 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (186 resets) in 50 ms. (78 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (180 resets) in 29 ms. (133 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (181 resets) in 29 ms. (133 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (171 resets) in 29 ms. (133 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (183 resets) in 40 ms. (97 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (165 resets) in 27 ms. (142 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (175 resets) in 20 ms. (190 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (171 resets) in 32 ms. (121 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (418 resets) in 71 ms. (55 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (179 resets) in 20 ms. (190 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (187 resets) in 32 ms. (121 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (377 resets) in 49 ms. (80 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (358 resets) in 57 ms. (69 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (180 resets) in 32 ms. (121 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (426 resets) in 57 ms. (69 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (344 resets) in 60 ms. (65 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (382 resets) in 54 ms. (72 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (364 resets) in 52 ms. (75 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (170 resets) in 35 ms. (111 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (179 resets) in 38 ms. (102 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (171 resets) in 27 ms. (142 steps per ms) remains 36/36 properties
Interrupted probabilistic random walk after 628149 steps, run timeout after 3001 ms. (steps per millisecond=209 ) properties seen :35 out of 36
Probabilistic random walk after 628149 steps, saw 250323 distinct states, run finished after 3011 ms. (steps per millisecond=208 ) properties seen :35
[2026-05-24 07:54:21] [INFO ] Invariant cache hit.
[2026-05-24 07:54:21] [INFO ] State equation strengthened by 248 read => feed constraints.
Problem AtomicPropp22 is UNSAT
After SMT solving in domain Real declared 2/696 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 24 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/225 constraints, ReadFeed: 0/248 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 101ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 5 stabilizing places and 33 stable transitions
Graph (complete) has 930 edges and 225 vertex of which 224 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.18 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0&&X(p1)))&&X((X(!p1) U (F(p3)&&p2)))))'
Support contains 4 out of 225 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 471/471 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 195 transition count 348
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 195 transition count 348
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 66 place count 195 transition count 342
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 91 place count 170 transition count 313
Iterating global reduction 1 with 25 rules applied. Total rules applied 116 place count 170 transition count 313
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 129 place count 170 transition count 300
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 151 place count 148 transition count 250
Iterating global reduction 2 with 22 rules applied. Total rules applied 173 place count 148 transition count 250
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 186 place count 148 transition count 237
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 196 place count 138 transition count 203
Iterating global reduction 3 with 10 rules applied. Total rules applied 206 place count 138 transition count 203
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 209 place count 138 transition count 200
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 214 place count 133 transition count 195
Iterating global reduction 4 with 5 rules applied. Total rules applied 219 place count 133 transition count 195
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 223 place count 133 transition count 191
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 225 place count 131 transition count 189
Iterating global reduction 5 with 2 rules applied. Total rules applied 227 place count 131 transition count 189
Applied a total of 227 rules in 41 ms. Remains 131 /225 variables (removed 94) and now considering 189/471 (removed 282) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3979953558641707570.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11032073986520891316.kers'
[2026-05-24 07:54:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3979953558641707570.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11032073986520891316.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 189 rows 131 cols 612 entries
Finished phase 1 with 127 SingleSign rule and 2 generalized
[2026-05-24 07:54:22] [INFO ] Computed 2 invariants in 2 ms
Computed 2 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-11032073986520891316.kers
Total runtime 5 ms.
[2026-05-24 07:54:22] [INFO ] Implicit Places using invariants in 216 ms returned []
[2026-05-24 07:54:22] [INFO ] Invariant cache hit.
[2026-05-24 07:54:22] [INFO ] State equation strengthened by 65 read => feed constraints.
[2026-05-24 07:54:23] [INFO ] Implicit Places using invariants and state equation in 647 ms returned []
Implicit Place search using SMT with State Equation took 866 ms to find 0 implicit places.
Running 188 sub problems to find dead transitions.
[2026-05-24 07:54:23] [INFO ] Invariant cache hit.
[2026-05-24 07:54:23] [INFO ] State equation strengthened by 65 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (OVERLAPS) 189/320 variables, 131/133 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/320 variables, 65/198 constraints. Problems are: Problem set: 0 solved, 188 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 7 (OVERLAPS) 0/320 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 188 unsolved
No progress, stopping.
After SMT solving in domain Real declared 320/320 variables, and 198 constraints, problems are : Problem set: 0 solved, 188 unsolved in 16577 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 131/131 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 188 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (OVERLAPS) 189/320 variables, 131/133 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/320 variables, 65/198 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 188/386 constraints. Problems are: Problem set: 0 solved, 188 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 320/320 variables, and 386 constraints, problems are : Problem set: 0 solved, 188 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 131/131 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46776ms problems are : Problem set: 0 solved, 188 unsolved
Search for dead transitions found 0 dead transitions in 46777ms
Starting structural reductions in LTL mode, iteration 1 : 131/225 places, 189/471 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47687 ms. Remains : 131/225 places, 189/471 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0&&X(p1)))&&X((X(!p1) U (F(p3)&&p2)))))'
Stuttering acceptance computed with spot in 543 ms :[(OR (NOT p1) (NOT p0) (NOT p2) (NOT p3)), (OR (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p3)), (NOT p1), p1, (NOT p3), true]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-00
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 4 ms.
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-00 finished in 48404 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((((X((p0 U p1)) U p2) U p1)&&G(p2)) U X(p3)))'
Support contains 6 out of 225 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 471/471 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 195 transition count 353
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 195 transition count 353
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 67 place count 195 transition count 346
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 91 place count 171 transition count 318
Iterating global reduction 1 with 24 rules applied. Total rules applied 115 place count 171 transition count 318
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 125 place count 171 transition count 308
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 144 place count 152 transition count 271
Iterating global reduction 2 with 19 rules applied. Total rules applied 163 place count 152 transition count 271
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 177 place count 152 transition count 257
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 185 place count 144 transition count 235
Iterating global reduction 3 with 8 rules applied. Total rules applied 193 place count 144 transition count 235
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 196 place count 144 transition count 232
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 200 place count 140 transition count 228
Iterating global reduction 4 with 4 rules applied. Total rules applied 204 place count 140 transition count 228
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 208 place count 140 transition count 224
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 209 place count 139 transition count 223
Iterating global reduction 5 with 1 rules applied. Total rules applied 210 place count 139 transition count 223
Applied a total of 210 rules in 90 ms. Remains 139 /225 variables (removed 86) and now considering 223/471 (removed 248) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6434130369399755206.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9794809854357394620.kers'
[2026-05-24 07:55:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6434130369399755206.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9794809854357394620.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 223 rows 139 cols 691 entries
Finished phase 1 with 135 SingleSign rule and 2 generalized
[2026-05-24 07:55:10] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 17 ms.
Exported basis to /tmp/petrispot-output-9794809854357394620.kers
Total runtime 17 ms.
[2026-05-24 07:55:11] [INFO ] Implicit Places using invariants in 313 ms returned []
[2026-05-24 07:55:11] [INFO ] Invariant cache hit.
[2026-05-24 07:55:11] [INFO ] State equation strengthened by 92 read => feed constraints.
[2026-05-24 07:55:12] [INFO ] Implicit Places using invariants and state equation in 843 ms returned []
Implicit Place search using SMT with State Equation took 1168 ms to find 0 implicit places.
Running 222 sub problems to find dead transitions.
[2026-05-24 07:55:12] [INFO ] Invariant cache hit.
[2026-05-24 07:55:12] [INFO ] State equation strengthened by 92 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (OVERLAPS) 1/139 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (OVERLAPS) 223/362 variables, 139/141 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/362 variables, 92/233 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/362 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 7 (OVERLAPS) 0/362 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 222 unsolved
No progress, stopping.
After SMT solving in domain Real declared 362/362 variables, and 233 constraints, problems are : Problem set: 0 solved, 222 unsolved in 17606 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 139/139 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (OVERLAPS) 1/139 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (OVERLAPS) 223/362 variables, 139/141 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/362 variables, 92/233 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/362 variables, 222/455 constraints. Problems are: Problem set: 0 solved, 222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 362/362 variables, and 455 constraints, problems are : Problem set: 0 solved, 222 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 139/139 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47771ms problems are : Problem set: 0 solved, 222 unsolved
Search for dead transitions found 0 dead transitions in 47773ms
Starting structural reductions in LTL mode, iteration 1 : 139/225 places, 223/471 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49036 ms. Remains : 139/225 places, 223/471 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((((X((p0 U p1)) U p2) U p1)&&G(p2)) U X(p3)))'
Stuttering acceptance computed with spot in 327 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p1) (NOT p3)), true, (NOT p2), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-01 finished in 49412 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||F(p1)))))'
Support contains 4 out of 225 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 471/471 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 193 transition count 345
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 193 transition count 345
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 71 place count 193 transition count 338
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 97 place count 167 transition count 309
Iterating global reduction 1 with 26 rules applied. Total rules applied 123 place count 167 transition count 309
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 136 place count 167 transition count 296
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 158 place count 145 transition count 252
Iterating global reduction 2 with 22 rules applied. Total rules applied 180 place count 145 transition count 252
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 194 place count 145 transition count 238
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 204 place count 135 transition count 204
Iterating global reduction 3 with 10 rules applied. Total rules applied 214 place count 135 transition count 204
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 217 place count 135 transition count 201
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 222 place count 130 transition count 196
Iterating global reduction 4 with 5 rules applied. Total rules applied 227 place count 130 transition count 196
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 231 place count 130 transition count 192
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 233 place count 128 transition count 190
Iterating global reduction 5 with 2 rules applied. Total rules applied 235 place count 128 transition count 190
Applied a total of 235 rules in 29 ms. Remains 128 /225 variables (removed 97) and now considering 190/471 (removed 281) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14760118731734900052.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11656120501679593941.kers'
[2026-05-24 07:56:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14760118731734900052.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11656120501679593941.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 190 rows 128 cols 610 entries
Finished phase 1 with 124 SingleSign rule and 2 generalized
[2026-05-24 07:56:00] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11656120501679593941.kers
Total runtime 1 ms.
[2026-05-24 07:56:00] [INFO ] Implicit Places using invariants in 155 ms returned []
[2026-05-24 07:56:00] [INFO ] Invariant cache hit.
[2026-05-24 07:56:00] [INFO ] State equation strengthened by 68 read => feed constraints.
[2026-05-24 07:56:01] [INFO ] Implicit Places using invariants and state equation in 1135 ms returned []
Implicit Place search using SMT with State Equation took 1293 ms to find 0 implicit places.
Running 189 sub problems to find dead transitions.
[2026-05-24 07:56:01] [INFO ] Invariant cache hit.
[2026-05-24 07:56:01] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (OVERLAPS) 190/318 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/318 variables, 68/198 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/318 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 7 (OVERLAPS) 0/318 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Real declared 318/318 variables, and 198 constraints, problems are : Problem set: 0 solved, 189 unsolved in 16597 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 189 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (OVERLAPS) 190/318 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/318 variables, 68/198 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/318 variables, 189/387 constraints. Problems are: Problem set: 0 solved, 189 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 318/318 variables, and 387 constraints, problems are : Problem set: 0 solved, 189 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46810ms problems are : Problem set: 0 solved, 189 unsolved
Search for dead transitions found 0 dead transitions in 46811ms
Starting structural reductions in LTL mode, iteration 1 : 128/225 places, 190/471 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48136 ms. Remains : 128/225 places, 190/471 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(p0)||p1))))'
Stuttering acceptance computed with spot in 208 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-02
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-02 finished in 48385 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 4 out of 225 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 225/225 places, 471/471 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 195 transition count 359
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 195 transition count 359
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 67 place count 195 transition count 352
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 91 place count 171 transition count 324
Iterating global reduction 1 with 24 rules applied. Total rules applied 115 place count 171 transition count 324
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 128 place count 171 transition count 311
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 148 place count 151 transition count 262
Iterating global reduction 2 with 20 rules applied. Total rules applied 168 place count 151 transition count 262
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 181 place count 151 transition count 249
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 189 place count 143 transition count 222
Iterating global reduction 3 with 8 rules applied. Total rules applied 197 place count 143 transition count 222
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 199 place count 143 transition count 220
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 203 place count 139 transition count 216
Iterating global reduction 4 with 4 rules applied. Total rules applied 207 place count 139 transition count 216
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 211 place count 139 transition count 212
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 212 place count 138 transition count 211
Iterating global reduction 5 with 1 rules applied. Total rules applied 213 place count 138 transition count 211
Applied a total of 213 rules in 91 ms. Remains 138 /225 variables (removed 87) and now considering 211/471 (removed 260) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2152387406138286821.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17752334012993242348.kers'
[2026-05-24 07:56:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2152387406138286821.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17752334012993242348.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 211 rows 138 cols 668 entries
Finished phase 1 with 134 SingleSign rule and 2 generalized
[2026-05-24 07:56:48] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-17752334012993242348.kers
Total runtime 2 ms.
[2026-05-24 07:56:48] [INFO ] Implicit Places using invariants in 232 ms returned []
[2026-05-24 07:56:48] [INFO ] Invariant cache hit.
[2026-05-24 07:56:49] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-05-24 07:56:49] [INFO ] Implicit Places using invariants and state equation in 881 ms returned []
Implicit Place search using SMT with State Equation took 1115 ms to find 0 implicit places.
[2026-05-24 07:56:49] [INFO ] Redundant transitions in 10 ms returned []
Running 210 sub problems to find dead transitions.
[2026-05-24 07:56:49] [INFO ] Invariant cache hit.
[2026-05-24 07:56:49] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (OVERLAPS) 1/138 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (OVERLAPS) 211/349 variables, 138/140 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/349 variables, 80/220 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 5/225 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/349 variables, 4/229 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/349 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/349 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 210 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 349/349 variables, and 231 constraints, problems are : Problem set: 0 solved, 210 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 138/138 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 210 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (OVERLAPS) 1/138 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (OVERLAPS) 211/349 variables, 138/151 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 80/231 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/349 variables, 210/441 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/349 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 210 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 349/349 variables, and 441 constraints, problems are : Problem set: 0 solved, 210 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 138/138 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60151ms problems are : Problem set: 0 solved, 210 unsolved
Search for dead transitions found 0 dead transitions in 60152ms
Starting structural reductions in SI_LTL mode, iteration 1 : 138/225 places, 211/471 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61376 ms. Remains : 138/225 places, 211/471 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-03
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-03 finished in 61492 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(!(X((X(p0) U p1))&&(!p0 U G(p2)))) U p3))'
Support contains 6 out of 225 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 471/471 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 196 transition count 362
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 196 transition count 362
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 66 place count 196 transition count 354
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 90 place count 172 transition count 327
Iterating global reduction 1 with 24 rules applied. Total rules applied 114 place count 172 transition count 327
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 127 place count 172 transition count 314
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 147 place count 152 transition count 276
Iterating global reduction 2 with 20 rules applied. Total rules applied 167 place count 152 transition count 276
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 180 place count 152 transition count 263
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 191 place count 141 transition count 222
Iterating global reduction 3 with 11 rules applied. Total rules applied 202 place count 141 transition count 222
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 205 place count 141 transition count 219
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 210 place count 136 transition count 214
Iterating global reduction 4 with 5 rules applied. Total rules applied 215 place count 136 transition count 214
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 219 place count 136 transition count 210
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 221 place count 134 transition count 208
Iterating global reduction 5 with 2 rules applied. Total rules applied 223 place count 134 transition count 208
Applied a total of 223 rules in 32 ms. Remains 134 /225 variables (removed 91) and now considering 208/471 (removed 263) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14752651740306835799.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5437413167025270528.kers'
[2026-05-24 07:57:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14752651740306835799.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5437413167025270528.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 208 rows 134 cols 665 entries
Finished phase 1 with 130 SingleSign rule and 2 generalized
[2026-05-24 07:57:50] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5437413167025270528.kers
Total runtime 1 ms.
[2026-05-24 07:57:50] [INFO ] Implicit Places using invariants in 197 ms returned []
[2026-05-24 07:57:50] [INFO ] Invariant cache hit.
[2026-05-24 07:57:50] [INFO ] State equation strengthened by 76 read => feed constraints.
[2026-05-24 07:57:51] [INFO ] Implicit Places using invariants and state equation in 710 ms returned []
Implicit Place search using SMT with State Equation took 914 ms to find 0 implicit places.
Running 207 sub problems to find dead transitions.
[2026-05-24 07:57:51] [INFO ] Invariant cache hit.
[2026-05-24 07:57:51] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 4 (OVERLAPS) 208/342 variables, 134/136 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 76/212 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 4/216 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 8 (OVERLAPS) 0/342 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 207 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 342/342 variables, and 217 constraints, problems are : Problem set: 0 solved, 207 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 134/134 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 207 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 5 (OVERLAPS) 208/342 variables, 134/141 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 76/217 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 207/424 constraints. Problems are: Problem set: 0 solved, 207 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 342/342 variables, and 424 constraints, problems are : Problem set: 0 solved, 207 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 134/134 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60150ms problems are : Problem set: 0 solved, 207 unsolved
Search for dead transitions found 0 dead transitions in 60152ms
Starting structural reductions in LTL mode, iteration 1 : 134/225 places, 208/471 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61100 ms. Remains : 134/225 places, 208/471 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(!(X((X(p0) U p1))&&(!p0 U G(p2)))) U p3))'
Stuttering acceptance computed with spot in 311 ms :[(NOT p3), (AND p1 p2), (AND p1 p2), (AND p1 p2), p2, (AND (NOT p1) p2), (AND p2 p0 p1)]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-05
Stuttering criterion allowed to conclude after 25 steps with 7 reset in 1 ms.
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-05 finished in 61475 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(((G(p1) U p2) U G(p3)))))'
Support contains 6 out of 225 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 471/471 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 197 transition count 375
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 197 transition count 375
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 65 place count 197 transition count 366
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 89 place count 173 transition count 338
Iterating global reduction 1 with 24 rules applied. Total rules applied 113 place count 173 transition count 338
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 128 place count 173 transition count 323
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 148 place count 153 transition count 277
Iterating global reduction 2 with 20 rules applied. Total rules applied 168 place count 153 transition count 277
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 184 place count 153 transition count 261
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 192 place count 145 transition count 229
Iterating global reduction 3 with 8 rules applied. Total rules applied 200 place count 145 transition count 229
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 209 place count 145 transition count 220
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 212 place count 142 transition count 217
Iterating global reduction 4 with 3 rules applied. Total rules applied 215 place count 142 transition count 217
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 216 place count 142 transition count 216
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 218 place count 140 transition count 214
Iterating global reduction 5 with 2 rules applied. Total rules applied 220 place count 140 transition count 214
Applied a total of 220 rules in 18 ms. Remains 140 /225 variables (removed 85) and now considering 214/471 (removed 257) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3427214856167150603.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1913433610990441930.kers'
[2026-05-24 07:58:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3427214856167150603.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1913433610990441930.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 214 rows 140 cols 682 entries
Finished phase 1 with 136 SingleSign rule and 2 generalized
[2026-05-24 07:58:51] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1913433610990441930.kers
Total runtime 2 ms.
[2026-05-24 07:58:51] [INFO ] Implicit Places using invariants in 196 ms returned []
[2026-05-24 07:58:51] [INFO ] Invariant cache hit.
[2026-05-24 07:58:51] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-05-24 07:58:52] [INFO ] Implicit Places using invariants and state equation in 681 ms returned []
Implicit Place search using SMT with State Equation took 879 ms to find 0 implicit places.
Running 213 sub problems to find dead transitions.
[2026-05-24 07:58:52] [INFO ] Invariant cache hit.
[2026-05-24 07:58:52] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (OVERLAPS) 1/140 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (OVERLAPS) 214/354 variables, 140/142 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 80/222 constraints. Problems are: Problem set: 0 solved, 213 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (OVERLAPS) 0/354 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 354/354 variables, and 222 constraints, problems are : Problem set: 0 solved, 213 unsolved in 15164 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 140/140 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (OVERLAPS) 1/140 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (OVERLAPS) 214/354 variables, 140/142 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 80/222 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 213/435 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 354/354 variables, and 435 constraints, problems are : Problem set: 0 solved, 213 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 140/140 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45304ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 45304ms
Starting structural reductions in LTL mode, iteration 1 : 140/225 places, 214/471 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46203 ms. Remains : 140/225 places, 214/471 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(((G(p1) U p2) U G(p3)))))'
Stuttering acceptance computed with spot in 560 ms :[(NOT p3), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p3), true, (NOT p1), (NOT p2), (NOT p3), (AND (NOT p1) (NOT p3) p2), (OR (AND (NOT p0) p2) (AND (NOT p0) p3) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p1) p2)), (AND p1 (NOT p2) p3 (NOT p0)), (OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) p1 (NOT p3))), (AND (NOT p1) (NOT p3) p2 (NOT p0))]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-06 finished in 46830 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(G(p1))&&p0) U p2)))'
Support contains 4 out of 225 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 471/471 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 195 transition count 359
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 195 transition count 359
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 66 place count 195 transition count 353
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 91 place count 170 transition count 324
Iterating global reduction 1 with 25 rules applied. Total rules applied 116 place count 170 transition count 324
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 128 place count 170 transition count 312
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 148 place count 150 transition count 267
Iterating global reduction 2 with 20 rules applied. Total rules applied 168 place count 150 transition count 267
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 182 place count 150 transition count 253
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 191 place count 141 transition count 216
Iterating global reduction 3 with 9 rules applied. Total rules applied 200 place count 141 transition count 216
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 201 place count 141 transition count 215
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 206 place count 136 transition count 210
Iterating global reduction 4 with 5 rules applied. Total rules applied 211 place count 136 transition count 210
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 215 place count 136 transition count 206
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 217 place count 134 transition count 204
Iterating global reduction 5 with 2 rules applied. Total rules applied 219 place count 134 transition count 204
Applied a total of 219 rules in 15 ms. Remains 134 /225 variables (removed 91) and now considering 204/471 (removed 267) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10971329191124754313.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-963803689870982085.kers'
[2026-05-24 07:59:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10971329191124754313.kers, --Pflows, --basisKERS=/tmp/petrispot-output-963803689870982085.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 204 rows 134 cols 643 entries
Finished phase 1 with 130 SingleSign rule and 2 generalized
[2026-05-24 07:59:38] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-963803689870982085.kers
Total runtime 2 ms.
[2026-05-24 07:59:38] [INFO ] Implicit Places using invariants in 169 ms returned []
[2026-05-24 07:59:38] [INFO ] Invariant cache hit.
[2026-05-24 07:59:38] [INFO ] State equation strengthened by 78 read => feed constraints.
[2026-05-24 07:59:39] [INFO ] Implicit Places using invariants and state equation in 722 ms returned []
Implicit Place search using SMT with State Equation took 894 ms to find 0 implicit places.
Running 203 sub problems to find dead transitions.
[2026-05-24 07:59:39] [INFO ] Invariant cache hit.
[2026-05-24 07:59:39] [INFO ] State equation strengthened by 78 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 204/338 variables, 134/136 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/338 variables, 78/214 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/338 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (OVERLAPS) 0/338 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 338/338 variables, and 214 constraints, problems are : Problem set: 0 solved, 203 unsolved in 15087 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 134/134 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 204/338 variables, 134/136 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/338 variables, 78/214 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/338 variables, 203/417 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/338 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 203 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 338/338 variables, and 417 constraints, problems are : Problem set: 0 solved, 203 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 134/134 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45204ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 45205ms
Starting structural reductions in LTL mode, iteration 1 : 134/225 places, 204/471 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46116 ms. Remains : 134/225 places, 204/471 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(G(p1))&&p0) U p2)))'
Stuttering acceptance computed with spot in 167 ms :[(NOT p2), (NOT p2), true, (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-07 finished in 46321 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(!p0) U p1)))'
Support contains 3 out of 225 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 471/471 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 194 transition count 346
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 194 transition count 346
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 69 place count 194 transition count 339
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 94 place count 169 transition count 311
Iterating global reduction 1 with 25 rules applied. Total rules applied 119 place count 169 transition count 311
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 129 place count 169 transition count 301
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 150 place count 148 transition count 262
Iterating global reduction 2 with 21 rules applied. Total rules applied 171 place count 148 transition count 262
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 185 place count 148 transition count 248
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 194 place count 139 transition count 222
Iterating global reduction 3 with 9 rules applied. Total rules applied 203 place count 139 transition count 222
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 206 place count 139 transition count 219
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 211 place count 134 transition count 214
Iterating global reduction 4 with 5 rules applied. Total rules applied 216 place count 134 transition count 214
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 220 place count 134 transition count 210
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 222 place count 132 transition count 208
Iterating global reduction 5 with 2 rules applied. Total rules applied 224 place count 132 transition count 208
Applied a total of 224 rules in 22 ms. Remains 132 /225 variables (removed 93) and now considering 208/471 (removed 263) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8146233809718160222.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7065082570018045418.kers'
[2026-05-24 08:00:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8146233809718160222.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7065082570018045418.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 208 rows 132 cols 648 entries
Finished phase 1 with 128 SingleSign rule and 2 generalized
[2026-05-24 08:00:24] [INFO ] Computed 2 invariants in 2 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7065082570018045418.kers
Total runtime 4 ms.
[2026-05-24 08:00:24] [INFO ] Implicit Places using invariants in 238 ms returned []
[2026-05-24 08:00:24] [INFO ] Invariant cache hit.
[2026-05-24 08:00:25] [INFO ] State equation strengthened by 84 read => feed constraints.
[2026-05-24 08:00:25] [INFO ] Implicit Places using invariants and state equation in 839 ms returned []
Implicit Place search using SMT with State Equation took 1080 ms to find 0 implicit places.
Running 207 sub problems to find dead transitions.
[2026-05-24 08:00:25] [INFO ] Invariant cache hit.
[2026-05-24 08:00:25] [INFO ] State equation strengthened by 84 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 4 (OVERLAPS) 208/340 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/340 variables, 84/218 constraints. Problems are: Problem set: 0 solved, 207 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/340 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 7 (OVERLAPS) 0/340 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 207 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 218 constraints, problems are : Problem set: 0 solved, 207 unsolved in 18740 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 207 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 4 (OVERLAPS) 208/340 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/340 variables, 84/218 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/340 variables, 207/425 constraints. Problems are: Problem set: 0 solved, 207 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 340/340 variables, and 425 constraints, problems are : Problem set: 0 solved, 207 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48908ms problems are : Problem set: 0 solved, 207 unsolved
Search for dead transitions found 0 dead transitions in 48909ms
Starting structural reductions in LTL mode, iteration 1 : 132/225 places, 208/471 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50012 ms. Remains : 132/225 places, 208/471 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(!p0) U p1)))'
Stuttering acceptance computed with spot in 124 ms :[(NOT p1), (NOT p1), true, p0]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-09
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 5 ms.
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-09 finished in 50176 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(X(!p0))) U ((X(X(X(!p0)))&&G(!p1))||X(X(X(G(!p0))))))))'
Support contains 3 out of 225 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 471/471 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 193 transition count 346
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 193 transition count 346
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 70 place count 193 transition count 340
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 97 place count 166 transition count 309
Iterating global reduction 1 with 27 rules applied. Total rules applied 124 place count 166 transition count 309
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 138 place count 166 transition count 295
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 160 place count 144 transition count 251
Iterating global reduction 2 with 22 rules applied. Total rules applied 182 place count 144 transition count 251
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 196 place count 144 transition count 237
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 206 place count 134 transition count 203
Iterating global reduction 3 with 10 rules applied. Total rules applied 216 place count 134 transition count 203
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 219 place count 134 transition count 200
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 224 place count 129 transition count 195
Iterating global reduction 4 with 5 rules applied. Total rules applied 229 place count 129 transition count 195
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 233 place count 129 transition count 191
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 235 place count 127 transition count 189
Iterating global reduction 5 with 2 rules applied. Total rules applied 237 place count 127 transition count 189
Applied a total of 237 rules in 13 ms. Remains 127 /225 variables (removed 98) and now considering 189/471 (removed 282) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12401583984236405589.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15330387703963768357.kers'
[2026-05-24 08:01:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12401583984236405589.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15330387703963768357.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 189 rows 127 cols 606 entries
Finished phase 1 with 123 SingleSign rule and 2 generalized
[2026-05-24 08:01:14] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15330387703963768357.kers
Total runtime 2 ms.
[2026-05-24 08:01:14] [INFO ] Implicit Places using invariants in 122 ms returned []
[2026-05-24 08:01:14] [INFO ] Invariant cache hit.
[2026-05-24 08:01:15] [INFO ] State equation strengthened by 68 read => feed constraints.
[2026-05-24 08:01:15] [INFO ] Implicit Places using invariants and state equation in 498 ms returned []
Implicit Place search using SMT with State Equation took 623 ms to find 0 implicit places.
Running 188 sub problems to find dead transitions.
[2026-05-24 08:01:15] [INFO ] Invariant cache hit.
[2026-05-24 08:01:15] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (OVERLAPS) 189/316 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 68/197 constraints. Problems are: Problem set: 0 solved, 188 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 7 (OVERLAPS) 0/316 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 188 unsolved
No progress, stopping.
After SMT solving in domain Real declared 316/316 variables, and 197 constraints, problems are : Problem set: 0 solved, 188 unsolved in 11780 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 188 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (OVERLAPS) 189/316 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 68/197 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 188/385 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 188 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 316/316 variables, and 385 constraints, problems are : Problem set: 0 solved, 188 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41899ms problems are : Problem set: 0 solved, 188 unsolved
Search for dead transitions found 0 dead transitions in 41900ms
Starting structural reductions in LTL mode, iteration 1 : 127/225 places, 189/471 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42537 ms. Remains : 127/225 places, 189/471 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(X(!p0))) U (X(X(X(G(!p0))))||(X(X(X(!p0)))&&G(!p1))))))'
Stuttering acceptance computed with spot in 369 ms :[p0, p0, (AND p0 p1), p0, (AND p1 p0), p0, (AND p0 p1), p0, (AND p1 p0), true, (AND p1 (NOT p0))]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-10
Product exploration explored 100000 steps with 25522 reset in 400 ms.
Product exploration explored 100000 steps with 25499 reset in 396 ms.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 465 edges and 127 vertex of which 126 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge based reduction with 13 factoid took 139 ms. Reduced automaton from 11 states, 24 edges and 2 AP (stutter sensitive) to 11 states, 24 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (9176 resets) in 601 ms. (66 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1809 resets) in 251 ms. (158 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1823 resets) in 124 ms. (320 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1788 resets) in 110 ms. (360 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1799 resets) in 125 ms. (317 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1793 resets) in 132 ms. (300 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1780 resets) in 104 ms. (380 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 1380260 steps, run timeout after 3001 ms. (steps per millisecond=459 ) properties seen :5 out of 6
Probabilistic random walk after 1380260 steps, saw 577466 distinct states, run finished after 3001 ms. (steps per millisecond=459 ) properties seen :5
[2026-05-24 08:02:02] [INFO ] Invariant cache hit.
[2026-05-24 08:02:02] [INFO ] State equation strengthened by 68 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) 51/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 31/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 137/222 variables, 85/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 16/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Real declared 310/316 variables, and 142 constraints, problems are : Problem set: 1 solved, 0 unsolved in 191 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 124/127 constraints, ReadFeed: 16/68 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 200ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge based reduction with 14 factoid took 208 ms. Reduced automaton from 11 states, 24 edges and 2 AP (stutter sensitive) to 11 states, 21 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 446 ms :[p0, p0, (AND p0 p1), p0, (AND p1 p0), p0, (AND p0 p1), p0, (AND p0 p1), true, p1]
Knowledge-based reduction took 4410 ms.
Stuttering acceptance computed with spot in 415 ms :[p0, p0, (AND p0 p1), p0, (AND p1 p0), p0, (AND p0 p1), p0, (AND p0 p1), true, p1]
Support contains 3 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 189/189 transitions.
Applied a total of 0 rules in 2 ms. Remains 127 /127 variables (removed 0) and now considering 189/189 (removed 0) transitions.
[2026-05-24 08:02:03] [INFO ] Invariant cache hit.
[2026-05-24 08:02:03] [INFO ] Implicit Places using invariants in 182 ms returned []
[2026-05-24 08:02:03] [INFO ] Invariant cache hit.
[2026-05-24 08:02:03] [INFO ] State equation strengthened by 68 read => feed constraints.
[2026-05-24 08:02:04] [INFO ] Implicit Places using invariants and state equation in 535 ms returned []
Implicit Place search using SMT with State Equation took 719 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 722 ms. Remains : 127/127 places, 189/189 transitions.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 465 edges and 127 vertex of which 126 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge based reduction with 7 factoid took 100 ms. Reduced automaton from 11 states, 21 edges and 2 AP (stutter sensitive) to 11 states, 21 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (9230 resets) in 384 ms. (103 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1806 resets) in 126 ms. (314 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1864 resets) in 125 ms. (317 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1854 resets) in 138 ms. (287 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 23362 steps, run visited all 3 properties in 191 ms. (steps per millisecond=122 )
Probabilistic random walk after 23362 steps, saw 11463 distinct states, run finished after 201 ms. (steps per millisecond=116 ) properties seen :3
Knowledge based reduction with 7 factoid took 132 ms. Reduced automaton from 11 states, 21 edges and 2 AP (stutter sensitive) to 11 states, 21 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 364 ms :[p0, p0, (AND p0 p1), p0, (AND p1 p0), p0, (AND p0 p1), p0, (AND p0 p1), true, p1]
Knowledge-based reduction took 1124 ms.
Stuttering acceptance computed with spot in 394 ms :[p0, p0, (AND p0 p1), p0, (AND p1 p0), p0, (AND p0 p1), p0, (AND p0 p1), true, p1]
Stuttering acceptance computed with spot in 421 ms :[p0, p0, (AND p0 p1), p0, (AND p1 p0), p0, (AND p0 p1), p0, (AND p0 p1), true, p1]
Product exploration explored 100000 steps with 25484 reset in 246 ms.
Product exploration explored 100000 steps with 25408 reset in 262 ms.
Spot run failed in 111 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/ltsmin5354828609211545904
[2026-05-24 08:02:06] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5354828609211545904
Running compilation step : cd /tmp/ltsmin5354828609211545904;'/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 758 ms.
Running link step : cd /tmp/ltsmin5354828609211545904;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 76 ms.
Running LTSmin : cd /tmp/ltsmin5354828609211545904;'/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/stateBased10685940793867861036.hoa' '--buchi-type=spotba'
LTSmin run took 271 ms.
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-10 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-10 finished in 53072 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(F((!p0||(!p0 U (p1||G(!p0))))))||(F((!p0||(!p0 U (p1||G(!p0)))))&&X((!p2||F(G(!p3))))))))'
Support contains 7 out of 225 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 471/471 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 194 transition count 354
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 194 transition count 354
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 70 place count 194 transition count 346
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 94 place count 170 transition count 319
Iterating global reduction 1 with 24 rules applied. Total rules applied 118 place count 170 transition count 319
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 131 place count 170 transition count 306
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 150 place count 151 transition count 261
Iterating global reduction 2 with 19 rules applied. Total rules applied 169 place count 151 transition count 261
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 181 place count 151 transition count 249
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 190 place count 142 transition count 211
Iterating global reduction 3 with 9 rules applied. Total rules applied 199 place count 142 transition count 211
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 203 place count 142 transition count 207
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 207 place count 138 transition count 203
Iterating global reduction 4 with 4 rules applied. Total rules applied 211 place count 138 transition count 203
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 214 place count 138 transition count 200
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 216 place count 136 transition count 198
Iterating global reduction 5 with 2 rules applied. Total rules applied 218 place count 136 transition count 198
Applied a total of 218 rules in 13 ms. Remains 136 /225 variables (removed 89) and now considering 198/471 (removed 273) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5842744291979732514.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11465819416183732393.kers'
[2026-05-24 08:02:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5842744291979732514.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11465819416183732393.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 198 rows 136 cols 646 entries
Finished phase 1 with 132 SingleSign rule and 2 generalized
[2026-05-24 08:02:07] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11465819416183732393.kers
Total runtime 3 ms.
[2026-05-24 08:02:08] [INFO ] Implicit Places using invariants in 181 ms returned []
[2026-05-24 08:02:08] [INFO ] Invariant cache hit.
[2026-05-24 08:02:08] [INFO ] State equation strengthened by 66 read => feed constraints.
[2026-05-24 08:02:08] [INFO ] Implicit Places using invariants and state equation in 609 ms returned []
Implicit Place search using SMT with State Equation took 792 ms to find 0 implicit places.
Running 197 sub problems to find dead transitions.
[2026-05-24 08:02:08] [INFO ] Invariant cache hit.
[2026-05-24 08:02:08] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (OVERLAPS) 198/334 variables, 136/138 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/334 variables, 66/204 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/334 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 7 (OVERLAPS) 0/334 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/334 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 197 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 334/334 variables, and 209 constraints, problems are : Problem set: 0 solved, 197 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 136/136 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 197 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (OVERLAPS) 1/136 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 6 (OVERLAPS) 198/334 variables, 136/143 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/334 variables, 66/209 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/334 variables, 197/406 constraints. Problems are: Problem set: 0 solved, 197 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 334/334 variables, and 406 constraints, problems are : Problem set: 0 solved, 197 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 136/136 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60159ms problems are : Problem set: 0 solved, 197 unsolved
Search for dead transitions found 0 dead transitions in 60160ms
Starting structural reductions in LTL mode, iteration 1 : 136/225 places, 198/471 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60970 ms. Remains : 136/225 places, 198/471 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(F(((!p1 U (p2||G(!p1)))||p0)))||(F(((!p1 U (p2||G(!p1)))||p3))&&X((F(G(p5))||p4))))))'
Stuttering acceptance computed with spot in 329 ms :[(OR (AND (NOT p0) p1 (NOT p2) (NOT p4) (NOT p5)) (AND (NOT p0) p1 (NOT p2) (NOT p3))), (AND (NOT p0) p1 (NOT p2) (NOT p4) (NOT p5)), (AND (NOT p0) (NOT p2) (NOT p3) p1), (AND (NOT p0) (NOT p2) (NOT p3) p1), (AND (NOT p0) p1 (NOT p2) (NOT p4) (NOT p5)), (AND (NOT p0) (NOT p2) (NOT p3) p1 (NOT p5)), (AND (NOT p0) (NOT p2) (NOT p3) p1 (NOT p5))]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-11
Product exploration explored 100000 steps with 50000 reset in 376 ms.
Product exploration explored 100000 steps with 50000 reset in 561 ms.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 496 edges and 136 vertex of which 135 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge based reduction with 39 factoid took 177 ms. Proved property starting from automaton with 7 states, 23 edges and 6 AP (stutter sensitive
Knowledge-based reduction took 192 ms.
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-11 finished in 62516 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X((X((!p0 U (p2||G(!p0))))||p1)))))'
Support contains 5 out of 225 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 471/471 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 195 transition count 355
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 195 transition count 355
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 66 place count 195 transition count 349
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 90 place count 171 transition count 323
Iterating global reduction 1 with 24 rules applied. Total rules applied 114 place count 171 transition count 323
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 128 place count 171 transition count 309
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 148 place count 151 transition count 263
Iterating global reduction 2 with 20 rules applied. Total rules applied 168 place count 151 transition count 263
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 179 place count 151 transition count 252
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 189 place count 141 transition count 212
Iterating global reduction 3 with 10 rules applied. Total rules applied 199 place count 141 transition count 212
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 205 place count 141 transition count 206
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 209 place count 137 transition count 202
Iterating global reduction 4 with 4 rules applied. Total rules applied 213 place count 137 transition count 202
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 215 place count 137 transition count 200
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 217 place count 135 transition count 198
Iterating global reduction 5 with 2 rules applied. Total rules applied 219 place count 135 transition count 198
Applied a total of 219 rules in 29 ms. Remains 135 /225 variables (removed 90) and now considering 198/471 (removed 273) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10366905610751956297.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9465373431732295633.kers'
[2026-05-24 08:03:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10366905610751956297.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9465373431732295633.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 198 rows 135 cols 648 entries
Finished phase 1 with 131 SingleSign rule and 2 generalized
[2026-05-24 08:03:10] [INFO ] Computed 2 invariants in 2 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9465373431732295633.kers
Total runtime 3 ms.
[2026-05-24 08:03:10] [INFO ] Implicit Places using invariants in 245 ms returned []
[2026-05-24 08:03:10] [INFO ] Invariant cache hit.
[2026-05-24 08:03:10] [INFO ] State equation strengthened by 65 read => feed constraints.
[2026-05-24 08:03:11] [INFO ] Implicit Places using invariants and state equation in 687 ms returned []
Implicit Place search using SMT with State Equation took 945 ms to find 0 implicit places.
Running 197 sub problems to find dead transitions.
[2026-05-24 08:03:11] [INFO ] Invariant cache hit.
[2026-05-24 08:03:11] [INFO ] State equation strengthened by 65 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (OVERLAPS) 198/333 variables, 135/137 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/333 variables, 65/202 constraints. Problems are: Problem set: 0 solved, 197 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/333 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 7 (OVERLAPS) 0/333 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 197 unsolved
No progress, stopping.
After SMT solving in domain Real declared 333/333 variables, and 202 constraints, problems are : Problem set: 0 solved, 197 unsolved in 15526 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 135/135 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 197 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (OVERLAPS) 198/333 variables, 135/137 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/333 variables, 65/202 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/333 variables, 197/399 constraints. Problems are: Problem set: 0 solved, 197 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 333/333 variables, and 399 constraints, problems are : Problem set: 0 solved, 197 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 135/135 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45641ms problems are : Problem set: 0 solved, 197 unsolved
Search for dead transitions found 0 dead transitions in 45641ms
Starting structural reductions in LTL mode, iteration 1 : 135/225 places, 198/471 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46617 ms. Remains : 135/225 places, 198/471 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((X((X((!p1 U (p2||G(!p1))))||p0))||p1)))'
Stuttering acceptance computed with spot in 125 ms :[false, (AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), true]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-13
Product exploration explored 100000 steps with 37332 reset in 456 ms.
Product exploration explored 100000 steps with 37398 reset in 279 ms.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 493 edges and 135 vertex of which 134 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge based reduction with 6 factoid took 53 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (9252 resets) in 321 ms. (124 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (3811 resets) in 186 ms. (213 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (3801 resets) in 173 ms. (229 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (3803 resets) in 232 ms. (171 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (3855 resets) in 133 ms. (298 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (3839 resets) in 158 ms. (251 steps per ms) remains 5/5 properties
Finished probabilistic random walk after 21787 steps, run visited all 5 properties in 184 ms. (steps per millisecond=118 )
Probabilistic random walk after 21787 steps, saw 10741 distinct states, run finished after 185 ms. (steps per millisecond=117 ) properties seen :5
Knowledge based reduction with 6 factoid took 117 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[false, (AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), true]
Knowledge-based reduction took 948 ms.
Stuttering acceptance computed with spot in 145 ms :[false, (AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), true]
Support contains 5 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 198/198 transitions.
Applied a total of 0 rules in 1 ms. Remains 135 /135 variables (removed 0) and now considering 198/198 (removed 0) transitions.
[2026-05-24 08:03:59] [INFO ] Invariant cache hit.
[2026-05-24 08:03:59] [INFO ] Implicit Places using invariants in 169 ms returned []
[2026-05-24 08:03:59] [INFO ] Invariant cache hit.
[2026-05-24 08:03:59] [INFO ] State equation strengthened by 65 read => feed constraints.
[2026-05-24 08:03:59] [INFO ] Implicit Places using invariants and state equation in 504 ms returned []
Implicit Place search using SMT with State Equation took 675 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 678 ms. Remains : 135/135 places, 198/198 transitions.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 493 edges and 135 vertex of which 134 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge based reduction with 6 factoid took 65 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (9212 resets) in 376 ms. (106 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (3943 resets) in 184 ms. (216 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (3859 resets) in 153 ms. (259 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (3784 resets) in 108 ms. (366 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (3858 resets) in 114 ms. (347 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (3738 resets) in 135 ms. (294 steps per ms) remains 5/5 properties
Finished probabilistic random walk after 21787 steps, run visited all 5 properties in 345 ms. (steps per millisecond=63 )
Probabilistic random walk after 21787 steps, saw 10741 distinct states, run finished after 346 ms. (steps per millisecond=62 ) properties seen :5
Knowledge based reduction with 6 factoid took 105 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[false, (AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), true]
Knowledge-based reduction took 1094 ms.
Stuttering acceptance computed with spot in 119 ms :[false, (AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), true]
Stuttering acceptance computed with spot in 122 ms :[false, (AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), true]
Product exploration explored 100000 steps with 37289 reset in 474 ms.
Product exploration explored 100000 steps with 37468 reset in 436 ms.
Spot run failed in 55 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/ltsmin8482918354503753594
[2026-05-24 08:04:02] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8482918354503753594
Running compilation step : cd /tmp/ltsmin8482918354503753594;'/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 545 ms.
Running link step : cd /tmp/ltsmin8482918354503753594;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin8482918354503753594;'/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/stateBased7718164078705268765.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 198/198 transitions.
Applied a total of 0 rules in 2 ms. Remains 135 /135 variables (removed 0) and now considering 198/198 (removed 0) transitions.
[2026-05-24 08:04:17] [INFO ] Invariant cache hit.
[2026-05-24 08:04:17] [INFO ] Implicit Places using invariants in 133 ms returned []
[2026-05-24 08:04:17] [INFO ] Invariant cache hit.
[2026-05-24 08:04:17] [INFO ] State equation strengthened by 65 read => feed constraints.
[2026-05-24 08:04:17] [INFO ] Implicit Places using invariants and state equation in 500 ms returned []
Implicit Place search using SMT with State Equation took 645 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 647 ms. Remains : 135/135 places, 198/198 transitions.
Built C files in :
/tmp/ltsmin630035433799495477
[2026-05-24 08:04:17] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin630035433799495477
Running compilation step : cd /tmp/ltsmin630035433799495477;'/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 462 ms.
Running link step : cd /tmp/ltsmin630035433799495477;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin630035433799495477;'/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/stateBased10546916710531404543.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-24 08:04:32] [INFO ] Flatten gal took : 16 ms
[2026-05-24 08:04:32] [INFO ] Flatten gal took : 15 ms
[2026-05-24 08:04:32] [INFO ] Time to serialize gal into /tmp/LTL11729344327070087916.gal : 4 ms
[2026-05-24 08:04:32] [INFO ] Time to serialize properties into /tmp/LTL16809765655777075283.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/LTL11729344327070087916.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18333657652437896946.hoa' '-atoms' '/tmp/LTL16809765655777075283.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL16809765655777075283.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18333657652437896946.hoa
Detected timeout of ITS tools.
[2026-05-24 08:04:47] [INFO ] Flatten gal took : 21 ms
[2026-05-24 08:04:47] [INFO ] Flatten gal took : 20 ms
[2026-05-24 08:04:47] [INFO ] Time to serialize gal into /tmp/LTL10613183360472480419.gal : 5 ms
[2026-05-24 08:04:48] [INFO ] Time to serialize properties into /tmp/LTL7952914024387670054.ltl : 4 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/LTL10613183360472480419.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7952914024387670054.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((X(("((p415<1)||(l0<1))")||(X((!("((p398>=1)&&(l0>=1))"))U(("((!((s1>=1)&&(l4116>=1)))&&(!((p398>=1)&&(l0>=1))))")||(G(!("((p398>...206
Formula 0 simplified : F(!"((p398>=1)&&(l0>=1))" & X(!"((p415<1)||(l0<1))" & X("((p398>=1)&&(l0>=1))" M !"((!((s1>=1)&&(l4116>=1)))&&(!((p398>=1)&&(l0>=1))...161
Detected timeout of ITS tools.
[2026-05-24 08:05:03] [INFO ] Flatten gal took : 22 ms
[2026-05-24 08:05:03] [INFO ] Applying decomposition
[2026-05-24 08:05:03] [INFO ] Flatten gal took : 22 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/graph5980635659791487827.txt' '-o' '/tmp/graph5980635659791487827.bin' '-w' '/tmp/graph5980635659791487827.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5980635659791487827.bin' '-l' '-1' '-v' '-w' '/tmp/graph5980635659791487827.weights' '-q' '0' '-e' '0.001'
[2026-05-24 08:05:03] [INFO ] Decomposing Gal with order
[2026-05-24 08:05:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 08:05:03] [INFO ] Removed a total of 222 redundant transitions.
[2026-05-24 08:05:03] [INFO ] Flatten gal took : 161 ms
[2026-05-24 08:05:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 170 labels/synchronizations in 27 ms.
[2026-05-24 08:05:03] [INFO ] Time to serialize gal into /tmp/LTL10193534294554280996.gal : 9 ms
[2026-05-24 08:05:03] [INFO ] Time to serialize properties into /tmp/LTL6469360326760462620.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/LTL10193534294554280996.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6469360326760462620.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G((X(("((i1.u5.p415<1)||(i6.u0.l0<1))")||(X((!("((i1.u5.p398>=1)&&(i6.u0.l0>=1))"))U(("((!((i6.u0.s1>=1)&&(u19.l4116>=1)))&&(!((i1....276
Formula 0 simplified : F(!"((i1.u5.p398>=1)&&(i6.u0.l0>=1))" & X(!"((i1.u5.p415<1)||(i6.u0.l0<1))" & X("((i1.u5.p398>=1)&&(i6.u0.l0>=1))" M !"((!((i6.u0.s1...219
Reverse transition relation is NOT exact ! Due to transitions t0, t5, t13, t90, t94, t95, t96, t107, t149, t150, t154, t201, t202, t211, t304, t326, t384, ...596
Detected timeout of ITS tools.
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-13 finished in 128117 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 225 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 225/225 places, 471/471 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 193 transition count 345
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 193 transition count 345
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 71 place count 193 transition count 338
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 97 place count 167 transition count 308
Iterating global reduction 1 with 26 rules applied. Total rules applied 123 place count 167 transition count 308
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 137 place count 167 transition count 294
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 159 place count 145 transition count 243
Iterating global reduction 2 with 22 rules applied. Total rules applied 181 place count 145 transition count 243
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 194 place count 145 transition count 230
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 204 place count 135 transition count 197
Iterating global reduction 3 with 10 rules applied. Total rules applied 214 place count 135 transition count 197
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 217 place count 135 transition count 194
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 222 place count 130 transition count 189
Iterating global reduction 4 with 5 rules applied. Total rules applied 227 place count 130 transition count 189
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 231 place count 130 transition count 185
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 233 place count 128 transition count 183
Iterating global reduction 5 with 2 rules applied. Total rules applied 235 place count 128 transition count 183
Applied a total of 235 rules in 41 ms. Remains 128 /225 variables (removed 97) and now considering 183/471 (removed 288) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2372921343727851741.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-355360269842897132.kers'
[2026-05-24 08:05:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2372921343727851741.kers, --Pflows, --basisKERS=/tmp/petrispot-output-355360269842897132.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 183 rows 128 cols 595 entries
Finished phase 1 with 124 SingleSign rule and 2 generalized
[2026-05-24 08:05:18] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-355360269842897132.kers
Total runtime 2 ms.
[2026-05-24 08:05:18] [INFO ] Implicit Places using invariants in 146 ms returned []
[2026-05-24 08:05:18] [INFO ] Invariant cache hit.
[2026-05-24 08:05:18] [INFO ] State equation strengthened by 62 read => feed constraints.
[2026-05-24 08:05:19] [INFO ] Implicit Places using invariants and state equation in 667 ms returned []
Implicit Place search using SMT with State Equation took 816 ms to find 0 implicit places.
[2026-05-24 08:05:19] [INFO ] Redundant transitions in 17 ms returned []
Running 182 sub problems to find dead transitions.
[2026-05-24 08:05:19] [INFO ] Invariant cache hit.
[2026-05-24 08:05:19] [INFO ] State equation strengthened by 62 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (OVERLAPS) 183/311 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 62/192 constraints. Problems are: Problem set: 0 solved, 182 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (OVERLAPS) 0/311 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Real declared 311/311 variables, and 192 constraints, problems are : Problem set: 0 solved, 182 unsolved in 20612 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 182 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (OVERLAPS) 183/311 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 62/192 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 182/374 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 311/311 variables, and 374 constraints, problems are : Problem set: 0 solved, 182 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50769ms problems are : Problem set: 0 solved, 182 unsolved
Search for dead transitions found 0 dead transitions in 50770ms
Starting structural reductions in SI_LTL mode, iteration 1 : 128/225 places, 183/471 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 51651 ms. Remains : 128/225 places, 183/471 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 : DBSingleClientW-PT-d2m07-LTLFireability-14
Product exploration explored 100000 steps with 23030 reset in 346 ms.
Product exploration explored 100000 steps with 22933 reset in 297 ms.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 463 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge based reduction with 3 factoid took 55 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (9178 resets) in 147 ms. (270 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1782 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 18911 steps, run visited all 1 properties in 55 ms. (steps per millisecond=343 )
Probabilistic random walk after 18911 steps, saw 9260 distinct states, run finished after 55 ms. (steps per millisecond=343 ) properties seen :1
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Knowledge-based reduction took 305 ms.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 183/183 transitions.
Applied a total of 0 rules in 10 ms. Remains 128 /128 variables (removed 0) and now considering 183/183 (removed 0) transitions.
[2026-05-24 08:06:11] [INFO ] Invariant cache hit.
[2026-05-24 08:06:11] [INFO ] Implicit Places using invariants in 187 ms returned []
[2026-05-24 08:06:11] [INFO ] Invariant cache hit.
[2026-05-24 08:06:11] [INFO ] State equation strengthened by 62 read => feed constraints.
[2026-05-24 08:06:12] [INFO ] Implicit Places using invariants and state equation in 725 ms returned []
Implicit Place search using SMT with State Equation took 916 ms to find 0 implicit places.
[2026-05-24 08:06:12] [INFO ] Redundant transitions in 3 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 935 ms. Remains : 128/128 places, 183/183 transitions.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 463 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge based reduction with 3 factoid took 49 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (9171 resets) in 130 ms. (305 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1837 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 18911 steps, run visited all 1 properties in 46 ms. (steps per millisecond=411 )
Probabilistic random walk after 18911 steps, saw 9260 distinct states, run finished after 46 ms. (steps per millisecond=411 ) properties seen :1
Knowledge based reduction with 3 factoid took 56 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Knowledge-based reduction took 243 ms.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 23033 reset in 217 ms.
Product exploration explored 100000 steps with 22976 reset in 233 ms.
Built C files in :
/tmp/ltsmin5197200058619662747
[2026-05-24 08:06:13] [INFO ] Computing symmetric may disable matrix : 183 transitions.
[2026-05-24 08:06:13] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 08:06:13] [INFO ] Computing symmetric may enable matrix : 183 transitions.
[2026-05-24 08:06:13] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 08:06:13] [INFO ] Computing Do-Not-Accords matrix : 183 transitions.
[2026-05-24 08:06:13] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 08:06:13] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5197200058619662747
Running compilation step : cd /tmp/ltsmin5197200058619662747;'/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 581 ms.
Running link step : cd /tmp/ltsmin5197200058619662747;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin5197200058619662747;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13570265307259962990.hoa' '--buchi-type=spotba'
LTSmin run took 197 ms.
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-14 finished in 55331 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||(G(p1)&&X(p0)))))'
Support contains 2 out of 225 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 225/225 places, 471/471 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 193 transition count 353
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 193 transition count 353
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 72 place count 193 transition count 345
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 98 place count 167 transition count 315
Iterating global reduction 1 with 26 rules applied. Total rules applied 124 place count 167 transition count 315
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 138 place count 167 transition count 301
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 160 place count 145 transition count 251
Iterating global reduction 2 with 22 rules applied. Total rules applied 182 place count 145 transition count 251
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 197 place count 145 transition count 236
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 207 place count 135 transition count 196
Iterating global reduction 3 with 10 rules applied. Total rules applied 217 place count 135 transition count 196
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 223 place count 135 transition count 190
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 227 place count 131 transition count 186
Iterating global reduction 4 with 4 rules applied. Total rules applied 231 place count 131 transition count 186
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 233 place count 131 transition count 184
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 235 place count 129 transition count 182
Iterating global reduction 5 with 2 rules applied. Total rules applied 237 place count 129 transition count 182
Applied a total of 237 rules in 32 ms. Remains 129 /225 variables (removed 96) and now considering 182/471 (removed 289) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16946635215644611123.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4976875545083403538.kers'
[2026-05-24 08:06:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16946635215644611123.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4976875545083403538.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 182 rows 129 cols 602 entries
Finished phase 1 with 125 SingleSign rule and 2 generalized
[2026-05-24 08:06:13] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4976875545083403538.kers
Total runtime 1 ms.
[2026-05-24 08:06:14] [INFO ] Implicit Places using invariants in 166 ms returned []
[2026-05-24 08:06:14] [INFO ] Invariant cache hit.
[2026-05-24 08:06:14] [INFO ] State equation strengthened by 57 read => feed constraints.
[2026-05-24 08:06:14] [INFO ] Implicit Places using invariants and state equation in 744 ms returned []
Implicit Place search using SMT with State Equation took 912 ms to find 0 implicit places.
[2026-05-24 08:06:14] [INFO ] Redundant transitions in 2 ms returned []
Running 181 sub problems to find dead transitions.
[2026-05-24 08:06:14] [INFO ] Invariant cache hit.
[2026-05-24 08:06:14] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 182/311 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 57/188 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (OVERLAPS) 0/311 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 311/311 variables, and 188 constraints, problems are : Problem set: 0 solved, 181 unsolved in 23470 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 182/311 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 57/188 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 181/369 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 311/311 variables, and 369 constraints, problems are : Problem set: 0 solved, 181 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53589ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 53590ms
Starting structural reductions in SI_LTL mode, iteration 1 : 129/225 places, 182/471 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 54542 ms. Remains : 129/225 places, 182/471 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||(G(p1)&&X(p0)))))'
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-15
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-15 finished in 54617 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X((X((!p0 U (p2||G(!p0))))||p1)))))'
Spot run failed in 58 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-24 08:07:08] [INFO ] Flatten gal took : 29 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17975134655915107549
[2026-05-24 08:07:08] [INFO ] Computing symmetric may disable matrix : 471 transitions.
[2026-05-24 08:07:08] [INFO ] Applying decomposition
[2026-05-24 08:07:08] [INFO ] Computation of Complete disable matrix. took 23 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 08:07:08] [INFO ] Flatten gal took : 27 ms
[2026-05-24 08:07:08] [INFO ] Computing symmetric may enable matrix : 471 transitions.
[2026-05-24 08:07:08] [INFO ] Computation of Complete enable matrix. took 22 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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/graph10130354786223418139.txt' '-o' '/tmp/graph10130354786223418139.bin' '-w' '/tmp/graph10130354786223418139.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10130354786223418139.bin' '-l' '-1' '-v' '-w' '/tmp/graph10130354786223418139.weights' '-q' '0' '-e' '0.001'
[2026-05-24 08:07:08] [INFO ] Decomposing Gal with order
[2026-05-24 08:07:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 08:07:08] [INFO ] Computing Do-Not-Accords matrix : 471 transitions.
[2026-05-24 08:07:08] [INFO ] Removed a total of 501 redundant transitions.
[2026-05-24 08:07:08] [INFO ] Computation of Completed DNA matrix. took 55 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 08:07:08] [INFO ] Flatten gal took : 136 ms
[2026-05-24 08:07:08] [INFO ] Built C files in 342ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17975134655915107549
Running compilation step : cd /tmp/ltsmin17975134655915107549;'/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-24 08:07:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 395 labels/synchronizations in 39 ms.
[2026-05-24 08:07:09] [INFO ] Time to serialize gal into /tmp/LTLFireability17583881009299645552.gal : 11 ms
[2026-05-24 08:07:09] [INFO ] Time to serialize properties into /tmp/LTLFireability2641500559925508244.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/LTLFireability17583881009299645552.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2641500559925508244.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(("((i0.u0.p398>=1)&&(i4.u2.l0>=1))")||(X(("((i0.u0.p415<1)||(i4.u2.l0<1))")||(X((!("((i0.u0.p398>=1)&&(i4.u2.l0>=1))"))U(("((!((i...278
Formula 0 simplified : F(!"((i0.u0.p398>=1)&&(i4.u2.l0>=1))" & X(!"((i0.u0.p415<1)||(i4.u2.l0<1))" & X("((i0.u0.p398>=1)&&(i4.u2.l0>=1))" M !"((!((i0.u0.s1...221
Compilation finished in 2277 ms.
Running link step : cd /tmp/ltsmin17975134655915107549;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin17975134655915107549;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '[](((LTLAPp0==true)||X((X((!(LTLAPp0==true) U ((LTLAPp2==true)||[](!(LTLAPp0==true)))))||(LTLAPp1==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-24 08:31:48] [INFO ] Flatten gal took : 29 ms
[2026-05-24 08:31:48] [INFO ] Time to serialize gal into /tmp/LTLFireability3133752210828877279.gal : 5 ms
[2026-05-24 08:31:48] [INFO ] Time to serialize properties into /tmp/LTLFireability15424752286720280701.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/LTLFireability3133752210828877279.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15424752286720280701.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...298
Read 1 LTL properties
Checking formula 0 : !((G(("((p398>=1)&&(l0>=1))")||(X(("((p415<1)||(l0<1))")||(X((!("((p398>=1)&&(l0>=1))"))U(("((!((s1>=1)&&(l4116>=1)))&&(!((p398>=1)&&(...206
Formula 0 simplified : F(!"((p398>=1)&&(l0>=1))" & X(!"((p415<1)||(l0<1))" & X("((p398>=1)&&(l0>=1))" M !"((!((s1>=1)&&(l4116>=1)))&&(!((p398>=1)&&(l0>=1))...161

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

Sequence of Actions to be Executed by the VM

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

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

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