Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r058-smll-174854063600156.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-d2m09, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r058-smll-174854063600156
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 8.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 19K 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 119K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K 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 3.8K 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-d2m09-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748629112894

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-d2m09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-30 18:18:35] [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 18:18:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 18:18:36] [INFO ] Load time of PNML (sax parser for PT used): 603 ms
[2025-05-30 18:18:36] [INFO ] Transformed 4763 places.
[2025-05-30 18:18:36] [INFO ] Transformed 2478 transitions.
[2025-05-30 18:18:36] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 861 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 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-d2m09-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 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 366 places :
Symmetric choice reduction at 1 with 366 rule applications. Total rules 611 place count 771 transition count 1489
Iterating global reduction 1 with 366 rules applied. Total rules applied 977 place count 771 transition count 1489
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 1049 place count 771 transition count 1417
Discarding 294 places :
Symmetric choice reduction at 2 with 294 rule applications. Total rules 1343 place count 477 transition count 1123
Iterating global reduction 2 with 294 rules applied. Total rules applied 1637 place count 477 transition count 1123
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 1640 place count 477 transition count 1120
Discarding 219 places :
Symmetric choice reduction at 3 with 219 rule applications. Total rules 1859 place count 258 transition count 817
Iterating global reduction 3 with 219 rules applied. Total rules applied 2078 place count 258 transition count 817
Ensure Unique test removed 259 transitions
Reduce isomorphic transitions removed 259 transitions.
Iterating post reduction 3 with 259 rules applied. Total rules applied 2337 place count 258 transition count 558
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 2349 place count 246 transition count 539
Iterating global reduction 4 with 12 rules applied. Total rules applied 2361 place count 246 transition count 539
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 2372 place count 235 transition count 528
Iterating global reduction 4 with 11 rules applied. Total rules applied 2383 place count 235 transition count 528
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 2386 place count 235 transition count 525
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 2395 place count 226 transition count 516
Iterating global reduction 5 with 9 rules applied. Total rules applied 2404 place count 226 transition count 516
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 2411 place count 226 transition count 509
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 2414 place count 223 transition count 500
Iterating global reduction 6 with 3 rules applied. Total rules applied 2417 place count 223 transition count 500
Applied a total of 2417 rules in 293 ms. Remains 223 /1183 variables (removed 960) and now considering 500/2478 (removed 1978) transitions.
// Phase 1: matrix 500 rows 223 cols
[2025-05-30 18:18:37] [INFO ] Computed 2 invariants in 32 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:18:37] [INFO ] Implicit Places using invariants in 848 ms returned []
[2025-05-30 18:18:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:18:38] [INFO ] State equation strengthened by 285 read => feed constraints.
[2025-05-30 18:18:44] [INFO ] Implicit Places using invariants and state equation in 6904 ms returned []
Implicit Place search using SMT with State Equation took 7805 ms to find 0 implicit places.
Running 499 sub problems to find dead transitions.
[2025-05-30 18:18:44] [INFO ] Invariant cache hit.
[2025-05-30 18:18:44] [INFO ] State equation strengthened by 285 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 1 (OVERLAPS) 1/223 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/223 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/223 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 4 (OVERLAPS) 500/723 variables, 223/225 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/723 variables, 285/510 constraints. Problems are: Problem set: 0 solved, 499 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 723/723 variables, and 510 constraints, problems are : Problem set: 0 solved, 499 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 223/223 constraints, ReadFeed: 285/285 constraints, PredecessorRefiner: 499/499 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 499 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 1 (OVERLAPS) 1/223 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/223 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/223 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 4 (OVERLAPS) 500/723 variables, 223/225 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/723 variables, 285/510 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/723 variables, 499/1009 constraints. Problems are: Problem set: 0 solved, 499 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 723/723 variables, and 1009 constraints, problems are : Problem set: 0 solved, 499 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 223/223 constraints, ReadFeed: 285/285 constraints, PredecessorRefiner: 499/499 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61641ms problems are : Problem set: 0 solved, 499 unsolved
Search for dead transitions found 0 dead transitions in 61671ms
Starting structural reductions in LTL mode, iteration 1 : 223/1183 places, 500/2478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69799 ms. Remains : 223/1183 places, 500/2478 transitions.
Support contains 36 out of 223 places after structural reductions.
[2025-05-30 18:19:46] [INFO ] Flatten gal took : 95 ms
[2025-05-30 18:19:47] [INFO ] Flatten gal took : 58 ms
[2025-05-30 18:19:47] [INFO ] Input system was already deterministic with 500 transitions.
Reduction of identical properties reduced properties to check from 35 to 32
RANDOM walk for 40000 steps (9132 resets) in 5010 ms. (7 steps per ms) remains 31/32 properties
BEST_FIRST walk for 4002 steps (176 resets) in 62 ms. (63 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (165 resets) in 31 ms. (125 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (172 resets) in 35 ms. (111 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (191 resets) in 63 ms. (62 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (169 resets) in 58 ms. (67 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (197 resets) in 51 ms. (76 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (438 resets) in 78 ms. (50 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (193 resets) in 42 ms. (93 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (383 resets) in 35 ms. (111 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (158 resets) in 27 ms. (142 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (387 resets) in 60 ms. (65 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (178 resets) in 38 ms. (102 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (178 resets) in 29 ms. (133 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (179 resets) in 21 ms. (182 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (187 resets) in 20 ms. (190 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (188 resets) in 25 ms. (153 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (197 resets) in 25 ms. (153 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (182 resets) in 24 ms. (160 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (168 resets) in 22 ms. (174 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (171 resets) in 23 ms. (166 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (166 resets) in 21 ms. (181 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (413 resets) in 32 ms. (121 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (166 resets) in 25 ms. (154 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (359 resets) in 48 ms. (81 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (159 resets) in 20 ms. (190 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (175 resets) in 24 ms. (160 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (163 resets) in 22 ms. (174 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (194 resets) in 24 ms. (160 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (178 resets) in 24 ms. (160 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (194 resets) in 50 ms. (78 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (361 resets) in 32 ms. (121 steps per ms) remains 31/31 properties
Interrupted probabilistic random walk after 748534 steps, run timeout after 3001 ms. (steps per millisecond=249 ) properties seen :30 out of 31
Probabilistic random walk after 748534 steps, saw 291117 distinct states, run finished after 3008 ms. (steps per millisecond=248 ) properties seen :30
[2025-05-30 18:19:52] [INFO ] Invariant cache hit.
[2025-05-30 18:19:52] [INFO ] State equation strengthened by 285 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, 1 unsolved
At refinement iteration 1 (OVERLAPS) 83/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 50/136 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 252/388 variables, 136/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 37/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 329/717 variables, 84/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/717 variables, 245/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/717 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/723 variables, 3/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/723 variables, 3/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/723 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/723 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 723/723 variables, and 510 constraints, problems are : Problem set: 0 solved, 1 unsolved in 659 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 223/223 constraints, ReadFeed: 285/285 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
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, 1 unsolved
At refinement iteration 1 (OVERLAPS) 83/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 50/136 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 252/388 variables, 136/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 37/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 329/717 variables, 84/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/717 variables, 245/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/717 variables, 1/505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/717 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 6/723 variables, 3/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/723 variables, 3/511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/723 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/723 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 723/723 variables, and 511 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2214 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 223/223 constraints, ReadFeed: 285/285 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2897ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 140 ms.
Support contains 3 out of 223 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 223/223 places, 500/500 transitions.
Graph (complete) has 873 edges and 223 vertex of which 222 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 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 222 transition count 491
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 38 place count 194 transition count 338
Iterating global reduction 1 with 28 rules applied. Total rules applied 66 place count 194 transition count 338
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 68 place count 194 transition count 336
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 90 place count 172 transition count 308
Iterating global reduction 2 with 22 rules applied. Total rules applied 112 place count 172 transition count 308
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 123 place count 172 transition count 297
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 141 place count 154 transition count 260
Iterating global reduction 3 with 18 rules applied. Total rules applied 159 place count 154 transition count 260
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 165 place count 154 transition count 254
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 177 place count 142 transition count 235
Iterating global reduction 4 with 12 rules applied. Total rules applied 189 place count 142 transition count 235
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 199 place count 142 transition count 225
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 204 place count 137 transition count 220
Iterating global reduction 5 with 5 rules applied. Total rules applied 209 place count 137 transition count 220
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 214 place count 137 transition count 215
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 219 place count 132 transition count 193
Iterating global reduction 6 with 5 rules applied. Total rules applied 224 place count 132 transition count 193
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 225 place count 132 transition count 192
Applied a total of 225 rules in 79 ms. Remains 132 /223 variables (removed 91) and now considering 192/500 (removed 308) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 132/223 places, 192/500 transitions.
RANDOM walk for 40000 steps (9211 resets) in 167 ms. (238 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1754 resets) in 75 ms. (526 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 73864 steps, run visited all 1 properties in 140 ms. (steps per millisecond=527 )
Probabilistic random walk after 73864 steps, saw 32873 distinct states, run finished after 145 ms. (steps per millisecond=509 ) properties seen :1
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 5 stabilizing places and 39 stable transitions
Graph (complete) has 948 edges and 223 vertex of which 222 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 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(G(p0))&&F((G(F(!p1))||(F(!p1)&&X(p0)))))))'
Support contains 3 out of 223 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 223/223 places, 500/500 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 195 transition count 339
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 195 transition count 339
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 195 transition count 337
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 81 place count 172 transition count 308
Iterating global reduction 1 with 23 rules applied. Total rules applied 104 place count 172 transition count 308
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 116 place count 172 transition count 296
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 135 place count 153 transition count 257
Iterating global reduction 2 with 19 rules applied. Total rules applied 154 place count 153 transition count 257
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 160 place count 153 transition count 251
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 172 place count 141 transition count 227
Iterating global reduction 3 with 12 rules applied. Total rules applied 184 place count 141 transition count 227
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 190 place count 141 transition count 221
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 196 place count 135 transition count 215
Iterating global reduction 4 with 6 rules applied. Total rules applied 202 place count 135 transition count 215
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 207 place count 135 transition count 210
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 213 place count 129 transition count 187
Iterating global reduction 5 with 6 rules applied. Total rules applied 219 place count 129 transition count 187
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 222 place count 129 transition count 184
Applied a total of 222 rules in 71 ms. Remains 129 /223 variables (removed 94) and now considering 184/500 (removed 316) transitions.
// Phase 1: matrix 184 rows 129 cols
[2025-05-30 18:19:56] [INFO ] Computed 2 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:19:56] [INFO ] Implicit Places using invariants in 159 ms returned []
[2025-05-30 18:19:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:19:56] [INFO ] State equation strengthened by 63 read => feed constraints.
[2025-05-30 18:19:57] [INFO ] Implicit Places using invariants and state equation in 1247 ms returned []
Implicit Place search using SMT with State Equation took 1409 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 18:19:57] [INFO ] Redundant transitions in 8 ms returned []
Running 183 sub problems to find dead transitions.
[2025-05-30 18:19:57] [INFO ] Invariant cache hit.
[2025-05-30 18:19:57] [INFO ] State equation strengthened by 63 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 4 (OVERLAPS) 184/313 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 63/194 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 7 (OVERLAPS) 0/313 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 183 unsolved
No progress, stopping.
After SMT solving in domain Real declared 313/313 variables, and 194 constraints, problems are : Problem set: 0 solved, 183 unsolved in 13678 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 183 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 4 (OVERLAPS) 184/313 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 63/194 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 183/377 constraints. Problems are: Problem set: 0 solved, 183 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 313/313 variables, and 377 constraints, problems are : Problem set: 0 solved, 183 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43861ms problems are : Problem set: 0 solved, 183 unsolved
Search for dead transitions found 0 dead transitions in 43863ms
Starting structural reductions in SI_LTL mode, iteration 1 : 129/223 places, 184/500 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 45357 ms. Remains : 129/223 places, 184/500 transitions.
Stuttering acceptance computed with spot in 311 ms :[(OR (NOT p0) p1), (NOT p0), p1]
Running random walk in product with property : DBSingleClientW-PT-d2m09-LTLFireability-01
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 2 ms.
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m09-LTLFireability-01 finished in 45780 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' '!(F(p0))'
Support contains 2 out of 223 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 223/223 places, 500/500 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 194 transition count 332
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 194 transition count 332
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 194 transition count 330
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 83 place count 171 transition count 304
Iterating global reduction 1 with 23 rules applied. Total rules applied 106 place count 171 transition count 304
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 118 place count 171 transition count 292
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 137 place count 152 transition count 253
Iterating global reduction 2 with 19 rules applied. Total rules applied 156 place count 152 transition count 253
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 163 place count 152 transition count 246
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 175 place count 140 transition count 221
Iterating global reduction 3 with 12 rules applied. Total rules applied 187 place count 140 transition count 221
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 193 place count 140 transition count 215
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 198 place count 135 transition count 210
Iterating global reduction 4 with 5 rules applied. Total rules applied 203 place count 135 transition count 210
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 205 place count 135 transition count 208
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 208 place count 132 transition count 205
Iterating global reduction 5 with 3 rules applied. Total rules applied 211 place count 132 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 214 place count 132 transition count 202
Applied a total of 214 rules in 75 ms. Remains 132 /223 variables (removed 91) and now considering 202/500 (removed 298) transitions.
// Phase 1: matrix 202 rows 132 cols
[2025-05-30 18:20:41] [INFO ] Computed 2 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:20:41] [INFO ] Implicit Places using invariants in 187 ms returned []
[2025-05-30 18:20:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:20:42] [INFO ] State equation strengthened by 76 read => feed constraints.
[2025-05-30 18:20:42] [INFO ] Implicit Places using invariants and state equation in 847 ms returned []
Implicit Place search using SMT with State Equation took 1044 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 18:20:42] [INFO ] Redundant transitions in 10 ms returned []
Running 201 sub problems to find dead transitions.
[2025-05-30 18:20:42] [INFO ] Invariant cache hit.
[2025-05-30 18:20:42] [INFO ] State equation strengthened by 76 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, 201 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 202/334 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/334 variables, 76/210 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/334 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (OVERLAPS) 0/334 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Real declared 334/334 variables, and 210 constraints, problems are : Problem set: 0 solved, 201 unsolved in 19386 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 201 unsolved
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, 201 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 202/334 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/334 variables, 76/210 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/334 variables, 201/411 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 334/334 variables, and 411 constraints, problems are : Problem set: 0 solved, 201 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49594ms problems are : Problem set: 0 solved, 201 unsolved
Search for dead transitions found 0 dead transitions in 49595ms
Starting structural reductions in SI_LTL mode, iteration 1 : 132/223 places, 202/500 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 50735 ms. Remains : 132/223 places, 202/500 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m09-LTLFireability-03
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m09-LTLFireability-03 finished in 50812 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)))'
Support contains 2 out of 223 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 223/223 places, 500/500 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 194 transition count 338
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 194 transition count 338
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 194 transition count 336
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 83 place count 171 transition count 307
Iterating global reduction 1 with 23 rules applied. Total rules applied 106 place count 171 transition count 307
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 118 place count 171 transition count 295
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 137 place count 152 transition count 256
Iterating global reduction 2 with 19 rules applied. Total rules applied 156 place count 152 transition count 256
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 163 place count 152 transition count 249
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 175 place count 140 transition count 228
Iterating global reduction 3 with 12 rules applied. Total rules applied 187 place count 140 transition count 228
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 193 place count 140 transition count 222
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 198 place count 135 transition count 217
Iterating global reduction 4 with 5 rules applied. Total rules applied 203 place count 135 transition count 217
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 208 place count 135 transition count 212
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 213 place count 130 transition count 190
Iterating global reduction 5 with 5 rules applied. Total rules applied 218 place count 130 transition count 190
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 221 place count 130 transition count 187
Applied a total of 221 rules in 70 ms. Remains 130 /223 variables (removed 93) and now considering 187/500 (removed 313) transitions.
// Phase 1: matrix 187 rows 130 cols
[2025-05-30 18:21:32] [INFO ] Computed 2 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:21:32] [INFO ] Implicit Places using invariants in 233 ms returned []
[2025-05-30 18:21:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:21:33] [INFO ] State equation strengthened by 61 read => feed constraints.
[2025-05-30 18:21:33] [INFO ] Implicit Places using invariants and state equation in 1038 ms returned []
Implicit Place search using SMT with State Equation took 1285 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 18:21:33] [INFO ] Redundant transitions in 3 ms returned []
Running 186 sub problems to find dead transitions.
[2025-05-30 18:21:33] [INFO ] Invariant cache hit.
[2025-05-30 18:21:33] [INFO ] State equation strengthened by 61 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (OVERLAPS) 187/317 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 61/193 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 18:21:44] [INFO ] Deduced a trap composed of 12 places in 185 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:45] [INFO ] Deduced a trap composed of 57 places in 132 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:45] [INFO ] Deduced a trap composed of 55 places in 173 ms of which 21 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 3/196 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 0/196 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 18:21:56] [INFO ] Deduced a trap composed of 53 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 18:21:56] [INFO ] Deduced a trap composed of 53 places in 163 ms of which 24 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/317 variables, 2/198 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/317 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 186 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 317/317 variables, and 198 constraints, problems are : Problem set: 0 solved, 186 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 5/5 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/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 1/130 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (OVERLAPS) 187/317 variables, 130/137 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 61/198 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 186/384 constraints. Problems are: Problem set: 0 solved, 186 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 317/317 variables, and 384 constraints, problems are : Problem set: 0 solved, 186 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60157ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 60157ms
Starting structural reductions in SI_LTL mode, iteration 1 : 130/223 places, 187/500 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61526 ms. Remains : 130/223 places, 187/500 transitions.
Stuttering acceptance computed with spot in 98 ms :[p0, p0]
Running random walk in product with property : DBSingleClientW-PT-d2m09-LTLFireability-04
Product exploration explored 100000 steps with 23008 reset in 655 ms.
Product exploration explored 100000 steps with 23054 reset in 339 ms.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 472 edges and 130 vertex of which 129 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[p0, p0]
RANDOM walk for 40000 steps (9205 resets) in 302 ms. (132 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1825 resets) in 186 ms. (213 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 17853 steps, run visited all 1 properties in 51 ms. (steps per millisecond=350 )
Probabilistic random walk after 17853 steps, saw 8333 distinct states, run finished after 51 ms. (steps per millisecond=350 ) properties seen :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[p0, p0]
Stuttering acceptance computed with spot in 62 ms :[p0, p0]
Support contains 2 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 187/187 transitions.
Applied a total of 0 rules in 7 ms. Remains 130 /130 variables (removed 0) and now considering 187/187 (removed 0) transitions.
[2025-05-30 18:22:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:22:35] [INFO ] Implicit Places using invariants in 200 ms returned []
[2025-05-30 18:22:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:22:36] [INFO ] State equation strengthened by 61 read => feed constraints.
[2025-05-30 18:22:36] [INFO ] Implicit Places using invariants and state equation in 921 ms returned []
Implicit Place search using SMT with State Equation took 1125 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 18:22:36] [INFO ] Redundant transitions in 4 ms returned []
Running 186 sub problems to find dead transitions.
[2025-05-30 18:22:36] [INFO ] Invariant cache hit.
[2025-05-30 18:22:36] [INFO ] State equation strengthened by 61 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (OVERLAPS) 187/317 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 61/193 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 18:22:47] [INFO ] Deduced a trap composed of 12 places in 131 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:22:48] [INFO ] Deduced a trap composed of 57 places in 127 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:22:48] [INFO ] Deduced a trap composed of 55 places in 134 ms of which 20 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 3/196 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 0/196 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 18:22:57] [INFO ] Deduced a trap composed of 53 places in 82 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:22:57] [INFO ] Deduced a trap composed of 53 places in 88 ms of which 14 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/317 variables, 2/198 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/317 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 186 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 317/317 variables, and 198 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: 130/130 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 5/5 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/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 1/130 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (OVERLAPS) 187/317 variables, 130/137 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 61/198 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 186/384 constraints. Problems are: Problem set: 0 solved, 186 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 317/317 variables, and 384 constraints, problems are : Problem set: 0 solved, 186 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60184ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 60188ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61331 ms. Remains : 130/130 places, 187/187 transitions.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 472 edges and 130 vertex of which 129 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[p0, p0]
RANDOM walk for 40000 steps (9223 resets) in 153 ms. (259 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1809 resets) in 73 ms. (540 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 17853 steps, run visited all 1 properties in 45 ms. (steps per millisecond=396 )
Probabilistic random walk after 17853 steps, saw 8333 distinct states, run finished after 45 ms. (steps per millisecond=396 ) properties seen :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 124 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[p0, p0]
Stuttering acceptance computed with spot in 86 ms :[p0, p0]
Stuttering acceptance computed with spot in 84 ms :[p0, p0]
Product exploration explored 100000 steps with 22987 reset in 206 ms.
Product exploration explored 100000 steps with 22931 reset in 354 ms.
Built C files in :
/tmp/ltsmin1490317759369664236
[2025-05-30 18:23:38] [INFO ] Computing symmetric may disable matrix : 187 transitions.
[2025-05-30 18:23:38] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 18:23:38] [INFO ] Computing symmetric may enable matrix : 187 transitions.
[2025-05-30 18:23:38] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 18:23:38] [INFO ] Computing Do-Not-Accords matrix : 187 transitions.
[2025-05-30 18:23:38] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 18:23:38] [INFO ] Built C files in 121ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1490317759369664236
Running compilation step : cd /tmp/ltsmin1490317759369664236;'/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 1228 ms.
Running link step : cd /tmp/ltsmin1490317759369664236;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin1490317759369664236;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9558361445398095968.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 187/187 transitions.
Applied a total of 0 rules in 8 ms. Remains 130 /130 variables (removed 0) and now considering 187/187 (removed 0) transitions.
[2025-05-30 18:23:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:23:53] [INFO ] Implicit Places using invariants in 190 ms returned []
[2025-05-30 18:23:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:23:53] [INFO ] State equation strengthened by 61 read => feed constraints.
[2025-05-30 18:23:54] [INFO ] Implicit Places using invariants and state equation in 654 ms returned []
Implicit Place search using SMT with State Equation took 846 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 18:23:54] [INFO ] Redundant transitions in 2 ms returned []
Running 186 sub problems to find dead transitions.
[2025-05-30 18:23:54] [INFO ] Invariant cache hit.
[2025-05-30 18:23:54] [INFO ] State equation strengthened by 61 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (OVERLAPS) 187/317 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 61/193 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 18:24:03] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:24:04] [INFO ] Deduced a trap composed of 57 places in 108 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:24:04] [INFO ] Deduced a trap composed of 55 places in 131 ms of which 19 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 3/196 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 0/196 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 18:24:14] [INFO ] Deduced a trap composed of 53 places in 128 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:24:14] [INFO ] Deduced a trap composed of 53 places in 119 ms of which 20 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/317 variables, 2/198 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/317 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 186 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 317/317 variables, and 198 constraints, problems are : Problem set: 0 solved, 186 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 5/5 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/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 1/130 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (OVERLAPS) 187/317 variables, 130/137 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 61/198 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 186/384 constraints. Problems are: Problem set: 0 solved, 186 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 317/317 variables, and 384 constraints, problems are : Problem set: 0 solved, 186 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60155ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 60156ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61017 ms. Remains : 130/130 places, 187/187 transitions.
Built C files in :
/tmp/ltsmin5346932846831679240
[2025-05-30 18:24:54] [INFO ] Computing symmetric may disable matrix : 187 transitions.
[2025-05-30 18:24:54] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 18:24:54] [INFO ] Computing symmetric may enable matrix : 187 transitions.
[2025-05-30 18:24:54] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 18:24:54] [INFO ] Computing Do-Not-Accords matrix : 187 transitions.
[2025-05-30 18:24:54] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 18:24:54] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5346932846831679240
Running compilation step : cd /tmp/ltsmin5346932846831679240;'/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 878 ms.
Running link step : cd /tmp/ltsmin5346932846831679240;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin5346932846831679240;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9830848756706467724.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-30 18:25:09] [INFO ] Flatten gal took : 16 ms
[2025-05-30 18:25:09] [INFO ] Flatten gal took : 15 ms
[2025-05-30 18:25:09] [INFO ] Time to serialize gal into /tmp/LTL9497299699856455286.gal : 4 ms
[2025-05-30 18:25:09] [INFO ] Time to serialize properties into /tmp/LTL620670648954068739.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9497299699856455286.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13695111637344611123.hoa' '-atoms' '/tmp/LTL620670648954068739.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/LTL620670648954068739.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13695111637344611123.hoa
Detected timeout of ITS tools.
[2025-05-30 18:25:24] [INFO ] Flatten gal took : 14 ms
[2025-05-30 18:25:24] [INFO ] Flatten gal took : 13 ms
[2025-05-30 18:25:24] [INFO ] Time to serialize gal into /tmp/LTL5470308140265405004.gal : 15 ms
[2025-05-30 18:25:24] [INFO ] Time to serialize properties into /tmp/LTL3956408079037536986.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/LTL5470308140265405004.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3956408079037536986.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...275
Read 1 LTL properties
Checking formula 0 : !((G(F("((s1<1)||(l4153<1))"))))
Formula 0 simplified : FG!"((s1<1)||(l4153<1))"
Detected timeout of ITS tools.
[2025-05-30 18:25:40] [INFO ] Flatten gal took : 14 ms
[2025-05-30 18:25:40] [INFO ] Applying decomposition
[2025-05-30 18:25:40] [INFO ] Flatten gal took : 14 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/graph10559067834214807674.txt' '-o' '/tmp/graph10559067834214807674.bin' '-w' '/tmp/graph10559067834214807674.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10559067834214807674.bin' '-l' '-1' '-v' '-w' '/tmp/graph10559067834214807674.weights' '-q' '0' '-e' '0.001'
[2025-05-30 18:25:40] [INFO ] Decomposing Gal with order
[2025-05-30 18:25:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 18:25:40] [INFO ] Removed a total of 200 redundant transitions.
[2025-05-30 18:25:40] [INFO ] Flatten gal took : 91 ms
[2025-05-30 18:25:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 186 labels/synchronizations in 23 ms.
[2025-05-30 18:25:40] [INFO ] Time to serialize gal into /tmp/LTL2086090526091426036.gal : 8 ms
[2025-05-30 18:25:40] [INFO ] Time to serialize properties into /tmp/LTL17476589921117451800.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2086090526091426036.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17476589921117451800.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)||(i5.u4.l4153<1))"))))
Formula 0 simplified : FG!"((i0.u0.s1<1)||(i5.u4.l4153<1))"
Detected timeout of ITS tools.
Treatment of property DBSingleClientW-PT-d2m09-LTLFireability-04 finished in 262863 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' '!(((p0 U X(X(!p1)))&&G(F(p2))))'
Support contains 5 out of 223 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 500/500 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 195 transition count 333
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 195 transition count 333
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 195 transition count 331
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 79 place count 174 transition count 305
Iterating global reduction 1 with 21 rules applied. Total rules applied 100 place count 174 transition count 305
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 111 place count 174 transition count 294
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 129 place count 156 transition count 267
Iterating global reduction 2 with 18 rules applied. Total rules applied 147 place count 156 transition count 267
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 154 place count 156 transition count 260
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 166 place count 144 transition count 235
Iterating global reduction 3 with 12 rules applied. Total rules applied 178 place count 144 transition count 235
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 184 place count 144 transition count 229
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 189 place count 139 transition count 224
Iterating global reduction 4 with 5 rules applied. Total rules applied 194 place count 139 transition count 224
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 198 place count 139 transition count 220
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 204 place count 133 transition count 197
Iterating global reduction 5 with 6 rules applied. Total rules applied 210 place count 133 transition count 197
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 213 place count 133 transition count 194
Applied a total of 213 rules in 13 ms. Remains 133 /223 variables (removed 90) and now considering 194/500 (removed 306) transitions.
// Phase 1: matrix 194 rows 133 cols
[2025-05-30 18:25:55] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:25:55] [INFO ] Implicit Places using invariants in 197 ms returned []
[2025-05-30 18:25:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:25:55] [INFO ] State equation strengthened by 63 read => feed constraints.
[2025-05-30 18:25:56] [INFO ] Implicit Places using invariants and state equation in 813 ms returned []
Implicit Place search using SMT with State Equation took 1025 ms to find 0 implicit places.
Running 193 sub problems to find dead transitions.
[2025-05-30 18:25:56] [INFO ] Invariant cache hit.
[2025-05-30 18:25:56] [INFO ] State equation strengthened by 63 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, 193 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (OVERLAPS) 194/327 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/327 variables, 63/198 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/327 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (OVERLAPS) 0/327 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Real declared 327/327 variables, and 198 constraints, problems are : Problem set: 0 solved, 193 unsolved in 17894 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 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/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (OVERLAPS) 194/327 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/327 variables, 63/198 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/327 variables, 193/391 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 327/327 variables, and 391 constraints, problems are : Problem set: 0 solved, 193 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: 63/63 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48016ms problems are : Problem set: 0 solved, 193 unsolved
Search for dead transitions found 0 dead transitions in 48017ms
Starting structural reductions in LTL mode, iteration 1 : 133/223 places, 194/500 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49055 ms. Remains : 133/223 places, 194/500 transitions.
Stuttering acceptance computed with spot in 475 ms :[(OR (NOT p2) p1), p1, (NOT p2), (NOT p2), p1, p1, true, p1, p1]
Running random walk in product with property : DBSingleClientW-PT-d2m09-LTLFireability-05
Product exploration explored 100000 steps with 27191 reset in 583 ms.
Product exploration explored 100000 steps with 27250 reset in 498 ms.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 486 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 16 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT p0)), (X p2), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p2)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 111 ms. Reduced automaton from 9 states, 15 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p2), (NOT p2)]
RANDOM walk for 40000 steps (9228 resets) in 274 ms. (145 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3876 resets) in 79 ms. (500 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 17645 steps, run visited all 1 properties in 54 ms. (steps per millisecond=326 )
Probabilistic random walk after 17645 steps, saw 8308 distinct states, run finished after 55 ms. (steps per millisecond=320 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT p0)), (X p2), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p2)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 8 factoid took 169 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p2), (NOT p2)]
Support contains 2 out of 133 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 194/194 transitions.
Applied a total of 0 rules in 20 ms. Remains 133 /133 variables (removed 0) and now considering 194/194 (removed 0) transitions.
[2025-05-30 18:26:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:26:46] [INFO ] Implicit Places using invariants in 132 ms returned []
[2025-05-30 18:26:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:26:46] [INFO ] State equation strengthened by 63 read => feed constraints.
[2025-05-30 18:26:47] [INFO ] Implicit Places using invariants and state equation in 580 ms returned []
Implicit Place search using SMT with State Equation took 721 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 18:26:47] [INFO ] Redundant transitions in 1 ms returned []
Running 193 sub problems to find dead transitions.
[2025-05-30 18:26:47] [INFO ] Invariant cache hit.
[2025-05-30 18:26:47] [INFO ] State equation strengthened by 63 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, 193 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (OVERLAPS) 194/327 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/327 variables, 63/198 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/327 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (OVERLAPS) 0/327 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Real declared 327/327 variables, and 198 constraints, problems are : Problem set: 0 solved, 193 unsolved in 14892 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 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/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (OVERLAPS) 194/327 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/327 variables, 63/198 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/327 variables, 193/391 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 327/327 variables, and 391 constraints, problems are : Problem set: 0 solved, 193 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45027ms problems are : Problem set: 0 solved, 193 unsolved
Search for dead transitions found 0 dead transitions in 45028ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 45778 ms. Remains : 133/133 places, 194/194 transitions.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 486 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 16 stable transitions
Knowledge obtained : [p2, (X p2), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p2), (NOT p2)]
RANDOM walk for 40000 steps (9234 resets) in 169 ms. (235 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3835 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 17645 steps, run visited all 1 properties in 50 ms. (steps per millisecond=352 )
Probabilistic random walk after 17645 steps, saw 8308 distinct states, run finished after 50 ms. (steps per millisecond=352 ) properties seen :1
Knowledge obtained : [p2, (X p2), (X (X p2))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 3 factoid took 124 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 100 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 99 ms :[(NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 23021 reset in 264 ms.
Product exploration explored 100000 steps with 22969 reset in 228 ms.
Built C files in :
/tmp/ltsmin8313347642953386224
[2025-05-30 18:27:33] [INFO ] Computing symmetric may disable matrix : 194 transitions.
[2025-05-30 18:27:33] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 18:27:33] [INFO ] Computing symmetric may enable matrix : 194 transitions.
[2025-05-30 18:27:33] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 18:27:33] [INFO ] Computing Do-Not-Accords matrix : 194 transitions.
[2025-05-30 18:27:33] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 18:27:33] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8313347642953386224
Running compilation step : cd /tmp/ltsmin8313347642953386224;'/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 639 ms.
Running link step : cd /tmp/ltsmin8313347642953386224;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin8313347642953386224;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15805334471143554574.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 194/194 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 132 transition count 193
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 132 transition count 193
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 4 place count 130 transition count 191
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 130 transition count 191
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 129 transition count 186
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 129 transition count 186
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 128 transition count 185
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 128 transition count 185
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 127 transition count 184
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 127 transition count 184
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 127 transition count 183
Applied a total of 13 rules in 19 ms. Remains 127 /133 variables (removed 6) and now considering 183/194 (removed 11) transitions.
// Phase 1: matrix 183 rows 127 cols
[2025-05-30 18:27:48] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:27:49] [INFO ] Implicit Places using invariants in 173 ms returned []
[2025-05-30 18:27:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:27:49] [INFO ] State equation strengthened by 61 read => feed constraints.
[2025-05-30 18:27:49] [INFO ] Implicit Places using invariants and state equation in 931 ms returned []
Implicit Place search using SMT with State Equation took 1111 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 18:27:49] [INFO ] Redundant transitions in 1 ms returned []
Running 182 sub problems to find dead transitions.
[2025-05-30 18:27:49] [INFO ] Invariant cache hit.
[2025-05-30 18:27:50] [INFO ] State equation strengthened by 61 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (OVERLAPS) 183/310 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 61/190 constraints. Problems are: Problem set: 0 solved, 182 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (OVERLAPS) 0/310 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Real declared 310/310 variables, and 190 constraints, problems are : Problem set: 0 solved, 182 unsolved in 15426 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, ReadFeed: 61/61 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/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (OVERLAPS) 183/310 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 61/190 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 182/372 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 310/310 variables, and 372 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: 127/127 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45599ms problems are : Problem set: 0 solved, 182 unsolved
Search for dead transitions found 0 dead transitions in 45600ms
Starting structural reductions in SI_LTL mode, iteration 1 : 127/133 places, 183/194 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 46738 ms. Remains : 127/133 places, 183/194 transitions.
Built C files in :
/tmp/ltsmin12104077444827139134
[2025-05-30 18:28:35] [INFO ] Computing symmetric may disable matrix : 183 transitions.
[2025-05-30 18:28:35] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 18:28:35] [INFO ] Computing symmetric may enable matrix : 183 transitions.
[2025-05-30 18:28:35] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 18:28:35] [INFO ] Computing Do-Not-Accords matrix : 183 transitions.
[2025-05-30 18:28:35] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 18:28:35] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12104077444827139134
Running compilation step : cd /tmp/ltsmin12104077444827139134;'/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 740 ms.
Running link step : cd /tmp/ltsmin12104077444827139134;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin12104077444827139134;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9562151923040736536.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-30 18:28:50] [INFO ] Flatten gal took : 12 ms
[2025-05-30 18:28:50] [INFO ] Flatten gal took : 11 ms
[2025-05-30 18:28:50] [INFO ] Time to serialize gal into /tmp/LTL13938563184414808117.gal : 3 ms
[2025-05-30 18:28:50] [INFO ] Time to serialize properties into /tmp/LTL4383725710130549900.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/LTL13938563184414808117.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2708945731482537844.hoa' '-atoms' '/tmp/LTL4383725710130549900.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...318
Loading property file /tmp/LTL4383725710130549900.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2708945731482537844.hoa
Detected timeout of ITS tools.
[2025-05-30 18:29:05] [INFO ] Flatten gal took : 18 ms
[2025-05-30 18:29:05] [INFO ] Flatten gal took : 17 ms
[2025-05-30 18:29:05] [INFO ] Time to serialize gal into /tmp/LTL6286693692031919756.gal : 4 ms
[2025-05-30 18:29:05] [INFO ] Time to serialize properties into /tmp/LTL14522208547686307318.ltl : 2 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/LTL6286693692031919756.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14522208547686307318.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 : !(((("((s1>=1)&&(l4148>=1))")U(X(X(!("((s3>=1)&&(l0>=1))")))))&&(G(F("((p150<1)||(l0<1))")))))
Formula 0 simplified : (!"((s1>=1)&&(l4148>=1))" R XX"((s3>=1)&&(l0>=1))") | FG!"((p150<1)||(l0<1))"
Detected timeout of ITS tools.
[2025-05-30 18:29:20] [INFO ] Flatten gal took : 11 ms
[2025-05-30 18:29:20] [INFO ] Applying decomposition
[2025-05-30 18:29:20] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph8205358481355013262.txt' '-o' '/tmp/graph8205358481355013262.bin' '-w' '/tmp/graph8205358481355013262.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8205358481355013262.bin' '-l' '-1' '-v' '-w' '/tmp/graph8205358481355013262.weights' '-q' '0' '-e' '0.001'
[2025-05-30 18:29:21] [INFO ] Decomposing Gal with order
[2025-05-30 18:29:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 18:29:21] [INFO ] Removed a total of 192 redundant transitions.
[2025-05-30 18:29:21] [INFO ] Flatten gal took : 30 ms
[2025-05-30 18:29:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 196 labels/synchronizations in 14 ms.
[2025-05-30 18:29:21] [INFO ] Time to serialize gal into /tmp/LTL4959130648141012793.gal : 4 ms
[2025-05-30 18:29:21] [INFO ] Time to serialize properties into /tmp/LTL15711767881157104007.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/LTL4959130648141012793.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15711767881157104007.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 : !(((("((i4.u0.s1>=1)&&(i7.u18.l4148>=1))")U(X(X(!("((i1.u2.s3>=1)&&(i4.u0.l0>=1))")))))&&(G(F("((i3.i1.u6.p150<1)||(i4.u0.l0<1))")))))
Formula 0 simplified : (!"((i4.u0.s1>=1)&&(i7.u18.l4148>=1))" R XX"((i1.u2.s3>=1)&&(i4.u0.l0>=1))") | FG!"((i3.i1.u6.p150<1)||(i4.u0.l0<1))"
Detected timeout of ITS tools.
Treatment of property DBSingleClientW-PT-d2m09-LTLFireability-05 finished in 220785 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' '!((F(p0) U X(X(X((F(p2)&&p1))))))'
Support contains 5 out of 223 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 500/500 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 196 transition count 356
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 196 transition count 356
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 56 place count 196 transition count 354
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 77 place count 175 transition count 327
Iterating global reduction 1 with 21 rules applied. Total rules applied 98 place count 175 transition count 327
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 109 place count 175 transition count 316
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 126 place count 158 transition count 281
Iterating global reduction 2 with 17 rules applied. Total rules applied 143 place count 158 transition count 281
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 148 place count 158 transition count 276
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 160 place count 146 transition count 252
Iterating global reduction 3 with 12 rules applied. Total rules applied 172 place count 146 transition count 252
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 187 place count 146 transition count 237
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 191 place count 142 transition count 233
Iterating global reduction 4 with 4 rules applied. Total rules applied 195 place count 142 transition count 233
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 200 place count 142 transition count 228
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 203 place count 139 transition count 214
Iterating global reduction 5 with 3 rules applied. Total rules applied 206 place count 139 transition count 214
Applied a total of 206 rules in 17 ms. Remains 139 /223 variables (removed 84) and now considering 214/500 (removed 286) transitions.
// Phase 1: matrix 214 rows 139 cols
[2025-05-30 18:29:36] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:29:36] [INFO ] Implicit Places using invariants in 186 ms returned []
[2025-05-30 18:29:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:29:36] [INFO ] State equation strengthened by 81 read => feed constraints.
[2025-05-30 18:29:37] [INFO ] Implicit Places using invariants and state equation in 1114 ms returned []
Implicit Place search using SMT with State Equation took 1301 ms to find 0 implicit places.
Running 213 sub problems to find dead transitions.
[2025-05-30 18:29:37] [INFO ] Invariant cache hit.
[2025-05-30 18:29:37] [INFO ] State equation strengthened by 81 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (OVERLAPS) 1/139 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (OVERLAPS) 214/353 variables, 139/141 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 81/222 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (OVERLAPS) 0/353 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 353/353 variables, and 222 constraints, problems are : Problem set: 0 solved, 213 unsolved in 26791 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 139/139 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (OVERLAPS) 1/139 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (OVERLAPS) 214/353 variables, 139/141 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 81/222 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 213/435 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 353/353 variables, and 435 constraints, problems are : Problem set: 0 solved, 213 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 139/139 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56939ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 56941ms
Starting structural reductions in LTL mode, iteration 1 : 139/223 places, 214/500 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58260 ms. Remains : 139/223 places, 214/500 transitions.
Stuttering acceptance computed with spot in 686 ms :[(OR (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : DBSingleClientW-PT-d2m09-LTLFireability-06
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m09-LTLFireability-06 finished in 58973 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' '!(F(((G(p1) U p2)&&X(p2)&&(p2 U p1)&&p0)))'
Support contains 3 out of 223 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 500/500 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 195 transition count 342
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 195 transition count 342
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 57 place count 195 transition count 341
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 81 place count 171 transition count 311
Iterating global reduction 1 with 24 rules applied. Total rules applied 105 place count 171 transition count 311
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 118 place count 171 transition count 298
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 138 place count 151 transition count 258
Iterating global reduction 2 with 20 rules applied. Total rules applied 158 place count 151 transition count 258
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 165 place count 151 transition count 251
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 178 place count 138 transition count 225
Iterating global reduction 3 with 13 rules applied. Total rules applied 191 place count 138 transition count 225
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 197 place count 138 transition count 219
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 203 place count 132 transition count 213
Iterating global reduction 4 with 6 rules applied. Total rules applied 209 place count 132 transition count 213
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 215 place count 132 transition count 207
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 220 place count 127 transition count 191
Iterating global reduction 5 with 5 rules applied. Total rules applied 225 place count 127 transition count 191
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 228 place count 127 transition count 188
Applied a total of 228 rules in 21 ms. Remains 127 /223 variables (removed 96) and now considering 188/500 (removed 312) transitions.
// Phase 1: matrix 188 rows 127 cols
[2025-05-30 18:30:35] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:30:35] [INFO ] Implicit Places using invariants in 238 ms returned []
[2025-05-30 18:30:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:30:35] [INFO ] State equation strengthened by 68 read => feed constraints.
[2025-05-30 18:30:36] [INFO ] Implicit Places using invariants and state equation in 1134 ms returned []
Implicit Place search using SMT with State Equation took 1374 ms to find 0 implicit places.
Running 187 sub problems to find dead transitions.
[2025-05-30 18:30:36] [INFO ] Invariant cache hit.
[2025-05-30 18:30:36] [INFO ] State equation strengthened by 68 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (OVERLAPS) 188/315 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/315 variables, 68/197 constraints. Problems are: Problem set: 0 solved, 187 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (OVERLAPS) 0/315 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Real declared 315/315 variables, and 197 constraints, problems are : Problem set: 0 solved, 187 unsolved in 16118 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 187 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (OVERLAPS) 188/315 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/315 variables, 68/197 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 187/384 constraints. Problems are: Problem set: 0 solved, 187 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 315/315 variables, and 384 constraints, problems are : Problem set: 0 solved, 187 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46278ms problems are : Problem set: 0 solved, 187 unsolved
Search for dead transitions found 0 dead transitions in 46279ms
Starting structural reductions in LTL mode, iteration 1 : 127/223 places, 188/500 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47676 ms. Remains : 127/223 places, 188/500 transitions.
Stuttering acceptance computed with spot in 323 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d2m09-LTLFireability-07
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m09-LTLFireability-07 finished in 48034 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((G(p0)||(F(p1)&&F(p2))))))'
Support contains 4 out of 223 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 500/500 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 196 transition count 357
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 196 transition count 357
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 56 place count 196 transition count 355
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 78 place count 174 transition count 327
Iterating global reduction 1 with 22 rules applied. Total rules applied 100 place count 174 transition count 327
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 113 place count 174 transition count 314
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 131 place count 156 transition count 277
Iterating global reduction 2 with 18 rules applied. Total rules applied 149 place count 156 transition count 277
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 155 place count 156 transition count 271
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 167 place count 144 transition count 247
Iterating global reduction 3 with 12 rules applied. Total rules applied 179 place count 144 transition count 247
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 191 place count 144 transition count 235
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 196 place count 139 transition count 230
Iterating global reduction 4 with 5 rules applied. Total rules applied 201 place count 139 transition count 230
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 207 place count 139 transition count 224
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 212 place count 134 transition count 202
Iterating global reduction 5 with 5 rules applied. Total rules applied 217 place count 134 transition count 202
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 219 place count 134 transition count 200
Applied a total of 219 rules in 24 ms. Remains 134 /223 variables (removed 89) and now considering 200/500 (removed 300) transitions.
// Phase 1: matrix 200 rows 134 cols
[2025-05-30 18:31:23] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:31:23] [INFO ] Implicit Places using invariants in 246 ms returned []
[2025-05-30 18:31:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:31:23] [INFO ] State equation strengthened by 73 read => feed constraints.
[2025-05-30 18:31:24] [INFO ] Implicit Places using invariants and state equation in 861 ms returned []
Implicit Place search using SMT with State Equation took 1111 ms to find 0 implicit places.
Running 199 sub problems to find dead transitions.
[2025-05-30 18:31:24] [INFO ] Invariant cache hit.
[2025-05-30 18:31:24] [INFO ] State equation strengthened by 73 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (OVERLAPS) 200/334 variables, 134/136 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/334 variables, 73/209 constraints. Problems are: Problem set: 0 solved, 199 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/334 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 7 (OVERLAPS) 0/334 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 199 unsolved
No progress, stopping.
After SMT solving in domain Real declared 334/334 variables, and 209 constraints, problems are : Problem set: 0 solved, 199 unsolved in 18123 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 134/134 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 199 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (OVERLAPS) 200/334 variables, 134/136 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/334 variables, 73/209 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/334 variables, 199/408 constraints. Problems are: Problem set: 0 solved, 199 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 334/334 variables, and 408 constraints, problems are : Problem set: 0 solved, 199 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 134/134 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48311ms problems are : Problem set: 0 solved, 199 unsolved
Search for dead transitions found 0 dead transitions in 48312ms
Starting structural reductions in LTL mode, iteration 1 : 134/223 places, 200/500 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49448 ms. Remains : 134/223 places, 200/500 transitions.
Stuttering acceptance computed with spot in 171 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : DBSingleClientW-PT-d2m09-LTLFireability-09
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m09-LTLFireability-09 finished in 49650 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' '!(F((G(F((G(!p0)||G((X(!p0)&&F(!p1)))||(!p2&&X(!p0)&&F(!p1))||(!p2&&X(G(!p0))))))||(F((G(!p0)||(!p2&&((X(!p0)&&F(!p1))||X(G(!p0))))||G((X(!p0)&&F(!p1)))))&&p3))))'
Support contains 6 out of 223 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 500/500 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 197 transition count 355
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 197 transition count 355
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 54 place count 197 transition count 353
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 75 place count 176 transition count 326
Iterating global reduction 1 with 21 rules applied. Total rules applied 96 place count 176 transition count 326
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 106 place count 176 transition count 316
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 122 place count 160 transition count 281
Iterating global reduction 2 with 16 rules applied. Total rules applied 138 place count 160 transition count 281
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 144 place count 160 transition count 275
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 154 place count 150 transition count 255
Iterating global reduction 3 with 10 rules applied. Total rules applied 164 place count 150 transition count 255
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 172 place count 150 transition count 247
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 176 place count 146 transition count 243
Iterating global reduction 4 with 4 rules applied. Total rules applied 180 place count 146 transition count 243
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 185 place count 146 transition count 238
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 189 place count 142 transition count 217
Iterating global reduction 5 with 4 rules applied. Total rules applied 193 place count 142 transition count 217
Applied a total of 193 rules in 24 ms. Remains 142 /223 variables (removed 81) and now considering 217/500 (removed 283) transitions.
// Phase 1: matrix 217 rows 142 cols
[2025-05-30 18:32:12] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:32:13] [INFO ] Implicit Places using invariants in 247 ms returned []
[2025-05-30 18:32:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:32:13] [INFO ] State equation strengthened by 81 read => feed constraints.
[2025-05-30 18:32:14] [INFO ] Implicit Places using invariants and state equation in 962 ms returned []
Implicit Place search using SMT with State Equation took 1218 ms to find 0 implicit places.
Running 216 sub problems to find dead transitions.
[2025-05-30 18:32:14] [INFO ] Invariant cache hit.
[2025-05-30 18:32:14] [INFO ] State equation strengthened by 81 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 217/359 variables, 142/144 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/359 variables, 81/225 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:32:29] [INFO ] Deduced a trap composed of 57 places in 161 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:32:29] [INFO ] Deduced a trap composed of 57 places in 149 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:32:29] [INFO ] Deduced a trap composed of 57 places in 145 ms of which 15 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 3/228 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/359 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 359/359 variables, and 228 constraints, problems are : Problem set: 0 solved, 216 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 142/142 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (OVERLAPS) 217/359 variables, 142/147 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 81/228 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/359 variables, 216/444 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 359/359 variables, and 444 constraints, problems are : Problem set: 0 solved, 216 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 142/142 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60229ms problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 60230ms
Starting structural reductions in LTL mode, iteration 1 : 142/223 places, 217/500 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61474 ms. Remains : 142/223 places, 217/500 transitions.
Stuttering acceptance computed with spot in 424 ms :[p0, p0, p0, (AND p0 p1), (AND p1 p0), p0, false]
Running random walk in product with property : DBSingleClientW-PT-d2m09-LTLFireability-11
Product exploration explored 100000 steps with 37291 reset in 570 ms.
Product exploration explored 100000 steps with 37344 reset in 367 ms.
Computed a total of 5 stabilizing places and 19 stable transitions
Graph (complete) has 524 edges and 142 vertex of which 141 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p2) p1 (NOT p3) p0))), (X (NOT (AND p1 p3 p0))), (X (NOT (AND p2 (NOT p3)))), (X (NOT (AND p2 (NOT p3) p0))), (X (NOT p3)), (X (NOT (AND (NOT p2) (NOT p3) p0))), (X (NOT (AND p1 p0))), (X (AND (NOT p2) (NOT p3))), (X (NOT (AND p1 (NOT p3) p0))), (X (NOT (AND p3 p0))), (X (NOT (AND p2 p0))), (X (NOT (AND p2 (NOT p3) (NOT p0)))), (X (NOT (AND p1 (NOT p3) (NOT p0)))), (X (AND (NOT p2) (NOT p3) (NOT p0))), (X (NOT (AND (NOT p2) p1 (NOT p3)))), (X (NOT (AND p1 p3))), (X (NOT (AND p2 p3))), (X (NOT p0)), (X (NOT (AND p2 p3 p0))), (X (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p2 (NOT p0)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1 (NOT p3) p0)))), (X (X (NOT (AND p1 p3 p0)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p2 (NOT p3) p0)))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) (NOT p3) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND p1 (NOT p3) p0)))), (X (X (NOT (AND p3 p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p2 (NOT p3) (NOT p0))))), (X (X (NOT (AND p1 (NOT p3) (NOT p0))))), (X (X (AND (NOT p2) (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p3))))), (X (X (NOT (AND p1 p3)))), (X (X (NOT (AND p2 p3)))), (X (X (NOT p0))), (X (X (NOT (AND p2 p3 p0)))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p2 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 47 factoid took 204 ms. Reduced automaton from 7 states, 32 edges and 4 AP (stutter sensitive) to 7 states, 32 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 427 ms :[p0, p0, p0, (AND p0 p1), (AND p1 p0), p0, false]
RANDOM walk for 40000 steps (9251 resets) in 954 ms. (41 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (172 resets) in 22 ms. (174 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (183 resets) in 47 ms. (83 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (185 resets) in 22 ms. (174 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (163 resets) in 42 ms. (93 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (393 resets) in 50 ms. (78 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (191 resets) in 27 ms. (142 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (171 resets) in 25 ms. (153 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (351 resets) in 33 ms. (117 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (159 resets) in 26 ms. (148 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (370 resets) in 30 ms. (129 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (185 resets) in 25 ms. (154 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (169 resets) in 24 ms. (160 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (173 resets) in 23 ms. (166 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 4004 steps (188 resets) in 27 ms. (143 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (179 resets) in 25 ms. (153 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (174 resets) in 21 ms. (181 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (186 resets) in 21 ms. (181 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (195 resets) in 19 ms. (200 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (178 resets) in 42 ms. (93 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (188 resets) in 21 ms. (181 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (171 resets) in 19 ms. (200 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (168 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
Interrupted probabilistic random walk after 358445 steps, run timeout after 3001 ms. (steps per millisecond=119 ) properties seen :18 out of 23
Probabilistic random walk after 358445 steps, saw 150475 distinct states, run finished after 3001 ms. (steps per millisecond=119 ) properties seen :18
[2025-05-30 18:33:19] [INFO ] Invariant cache hit.
[2025-05-30 18:33:19] [INFO ] State equation strengthened by 81 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem apf1 is UNSAT
Problem apf5 is UNSAT
Problem apf12 is UNSAT
Problem apf17 is UNSAT
Problem apf18 is UNSAT
After SMT solving in domain Real declared 62/359 variables, and 1 constraints, problems are : Problem set: 5 solved, 0 unsolved in 54 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/142 constraints, ReadFeed: 0/81 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 72ms problems are : Problem set: 5 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 5 invariant AP formulas.
Knowledge obtained : [(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p2) p1 (NOT p3) p0))), (X (NOT (AND p1 p3 p0))), (X (NOT (AND p2 (NOT p3)))), (X (NOT (AND p2 (NOT p3) p0))), (X (NOT p3)), (X (NOT (AND (NOT p2) (NOT p3) p0))), (X (NOT (AND p1 p0))), (X (AND (NOT p2) (NOT p3))), (X (NOT (AND p1 (NOT p3) p0))), (X (NOT (AND p3 p0))), (X (NOT (AND p2 p0))), (X (NOT (AND p2 (NOT p3) (NOT p0)))), (X (NOT (AND p1 (NOT p3) (NOT p0)))), (X (AND (NOT p2) (NOT p3) (NOT p0))), (X (NOT (AND (NOT p2) p1 (NOT p3)))), (X (NOT (AND p1 p3))), (X (NOT (AND p2 p3))), (X (NOT p0)), (X (NOT (AND p2 p3 p0))), (X (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p2 (NOT p0)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1 (NOT p3) p0)))), (X (X (NOT (AND p1 p3 p0)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p2 (NOT p3) p0)))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) (NOT p3) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND p1 (NOT p3) p0)))), (X (X (NOT (AND p3 p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p2 (NOT p3) (NOT p0))))), (X (X (NOT (AND p1 (NOT p3) (NOT p0))))), (X (X (AND (NOT p2) (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p3))))), (X (X (NOT (AND p1 p3)))), (X (X (NOT (AND p2 p3)))), (X (X (NOT p0))), (X (X (NOT (AND p2 p3 p0)))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p2 (NOT p0))))), (G (OR (NOT p0) (NOT p1) (NOT p3))), (G (OR (NOT p0) (NOT p3))), (G (OR (NOT p2) (NOT p3))), (G (OR (NOT p1) (NOT p3))), (G (OR (NOT p0) (NOT p2) (NOT p3)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p2 p3))), (F p3), (F (NOT (AND (NOT p2) (NOT p3)))), (F (NOT (OR p0 (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (F (NOT (OR (NOT p0) (NOT p1) p2 p3))), (F (NOT (OR (NOT p2) p3))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p1) p2 p3))), (F p0), (F p2), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p1) p3))), (F (NOT (OR p0 (NOT p2) p3))), (F p1), (F (NOT (OR (NOT p0) (NOT p2) p3))), (F (NOT (OR p0 (NOT p1) p3)))]
Knowledge based reduction with 52 factoid took 967 ms. Reduced automaton from 7 states, 32 edges and 4 AP (stutter sensitive) to 6 states, 22 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 384 ms :[p0, p0, p0, (AND p1 p0), p0, false]
Stuttering acceptance computed with spot in 394 ms :[p0, p0, p0, (AND p1 p0), p0, false]
Support contains 6 out of 142 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 142/142 places, 217/217 transitions.
Applied a total of 0 rules in 2 ms. Remains 142 /142 variables (removed 0) and now considering 217/217 (removed 0) transitions.
[2025-05-30 18:33:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:33:22] [INFO ] Implicit Places using invariants in 249 ms returned []
[2025-05-30 18:33:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:33:22] [INFO ] State equation strengthened by 81 read => feed constraints.
[2025-05-30 18:33:22] [INFO ] Implicit Places using invariants and state equation in 904 ms returned []
Implicit Place search using SMT with State Equation took 1155 ms to find 0 implicit places.
Running 216 sub problems to find dead transitions.
[2025-05-30 18:33:22] [INFO ] Invariant cache hit.
[2025-05-30 18:33:22] [INFO ] State equation strengthened by 81 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 217/359 variables, 142/144 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/359 variables, 81/225 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:33:37] [INFO ] Deduced a trap composed of 57 places in 117 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:33:37] [INFO ] Deduced a trap composed of 57 places in 108 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:33:37] [INFO ] Deduced a trap composed of 57 places in 136 ms of which 15 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 3/228 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/359 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:33:52] [INFO ] Deduced a trap composed of 60 places in 135 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:33:53] [INFO ] Deduced a trap composed of 60 places in 174 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:33:53] [INFO ] Deduced a trap composed of 15 places in 201 ms of which 19 ms to minimize.
SMT process timed out in 30421ms, After SMT, problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 30427ms
Finished structural reductions in LTL mode , in 1 iterations and 31586 ms. Remains : 142/142 places, 217/217 transitions.
Computed a total of 5 stabilizing places and 19 stable transitions
Graph (complete) has 524 edges and 142 vertex of which 141 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (AND (NOT p0) (NOT p3) (NOT p2))), (X (NOT (AND p0 p1))), (X (NOT p3)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 p2))), (X (AND (NOT p3) (NOT p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p3) (NOT p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 27 factoid took 280 ms. Reduced automaton from 6 states, 22 edges and 4 AP (stutter sensitive) to 6 states, 22 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 353 ms :[p0, p0, p0, (AND p1 p0), p0, false]
RANDOM walk for 40000 steps (9222 resets) in 413 ms. (96 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (1810 resets) in 145 ms. (274 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (1788 resets) in 203 ms. (196 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (3820 resets) in 448 ms. (89 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (3774 resets) in 162 ms. (245 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (3842 resets) in 146 ms. (272 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (1766 resets) in 109 ms. (363 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (1814 resets) in 155 ms. (256 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (1721 resets) in 114 ms. (347 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (1856 resets) in 110 ms. (360 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (1745 resets) in 152 ms. (261 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (1811 resets) in 151 ms. (263 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (1806 resets) in 127 ms. (312 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (1768 resets) in 106 ms. (373 steps per ms) remains 13/13 properties
Finished probabilistic random walk after 83581 steps, run visited all 13 properties in 753 ms. (steps per millisecond=110 )
Probabilistic random walk after 83581 steps, saw 37156 distinct states, run finished after 753 ms. (steps per millisecond=110 ) properties seen :13
Knowledge obtained : [(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (AND (NOT p0) (NOT p3) (NOT p2))), (X (NOT (AND p0 p1))), (X (NOT p3)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 p2))), (X (AND (NOT p3) (NOT p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p3) (NOT p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p2)))), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR (NOT p0) (NOT p1) p2))), (F (NOT (AND (NOT p2) (NOT p3)))), (F p3), (F (NOT (OR p0 (NOT p1)))), (F p1), (F (NOT (OR (NOT p0) p2))), (F p2), (F (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) (NOT p2))))]
Knowledge based reduction with 27 factoid took 856 ms. Reduced automaton from 6 states, 22 edges and 4 AP (stutter sensitive) to 6 states, 22 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 374 ms :[p0, p0, p0, (AND p1 p0), p0, false]
Stuttering acceptance computed with spot in 375 ms :[p0, p0, p0, (AND p1 p0), p0, false]
Stuttering acceptance computed with spot in 367 ms :[p0, p0, p0, (AND p1 p0), p0, false]
Product exploration explored 100000 steps with 37359 reset in 553 ms.
Product exploration explored 100000 steps with 37425 reset in 530 ms.
Applying partial POR strategy [false, false, false, true, false, false]
Stuttering acceptance computed with spot in 379 ms :[p0, p0, p0, (AND p1 p0), p0, false]
Support contains 6 out of 142 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 142/142 places, 217/217 transitions.
Applied a total of 0 rules in 33 ms. Remains 142 /142 variables (removed 0) and now considering 217/217 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 18:33:59] [INFO ] Redundant transitions in 2 ms returned []
Running 216 sub problems to find dead transitions.
[2025-05-30 18:33:59] [INFO ] Invariant cache hit.
[2025-05-30 18:33:59] [INFO ] State equation strengthened by 81 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 217/359 variables, 142/144 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/359 variables, 81/225 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:34:15] [INFO ] Deduced a trap composed of 57 places in 153 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:34:15] [INFO ] Deduced a trap composed of 57 places in 154 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:34:16] [INFO ] Deduced a trap composed of 57 places in 149 ms of which 15 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 3/228 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/359 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 359/359 variables, and 228 constraints, problems are : Problem set: 0 solved, 216 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 142/142 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (OVERLAPS) 217/359 variables, 142/147 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 81/228 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/359 variables, 216/444 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 359/359 variables, and 444 constraints, problems are : Problem set: 0 solved, 216 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 142/142 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60310ms problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 60311ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60356 ms. Remains : 142/142 places, 217/217 transitions.
Built C files in :
/tmp/ltsmin7465643657941340863
[2025-05-30 18:34:59] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7465643657941340863
Running compilation step : cd /tmp/ltsmin7465643657941340863;'/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 737 ms.
Running link step : cd /tmp/ltsmin7465643657941340863;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin7465643657941340863;'/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/stateBased4373312555874167927.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 142 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 142/142 places, 217/217 transitions.
Applied a total of 0 rules in 9 ms. Remains 142 /142 variables (removed 0) and now considering 217/217 (removed 0) transitions.
[2025-05-30 18:35:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:35:15] [INFO ] Implicit Places using invariants in 140 ms returned []
[2025-05-30 18:35:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:35:15] [INFO ] State equation strengthened by 81 read => feed constraints.
[2025-05-30 18:35:16] [INFO ] Implicit Places using invariants and state equation in 914 ms returned []
Implicit Place search using SMT with State Equation took 1056 ms to find 0 implicit places.
Running 216 sub problems to find dead transitions.
[2025-05-30 18:35:16] [INFO ] Invariant cache hit.
[2025-05-30 18:35:16] [INFO ] State equation strengthened by 81 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 217/359 variables, 142/144 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/359 variables, 81/225 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:35:30] [INFO ] Deduced a trap composed of 57 places in 118 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:35:30] [INFO ] Deduced a trap composed of 57 places in 119 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:35:30] [INFO ] Deduced a trap composed of 57 places in 126 ms of which 13 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 3/228 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/359 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:35:44] [INFO ] Deduced a trap composed of 60 places in 111 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:35:44] [INFO ] Deduced a trap composed of 60 places in 97 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:35:45] [INFO ] Deduced a trap composed of 15 places in 193 ms of which 19 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/359 variables, 3/231 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 359/359 variables, and 231 constraints, problems are : Problem set: 0 solved, 216 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 142/142 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (OVERLAPS) 1/142 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (OVERLAPS) 217/359 variables, 142/150 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/359 variables, 81/231 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/359 variables, 216/447 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 359/359 variables, and 447 constraints, problems are : Problem set: 0 solved, 216 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 142/142 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60274ms problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 60275ms
Finished structural reductions in LTL mode , in 1 iterations and 61353 ms. Remains : 142/142 places, 217/217 transitions.
Built C files in :
/tmp/ltsmin2884201045883286130
[2025-05-30 18:36:16] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2884201045883286130
Running compilation step : cd /tmp/ltsmin2884201045883286130;'/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 838 ms.
Running link step : cd /tmp/ltsmin2884201045883286130;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin2884201045883286130;'/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/stateBased6429372012661605782.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-30 18:36:31] [INFO ] Flatten gal took : 41 ms
[2025-05-30 18:36:31] [INFO ] Flatten gal took : 24 ms
[2025-05-30 18:36:31] [INFO ] Time to serialize gal into /tmp/LTL3410574704408979905.gal : 7 ms
[2025-05-30 18:36:31] [INFO ] Time to serialize properties into /tmp/LTL12210490499966466111.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3410574704408979905.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8776545406631897112.hoa' '-atoms' '/tmp/LTL12210490499966466111.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...318
Loading property file /tmp/LTL12210490499966466111.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8776545406631897112.hoa
Detected timeout of ITS tools.
[2025-05-30 18:36:46] [INFO ] Flatten gal took : 16 ms
[2025-05-30 18:36:46] [INFO ] Flatten gal took : 15 ms
[2025-05-30 18:36:46] [INFO ] Time to serialize gal into /tmp/LTL18383515841617062319.gal : 3 ms
[2025-05-30 18:36:46] [INFO ] Time to serialize properties into /tmp/LTL7373825121242826573.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18383515841617062319.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7373825121242826573.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 : !((F((G(F(((G("((s1<1)||(l4281<1))"))||(G((X("((s1<1)||(l4281<1))"))&&(F("((s1<1)||(l3834<1))")))))||(((("((s1<1)||(l4105<1))")&&(X("(...513
Formula 0 simplified : G(F!"((s1<1)||(l4281<1))" & F(X!"((s1<1)||(l4281<1))" | G!"((s1<1)||(l3834<1))") & (!"((p411>=1)&&(l0>=1))" | G(F!"((s1<1)||(l4281<1...463
Detected timeout of ITS tools.
[2025-05-30 18:37:01] [INFO ] Flatten gal took : 21 ms
[2025-05-30 18:37:01] [INFO ] Applying decomposition
[2025-05-30 18:37:01] [INFO ] Flatten gal took : 12 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/graph7592428158693347062.txt' '-o' '/tmp/graph7592428158693347062.bin' '-w' '/tmp/graph7592428158693347062.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7592428158693347062.bin' '-l' '-1' '-v' '-w' '/tmp/graph7592428158693347062.weights' '-q' '0' '-e' '0.001'
[2025-05-30 18:37:01] [INFO ] Decomposing Gal with order
[2025-05-30 18:37:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 18:37:02] [INFO ] Removed a total of 228 redundant transitions.
[2025-05-30 18:37:02] [INFO ] Flatten gal took : 32 ms
[2025-05-30 18:37:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 161 labels/synchronizations in 14 ms.
[2025-05-30 18:37:02] [INFO ] Time to serialize gal into /tmp/LTL1887875481561010871.gal : 5 ms
[2025-05-30 18:37:02] [INFO ] Time to serialize properties into /tmp/LTL10044624610933066279.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/LTL1887875481561010871.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10044624610933066279.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 : !((F((G(F(((G("((i3.u2.s1<1)||(i6.u14.l4281<1))"))||(G((X("((i3.u2.s1<1)||(i6.u14.l4281<1))"))&&(F("((i3.u2.s1<1)||(i6.u14.l3834<1))")...721
Formula 0 simplified : G(F!"((i3.u2.s1<1)||(i6.u14.l4281<1))" & F(X!"((i3.u2.s1<1)||(i6.u14.l4281<1))" | G!"((i3.u2.s1<1)||(i6.u14.l3834<1))") & (!"((i7.u1...671
Detected timeout of ITS tools.
Treatment of property DBSingleClientW-PT-d2m09-LTLFireability-11 finished in 304302 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((p0 U ((p1 U p2) U p3))))||X((X(p1) U p0))))'
Support contains 6 out of 223 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 500/500 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 196 transition count 350
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 196 transition count 350
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 56 place count 196 transition count 348
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 77 place count 175 transition count 322
Iterating global reduction 1 with 21 rules applied. Total rules applied 98 place count 175 transition count 322
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 109 place count 175 transition count 311
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 127 place count 157 transition count 275
Iterating global reduction 2 with 18 rules applied. Total rules applied 145 place count 157 transition count 275
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 150 place count 157 transition count 270
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 163 place count 144 transition count 244
Iterating global reduction 3 with 13 rules applied. Total rules applied 176 place count 144 transition count 244
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 3 with 18 rules applied. Total rules applied 194 place count 144 transition count 226
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 198 place count 140 transition count 222
Iterating global reduction 4 with 4 rules applied. Total rules applied 202 place count 140 transition count 222
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 207 place count 140 transition count 217
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 210 place count 137 transition count 203
Iterating global reduction 5 with 3 rules applied. Total rules applied 213 place count 137 transition count 203
Applied a total of 213 rules in 24 ms. Remains 137 /223 variables (removed 86) and now considering 203/500 (removed 297) transitions.
// Phase 1: matrix 203 rows 137 cols
[2025-05-30 18:37:17] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:37:17] [INFO ] Implicit Places using invariants in 230 ms returned []
[2025-05-30 18:37:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:37:17] [INFO ] State equation strengthened by 70 read => feed constraints.
[2025-05-30 18:37:18] [INFO ] Implicit Places using invariants and state equation in 862 ms returned []
Implicit Place search using SMT with State Equation took 1096 ms to find 0 implicit places.
Running 202 sub problems to find dead transitions.
[2025-05-30 18:37:18] [INFO ] Invariant cache hit.
[2025-05-30 18:37:18] [INFO ] State equation strengthened by 70 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, 202 unsolved
At refinement iteration 1 (OVERLAPS) 1/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (OVERLAPS) 203/340 variables, 137/139 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/340 variables, 70/209 constraints. Problems are: Problem set: 0 solved, 202 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:37:29] [INFO ] Deduced a trap composed of 14 places in 186 ms of which 17 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/340 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 8 (OVERLAPS) 0/340 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 210 constraints, problems are : Problem set: 0 solved, 202 unsolved in 25442 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 137/137 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 202 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (OVERLAPS) 1/137 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (OVERLAPS) 203/340 variables, 137/140 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/340 variables, 70/210 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 202/412 constraints. Problems are: Problem set: 0 solved, 202 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 340/340 variables, and 412 constraints, problems are : Problem set: 0 solved, 202 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: 70/70 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55713ms problems are : Problem set: 0 solved, 202 unsolved
Search for dead transitions found 0 dead transitions in 55714ms
Starting structural reductions in LTL mode, iteration 1 : 137/223 places, 203/500 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56835 ms. Remains : 137/223 places, 203/500 transitions.
Stuttering acceptance computed with spot in 376 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), true, (NOT p3), (NOT p3), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (NOT p2)]
Running random walk in product with property : DBSingleClientW-PT-d2m09-LTLFireability-12
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m09-LTLFireability-12 finished in 57241 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' '!(F((p0||G(p1))))'
Support contains 3 out of 223 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 223/223 places, 500/500 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 195 transition count 345
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 195 transition count 345
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 195 transition count 343
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 80 place count 173 transition count 315
Iterating global reduction 1 with 22 rules applied. Total rules applied 102 place count 173 transition count 315
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 111 place count 173 transition count 306
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 129 place count 155 transition count 269
Iterating global reduction 2 with 18 rules applied. Total rules applied 147 place count 155 transition count 269
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 154 place count 155 transition count 262
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 165 place count 144 transition count 240
Iterating global reduction 3 with 11 rules applied. Total rules applied 176 place count 144 transition count 240
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 180 place count 144 transition count 236
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 186 place count 138 transition count 230
Iterating global reduction 4 with 6 rules applied. Total rules applied 192 place count 138 transition count 230
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 197 place count 138 transition count 225
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 203 place count 132 transition count 202
Iterating global reduction 5 with 6 rules applied. Total rules applied 209 place count 132 transition count 202
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 212 place count 132 transition count 199
Applied a total of 212 rules in 40 ms. Remains 132 /223 variables (removed 91) and now considering 199/500 (removed 301) transitions.
// Phase 1: matrix 199 rows 132 cols
[2025-05-30 18:38:14] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:38:14] [INFO ] Implicit Places using invariants in 172 ms returned []
[2025-05-30 18:38:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:38:14] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-05-30 18:38:15] [INFO ] Implicit Places using invariants and state equation in 667 ms returned []
Implicit Place search using SMT with State Equation took 864 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 18:38:15] [INFO ] Redundant transitions in 2 ms returned []
Running 198 sub problems to find dead transitions.
[2025-05-30 18:38:15] [INFO ] Invariant cache hit.
[2025-05-30 18:38:15] [INFO ] State equation strengthened by 72 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, 1/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (OVERLAPS) 1/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 199/331 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/331 variables, 72/206 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/331 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (OVERLAPS) 0/331 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 331/331 variables, and 206 constraints, problems are : Problem set: 0 solved, 198 unsolved in 16249 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (OVERLAPS) 1/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 199/331 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/331 variables, 72/206 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/331 variables, 198/404 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 331/331 variables, and 404 constraints, problems are : Problem set: 0 solved, 198 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46474ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 46475ms
Starting structural reductions in SI_LTL mode, iteration 1 : 132/223 places, 199/500 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 47387 ms. Remains : 132/223 places, 199/500 transitions.
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : DBSingleClientW-PT-d2m09-LTLFireability-13
Product exploration explored 100000 steps with 23070 reset in 525 ms.
Product exploration explored 100000 steps with 23049 reset in 397 ms.
Computed a total of 5 stabilizing places and 19 stable transitions
Graph (complete) has 486 edges and 132 vertex of which 131 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (AND p1 (NOT p0))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X (AND p1 (NOT p0)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 111 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (9161 resets) in 164 ms. (242 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (1748 resets) in 116 ms. (341 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (1745 resets) in 69 ms. (571 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1837 resets) in 93 ms. (425 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1797 resets) in 64 ms. (615 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 21179 steps, run visited all 4 properties in 181 ms. (steps per millisecond=117 )
Probabilistic random walk after 21179 steps, saw 10442 distinct states, run finished after 181 ms. (steps per millisecond=117 ) properties seen :4
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (AND p1 (NOT p0))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X (AND p1 (NOT p0)))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p1 p0))), (F (NOT (AND p1 (NOT p0)))), (F p0)]
Knowledge based reduction with 9 factoid took 260 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 46 ms :[(AND (NOT p1) (NOT p0))]
Support contains 3 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 199/199 transitions.
Applied a total of 0 rules in 7 ms. Remains 132 /132 variables (removed 0) and now considering 199/199 (removed 0) transitions.
[2025-05-30 18:39:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:39:03] [INFO ] Implicit Places using invariants in 187 ms returned []
[2025-05-30 18:39:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:39:03] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-05-30 18:39:04] [INFO ] Implicit Places using invariants and state equation in 977 ms returned []
Implicit Place search using SMT with State Equation took 1167 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 18:39:04] [INFO ] Redundant transitions in 2 ms returned []
Running 198 sub problems to find dead transitions.
[2025-05-30 18:39:04] [INFO ] Invariant cache hit.
[2025-05-30 18:39:04] [INFO ] State equation strengthened by 72 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, 1/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (OVERLAPS) 1/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 199/331 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/331 variables, 72/206 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/331 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (OVERLAPS) 0/331 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 331/331 variables, and 206 constraints, problems are : Problem set: 0 solved, 198 unsolved in 16948 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (OVERLAPS) 1/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 199/331 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/331 variables, 72/206 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/331 variables, 198/404 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 331/331 variables, and 404 constraints, problems are : Problem set: 0 solved, 198 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: 72/72 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47161ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 47162ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 48346 ms. Remains : 132/132 places, 199/199 transitions.
Computed a total of 5 stabilizing places and 19 stable transitions
Graph (complete) has 486 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 19 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (AND p1 (NOT p0))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X (AND p1 (NOT p0)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 118 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (9191 resets) in 208 ms. (191 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (1776 resets) in 98 ms. (404 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1787 resets) in 101 ms. (392 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1768 resets) in 84 ms. (470 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1801 resets) in 71 ms. (555 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 21179 steps, run visited all 4 properties in 257 ms. (steps per millisecond=82 )
Probabilistic random walk after 21179 steps, saw 10442 distinct states, run finished after 257 ms. (steps per millisecond=82 ) properties seen :4
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (AND p1 (NOT p0))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X (AND p1 (NOT p0)))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p1 p0))), (F (NOT (AND p1 (NOT p0)))), (F p0)]
Knowledge based reduction with 9 factoid took 327 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 49 ms :[(AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 49 ms :[(AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 22847 reset in 420 ms.
Product exploration explored 100000 steps with 22964 reset in 401 ms.
Built C files in :
/tmp/ltsmin7468720385205691876
[2025-05-30 18:39:53] [INFO ] Computing symmetric may disable matrix : 199 transitions.
[2025-05-30 18:39:53] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 18:39:53] [INFO ] Computing symmetric may enable matrix : 199 transitions.
[2025-05-30 18:39:53] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 18:39:53] [INFO ] Computing Do-Not-Accords matrix : 199 transitions.
[2025-05-30 18:39:53] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 18:39:53] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7468720385205691876
Running compilation step : cd /tmp/ltsmin7468720385205691876;'/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 1059 ms.
Running link step : cd /tmp/ltsmin7468720385205691876;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin7468720385205691876;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10776411675590980171.hoa' '--buchi-type=spotba'
LTSmin run took 1333 ms.
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d2m09-LTLFireability-13 finished in 102103 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)||X(((p2 U p0)&&p1))))'
Support contains 4 out of 223 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 500/500 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 196 transition count 346
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 196 transition count 346
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 55 place count 196 transition count 345
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 77 place count 174 transition count 317
Iterating global reduction 1 with 22 rules applied. Total rules applied 99 place count 174 transition count 317
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 109 place count 174 transition count 307
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 126 place count 157 transition count 277
Iterating global reduction 2 with 17 rules applied. Total rules applied 143 place count 157 transition count 277
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 150 place count 157 transition count 270
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 161 place count 146 transition count 248
Iterating global reduction 3 with 11 rules applied. Total rules applied 172 place count 146 transition count 248
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 176 place count 146 transition count 244
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 182 place count 140 transition count 238
Iterating global reduction 4 with 6 rules applied. Total rules applied 188 place count 140 transition count 238
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 193 place count 140 transition count 233
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 199 place count 134 transition count 210
Iterating global reduction 5 with 6 rules applied. Total rules applied 205 place count 134 transition count 210
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 208 place count 134 transition count 207
Applied a total of 208 rules in 15 ms. Remains 134 /223 variables (removed 89) and now considering 207/500 (removed 293) transitions.
// Phase 1: matrix 207 rows 134 cols
[2025-05-30 18:39:56] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:39:56] [INFO ] Implicit Places using invariants in 175 ms returned []
[2025-05-30 18:39:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:39:56] [INFO ] State equation strengthened by 81 read => feed constraints.
[2025-05-30 18:39:57] [INFO ] Implicit Places using invariants and state equation in 923 ms returned []
Implicit Place search using SMT with State Equation took 1100 ms to find 0 implicit places.
Running 206 sub problems to find dead transitions.
[2025-05-30 18:39:57] [INFO ] Invariant cache hit.
[2025-05-30 18:39:57] [INFO ] State equation strengthened by 81 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (OVERLAPS) 207/341 variables, 134/136 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 81/217 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 206 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:40:18] [INFO ] Deduced a trap composed of 12 places in 152 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:40:18] [INFO ] Deduced a trap composed of 12 places in 146 ms of which 15 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/341 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 206 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 Real declared 341/341 variables, and 219 constraints, problems are : Problem set: 0 solved, 206 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 134/134 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 206 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 1/134 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (OVERLAPS) 207/341 variables, 134/138 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 81/219 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 206/425 constraints. Problems are: Problem set: 0 solved, 206 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 341/341 variables, and 425 constraints, problems are : Problem set: 0 solved, 206 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 134/134 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60232ms problems are : Problem set: 0 solved, 206 unsolved
Search for dead transitions found 0 dead transitions in 60233ms
Starting structural reductions in LTL mode, iteration 1 : 134/223 places, 207/500 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61350 ms. Remains : 134/223 places, 207/500 transitions.
Stuttering acceptance computed with spot in 208 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m09-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m09-LTLFireability-14 finished in 61577 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(F(p1)))))'
Support contains 4 out of 223 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 223/223 places, 500/500 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 195 transition count 341
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 195 transition count 341
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 195 transition count 339
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 80 place count 173 transition count 312
Iterating global reduction 1 with 22 rules applied. Total rules applied 102 place count 173 transition count 312
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 113 place count 173 transition count 301
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 132 place count 154 transition count 263
Iterating global reduction 2 with 19 rules applied. Total rules applied 151 place count 154 transition count 263
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 158 place count 154 transition count 256
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 170 place count 142 transition count 231
Iterating global reduction 3 with 12 rules applied. Total rules applied 182 place count 142 transition count 231
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 194 place count 142 transition count 219
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 199 place count 137 transition count 214
Iterating global reduction 4 with 5 rules applied. Total rules applied 204 place count 137 transition count 214
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 208 place count 137 transition count 210
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 213 place count 132 transition count 195
Iterating global reduction 5 with 5 rules applied. Total rules applied 218 place count 132 transition count 195
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 221 place count 132 transition count 192
Applied a total of 221 rules in 23 ms. Remains 132 /223 variables (removed 91) and now considering 192/500 (removed 308) transitions.
// Phase 1: matrix 192 rows 132 cols
[2025-05-30 18:40:58] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:40:58] [INFO ] Implicit Places using invariants in 174 ms returned []
[2025-05-30 18:40:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:40:58] [INFO ] State equation strengthened by 65 read => feed constraints.
[2025-05-30 18:40:59] [INFO ] Implicit Places using invariants and state equation in 789 ms returned []
Implicit Place search using SMT with State Equation took 966 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 18:40:59] [INFO ] Redundant transitions in 1 ms returned []
Running 191 sub problems to find dead transitions.
[2025-05-30 18:40:59] [INFO ] Invariant cache hit.
[2025-05-30 18:40:59] [INFO ] State equation strengthened by 65 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, 191 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (OVERLAPS) 192/324 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/324 variables, 65/199 constraints. Problems are: Problem set: 0 solved, 191 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 7 (OVERLAPS) 0/324 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Real declared 324/324 variables, and 199 constraints, problems are : Problem set: 0 solved, 191 unsolved in 18066 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 191 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, 191 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (OVERLAPS) 192/324 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/324 variables, 65/199 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 191/390 constraints. Problems are: Problem set: 0 solved, 191 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 324/324 variables, and 390 constraints, problems are : Problem set: 0 solved, 191 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48193ms problems are : Problem set: 0 solved, 191 unsolved
Search for dead transitions found 0 dead transitions in 48194ms
Starting structural reductions in SI_LTL mode, iteration 1 : 132/223 places, 192/500 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 49190 ms. Remains : 132/223 places, 192/500 transitions.
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d2m09-LTLFireability-15
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m09-LTLFireability-15 finished in 49326 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)))'
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' '!(((p0 U X(X(!p1)))&&G(F(p2))))'
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' '!(F((G(F((G(!p0)||G((X(!p0)&&F(!p1)))||(!p2&&X(!p0)&&F(!p1))||(!p2&&X(G(!p0))))))||(F((G(!p0)||(!p2&&((X(!p0)&&F(!p1))||X(G(!p0))))||G((X(!p0)&&F(!p1)))))&&p3))))'
Found a Shortening insensitive property : DBSingleClientW-PT-d2m09-LTLFireability-11
Stuttering acceptance computed with spot in 421 ms :[p0, p0, p0, (AND p0 p1), (AND p1 p0), p0, false]
Support contains 6 out of 223 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 223/223 places, 500/500 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 197 transition count 355
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 197 transition count 355
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 54 place count 197 transition count 353
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 75 place count 176 transition count 326
Iterating global reduction 1 with 21 rules applied. Total rules applied 96 place count 176 transition count 326
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 106 place count 176 transition count 316
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 122 place count 160 transition count 281
Iterating global reduction 2 with 16 rules applied. Total rules applied 138 place count 160 transition count 281
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 144 place count 160 transition count 275
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 154 place count 150 transition count 255
Iterating global reduction 3 with 10 rules applied. Total rules applied 164 place count 150 transition count 255
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 172 place count 150 transition count 247
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 176 place count 146 transition count 243
Iterating global reduction 4 with 4 rules applied. Total rules applied 180 place count 146 transition count 243
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 185 place count 146 transition count 238
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 189 place count 142 transition count 217
Iterating global reduction 5 with 4 rules applied. Total rules applied 193 place count 142 transition count 217
Applied a total of 193 rules in 28 ms. Remains 142 /223 variables (removed 81) and now considering 217/500 (removed 283) transitions.
// Phase 1: matrix 217 rows 142 cols
[2025-05-30 18:41:48] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:41:48] [INFO ] Implicit Places using invariants in 251 ms returned []
[2025-05-30 18:41:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:41:49] [INFO ] State equation strengthened by 81 read => feed constraints.
[2025-05-30 18:41:49] [INFO ] Implicit Places using invariants and state equation in 887 ms returned []
Implicit Place search using SMT with State Equation took 1149 ms to find 0 implicit places.
Running 216 sub problems to find dead transitions.
[2025-05-30 18:41:49] [INFO ] Invariant cache hit.
[2025-05-30 18:41:49] [INFO ] State equation strengthened by 81 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 217/359 variables, 142/144 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/359 variables, 81/225 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:42:05] [INFO ] Deduced a trap composed of 57 places in 139 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:42:05] [INFO ] Deduced a trap composed of 57 places in 143 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:42:05] [INFO ] Deduced a trap composed of 57 places in 150 ms of which 15 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 3/228 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/359 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:42:20] [INFO ] Deduced a trap composed of 60 places in 141 ms of which 21 ms to minimize.
SMT process timed out in 30310ms, After SMT, problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 30312ms
Starting structural reductions in LI_LTL mode, iteration 1 : 142/223 places, 217/500 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 31489 ms. Remains : 142/223 places, 217/500 transitions.
Running random walk in product with property : DBSingleClientW-PT-d2m09-LTLFireability-11
Product exploration explored 100000 steps with 37368 reset in 443 ms.
Product exploration explored 100000 steps with 37371 reset in 506 ms.
Computed a total of 5 stabilizing places and 19 stable transitions
Graph (complete) has 524 edges and 142 vertex of which 141 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p2) p1 (NOT p3) p0))), (X (NOT (AND p1 p3 p0))), (X (NOT (AND p2 (NOT p3)))), (X (NOT (AND p2 (NOT p3) p0))), (X (NOT p3)), (X (NOT (AND (NOT p2) (NOT p3) p0))), (X (NOT (AND p1 p0))), (X (AND (NOT p2) (NOT p3))), (X (NOT (AND p1 (NOT p3) p0))), (X (NOT (AND p3 p0))), (X (NOT (AND p2 p0))), (X (NOT (AND p2 (NOT p3) (NOT p0)))), (X (NOT (AND p1 (NOT p3) (NOT p0)))), (X (AND (NOT p2) (NOT p3) (NOT p0))), (X (NOT (AND (NOT p2) p1 (NOT p3)))), (X (NOT (AND p1 p3))), (X (NOT (AND p2 p3))), (X (NOT p0)), (X (NOT (AND p2 p3 p0))), (X (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p2 (NOT p0)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1 (NOT p3) p0)))), (X (X (NOT (AND p1 p3 p0)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p2 (NOT p3) p0)))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) (NOT p3) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND p1 (NOT p3) p0)))), (X (X (NOT (AND p3 p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p2 (NOT p3) (NOT p0))))), (X (X (NOT (AND p1 (NOT p3) (NOT p0))))), (X (X (AND (NOT p2) (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p3))))), (X (X (NOT (AND p1 p3)))), (X (X (NOT (AND p2 p3)))), (X (X (NOT p0))), (X (X (NOT (AND p2 p3 p0)))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p2 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 47 factoid took 150 ms. Reduced automaton from 7 states, 32 edges and 4 AP (stutter sensitive) to 7 states, 32 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 287 ms :[p0, p0, p0, (AND p0 p1), (AND p1 p0), p0, false]
RANDOM walk for 40000 steps (9267 resets) in 431 ms. (92 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (166 resets) in 19 ms. (200 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (166 resets) in 22 ms. (173 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (206 resets) in 41 ms. (95 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (172 resets) in 23 ms. (166 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (380 resets) in 29 ms. (133 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (163 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (165 resets) in 19 ms. (200 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (380 resets) in 32 ms. (121 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (181 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (421 resets) in 24 ms. (160 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (174 resets) in 22 ms. (174 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 (197 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (158 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (179 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (179 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (174 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (180 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (197 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (170 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (178 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (183 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (156 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
Interrupted probabilistic random walk after 366025 steps, run timeout after 3001 ms. (steps per millisecond=121 ) properties seen :18 out of 23
Probabilistic random walk after 366025 steps, saw 153141 distinct states, run finished after 3001 ms. (steps per millisecond=121 ) properties seen :18
[2025-05-30 18:42:24] [INFO ] Invariant cache hit.
[2025-05-30 18:42:24] [INFO ] State equation strengthened by 81 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem apf1 is UNSAT
Problem apf5 is UNSAT
Problem apf12 is UNSAT
Problem apf17 is UNSAT
Problem apf18 is UNSAT
After SMT solving in domain Real declared 62/359 variables, and 1 constraints, problems are : Problem set: 5 solved, 0 unsolved in 58 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/142 constraints, ReadFeed: 0/81 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 68ms problems are : Problem set: 5 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 5 invariant AP formulas.
Knowledge obtained : [(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p2) p1 (NOT p3) p0))), (X (NOT (AND p1 p3 p0))), (X (NOT (AND p2 (NOT p3)))), (X (NOT (AND p2 (NOT p3) p0))), (X (NOT p3)), (X (NOT (AND (NOT p2) (NOT p3) p0))), (X (NOT (AND p1 p0))), (X (AND (NOT p2) (NOT p3))), (X (NOT (AND p1 (NOT p3) p0))), (X (NOT (AND p3 p0))), (X (NOT (AND p2 p0))), (X (NOT (AND p2 (NOT p3) (NOT p0)))), (X (NOT (AND p1 (NOT p3) (NOT p0)))), (X (AND (NOT p2) (NOT p3) (NOT p0))), (X (NOT (AND (NOT p2) p1 (NOT p3)))), (X (NOT (AND p1 p3))), (X (NOT (AND p2 p3))), (X (NOT p0)), (X (NOT (AND p2 p3 p0))), (X (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p2 (NOT p0)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1 (NOT p3) p0)))), (X (X (NOT (AND p1 p3 p0)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p2 (NOT p3) p0)))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) (NOT p3) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND p1 (NOT p3) p0)))), (X (X (NOT (AND p3 p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p2 (NOT p3) (NOT p0))))), (X (X (NOT (AND p1 (NOT p3) (NOT p0))))), (X (X (AND (NOT p2) (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p3))))), (X (X (NOT (AND p1 p3)))), (X (X (NOT (AND p2 p3)))), (X (X (NOT p0))), (X (X (NOT (AND p2 p3 p0)))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p2 (NOT p0))))), (G (OR (NOT p0) (NOT p1) (NOT p3))), (G (OR (NOT p0) (NOT p3))), (G (OR (NOT p2) (NOT p3))), (G (OR (NOT p1) (NOT p3))), (G (OR (NOT p0) (NOT p2) (NOT p3)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p2 p3))), (F p3), (F (NOT (AND (NOT p2) (NOT p3)))), (F (NOT (OR p0 (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (F (NOT (OR (NOT p0) (NOT p1) p2 p3))), (F (NOT (OR (NOT p2) p3))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p1) p2 p3))), (F p0), (F p2), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p1) p3))), (F (NOT (OR p0 (NOT p2) p3))), (F p1), (F (NOT (OR (NOT p0) (NOT p2) p3))), (F (NOT (OR p0 (NOT p1) p3)))]
Knowledge based reduction with 52 factoid took 966 ms. Reduced automaton from 7 states, 32 edges and 4 AP (stutter sensitive) to 6 states, 22 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 369 ms :[p0, p0, p0, (AND p1 p0), p0, false]
Stuttering acceptance computed with spot in 368 ms :[p0, p0, p0, (AND p1 p0), p0, false]
Support contains 6 out of 142 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 142/142 places, 217/217 transitions.
Applied a total of 0 rules in 3 ms. Remains 142 /142 variables (removed 0) and now considering 217/217 (removed 0) transitions.
[2025-05-30 18:42:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:42:26] [INFO ] Implicit Places using invariants in 247 ms returned []
[2025-05-30 18:42:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:42:27] [INFO ] State equation strengthened by 81 read => feed constraints.
[2025-05-30 18:42:27] [INFO ] Implicit Places using invariants and state equation in 901 ms returned []
Implicit Place search using SMT with State Equation took 1150 ms to find 0 implicit places.
Running 216 sub problems to find dead transitions.
[2025-05-30 18:42:27] [INFO ] Invariant cache hit.
[2025-05-30 18:42:27] [INFO ] State equation strengthened by 81 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 217/359 variables, 142/144 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/359 variables, 81/225 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:42:42] [INFO ] Deduced a trap composed of 57 places in 128 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:42:43] [INFO ] Deduced a trap composed of 57 places in 180 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:42:43] [INFO ] Deduced a trap composed of 57 places in 141 ms of which 15 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 3/228 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/359 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 359/359 variables, and 228 constraints, problems are : Problem set: 0 solved, 216 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 142/142 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (OVERLAPS) 217/359 variables, 142/147 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 81/228 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/359 variables, 216/444 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 359/359 variables, and 444 constraints, problems are : Problem set: 0 solved, 216 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 142/142 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60253ms problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 60254ms
Finished structural reductions in LTL mode , in 1 iterations and 61411 ms. Remains : 142/142 places, 217/217 transitions.
Computed a total of 5 stabilizing places and 19 stable transitions
Graph (complete) has 524 edges and 142 vertex of which 141 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (AND (NOT p0) (NOT p3) (NOT p2))), (X (NOT (AND p0 p1))), (X (NOT p3)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 p2))), (X (AND (NOT p3) (NOT p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p3) (NOT p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 27 factoid took 277 ms. Reduced automaton from 6 states, 22 edges and 4 AP (stutter sensitive) to 6 states, 22 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 377 ms :[p0, p0, p0, (AND p1 p0), p0, false]
RANDOM walk for 40000 steps (9154 resets) in 589 ms. (67 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (1838 resets) in 126 ms. (314 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (1781 resets) in 115 ms. (344 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (3849 resets) in 180 ms. (221 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (3812 resets) in 160 ms. (248 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (3795 resets) in 215 ms. (185 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (1768 resets) in 169 ms. (235 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (1838 resets) in 143 ms. (277 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (1728 resets) in 116 ms. (341 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (1800 resets) in 133 ms. (298 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (1807 resets) in 131 ms. (303 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (1833 resets) in 118 ms. (336 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (1841 resets) in 172 ms. (231 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (1814 resets) in 159 ms. (250 steps per ms) remains 13/13 properties
Finished probabilistic random walk after 83581 steps, run visited all 13 properties in 863 ms. (steps per millisecond=96 )
Probabilistic random walk after 83581 steps, saw 37156 distinct states, run finished after 863 ms. (steps per millisecond=96 ) properties seen :13
Knowledge obtained : [(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (AND (NOT p0) (NOT p3) (NOT p2))), (X (NOT (AND p0 p1))), (X (NOT p3)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 p2))), (X (AND (NOT p3) (NOT p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p3) (NOT p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p2)))), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR (NOT p0) (NOT p1) p2))), (F (NOT (AND (NOT p2) (NOT p3)))), (F p3), (F (NOT (OR p0 (NOT p1)))), (F p1), (F (NOT (OR (NOT p0) p2))), (F p2), (F (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) (NOT p2))))]
Knowledge based reduction with 27 factoid took 775 ms. Reduced automaton from 6 states, 22 edges and 4 AP (stutter sensitive) to 6 states, 22 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 366 ms :[p0, p0, p0, (AND p1 p0), p0, false]
Stuttering acceptance computed with spot in 374 ms :[p0, p0, p0, (AND p1 p0), p0, false]
Stuttering acceptance computed with spot in 363 ms :[p0, p0, p0, (AND p1 p0), p0, false]
Product exploration explored 100000 steps with 37315 reset in 546 ms.
Product exploration explored 100000 steps with 37298 reset in 497 ms.
Applying partial POR strategy [false, false, false, true, false, false]
Stuttering acceptance computed with spot in 267 ms :[p0, p0, p0, (AND p1 p0), p0, false]
Support contains 6 out of 142 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 142/142 places, 217/217 transitions.
Applied a total of 0 rules in 5 ms. Remains 142 /142 variables (removed 0) and now considering 217/217 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 18:43:33] [INFO ] Redundant transitions in 1 ms returned []
Running 216 sub problems to find dead transitions.
[2025-05-30 18:43:33] [INFO ] Invariant cache hit.
[2025-05-30 18:43:33] [INFO ] State equation strengthened by 81 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 217/359 variables, 142/144 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/359 variables, 81/225 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:43:48] [INFO ] Deduced a trap composed of 57 places in 167 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:43:49] [INFO ] Deduced a trap composed of 57 places in 145 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:43:49] [INFO ] Deduced a trap composed of 57 places in 137 ms of which 14 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 3/228 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/359 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 359/359 variables, and 228 constraints, problems are : Problem set: 0 solved, 216 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 142/142 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (OVERLAPS) 217/359 variables, 142/147 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 81/228 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/359 variables, 216/444 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 359/359 variables, and 444 constraints, problems are : Problem set: 0 solved, 216 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 142/142 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60289ms problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 60290ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60304 ms. Remains : 142/142 places, 217/217 transitions.
Built C files in :
/tmp/ltsmin17968503137587719886
[2025-05-30 18:44:34] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17968503137587719886
Running compilation step : cd /tmp/ltsmin17968503137587719886;'/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 777 ms.
Running link step : cd /tmp/ltsmin17968503137587719886;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin17968503137587719886;'/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/stateBased2940009160729031427.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 142 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 142/142 places, 217/217 transitions.
Applied a total of 0 rules in 2 ms. Remains 142 /142 variables (removed 0) and now considering 217/217 (removed 0) transitions.
[2025-05-30 18:44:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:44:49] [INFO ] Implicit Places using invariants in 249 ms returned []
[2025-05-30 18:44:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:44:49] [INFO ] State equation strengthened by 81 read => feed constraints.
[2025-05-30 18:44:50] [INFO ] Implicit Places using invariants and state equation in 855 ms returned []
Implicit Place search using SMT with State Equation took 1116 ms to find 0 implicit places.
Running 216 sub problems to find dead transitions.
[2025-05-30 18:44:50] [INFO ] Invariant cache hit.
[2025-05-30 18:44:50] [INFO ] State equation strengthened by 81 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 217/359 variables, 142/144 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/359 variables, 81/225 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:45:04] [INFO ] Deduced a trap composed of 57 places in 157 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:45:05] [INFO ] Deduced a trap composed of 57 places in 142 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:45:05] [INFO ] Deduced a trap composed of 57 places in 139 ms of which 16 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 3/228 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/359 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:45:20] [INFO ] Deduced a trap composed of 60 places in 104 ms of which 19 ms to minimize.
SMT process timed out in 30282ms, After SMT, problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 30283ms
Finished structural reductions in LTL mode , in 1 iterations and 31402 ms. Remains : 142/142 places, 217/217 transitions.
Built C files in :
/tmp/ltsmin14621333251969232959
[2025-05-30 18:45:20] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14621333251969232959
Running compilation step : cd /tmp/ltsmin14621333251969232959;'/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 726 ms.
Running link step : cd /tmp/ltsmin14621333251969232959;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin14621333251969232959;'/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/stateBased4898764954093830549.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-30 18:45:35] [INFO ] Flatten gal took : 10 ms
[2025-05-30 18:45:35] [INFO ] Flatten gal took : 14 ms
[2025-05-30 18:45:35] [INFO ] Time to serialize gal into /tmp/LTL3444670880335332476.gal : 2 ms
[2025-05-30 18:45:35] [INFO ] Time to serialize properties into /tmp/LTL8685252988880631699.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3444670880335332476.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17882420675615884363.hoa' '-atoms' '/tmp/LTL8685252988880631699.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...318
Loading property file /tmp/LTL8685252988880631699.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17882420675615884363.hoa
Detected timeout of ITS tools.
[2025-05-30 18:45:50] [INFO ] Flatten gal took : 8 ms
[2025-05-30 18:45:50] [INFO ] Flatten gal took : 8 ms
[2025-05-30 18:45:50] [INFO ] Time to serialize gal into /tmp/LTL14450428713532385827.gal : 2 ms
[2025-05-30 18:45:50] [INFO ] Time to serialize properties into /tmp/LTL13030170257081314927.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14450428713532385827.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13030170257081314927.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 : !((F((G(F(((G("((s1<1)||(l4281<1))"))||(G((X("((s1<1)||(l4281<1))"))&&(F("((s1<1)||(l3834<1))")))))||(((("((s1<1)||(l4105<1))")&&(X("(...513
Formula 0 simplified : G(F!"((s1<1)||(l4281<1))" & F(X!"((s1<1)||(l4281<1))" | G!"((s1<1)||(l3834<1))") & (!"((p411>=1)&&(l0>=1))" | G(F!"((s1<1)||(l4281<1...463
Detected timeout of ITS tools.
[2025-05-30 18:46:05] [INFO ] Flatten gal took : 8 ms
[2025-05-30 18:46:05] [INFO ] Applying decomposition
[2025-05-30 18:46:05] [INFO ] Flatten gal took : 8 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/graph11603460008605695597.txt' '-o' '/tmp/graph11603460008605695597.bin' '-w' '/tmp/graph11603460008605695597.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11603460008605695597.bin' '-l' '-1' '-v' '-w' '/tmp/graph11603460008605695597.weights' '-q' '0' '-e' '0.001'
[2025-05-30 18:46:06] [INFO ] Decomposing Gal with order
[2025-05-30 18:46:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 18:46:06] [INFO ] Removed a total of 234 redundant transitions.
[2025-05-30 18:46:06] [INFO ] Flatten gal took : 34 ms
[2025-05-30 18:46:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 173 labels/synchronizations in 7 ms.
[2025-05-30 18:46:06] [INFO ] Time to serialize gal into /tmp/LTL296089601360365108.gal : 3 ms
[2025-05-30 18:46:06] [INFO ] Time to serialize properties into /tmp/LTL13429923051988039565.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL296089601360365108.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13429923051988039565.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...254
Read 1 LTL properties
Checking formula 0 : !((F((G(F(((G("((i5.u2.s1<1)||(i0.u0.l4281<1))"))||(G((X("((i5.u2.s1<1)||(i0.u0.l4281<1))"))&&(F("((i5.u2.s1<1)||(i0.u0.l3834<1))"))))...709
Formula 0 simplified : G(F!"((i5.u2.s1<1)||(i0.u0.l4281<1))" & F(X!"((i5.u2.s1<1)||(i0.u0.l4281<1))" | G!"((i5.u2.s1<1)||(i0.u0.l3834<1))") & (!"((i6.u17.p...659
Detected timeout of ITS tools.
Treatment of property DBSingleClientW-PT-d2m09-LTLFireability-11 finished in 273368 ms.
[2025-05-30 18:46:21] [INFO ] Flatten gal took : 16 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin18167471869449961383
[2025-05-30 18:46:21] [INFO ] Computing symmetric may disable matrix : 500 transitions.
[2025-05-30 18:46:21] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 18:46:21] [INFO ] Applying decomposition
[2025-05-30 18:46:21] [INFO ] Computing symmetric may enable matrix : 500 transitions.
[2025-05-30 18:46:21] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 18:46:21] [INFO ] Flatten gal took : 16 ms
[2025-05-30 18:46:21] [INFO ] Computing Do-Not-Accords matrix : 500 transitions.
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/graph1084127093927393210.txt' '-o' '/tmp/graph1084127093927393210.bin' '-w' '/tmp/graph1084127093927393210.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1084127093927393210.bin' '-l' '-1' '-v' '-w' '/tmp/graph1084127093927393210.weights' '-q' '0' '-e' '0.001'
[2025-05-30 18:46:21] [INFO ] Computation of Completed DNA matrix. took 19 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 18:46:21] [INFO ] Decomposing Gal with order
[2025-05-30 18:46:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 18:46:21] [INFO ] Built C files in 109ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18167471869449961383
Running compilation step : cd /tmp/ltsmin18167471869449961383;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '240' '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 18:46:21] [INFO ] Removed a total of 487 redundant transitions.
[2025-05-30 18:46:21] [INFO ] Flatten gal took : 81 ms
[2025-05-30 18:46:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 430 labels/synchronizations in 9 ms.
[2025-05-30 18:46:21] [INFO ] Time to serialize gal into /tmp/LTLFireability880716358762301251.gal : 6 ms
[2025-05-30 18:46:21] [INFO ] Time to serialize properties into /tmp/LTLFireability17341589773445041736.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability880716358762301251.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17341589773445041736.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...276
Read 3 LTL properties
Checking formula 0 : !((G(F(!("((i1.u1.s1>=1)&&(u20.l4153>=1))")))))
Formula 0 simplified : FG"((i1.u1.s1>=1)&&(u20.l4153>=1))"
Compilation finished in 2223 ms.
Running link step : cd /tmp/ltsmin18167471869449961383;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 71 ms.
Running LTSmin : cd /tmp/ltsmin18167471869449961383;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(!(LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin18167471869449961383;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(!(LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin18167471869449961383;'/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' '(((LTLAPp1==true) U X(X(!(LTLAPp2==true))))&&[](<>((LTLAPp3==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin18167471869449961383;'/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' '(((LTLAPp1==true) U X(X(!(LTLAPp2==true))))&&[](<>((LTLAPp3==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin18167471869449961383;'/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' '<>(([](<>(([](!(LTLAPp4==true))||[]((X(!(LTLAPp4==true))&&<>(!(LTLAPp5==true))))||(!(LTLAPp6==true)&&X(!(LTLAPp4==true))&&<>(!(LTLAPp5==true)))||(!(LTLAPp6==true)&&X([](!(LTLAPp4==true)))))))||(<>(([](!(LTLAPp4==true))||(!(LTLAPp6==true)&&((X(!(LTLAPp4==true))&&<>(!(LTLAPp5==true)))||X([](!(LTLAPp4==true)))))||[]((X(!(LTLAPp4==true))&&<>(!(LTLAPp5==true))))))&&(LTLAPp7==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin18167471869449961383;'/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' '<>(([](<>(([](!(LTLAPp4==true))||[]((X(!(LTLAPp4==true))&&<>(!(LTLAPp5==true))))||(!(LTLAPp6==true)&&X(!(LTLAPp4==true))&&<>(!(LTLAPp5==true)))||(!(LTLAPp6==true)&&X([](!(LTLAPp4==true)))))))||(<>(([](!(LTLAPp4==true))||(!(LTLAPp6==true)&&((X(!(LTLAPp4==true))&&<>(!(LTLAPp5==true)))||X([](!(LTLAPp4==true)))))||[]((X(!(LTLAPp4==true))&&<>(!(LTLAPp5==true))))))&&(LTLAPp7==true))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin18167471869449961383;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(!(LTLAPp0==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2025-05-30 19:15:38] [INFO ] Flatten gal took : 40 ms
[2025-05-30 19:15:38] [INFO ] Time to serialize gal into /tmp/LTLFireability8270069448910610775.gal : 8 ms
[2025-05-30 19:15:38] [INFO ] Time to serialize properties into /tmp/LTLFireability13315962383106300679.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability8270069448910610775.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13315962383106300679.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...298
Read 3 LTL properties
Checking formula 0 : !((G(F(!("((s1>=1)&&(l4153>=1))")))))
Formula 0 simplified : FG"((s1>=1)&&(l4153>=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-d2m09"
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-d2m09, 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-174854063600156"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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