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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 6.8K Mar 6 18:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Mar 6 18:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Mar 6 18:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 33K Mar 6 18:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 15 08:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 08:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 15 08:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 08:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K Mar 6 18:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Mar 6 18:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Mar 6 18:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Mar 6 18:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 08:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 08:49 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-d2m04-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779598137056

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-d2m04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-24 04:48:59] [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 04:48:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 04:48:59] [INFO ] Load time of PNML (sax parser for PT used): 423 ms
[2026-05-24 04:49:00] [INFO ] Transformed 4763 places.
[2026-05-24 04:49:00] [INFO ] Transformed 2478 transitions.
[2026-05-24 04:49:00] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 625 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 3580 places in 25 ms
Reduce places removed 3580 places and 0 transitions.
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 370 places :
Symmetric choice reduction at 1 with 370 rule applications. Total rules 615 place count 767 transition count 1482
Iterating global reduction 1 with 370 rules applied. Total rules applied 985 place count 767 transition count 1482
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 1 with 63 rules applied. Total rules applied 1048 place count 767 transition count 1419
Discarding 294 places :
Symmetric choice reduction at 2 with 294 rule applications. Total rules 1342 place count 473 transition count 1125
Iterating global reduction 2 with 294 rules applied. Total rules applied 1636 place count 473 transition count 1125
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 1645 place count 473 transition count 1116
Discarding 215 places :
Symmetric choice reduction at 3 with 215 rule applications. Total rules 1860 place count 258 transition count 818
Iterating global reduction 3 with 215 rules applied. Total rules applied 2075 place count 258 transition count 818
Ensure Unique test removed 279 transitions
Reduce isomorphic transitions removed 279 transitions.
Iterating post reduction 3 with 279 rules applied. Total rules applied 2354 place count 258 transition count 539
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 2370 place count 242 transition count 515
Iterating global reduction 4 with 16 rules applied. Total rules applied 2386 place count 242 transition count 515
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 4 with 28 rules applied. Total rules applied 2414 place count 242 transition count 487
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 2422 place count 234 transition count 479
Iterating global reduction 5 with 8 rules applied. Total rules applied 2430 place count 234 transition count 479
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2431 place count 234 transition count 478
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 2438 place count 227 transition count 471
Iterating global reduction 6 with 7 rules applied. Total rules applied 2445 place count 227 transition count 471
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 2457 place count 227 transition count 459
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 2460 place count 224 transition count 450
Iterating global reduction 7 with 3 rules applied. Total rules applied 2463 place count 224 transition count 450
Applied a total of 2463 rules in 297 ms. Remains 224 /1183 variables (removed 959) and now considering 450/2478 (removed 2028) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-918474454819271790.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5327400876690757400.kers'
[2026-05-24 04:49:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-918474454819271790.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5327400876690757400.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 450 rows 224 cols 1310 entries
Finished phase 1 with 220 SingleSign rule and 2 generalized
[2026-05-24 04:49:00] [INFO ] Computed 2 invariants in 2 ms
Computed 2 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-5327400876690757400.kers
Total runtime 4 ms.
[2026-05-24 04:49:01] [INFO ] Implicit Places using invariants in 847 ms returned []
[2026-05-24 04:49:01] [INFO ] Invariant cache hit.
[2026-05-24 04:49:02] [INFO ] State equation strengthened by 231 read => feed constraints.
[2026-05-24 04:49:04] [INFO ] Implicit Places using invariants and state equation in 2615 ms returned []
Implicit Place search using SMT with State Equation took 3518 ms to find 0 implicit places.
Running 449 sub problems to find dead transitions.
[2026-05-24 04:49:04] [INFO ] Invariant cache hit.
[2026-05-24 04:49:04] [INFO ] State equation strengthened by 231 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/223 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 1 (OVERLAPS) 1/224 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/224 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/224 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 4 (OVERLAPS) 450/674 variables, 224/226 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/674 variables, 231/457 constraints. Problems are: Problem set: 0 solved, 449 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 674/674 variables, and 457 constraints, problems are : Problem set: 0 solved, 449 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 224/224 constraints, ReadFeed: 231/231 constraints, PredecessorRefiner: 449/449 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 449 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/223 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 1 (OVERLAPS) 1/224 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/224 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/224 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 4 (OVERLAPS) 450/674 variables, 224/226 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/674 variables, 231/457 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/674 variables, 449/906 constraints. Problems are: Problem set: 0 solved, 449 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 674/674 variables, and 906 constraints, problems are : Problem set: 0 solved, 449 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 224/224 constraints, ReadFeed: 231/231 constraints, PredecessorRefiner: 449/449 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61267ms problems are : Problem set: 0 solved, 449 unsolved
Search for dead transitions found 0 dead transitions in 61306ms
Starting structural reductions in LTL mode, iteration 1 : 224/1183 places, 450/2478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65172 ms. Remains : 224/1183 places, 450/2478 transitions.
Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 450/450 transitions.
Applied a total of 0 rules in 6 ms. Remains 224 /224 variables (removed 0) and now considering 450/450 (removed 0) transitions.
[2026-05-24 04:50:05] [INFO ] Invariant cache hit.
[2026-05-24 04:50:05] [INFO ] Implicit Places using invariants in 275 ms returned []
[2026-05-24 04:50:05] [INFO ] Invariant cache hit.
[2026-05-24 04:50:06] [INFO ] State equation strengthened by 231 read => feed constraints.
[2026-05-24 04:50:08] [INFO ] Implicit Places using invariants and state equation in 2240 ms returned []
Implicit Place search using SMT with State Equation took 2529 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 2542 ms. Remains : 224/224 places, 450/450 transitions.
Support contains 41 out of 224 places after structural reductions.
[2026-05-24 04:50:08] [INFO ] Flatten gal took : 84 ms
[2026-05-24 04:50:08] [INFO ] Flatten gal took : 44 ms
[2026-05-24 04:50:08] [INFO ] Input system was already deterministic with 450 transitions.
Reduction of identical properties reduced properties to check from 40 to 38
RANDOM walk for 40000 steps (9198 resets) in 3924 ms. (10 steps per ms) remains 33/38 properties
BEST_FIRST walk for 4003 steps (189 resets) in 63 ms. (62 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (158 resets) in 40 ms. (97 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (181 resets) in 47 ms. (83 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (190 resets) in 46 ms. (85 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (345 resets) in 54 ms. (72 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (181 resets) in 21 ms. (181 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (185 resets) in 21 ms. (181 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (151 resets) in 28 ms. (138 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (151 resets) in 18 ms. (210 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (179 resets) in 35 ms. (111 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (187 resets) in 17 ms. (222 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (169 resets) in 17 ms. (222 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (161 resets) in 17 ms. (222 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (178 resets) in 23 ms. (166 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (388 resets) in 48 ms. (81 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (157 resets) in 19 ms. (200 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (154 resets) in 19 ms. (200 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (415 resets) in 34 ms. (114 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (195 resets) in 27 ms. (142 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (173 resets) in 18 ms. (210 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (175 resets) in 18 ms. (210 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (411 resets) in 28 ms. (138 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4000 steps (383 resets) in 28 ms. (137 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (184 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (184 resets) in 38 ms. (102 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (182 resets) in 19 ms. (200 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (158 resets) in 29 ms. (133 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4001 steps (200 resets) in 47 ms. (83 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (387 resets) in 61 ms. (64 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (168 resets) in 41 ms. (95 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (181 resets) in 23 ms. (166 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (190 resets) in 44 ms. (88 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (165 resets) in 50 ms. (78 steps per ms) remains 33/33 properties
[2026-05-24 04:50:10] [INFO ] Invariant cache hit.
[2026-05-24 04:50:10] [INFO ] State equation strengthened by 231 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 77/114 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (OVERLAPS) 52/166 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/166 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (OVERLAPS) 391/557 variables, 166/176 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/557 variables, 172/348 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/557 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 33 unsolved
Problem AtomicPropp2 is UNSAT
At refinement iteration 9 (OVERLAPS) 117/674 variables, 58/406 constraints. Problems are: Problem set: 1 solved, 32 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/674 variables, 59/465 constraints. Problems are: Problem set: 1 solved, 32 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 674/674 variables, and 465 constraints, problems are : Problem set: 1 solved, 32 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 224/224 constraints, ReadFeed: 231/231 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 77/114 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 32 unsolved
At refinement iteration 3 (OVERLAPS) 52/166 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 8/10 constraints. Problems are: Problem set: 1 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/166 variables, 8/18 constraints. Problems are: Problem set: 1 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 391/557 variables, 166/184 constraints. Problems are: Problem set: 1 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/557 variables, 172/356 constraints. Problems are: Problem set: 1 solved, 32 unsolved
SMT process timed out in 10298ms, After SMT, problems are : Problem set: 1 solved, 32 unsolved
Fused 32 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 37 out of 224 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 224/224 places, 450/450 transitions.
Graph (complete) has 832 edges and 224 vertex of which 223 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 223 transition count 445
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 8 place count 221 transition count 439
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 221 transition count 439
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 219 transition count 437
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 219 transition count 437
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 217 transition count 435
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 217 transition count 435
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 21 place count 217 transition count 432
Applied a total of 21 rules in 100 ms. Remains 217 /224 variables (removed 7) and now considering 432/450 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 217/224 places, 432/450 transitions.
RANDOM walk for 40000 steps (9220 resets) in 723 ms. (55 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (195 resets) in 25 ms. (154 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (187 resets) in 38 ms. (102 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (180 resets) in 35 ms. (111 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (349 resets) in 40 ms. (97 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (179 resets) in 26 ms. (148 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (162 resets) in 28 ms. (138 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (175 resets) in 27 ms. (143 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (194 resets) in 77 ms. (51 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (186 resets) in 40 ms. (97 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (173 resets) in 35 ms. (111 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (171 resets) in 20 ms. (190 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (185 resets) in 37 ms. (105 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (163 resets) in 26 ms. (148 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4001 steps (392 resets) in 44 ms. (88 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (178 resets) in 41 ms. (95 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (161 resets) in 88 ms. (44 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (353 resets) in 84 ms. (47 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (183 resets) in 60 ms. (65 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (178 resets) in 73 ms. (54 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (177 resets) in 24 ms. (160 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (386 resets) in 65 ms. (60 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (397 resets) in 87 ms. (45 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (204 resets) in 42 ms. (93 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (205 resets) in 32 ms. (121 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (178 resets) in 35 ms. (111 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (167 resets) in 21 ms. (181 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (191 resets) in 29 ms. (133 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (393 resets) in 51 ms. (76 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (170 resets) in 23 ms. (166 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4001 steps (197 resets) in 31 ms. (125 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (190 resets) in 32 ms. (121 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (172 resets) in 21 ms. (182 steps per ms) remains 32/32 properties
Finished probabilistic random walk after 201344 steps, run visited all 32 properties in 1980 ms. (steps per millisecond=101 )
Probabilistic random walk after 201344 steps, saw 77819 distinct states, run finished after 1988 ms. (steps per millisecond=101 ) properties seen :32
FORMULA DBSingleClientW-PT-d2m04-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA DBSingleClientW-PT-d2m04-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
FORMULA DBSingleClientW-PT-d2m04-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 5 stabilizing places and 31 stable transitions
Graph (complete) has 901 edges and 224 vertex of which 223 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 3 out of 224 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 224/224 places, 450/450 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 194 transition count 330
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 194 transition count 330
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 63 place count 194 transition count 327
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 87 place count 170 transition count 301
Iterating global reduction 1 with 24 rules applied. Total rules applied 111 place count 170 transition count 301
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 122 place count 170 transition count 290
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 144 place count 148 transition count 237
Iterating global reduction 2 with 22 rules applied. Total rules applied 166 place count 148 transition count 237
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 177 place count 148 transition count 226
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 187 place count 138 transition count 204
Iterating global reduction 3 with 10 rules applied. Total rules applied 197 place count 138 transition count 204
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 138 transition count 202
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 207 place count 130 transition count 194
Iterating global reduction 4 with 8 rules applied. Total rules applied 215 place count 130 transition count 194
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 217 place count 130 transition count 192
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 221 place count 126 transition count 188
Iterating global reduction 5 with 4 rules applied. Total rules applied 225 place count 126 transition count 188
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 228 place count 126 transition count 185
Applied a total of 228 rules in 53 ms. Remains 126 /224 variables (removed 98) and now considering 185/450 (removed 265) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2500607525943658556.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12634123177032141449.kers'
[2026-05-24 04:50:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2500607525943658556.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12634123177032141449.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 185 rows 126 cols 594 entries
Finished phase 1 with 122 SingleSign rule and 2 generalized
[2026-05-24 04:50:24] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-12634123177032141449.kers
Total runtime 13 ms.
[2026-05-24 04:50:24] [INFO ] Implicit Places using invariants in 416 ms returned []
[2026-05-24 04:50:24] [INFO ] Invariant cache hit.
[2026-05-24 04:50:25] [INFO ] State equation strengthened by 66 read => feed constraints.
[2026-05-24 04:50:25] [INFO ] Implicit Places using invariants and state equation in 609 ms returned []
Implicit Place search using SMT with State Equation took 1028 ms to find 0 implicit places.
[2026-05-24 04:50:25] [INFO ] Redundant transitions in 7 ms returned []
Running 184 sub problems to find dead transitions.
[2026-05-24 04:50:25] [INFO ] Invariant cache hit.
[2026-05-24 04:50:25] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (OVERLAPS) 185/311 variables, 126/128 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 66/194 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 8 (OVERLAPS) 0/311 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/311 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 184 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 311/311 variables, and 196 constraints, problems are : Problem set: 0 solved, 184 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 126/126 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (OVERLAPS) 185/311 variables, 126/130 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 66/196 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 184/380 constraints. Problems are: Problem set: 0 solved, 184 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 311/311 variables, and 380 constraints, problems are : Problem set: 0 solved, 184 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 126/126 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60173ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 60175ms
Starting structural reductions in SI_LTL mode, iteration 1 : 126/224 places, 185/450 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61270 ms. Remains : 126/224 places, 185/450 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Stuttering acceptance computed with spot in 360 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d2m04-LTLFireability-00
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d2m04-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m04-LTLFireability-00 finished in 61769 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(((G(F(!p0)) U (p1 U p2))||F((!p2 U (p3||G(!p2)))))))'
Support contains 5 out of 224 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 224/224 places, 450/450 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 197 transition count 346
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 197 transition count 346
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 58 place count 197 transition count 342
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 80 place count 175 transition count 318
Iterating global reduction 1 with 22 rules applied. Total rules applied 102 place count 175 transition count 318
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 114 place count 175 transition count 306
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 134 place count 155 transition count 255
Iterating global reduction 2 with 20 rules applied. Total rules applied 154 place count 155 transition count 255
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 162 place count 155 transition count 247
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 172 place count 145 transition count 219
Iterating global reduction 3 with 10 rules applied. Total rules applied 182 place count 145 transition count 219
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 184 place count 145 transition count 217
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 191 place count 138 transition count 210
Iterating global reduction 4 with 7 rules applied. Total rules applied 198 place count 138 transition count 210
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 200 place count 138 transition count 208
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 204 place count 134 transition count 204
Iterating global reduction 5 with 4 rules applied. Total rules applied 208 place count 134 transition count 204
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 210 place count 134 transition count 202
Applied a total of 210 rules in 46 ms. Remains 134 /224 variables (removed 90) and now considering 202/450 (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-4926327082560844561.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1067833477458264866.kers'
[2026-05-24 04:51:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4926327082560844561.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1067833477458264866.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 202 rows 134 cols 652 entries
Finished phase 1 with 130 SingleSign rule and 2 generalized
[2026-05-24 04:51:26] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1067833477458264866.kers
Total runtime 1 ms.
[2026-05-24 04:51:26] [INFO ] Implicit Places using invariants in 130 ms returned []
[2026-05-24 04:51:26] [INFO ] Invariant cache hit.
[2026-05-24 04:51:26] [INFO ] State equation strengthened by 71 read => feed constraints.
[2026-05-24 04:51:27] [INFO ] Implicit Places using invariants and state equation in 895 ms returned []
Implicit Place search using SMT with State Equation took 1027 ms to find 0 implicit places.
[2026-05-24 04:51:27] [INFO ] Redundant transitions in 11 ms returned []
Running 201 sub problems to find dead transitions.
[2026-05-24 04:51:27] [INFO ] Invariant cache hit.
[2026-05-24 04:51:27] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 202/336 variables, 134/136 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/336 variables, 71/207 constraints. Problems are: Problem set: 0 solved, 201 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/336 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (OVERLAPS) 0/336 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Real declared 336/336 variables, and 207 constraints, problems are : Problem set: 0 solved, 201 unsolved in 18827 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 134/134 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 201 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 202/336 variables, 134/136 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/336 variables, 71/207 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/336 variables, 201/408 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 336/336 variables, and 408 constraints, problems are : Problem set: 0 solved, 201 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 134/134 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48984ms problems are : Problem set: 0 solved, 201 unsolved
Search for dead transitions found 0 dead transitions in 48985ms
Starting structural reductions in SI_LTL mode, iteration 1 : 134/224 places, 202/450 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 50078 ms. Remains : 134/224 places, 202/450 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(((G(F(!p0)) U (p1 U p2))||F((!p2 U (p3||G(!p2)))))))'
Stuttering acceptance computed with spot in 163 ms :[false, (AND p0 p2 (NOT p3)), (AND p2 (NOT p3) p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m04-LTLFireability-02
Product exploration explored 100000 steps with 23098 reset in 633 ms.
Product exploration explored 100000 steps with 23041 reset in 443 ms.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 491 edges and 134 vertex of which 133 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge based reduction with 14 factoid took 71 ms. Reduced automaton from 3 states, 6 edges and 4 AP (stutter insensitive) to 3 states, 6 edges and 4 AP (stutter insensitive).
RANDOM walk for 40000 steps (9193 resets) in 1080 ms. (37 steps per ms) remains 4/8 properties
BEST_FIRST walk for 40002 steps (1798 resets) in 402 ms. (99 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1760 resets) in 299 ms. (133 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1806 resets) in 267 ms. (149 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1823 resets) in 134 ms. (296 steps per ms) remains 4/4 properties
[2026-05-24 04:52:18] [INFO ] Invariant cache hit.
[2026-05-24 04:52:18] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 54/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 32/91 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 150/241 variables, 91/93 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 19/112 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf2 is UNSAT
At refinement iteration 8 (OVERLAPS) 89/330 variables, 40/152 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/330 variables, 49/201 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/330 variables, 0/201 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 6/336 variables, 3/204 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/336 variables, 3/207 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/336 variables, 0/207 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/336 variables, 0/207 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 336/336 variables, and 207 constraints, problems are : Problem set: 1 solved, 3 unsolved in 523 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 134/134 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 54/59 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 32/91 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 150/241 variables, 91/93 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 19/112 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 0/112 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 89/330 variables, 40/152 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/330 variables, 49/201 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/330 variables, 3/204 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/330 variables, 0/204 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 6/336 variables, 3/207 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/336 variables, 3/210 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/336 variables, 0/210 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/336 variables, 0/210 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 336/336 variables, and 210 constraints, problems are : Problem set: 1 solved, 3 unsolved in 2186 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 134/134 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2730ms problems are : Problem set: 1 solved, 3 unsolved
Parikh walk visited 0 properties in 1044 ms.
Support contains 5 out of 134 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 202/202 transitions.
Graph (complete) has 459 edges and 134 vertex of which 133 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 133 transition count 199
Applied a total of 4 rules in 11 ms. Remains 133 /134 variables (removed 1) and now considering 199/202 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 133/134 places, 199/202 transitions.
RANDOM walk for 40000 steps (9133 resets) in 236 ms. (168 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1773 resets) in 143 ms. (277 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1821 resets) in 77 ms. (512 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1760 resets) in 83 ms. (476 steps per ms) remains 3/3 properties
Probably explored full state space saw : 32370 states, properties seen :2
Probabilistic random walk after 80034 steps, saw 32370 distinct states, run finished after 384 ms. (steps per millisecond=208 ) properties seen :2
Explored full state space saw : 32490 states, properties seen :0
Exhaustive walk after 80233 steps, saw 32490 distinct states, run finished after 166 ms. (steps per millisecond=483 ) properties seen :0
Found 2 invariant AP formulas.
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 16 factoid took 13 ms. Proved property starting from automaton with 3 states, 6 edges and 4 AP (stutter insensitive
Knowledge-based reduction took 5312 ms.
FORMULA DBSingleClientW-PT-d2m04-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d2m04-LTLFireability-02 finished in 56687 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))&&(p3 U !p1)))'
Support contains 5 out of 224 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 450/450 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 197 transition count 341
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 197 transition count 341
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 57 place count 197 transition count 338
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 79 place count 175 transition count 314
Iterating global reduction 1 with 22 rules applied. Total rules applied 101 place count 175 transition count 314
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 109 place count 175 transition count 306
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 128 place count 156 transition count 268
Iterating global reduction 2 with 19 rules applied. Total rules applied 147 place count 156 transition count 268
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 157 place count 156 transition count 258
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 167 place count 146 transition count 236
Iterating global reduction 3 with 10 rules applied. Total rules applied 177 place count 146 transition count 236
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 179 place count 146 transition count 234
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 187 place count 138 transition count 226
Iterating global reduction 4 with 8 rules applied. Total rules applied 195 place count 138 transition count 226
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 197 place count 138 transition count 224
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 201 place count 134 transition count 220
Iterating global reduction 5 with 4 rules applied. Total rules applied 205 place count 134 transition count 220
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 208 place count 134 transition count 217
Applied a total of 208 rules in 15 ms. Remains 134 /224 variables (removed 90) and now considering 217/450 (removed 233) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3264869072104299239.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7910089825856206435.kers'
[2026-05-24 04:52:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3264869072104299239.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7910089825856206435.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 217 rows 134 cols 665 entries
Finished phase 1 with 130 SingleSign rule and 2 generalized
[2026-05-24 04:52:22] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-7910089825856206435.kers
Total runtime 6 ms.
[2026-05-24 04:52:22] [INFO ] Implicit Places using invariants in 149 ms returned []
[2026-05-24 04:52:22] [INFO ] Invariant cache hit.
[2026-05-24 04:52:23] [INFO ] State equation strengthened by 93 read => feed constraints.
[2026-05-24 04:52:23] [INFO ] Implicit Places using invariants and state equation in 858 ms returned []
Implicit Place search using SMT with State Equation took 1009 ms to find 0 implicit places.
Running 216 sub problems to find dead transitions.
[2026-05-24 04:52:23] [INFO ] Invariant cache hit.
[2026-05-24 04:52:23] [INFO ] State equation strengthened by 93 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 217/351 variables, 134/136 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/351 variables, 93/229 constraints. Problems are: Problem set: 0 solved, 216 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/351 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (OVERLAPS) 0/351 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Real declared 351/351 variables, and 229 constraints, problems are : Problem set: 0 solved, 216 unsolved in 25822 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 134/134 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 217/351 variables, 134/136 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/351 variables, 93/229 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/351 variables, 216/445 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 351/351 variables, and 445 constraints, problems are : Problem set: 0 solved, 216 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 134/134 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56006ms problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 56007ms
Starting structural reductions in LTL mode, iteration 1 : 134/224 places, 217/450 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57032 ms. Remains : 134/224 places, 217/450 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))&&(p3 U !p1)))'
Stuttering acceptance computed with spot in 318 ms :[(OR (NOT p2) p1), true, (NOT p2), p1, (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d2m04-LTLFireability-03
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d2m04-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m04-LTLFireability-03 finished in 57414 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(X((p1||X((p1||X(((p2||G(p3)) U ((p2||G(p3))&&p4))))))))))'
Support contains 5 out of 224 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 450/450 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 198 transition count 357
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 198 transition count 357
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 55 place count 198 transition count 354
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 78 place count 175 transition count 329
Iterating global reduction 1 with 23 rules applied. Total rules applied 101 place count 175 transition count 329
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 113 place count 175 transition count 317
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 133 place count 155 transition count 273
Iterating global reduction 2 with 20 rules applied. Total rules applied 153 place count 155 transition count 273
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 164 place count 155 transition count 262
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 175 place count 144 transition count 231
Iterating global reduction 3 with 11 rules applied. Total rules applied 186 place count 144 transition count 231
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 188 place count 144 transition count 229
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 195 place count 137 transition count 222
Iterating global reduction 4 with 7 rules applied. Total rules applied 202 place count 137 transition count 222
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 204 place count 137 transition count 220
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 207 place count 134 transition count 217
Iterating global reduction 5 with 3 rules applied. Total rules applied 210 place count 134 transition count 217
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 213 place count 134 transition count 214
Applied a total of 213 rules in 34 ms. Remains 134 /224 variables (removed 90) and now considering 214/450 (removed 236) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4924571617656589686.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1721920268650420066.kers'
[2026-05-24 04:53:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4924571617656589686.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1721920268650420066.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 214 rows 134 cols 666 entries
Finished phase 1 with 130 SingleSign rule and 2 generalized
[2026-05-24 04:53:20] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1721920268650420066.kers
Total runtime 2 ms.
[2026-05-24 04:53:20] [INFO ] Implicit Places using invariants in 240 ms returned []
[2026-05-24 04:53:20] [INFO ] Invariant cache hit.
[2026-05-24 04:53:20] [INFO ] State equation strengthened by 87 read => feed constraints.
[2026-05-24 04:53:21] [INFO ] Implicit Places using invariants and state equation in 880 ms returned []
Implicit Place search using SMT with State Equation took 1127 ms to find 0 implicit places.
Running 213 sub problems to find dead transitions.
[2026-05-24 04:53:21] [INFO ] Invariant cache hit.
[2026-05-24 04:53:21] [INFO ] State equation strengthened by 87 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (OVERLAPS) 214/348 variables, 134/136 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 87/223 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 8/231 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/348 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (OVERLAPS) 0/348 variables, 2/233 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 348/348 variables, and 233 constraints, problems are : Problem set: 0 solved, 213 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: 87/87 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 10/10 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/133 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (OVERLAPS) 1/134 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (OVERLAPS) 214/348 variables, 134/146 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/348 variables, 87/233 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/348 variables, 213/446 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 348/348 variables, and 446 constraints, problems are : Problem set: 0 solved, 213 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 134/134 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60238ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 60239ms
Starting structural reductions in LTL mode, iteration 1 : 134/224 places, 214/450 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61401 ms. Remains : 134/224 places, 214/450 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(X((p1||X((p1||X(((p2||G(p3)) U ((p2||G(p3))&&p4))))))))))'
Stuttering acceptance computed with spot in 504 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p4))), (NOT p0), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p4))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p4))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p4))), (OR (NOT p4) (AND (NOT p2) (NOT p3))), true, (NOT p3)]
Running random walk in product with property : DBSingleClientW-PT-d2m04-LTLFireability-04
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m04-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m04-LTLFireability-04 finished in 61969 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(((X(!p0)&&((X(p2)&&p1) U p0))||G(!p0)))))'
Support contains 4 out of 224 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 450/450 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 197 transition count 351
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 197 transition count 351
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 58 place count 197 transition count 347
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 80 place count 175 transition count 323
Iterating global reduction 1 with 22 rules applied. Total rules applied 102 place count 175 transition count 323
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 111 place count 175 transition count 314
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 131 place count 155 transition count 265
Iterating global reduction 2 with 20 rules applied. Total rules applied 151 place count 155 transition count 265
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 162 place count 155 transition count 254
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 172 place count 145 transition count 221
Iterating global reduction 3 with 10 rules applied. Total rules applied 182 place count 145 transition count 221
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 184 place count 145 transition count 219
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 191 place count 138 transition count 212
Iterating global reduction 4 with 7 rules applied. Total rules applied 198 place count 138 transition count 212
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 199 place count 138 transition count 211
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 203 place count 134 transition count 207
Iterating global reduction 5 with 4 rules applied. Total rules applied 207 place count 134 transition count 207
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 210 place count 134 transition count 204
Applied a total of 210 rules in 26 ms. Remains 134 /224 variables (removed 90) and now considering 204/450 (removed 246) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12101929059814468342.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10658866067948808092.kers'
[2026-05-24 04:54:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12101929059814468342.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10658866067948808092.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 204 rows 134 cols 651 entries
Finished phase 1 with 130 SingleSign rule and 2 generalized
[2026-05-24 04:54:22] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-10658866067948808092.kers
Total runtime 5 ms.
[2026-05-24 04:54:22] [INFO ] Implicit Places using invariants in 237 ms returned []
[2026-05-24 04:54:22] [INFO ] Invariant cache hit.
[2026-05-24 04:54:22] [INFO ] State equation strengthened by 75 read => feed constraints.
[2026-05-24 04:54:23] [INFO ] Implicit Places using invariants and state equation in 883 ms returned []
Implicit Place search using SMT with State Equation took 1149 ms to find 0 implicit places.
Running 203 sub problems to find dead transitions.
[2026-05-24 04:54:23] [INFO ] Invariant cache hit.
[2026-05-24 04:54:23] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (OVERLAPS) 1/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, 75/211 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/338 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/338 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/338 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 203 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 338/338 variables, and 214 constraints, problems are : Problem set: 0 solved, 203 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 134/134 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 3/3 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, 1/1 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (OVERLAPS) 1/134 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (OVERLAPS) 204/338 variables, 134/139 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/338 variables, 75/214 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/338 variables, 203/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 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 134/134 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60149ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 60149ms
Starting structural reductions in LTL mode, iteration 1 : 134/224 places, 204/450 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61327 ms. Remains : 134/224 places, 204/450 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(p0)||(X(p0)&&((X(p2)&&p1) U !p0))))))'
Stuttering acceptance computed with spot in 257 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m04-LTLFireability-05
Product exploration explored 100000 steps with 22979 reset in 631 ms.
Product exploration explored 100000 steps with 22951 reset in 528 ms.
Computed a total of 5 stabilizing places and 18 stable transitions
Graph (complete) has 494 edges and 134 vertex of which 133 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 5 stabilizing places and 18 stable transitions
Knowledge based reduction with 13 factoid took 119 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 40000 steps (9123 resets) in 209 ms. (190 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (1766 resets) in 69 ms. (571 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1804 resets) in 54 ms. (727 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1808 resets) in 59 ms. (666 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1777 resets) in 60 ms. (655 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1798 resets) in 61 ms. (645 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1838 resets) in 53 ms. (740 steps per ms) remains 6/6 properties
Finished probabilistic random walk after 34805 steps, run visited all 6 properties in 284 ms. (steps per millisecond=122 )
Probabilistic random walk after 34805 steps, saw 15369 distinct states, run finished after 284 ms. (steps per millisecond=122 ) properties seen :6
Knowledge based reduction with 13 factoid took 142 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0)]
Knowledge-based reduction took 903 ms.
Stuttering acceptance computed with spot in 198 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0)]
Support contains 4 out of 134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 204/204 transitions.
Applied a total of 0 rules in 2 ms. Remains 134 /134 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2026-05-24 04:55:26] [INFO ] Invariant cache hit.
[2026-05-24 04:55:26] [INFO ] Implicit Places using invariants in 211 ms returned []
[2026-05-24 04:55:26] [INFO ] Invariant cache hit.
[2026-05-24 04:55:26] [INFO ] State equation strengthened by 75 read => feed constraints.
[2026-05-24 04:55:27] [INFO ] Implicit Places using invariants and state equation in 752 ms returned []
Implicit Place search using SMT with State Equation took 965 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 967 ms. Remains : 134/134 places, 204/204 transitions.
Computed a total of 5 stabilizing places and 18 stable transitions
Graph (complete) has 494 edges and 134 vertex of which 133 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Computed a total of 5 stabilizing places and 18 stable transitions
Knowledge based reduction with 13 factoid took 68 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 40000 steps (9289 resets) in 430 ms. (92 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1779 resets) in 97 ms. (408 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1862 resets) in 107 ms. (370 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1776 resets) in 144 ms. (275 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1762 resets) in 157 ms. (253 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1828 resets) in 96 ms. (412 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1811 resets) in 100 ms. (396 steps per ms) remains 6/6 properties
Finished probabilistic random walk after 34805 steps, run visited all 6 properties in 268 ms. (steps per millisecond=129 )
Probabilistic random walk after 34805 steps, saw 15369 distinct states, run finished after 269 ms. (steps per millisecond=129 ) properties seen :6
Knowledge based reduction with 13 factoid took 160 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0)]
Knowledge-based reduction took 1094 ms.
Stuttering acceptance computed with spot in 172 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0)]
Stuttering acceptance computed with spot in 194 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0)]
Product exploration explored 100000 steps with 22895 reset in 302 ms.
Product exploration explored 100000 steps with 23043 reset in 310 ms.
Spot run failed in 155 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/ltsmin9679458731043568417
[2026-05-24 04:55:29] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9679458731043568417
Running compilation step : cd /tmp/ltsmin9679458731043568417;'/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 732 ms.
Running link step : cd /tmp/ltsmin9679458731043568417;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin9679458731043568417;'/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/stateBased5823742241182339183.hoa' '--buchi-type=spotba'
LTSmin run took 708 ms.
FORMULA DBSingleClientW-PT-d2m04-LTLFireability-05 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d2m04-LTLFireability-05 finished in 68713 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F((!p1 U (p2||G(!p1)))))))'
Support contains 5 out of 224 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 224/224 places, 450/450 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 197 transition count 340
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 197 transition count 340
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 56 place count 197 transition count 338
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 78 place count 175 transition count 315
Iterating global reduction 1 with 22 rules applied. Total rules applied 100 place count 175 transition count 315
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 109 place count 175 transition count 306
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 130 place count 154 transition count 254
Iterating global reduction 2 with 21 rules applied. Total rules applied 151 place count 154 transition count 254
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 162 place count 154 transition count 243
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 171 place count 145 transition count 217
Iterating global reduction 3 with 9 rules applied. Total rules applied 180 place count 145 transition count 217
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 181 place count 145 transition count 216
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 188 place count 138 transition count 209
Iterating global reduction 4 with 7 rules applied. Total rules applied 195 place count 138 transition count 209
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 196 place count 138 transition count 208
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 200 place count 134 transition count 204
Iterating global reduction 5 with 4 rules applied. Total rules applied 204 place count 134 transition count 204
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 207 place count 134 transition count 201
Applied a total of 207 rules in 65 ms. Remains 134 /224 variables (removed 90) and now considering 201/450 (removed 249) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9346477809007157868.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15888819283619348579.kers'
[2026-05-24 04:55:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9346477809007157868.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15888819283619348579.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 201 rows 134 cols 645 entries
Finished phase 1 with 130 SingleSign rule and 2 generalized
[2026-05-24 04:55:30] [INFO ] Computed 2 invariants in 2 ms
Computed 2 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-15888819283619348579.kers
Total runtime 4 ms.
[2026-05-24 04:55:31] [INFO ] Implicit Places using invariants in 216 ms returned []
[2026-05-24 04:55:31] [INFO ] Invariant cache hit.
[2026-05-24 04:55:31] [INFO ] State equation strengthened by 72 read => feed constraints.
[2026-05-24 04:55:32] [INFO ] Implicit Places using invariants and state equation in 854 ms returned []
Implicit Place search using SMT with State Equation took 1084 ms to find 0 implicit places.
[2026-05-24 04:55:32] [INFO ] Redundant transitions in 4 ms returned []
Running 200 sub problems to find dead transitions.
[2026-05-24 04:55:32] [INFO ] Invariant cache hit.
[2026-05-24 04:55:32] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 201/335 variables, 134/136 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 72/208 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 3/211 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/335 variables, 4/216 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/335 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 10 (OVERLAPS) 0/335 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 335/335 variables, and 216 constraints, problems are : Problem set: 0 solved, 200 unsolved in 30007 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 134/134 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 1/134 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 201/335 variables, 134/144 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 72/216 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/335 variables, 200/416 constraints. Problems are: Problem set: 0 solved, 200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 335/335 variables, and 416 constraints, problems are : Problem set: 0 solved, 200 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 134/134 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60207ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 60208ms
Starting structural reductions in SI_LTL mode, iteration 1 : 134/224 places, 201/450 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61367 ms. Remains : 134/224 places, 201/450 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F((!p1 U (p2||G(!p1)))))))'
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND (NOT p2) p1)]
Running random walk in product with property : DBSingleClientW-PT-d2m04-LTLFireability-06
Product exploration explored 100000 steps with 23090 reset in 256 ms.
Product exploration explored 100000 steps with 23055 reset in 280 ms.
Computed a total of 5 stabilizing places and 18 stable transitions
Graph (complete) has 493 edges and 134 vertex of which 133 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 18 stable transitions
Knowledge based reduction with 11 factoid took 72 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
RANDOM walk for 40000 steps (9233 resets) in 250 ms. (159 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40002 steps (3818 resets) in 93 ms. (425 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (1817 resets) in 62 ms. (634 steps per ms) remains 2/2 properties
[2026-05-24 04:56:33] [INFO ] Invariant cache hit.
[2026-05-24 04:56:33] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 53/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 32/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 146/236 variables, 90/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 17/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 91/327 variables, 40/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/327 variables, 51/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/327 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 8/335 variables, 4/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/335 variables, 4/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/335 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/335 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 335/335 variables, and 209 constraints, problems are : Problem set: 0 solved, 2 unsolved in 644 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 134/134 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 53/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 32/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 146/236 variables, 90/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 17/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 91/327 variables, 40/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/327 variables, 51/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/327 variables, 2/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/327 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 8/335 variables, 4/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/335 variables, 4/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/335 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/335 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 335/335 variables, and 211 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1594 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 134/134 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2249ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 266 ms.
Support contains 5 out of 134 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 201/201 transitions.
Graph (complete) has 461 edges and 134 vertex of which 133 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 133 transition count 197
Applied a total of 5 rules in 14 ms. Remains 133 /134 variables (removed 1) and now considering 197/201 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 133/134 places, 197/201 transitions.
RANDOM walk for 40000 steps (9219 resets) in 210 ms. (189 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (3908 resets) in 161 ms. (246 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (1762 resets) in 92 ms. (430 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 40091 steps, run visited all 2 properties in 159 ms. (steps per millisecond=252 )
Probabilistic random walk after 40091 steps, saw 17111 distinct states, run finished after 160 ms. (steps per millisecond=250 ) properties seen :2
Knowledge based reduction with 11 factoid took 138 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2))]
Knowledge-based reduction took 3332 ms.
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2))]
Support contains 5 out of 134 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 134/134 places, 201/201 transitions.
Applied a total of 0 rules in 6 ms. Remains 134 /134 variables (removed 0) and now considering 201/201 (removed 0) transitions.
[2026-05-24 04:56:36] [INFO ] Invariant cache hit.
[2026-05-24 04:56:36] [INFO ] Implicit Places using invariants in 158 ms returned []
[2026-05-24 04:56:36] [INFO ] Invariant cache hit.
[2026-05-24 04:56:36] [INFO ] State equation strengthened by 72 read => feed constraints.
[2026-05-24 04:56:37] [INFO ] Implicit Places using invariants and state equation in 804 ms returned []
Implicit Place search using SMT with State Equation took 965 ms to find 0 implicit places.
[2026-05-24 04:56:37] [INFO ] Redundant transitions in 2 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 983 ms. Remains : 134/134 places, 201/201 transitions.
Computed a total of 5 stabilizing places and 18 stable transitions
Graph (complete) has 493 edges and 134 vertex of which 133 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 18 stable transitions
Knowledge based reduction with 11 factoid took 68 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
RANDOM walk for 40000 steps (9257 resets) in 248 ms. (160 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (3885 resets) in 151 ms. (263 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1810 resets) in 126 ms. (314 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40002 steps (1846 resets) in 85 ms. (465 steps per ms) remains 2/2 properties
[2026-05-24 04:56:37] [INFO ] Invariant cache hit.
[2026-05-24 04:56:37] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 53/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 32/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 146/236 variables, 90/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 17/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 91/327 variables, 40/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/327 variables, 51/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/327 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 8/335 variables, 4/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/335 variables, 4/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/335 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/335 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 335/335 variables, and 209 constraints, problems are : Problem set: 0 solved, 2 unsolved in 732 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 134/134 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 53/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 32/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 146/236 variables, 90/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 17/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 91/327 variables, 40/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/327 variables, 51/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/327 variables, 2/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/327 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 8/335 variables, 4/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/335 variables, 4/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/335 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/335 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 335/335 variables, and 211 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1534 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 134/134 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2273ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 272 ms.
Support contains 5 out of 134 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 201/201 transitions.
Graph (complete) has 461 edges and 134 vertex of which 133 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 133 transition count 197
Applied a total of 5 rules in 12 ms. Remains 133 /134 variables (removed 1) and now considering 197/201 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 133/134 places, 197/201 transitions.
RANDOM walk for 40000 steps (9221 resets) in 247 ms. (161 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3851 resets) in 125 ms. (317 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1824 resets) in 78 ms. (506 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 40091 steps, run visited all 2 properties in 238 ms. (steps per millisecond=168 )
Probabilistic random walk after 40091 steps, saw 17111 distinct states, run finished after 240 ms. (steps per millisecond=167 ) properties seen :2
Knowledge based reduction with 11 factoid took 131 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2))]
Knowledge-based reduction took 3510 ms.
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 23020 reset in 433 ms.
Product exploration explored 100000 steps with 23162 reset in 389 ms.
Built C files in :
/tmp/ltsmin3726031563414883442
[2026-05-24 04:56:42] [INFO ] Computing symmetric may disable matrix : 201 transitions.
[2026-05-24 04:56:42] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 04:56:42] [INFO ] Computing symmetric may enable matrix : 201 transitions.
[2026-05-24 04:56:42] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 04:56:42] [INFO ] Computing Do-Not-Accords matrix : 201 transitions.
[2026-05-24 04:56:42] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 04:56:42] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3726031563414883442
Running compilation step : cd /tmp/ltsmin3726031563414883442;'/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 837 ms.
Running link step : cd /tmp/ltsmin3726031563414883442;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin3726031563414883442;'/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/stateBased8518950610163609518.hoa' '--buchi-type=spotba'
LTSmin run took 295 ms.
FORMULA DBSingleClientW-PT-d2m04-LTLFireability-06 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d2m04-LTLFireability-06 finished in 72381 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))&&((!p1&&X((!p1 U (G(!p1)||p2)))) U (G((!p1&&X((!p1 U (G(!p1)||p3)))))||(X((!p1 U (G(!p1)||p5)))&&p4)))))'
Support contains 6 out of 224 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 450/450 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 197 transition count 337
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 197 transition count 337
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 57 place count 197 transition count 334
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 78 place count 176 transition count 312
Iterating global reduction 1 with 21 rules applied. Total rules applied 99 place count 176 transition count 312
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 108 place count 176 transition count 303
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 129 place count 155 transition count 252
Iterating global reduction 2 with 21 rules applied. Total rules applied 150 place count 155 transition count 252
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 160 place count 155 transition count 242
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 169 place count 146 transition count 215
Iterating global reduction 3 with 9 rules applied. Total rules applied 178 place count 146 transition count 215
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 182 place count 146 transition count 211
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 188 place count 140 transition count 205
Iterating global reduction 4 with 6 rules applied. Total rules applied 194 place count 140 transition count 205
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 196 place count 140 transition count 203
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 200 place count 136 transition count 199
Iterating global reduction 5 with 4 rules applied. Total rules applied 204 place count 136 transition count 199
Applied a total of 204 rules in 20 ms. Remains 136 /224 variables (removed 88) and now considering 199/450 (removed 251) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4529625646288051742.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15447717341500384822.kers'
[2026-05-24 04:56:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4529625646288051742.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15447717341500384822.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 199 rows 136 cols 649 entries
Finished phase 1 with 132 SingleSign rule and 2 generalized
[2026-05-24 04:56:43] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15447717341500384822.kers
Total runtime 2 ms.
[2026-05-24 04:56:43] [INFO ] Implicit Places using invariants in 196 ms returned []
[2026-05-24 04:56:43] [INFO ] Invariant cache hit.
[2026-05-24 04:56:43] [INFO ] State equation strengthened by 67 read => feed constraints.
[2026-05-24 04:56:45] [INFO ] Implicit Places using invariants and state equation in 1614 ms returned []
Implicit Place search using SMT with State Equation took 1812 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2026-05-24 04:56:45] [INFO ] Invariant cache hit.
[2026-05-24 04:56:45] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 199/335 variables, 136/138 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 67/205 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (OVERLAPS) 0/335 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 335/335 variables, and 206 constraints, problems are : Problem set: 0 solved, 198 unsolved in 20961 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 136/136 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (OVERLAPS) 199/335 variables, 136/139 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 67/206 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 198/404 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 335/335 variables, and 404 constraints, problems are : Problem set: 0 solved, 198 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 136/136 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 51128ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 51129ms
Starting structural reductions in LTL mode, iteration 1 : 136/224 places, 199/450 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52962 ms. Remains : 136/224 places, 199/450 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))&&((!p1&&X((!p1 U (G(!p1)||p2)))) U (G((!p1&&X((!p1 U (G(!p1)||p3)))))||(X((!p1 U (G(!p1)||p5)))&&p4)))))'
Stuttering acceptance computed with spot in 434 ms :[(OR (NOT p0) (AND p1 (NOT p4)) (AND p1 (NOT p5))), true, (NOT p0), (AND p1 (NOT p5)), (AND p1 (NOT p2)), (OR (AND p1 p2 (NOT p4)) (AND p1 p4 (NOT p5))), (AND p1 (NOT p5)), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m04-LTLFireability-08
Product exploration explored 100000 steps with 40056 reset in 505 ms.
Product exploration explored 100000 steps with 40034 reset in 548 ms.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 494 edges and 136 vertex of which 135 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 32 factoid took 105 ms. Proved property starting from automaton with 8 states, 21 edges and 5 AP (stutter sensitive
Knowledge-based reduction took 110 ms.
FORMULA DBSingleClientW-PT-d2m04-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d2m04-LTLFireability-08 finished in 54664 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 U (F(p1) U p2))&&X(X(F(p3)))))))'
Support contains 6 out of 224 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 450/450 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 198 transition count 350
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 198 transition count 350
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 55 place count 198 transition count 347
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 75 place count 178 transition count 325
Iterating global reduction 1 with 20 rules applied. Total rules applied 95 place count 178 transition count 325
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 105 place count 178 transition count 315
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 122 place count 161 transition count 275
Iterating global reduction 2 with 17 rules applied. Total rules applied 139 place count 161 transition count 275
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 149 place count 161 transition count 265
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 158 place count 152 transition count 237
Iterating global reduction 3 with 9 rules applied. Total rules applied 167 place count 152 transition count 237
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 171 place count 152 transition count 233
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 176 place count 147 transition count 228
Iterating global reduction 4 with 5 rules applied. Total rules applied 181 place count 147 transition count 228
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 183 place count 147 transition count 226
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 185 place count 145 transition count 224
Iterating global reduction 5 with 2 rules applied. Total rules applied 187 place count 145 transition count 224
Applied a total of 187 rules in 16 ms. Remains 145 /224 variables (removed 79) and now considering 224/450 (removed 226) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5169291252641507476.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9049913892611652191.kers'
[2026-05-24 04:57:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5169291252641507476.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9049913892611652191.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 224 rows 145 cols 713 entries
Finished phase 1 with 141 SingleSign rule and 2 generalized
[2026-05-24 04:57:37] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9049913892611652191.kers
Total runtime 2 ms.
[2026-05-24 04:57:38] [INFO ] Implicit Places using invariants in 181 ms returned []
[2026-05-24 04:57:38] [INFO ] Invariant cache hit.
[2026-05-24 04:57:38] [INFO ] State equation strengthened by 84 read => feed constraints.
[2026-05-24 04:57:39] [INFO ] Implicit Places using invariants and state equation in 1355 ms returned []
Implicit Place search using SMT with State Equation took 1549 ms to find 0 implicit places.
Running 223 sub problems to find dead transitions.
[2026-05-24 04:57:39] [INFO ] Invariant cache hit.
[2026-05-24 04:57:39] [INFO ] State equation strengthened by 84 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (OVERLAPS) 1/145 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (OVERLAPS) 224/369 variables, 145/147 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/369 variables, 84/231 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/369 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (OVERLAPS) 0/369 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 223 unsolved
No progress, stopping.
After SMT solving in domain Real declared 369/369 variables, and 231 constraints, problems are : Problem set: 0 solved, 223 unsolved in 24793 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 145/145 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (OVERLAPS) 1/145 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (OVERLAPS) 224/369 variables, 145/147 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/369 variables, 84/231 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/369 variables, 223/454 constraints. Problems are: Problem set: 0 solved, 223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 369/369 variables, and 454 constraints, problems are : Problem set: 0 solved, 223 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 145/145 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55007ms problems are : Problem set: 0 solved, 223 unsolved
Search for dead transitions found 0 dead transitions in 55009ms
Starting structural reductions in LTL mode, iteration 1 : 145/224 places, 224/450 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56575 ms. Remains : 145/224 places, 224/450 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((p0 U (F(p1) U p2))&&X(X(F(p3)))))))'
Stuttering acceptance computed with spot in 404 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (NOT p1), (NOT p2), (NOT p3), (NOT p2), (NOT p3)]
Running random walk in product with property : DBSingleClientW-PT-d2m04-LTLFireability-09
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m04-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m04-LTLFireability-09 finished in 57045 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p1))||p0)))'
Support contains 4 out of 224 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 450/450 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 194 transition count 330
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 194 transition count 330
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 63 place count 194 transition count 327
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 87 place count 170 transition count 301
Iterating global reduction 1 with 24 rules applied. Total rules applied 111 place count 170 transition count 301
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 122 place count 170 transition count 290
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 144 place count 148 transition count 237
Iterating global reduction 2 with 22 rules applied. Total rules applied 166 place count 148 transition count 237
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 177 place count 148 transition count 226
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 189 place count 136 transition count 190
Iterating global reduction 3 with 12 rules applied. Total rules applied 201 place count 136 transition count 190
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 203 place count 136 transition count 188
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 211 place count 128 transition count 180
Iterating global reduction 4 with 8 rules applied. Total rules applied 219 place count 128 transition count 180
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 221 place count 128 transition count 178
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 225 place count 124 transition count 174
Iterating global reduction 5 with 4 rules applied. Total rules applied 229 place count 124 transition count 174
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 232 place count 124 transition count 171
Applied a total of 232 rules in 15 ms. Remains 124 /224 variables (removed 100) and now considering 171/450 (removed 279) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2116483968559882900.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15481466760084392758.kers'
[2026-05-24 04:58:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2116483968559882900.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15481466760084392758.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 171 rows 124 cols 568 entries
Finished phase 1 with 120 SingleSign rule and 2 generalized
[2026-05-24 04:58:35] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15481466760084392758.kers
Total runtime 2 ms.
[2026-05-24 04:58:35] [INFO ] Implicit Places using invariants in 166 ms returned []
[2026-05-24 04:58:35] [INFO ] Invariant cache hit.
[2026-05-24 04:58:35] [INFO ] State equation strengthened by 52 read => feed constraints.
[2026-05-24 04:58:35] [INFO ] Implicit Places using invariants and state equation in 486 ms returned []
Implicit Place search using SMT with State Equation took 655 ms to find 0 implicit places.
Running 170 sub problems to find dead transitions.
[2026-05-24 04:58:35] [INFO ] Invariant cache hit.
[2026-05-24 04:58:35] [INFO ] State equation strengthened by 52 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (OVERLAPS) 171/295 variables, 124/126 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 52/178 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/295 variables, 2/180 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/295 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/295 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/295 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 10 (OVERLAPS) 0/295 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Real declared 295/295 variables, and 182 constraints, problems are : Problem set: 0 solved, 170 unsolved in 24459 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 124/124 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 170 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (OVERLAPS) 1/124 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (OVERLAPS) 171/295 variables, 124/130 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/295 variables, 52/182 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/295 variables, 170/352 constraints. Problems are: Problem set: 0 solved, 170 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 295/295 variables, and 352 constraints, problems are : Problem set: 0 solved, 170 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 124/124 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 54573ms problems are : Problem set: 0 solved, 170 unsolved
Search for dead transitions found 0 dead transitions in 54575ms
Starting structural reductions in LTL mode, iteration 1 : 124/224 places, 171/450 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55246 ms. Remains : 124/224 places, 171/450 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p1))||p0)))'
Stuttering acceptance computed with spot in 179 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d2m04-LTLFireability-10
Product exploration explored 100000 steps with 50000 reset in 282 ms.
Product exploration explored 100000 steps with 50000 reset in 302 ms.
Computed a total of 5 stabilizing places and 15 stable transitions
Graph (complete) has 445 edges and 124 vertex of which 123 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 15 stable transitions
Knowledge based reduction with 3 factoid took 70 ms. Proved property starting from automaton with 4 states, 5 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 73 ms.
FORMULA DBSingleClientW-PT-d2m04-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d2m04-LTLFireability-10 finished in 56138 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((F((X(G(!p1)) U p2))&&F(p3)))||p0)))'
Support contains 5 out of 224 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 : 224/224 places, 450/450 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 198 transition count 342
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 198 transition count 342
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 55 place count 198 transition count 339
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 75 place count 178 transition count 317
Iterating global reduction 1 with 20 rules applied. Total rules applied 95 place count 178 transition count 317
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 105 place count 178 transition count 307
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 124 place count 159 transition count 260
Iterating global reduction 2 with 19 rules applied. Total rules applied 143 place count 159 transition count 260
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 151 place count 159 transition count 252
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 160 place count 150 transition count 231
Iterating global reduction 3 with 9 rules applied. Total rules applied 169 place count 150 transition count 231
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 175 place count 150 transition count 225
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 182 place count 143 transition count 218
Iterating global reduction 4 with 7 rules applied. Total rules applied 189 place count 143 transition count 218
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 191 place count 143 transition count 216
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 195 place count 139 transition count 212
Iterating global reduction 5 with 4 rules applied. Total rules applied 199 place count 139 transition count 212
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 200 place count 139 transition count 211
Applied a total of 200 rules in 33 ms. Remains 139 /224 variables (removed 85) and now considering 211/450 (removed 239) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15695720653767609165.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4269317594994367486.kers'
[2026-05-24 04:59:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15695720653767609165.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4269317594994367486.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 211 rows 139 cols 674 entries
Finished phase 1 with 135 SingleSign rule and 2 generalized
[2026-05-24 04:59:31] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4269317594994367486.kers
Total runtime 2 ms.
[2026-05-24 04:59:31] [INFO ] Implicit Places using invariants in 208 ms returned []
[2026-05-24 04:59:31] [INFO ] Invariant cache hit.
[2026-05-24 04:59:31] [INFO ] State equation strengthened by 78 read => feed constraints.
[2026-05-24 04:59:32] [INFO ] Implicit Places using invariants and state equation in 678 ms returned []
Implicit Place search using SMT with State Equation took 891 ms to find 0 implicit places.
[2026-05-24 04:59:32] [INFO ] Redundant transitions in 2 ms returned []
Running 210 sub problems to find dead transitions.
[2026-05-24 04:59:32] [INFO ] Invariant cache hit.
[2026-05-24 04:59:32] [INFO ] State equation strengthened by 78 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (OVERLAPS) 1/139 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (OVERLAPS) 211/350 variables, 139/141 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/350 variables, 78/219 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/350 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (OVERLAPS) 0/350 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 210 unsolved
No progress, stopping.
After SMT solving in domain Real declared 350/350 variables, and 219 constraints, problems are : Problem set: 0 solved, 210 unsolved in 27697 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 139/139 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 0/0 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/138 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (OVERLAPS) 1/139 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (OVERLAPS) 211/350 variables, 139/141 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/350 variables, 78/219 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/350 variables, 210/429 constraints. Problems are: Problem set: 0 solved, 210 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 350/350 variables, and 429 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: 139/139 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57843ms problems are : Problem set: 0 solved, 210 unsolved
Search for dead transitions found 0 dead transitions in 57844ms
Starting structural reductions in SI_LTL mode, iteration 1 : 139/224 places, 211/450 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 58777 ms. Remains : 139/224 places, 211/450 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((F((X(G(!p1)) U p2))&&F(p3)))||p0)))'
Stuttering acceptance computed with spot in 163 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (NOT p3), (NOT p2)]
Running random walk in product with property : DBSingleClientW-PT-d2m04-LTLFireability-12
Product exploration explored 100000 steps with 23089 reset in 486 ms.
Product exploration explored 100000 steps with 23068 reset in 452 ms.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 510 edges and 139 vertex of which 138 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge based reduction with 5 factoid took 76 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter insensitive) to 3 states, 5 edges and 3 AP (stutter insensitive).
RANDOM walk for 40000 steps (9228 resets) in 299 ms. (133 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1796 resets) in 115 ms. (344 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (3964 resets) in 122 ms. (325 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1743 resets) in 140 ms. (283 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1771 resets) in 122 ms. (325 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (1763 resets) in 122 ms. (325 steps per ms) remains 5/5 properties
Finished probabilistic random walk after 22732 steps, run visited all 5 properties in 166 ms. (steps per millisecond=136 )
Probabilistic random walk after 22732 steps, saw 10419 distinct states, run finished after 166 ms. (steps per millisecond=136 ) properties seen :5
Knowledge based reduction with 5 factoid took 139 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter insensitive) to 3 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (NOT p3), (NOT p2)]
Knowledge-based reduction took 840 ms.
Stuttering acceptance computed with spot in 109 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (NOT p3), (NOT p2)]
Support contains 5 out of 139 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 : 139/139 places, 211/211 transitions.
Applied a total of 0 rules in 6 ms. Remains 139 /139 variables (removed 0) and now considering 211/211 (removed 0) transitions.
[2026-05-24 05:00:32] [INFO ] Invariant cache hit.
[2026-05-24 05:00:32] [INFO ] Implicit Places using invariants in 211 ms returned []
[2026-05-24 05:00:32] [INFO ] Invariant cache hit.
[2026-05-24 05:00:32] [INFO ] State equation strengthened by 78 read => feed constraints.
[2026-05-24 05:00:33] [INFO ] Implicit Places using invariants and state equation in 855 ms returned []
Implicit Place search using SMT with State Equation took 1068 ms to find 0 implicit places.
[2026-05-24 05:00:33] [INFO ] Redundant transitions in 2 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1083 ms. Remains : 139/139 places, 211/211 transitions.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 510 edges and 139 vertex of which 138 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge based reduction with 5 factoid took 76 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter insensitive) to 3 states, 5 edges and 3 AP (stutter insensitive).
RANDOM walk for 40000 steps (9206 resets) in 397 ms. (100 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1838 resets) in 174 ms. (228 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (3802 resets) in 118 ms. (336 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1762 resets) in 84 ms. (470 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1775 resets) in 89 ms. (444 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1824 resets) in 77 ms. (512 steps per ms) remains 5/5 properties
Finished probabilistic random walk after 22732 steps, run visited all 5 properties in 267 ms. (steps per millisecond=85 )
Probabilistic random walk after 22732 steps, saw 10419 distinct states, run finished after 268 ms. (steps per millisecond=84 ) properties seen :5
Knowledge based reduction with 5 factoid took 142 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter insensitive) to 3 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 154 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (NOT p3), (NOT p2)]
Knowledge-based reduction took 972 ms.
Stuttering acceptance computed with spot in 135 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (NOT p3), (NOT p2)]
Stuttering acceptance computed with spot in 137 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (NOT p3), (NOT p2)]
Product exploration explored 100000 steps with 23052 reset in 466 ms.
Product exploration explored 100000 steps with 23017 reset in 422 ms.
Built C files in :
/tmp/ltsmin1717431857967730514
[2026-05-24 05:00:35] [INFO ] Computing symmetric may disable matrix : 211 transitions.
[2026-05-24 05:00:35] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 05:00:35] [INFO ] Computing symmetric may enable matrix : 211 transitions.
[2026-05-24 05:00:35] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 05:00:35] [INFO ] Computing Do-Not-Accords matrix : 211 transitions.
[2026-05-24 05:00:35] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 05:00:35] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1717431857967730514
Running compilation step : cd /tmp/ltsmin1717431857967730514;'/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 694 ms.
Running link step : cd /tmp/ltsmin1717431857967730514;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin1717431857967730514;'/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/stateBased5758482163032754533.hoa' '--buchi-type=spotba'
LTSmin run took 327 ms.
FORMULA DBSingleClientW-PT-d2m04-LTLFireability-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d2m04-LTLFireability-12 finished in 65285 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 224 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 224/224 places, 450/450 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 194 transition count 330
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 194 transition count 330
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 63 place count 194 transition count 327
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 87 place count 170 transition count 301
Iterating global reduction 1 with 24 rules applied. Total rules applied 111 place count 170 transition count 301
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 122 place count 170 transition count 290
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 144 place count 148 transition count 237
Iterating global reduction 2 with 22 rules applied. Total rules applied 166 place count 148 transition count 237
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 177 place count 148 transition count 226
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 188 place count 137 transition count 197
Iterating global reduction 3 with 11 rules applied. Total rules applied 199 place count 137 transition count 197
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 201 place count 137 transition count 195
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 209 place count 129 transition count 187
Iterating global reduction 4 with 8 rules applied. Total rules applied 217 place count 129 transition count 187
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 219 place count 129 transition count 185
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 223 place count 125 transition count 181
Iterating global reduction 5 with 4 rules applied. Total rules applied 227 place count 125 transition count 181
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 230 place count 125 transition count 178
Applied a total of 230 rules in 21 ms. Remains 125 /224 variables (removed 99) and now considering 178/450 (removed 272) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17670816505599944710.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12977670018187153098.kers'
[2026-05-24 05:00:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17670816505599944710.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12977670018187153098.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 178 rows 125 cols 581 entries
Finished phase 1 with 121 SingleSign rule and 2 generalized
[2026-05-24 05:00:36] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12977670018187153098.kers
Total runtime 1 ms.
[2026-05-24 05:00:36] [INFO ] Implicit Places using invariants in 158 ms returned []
[2026-05-24 05:00:36] [INFO ] Invariant cache hit.
[2026-05-24 05:00:36] [INFO ] State equation strengthened by 59 read => feed constraints.
[2026-05-24 05:00:37] [INFO ] Implicit Places using invariants and state equation in 683 ms returned []
Implicit Place search using SMT with State Equation took 844 ms to find 0 implicit places.
[2026-05-24 05:00:37] [INFO ] Redundant transitions in 1 ms returned []
Running 177 sub problems to find dead transitions.
[2026-05-24 05:00:37] [INFO ] Invariant cache hit.
[2026-05-24 05:00:37] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (OVERLAPS) 178/303 variables, 125/127 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/303 variables, 59/186 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 6/192 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/303 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 9 (OVERLAPS) 0/303 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 303/303 variables, and 193 constraints, problems are : Problem set: 0 solved, 177 unsolved in 28230 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 125/125 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (OVERLAPS) 178/303 variables, 125/134 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 59/193 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/303 variables, 177/370 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 303/303 variables, and 370 constraints, problems are : Problem set: 0 solved, 177 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 125/125 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 58321ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 58322ms
Starting structural reductions in SI_LTL mode, iteration 1 : 125/224 places, 178/450 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 59195 ms. Remains : 125/224 places, 178/450 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m04-LTLFireability-13
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m04-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m04-LTLFireability-13 finished in 59287 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((X(p0)&&F(p1)))))'
Support contains 3 out of 224 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 450/450 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 196 transition count 342
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 196 transition count 342
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 59 place count 196 transition count 339
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 81 place count 174 transition count 315
Iterating global reduction 1 with 22 rules applied. Total rules applied 103 place count 174 transition count 315
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 114 place count 174 transition count 304
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 134 place count 154 transition count 254
Iterating global reduction 2 with 20 rules applied. Total rules applied 154 place count 154 transition count 254
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 164 place count 154 transition count 244
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 174 place count 144 transition count 211
Iterating global reduction 3 with 10 rules applied. Total rules applied 184 place count 144 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 188 place count 144 transition count 207
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 194 place count 138 transition count 201
Iterating global reduction 4 with 6 rules applied. Total rules applied 200 place count 138 transition count 201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 201 place count 138 transition count 200
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 204 place count 135 transition count 197
Iterating global reduction 5 with 3 rules applied. Total rules applied 207 place count 135 transition count 197
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 209 place count 135 transition count 195
Applied a total of 209 rules in 13 ms. Remains 135 /224 variables (removed 89) and now considering 195/450 (removed 255) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3170776754578205689.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5561940679719370393.kers'
[2026-05-24 05:01:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3170776754578205689.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5561940679719370393.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 195 rows 135 cols 635 entries
Finished phase 1 with 131 SingleSign rule and 2 generalized
[2026-05-24 05:01:35] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5561940679719370393.kers
Total runtime 2 ms.
[2026-05-24 05:01:35] [INFO ] Implicit Places using invariants in 213 ms returned []
[2026-05-24 05:01:35] [INFO ] Invariant cache hit.
[2026-05-24 05:01:36] [INFO ] State equation strengthened by 66 read => feed constraints.
[2026-05-24 05:01:37] [INFO ] Implicit Places using invariants and state equation in 1120 ms returned []
Implicit Place search using SMT with State Equation took 1336 ms to find 0 implicit places.
Running 194 sub problems to find dead transitions.
[2026-05-24 05:01:37] [INFO ] Invariant cache hit.
[2026-05-24 05:01:37] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (OVERLAPS) 195/330 variables, 135/137 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/330 variables, 66/203 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/330 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (OVERLAPS) 0/330 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/330 variables, and 203 constraints, problems are : Problem set: 0 solved, 194 unsolved in 16013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 135/135 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 194 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (OVERLAPS) 195/330 variables, 135/137 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/330 variables, 66/203 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/330 variables, 194/397 constraints. Problems are: Problem set: 0 solved, 194 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 330/330 variables, and 397 constraints, problems are : Problem set: 0 solved, 194 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 135/135 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46209ms problems are : Problem set: 0 solved, 194 unsolved
Search for dead transitions found 0 dead transitions in 46211ms
Starting structural reductions in LTL mode, iteration 1 : 135/224 places, 195/450 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47562 ms. Remains : 135/224 places, 195/450 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((X(p0)&&F(p1)))))'
Stuttering acceptance computed with spot in 226 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d2m04-LTLFireability-14
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m04-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m04-LTLFireability-14 finished in 47851 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(!(X(!p0) U X(p1)))||!(X(p1) U p0)))'
Support contains 3 out of 224 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 450/450 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 196 transition count 332
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 196 transition count 332
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 59 place count 196 transition count 329
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 81 place count 174 transition count 305
Iterating global reduction 1 with 22 rules applied. Total rules applied 103 place count 174 transition count 305
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 114 place count 174 transition count 294
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 134 place count 154 transition count 247
Iterating global reduction 2 with 20 rules applied. Total rules applied 154 place count 154 transition count 247
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 164 place count 154 transition count 237
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 174 place count 144 transition count 209
Iterating global reduction 3 with 10 rules applied. Total rules applied 184 place count 144 transition count 209
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 186 place count 144 transition count 207
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 193 place count 137 transition count 200
Iterating global reduction 4 with 7 rules applied. Total rules applied 200 place count 137 transition count 200
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 201 place count 137 transition count 199
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 205 place count 133 transition count 195
Iterating global reduction 5 with 4 rules applied. Total rules applied 209 place count 133 transition count 195
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 212 place count 133 transition count 192
Applied a total of 212 rules in 21 ms. Remains 133 /224 variables (removed 91) and now considering 192/450 (removed 258) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16390351632813014680.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8512240025498453331.kers'
[2026-05-24 05:02:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16390351632813014680.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8512240025498453331.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 192 rows 133 cols 629 entries
Finished phase 1 with 129 SingleSign rule and 2 generalized
[2026-05-24 05:02:23] [INFO ] Computed 2 invariants in 2 ms
Computed 2 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-8512240025498453331.kers
Total runtime 3 ms.
[2026-05-24 05:02:23] [INFO ] Implicit Places using invariants in 259 ms returned []
[2026-05-24 05:02:23] [INFO ] Invariant cache hit.
[2026-05-24 05:02:23] [INFO ] State equation strengthened by 63 read => feed constraints.
[2026-05-24 05:02:24] [INFO ] Implicit Places using invariants and state equation in 939 ms returned []
Implicit Place search using SMT with State Equation took 1215 ms to find 0 implicit places.
Running 191 sub problems to find dead transitions.
[2026-05-24 05:02:24] [INFO ] Invariant cache hit.
[2026-05-24 05:02:24] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (OVERLAPS) 192/325 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/325 variables, 63/198 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 6/204 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 4/208 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/325 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 191 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 9 (OVERLAPS) 0/325 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Real declared 325/325 variables, and 208 constraints, problems are : Problem set: 0 solved, 191 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 191 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (OVERLAPS) 1/133 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 6 (OVERLAPS) 192/325 variables, 133/145 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 63/208 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/325 variables, 191/399 constraints. Problems are: Problem set: 0 solved, 191 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 325/325 variables, and 399 constraints, problems are : Problem set: 0 solved, 191 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60143ms problems are : Problem set: 0 solved, 191 unsolved
Search for dead transitions found 0 dead transitions in 60145ms
Starting structural reductions in LTL mode, iteration 1 : 133/224 places, 192/450 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61382 ms. Remains : 133/224 places, 192/450 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(!(X(!p0) U X(p1)))||!(X(p1) U p0)))'
Stuttering acceptance computed with spot in 166 ms :[(AND p0 p1), p1, (AND p0 p1)]
Running random walk in product with property : DBSingleClientW-PT-d2m04-LTLFireability-15
Product exploration explored 100000 steps with 50000 reset in 562 ms.
Product exploration explored 100000 steps with 50000 reset in 344 ms.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 482 edges and 133 vertex of which 132 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
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 11 factoid took 22 ms. Proved property starting from automaton with 3 states, 6 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 25 ms.
FORMULA DBSingleClientW-PT-d2m04-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d2m04-LTLFireability-15 finished in 62533 ms.
All properties solved by simple procedures.
Total runtime 866650 ms.

BK_STOP 1779599006156

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
++ perl -pe 's/.*\.//g'
+ 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-d2m04"
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-d2m04, 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-177946993600196"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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