About the Execution of ITS-Tools for DBSingleClientW-PT-d1m04
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 508.852 | 305197.00 | 351046.00 | 945.60 | FFFTFFFTFFFFFTTT | normal |
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-177946993600139.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-d1m04, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r082-smll-177946993600139
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 960K
-rw-r--r-- 1 mcc users 8.4K Mar 6 18:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Mar 6 18:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Mar 6 18:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K Mar 6 18:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 08:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 08:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 08:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 08:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 6 18:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Mar 6 18:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 6 18:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 106K Mar 6 18:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 08:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 08:47 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 432K 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-d1m04-LTLCardinality-00
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLCardinality-01
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLCardinality-02
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLCardinality-03
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLCardinality-04
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLCardinality-05
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLCardinality-06
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLCardinality-07
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLCardinality-08
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLCardinality-09
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLCardinality-10
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLCardinality-11
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLCardinality-12
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLCardinality-13
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLCardinality-14
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1779564532734
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d1m04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-23 19:28:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-23 19:28:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 19:28:55] [INFO ] Load time of PNML (sax parser for PT used): 282 ms
[2026-05-23 19:28:55] [INFO ] Transformed 1440 places.
[2026-05-23 19:28:55] [INFO ] Transformed 672 transitions.
[2026-05-23 19:28:55] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 540 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 1093 places in 8 ms
Reduce places removed 1093 places and 0 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA DBSingleClientW-PT-d1m04-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 11 out of 347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 672/672 transitions.
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 78 transitions
Reduce isomorphic transitions removed 78 transitions.
Iterating post reduction 0 with 98 rules applied. Total rules applied 98 place count 327 transition count 594
Discarding 93 places :
Symmetric choice reduction at 1 with 93 rule applications. Total rules 191 place count 234 transition count 335
Iterating global reduction 1 with 93 rules applied. Total rules applied 284 place count 234 transition count 335
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 288 place count 234 transition count 331
Discarding 67 places :
Symmetric choice reduction at 2 with 67 rule applications. Total rules 355 place count 167 transition count 264
Iterating global reduction 2 with 67 rules applied. Total rules applied 422 place count 167 transition count 264
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 428 place count 167 transition count 258
Discarding 35 places :
Symmetric choice reduction at 3 with 35 rule applications. Total rules 463 place count 132 transition count 206
Iterating global reduction 3 with 35 rules applied. Total rules applied 498 place count 132 transition count 206
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 3 with 18 rules applied. Total rules applied 516 place count 132 transition count 188
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 524 place count 124 transition count 173
Iterating global reduction 4 with 8 rules applied. Total rules applied 532 place count 124 transition count 173
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 534 place count 124 transition count 171
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 538 place count 120 transition count 167
Iterating global reduction 5 with 4 rules applied. Total rules applied 542 place count 120 transition count 167
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 544 place count 120 transition count 165
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 547 place count 117 transition count 162
Iterating global reduction 6 with 3 rules applied. Total rules applied 550 place count 117 transition count 162
Applied a total of 550 rules in 137 ms. Remains 117 /347 variables (removed 230) and now considering 162/672 (removed 510) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15676311894341239428.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2350863297592312764.kers'
[2026-05-23 19:28:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15676311894341239428.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2350863297592312764.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 162 rows 117 cols 526 entries
Finished phase 1 with 113 SingleSign rule and 2 generalized
[2026-05-23 19:28:56] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-2350863297592312764.kers
Total runtime 3 ms.
[2026-05-23 19:28:56] [INFO ] Implicit Places using invariants in 476 ms returned []
[2026-05-23 19:28:56] [INFO ] Invariant cache hit.
[2026-05-23 19:28:56] [INFO ] State equation strengthened by 55 read => feed constraints.
[2026-05-23 19:28:57] [INFO ] Implicit Places using invariants and state equation in 894 ms returned []
Implicit Place search using SMT with State Equation took 1440 ms to find 0 implicit places.
Running 161 sub problems to find dead transitions.
[2026-05-23 19:28:57] [INFO ] Invariant cache hit.
[2026-05-23 19:28:57] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (OVERLAPS) 162/278 variables, 116/118 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 55/173 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 7 (OVERLAPS) 1/279 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/279 variables, 3/177 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/279 variables, 5/182 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/279 variables, 3/185 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/279 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 161 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 279/279 variables, and 185 constraints, problems are : Problem set: 0 solved, 161 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 117/117 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 161 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (OVERLAPS) 162/278 variables, 116/129 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 55/184 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/278 variables, 152/336 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/278 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 9 (OVERLAPS) 1/279 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 161 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 279/279 variables, and 346 constraints, problems are : Problem set: 0 solved, 161 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 117/117 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60630ms problems are : Problem set: 0 solved, 161 unsolved
Search for dead transitions found 0 dead transitions in 60654ms
Starting structural reductions in LTL mode, iteration 1 : 117/347 places, 162/672 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62293 ms. Remains : 117/347 places, 162/672 transitions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 162/162 transitions.
Applied a total of 0 rules in 5 ms. Remains 117 /117 variables (removed 0) and now considering 162/162 (removed 0) transitions.
[2026-05-23 19:29:58] [INFO ] Invariant cache hit.
[2026-05-23 19:29:58] [INFO ] Implicit Places using invariants in 212 ms returned []
[2026-05-23 19:29:58] [INFO ] Invariant cache hit.
[2026-05-23 19:29:58] [INFO ] State equation strengthened by 55 read => feed constraints.
[2026-05-23 19:29:59] [INFO ] Implicit Places using invariants and state equation in 483 ms returned []
Implicit Place search using SMT with State Equation took 697 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 703 ms. Remains : 117/117 places, 162/162 transitions.
Support contains 11 out of 117 places after structural reductions.
[2026-05-23 19:29:59] [INFO ] Flatten gal took : 61 ms
[2026-05-23 19:29:59] [INFO ] Flatten gal took : 28 ms
[2026-05-23 19:29:59] [INFO ] Input system was already deterministic with 162 transitions.
RANDOM walk for 40000 steps (9160 resets) in 2122 ms. (18 steps per ms) remains 5/9 properties
BEST_FIRST walk for 40003 steps (4076 resets) in 414 ms. (96 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (3886 resets) in 119 ms. (333 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (3820 resets) in 167 ms. (238 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (3826 resets) in 118 ms. (336 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40002 steps (3870 resets) in 112 ms. (354 steps per ms) remains 4/4 properties
[2026-05-23 19:30:00] [INFO ] Invariant cache hit.
[2026-05-23 19:30:00] [INFO ] State equation strengthened by 55 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp0 is UNSAT
At refinement iteration 1 (OVERLAPS) 42/46 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 36/82 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 123/205 variables, 82/84 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 16/100 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 0/100 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 69/274 variables, 32/132 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/274 variables, 37/169 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/274 variables, 0/169 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 5/279 variables, 3/172 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/279 variables, 2/174 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/279 variables, 0/174 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/279 variables, 0/174 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 279/279 variables, and 174 constraints, problems are : Problem set: 1 solved, 3 unsolved in 353 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 117/117 constraints, ReadFeed: 55/55 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/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 43/46 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 36/82 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 3/5 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 123/205 variables, 82/87 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 16/103 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 2/105 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 0/105 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 69/274 variables, 32/137 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/274 variables, 37/174 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/274 variables, 1/175 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/274 variables, 0/175 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 5/279 variables, 3/178 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/279 variables, 2/180 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/279 variables, 0/180 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/279 variables, 0/180 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 279/279 variables, and 180 constraints, problems are : Problem set: 1 solved, 3 unsolved in 1001 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 117/117 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1361ms problems are : Problem set: 1 solved, 3 unsolved
Parikh walk visited 1 properties in 469 ms.
Support contains 2 out of 117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 162/162 transitions.
Graph (complete) has 370 edges and 117 vertex of which 115 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 115 transition count 159
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 11 place count 108 transition count 152
Iterating global reduction 1 with 7 rules applied. Total rules applied 18 place count 108 transition count 152
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 25 place count 101 transition count 137
Iterating global reduction 1 with 7 rules applied. Total rules applied 32 place count 101 transition count 137
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 34 place count 101 transition count 135
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 41 place count 94 transition count 127
Iterating global reduction 2 with 7 rules applied. Total rules applied 48 place count 94 transition count 127
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 50 place count 94 transition count 125
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 56 place count 88 transition count 118
Iterating global reduction 3 with 6 rules applied. Total rules applied 62 place count 88 transition count 118
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 66 place count 88 transition count 114
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 67 place count 87 transition count 113
Iterating global reduction 4 with 1 rules applied. Total rules applied 68 place count 87 transition count 113
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 69 place count 86 transition count 111
Iterating global reduction 4 with 1 rules applied. Total rules applied 70 place count 86 transition count 111
Applied a total of 70 rules in 78 ms. Remains 86 /117 variables (removed 31) and now considering 111/162 (removed 51) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 86/117 places, 111/162 transitions.
RANDOM walk for 40000 steps (9266 resets) in 215 ms. (185 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (4085 resets) in 149 ms. (266 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3906 resets) in 158 ms. (251 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 10449 steps, run visited all 2 properties in 106 ms. (steps per millisecond=98 )
Probabilistic random walk after 10449 steps, saw 4773 distinct states, run finished after 116 ms. (steps per millisecond=90 ) properties seen :2
Successfully simplified 1 atomic propositions for a total of 6 simplifications.
Computed a total of 5 stabilizing places and 15 stable transitions
Graph (complete) has 401 edges and 117 vertex of which 115 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0&&X(X(p1))))'
Support contains 3 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 162/162 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 116 transition count 161
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 9 place count 109 transition count 154
Iterating global reduction 1 with 7 rules applied. Total rules applied 16 place count 109 transition count 154
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 17 place count 109 transition count 153
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 23 place count 103 transition count 139
Iterating global reduction 2 with 6 rules applied. Total rules applied 29 place count 103 transition count 139
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 31 place count 103 transition count 137
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 36 place count 98 transition count 132
Iterating global reduction 3 with 5 rules applied. Total rules applied 41 place count 98 transition count 132
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 42 place count 98 transition count 131
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 46 place count 94 transition count 126
Iterating global reduction 4 with 4 rules applied. Total rules applied 50 place count 94 transition count 126
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 52 place count 94 transition count 124
Applied a total of 52 rules in 19 ms. Remains 94 /117 variables (removed 23) and now considering 124/162 (removed 38) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2207421869331688312.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11100352683029021144.kers'
[2026-05-23 19:30:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2207421869331688312.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11100352683029021144.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 124 rows 94 cols 399 entries
Finished phase 1 with 90 SingleSign rule and 2 generalized
[2026-05-23 19:30:03] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11100352683029021144.kers
Total runtime 2 ms.
[2026-05-23 19:30:03] [INFO ] Implicit Places using invariants in 147 ms returned []
[2026-05-23 19:30:03] [INFO ] Invariant cache hit.
[2026-05-23 19:30:03] [INFO ] State equation strengthened by 43 read => feed constraints.
[2026-05-23 19:30:03] [INFO ] Implicit Places using invariants and state equation in 317 ms returned []
Implicit Place search using SMT with State Equation took 476 ms to find 0 implicit places.
Running 123 sub problems to find dead transitions.
[2026-05-23 19:30:03] [INFO ] Invariant cache hit.
[2026-05-23 19:30:03] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (OVERLAPS) 124/218 variables, 94/96 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 43/139 constraints. Problems are: Problem set: 0 solved, 123 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (OVERLAPS) 0/218 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 218/218 variables, and 139 constraints, problems are : Problem set: 0 solved, 123 unsolved in 7470 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 94/94 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (OVERLAPS) 124/218 variables, 94/96 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 43/139 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 123/262 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (OVERLAPS) 0/218 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 218/218 variables, and 262 constraints, problems are : Problem set: 0 solved, 123 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 94/94 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37654ms problems are : Problem set: 0 solved, 123 unsolved
Search for dead transitions found 0 dead transitions in 37659ms
Starting structural reductions in LTL mode, iteration 1 : 94/117 places, 124/162 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38162 ms. Remains : 94/117 places, 124/162 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0&&X(X(p1))))'
Stuttering acceptance computed with spot in 355 ms :[(NOT p1), (NOT p1), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d1m04-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA DBSingleClientW-PT-d1m04-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m04-LTLCardinality-01 finished in 38653 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 1 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 162/162 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 116 transition count 161
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 108 transition count 153
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 108 transition count 153
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 19 place count 108 transition count 152
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 26 place count 101 transition count 138
Iterating global reduction 2 with 7 rules applied. Total rules applied 33 place count 101 transition count 138
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 36 place count 101 transition count 135
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 42 place count 95 transition count 128
Iterating global reduction 3 with 6 rules applied. Total rules applied 48 place count 95 transition count 128
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 50 place count 95 transition count 126
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 56 place count 89 transition count 114
Iterating global reduction 4 with 6 rules applied. Total rules applied 62 place count 89 transition count 114
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 66 place count 89 transition count 110
Applied a total of 66 rules in 14 ms. Remains 89 /117 variables (removed 28) and now considering 110/162 (removed 52) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13754781495495376026.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9568235641957178653.kers'
[2026-05-23 19:30:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13754781495495376026.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9568235641957178653.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 110 rows 89 cols 362 entries
Finished phase 1 with 85 SingleSign rule and 2 generalized
[2026-05-23 19:30:41] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9568235641957178653.kers
Total runtime 1 ms.
[2026-05-23 19:30:42] [INFO ] Implicit Places using invariants in 393 ms returned []
[2026-05-23 19:30:42] [INFO ] Invariant cache hit.
[2026-05-23 19:30:42] [INFO ] State equation strengthened by 34 read => feed constraints.
[2026-05-23 19:30:42] [INFO ] Implicit Places using invariants and state equation in 451 ms returned []
Implicit Place search using SMT with State Equation took 858 ms to find 0 implicit places.
Running 109 sub problems to find dead transitions.
[2026-05-23 19:30:42] [INFO ] Invariant cache hit.
[2026-05-23 19:30:42] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 110/199 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 34/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (OVERLAPS) 0/199 variables, 5/130 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (OVERLAPS) 0/199 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/199 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 11 (OVERLAPS) 0/199 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/199 variables, and 131 constraints, problems are : Problem set: 0 solved, 109 unsolved in 13390 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (OVERLAPS) 110/199 variables, 89/97 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 34/131 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 109/240 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (OVERLAPS) 0/199 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 199/199 variables, and 240 constraints, problems are : Problem set: 0 solved, 109 unsolved in 26462 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39923ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 39925ms
Starting structural reductions in LTL mode, iteration 1 : 89/117 places, 110/162 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40798 ms. Remains : 89/117 places, 110/162 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m04-LTLCardinality-03
Product exploration explored 100000 steps with 28540 reset in 524 ms.
Product exploration explored 100000 steps with 28584 reset in 222 ms.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 298 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge based reduction with 1 factoid took 55 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (9197 resets) in 267 ms. (149 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3910 resets) in 151 ms. (263 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 15217 steps, run visited all 1 properties in 43 ms. (steps per millisecond=353 )
Probabilistic random walk after 15217 steps, saw 6791 distinct states, run finished after 43 ms. (steps per millisecond=353 ) properties seen :1
Knowledge based reduction with 1 factoid took 61 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 465 ms.
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 110/110 transitions.
Applied a total of 0 rules in 8 ms. Remains 89 /89 variables (removed 0) and now considering 110/110 (removed 0) transitions.
[2026-05-23 19:31:24] [INFO ] Invariant cache hit.
[2026-05-23 19:31:24] [INFO ] Implicit Places using invariants in 131 ms returned []
[2026-05-23 19:31:24] [INFO ] Invariant cache hit.
[2026-05-23 19:31:24] [INFO ] State equation strengthened by 34 read => feed constraints.
[2026-05-23 19:31:24] [INFO ] Implicit Places using invariants and state equation in 410 ms returned []
Implicit Place search using SMT with State Equation took 544 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 553 ms. Remains : 89/89 places, 110/110 transitions.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 298 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge based reduction with 1 factoid took 71 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (9175 resets) in 119 ms. (333 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3933 resets) in 90 ms. (439 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 15217 steps, run visited all 1 properties in 46 ms. (steps per millisecond=330 )
Probabilistic random walk after 15217 steps, saw 6791 distinct states, run finished after 46 ms. (steps per millisecond=330 ) properties seen :1
Knowledge based reduction with 1 factoid took 78 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 441 ms.
Stuttering acceptance computed with spot in 190 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 168 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 28573 reset in 135 ms.
Product exploration explored 100000 steps with 28569 reset in 140 ms.
Spot run failed in 139 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/ltsmin3886836558504046145
[2026-05-23 19:31:25] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3886836558504046145
Running compilation step : cd /tmp/ltsmin3886836558504046145;'/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 679 ms.
Running link step : cd /tmp/ltsmin3886836558504046145;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 81 ms.
Running LTSmin : cd /tmp/ltsmin3886836558504046145;'/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/stateBased16031138851081951649.hoa' '--buchi-type=spotba'
LTSmin run took 77 ms.
FORMULA DBSingleClientW-PT-d1m04-LTLCardinality-03 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d1m04-LTLCardinality-03 finished in 45079 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||G(p1)||X((G(!p1) U (p0&&G(!p1)))))))'
Support contains 2 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 162/162 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 116 transition count 161
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 9 place count 109 transition count 154
Iterating global reduction 1 with 7 rules applied. Total rules applied 16 place count 109 transition count 154
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 23 place count 102 transition count 141
Iterating global reduction 1 with 7 rules applied. Total rules applied 30 place count 102 transition count 141
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 33 place count 102 transition count 138
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 39 place count 96 transition count 131
Iterating global reduction 2 with 6 rules applied. Total rules applied 45 place count 96 transition count 131
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 47 place count 96 transition count 129
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 52 place count 91 transition count 123
Iterating global reduction 3 with 5 rules applied. Total rules applied 57 place count 91 transition count 123
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 60 place count 91 transition count 120
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 61 place count 90 transition count 119
Iterating global reduction 4 with 1 rules applied. Total rules applied 62 place count 90 transition count 119
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 63 place count 89 transition count 117
Iterating global reduction 4 with 1 rules applied. Total rules applied 64 place count 89 transition count 117
Applied a total of 64 rules in 19 ms. Remains 89 /117 variables (removed 28) and now considering 117/162 (removed 45) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6900300853248845236.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8696888334498457532.kers'
[2026-05-23 19:31:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6900300853248845236.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8696888334498457532.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 117 rows 89 cols 380 entries
Finished phase 1 with 85 SingleSign rule and 2 generalized
[2026-05-23 19:31:26] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8696888334498457532.kers
Total runtime 2 ms.
[2026-05-23 19:31:26] [INFO ] Implicit Places using invariants in 141 ms returned []
[2026-05-23 19:31:26] [INFO ] Invariant cache hit.
[2026-05-23 19:31:27] [INFO ] State equation strengthened by 39 read => feed constraints.
[2026-05-23 19:31:27] [INFO ] Implicit Places using invariants and state equation in 431 ms returned []
Implicit Place search using SMT with State Equation took 576 ms to find 0 implicit places.
Running 116 sub problems to find dead transitions.
[2026-05-23 19:31:27] [INFO ] Invariant cache hit.
[2026-05-23 19:31:27] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (OVERLAPS) 117/206 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 39/130 constraints. Problems are: Problem set: 0 solved, 116 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (OVERLAPS) 0/206 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/206 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 10 (OVERLAPS) 0/206 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 132 constraints, problems are : Problem set: 0 solved, 116 unsolved in 11662 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (OVERLAPS) 117/206 variables, 89/93 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 39/132 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 116/248 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (OVERLAPS) 0/206 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 248 constraints, problems are : Problem set: 0 solved, 116 unsolved in 26652 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 38391ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 38393ms
Starting structural reductions in LTL mode, iteration 1 : 89/117 places, 117/162 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38989 ms. Remains : 89/117 places, 117/162 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||G(p1)||X((G(!p1) U (p0&&G(!p1)))))))'
Stuttering acceptance computed with spot in 207 ms :[(AND (NOT p0) (NOT p1)), (OR (NOT p0) p1), false, true, p1, (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d1m04-LTLCardinality-05
Product exploration explored 100000 steps with 23149 reset in 475 ms.
Product exploration explored 100000 steps with 23022 reset in 306 ms.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 305 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge based reduction with 9 factoid took 63 ms. Reduced automaton from 6 states, 13 edges and 2 AP (stutter sensitive) to 6 states, 13 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (9176 resets) in 290 ms. (137 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (3910 resets) in 171 ms. (232 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40003 steps (4028 resets) in 137 ms. (289 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (3952 resets) in 146 ms. (272 steps per ms) remains 3/3 properties
[2026-05-23 19:32:07] [INFO ] Invariant cache hit.
[2026-05-23 19:32:07] [INFO ] State equation strengthened by 39 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 33/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 26/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 86/147 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 55/202 variables, 26/97 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 29/126 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/202 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 4/206 variables, 2/128 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/206 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/206 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/206 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 130 constraints, problems are : Problem set: 0 solved, 3 unsolved in 257 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 33/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 26/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 86/147 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 55/202 variables, 26/98 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/202 variables, 29/127 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/202 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/202 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 4/206 variables, 2/131 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/206 variables, 2/133 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/206 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/206 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 133 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1011 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1299ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 194 ms.
Support contains 2 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 117/117 transitions.
Graph (complete) has 282 edges and 89 vertex of which 88 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 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 88 transition count 115
Applied a total of 3 rules in 13 ms. Remains 88 /89 variables (removed 1) and now considering 115/117 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 88/89 places, 115/117 transitions.
RANDOM walk for 40000 steps (9170 resets) in 269 ms. (148 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (3938 resets) in 198 ms. (201 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (3946 resets) in 232 ms. (171 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (3998 resets) in 233 ms. (170 steps per ms) remains 3/3 properties
Probably explored full state space saw : 11581 states, properties seen :2
Probabilistic random walk after 28567 steps, saw 11581 distinct states, run finished after 146 ms. (steps per millisecond=195 ) properties seen :2
Explored full state space saw : 11662 states, properties seen :0
Exhaustive walk after 28722 steps, saw 11662 distinct states, run finished after 63 ms. (steps per millisecond=455 ) properties seen :0
Found 1 invariant AP formulas.
Knowledge based reduction with 10 factoid took 141 ms. Reduced automaton from 6 states, 13 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p0) (NOT p1)), (OR (NOT p0) p1), true, p1, (NOT p1)]
Knowledge-based reduction took 2738 ms.
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p0) (NOT p1)), (OR (NOT p0) p1), true, p1, (NOT p1)]
Support contains 2 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 117/117 transitions.
Applied a total of 0 rules in 15 ms. Remains 89 /89 variables (removed 0) and now considering 117/117 (removed 0) transitions.
[2026-05-23 19:32:09] [INFO ] Invariant cache hit.
[2026-05-23 19:32:09] [INFO ] Implicit Places using invariants in 171 ms returned []
[2026-05-23 19:32:09] [INFO ] Invariant cache hit.
[2026-05-23 19:32:10] [INFO ] State equation strengthened by 39 read => feed constraints.
[2026-05-23 19:32:10] [INFO ] Implicit Places using invariants and state equation in 405 ms returned []
Implicit Place search using SMT with State Equation took 579 ms to find 0 implicit places.
[2026-05-23 19:32:10] [INFO ] Redundant transitions in 3 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 604 ms. Remains : 89/89 places, 117/117 transitions.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 305 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge based reduction with 13 factoid took 81 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 40000 steps (9163 resets) in 213 ms. (186 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40002 steps (3984 resets) in 86 ms. (459 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (3966 resets) in 63 ms. (625 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (3870 resets) in 65 ms. (606 steps per ms) remains 3/3 properties
[2026-05-23 19:32:10] [INFO ] Invariant cache hit.
[2026-05-23 19:32:10] [INFO ] State equation strengthened by 39 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 33/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 26/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 86/147 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 55/202 variables, 26/97 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 29/126 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/202 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 4/206 variables, 2/128 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/206 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/206 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/206 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 130 constraints, problems are : Problem set: 0 solved, 3 unsolved in 219 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 33/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 26/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 86/147 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 55/202 variables, 26/98 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/202 variables, 29/127 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/202 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/202 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 4/206 variables, 2/131 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/206 variables, 2/133 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/206 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/206 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 133 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1009 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1234ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 127 ms.
Support contains 2 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 117/117 transitions.
Graph (complete) has 282 edges and 89 vertex of which 88 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 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 88 transition count 115
Applied a total of 3 rules in 9 ms. Remains 88 /89 variables (removed 1) and now considering 115/117 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 88/89 places, 115/117 transitions.
RANDOM walk for 40000 steps (9226 resets) in 133 ms. (298 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (3924 resets) in 56 ms. (701 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (3962 resets) in 57 ms. (689 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (3922 resets) in 55 ms. (714 steps per ms) remains 3/3 properties
Probably explored full state space saw : 11581 states, properties seen :2
Probabilistic random walk after 28567 steps, saw 11581 distinct states, run finished after 76 ms. (steps per millisecond=375 ) properties seen :2
Explored full state space saw : 11662 states, properties seen :0
Exhaustive walk after 28722 steps, saw 11662 distinct states, run finished after 36 ms. (steps per millisecond=797 ) properties seen :0
Found 2 invariant AP formulas.
Knowledge based reduction with 15 factoid took 136 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 173 ms :[(NOT p0), (OR (NOT p0) p1), true, p1]
Knowledge-based reduction took 2122 ms.
Stuttering acceptance computed with spot in 168 ms :[(NOT p0), (OR (NOT p0) p1), true, p1]
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (OR (NOT p0) p1), true, p1]
Product exploration explored 100000 steps with 22955 reset in 169 ms.
Product exploration explored 100000 steps with 22896 reset in 183 ms.
Built C files in :
/tmp/ltsmin10657193445258134488
[2026-05-23 19:32:13] [INFO ] Computing symmetric may disable matrix : 117 transitions.
[2026-05-23 19:32:13] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 19:32:13] [INFO ] Computing symmetric may enable matrix : 117 transitions.
[2026-05-23 19:32:13] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 19:32:13] [INFO ] Computing Do-Not-Accords matrix : 117 transitions.
[2026-05-23 19:32:13] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 19:32:13] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10657193445258134488
Running compilation step : cd /tmp/ltsmin10657193445258134488;'/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 564 ms.
Running link step : cd /tmp/ltsmin10657193445258134488;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin10657193445258134488;'/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/stateBased3145139710840091019.hoa' '--buchi-type=spotba'
LTSmin run took 80 ms.
FORMULA DBSingleClientW-PT-d1m04-LTLCardinality-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d1m04-LTLCardinality-05 finished in 47151 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 162/162 transitions.
Graph (complete) has 401 edges and 117 vertex of which 116 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 116 transition count 161
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 108 transition count 153
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 108 transition count 153
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 19 place count 108 transition count 152
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 26 place count 101 transition count 136
Iterating global reduction 2 with 7 rules applied. Total rules applied 33 place count 101 transition count 136
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 36 place count 101 transition count 133
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 42 place count 95 transition count 126
Iterating global reduction 3 with 6 rules applied. Total rules applied 48 place count 95 transition count 126
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 49 place count 95 transition count 125
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 55 place count 89 transition count 114
Iterating global reduction 4 with 6 rules applied. Total rules applied 61 place count 89 transition count 114
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 65 place count 89 transition count 110
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 66 place count 88 transition count 109
Iterating global reduction 5 with 1 rules applied. Total rules applied 67 place count 88 transition count 109
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 68 place count 87 transition count 107
Iterating global reduction 5 with 1 rules applied. Total rules applied 69 place count 87 transition count 107
Applied a total of 69 rules in 29 ms. Remains 87 /117 variables (removed 30) and now considering 107/162 (removed 55) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3840362978889918000.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8295204595674894409.kers'
[2026-05-23 19:32:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3840362978889918000.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8295204595674894409.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 107 rows 87 cols 348 entries
Finished phase 1 with 83 SingleSign rule and 2 generalized
[2026-05-23 19:32:13] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8295204595674894409.kers
Total runtime 1 ms.
[2026-05-23 19:32:14] [INFO ] Implicit Places using invariants in 95 ms returned []
[2026-05-23 19:32:14] [INFO ] Invariant cache hit.
[2026-05-23 19:32:14] [INFO ] State equation strengthened by 35 read => feed constraints.
[2026-05-23 19:32:14] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
[2026-05-23 19:32:14] [INFO ] Redundant transitions in 4 ms returned []
Running 106 sub problems to find dead transitions.
[2026-05-23 19:32:14] [INFO ] Invariant cache hit.
[2026-05-23 19:32:14] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (OVERLAPS) 1/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 107/194 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 35/124 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 6/130 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/194 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (OVERLAPS) 0/194 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 194/194 variables, and 130 constraints, problems are : Problem set: 0 solved, 106 unsolved in 8505 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 87/87 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 1/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (OVERLAPS) 107/194 variables, 87/95 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/194 variables, 35/130 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/194 variables, 106/236 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/194 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 10 (OVERLAPS) 0/194 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 194/194 variables, and 236 constraints, problems are : Problem set: 0 solved, 106 unsolved in 21687 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 87/87 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30263ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 30264ms
Starting structural reductions in SI_LTL mode, iteration 1 : 87/117 places, 107/162 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 30686 ms. Remains : 87/117 places, 107/162 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m04-LTLCardinality-10
Stuttering criterion allowed to conclude after 50422 steps with 11570 reset in 111 ms.
FORMULA DBSingleClientW-PT-d1m04-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m04-LTLCardinality-10 finished in 30911 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 162/162 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 109 transition count 154
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 109 transition count 154
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 109 transition count 153
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 24 place count 102 transition count 138
Iterating global reduction 1 with 7 rules applied. Total rules applied 31 place count 102 transition count 138
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 34 place count 102 transition count 135
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 40 place count 96 transition count 128
Iterating global reduction 2 with 6 rules applied. Total rules applied 46 place count 96 transition count 128
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 48 place count 96 transition count 126
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 53 place count 91 transition count 120
Iterating global reduction 3 with 5 rules applied. Total rules applied 58 place count 91 transition count 120
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 60 place count 91 transition count 118
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 61 place count 90 transition count 117
Iterating global reduction 4 with 1 rules applied. Total rules applied 62 place count 90 transition count 117
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 63 place count 89 transition count 115
Iterating global reduction 4 with 1 rules applied. Total rules applied 64 place count 89 transition count 115
Applied a total of 64 rules in 35 ms. Remains 89 /117 variables (removed 28) and now considering 115/162 (removed 47) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5766128804803431762.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13766459135994617563.kers'
[2026-05-23 19:32:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5766128804803431762.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13766459135994617563.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 115 rows 89 cols 372 entries
Finished phase 1 with 85 SingleSign rule and 2 generalized
[2026-05-23 19:32:44] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13766459135994617563.kers
Total runtime 1 ms.
[2026-05-23 19:32:45] [INFO ] Implicit Places using invariants in 161 ms returned []
[2026-05-23 19:32:45] [INFO ] Invariant cache hit.
[2026-05-23 19:32:45] [INFO ] State equation strengthened by 39 read => feed constraints.
[2026-05-23 19:32:45] [INFO ] Implicit Places using invariants and state equation in 389 ms returned []
Implicit Place search using SMT with State Equation took 566 ms to find 0 implicit places.
[2026-05-23 19:32:45] [INFO ] Redundant transitions in 5 ms returned []
Running 114 sub problems to find dead transitions.
[2026-05-23 19:32:45] [INFO ] Invariant cache hit.
[2026-05-23 19:32:45] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (OVERLAPS) 1/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (OVERLAPS) 115/203 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 39/129 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 3/132 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (OVERLAPS) 1/204 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/204 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 10 (OVERLAPS) 0/204 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/204 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 12 (OVERLAPS) 0/204 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Real declared 204/204 variables, and 134 constraints, problems are : Problem set: 0 solved, 114 unsolved in 17704 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 114 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (OVERLAPS) 1/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (OVERLAPS) 115/203 variables, 88/94 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 39/133 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 107/240 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 10 (OVERLAPS) 1/204 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/204 variables, 7/248 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/204 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 13 (OVERLAPS) 0/204 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Int declared 204/204 variables, and 248 constraints, problems are : Problem set: 0 solved, 114 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47796ms problems are : Problem set: 0 solved, 114 unsolved
Search for dead transitions found 0 dead transitions in 47797ms
Starting structural reductions in SI_LTL mode, iteration 1 : 89/117 places, 115/162 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 48412 ms. Remains : 89/117 places, 115/162 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m04-LTLCardinality-11
Stuttering criterion allowed to conclude after 23109 steps with 5311 reset in 65 ms.
FORMULA DBSingleClientW-PT-d1m04-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m04-LTLCardinality-11 finished in 48616 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 162/162 transitions.
Graph (complete) has 401 edges and 117 vertex of which 116 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 116 transition count 161
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 108 transition count 153
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 108 transition count 153
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 19 place count 108 transition count 152
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 26 place count 101 transition count 137
Iterating global reduction 2 with 7 rules applied. Total rules applied 33 place count 101 transition count 137
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 35 place count 101 transition count 135
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 42 place count 94 transition count 127
Iterating global reduction 3 with 7 rules applied. Total rules applied 49 place count 94 transition count 127
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 51 place count 94 transition count 125
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 57 place count 88 transition count 118
Iterating global reduction 4 with 6 rules applied. Total rules applied 63 place count 88 transition count 118
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 67 place count 88 transition count 114
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 68 place count 87 transition count 113
Iterating global reduction 5 with 1 rules applied. Total rules applied 69 place count 87 transition count 113
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 70 place count 86 transition count 111
Iterating global reduction 5 with 1 rules applied. Total rules applied 71 place count 86 transition count 111
Applied a total of 71 rules in 31 ms. Remains 86 /117 variables (removed 31) and now considering 111/162 (removed 51) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13325175568199674965.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7609905130784954140.kers'
[2026-05-23 19:33:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13325175568199674965.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7609905130784954140.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 111 rows 86 cols 358 entries
Finished phase 1 with 82 SingleSign rule and 2 generalized
[2026-05-23 19:33:33] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7609905130784954140.kers
Total runtime 1 ms.
[2026-05-23 19:33:33] [INFO ] Implicit Places using invariants in 193 ms returned []
[2026-05-23 19:33:33] [INFO ] Invariant cache hit.
[2026-05-23 19:33:33] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-23 19:33:34] [INFO ] Implicit Places using invariants and state equation in 385 ms returned []
Implicit Place search using SMT with State Equation took 612 ms to find 0 implicit places.
[2026-05-23 19:33:34] [INFO ] Redundant transitions in 5 ms returned []
Running 110 sub problems to find dead transitions.
[2026-05-23 19:33:34] [INFO ] Invariant cache hit.
[2026-05-23 19:33:34] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 111/197 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 38/126 constraints. Problems are: Problem set: 0 solved, 110 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (OVERLAPS) 0/197 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 126 constraints, problems are : Problem set: 0 solved, 110 unsolved in 5373 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 111/197 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 38/126 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 110/236 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 0/197 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 236 constraints, problems are : Problem set: 0 solved, 110 unsolved in 18235 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 23680ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 23681ms
Starting structural reductions in SI_LTL mode, iteration 1 : 86/117 places, 111/162 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 24338 ms. Remains : 86/117 places, 111/162 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 39 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m04-LTLCardinality-12
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m04-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m04-LTLCardinality-12 finished in 24416 ms.
All properties solved by simple procedures.
Total runtime 302560 ms.
BK_STOP 1779564837931
--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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-d1m04"
export BK_EXAMINATION="LTLCardinality"
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-d1m04, examination is LTLCardinality"
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-177946993600139"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d1m04.tgz
mv DBSingleClientW-PT-d1m04 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.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 '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;