Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r058-smll-174854063600140.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is DBSingleClientW-PT-d2m07, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r058-smll-174854063600140
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 6 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1.6M May 29 14:32 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748616267186

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d2m07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-30 14:44:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 14:44:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 14:44:29] [INFO ] Load time of PNML (sax parser for PT used): 424 ms
[2025-05-30 14:44:29] [INFO ] Transformed 4763 places.
[2025-05-30 14:44:29] [INFO ] Transformed 2478 transitions.
[2025-05-30 14:44:29] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 614 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 3580 places in 24 ms
Reduce places removed 3580 places and 0 transitions.
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 1183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1183/1183 places, 2478/2478 transitions.
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 199 transitions.
Iterating post reduction 0 with 245 rules applied. Total rules applied 245 place count 1137 transition count 2279
Discarding 374 places :
Symmetric choice reduction at 1 with 374 rule applications. Total rules 619 place count 763 transition count 1389
Iterating global reduction 1 with 374 rules applied. Total rules applied 993 place count 763 transition count 1389
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 1029 place count 763 transition count 1353
Discarding 297 places :
Symmetric choice reduction at 2 with 297 rule applications. Total rules 1326 place count 466 transition count 1056
Iterating global reduction 2 with 297 rules applied. Total rules applied 1623 place count 466 transition count 1056
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1629 place count 466 transition count 1050
Discarding 220 places :
Symmetric choice reduction at 3 with 220 rule applications. Total rules 1849 place count 246 transition count 742
Iterating global reduction 3 with 220 rules applied. Total rules applied 2069 place count 246 transition count 742
Ensure Unique test removed 253 transitions
Reduce isomorphic transitions removed 253 transitions.
Iterating post reduction 3 with 253 rules applied. Total rules applied 2322 place count 246 transition count 489
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 2338 place count 230 transition count 459
Iterating global reduction 4 with 16 rules applied. Total rules applied 2354 place count 230 transition count 459
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 2362 place count 230 transition count 451
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 2374 place count 218 transition count 439
Iterating global reduction 5 with 12 rules applied. Total rules applied 2386 place count 218 transition count 439
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2387 place count 218 transition count 438
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 2398 place count 207 transition count 427
Iterating global reduction 6 with 11 rules applied. Total rules applied 2409 place count 207 transition count 427
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 2420 place count 207 transition count 416
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 2423 place count 204 transition count 407
Iterating global reduction 7 with 3 rules applied. Total rules applied 2426 place count 204 transition count 407
Applied a total of 2426 rules in 290 ms. Remains 204 /1183 variables (removed 979) and now considering 407/2478 (removed 2071) transitions.
// Phase 1: matrix 407 rows 204 cols
[2025-05-30 14:44:30] [INFO ] Computed 2 invariants in 28 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:44:30] [INFO ] Implicit Places using invariants in 569 ms returned []
[2025-05-30 14:44:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:44:31] [INFO ] State equation strengthened by 212 read => feed constraints.
[2025-05-30 14:44:34] [INFO ] Implicit Places using invariants and state equation in 3218 ms returned []
Implicit Place search using SMT with State Equation took 3843 ms to find 0 implicit places.
Running 406 sub problems to find dead transitions.
[2025-05-30 14:44:34] [INFO ] Invariant cache hit.
[2025-05-30 14:44:34] [INFO ] State equation strengthened by 212 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 4 (OVERLAPS) 407/611 variables, 204/206 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/611 variables, 212/418 constraints. Problems are: Problem set: 0 solved, 406 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 611/611 variables, and 418 constraints, problems are : Problem set: 0 solved, 406 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 204/204 constraints, ReadFeed: 212/212 constraints, PredecessorRefiner: 406/406 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 406 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 4 (OVERLAPS) 407/611 variables, 204/206 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/611 variables, 212/418 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/611 variables, 406/824 constraints. Problems are: Problem set: 0 solved, 406 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 611/611 variables, and 824 constraints, problems are : Problem set: 0 solved, 406 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 204/204 constraints, ReadFeed: 212/212 constraints, PredecessorRefiner: 406/406 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61194ms problems are : Problem set: 0 solved, 406 unsolved
Search for dead transitions found 0 dead transitions in 61222ms
Starting structural reductions in LTL mode, iteration 1 : 204/1183 places, 407/2478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65386 ms. Remains : 204/1183 places, 407/2478 transitions.
Support contains 34 out of 204 places after structural reductions.
[2025-05-30 14:45:35] [INFO ] Flatten gal took : 82 ms
[2025-05-30 14:45:35] [INFO ] Flatten gal took : 44 ms
[2025-05-30 14:45:35] [INFO ] Input system was already deterministic with 407 transitions.
RANDOM walk for 40000 steps (9218 resets) in 3696 ms. (10 steps per ms) remains 26/29 properties
BEST_FIRST walk for 4002 steps (194 resets) in 31 ms. (125 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (183 resets) in 30 ms. (129 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (178 resets) in 36 ms. (108 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (395 resets) in 83 ms. (47 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (191 resets) in 44 ms. (88 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (177 resets) in 38 ms. (102 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (170 resets) in 38 ms. (102 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (194 resets) in 33 ms. (117 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (185 resets) in 38 ms. (102 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (397 resets) in 38 ms. (102 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (165 resets) in 26 ms. (148 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (178 resets) in 17 ms. (222 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (418 resets) in 34 ms. (114 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (364 resets) in 29 ms. (133 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (160 resets) in 36 ms. (108 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (191 resets) in 48 ms. (81 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (189 resets) in 29 ms. (133 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (180 resets) in 29 ms. (133 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (188 resets) in 27 ms. (142 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (197 resets) in 30 ms. (129 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (176 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (171 resets) in 18 ms. (210 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (177 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (363 resets) in 23 ms. (166 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (414 resets) in 31 ms. (125 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (180 resets) in 22 ms. (174 steps per ms) remains 26/26 properties
[2025-05-30 14:45:37] [INFO ] Invariant cache hit.
[2025-05-30 14:45:37] [INFO ] State equation strengthened by 212 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem AtomicPropp17 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 25 unsolved
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp25 is UNSAT
At refinement iteration 1 (OVERLAPS) 69/100 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 41/141 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 23 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:45:37] [INFO ] Deduced a trap composed of 75 places in 117 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:45:38] [INFO ] Deduced a trap composed of 77 places in 98 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:45:38] [INFO ] Deduced a trap composed of 74 places in 97 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 3/5 constraints. Problems are: Problem set: 3 solved, 23 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:45:38] [INFO ] Deduced a trap composed of 74 places in 90 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:45:38] [INFO ] Deduced a trap composed of 74 places in 116 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:45:38] [INFO ] Deduced a trap composed of 73 places in 141 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:45:38] [INFO ] Deduced a trap composed of 74 places in 97 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:45:38] [INFO ] Deduced a trap composed of 74 places in 147 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:45:39] [INFO ] Deduced a trap composed of 73 places in 116 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:45:39] [INFO ] Deduced a trap composed of 74 places in 111 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:45:39] [INFO ] Deduced a trap composed of 73 places in 113 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:45:39] [INFO ] Deduced a trap composed of 73 places in 85 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:45:39] [INFO ] Deduced a trap composed of 74 places in 142 ms of which 13 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 10/15 constraints. Problems are: Problem set: 3 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 0/15 constraints. Problems are: Problem set: 3 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 322/463 variables, 141/156 constraints. Problems are: Problem set: 3 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/463 variables, 127/283 constraints. Problems are: Problem set: 3 solved, 23 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/463 variables, 0/283 constraints. Problems are: Problem set: 3 solved, 23 unsolved
At refinement iteration 10 (OVERLAPS) 148/611 variables, 63/346 constraints. Problems are: Problem set: 3 solved, 23 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/611 variables, 85/431 constraints. Problems are: Problem set: 3 solved, 23 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 611/611 variables, and 431 constraints, problems are : Problem set: 3 solved, 23 unsolved in 5025 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 204/204 constraints, ReadFeed: 212/212 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 23 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 71/97 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 42/139 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 13/15 constraints. Problems are: Problem set: 3 solved, 23 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:45:43] [INFO ] Deduced a trap composed of 70 places in 86 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:45:43] [INFO ] Deduced a trap composed of 73 places in 89 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:45:43] [INFO ] Deduced a trap composed of 72 places in 87 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:45:43] [INFO ] Deduced a trap composed of 73 places in 94 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:45:43] [INFO ] Deduced a trap composed of 72 places in 129 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:45:43] [INFO ] Deduced a trap composed of 74 places in 96 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:45:43] [INFO ] Deduced a trap composed of 73 places in 85 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:45:43] [INFO ] Deduced a trap composed of 74 places in 102 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:45:43] [INFO ] Deduced a trap composed of 74 places in 83 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:45:44] [INFO ] Deduced a trap composed of 74 places in 144 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:45:44] [INFO ] Deduced a trap composed of 73 places in 145 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:45:44] [INFO ] Deduced a trap composed of 74 places in 112 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:45:44] [INFO ] Deduced a trap composed of 74 places in 86 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:45:44] [INFO ] Deduced a trap composed of 74 places in 81 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:45:44] [INFO ] Deduced a trap composed of 74 places in 85 ms of which 8 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 15/30 constraints. Problems are: Problem set: 3 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/30 constraints. Problems are: Problem set: 3 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 310/449 variables, 139/169 constraints. Problems are: Problem set: 3 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/449 variables, 115/284 constraints. Problems are: Problem set: 3 solved, 23 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:45:46] [INFO ] Deduced a trap composed of 75 places in 102 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:45:46] [INFO ] Deduced a trap composed of 76 places in 95 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:45:46] [INFO ] Deduced a trap composed of 76 places in 97 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:45:46] [INFO ] Deduced a trap composed of 75 places in 94 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:45:46] [INFO ] Deduced a trap composed of 75 places in 94 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:45:47] [INFO ] Deduced a trap composed of 75 places in 94 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:45:47] [INFO ] Deduced a trap composed of 75 places in 97 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:45:47] [INFO ] Deduced a trap composed of 75 places in 87 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:45:47] [INFO ] Deduced a trap composed of 75 places in 94 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:45:47] [INFO ] Deduced a trap composed of 75 places in 82 ms of which 4 ms to minimize.
SMT process timed out in 10165ms, After SMT, problems are : Problem set: 3 solved, 23 unsolved
Fused 23 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 26 out of 204 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 204/204 places, 407/407 transitions.
Graph (complete) has 752 edges and 204 vertex of which 203 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 203 transition count 400
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 13 place count 198 transition count 385
Iterating global reduction 1 with 5 rules applied. Total rules applied 18 place count 198 transition count 385
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 22 place count 194 transition count 376
Iterating global reduction 1 with 4 rules applied. Total rules applied 26 place count 194 transition count 376
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 31 place count 194 transition count 371
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 33 place count 192 transition count 369
Iterating global reduction 2 with 2 rules applied. Total rules applied 35 place count 192 transition count 369
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 37 place count 190 transition count 367
Iterating global reduction 2 with 2 rules applied. Total rules applied 39 place count 190 transition count 367
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 44 place count 190 transition count 362
Applied a total of 44 rules in 91 ms. Remains 190 /204 variables (removed 14) and now considering 362/407 (removed 45) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 190/204 places, 362/407 transitions.
RANDOM walk for 40000 steps (9188 resets) in 815 ms. (49 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (183 resets) in 22 ms. (174 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (167 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (165 resets) in 24 ms. (160 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (396 resets) in 38 ms. (102 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (177 resets) in 25 ms. (153 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (168 resets) in 27 ms. (142 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (165 resets) in 21 ms. (182 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (188 resets) in 25 ms. (153 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (171 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (396 resets) in 25 ms. (153 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (157 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (163 resets) in 19 ms. (200 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (402 resets) in 43 ms. (90 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (381 resets) in 37 ms. (105 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (178 resets) in 28 ms. (138 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (199 resets) in 29 ms. (133 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (182 resets) in 38 ms. (102 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (191 resets) in 33 ms. (117 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (185 resets) in 26 ms. (148 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (171 resets) in 29 ms. (133 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (394 resets) in 61 ms. (64 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (377 resets) in 40 ms. (97 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (178 resets) in 34 ms. (114 steps per ms) remains 23/23 properties
Finished probabilistic random walk after 27826 steps, run visited all 23 properties in 352 ms. (steps per millisecond=79 )
Probabilistic random walk after 27826 steps, saw 13149 distinct states, run finished after 357 ms. (steps per millisecond=77 ) properties seen :23
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 12 simplifications.
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 5 stabilizing places and 33 stable transitions
Graph (complete) has 816 edges and 204 vertex of which 203 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 204 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 204/204 places, 407/407 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 179 transition count 303
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 179 transition count 303
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 52 place count 179 transition count 301
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 73 place count 158 transition count 268
Iterating global reduction 1 with 21 rules applied. Total rules applied 94 place count 158 transition count 268
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 107 place count 158 transition count 255
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 122 place count 143 transition count 232
Iterating global reduction 2 with 15 rules applied. Total rules applied 137 place count 143 transition count 232
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 144 place count 143 transition count 225
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 154 place count 133 transition count 197
Iterating global reduction 3 with 10 rules applied. Total rules applied 164 place count 133 transition count 197
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 169 place count 133 transition count 192
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 172 place count 130 transition count 189
Iterating global reduction 4 with 3 rules applied. Total rules applied 175 place count 130 transition count 189
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 176 place count 130 transition count 188
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 178 place count 128 transition count 186
Iterating global reduction 5 with 2 rules applied. Total rules applied 180 place count 128 transition count 186
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 183 place count 128 transition count 183
Applied a total of 183 rules in 59 ms. Remains 128 /204 variables (removed 76) and now considering 183/407 (removed 224) transitions.
// Phase 1: matrix 183 rows 128 cols
[2025-05-30 14:45:49] [INFO ] Computed 2 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:45:49] [INFO ] Implicit Places using invariants in 159 ms returned []
[2025-05-30 14:45:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:45:49] [INFO ] State equation strengthened by 62 read => feed constraints.
[2025-05-30 14:45:49] [INFO ] Implicit Places using invariants and state equation in 720 ms returned []
Implicit Place search using SMT with State Equation took 882 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 14:45:49] [INFO ] Redundant transitions in 13 ms returned []
Running 182 sub problems to find dead transitions.
[2025-05-30 14:45:49] [INFO ] Invariant cache hit.
[2025-05-30 14:45:49] [INFO ] State equation strengthened by 62 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (OVERLAPS) 183/311 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 62/192 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (OVERLAPS) 0/311 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Real declared 311/311 variables, and 192 constraints, problems are : Problem set: 0 solved, 182 unsolved in 12902 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 182 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (OVERLAPS) 183/311 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 62/192 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 182/374 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 311/311 variables, and 374 constraints, problems are : Problem set: 0 solved, 182 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43162ms problems are : Problem set: 0 solved, 182 unsolved
Search for dead transitions found 0 dead transitions in 43164ms
Starting structural reductions in SI_LTL mode, iteration 1 : 128/204 places, 183/407 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 44136 ms. Remains : 128/204 places, 183/407 transitions.
Stuttering acceptance computed with spot in 279 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-02
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 2 ms.
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-02 finished in 44509 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 204 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 204/204 places, 407/407 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 179 transition count 314
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 179 transition count 314
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 52 place count 179 transition count 312
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 74 place count 157 transition count 278
Iterating global reduction 1 with 22 rules applied. Total rules applied 96 place count 157 transition count 278
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 112 place count 157 transition count 262
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 128 place count 141 transition count 238
Iterating global reduction 2 with 16 rules applied. Total rules applied 144 place count 141 transition count 238
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 153 place count 141 transition count 229
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 164 place count 130 transition count 193
Iterating global reduction 3 with 11 rules applied. Total rules applied 175 place count 130 transition count 193
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 180 place count 130 transition count 188
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 183 place count 127 transition count 185
Iterating global reduction 4 with 3 rules applied. Total rules applied 186 place count 127 transition count 185
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 187 place count 127 transition count 184
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 189 place count 125 transition count 182
Iterating global reduction 5 with 2 rules applied. Total rules applied 191 place count 125 transition count 182
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 194 place count 125 transition count 179
Applied a total of 194 rules in 19 ms. Remains 125 /204 variables (removed 79) and now considering 179/407 (removed 228) transitions.
// Phase 1: matrix 179 rows 125 cols
[2025-05-30 14:46:33] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:46:33] [INFO ] Implicit Places using invariants in 197 ms returned []
[2025-05-30 14:46:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:46:33] [INFO ] State equation strengthened by 60 read => feed constraints.
[2025-05-30 14:46:34] [INFO ] Implicit Places using invariants and state equation in 503 ms returned []
Implicit Place search using SMT with State Equation took 703 ms to find 0 implicit places.
Running 178 sub problems to find dead transitions.
[2025-05-30 14:46:34] [INFO ] Invariant cache hit.
[2025-05-30 14:46:34] [INFO ] State equation strengthened by 60 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (OVERLAPS) 179/304 variables, 125/127 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 60/187 constraints. Problems are: Problem set: 0 solved, 178 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:46:42] [INFO ] Deduced a trap composed of 54 places in 108 ms of which 15 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 8 (OVERLAPS) 0/304 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Real declared 304/304 variables, and 188 constraints, problems are : Problem set: 0 solved, 178 unsolved in 23638 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 125/125 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 178 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (OVERLAPS) 179/304 variables, 125/128 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 60/188 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 178/366 constraints. Problems are: Problem set: 0 solved, 178 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 304/304 variables, and 366 constraints, problems are : Problem set: 0 solved, 178 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 125/125 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53811ms problems are : Problem set: 0 solved, 178 unsolved
Search for dead transitions found 0 dead transitions in 53812ms
Starting structural reductions in LTL mode, iteration 1 : 125/204 places, 179/407 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54535 ms. Remains : 125/204 places, 179/407 transitions.
Stuttering acceptance computed with spot in 175 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-03
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-03 finished in 54729 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((G((p0 U p1))||F(p0)) U (p2 U p1)) U X(p3)))'
Support contains 6 out of 204 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 204/204 places, 407/407 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 181 transition count 313
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 181 transition count 313
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 49 place count 181 transition count 310
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 69 place count 161 transition count 278
Iterating global reduction 1 with 20 rules applied. Total rules applied 89 place count 161 transition count 278
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 102 place count 161 transition count 265
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 116 place count 147 transition count 244
Iterating global reduction 2 with 14 rules applied. Total rules applied 130 place count 147 transition count 244
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 136 place count 147 transition count 238
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 145 place count 138 transition count 216
Iterating global reduction 3 with 9 rules applied. Total rules applied 154 place count 138 transition count 216
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 159 place count 138 transition count 211
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 162 place count 135 transition count 208
Iterating global reduction 4 with 3 rules applied. Total rules applied 165 place count 135 transition count 208
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 166 place count 135 transition count 207
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 168 place count 133 transition count 205
Iterating global reduction 5 with 2 rules applied. Total rules applied 170 place count 133 transition count 205
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 173 place count 133 transition count 202
Applied a total of 173 rules in 21 ms. Remains 133 /204 variables (removed 71) and now considering 202/407 (removed 205) transitions.
// Phase 1: matrix 202 rows 133 cols
[2025-05-30 14:47:28] [INFO ] Computed 2 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:47:28] [INFO ] Implicit Places using invariants in 238 ms returned []
[2025-05-30 14:47:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:47:28] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-05-30 14:47:30] [INFO ] Implicit Places using invariants and state equation in 2070 ms returned []
Implicit Place search using SMT with State Equation took 2311 ms to find 0 implicit places.
Running 201 sub problems to find dead transitions.
[2025-05-30 14:47:30] [INFO ] Invariant cache hit.
[2025-05-30 14:47:30] [INFO ] State equation strengthened by 78 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 202/335 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 78/213 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:47:39] [INFO ] Deduced a trap composed of 13 places in 210 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:47:40] [INFO ] Deduced a trap composed of 53 places in 203 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:47:40] [INFO ] Deduced a trap composed of 53 places in 183 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:47:40] [INFO ] Deduced a trap composed of 53 places in 167 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:47:40] [INFO ] Deduced a trap composed of 53 places in 171 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:47:41] [INFO ] Deduced a trap composed of 14 places in 141 ms of which 16 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 6/219 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:47:47] [INFO ] Deduced a trap composed of 53 places in 168 ms of which 23 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:47:52] [INFO ] Deduced a trap composed of 57 places in 102 ms of which 9 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/335 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/335 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 335/335 variables, and 221 constraints, problems are : Problem set: 0 solved, 201 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 201 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (OVERLAPS) 1/133 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (OVERLAPS) 202/335 variables, 133/143 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 78/221 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/335 variables, 201/422 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 335/335 variables, and 422 constraints, problems are : Problem set: 0 solved, 201 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60173ms problems are : Problem set: 0 solved, 201 unsolved
Search for dead transitions found 0 dead transitions in 60174ms
Starting structural reductions in LTL mode, iteration 1 : 133/204 places, 202/407 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62507 ms. Remains : 133/204 places, 202/407 transitions.
Stuttering acceptance computed with spot in 320 ms :[(NOT p3), (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p2 (NOT p3))), (AND (NOT p1) (NOT p3)), (NOT p3), (NOT p0), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-04
Stuttering criterion allowed to conclude after 6 steps with 1 reset in 1 ms.
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-04 finished in 62875 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(!p0)) U (X(G(!p0))&&p1))))'
Support contains 3 out of 204 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 204/204 places, 407/407 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 180 transition count 321
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 180 transition count 321
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 50 place count 180 transition count 319
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 71 place count 159 transition count 286
Iterating global reduction 1 with 21 rules applied. Total rules applied 92 place count 159 transition count 286
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 108 place count 159 transition count 270
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 123 place count 144 transition count 247
Iterating global reduction 2 with 15 rules applied. Total rules applied 138 place count 144 transition count 247
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 147 place count 144 transition count 238
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 157 place count 134 transition count 204
Iterating global reduction 3 with 10 rules applied. Total rules applied 167 place count 134 transition count 204
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 172 place count 134 transition count 199
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 174 place count 132 transition count 197
Iterating global reduction 4 with 2 rules applied. Total rules applied 176 place count 132 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 177 place count 132 transition count 196
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 178 place count 131 transition count 195
Iterating global reduction 5 with 1 rules applied. Total rules applied 179 place count 131 transition count 195
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 180 place count 131 transition count 194
Applied a total of 180 rules in 15 ms. Remains 131 /204 variables (removed 73) and now considering 194/407 (removed 213) transitions.
// Phase 1: matrix 194 rows 131 cols
[2025-05-30 14:48:31] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:48:31] [INFO ] Implicit Places using invariants in 176 ms returned []
[2025-05-30 14:48:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:48:31] [INFO ] State equation strengthened by 69 read => feed constraints.
[2025-05-30 14:48:32] [INFO ] Implicit Places using invariants and state equation in 833 ms returned []
Implicit Place search using SMT with State Equation took 1012 ms to find 0 implicit places.
Running 193 sub problems to find dead transitions.
[2025-05-30 14:48:32] [INFO ] Invariant cache hit.
[2025-05-30 14:48:32] [INFO ] State equation strengthened by 69 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (OVERLAPS) 194/325 variables, 131/133 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/325 variables, 69/202 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (OVERLAPS) 0/325 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Real declared 325/325 variables, and 202 constraints, problems are : Problem set: 0 solved, 193 unsolved in 15976 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 131/131 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (OVERLAPS) 194/325 variables, 131/133 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/325 variables, 69/202 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 193/395 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 325/325 variables, and 395 constraints, problems are : Problem set: 0 solved, 193 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 131/131 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46191ms problems are : Problem set: 0 solved, 193 unsolved
Search for dead transitions found 0 dead transitions in 46192ms
Starting structural reductions in LTL mode, iteration 1 : 131/204 places, 194/407 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47220 ms. Remains : 131/204 places, 194/407 transitions.
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), p0, true]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-06
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-06 finished in 47371 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(p0)) U (G(p1)&&F(p2)))))'
Support contains 4 out of 204 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 204/204 places, 407/407 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 180 transition count 316
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 180 transition count 316
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 50 place count 180 transition count 314
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 70 place count 160 transition count 282
Iterating global reduction 1 with 20 rules applied. Total rules applied 90 place count 160 transition count 282
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 103 place count 160 transition count 269
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 116 place count 147 transition count 251
Iterating global reduction 2 with 13 rules applied. Total rules applied 129 place count 147 transition count 251
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 134 place count 147 transition count 246
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 144 place count 137 transition count 211
Iterating global reduction 3 with 10 rules applied. Total rules applied 154 place count 137 transition count 211
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 167 place count 137 transition count 198
Applied a total of 167 rules in 10 ms. Remains 137 /204 variables (removed 67) and now considering 198/407 (removed 209) transitions.
// Phase 1: matrix 198 rows 137 cols
[2025-05-30 14:49:18] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:49:18] [INFO ] Implicit Places using invariants in 183 ms returned []
[2025-05-30 14:49:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:49:18] [INFO ] State equation strengthened by 64 read => feed constraints.
[2025-05-30 14:49:19] [INFO ] Implicit Places using invariants and state equation in 651 ms returned []
Implicit Place search using SMT with State Equation took 837 ms to find 0 implicit places.
Running 197 sub problems to find dead transitions.
[2025-05-30 14:49:19] [INFO ] Invariant cache hit.
[2025-05-30 14:49:19] [INFO ] State equation strengthened by 64 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (OVERLAPS) 1/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (OVERLAPS) 198/335 variables, 137/139 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 64/203 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 7 (OVERLAPS) 0/335 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 197 unsolved
No progress, stopping.
After SMT solving in domain Real declared 335/335 variables, and 203 constraints, problems are : Problem set: 0 solved, 197 unsolved in 15880 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 137/137 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 197 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (OVERLAPS) 1/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (OVERLAPS) 198/335 variables, 137/139 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 64/203 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 197/400 constraints. Problems are: Problem set: 0 solved, 197 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 335/335 variables, and 400 constraints, problems are : Problem set: 0 solved, 197 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 137/137 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46028ms problems are : Problem set: 0 solved, 197 unsolved
Search for dead transitions found 0 dead transitions in 46029ms
Starting structural reductions in LTL mode, iteration 1 : 137/204 places, 198/407 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46884 ms. Remains : 137/204 places, 198/407 transitions.
Stuttering acceptance computed with spot in 347 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p2), (NOT p0), true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-07
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-07 finished in 47256 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(X(p0))||(G(p1)&&F(p2))))))'
Support contains 5 out of 204 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 204/204 places, 407/407 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 181 transition count 316
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 181 transition count 316
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 48 place count 181 transition count 314
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 68 place count 161 transition count 282
Iterating global reduction 1 with 20 rules applied. Total rules applied 88 place count 161 transition count 282
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 103 place count 161 transition count 267
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 118 place count 146 transition count 245
Iterating global reduction 2 with 15 rules applied. Total rules applied 133 place count 146 transition count 245
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 141 place count 146 transition count 237
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 151 place count 136 transition count 208
Iterating global reduction 3 with 10 rules applied. Total rules applied 161 place count 136 transition count 208
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 166 place count 136 transition count 203
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 168 place count 134 transition count 201
Iterating global reduction 4 with 2 rules applied. Total rules applied 170 place count 134 transition count 201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 171 place count 134 transition count 200
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 172 place count 133 transition count 199
Iterating global reduction 5 with 1 rules applied. Total rules applied 173 place count 133 transition count 199
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 175 place count 133 transition count 197
Applied a total of 175 rules in 13 ms. Remains 133 /204 variables (removed 71) and now considering 197/407 (removed 210) transitions.
// Phase 1: matrix 197 rows 133 cols
[2025-05-30 14:50:05] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:50:05] [INFO ] Implicit Places using invariants in 146 ms returned []
[2025-05-30 14:50:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:50:05] [INFO ] State equation strengthened by 71 read => feed constraints.
[2025-05-30 14:50:06] [INFO ] Implicit Places using invariants and state equation in 705 ms returned []
Implicit Place search using SMT with State Equation took 853 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2025-05-30 14:50:06] [INFO ] Invariant cache hit.
[2025-05-30 14:50:06] [INFO ] State equation strengthened by 71 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (OVERLAPS) 197/330 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/330 variables, 71/206 constraints. Problems are: Problem set: 0 solved, 196 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/330 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (OVERLAPS) 0/330 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/330 variables, and 206 constraints, problems are : Problem set: 0 solved, 196 unsolved in 19985 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (OVERLAPS) 197/330 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/330 variables, 71/206 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/330 variables, 196/402 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 330/330 variables, and 402 constraints, problems are : Problem set: 0 solved, 196 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50121ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 50122ms
Starting structural reductions in LTL mode, iteration 1 : 133/204 places, 197/407 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50988 ms. Remains : 133/204 places, 197/407 transitions.
Stuttering acceptance computed with spot in 518 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0)), (NOT p0), true, (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) p0), (NOT p2)]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-08
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-08 finished in 51532 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(G(p0)))) U (p1||(X(p3)&&p2))))'
Support contains 6 out of 204 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 204/204 places, 407/407 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 182 transition count 329
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 182 transition count 329
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 46 place count 182 transition count 327
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 65 place count 163 transition count 296
Iterating global reduction 1 with 19 rules applied. Total rules applied 84 place count 163 transition count 296
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 95 place count 163 transition count 285
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 109 place count 149 transition count 264
Iterating global reduction 2 with 14 rules applied. Total rules applied 123 place count 149 transition count 264
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 132 place count 149 transition count 255
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 140 place count 141 transition count 231
Iterating global reduction 3 with 8 rules applied. Total rules applied 148 place count 141 transition count 231
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 151 place count 141 transition count 228
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 154 place count 138 transition count 225
Iterating global reduction 4 with 3 rules applied. Total rules applied 157 place count 138 transition count 225
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 158 place count 138 transition count 224
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 160 place count 136 transition count 222
Iterating global reduction 5 with 2 rules applied. Total rules applied 162 place count 136 transition count 222
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 165 place count 136 transition count 219
Applied a total of 165 rules in 26 ms. Remains 136 /204 variables (removed 68) and now considering 219/407 (removed 188) transitions.
// Phase 1: matrix 219 rows 136 cols
[2025-05-30 14:50:57] [INFO ] Computed 2 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:50:57] [INFO ] Implicit Places using invariants in 237 ms returned []
[2025-05-30 14:50:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:50:57] [INFO ] State equation strengthened by 90 read => feed constraints.
[2025-05-30 14:50:58] [INFO ] Implicit Places using invariants and state equation in 1466 ms returned []
Implicit Place search using SMT with State Equation took 1705 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2025-05-30 14:50:58] [INFO ] Invariant cache hit.
[2025-05-30 14:50:58] [INFO ] State equation strengthened by 90 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (OVERLAPS) 219/355 variables, 136/138 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/355 variables, 90/228 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:51:09] [INFO ] Deduced a trap composed of 14 places in 110 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:51:09] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:51:09] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:51:09] [INFO ] Deduced a trap composed of 14 places in 110 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:51:09] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 5/233 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (OVERLAPS) 0/355 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 355/355 variables, and 233 constraints, problems are : Problem set: 0 solved, 218 unsolved in 25069 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 136/136 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (OVERLAPS) 1/136 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (OVERLAPS) 219/355 variables, 136/143 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 90/233 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 218/451 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 355/355 variables, and 451 constraints, problems are : Problem set: 0 solved, 218 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 136/136 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55239ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 55240ms
Starting structural reductions in LTL mode, iteration 1 : 136/204 places, 219/407 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56972 ms. Remains : 136/204 places, 219/407 transitions.
Stuttering acceptance computed with spot in 258 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (NOT p0), (NOT p0), true]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-09
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-09 finished in 57260 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||X((p1||G(F(!p2)))))))'
Support contains 4 out of 204 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 204/204 places, 407/407 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 181 transition count 323
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 181 transition count 323
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 181 transition count 322
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 67 place count 161 transition count 297
Iterating global reduction 1 with 20 rules applied. Total rules applied 87 place count 161 transition count 297
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 103 place count 161 transition count 281
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 118 place count 146 transition count 258
Iterating global reduction 2 with 15 rules applied. Total rules applied 133 place count 146 transition count 258
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 142 place count 146 transition count 249
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 152 place count 136 transition count 215
Iterating global reduction 3 with 10 rules applied. Total rules applied 162 place count 136 transition count 215
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 167 place count 136 transition count 210
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 169 place count 134 transition count 208
Iterating global reduction 4 with 2 rules applied. Total rules applied 171 place count 134 transition count 208
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 172 place count 134 transition count 207
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 173 place count 133 transition count 206
Iterating global reduction 5 with 1 rules applied. Total rules applied 174 place count 133 transition count 206
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 176 place count 133 transition count 204
Applied a total of 176 rules in 18 ms. Remains 133 /204 variables (removed 71) and now considering 204/407 (removed 203) transitions.
// Phase 1: matrix 204 rows 133 cols
[2025-05-30 14:51:54] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:51:54] [INFO ] Implicit Places using invariants in 204 ms returned []
[2025-05-30 14:51:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:51:54] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-05-30 14:51:55] [INFO ] Implicit Places using invariants and state equation in 814 ms returned []
Implicit Place search using SMT with State Equation took 1021 ms to find 0 implicit places.
Running 203 sub problems to find dead transitions.
[2025-05-30 14:51:55] [INFO ] Invariant cache hit.
[2025-05-30 14:51:55] [INFO ] State equation strengthened by 78 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 204/337 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/337 variables, 78/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (OVERLAPS) 0/337 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 337/337 variables, and 213 constraints, problems are : Problem set: 0 solved, 203 unsolved in 18658 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 203 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 204/337 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/337 variables, 78/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 203/416 constraints. Problems are: Problem set: 0 solved, 203 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 337/337 variables, and 416 constraints, problems are : Problem set: 0 solved, 203 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48793ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 48794ms
Starting structural reductions in LTL mode, iteration 1 : 133/204 places, 204/407 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49834 ms. Remains : 133/204 places, 204/407 transitions.
Stuttering acceptance computed with spot in 254 ms :[(AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) p1 p2), (AND (NOT p0) p2)]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-12
Product exploration explored 100000 steps with 29773 reset in 715 ms.
Product exploration explored 100000 steps with 29753 reset in 404 ms.
Computed a total of 5 stabilizing places and 18 stable transitions
Graph (complete) has 491 edges and 133 vertex of which 132 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 205 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) p1 p2), (AND (NOT p0) p2)]
RANDOM walk for 40000 steps (9161 resets) in 1310 ms. (30 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (1774 resets) in 218 ms. (182 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (1778 resets) in 191 ms. (208 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1799 resets) in 162 ms. (245 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (1833 resets) in 155 ms. (256 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (1750 resets) in 143 ms. (277 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (1740 resets) in 246 ms. (161 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (1768 resets) in 322 ms. (123 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (1824 resets) in 336 ms. (118 steps per ms) remains 8/8 properties
Finished probabilistic random walk after 73712 steps, run visited all 8 properties in 456 ms. (steps per millisecond=161 )
Probabilistic random walk after 73712 steps, saw 32576 distinct states, run finished after 456 ms. (steps per millisecond=161 ) properties seen :8
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1 p2))))]
False Knowledge obtained : [(F p0), (F (NOT (OR p0 (NOT p2)))), (F (NOT (OR p0 (NOT p2) p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p2), (F (NOT (OR p0 (NOT p2) (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F p1)]
Knowledge based reduction with 12 factoid took 654 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) p1 p2), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 204 ms :[(AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) p1 p2), (AND (NOT p0) p2)]
Support contains 4 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 204/204 transitions.
Applied a total of 0 rules in 1 ms. Remains 133 /133 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2025-05-30 14:52:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:52:48] [INFO ] Implicit Places using invariants in 252 ms returned []
[2025-05-30 14:52:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:52:49] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-05-30 14:52:50] [INFO ] Implicit Places using invariants and state equation in 1232 ms returned []
Implicit Place search using SMT with State Equation took 1487 ms to find 0 implicit places.
Running 203 sub problems to find dead transitions.
[2025-05-30 14:52:50] [INFO ] Invariant cache hit.
[2025-05-30 14:52:50] [INFO ] State equation strengthened by 78 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 204/337 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/337 variables, 78/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (OVERLAPS) 0/337 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 337/337 variables, and 213 constraints, problems are : Problem set: 0 solved, 203 unsolved in 19804 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 203 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 204/337 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/337 variables, 78/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 203/416 constraints. Problems are: Problem set: 0 solved, 203 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 337/337 variables, and 416 constraints, problems are : Problem set: 0 solved, 203 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50032ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 50033ms
Finished structural reductions in LTL mode , in 1 iterations and 51522 ms. Remains : 133/133 places, 204/204 transitions.
Computed a total of 5 stabilizing places and 18 stable transitions
Graph (complete) has 491 edges and 133 vertex of which 132 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 5 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 166 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) p1 p2), (AND (NOT p0) p2)]
RANDOM walk for 40000 steps (9177 resets) in 557 ms. (71 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1820 resets) in 143 ms. (277 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (1735 resets) in 167 ms. (238 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (1761 resets) in 150 ms. (264 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1788 resets) in 225 ms. (177 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1780 resets) in 169 ms. (235 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (1805 resets) in 184 ms. (216 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (1758 resets) in 226 ms. (176 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (1854 resets) in 125 ms. (317 steps per ms) remains 8/8 properties
Finished probabilistic random walk after 73712 steps, run visited all 8 properties in 578 ms. (steps per millisecond=127 )
Probabilistic random walk after 73712 steps, saw 32576 distinct states, run finished after 578 ms. (steps per millisecond=127 ) properties seen :8
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (OR p0 (NOT p2)))), (F (NOT (OR p0 (NOT p2) p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p2), (F (NOT (OR p0 (NOT p2) (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F p1)]
Knowledge based reduction with 12 factoid took 458 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) p1 p2), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) p1 p2), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) p1 p2), (AND (NOT p0) p2)]
Product exploration explored 100000 steps with 29862 reset in 468 ms.
Product exploration explored 100000 steps with 29765 reset in 455 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) p1 p2), (AND (NOT p0) p2)]
Support contains 4 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 204/204 transitions.
Applied a total of 0 rules in 17 ms. Remains 133 /133 variables (removed 0) and now considering 204/204 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 14:53:44] [INFO ] Redundant transitions in 15 ms returned []
Running 203 sub problems to find dead transitions.
[2025-05-30 14:53:44] [INFO ] Invariant cache hit.
[2025-05-30 14:53:44] [INFO ] State equation strengthened by 78 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 204/337 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/337 variables, 78/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (OVERLAPS) 0/337 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 337/337 variables, and 213 constraints, problems are : Problem set: 0 solved, 203 unsolved in 21322 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 203 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 204/337 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/337 variables, 78/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 203/416 constraints. Problems are: Problem set: 0 solved, 203 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 337/337 variables, and 416 constraints, problems are : Problem set: 0 solved, 203 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 51516ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 51518ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 51559 ms. Remains : 133/133 places, 204/204 transitions.
Built C files in :
/tmp/ltsmin12261592055424205436
[2025-05-30 14:54:36] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12261592055424205436
Running compilation step : cd /tmp/ltsmin12261592055424205436;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1012 ms.
Running link step : cd /tmp/ltsmin12261592055424205436;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin12261592055424205436;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5857252168429673304.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 204/204 transitions.
Applied a total of 0 rules in 3 ms. Remains 133 /133 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2025-05-30 14:54:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:54:51] [INFO ] Implicit Places using invariants in 160 ms returned []
[2025-05-30 14:54:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:54:51] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-05-30 14:54:52] [INFO ] Implicit Places using invariants and state equation in 821 ms returned []
Implicit Place search using SMT with State Equation took 985 ms to find 0 implicit places.
Running 203 sub problems to find dead transitions.
[2025-05-30 14:54:52] [INFO ] Invariant cache hit.
[2025-05-30 14:54:52] [INFO ] State equation strengthened by 78 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 204/337 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/337 variables, 78/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (OVERLAPS) 0/337 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 337/337 variables, and 213 constraints, problems are : Problem set: 0 solved, 203 unsolved in 19580 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 203 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 204/337 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/337 variables, 78/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 203/416 constraints. Problems are: Problem set: 0 solved, 203 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 337/337 variables, and 416 constraints, problems are : Problem set: 0 solved, 203 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49728ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 49729ms
Finished structural reductions in LTL mode , in 1 iterations and 50717 ms. Remains : 133/133 places, 204/204 transitions.
Built C files in :
/tmp/ltsmin13765569151143569521
[2025-05-30 14:55:41] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13765569151143569521
Running compilation step : cd /tmp/ltsmin13765569151143569521;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 499 ms.
Running link step : cd /tmp/ltsmin13765569151143569521;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin13765569151143569521;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13314321411199389450.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-30 14:55:57] [INFO ] Flatten gal took : 19 ms
[2025-05-30 14:55:57] [INFO ] Flatten gal took : 16 ms
[2025-05-30 14:55:57] [INFO ] Time to serialize gal into /tmp/LTL5685750050792846241.gal : 7 ms
[2025-05-30 14:55:57] [INFO ] Time to serialize properties into /tmp/LTL6321935886696738910.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5685750050792846241.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4391226420650528271.hoa' '-atoms' '/tmp/LTL6321935886696738910.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL6321935886696738910.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4391226420650528271.hoa
Detected timeout of ITS tools.
[2025-05-30 14:56:12] [INFO ] Flatten gal took : 16 ms
[2025-05-30 14:56:12] [INFO ] Flatten gal took : 16 ms
[2025-05-30 14:56:12] [INFO ] Time to serialize gal into /tmp/LTL16869072769099608564.gal : 9 ms
[2025-05-30 14:56:12] [INFO ] Time to serialize properties into /tmp/LTL2178842253166728711.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16869072769099608564.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2178842253166728711.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((F("((s1>=1)&&(l1667>=1))"))||(X(("((s1>=1)&&(l4272>=1))")||(G(F("((s1<1)||(l3092<1))"))))))))
Formula 0 simplified : F(G!"((s1>=1)&&(l1667>=1))" & X(!"((s1>=1)&&(l4272>=1))" & FG!"((s1<1)||(l3092<1))"))
Detected timeout of ITS tools.
[2025-05-30 14:56:27] [INFO ] Flatten gal took : 15 ms
[2025-05-30 14:56:27] [INFO ] Applying decomposition
[2025-05-30 14:56:27] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph3035493555391124944.txt' '-o' '/tmp/graph3035493555391124944.bin' '-w' '/tmp/graph3035493555391124944.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3035493555391124944.bin' '-l' '-1' '-v' '-w' '/tmp/graph3035493555391124944.weights' '-q' '0' '-e' '0.001'
[2025-05-30 14:56:27] [INFO ] Decomposing Gal with order
[2025-05-30 14:56:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 14:56:27] [INFO ] Removed a total of 188 redundant transitions.
[2025-05-30 14:56:27] [INFO ] Flatten gal took : 90 ms
[2025-05-30 14:56:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 177 labels/synchronizations in 17 ms.
[2025-05-30 14:56:27] [INFO ] Time to serialize gal into /tmp/LTL15314194319030083915.gal : 8 ms
[2025-05-30 14:56:27] [INFO ] Time to serialize properties into /tmp/LTL17590895476608197391.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15314194319030083915.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17590895476608197391.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G((F("((i2.u2.s1>=1)&&(i6.u7.l1667>=1))"))||(X(("((i2.u2.s1>=1)&&(i1.u5.l4272>=1))")||(G(F("((i2.u2.s1<1)||(i6.u7.l3092<1))")))))))...156
Formula 0 simplified : F(G!"((i2.u2.s1>=1)&&(i6.u7.l1667>=1))" & X(!"((i2.u2.s1>=1)&&(i1.u5.l4272>=1))" & FG!"((i2.u2.s1<1)||(i6.u7.l3092<1))"))
Detected timeout of ITS tools.
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-12 finished in 288236 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(p1)||X(F(p2))))))'
Support contains 4 out of 204 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 204/204 places, 407/407 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 180 transition count 305
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 180 transition count 305
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 180 transition count 304
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 69 place count 160 transition count 279
Iterating global reduction 1 with 20 rules applied. Total rules applied 89 place count 160 transition count 279
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 102 place count 160 transition count 266
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 117 place count 145 transition count 243
Iterating global reduction 2 with 15 rules applied. Total rules applied 132 place count 145 transition count 243
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 139 place count 145 transition count 236
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 149 place count 135 transition count 207
Iterating global reduction 3 with 10 rules applied. Total rules applied 159 place count 135 transition count 207
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 164 place count 135 transition count 202
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 166 place count 133 transition count 200
Iterating global reduction 4 with 2 rules applied. Total rules applied 168 place count 133 transition count 200
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 169 place count 133 transition count 199
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 170 place count 132 transition count 198
Iterating global reduction 5 with 1 rules applied. Total rules applied 171 place count 132 transition count 198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 173 place count 132 transition count 196
Applied a total of 173 rules in 20 ms. Remains 132 /204 variables (removed 72) and now considering 196/407 (removed 211) transitions.
// Phase 1: matrix 196 rows 132 cols
[2025-05-30 14:56:42] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:56:42] [INFO ] Implicit Places using invariants in 168 ms returned []
[2025-05-30 14:56:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:56:43] [INFO ] State equation strengthened by 71 read => feed constraints.
[2025-05-30 14:56:43] [INFO ] Implicit Places using invariants and state equation in 973 ms returned []
Implicit Place search using SMT with State Equation took 1144 ms to find 0 implicit places.
Running 195 sub problems to find dead transitions.
[2025-05-30 14:56:43] [INFO ] Invariant cache hit.
[2025-05-30 14:56:43] [INFO ] State equation strengthened by 71 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 196/328 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/328 variables, 71/205 constraints. Problems are: Problem set: 0 solved, 195 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (OVERLAPS) 0/328 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 205 constraints, problems are : Problem set: 0 solved, 195 unsolved in 28519 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 196/328 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/328 variables, 71/205 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 195/400 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 328/328 variables, and 400 constraints, problems are : Problem set: 0 solved, 195 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 58694ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 58700ms
Starting structural reductions in LTL mode, iteration 1 : 132/204 places, 196/407 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59864 ms. Remains : 132/204 places, 196/407 transitions.
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-13
Product exploration explored 100000 steps with 22902 reset in 380 ms.
Product exploration explored 100000 steps with 23073 reset in 471 ms.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 482 edges and 132 vertex of which 131 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 139 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (9168 resets) in 229 ms. (173 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40003 steps (1754 resets) in 67 ms. (588 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1753 resets) in 57 ms. (689 steps per ms) remains 2/2 properties
[2025-05-30 14:57:43] [INFO ] Invariant cache hit.
[2025-05-30 14:57:43] [INFO ] State equation strengthened by 71 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 53/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 32/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 136/224 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 11/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/224 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 98/322 variables, 41/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 57/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/322 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 6/328 variables, 3/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/328 variables, 3/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/328 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/328 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 205 constraints, problems are : Problem set: 0 solved, 2 unsolved in 364 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 53/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 32/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 136/224 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 11/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/224 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 98/322 variables, 41/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 57/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/322 variables, 2/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/322 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 6/328 variables, 3/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/328 variables, 3/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/328 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/328 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 207 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2582 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2964ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 201 ms.
Support contains 3 out of 132 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 196/196 transitions.
Graph (complete) has 451 edges and 132 vertex of which 131 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 131 transition count 193
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 130 transition count 192
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 130 transition count 192
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 129 transition count 191
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 129 transition count 191
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 9 place count 129 transition count 190
Applied a total of 9 rules in 15 ms. Remains 129 /132 variables (removed 3) and now considering 190/196 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 129/132 places, 190/196 transitions.
RANDOM walk for 40000 steps (9161 resets) in 157 ms. (253 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (1798 resets) in 98 ms. (404 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (1774 resets) in 72 ms. (547 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 18052 steps, run visited all 2 properties in 135 ms. (steps per millisecond=133 )
Probabilistic random walk after 18052 steps, saw 8856 distinct states, run finished after 135 ms. (steps per millisecond=133 ) properties seen :2
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F p2), (F (NOT (AND p1 (NOT p0) (NOT p2)))), (F (NOT (OR p1 p0 p2)))]
Knowledge based reduction with 7 factoid took 389 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Support contains 4 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 196/196 transitions.
Applied a total of 0 rules in 5 ms. Remains 132 /132 variables (removed 0) and now considering 196/196 (removed 0) transitions.
[2025-05-30 14:57:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:57:48] [INFO ] Implicit Places using invariants in 220 ms returned []
[2025-05-30 14:57:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:57:48] [INFO ] State equation strengthened by 71 read => feed constraints.
[2025-05-30 14:57:49] [INFO ] Implicit Places using invariants and state equation in 1416 ms returned []
Implicit Place search using SMT with State Equation took 1648 ms to find 0 implicit places.
Running 195 sub problems to find dead transitions.
[2025-05-30 14:57:49] [INFO ] Invariant cache hit.
[2025-05-30 14:57:49] [INFO ] State equation strengthened by 71 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 196/328 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/328 variables, 71/205 constraints. Problems are: Problem set: 0 solved, 195 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (OVERLAPS) 0/328 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 205 constraints, problems are : Problem set: 0 solved, 195 unsolved in 25923 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 196/328 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/328 variables, 71/205 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 195/400 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 328/328 variables, and 400 constraints, problems are : Problem set: 0 solved, 195 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56111ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 56112ms
Finished structural reductions in LTL mode , in 1 iterations and 57766 ms. Remains : 132/132 places, 196/196 transitions.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 482 edges and 132 vertex of which 131 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 104 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
RANDOM walk for 40000 steps (9191 resets) in 221 ms. (180 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40002 steps (1734 resets) in 55 ms. (714 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1813 resets) in 56 ms. (701 steps per ms) remains 2/2 properties
[2025-05-30 14:58:46] [INFO ] Invariant cache hit.
[2025-05-30 14:58:46] [INFO ] State equation strengthened by 71 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 53/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 32/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 136/224 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 11/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/224 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 98/322 variables, 41/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 57/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/322 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 6/328 variables, 3/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/328 variables, 3/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/328 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/328 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 205 constraints, problems are : Problem set: 0 solved, 2 unsolved in 349 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 53/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 32/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 136/224 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 11/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/224 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 98/322 variables, 41/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 57/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/322 variables, 2/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/322 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 6/328 variables, 3/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/328 variables, 3/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/328 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/328 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 207 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3084 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3446ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 324 ms.
Support contains 3 out of 132 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 196/196 transitions.
Graph (complete) has 451 edges and 132 vertex of which 131 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 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 131 transition count 193
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 130 transition count 192
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 130 transition count 192
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 129 transition count 191
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 129 transition count 191
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 9 place count 129 transition count 190
Applied a total of 9 rules in 20 ms. Remains 129 /132 variables (removed 3) and now considering 190/196 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 129/132 places, 190/196 transitions.
RANDOM walk for 40000 steps (9197 resets) in 240 ms. (165 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1807 resets) in 116 ms. (341 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1792 resets) in 79 ms. (500 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 18052 steps, run visited all 2 properties in 160 ms. (steps per millisecond=112 )
Probabilistic random walk after 18052 steps, saw 8856 distinct states, run finished after 160 ms. (steps per millisecond=112 ) properties seen :2
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F p2), (F (NOT (OR p0 p2 p1))), (F (NOT (AND (NOT p0) (NOT p2) p1)))]
Knowledge based reduction with 6 factoid took 348 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 22966 reset in 466 ms.
Product exploration explored 100000 steps with 22979 reset in 363 ms.
Applying partial POR strategy [false, true, false]
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 4 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 196/196 transitions.
Applied a total of 0 rules in 10 ms. Remains 132 /132 variables (removed 0) and now considering 196/196 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 14:58:52] [INFO ] Redundant transitions in 4 ms returned []
Running 195 sub problems to find dead transitions.
[2025-05-30 14:58:52] [INFO ] Invariant cache hit.
[2025-05-30 14:58:52] [INFO ] State equation strengthened by 71 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 196/328 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/328 variables, 71/205 constraints. Problems are: Problem set: 0 solved, 195 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (OVERLAPS) 0/328 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 205 constraints, problems are : Problem set: 0 solved, 195 unsolved in 25979 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 196/328 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/328 variables, 71/205 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 195/400 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 328/328 variables, and 400 constraints, problems are : Problem set: 0 solved, 195 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56324ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 56325ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 56349 ms. Remains : 132/132 places, 196/196 transitions.
Built C files in :
/tmp/ltsmin13230290474913602473
[2025-05-30 14:59:48] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13230290474913602473
Running compilation step : cd /tmp/ltsmin13230290474913602473;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 680 ms.
Running link step : cd /tmp/ltsmin13230290474913602473;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin13230290474913602473;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12694609250728908807.hoa' '--buchi-type=spotba'
LTSmin run took 263 ms.
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-13 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-13 finished in 187040 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
Support contains 4 out of 204 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 204/204 places, 407/407 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 180 transition count 310
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 180 transition count 310
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 50 place count 180 transition count 308
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 70 place count 160 transition count 276
Iterating global reduction 1 with 20 rules applied. Total rules applied 90 place count 160 transition count 276
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 102 place count 160 transition count 264
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 116 place count 146 transition count 244
Iterating global reduction 2 with 14 rules applied. Total rules applied 130 place count 146 transition count 244
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 137 place count 146 transition count 237
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 148 place count 135 transition count 201
Iterating global reduction 3 with 11 rules applied. Total rules applied 159 place count 135 transition count 201
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 168 place count 135 transition count 192
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 170 place count 133 transition count 190
Iterating global reduction 4 with 2 rules applied. Total rules applied 172 place count 133 transition count 190
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 173 place count 133 transition count 189
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 174 place count 132 transition count 188
Iterating global reduction 5 with 1 rules applied. Total rules applied 175 place count 132 transition count 188
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 176 place count 132 transition count 187
Applied a total of 176 rules in 30 ms. Remains 132 /204 variables (removed 72) and now considering 187/407 (removed 220) transitions.
// Phase 1: matrix 187 rows 132 cols
[2025-05-30 14:59:49] [INFO ] Computed 2 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:59:49] [INFO ] Implicit Places using invariants in 194 ms returned []
[2025-05-30 14:59:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:59:50] [INFO ] State equation strengthened by 60 read => feed constraints.
[2025-05-30 14:59:50] [INFO ] Implicit Places using invariants and state equation in 795 ms returned []
Implicit Place search using SMT with State Equation took 995 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 14:59:50] [INFO ] Redundant transitions in 3 ms returned []
Running 186 sub problems to find dead transitions.
[2025-05-30 14:59:50] [INFO ] Invariant cache hit.
[2025-05-30 14:59:50] [INFO ] State equation strengthened by 60 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (OVERLAPS) 187/319 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 60/194 constraints. Problems are: Problem set: 0 solved, 186 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:00:03] [INFO ] Deduced a trap composed of 12 places in 139 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:00:03] [INFO ] Deduced a trap composed of 53 places in 148 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:00:04] [INFO ] Deduced a trap composed of 54 places in 161 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:00:04] [INFO ] Deduced a trap composed of 13 places in 151 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:00:05] [INFO ] Deduced a trap composed of 56 places in 129 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:00:05] [INFO ] Deduced a trap composed of 57 places in 131 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:00:05] [INFO ] Deduced a trap composed of 57 places in 155 ms of which 14 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 7/201 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 8 (OVERLAPS) 0/319 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Real declared 319/319 variables, and 201 constraints, problems are : Problem set: 0 solved, 186 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 186 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 1/132 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (OVERLAPS) 187/319 variables, 132/141 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 60/201 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/319 variables, 186/387 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/319 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 186 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 319/319 variables, and 387 constraints, problems are : Problem set: 0 solved, 186 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60141ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 60143ms
Starting structural reductions in SI_LTL mode, iteration 1 : 132/204 places, 187/407 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61177 ms. Remains : 132/204 places, 187/407 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-15
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-15 finished in 61308 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||X((p1||G(F(!p2)))))))'
Found a Lengthening insensitive property : DBSingleClientW-PT-d2m07-LTLFireability-12
Stuttering acceptance computed with spot in 229 ms :[(AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) p1 p2), (AND (NOT p0) p2)]
Support contains 4 out of 204 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 204/204 places, 407/407 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 181 transition count 323
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 181 transition count 323
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 181 transition count 322
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 67 place count 161 transition count 297
Iterating global reduction 1 with 20 rules applied. Total rules applied 87 place count 161 transition count 297
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 103 place count 161 transition count 281
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 118 place count 146 transition count 258
Iterating global reduction 2 with 15 rules applied. Total rules applied 133 place count 146 transition count 258
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 142 place count 146 transition count 249
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 152 place count 136 transition count 215
Iterating global reduction 3 with 10 rules applied. Total rules applied 162 place count 136 transition count 215
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 167 place count 136 transition count 210
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 169 place count 134 transition count 208
Iterating global reduction 4 with 2 rules applied. Total rules applied 171 place count 134 transition count 208
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 172 place count 134 transition count 207
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 173 place count 133 transition count 206
Iterating global reduction 5 with 1 rules applied. Total rules applied 174 place count 133 transition count 206
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 176 place count 133 transition count 204
Applied a total of 176 rules in 38 ms. Remains 133 /204 variables (removed 71) and now considering 204/407 (removed 203) transitions.
// Phase 1: matrix 204 rows 133 cols
[2025-05-30 15:00:51] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 15:00:51] [INFO ] Implicit Places using invariants in 222 ms returned []
[2025-05-30 15:00:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 15:00:51] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-05-30 15:00:52] [INFO ] Implicit Places using invariants and state equation in 1170 ms returned []
Implicit Place search using SMT with State Equation took 1404 ms to find 0 implicit places.
Running 203 sub problems to find dead transitions.
[2025-05-30 15:00:52] [INFO ] Invariant cache hit.
[2025-05-30 15:00:52] [INFO ] State equation strengthened by 78 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 204/337 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/337 variables, 78/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (OVERLAPS) 0/337 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 337/337 variables, and 213 constraints, problems are : Problem set: 0 solved, 203 unsolved in 20176 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 203 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 204/337 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/337 variables, 78/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 203/416 constraints. Problems are: Problem set: 0 solved, 203 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 337/337 variables, and 416 constraints, problems are : Problem set: 0 solved, 203 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50401ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 50402ms
Starting structural reductions in LI_LTL mode, iteration 1 : 133/204 places, 204/407 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 51847 ms. Remains : 133/204 places, 204/407 transitions.
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-12
Product exploration explored 100000 steps with 29780 reset in 390 ms.
Product exploration explored 100000 steps with 29801 reset in 495 ms.
Computed a total of 5 stabilizing places and 18 stable transitions
Graph (complete) has 491 edges and 133 vertex of which 132 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 230 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 219 ms :[(AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) p1 p2), (AND (NOT p0) p2)]
RANDOM walk for 40000 steps (9200 resets) in 364 ms. (109 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1841 resets) in 128 ms. (310 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1735 resets) in 93 ms. (425 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (1838 resets) in 99 ms. (400 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1796 resets) in 165 ms. (240 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1760 resets) in 142 ms. (279 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (1764 resets) in 160 ms. (248 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (1807 resets) in 99 ms. (400 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (1743 resets) in 135 ms. (294 steps per ms) remains 8/8 properties
Finished probabilistic random walk after 73712 steps, run visited all 8 properties in 571 ms. (steps per millisecond=129 )
Probabilistic random walk after 73712 steps, saw 32576 distinct states, run finished after 572 ms. (steps per millisecond=128 ) properties seen :8
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1 p2))))]
False Knowledge obtained : [(F p0), (F (NOT (OR p0 (NOT p2)))), (F (NOT (OR p0 (NOT p2) p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p2), (F (NOT (OR p0 (NOT p2) (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F p1)]
Knowledge based reduction with 12 factoid took 671 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) p1 p2), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) p1 p2), (AND (NOT p0) p2)]
Support contains 4 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 204/204 transitions.
Applied a total of 0 rules in 2 ms. Remains 133 /133 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2025-05-30 15:01:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 15:01:47] [INFO ] Implicit Places using invariants in 235 ms returned []
[2025-05-30 15:01:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 15:01:47] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-05-30 15:01:48] [INFO ] Implicit Places using invariants and state equation in 1181 ms returned []
Implicit Place search using SMT with State Equation took 1418 ms to find 0 implicit places.
Running 203 sub problems to find dead transitions.
[2025-05-30 15:01:48] [INFO ] Invariant cache hit.
[2025-05-30 15:01:48] [INFO ] State equation strengthened by 78 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 204/337 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/337 variables, 78/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (OVERLAPS) 0/337 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 337/337 variables, and 213 constraints, problems are : Problem set: 0 solved, 203 unsolved in 19533 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 203 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 204/337 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/337 variables, 78/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 203/416 constraints. Problems are: Problem set: 0 solved, 203 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 337/337 variables, and 416 constraints, problems are : Problem set: 0 solved, 203 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49755ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 49756ms
Finished structural reductions in LTL mode , in 1 iterations and 51179 ms. Remains : 133/133 places, 204/204 transitions.
Computed a total of 5 stabilizing places and 18 stable transitions
Graph (complete) has 491 edges and 133 vertex of which 132 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 183 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) p1 p2), (AND (NOT p0) p2)]
RANDOM walk for 40000 steps (9170 resets) in 313 ms. (127 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1758 resets) in 97 ms. (408 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1747 resets) in 135 ms. (294 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (1691 resets) in 150 ms. (264 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1760 resets) in 118 ms. (336 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (1819 resets) in 102 ms. (388 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1805 resets) in 88 ms. (449 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1784 resets) in 89 ms. (444 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1794 resets) in 87 ms. (454 steps per ms) remains 8/8 properties
Finished probabilistic random walk after 73712 steps, run visited all 8 properties in 420 ms. (steps per millisecond=175 )
Probabilistic random walk after 73712 steps, saw 32576 distinct states, run finished after 420 ms. (steps per millisecond=175 ) properties seen :8
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (OR p0 (NOT p2)))), (F (NOT (OR p0 (NOT p2) p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p2), (F (NOT (OR p0 (NOT p2) (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F p1)]
Knowledge based reduction with 12 factoid took 541 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 220 ms :[(AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) p1 p2), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) p1 p2), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) p1 p2), (AND (NOT p0) p2)]
Product exploration explored 100000 steps with 29775 reset in 465 ms.
Product exploration explored 100000 steps with 29784 reset in 492 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 218 ms :[(AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) p1 p2), (AND (NOT p0) p2)]
Support contains 4 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 204/204 transitions.
Applied a total of 0 rules in 13 ms. Remains 133 /133 variables (removed 0) and now considering 204/204 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 15:02:41] [INFO ] Redundant transitions in 2 ms returned []
Running 203 sub problems to find dead transitions.
[2025-05-30 15:02:41] [INFO ] Invariant cache hit.
[2025-05-30 15:02:41] [INFO ] State equation strengthened by 78 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 204/337 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/337 variables, 78/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (OVERLAPS) 0/337 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 337/337 variables, and 213 constraints, problems are : Problem set: 0 solved, 203 unsolved in 20679 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 203 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 204/337 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/337 variables, 78/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 203/416 constraints. Problems are: Problem set: 0 solved, 203 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 337/337 variables, and 416 constraints, problems are : Problem set: 0 solved, 203 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50934ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 50935ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 50962 ms. Remains : 133/133 places, 204/204 transitions.
Built C files in :
/tmp/ltsmin8828483727821780436
[2025-05-30 15:03:32] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8828483727821780436
Running compilation step : cd /tmp/ltsmin8828483727821780436;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 642 ms.
Running link step : cd /tmp/ltsmin8828483727821780436;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin8828483727821780436;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6545441617223794293.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 204/204 transitions.
Applied a total of 0 rules in 1 ms. Remains 133 /133 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2025-05-30 15:03:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 15:03:48] [INFO ] Implicit Places using invariants in 132 ms returned []
[2025-05-30 15:03:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 15:03:48] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-05-30 15:03:49] [INFO ] Implicit Places using invariants and state equation in 1127 ms returned []
Implicit Place search using SMT with State Equation took 1261 ms to find 0 implicit places.
Running 203 sub problems to find dead transitions.
[2025-05-30 15:03:49] [INFO ] Invariant cache hit.
[2025-05-30 15:03:49] [INFO ] State equation strengthened by 78 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 204/337 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/337 variables, 78/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (OVERLAPS) 0/337 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 337/337 variables, and 213 constraints, problems are : Problem set: 0 solved, 203 unsolved in 20787 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 203 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 204/337 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/337 variables, 78/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 203/416 constraints. Problems are: Problem set: 0 solved, 203 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 337/337 variables, and 416 constraints, problems are : Problem set: 0 solved, 203 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 51036ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 51038ms
Finished structural reductions in LTL mode , in 1 iterations and 52303 ms. Remains : 133/133 places, 204/204 transitions.
Built C files in :
/tmp/ltsmin1947944814935514448
[2025-05-30 15:04:40] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1947944814935514448
Running compilation step : cd /tmp/ltsmin1947944814935514448;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 601 ms.
Running link step : cd /tmp/ltsmin1947944814935514448;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin1947944814935514448;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10368081012084413045.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-30 15:04:55] [INFO ] Flatten gal took : 13 ms
[2025-05-30 15:04:55] [INFO ] Flatten gal took : 12 ms
[2025-05-30 15:04:55] [INFO ] Time to serialize gal into /tmp/LTL1257372450151165784.gal : 3 ms
[2025-05-30 15:04:55] [INFO ] Time to serialize properties into /tmp/LTL5155428782167679045.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1257372450151165784.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5343557199132318311.hoa' '-atoms' '/tmp/LTL5155428782167679045.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL5155428782167679045.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5343557199132318311.hoa
Detected timeout of ITS tools.
[2025-05-30 15:05:10] [INFO ] Flatten gal took : 12 ms
[2025-05-30 15:05:10] [INFO ] Flatten gal took : 12 ms
[2025-05-30 15:05:10] [INFO ] Time to serialize gal into /tmp/LTL10334960124208350568.gal : 3 ms
[2025-05-30 15:05:10] [INFO ] Time to serialize properties into /tmp/LTL14767666389364848461.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10334960124208350568.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14767666389364848461.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G((F("((s1>=1)&&(l1667>=1))"))||(X(("((s1>=1)&&(l4272>=1))")||(G(F("((s1<1)||(l3092<1))"))))))))
Formula 0 simplified : F(G!"((s1>=1)&&(l1667>=1))" & X(!"((s1>=1)&&(l4272>=1))" & FG!"((s1<1)||(l3092<1))"))
Detected timeout of ITS tools.
[2025-05-30 15:05:25] [INFO ] Flatten gal took : 12 ms
[2025-05-30 15:05:25] [INFO ] Applying decomposition
[2025-05-30 15:05:25] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph822922933518837420.txt' '-o' '/tmp/graph822922933518837420.bin' '-w' '/tmp/graph822922933518837420.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph822922933518837420.bin' '-l' '-1' '-v' '-w' '/tmp/graph822922933518837420.weights' '-q' '0' '-e' '0.001'
[2025-05-30 15:05:25] [INFO ] Decomposing Gal with order
[2025-05-30 15:05:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 15:05:25] [INFO ] Removed a total of 174 redundant transitions.
[2025-05-30 15:05:25] [INFO ] Flatten gal took : 33 ms
[2025-05-30 15:05:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 133 labels/synchronizations in 8 ms.
[2025-05-30 15:05:25] [INFO ] Time to serialize gal into /tmp/LTL15911244730692583105.gal : 4 ms
[2025-05-30 15:05:25] [INFO ] Time to serialize properties into /tmp/LTL3585182181330731139.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15911244730692583105.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3585182181330731139.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G((F("((i0.u0.s1>=1)&&(i0.u0.l1667>=1))"))||(X(("((i0.u0.s1>=1)&&(u4.l4272>=1))")||(G(F("((i0.u0.s1<1)||(i0.u0.l3092<1))"))))))))
Formula 0 simplified : F(G!"((i0.u0.s1>=1)&&(i0.u0.l1667>=1))" & X(!"((i0.u0.s1>=1)&&(u4.l4272>=1))" & FG!"((i0.u0.s1<1)||(i0.u0.l3092<1))"))
Detected timeout of ITS tools.
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-12 finished in 289796 ms.
[2025-05-30 15:05:40] [INFO ] Flatten gal took : 21 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13677452119893569008
[2025-05-30 15:05:40] [INFO ] Computing symmetric may disable matrix : 407 transitions.
[2025-05-30 15:05:40] [INFO ] Applying decomposition
[2025-05-30 15:05:40] [INFO ] Computation of Complete disable matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 15:05:40] [INFO ] Flatten gal took : 21 ms
[2025-05-30 15:05:40] [INFO ] Computing symmetric may enable matrix : 407 transitions.
[2025-05-30 15:05:40] [INFO ] Computation of Complete enable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph13006838202073628692.txt' '-o' '/tmp/graph13006838202073628692.bin' '-w' '/tmp/graph13006838202073628692.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13006838202073628692.bin' '-l' '-1' '-v' '-w' '/tmp/graph13006838202073628692.weights' '-q' '0' '-e' '0.001'
[2025-05-30 15:05:41] [INFO ] Decomposing Gal with order
[2025-05-30 15:05:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 15:05:41] [INFO ] Computing Do-Not-Accords matrix : 407 transitions.
[2025-05-30 15:05:41] [INFO ] Computation of Completed DNA matrix. took 58 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 15:05:41] [INFO ] Built C files in 226ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13677452119893569008
Running compilation step : cd /tmp/ltsmin13677452119893569008;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-05-30 15:05:41] [INFO ] Removed a total of 453 redundant transitions.
[2025-05-30 15:05:41] [INFO ] Flatten gal took : 117 ms
[2025-05-30 15:05:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 376 labels/synchronizations in 18 ms.
[2025-05-30 15:05:41] [INFO ] Time to serialize gal into /tmp/LTLFireability15140806515309307556.gal : 5 ms
[2025-05-30 15:05:41] [INFO ] Time to serialize properties into /tmp/LTLFireability2693950727536864284.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability15140806515309307556.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2693950727536864284.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G((F("((i4.u0.s1>=1)&&(i4.u0.l1667>=1))"))||(X(("((i4.u0.s1>=1)&&(u18.l4272>=1))")||(G(F(!("((i4.u0.s1>=1)&&(i4.u6.l3092>=1))")))))...159
Formula 0 simplified : F(G!"((i4.u0.s1>=1)&&(i4.u0.l1667>=1))" & X(!"((i4.u0.s1>=1)&&(u18.l4272>=1))" & FG"((i4.u0.s1>=1)&&(i4.u6.l3092>=1))"))
Compilation finished in 1980 ms.
Running link step : cd /tmp/ltsmin13677452119893569008;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 66 ms.
Running LTSmin : cd /tmp/ltsmin13677452119893569008;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>((LTLAPp0==true))||X(((LTLAPp1==true)||[](<>(!(LTLAPp2==true)))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t6, t11, t85, t94, t95, t111, t112, t122, t123, t124, t126, t183, t184, t186, t193, t...1253
Computing Next relation with stutter on 2.54578e+08 deadlock states
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.051: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.050: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.050: LTL layer: formula: []((<>((LTLAPp0==true))||X(((LTLAPp1==true)||[](<>(!(LTLAPp2==true)))))))
pins2lts-mc-linux64( 4/ 8), 0.050: "[]((<>((LTLAPp0==true))||X(((LTLAPp1==true)||[](<>(!(LTLAPp2==true)))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.051: Using Spin LTL semantics
pins2lts-mc-linux64( 6/ 8), 0.062: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.069: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.073: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.087: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.092: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.096: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.107: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.178: DFS-FIFO for weak LTL, using special progress label 411
pins2lts-mc-linux64( 0/ 8), 0.178: There are 412 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.178: State length is 205, there are 414 groups
pins2lts-mc-linux64( 0/ 8), 0.178: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.178: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.178: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.178: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.268: ~1 levels ~960 states ~1824 transitions
pins2lts-mc-linux64( 3/ 8), 0.316: ~1 levels ~1920 states ~6728 transitions
pins2lts-mc-linux64( 3/ 8), 0.355: ~1 levels ~3840 states ~10848 transitions
pins2lts-mc-linux64( 4/ 8), 0.465: ~1 levels ~7680 states ~19856 transitions
pins2lts-mc-linux64( 3/ 8), 0.626: ~1 levels ~15360 states ~35584 transitions
pins2lts-mc-linux64( 3/ 8), 1.147: ~1 levels ~30720 states ~91400 transitions
pins2lts-mc-linux64( 3/ 8), 1.916: ~1 levels ~61440 states ~160440 transitions
pins2lts-mc-linux64( 0/ 8), 3.339: ~1 levels ~122880 states ~371120 transitions
pins2lts-mc-linux64( 2/ 8), 5.778: ~1 levels ~245760 states ~676096 transitions
pins2lts-mc-linux64( 4/ 8), 9.122: ~1 levels ~491520 states ~1332200 transitions
pins2lts-mc-linux64( 4/ 8), 14.315: ~1 levels ~983040 states ~2611696 transitions
pins2lts-mc-linux64( 4/ 8), 23.369: ~1 levels ~1966080 states ~4732136 transitions
pins2lts-mc-linux64( 3/ 8), 43.240: ~1 levels ~3932160 states ~10236952 transitions
pins2lts-mc-linux64( 4/ 8), 83.280: ~1 levels ~7864320 states ~21228608 transitions
pins2lts-mc-linux64( 4/ 8), 156.281: ~1 levels ~15728640 states ~37440184 transitions
pins2lts-mc-linux64( 4/ 8), 313.308: ~1 levels ~31457280 states ~80853288 transitions
pins2lts-mc-linux64( 5/ 8), 636.982: ~1 levels ~62914560 states ~179003992 transitions
pins2lts-mc-linux64( 3/ 8), 1266.068: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1266.142:
pins2lts-mc-linux64( 0/ 8), 1266.143: mean standard work distribution: 2.6% (states) 3.1% (transitions)
pins2lts-mc-linux64( 0/ 8), 1266.143:
pins2lts-mc-linux64( 0/ 8), 1266.143: Explored 119185658 states 364690676 transitions, fanout: 3.060
pins2lts-mc-linux64( 0/ 8), 1266.143: Total exploration time 1265.950 sec (1265.870 sec minimum, 1265.917 sec on average)
pins2lts-mc-linux64( 0/ 8), 1266.143: States per second: 94147, Transitions per second: 288077
pins2lts-mc-linux64( 0/ 8), 1266.143:
pins2lts-mc-linux64( 0/ 8), 1266.143: Progress states detected: 133476112
pins2lts-mc-linux64( 0/ 8), 1266.143: Redundant explorations: -11.1991
pins2lts-mc-linux64( 0/ 8), 1266.143:
pins2lts-mc-linux64( 0/ 8), 1266.143: Queue width: 8B, total height: 43153429, memory: 329.23MB
pins2lts-mc-linux64( 0/ 8), 1266.143: Tree memory: 1195.2MB, 9.3 B/state, compr.: 1.1%
pins2lts-mc-linux64( 0/ 8), 1266.143: Tree fill ratio (roots/leafs): 99.0%/66.0%
pins2lts-mc-linux64( 0/ 8), 1266.143: Stored 409 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1266.143: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1266.143: Est. total memory use: 1524.4MB (~1353.2MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin13677452119893569008;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>((LTLAPp0==true))||X(((LTLAPp1==true)||[](<>(!(LTLAPp2==true)))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin13677452119893569008;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>((LTLAPp0==true))||X(((LTLAPp1==true)||[](<>(!(LTLAPp2==true)))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:1583)
Detected timeout of ITS tools.
[2025-05-30 15:32:44] [INFO ] Flatten gal took : 19 ms
[2025-05-30 15:32:44] [INFO ] Time to serialize gal into /tmp/LTLFireability14356049081763530056.gal : 4 ms
[2025-05-30 15:32:44] [INFO ] Time to serialize properties into /tmp/LTLFireability16857099806247841831.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability14356049081763530056.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16857099806247841831.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 1 LTL properties
Checking formula 0 : !((G((F("((s1>=1)&&(l1667>=1))"))||(X(("((s1>=1)&&(l4272>=1))")||(G(F(!("((s1>=1)&&(l3092>=1))")))))))))
Formula 0 simplified : F(G!"((s1>=1)&&(l1667>=1))" & X(!"((s1>=1)&&(l4272>=1))" & FG"((s1>=1)&&(l3092>=1))"))

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DBSingleClientW-PT-d2m07"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is DBSingleClientW-PT-d2m07, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r058-smll-174854063600140"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d2m07.tgz
mv DBSingleClientW-PT-d2m07 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;