Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 8.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 9.0K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 143K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 6 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1.6M May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748611050952

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-d2m06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-30 13:17:33] [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 13:17:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 13:17:34] [INFO ] Load time of PNML (sax parser for PT used): 649 ms
[2025-05-30 13:17:34] [INFO ] Transformed 4763 places.
[2025-05-30 13:17:34] [INFO ] Transformed 2478 transitions.
[2025-05-30 13:17:34] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 936 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 3580 places in 32 ms
Reduce places removed 3580 places and 0 transitions.
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 1183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1183/1183 places, 2478/2478 transitions.
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 199 transitions.
Iterating post reduction 0 with 245 rules applied. Total rules applied 245 place count 1137 transition count 2279
Discarding 368 places :
Symmetric choice reduction at 1 with 368 rule applications. Total rules 613 place count 769 transition count 1374
Iterating global reduction 1 with 368 rules applied. Total rules applied 981 place count 769 transition count 1374
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 1026 place count 769 transition count 1329
Discarding 296 places :
Symmetric choice reduction at 2 with 296 rule applications. Total rules 1322 place count 473 transition count 1033
Iterating global reduction 2 with 296 rules applied. Total rules applied 1618 place count 473 transition count 1033
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1624 place count 473 transition count 1027
Discarding 218 places :
Symmetric choice reduction at 3 with 218 rule applications. Total rules 1842 place count 255 transition count 734
Iterating global reduction 3 with 218 rules applied. Total rules applied 2060 place count 255 transition count 734
Ensure Unique test removed 223 transitions
Reduce isomorphic transitions removed 223 transitions.
Iterating post reduction 3 with 223 rules applied. Total rules applied 2283 place count 255 transition count 511
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 2295 place count 243 transition count 486
Iterating global reduction 4 with 12 rules applied. Total rules applied 2307 place count 243 transition count 486
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 2317 place count 243 transition count 476
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 2324 place count 236 transition count 469
Iterating global reduction 5 with 7 rules applied. Total rules applied 2331 place count 236 transition count 469
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2332 place count 236 transition count 468
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 2338 place count 230 transition count 462
Iterating global reduction 6 with 6 rules applied. Total rules applied 2344 place count 230 transition count 462
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 2347 place count 230 transition count 459
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2348 place count 229 transition count 457
Iterating global reduction 7 with 1 rules applied. Total rules applied 2349 place count 229 transition count 457
Applied a total of 2349 rules in 427 ms. Remains 229 /1183 variables (removed 954) and now considering 457/2478 (removed 2021) transitions.
// Phase 1: matrix 457 rows 229 cols
[2025-05-30 13:17:35] [INFO ] Computed 2 invariants in 38 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:17:37] [INFO ] Implicit Places using invariants in 1989 ms returned []
[2025-05-30 13:17:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:17:38] [INFO ] State equation strengthened by 233 read => feed constraints.
[2025-05-30 13:17:40] [INFO ] Implicit Places using invariants and state equation in 2622 ms returned []
Implicit Place search using SMT with State Equation took 4680 ms to find 0 implicit places.
Running 456 sub problems to find dead transitions.
[2025-05-30 13:17:40] [INFO ] Invariant cache hit.
[2025-05-30 13:17:40] [INFO ] State equation strengthened by 233 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 1 (OVERLAPS) 1/229 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/229 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 4 (OVERLAPS) 457/686 variables, 229/231 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/686 variables, 233/464 constraints. Problems are: Problem set: 0 solved, 456 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 686/686 variables, and 464 constraints, problems are : Problem set: 0 solved, 456 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 229/229 constraints, ReadFeed: 233/233 constraints, PredecessorRefiner: 456/456 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 456 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 1 (OVERLAPS) 1/229 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/229 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 4 (OVERLAPS) 457/686 variables, 229/231 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/686 variables, 233/464 constraints. Problems are: Problem set: 0 solved, 456 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 686/686 variables, and 920 constraints, problems are : Problem set: 0 solved, 456 unsolved in 30127 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 229/229 constraints, ReadFeed: 233/233 constraints, PredecessorRefiner: 456/456 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61950ms problems are : Problem set: 0 solved, 456 unsolved
Search for dead transitions found 0 dead transitions in 61985ms
Starting structural reductions in LTL mode, iteration 1 : 229/1183 places, 457/2478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67140 ms. Remains : 229/1183 places, 457/2478 transitions.
Support contains 34 out of 229 places after structural reductions.
[2025-05-30 13:18:42] [INFO ] Flatten gal took : 134 ms
[2025-05-30 13:18:42] [INFO ] Flatten gal took : 88 ms
[2025-05-30 13:18:42] [INFO ] Input system was already deterministic with 457 transitions.
Support contains 33 out of 229 places (down from 34) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 37 to 32
RANDOM walk for 40000 steps (9226 resets) in 4071 ms. (9 steps per ms) remains 28/32 properties
BEST_FIRST walk for 4004 steps (178 resets) in 62 ms. (63 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (202 resets) in 45 ms. (87 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (173 resets) in 28 ms. (138 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (188 resets) in 41 ms. (95 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (157 resets) in 32 ms. (121 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (179 resets) in 46 ms. (85 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (168 resets) in 36 ms. (108 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (167 resets) in 20 ms. (190 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (180 resets) in 23 ms. (166 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (170 resets) in 21 ms. (181 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (201 resets) in 47 ms. (83 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (173 resets) in 27 ms. (142 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (385 resets) in 59 ms. (66 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (192 resets) in 19 ms. (200 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (191 resets) in 17 ms. (222 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (183 resets) in 25 ms. (154 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (399 resets) in 34 ms. (114 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (177 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (178 resets) in 23 ms. (166 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (173 resets) in 21 ms. (182 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (165 resets) in 22 ms. (174 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (170 resets) in 23 ms. (166 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (191 resets) in 29 ms. (133 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (187 resets) in 26 ms. (148 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (191 resets) in 30 ms. (129 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (174 resets) in 38 ms. (102 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (173 resets) in 25 ms. (154 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (177 resets) in 26 ms. (148 steps per ms) remains 28/28 properties
[2025-05-30 13:18:44] [INFO ] Invariant cache hit.
[2025-05-30 13:18:44] [INFO ] State equation strengthened by 233 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 81/110 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 54/164 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 360/524 variables, 164/166 constraints. Problems are: Problem set: 0 solved, 28 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/524 variables, 136/302 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/524 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (OVERLAPS) 162/686 variables, 65/367 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/686 variables, 97/464 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/686 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 28 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 686/686 variables, and 464 constraints, problems are : Problem set: 0 solved, 28 unsolved in 5017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 229/229 constraints, ReadFeed: 233/233 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 81/110 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 54/164 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 28 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:18:50] [INFO ] Deduced a trap composed of 75 places in 230 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:18:50] [INFO ] Deduced a trap composed of 77 places in 191 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:18:51] [INFO ] Deduced a trap composed of 76 places in 185 ms of which 16 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (OVERLAPS) 360/524 variables, 164/169 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/524 variables, 136/305 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/524 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 162/686 variables, 65/370 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/686 variables, 97/467 constraints. Problems are: Problem set: 0 solved, 28 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 686/686 variables, and 495 constraints, problems are : Problem set: 0 solved, 28 unsolved in 5037 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 229/229 constraints, ReadFeed: 233/233 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10262ms problems are : Problem set: 0 solved, 28 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 29 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 457/457 transitions.
Graph (complete) has 842 edges and 229 vertex of which 228 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 228 transition count 450
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 11 place count 225 transition count 439
Iterating global reduction 1 with 3 rules applied. Total rules applied 14 place count 225 transition count 439
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 223 transition count 437
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 223 transition count 437
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 221 transition count 435
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 221 transition count 435
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 25 place count 221 transition count 432
Applied a total of 25 rules in 90 ms. Remains 221 /229 variables (removed 8) and now considering 432/457 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 221/229 places, 432/457 transitions.
RANDOM walk for 40000 steps (9220 resets) in 1022 ms. (39 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (192 resets) in 38 ms. (102 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (181 resets) in 30 ms. (129 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (186 resets) in 41 ms. (95 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (182 resets) in 34 ms. (114 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (170 resets) in 26 ms. (148 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (183 resets) in 33 ms. (117 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (176 resets) in 35 ms. (111 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (178 resets) in 36 ms. (108 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (167 resets) in 44 ms. (88 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (173 resets) in 60 ms. (65 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (171 resets) in 44 ms. (88 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (168 resets) in 32 ms. (121 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (391 resets) in 45 ms. (87 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (184 resets) in 32 ms. (121 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (176 resets) in 33 ms. (117 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (174 resets) in 32 ms. (121 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (370 resets) in 29 ms. (133 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (210 resets) in 33 ms. (117 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (189 resets) in 34 ms. (114 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (179 resets) in 28 ms. (138 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (179 resets) in 26 ms. (148 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (174 resets) in 27 ms. (142 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (179 resets) in 25 ms. (153 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (170 resets) in 25 ms. (153 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (185 resets) in 25 ms. (153 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (169 resets) in 23 ms. (166 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (189 resets) in 23 ms. (166 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (170 resets) in 25 ms. (153 steps per ms) remains 28/28 properties
Finished probabilistic random walk after 28537 steps, run visited all 28 properties in 406 ms. (steps per millisecond=70 )
Probabilistic random walk after 28537 steps, saw 12889 distinct states, run finished after 411 ms. (steps per millisecond=69 ) properties seen :28
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 6 stabilizing places and 34 stable transitions
Graph (complete) has 917 edges and 229 vertex of which 228 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 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(p0)))'
Support contains 2 out of 229 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 229/229 places, 457/457 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 202 transition count 358
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 202 transition count 358
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 59 place count 202 transition count 353
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 84 place count 177 transition count 326
Iterating global reduction 1 with 25 rules applied. Total rules applied 109 place count 177 transition count 326
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 118 place count 177 transition count 317
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 140 place count 155 transition count 280
Iterating global reduction 2 with 22 rules applied. Total rules applied 162 place count 155 transition count 280
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 177 place count 155 transition count 265
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 189 place count 143 transition count 247
Iterating global reduction 3 with 12 rules applied. Total rules applied 201 place count 143 transition count 247
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 205 place count 143 transition count 243
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 213 place count 135 transition count 234
Iterating global reduction 4 with 8 rules applied. Total rules applied 221 place count 135 transition count 234
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 222 place count 135 transition count 233
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 226 place count 131 transition count 229
Iterating global reduction 5 with 4 rules applied. Total rules applied 230 place count 131 transition count 229
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 240 place count 131 transition count 219
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 246 place count 125 transition count 179
Iterating global reduction 6 with 6 rules applied. Total rules applied 252 place count 125 transition count 179
Applied a total of 252 rules in 100 ms. Remains 125 /229 variables (removed 104) and now considering 179/457 (removed 278) transitions.
// Phase 1: matrix 179 rows 125 cols
[2025-05-30 13:18:56] [INFO ] Computed 2 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:18:57] [INFO ] Implicit Places using invariants in 211 ms returned []
[2025-05-30 13:18:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:18:57] [INFO ] State equation strengthened by 60 read => feed constraints.
[2025-05-30 13:18:57] [INFO ] Implicit Places using invariants and state equation in 752 ms returned []
Implicit Place search using SMT with State Equation took 967 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 13:18:57] [INFO ] Redundant transitions in 7 ms returned []
Running 178 sub problems to find dead transitions.
[2025-05-30 13:18:57] [INFO ] Invariant cache hit.
[2025-05-30 13:18:57] [INFO ] State equation strengthened by 60 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (OVERLAPS) 179/304 variables, 125/127 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 60/187 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (OVERLAPS) 0/304 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Real declared 304/304 variables, and 187 constraints, problems are : Problem set: 0 solved, 178 unsolved in 16284 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 125/125 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 178 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (OVERLAPS) 179/304 variables, 125/127 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 60/187 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 178/365 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 178 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 304/304 variables, and 365 constraints, problems are : Problem set: 0 solved, 178 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 125/125 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46432ms problems are : Problem set: 0 solved, 178 unsolved
Search for dead transitions found 0 dead transitions in 46434ms
Starting structural reductions in SI_LTL mode, iteration 1 : 125/229 places, 179/457 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 47515 ms. Remains : 125/229 places, 179/457 transitions.
Stuttering acceptance computed with spot in 255 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLFireability-00
Product exploration explored 100000 steps with 22991 reset in 787 ms.
Product exploration explored 100000 steps with 23098 reset in 469 ms.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 453 edges and 125 vertex of which 124 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
RANDOM walk for 40000 steps (9269 resets) in 419 ms. (95 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1804 resets) in 209 ms. (190 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 20509 steps, run visited all 1 properties in 86 ms. (steps per millisecond=238 )
Probabilistic random walk after 20509 steps, saw 10096 distinct states, run finished after 86 ms. (steps per millisecond=238 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Support contains 2 out of 125 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 125/125 places, 179/179 transitions.
Applied a total of 0 rules in 14 ms. Remains 125 /125 variables (removed 0) and now considering 179/179 (removed 0) transitions.
[2025-05-30 13:19:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:19:46] [INFO ] Implicit Places using invariants in 236 ms returned []
[2025-05-30 13:19:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:19:46] [INFO ] State equation strengthened by 60 read => feed constraints.
[2025-05-30 13:19:47] [INFO ] Implicit Places using invariants and state equation in 786 ms returned []
Implicit Place search using SMT with State Equation took 1024 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 13:19:47] [INFO ] Redundant transitions in 11 ms returned []
Running 178 sub problems to find dead transitions.
[2025-05-30 13:19:47] [INFO ] Invariant cache hit.
[2025-05-30 13:19:47] [INFO ] State equation strengthened by 60 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (OVERLAPS) 179/304 variables, 125/127 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 60/187 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (OVERLAPS) 0/304 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Real declared 304/304 variables, and 187 constraints, problems are : Problem set: 0 solved, 178 unsolved in 16443 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 125/125 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 178 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (OVERLAPS) 179/304 variables, 125/127 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 60/187 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 178/365 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 178 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 304/304 variables, and 365 constraints, problems are : Problem set: 0 solved, 178 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 125/125 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46666ms problems are : Problem set: 0 solved, 178 unsolved
Search for dead transitions found 0 dead transitions in 46668ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 47725 ms. Remains : 125/125 places, 179/179 transitions.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 453 edges and 125 vertex of which 124 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
RANDOM walk for 40000 steps (9242 resets) in 253 ms. (157 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1801 resets) in 104 ms. (380 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 20509 steps, run visited all 1 properties in 89 ms. (steps per millisecond=230 )
Probabilistic random walk after 20509 steps, saw 10096 distinct states, run finished after 89 ms. (steps per millisecond=230 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 140 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22949 reset in 361 ms.
Product exploration explored 100000 steps with 22996 reset in 373 ms.
Built C files in :
/tmp/ltsmin1938208205886047526
[2025-05-30 13:20:35] [INFO ] Computing symmetric may disable matrix : 179 transitions.
[2025-05-30 13:20:35] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 13:20:35] [INFO ] Computing symmetric may enable matrix : 179 transitions.
[2025-05-30 13:20:35] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 13:20:35] [INFO ] Computing Do-Not-Accords matrix : 179 transitions.
[2025-05-30 13:20:35] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 13:20:35] [INFO ] Built C files in 105ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1938208205886047526
Running compilation step : cd /tmp/ltsmin1938208205886047526;'/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 1185 ms.
Running link step : cd /tmp/ltsmin1938208205886047526;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 91 ms.
Running LTSmin : cd /tmp/ltsmin1938208205886047526;'/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/stateBased5288301089159329812.hoa' '--buchi-type=spotba'
LTSmin run took 578 ms.
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-00 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d2m06-LTLFireability-00 finished in 100979 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((!p0&&(!p1 U (G(!p1)||(!p1&&(X(!p0)||(!p0&&F(!p2)))))))))'
Support contains 4 out of 229 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 457/457 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 204 transition count 356
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 204 transition count 356
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 54 place count 204 transition count 352
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 76 place count 182 transition count 328
Iterating global reduction 1 with 22 rules applied. Total rules applied 98 place count 182 transition count 328
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 104 place count 182 transition count 322
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 123 place count 163 transition count 290
Iterating global reduction 2 with 19 rules applied. Total rules applied 142 place count 163 transition count 290
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 153 place count 163 transition count 279
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 163 place count 153 transition count 264
Iterating global reduction 3 with 10 rules applied. Total rules applied 173 place count 153 transition count 264
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 176 place count 153 transition count 261
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 182 place count 147 transition count 255
Iterating global reduction 4 with 6 rules applied. Total rules applied 188 place count 147 transition count 255
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 189 place count 147 transition count 254
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 192 place count 144 transition count 251
Iterating global reduction 5 with 3 rules applied. Total rules applied 195 place count 144 transition count 251
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 202 place count 144 transition count 244
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 208 place count 138 transition count 204
Iterating global reduction 6 with 6 rules applied. Total rules applied 214 place count 138 transition count 204
Applied a total of 214 rules in 43 ms. Remains 138 /229 variables (removed 91) and now considering 204/457 (removed 253) transitions.
// Phase 1: matrix 204 rows 138 cols
[2025-05-30 13:20:37] [INFO ] Computed 2 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:20:37] [INFO ] Implicit Places using invariants in 222 ms returned []
[2025-05-30 13:20:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:20:38] [INFO ] State equation strengthened by 68 read => feed constraints.
[2025-05-30 13:20:39] [INFO ] Implicit Places using invariants and state equation in 1568 ms returned []
Implicit Place search using SMT with State Equation took 1794 ms to find 0 implicit places.
Running 203 sub problems to find dead transitions.
[2025-05-30 13:20:39] [INFO ] Invariant cache hit.
[2025-05-30 13:20:39] [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/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (OVERLAPS) 1/138 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 204/342 variables, 138/140 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 68/208 constraints. Problems are: Problem set: 0 solved, 203 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (OVERLAPS) 0/342 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 342/342 variables, and 208 constraints, problems are : Problem set: 0 solved, 203 unsolved in 26278 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 138/138 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 203 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (OVERLAPS) 1/138 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 204/342 variables, 138/140 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 68/208 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 203/411 constraints. Problems are: Problem set: 0 solved, 203 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 342/342 variables, and 411 constraints, problems are : Problem set: 0 solved, 203 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 138/138 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56489ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 56490ms
Starting structural reductions in LTL mode, iteration 1 : 138/229 places, 204/457 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58330 ms. Remains : 138/229 places, 204/457 transitions.
Stuttering acceptance computed with spot in 311 ms :[true, p2, (OR p0 p1), (OR p0 p1), (AND p2 p0 p1)]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLFireability-01
Product exploration explored 100000 steps with 50000 reset in 692 ms.
Product exploration explored 100000 steps with 50000 reset in 370 ms.
Computed a total of 5 stabilizing places and 18 stable transitions
Graph (complete) has 501 edges and 138 vertex of which 137 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 5 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (OR p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 18 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d2m06-LTLFireability-01 finished in 59761 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X(((!p2 U (p3||G(!p2)))&&p1))&&p0)))))'
Support contains 4 out of 229 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 457/457 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 204 transition count 353
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 204 transition count 353
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 54 place count 204 transition count 349
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 76 place count 182 transition count 325
Iterating global reduction 1 with 22 rules applied. Total rules applied 98 place count 182 transition count 325
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 106 place count 182 transition count 317
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 125 place count 163 transition count 287
Iterating global reduction 2 with 19 rules applied. Total rules applied 144 place count 163 transition count 287
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 155 place count 163 transition count 276
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 165 place count 153 transition count 260
Iterating global reduction 3 with 10 rules applied. Total rules applied 175 place count 153 transition count 260
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 183 place count 153 transition count 252
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 189 place count 147 transition count 245
Iterating global reduction 4 with 6 rules applied. Total rules applied 195 place count 147 transition count 245
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 198 place count 144 transition count 242
Iterating global reduction 4 with 3 rules applied. Total rules applied 201 place count 144 transition count 242
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 144 transition count 236
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 209 place count 142 transition count 224
Iterating global reduction 5 with 2 rules applied. Total rules applied 211 place count 142 transition count 224
Applied a total of 211 rules in 23 ms. Remains 142 /229 variables (removed 87) and now considering 224/457 (removed 233) transitions.
// Phase 1: matrix 224 rows 142 cols
[2025-05-30 13:21:37] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:21:37] [INFO ] Implicit Places using invariants in 171 ms returned []
[2025-05-30 13:21:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:21:37] [INFO ] State equation strengthened by 91 read => feed constraints.
[2025-05-30 13:21:38] [INFO ] Implicit Places using invariants and state equation in 990 ms returned []
Implicit Place search using SMT with State Equation took 1164 ms to find 0 implicit places.
Running 223 sub problems to find dead transitions.
[2025-05-30 13:21:38] [INFO ] Invariant cache hit.
[2025-05-30 13:21:38] [INFO ] State equation strengthened by 91 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, 223 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (OVERLAPS) 224/366 variables, 142/144 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 91/235 constraints. Problems are: Problem set: 0 solved, 223 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:21:53] [INFO ] Deduced a trap composed of 55 places in 135 ms of which 13 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 223 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:22:08] [INFO ] Deduced a trap composed of 55 places in 145 ms of which 15 ms to minimize.
SMT process timed out in 30184ms, After SMT, problems are : Problem set: 0 solved, 223 unsolved
Search for dead transitions found 0 dead transitions in 30185ms
Starting structural reductions in LTL mode, iteration 1 : 142/229 places, 224/457 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31374 ms. Remains : 142/229 places, 224/457 transitions.
Stuttering acceptance computed with spot in 327 ms :[true, (OR (NOT p0) (NOT p1) (AND p2 (NOT p3))), (OR (NOT p0) (NOT p1) (AND p2 (NOT p3))), (OR (NOT p0) (NOT p1) (AND p2 (NOT p3))), (OR (NOT p0) (NOT p1) (AND p2 (NOT p3)))]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLFireability-02
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m06-LTLFireability-02 finished in 31726 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G((F(p1)&&(!p2 U (p3||G(!p2)))))||p0))))'
Support contains 4 out of 229 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 457/457 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 203 transition count 356
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 203 transition count 356
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 56 place count 203 transition count 352
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 79 place count 180 transition count 327
Iterating global reduction 1 with 23 rules applied. Total rules applied 102 place count 180 transition count 327
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 109 place count 180 transition count 320
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 129 place count 160 transition count 285
Iterating global reduction 2 with 20 rules applied. Total rules applied 149 place count 160 transition count 285
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 159 place count 160 transition count 275
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 170 place count 149 transition count 259
Iterating global reduction 3 with 11 rules applied. Total rules applied 181 place count 149 transition count 259
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 184 place count 149 transition count 256
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 192 place count 141 transition count 247
Iterating global reduction 4 with 8 rules applied. Total rules applied 200 place count 141 transition count 247
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 201 place count 141 transition count 246
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 205 place count 137 transition count 242
Iterating global reduction 5 with 4 rules applied. Total rules applied 209 place count 137 transition count 242
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 218 place count 137 transition count 233
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 223 place count 132 transition count 200
Iterating global reduction 6 with 5 rules applied. Total rules applied 228 place count 132 transition count 200
Applied a total of 228 rules in 42 ms. Remains 132 /229 variables (removed 97) and now considering 200/457 (removed 257) transitions.
// Phase 1: matrix 200 rows 132 cols
[2025-05-30 13:22:09] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:22:09] [INFO ] Implicit Places using invariants in 207 ms returned []
[2025-05-30 13:22:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:22:09] [INFO ] State equation strengthened by 70 read => feed constraints.
[2025-05-30 13:22:10] [INFO ] Implicit Places using invariants and state equation in 1179 ms returned []
Implicit Place search using SMT with State Equation took 1388 ms to find 0 implicit places.
Running 199 sub problems to find dead transitions.
[2025-05-30 13:22:10] [INFO ] Invariant cache hit.
[2025-05-30 13:22:10] [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/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (OVERLAPS) 200/332 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/332 variables, 70/204 constraints. Problems are: Problem set: 0 solved, 199 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:22:24] [INFO ] Deduced a trap composed of 53 places in 169 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:22:24] [INFO ] Deduced a trap composed of 13 places in 162 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:22:25] [INFO ] Deduced a trap composed of 57 places in 166 ms of which 14 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/332 variables, 3/207 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/332 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 199 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 332/332 variables, and 207 constraints, problems are : Problem set: 0 solved, 199 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 3/3 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/131 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (OVERLAPS) 1/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 6 (OVERLAPS) 200/332 variables, 132/137 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/332 variables, 70/207 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/332 variables, 199/406 constraints. Problems are: Problem set: 0 solved, 199 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 332/332 variables, and 406 constraints, problems are : Problem set: 0 solved, 199 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60225ms problems are : Problem set: 0 solved, 199 unsolved
Search for dead transitions found 0 dead transitions in 60226ms
Starting structural reductions in LTL mode, iteration 1 : 132/229 places, 200/457 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61657 ms. Remains : 132/229 places, 200/457 transitions.
Stuttering acceptance computed with spot in 294 ms :[(OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) (NOT p1))), true, (NOT p1), (OR (NOT p1) (AND p2 (NOT p3)))]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLFireability-04
Entered a terminal (fully accepting) state of product in 10288 steps with 2356 reset in 75 ms.
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m06-LTLFireability-04 finished in 62056 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((X(!(X(G(p0))||G(p1))) U p2)))'
Support contains 3 out of 229 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 : 229/229 places, 457/457 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 204 transition count 359
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 204 transition count 359
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 54 place count 204 transition count 355
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 75 place count 183 transition count 332
Iterating global reduction 1 with 21 rules applied. Total rules applied 96 place count 183 transition count 332
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 104 place count 183 transition count 324
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 123 place count 164 transition count 295
Iterating global reduction 2 with 19 rules applied. Total rules applied 142 place count 164 transition count 295
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 152 place count 164 transition count 285
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 162 place count 154 transition count 269
Iterating global reduction 3 with 10 rules applied. Total rules applied 172 place count 154 transition count 269
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 184 place count 154 transition count 257
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 189 place count 149 transition count 251
Iterating global reduction 4 with 5 rules applied. Total rules applied 194 place count 149 transition count 251
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 196 place count 147 transition count 249
Iterating global reduction 4 with 2 rules applied. Total rules applied 198 place count 147 transition count 249
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 202 place count 147 transition count 245
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 205 place count 144 transition count 225
Iterating global reduction 5 with 3 rules applied. Total rules applied 208 place count 144 transition count 225
Applied a total of 208 rules in 71 ms. Remains 144 /229 variables (removed 85) and now considering 225/457 (removed 232) transitions.
// Phase 1: matrix 225 rows 144 cols
[2025-05-30 13:23:11] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:23:11] [INFO ] Implicit Places using invariants in 286 ms returned []
[2025-05-30 13:23:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:23:11] [INFO ] State equation strengthened by 87 read => feed constraints.
[2025-05-30 13:23:13] [INFO ] Implicit Places using invariants and state equation in 2327 ms returned []
Implicit Place search using SMT with State Equation took 2616 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 13:23:13] [INFO ] Redundant transitions in 5 ms returned []
Running 224 sub problems to find dead transitions.
[2025-05-30 13:23:13] [INFO ] Invariant cache hit.
[2025-05-30 13:23:13] [INFO ] State equation strengthened by 87 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (OVERLAPS) 1/144 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (OVERLAPS) 225/369 variables, 144/146 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/369 variables, 87/233 constraints. Problems are: Problem set: 0 solved, 224 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/369 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 7 (OVERLAPS) 0/369 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 224 unsolved
No progress, stopping.
After SMT solving in domain Real declared 369/369 variables, and 233 constraints, problems are : Problem set: 0 solved, 224 unsolved in 25675 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 144/144 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 224 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (OVERLAPS) 1/144 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (OVERLAPS) 225/369 variables, 144/146 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/369 variables, 87/233 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/369 variables, 224/457 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 369/369 variables, and 457 constraints, problems are : Problem set: 0 solved, 224 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 144/144 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55955ms problems are : Problem set: 0 solved, 224 unsolved
Search for dead transitions found 0 dead transitions in 55956ms
Starting structural reductions in SI_LTL mode, iteration 1 : 144/229 places, 225/457 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 58658 ms. Remains : 144/229 places, 225/457 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p2)]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLFireability-06
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m06-LTLFireability-06 finished in 58754 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||X(X(p1)))))'
Support contains 4 out of 229 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 457/457 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 203 transition count 352
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 203 transition count 352
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 56 place count 203 transition count 348
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 79 place count 180 transition count 324
Iterating global reduction 1 with 23 rules applied. Total rules applied 102 place count 180 transition count 324
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 109 place count 180 transition count 317
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 130 place count 159 transition count 282
Iterating global reduction 2 with 21 rules applied. Total rules applied 151 place count 159 transition count 282
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 163 place count 159 transition count 270
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 174 place count 148 transition count 253
Iterating global reduction 3 with 11 rules applied. Total rules applied 185 place count 148 transition count 253
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 193 place count 148 transition count 245
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 200 place count 141 transition count 237
Iterating global reduction 4 with 7 rules applied. Total rules applied 207 place count 141 transition count 237
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 208 place count 141 transition count 236
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 212 place count 137 transition count 232
Iterating global reduction 5 with 4 rules applied. Total rules applied 216 place count 137 transition count 232
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 223 place count 137 transition count 225
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 228 place count 132 transition count 193
Iterating global reduction 6 with 5 rules applied. Total rules applied 233 place count 132 transition count 193
Applied a total of 233 rules in 39 ms. Remains 132 /229 variables (removed 97) and now considering 193/457 (removed 264) transitions.
// Phase 1: matrix 193 rows 132 cols
[2025-05-30 13:24:09] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:24:10] [INFO ] Implicit Places using invariants in 286 ms returned []
[2025-05-30 13:24:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:24:10] [INFO ] State equation strengthened by 65 read => feed constraints.
[2025-05-30 13:24:10] [INFO ] Implicit Places using invariants and state equation in 723 ms returned []
Implicit Place search using SMT with State Equation took 1031 ms to find 0 implicit places.
Running 192 sub problems to find dead transitions.
[2025-05-30 13:24:11] [INFO ] Invariant cache hit.
[2025-05-30 13:24:11] [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, 192 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (OVERLAPS) 193/325 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/325 variables, 65/199 constraints. Problems are: Problem set: 0 solved, 192 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 7 (OVERLAPS) 0/325 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 192 unsolved
No progress, stopping.
After SMT solving in domain Real declared 325/325 variables, and 199 constraints, problems are : Problem set: 0 solved, 192 unsolved in 18831 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: 192/192 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 192 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, 192 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (OVERLAPS) 193/325 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/325 variables, 65/199 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 192/391 constraints. Problems are: Problem set: 0 solved, 192 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 325/325 variables, and 391 constraints, problems are : Problem set: 0 solved, 192 unsolved in 30020 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: 192/192 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49052ms problems are : Problem set: 0 solved, 192 unsolved
Search for dead transitions found 0 dead transitions in 49054ms
Starting structural reductions in LTL mode, iteration 1 : 132/229 places, 193/457 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50126 ms. Remains : 132/229 places, 193/457 transitions.
Stuttering acceptance computed with spot in 267 ms :[(AND (NOT p1) (NOT p0)), true, (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLFireability-07
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m06-LTLFireability-07 finished in 50420 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(((!p1 U (p2||G(!p1)))||p0))))'
Support contains 3 out of 229 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 229/229 places, 457/457 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 203 transition count 352
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 203 transition count 352
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 56 place count 203 transition count 348
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 79 place count 180 transition count 323
Iterating global reduction 1 with 23 rules applied. Total rules applied 102 place count 180 transition count 323
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 110 place count 180 transition count 315
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 130 place count 160 transition count 281
Iterating global reduction 2 with 20 rules applied. Total rules applied 150 place count 160 transition count 281
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 161 place count 160 transition count 270
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 172 place count 149 transition count 254
Iterating global reduction 3 with 11 rules applied. Total rules applied 183 place count 149 transition count 254
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 187 place count 149 transition count 250
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 194 place count 142 transition count 242
Iterating global reduction 4 with 7 rules applied. Total rules applied 201 place count 142 transition count 242
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 202 place count 142 transition count 241
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 205 place count 139 transition count 238
Iterating global reduction 5 with 3 rules applied. Total rules applied 208 place count 139 transition count 238
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 216 place count 139 transition count 230
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 221 place count 134 transition count 198
Iterating global reduction 6 with 5 rules applied. Total rules applied 226 place count 134 transition count 198
Applied a total of 226 rules in 50 ms. Remains 134 /229 variables (removed 95) and now considering 198/457 (removed 259) transitions.
// Phase 1: matrix 198 rows 134 cols
[2025-05-30 13:25:00] [INFO ] Computed 2 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:25:00] [INFO ] Implicit Places using invariants in 227 ms returned []
[2025-05-30 13:25:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:25:00] [INFO ] State equation strengthened by 71 read => feed constraints.
[2025-05-30 13:25:02] [INFO ] Implicit Places using invariants and state equation in 1643 ms returned []
Implicit Place search using SMT with State Equation took 1882 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 13:25:02] [INFO ] Redundant transitions in 4 ms returned []
Running 197 sub problems to find dead transitions.
[2025-05-30 13:25:02] [INFO ] Invariant cache hit.
[2025-05-30 13:25:02] [INFO ] State equation strengthened by 71 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (OVERLAPS) 198/332 variables, 134/136 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/332 variables, 71/207 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/332 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 7 (OVERLAPS) 0/332 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 197 unsolved
No progress, stopping.
After SMT solving in domain Real declared 332/332 variables, and 207 constraints, problems are : Problem set: 0 solved, 197 unsolved in 20704 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 134/134 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 197 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (OVERLAPS) 198/332 variables, 134/136 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/332 variables, 71/207 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/332 variables, 197/404 constraints. Problems are: Problem set: 0 solved, 197 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 332/332 variables, and 404 constraints, problems are : Problem set: 0 solved, 197 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 134/134 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50953ms problems are : Problem set: 0 solved, 197 unsolved
Search for dead transitions found 0 dead transitions in 50954ms
Starting structural reductions in SI_LTL mode, iteration 1 : 134/229 places, 198/457 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 52898 ms. Remains : 134/229 places, 198/457 transitions.
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1)]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLFireability-08
Product exploration explored 100000 steps with 22978 reset in 428 ms.
Product exploration explored 100000 steps with 23096 reset in 422 ms.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 489 edges and 134 vertex of which 133 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 164 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1)]
RANDOM walk for 40000 steps (9193 resets) in 595 ms. (67 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1772 resets) in 252 ms. (158 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1806 resets) in 296 ms. (134 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1813 resets) in 506 ms. (78 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1728 resets) in 199 ms. (200 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1796 resets) in 211 ms. (188 steps per ms) remains 5/5 properties
Finished probabilistic random walk after 26806 steps, run visited all 5 properties in 237 ms. (steps per millisecond=113 )
Probabilistic random walk after 26806 steps, saw 12992 distinct states, run finished after 238 ms. (steps per millisecond=112 ) properties seen :5
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p2 p0 p1))), (F (NOT (OR p2 p0 (NOT p1))))]
Knowledge based reduction with 11 factoid took 366 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1)]
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1)]
Support contains 3 out of 134 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 134/134 places, 198/198 transitions.
Applied a total of 0 rules in 9 ms. Remains 134 /134 variables (removed 0) and now considering 198/198 (removed 0) transitions.
[2025-05-30 13:25:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:25:56] [INFO ] Implicit Places using invariants in 342 ms returned []
[2025-05-30 13:25:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:25:56] [INFO ] State equation strengthened by 71 read => feed constraints.
[2025-05-30 13:25:57] [INFO ] Implicit Places using invariants and state equation in 1303 ms returned []
Implicit Place search using SMT with State Equation took 1666 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 13:25:57] [INFO ] Redundant transitions in 1 ms returned []
Running 197 sub problems to find dead transitions.
[2025-05-30 13:25:57] [INFO ] Invariant cache hit.
[2025-05-30 13:25:57] [INFO ] State equation strengthened by 71 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (OVERLAPS) 198/332 variables, 134/136 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/332 variables, 71/207 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/332 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 7 (OVERLAPS) 0/332 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 197 unsolved
No progress, stopping.
After SMT solving in domain Real declared 332/332 variables, and 207 constraints, problems are : Problem set: 0 solved, 197 unsolved in 19903 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 134/134 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 197 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (OVERLAPS) 198/332 variables, 134/136 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/332 variables, 71/207 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/332 variables, 197/404 constraints. Problems are: Problem set: 0 solved, 197 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 332/332 variables, and 404 constraints, problems are : Problem set: 0 solved, 197 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 134/134 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50116ms problems are : Problem set: 0 solved, 197 unsolved
Search for dead transitions found 0 dead transitions in 50117ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 51805 ms. Remains : 134/134 places, 198/198 transitions.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 489 edges and 134 vertex of which 133 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 206 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1)]
RANDOM walk for 40000 steps (9174 resets) in 602 ms. (66 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1754 resets) in 117 ms. (339 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1799 resets) in 234 ms. (170 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1799 resets) in 128 ms. (310 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1714 resets) in 147 ms. (270 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1781 resets) in 126 ms. (314 steps per ms) remains 5/5 properties
Finished probabilistic random walk after 26806 steps, run visited all 5 properties in 434 ms. (steps per millisecond=61 )
Probabilistic random walk after 26806 steps, saw 12992 distinct states, run finished after 434 ms. (steps per millisecond=61 ) properties seen :5
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p2 p0 p1))), (F (NOT (OR p2 p0 (NOT p1))))]
Knowledge based reduction with 11 factoid took 457 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1)]
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1)]
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1)]
Product exploration explored 100000 steps with 22988 reset in 409 ms.
Product exploration explored 100000 steps with 22927 reset in 308 ms.
Built C files in :
/tmp/ltsmin6552161960517860102
[2025-05-30 13:26:50] [INFO ] Computing symmetric may disable matrix : 198 transitions.
[2025-05-30 13:26:50] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 13:26:50] [INFO ] Computing symmetric may enable matrix : 198 transitions.
[2025-05-30 13:26:50] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 13:26:50] [INFO ] Computing Do-Not-Accords matrix : 198 transitions.
[2025-05-30 13:26:50] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 13:26:50] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6552161960517860102
Running compilation step : cd /tmp/ltsmin6552161960517860102;'/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 903 ms.
Running link step : cd /tmp/ltsmin6552161960517860102;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin6552161960517860102;'/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/stateBased2584589041888586551.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 134 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 134/134 places, 198/198 transitions.
Applied a total of 0 rules in 6 ms. Remains 134 /134 variables (removed 0) and now considering 198/198 (removed 0) transitions.
[2025-05-30 13:27:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:27:06] [INFO ] Implicit Places using invariants in 193 ms returned []
[2025-05-30 13:27:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:27:06] [INFO ] State equation strengthened by 71 read => feed constraints.
[2025-05-30 13:27:07] [INFO ] Implicit Places using invariants and state equation in 1679 ms returned []
Implicit Place search using SMT with State Equation took 1880 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 13:27:07] [INFO ] Redundant transitions in 2 ms returned []
Running 197 sub problems to find dead transitions.
[2025-05-30 13:27:07] [INFO ] Invariant cache hit.
[2025-05-30 13:27:07] [INFO ] State equation strengthened by 71 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (OVERLAPS) 198/332 variables, 134/136 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/332 variables, 71/207 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/332 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 7 (OVERLAPS) 0/332 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 197 unsolved
No progress, stopping.
After SMT solving in domain Real declared 332/332 variables, and 207 constraints, problems are : Problem set: 0 solved, 197 unsolved in 20875 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 134/134 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 197 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (OVERLAPS) 198/332 variables, 134/136 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/332 variables, 71/207 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/332 variables, 197/404 constraints. Problems are: Problem set: 0 solved, 197 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 332/332 variables, and 404 constraints, problems are : Problem set: 0 solved, 197 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 134/134 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 51096ms problems are : Problem set: 0 solved, 197 unsolved
Search for dead transitions found 0 dead transitions in 51097ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 52999 ms. Remains : 134/134 places, 198/198 transitions.
Built C files in :
/tmp/ltsmin826025439807269878
[2025-05-30 13:27:58] [INFO ] Computing symmetric may disable matrix : 198 transitions.
[2025-05-30 13:27:58] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 13:27:58] [INFO ] Computing symmetric may enable matrix : 198 transitions.
[2025-05-30 13:27:58] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 13:27:58] [INFO ] Computing Do-Not-Accords matrix : 198 transitions.
[2025-05-30 13:27:58] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 13:27:58] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin826025439807269878
Running compilation step : cd /tmp/ltsmin826025439807269878;'/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 876 ms.
Running link step : cd /tmp/ltsmin826025439807269878;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin826025439807269878;'/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/stateBased7111162729196630358.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-30 13:28:14] [INFO ] Flatten gal took : 30 ms
[2025-05-30 13:28:14] [INFO ] Flatten gal took : 28 ms
[2025-05-30 13:28:14] [INFO ] Time to serialize gal into /tmp/LTL11292601494974192701.gal : 7 ms
[2025-05-30 13:28:14] [INFO ] Time to serialize properties into /tmp/LTL9441453996997391890.prop : 6 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/LTL11292601494974192701.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4055421028998163144.hoa' '-atoms' '/tmp/LTL9441453996997391890.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/LTL9441453996997391890.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4055421028998163144.hoa
Detected timeout of ITS tools.
[2025-05-30 13:28:29] [INFO ] Flatten gal took : 26 ms
[2025-05-30 13:28:29] [INFO ] Flatten gal took : 24 ms
[2025-05-30 13:28:29] [INFO ] Time to serialize gal into /tmp/LTL2148150225766819634.gal : 6 ms
[2025-05-30 13:28:29] [INFO ] Time to serialize properties into /tmp/LTL11505051434657941983.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2148150225766819634.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11505051434657941983.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F(("((s1<1)||(l2799<1))")||((!("((s1>=1)&&(l4272>=1))"))U(("((!((s1>=1)&&(l2799>=1)))&&(!((s1>=1)&&(l4272>=1))))")||(G(!("((s1>=1...179
Formula 0 simplified : FG(!"((s1<1)||(l2799<1))" & ("((s1>=1)&&(l4272>=1))" M !"((!((s1>=1)&&(l2799>=1)))&&(!((s1>=1)&&(l4272>=1))))"))
Detected timeout of ITS tools.
[2025-05-30 13:28:44] [INFO ] Flatten gal took : 22 ms
[2025-05-30 13:28:44] [INFO ] Applying decomposition
[2025-05-30 13:28:44] [INFO ] Flatten gal took : 21 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/graph8574946673923888698.txt' '-o' '/tmp/graph8574946673923888698.bin' '-w' '/tmp/graph8574946673923888698.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8574946673923888698.bin' '-l' '-1' '-v' '-w' '/tmp/graph8574946673923888698.weights' '-q' '0' '-e' '0.001'
[2025-05-30 13:28:44] [INFO ] Decomposing Gal with order
[2025-05-30 13:28:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 13:28:44] [INFO ] Removed a total of 222 redundant transitions.
[2025-05-30 13:28:44] [INFO ] Flatten gal took : 95 ms
[2025-05-30 13:28:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 141 labels/synchronizations in 28 ms.
[2025-05-30 13:28:44] [INFO ] Time to serialize gal into /tmp/LTL10388720041458268120.gal : 8 ms
[2025-05-30 13:28:44] [INFO ] Time to serialize properties into /tmp/LTL7459516719250265332.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/LTL10388720041458268120.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7459516719250265332.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(("((i1.u0.s1<1)||(i3.u13.l2799<1))")||((!("((i1.u0.s1>=1)&&(i6.u25.l4272>=1))"))U(("((!((i1.u0.s1>=1)&&(i3.u13.l2799>=1)))&&(!(...244
Formula 0 simplified : FG(!"((i1.u0.s1<1)||(i3.u13.l2799<1))" & ("((i1.u0.s1>=1)&&(i6.u25.l4272>=1))" M !"((!((i1.u0.s1>=1)&&(i3.u13.l2799>=1)))&&(!((i1.u0...187
Reverse transition relation is NOT exact ! Due to transitions t6, t13, t108, t110, t114, t116, t117, t118, t119, t120, t122, t124, t125, t148, t168, t170, ...657
Computing Next relation with stutter on 2.47108e+06 deadlock states
Detected timeout of ITS tools.
Treatment of property DBSingleClientW-PT-d2m06-LTLFireability-08 finished in 239471 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(p0)&&F((p1&&(!p2 U (p3||G(!p2)))))))))'
Support contains 6 out of 229 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 457/457 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 204 transition count 353
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 204 transition count 353
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 54 place count 204 transition count 349
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 76 place count 182 transition count 326
Iterating global reduction 1 with 22 rules applied. Total rules applied 98 place count 182 transition count 326
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 104 place count 182 transition count 320
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 124 place count 162 transition count 286
Iterating global reduction 2 with 20 rules applied. Total rules applied 144 place count 162 transition count 286
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 155 place count 162 transition count 275
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 166 place count 151 transition count 259
Iterating global reduction 3 with 11 rules applied. Total rules applied 177 place count 151 transition count 259
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 180 place count 151 transition count 256
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 187 place count 144 transition count 248
Iterating global reduction 4 with 7 rules applied. Total rules applied 194 place count 144 transition count 248
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 195 place count 144 transition count 247
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 198 place count 141 transition count 244
Iterating global reduction 5 with 3 rules applied. Total rules applied 201 place count 141 transition count 244
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 209 place count 141 transition count 236
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 213 place count 137 transition count 211
Iterating global reduction 6 with 4 rules applied. Total rules applied 217 place count 137 transition count 211
Applied a total of 217 rules in 29 ms. Remains 137 /229 variables (removed 92) and now considering 211/457 (removed 246) transitions.
// Phase 1: matrix 211 rows 137 cols
[2025-05-30 13:28:59] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:29:00] [INFO ] Implicit Places using invariants in 299 ms returned []
[2025-05-30 13:29:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:29:00] [INFO ] State equation strengthened by 81 read => feed constraints.
[2025-05-30 13:29:01] [INFO ] Implicit Places using invariants and state equation in 1024 ms returned []
Implicit Place search using SMT with State Equation took 1330 ms to find 0 implicit places.
Running 210 sub problems to find dead transitions.
[2025-05-30 13:29:01] [INFO ] Invariant cache hit.
[2025-05-30 13:29:01] [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/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (OVERLAPS) 1/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (OVERLAPS) 211/348 variables, 137/139 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 81/220 constraints. Problems are: Problem set: 0 solved, 210 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (OVERLAPS) 0/348 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 210 unsolved
No progress, stopping.
After SMT solving in domain Real declared 348/348 variables, and 220 constraints, problems are : Problem set: 0 solved, 210 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 137/137 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 210 unsolved
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, 210 unsolved
At refinement iteration 1 (OVERLAPS) 1/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (OVERLAPS) 211/348 variables, 137/139 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 81/220 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 210/430 constraints. Problems are: Problem set: 0 solved, 210 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 348/348 variables, and 430 constraints, problems are : Problem set: 0 solved, 210 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 137/137 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60249ms problems are : Problem set: 0 solved, 210 unsolved
Search for dead transitions found 0 dead transitions in 60250ms
Starting structural reductions in LTL mode, iteration 1 : 137/229 places, 211/457 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61611 ms. Remains : 137/229 places, 211/457 transitions.
Stuttering acceptance computed with spot in 423 ms :[(OR (NOT p1) (NOT p0) (AND p2 (NOT p3))), (OR (NOT p1) (NOT p0) (AND p2 (NOT p3))), (OR (NOT p1) (NOT p0) (AND p2 (NOT p3))), (NOT p0), (OR (NOT p1) (AND p2 (NOT p3))), (AND p2 (NOT p3)), true]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLFireability-09
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m06-LTLFireability-09 finished in 62077 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(p1)&&p0) U (!p2 U X((p3 U p4))))) U p5))'
Support contains 6 out of 229 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 457/457 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 205 transition count 353
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 205 transition count 353
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 51 place count 205 transition count 350
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 74 place count 182 transition count 325
Iterating global reduction 1 with 23 rules applied. Total rules applied 97 place count 182 transition count 325
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 105 place count 182 transition count 317
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 125 place count 162 transition count 282
Iterating global reduction 2 with 20 rules applied. Total rules applied 145 place count 162 transition count 282
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 155 place count 162 transition count 272
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 167 place count 150 transition count 254
Iterating global reduction 3 with 12 rules applied. Total rules applied 179 place count 150 transition count 254
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 183 place count 150 transition count 250
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 191 place count 142 transition count 241
Iterating global reduction 4 with 8 rules applied. Total rules applied 199 place count 142 transition count 241
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 200 place count 142 transition count 240
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 204 place count 138 transition count 236
Iterating global reduction 5 with 4 rules applied. Total rules applied 208 place count 138 transition count 236
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 217 place count 138 transition count 227
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 220 place count 135 transition count 209
Iterating global reduction 6 with 3 rules applied. Total rules applied 223 place count 135 transition count 209
Applied a total of 223 rules in 24 ms. Remains 135 /229 variables (removed 94) and now considering 209/457 (removed 248) transitions.
// Phase 1: matrix 209 rows 135 cols
[2025-05-30 13:30:01] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:30:02] [INFO ] Implicit Places using invariants in 253 ms returned []
[2025-05-30 13:30:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:30:02] [INFO ] State equation strengthened by 79 read => feed constraints.
[2025-05-30 13:30:03] [INFO ] Implicit Places using invariants and state equation in 1327 ms returned []
Implicit Place search using SMT with State Equation took 1596 ms to find 0 implicit places.
Running 208 sub problems to find dead transitions.
[2025-05-30 13:30:03] [INFO ] Invariant cache hit.
[2025-05-30 13:30:03] [INFO ] State equation strengthened by 79 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (OVERLAPS) 209/344 variables, 135/137 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/344 variables, 79/216 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/344 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (OVERLAPS) 0/344 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 344/344 variables, and 216 constraints, problems are : Problem set: 0 solved, 208 unsolved in 22334 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 135/135 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (OVERLAPS) 209/344 variables, 135/137 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/344 variables, 79/216 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/344 variables, 208/424 constraints. Problems are: Problem set: 0 solved, 208 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 344/344 variables, and 424 constraints, problems are : Problem set: 0 solved, 208 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 135/135 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 52614ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 52615ms
Starting structural reductions in LTL mode, iteration 1 : 135/229 places, 209/457 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54237 ms. Remains : 135/229 places, 209/457 transitions.
Stuttering acceptance computed with spot in 504 ms :[(NOT p5), (NOT p4), (NOT p4), (NOT p4), (NOT p4), (AND (NOT p1) (NOT p4)), true, (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLFireability-10
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m06-LTLFireability-10 finished in 54820 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 229 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 457/457 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 202 transition count 345
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 202 transition count 345
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 58 place count 202 transition count 341
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 82 place count 178 transition count 315
Iterating global reduction 1 with 24 rules applied. Total rules applied 106 place count 178 transition count 315
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 114 place count 178 transition count 307
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 135 place count 157 transition count 271
Iterating global reduction 2 with 21 rules applied. Total rules applied 156 place count 157 transition count 271
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 167 place count 157 transition count 260
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 179 place count 145 transition count 242
Iterating global reduction 3 with 12 rules applied. Total rules applied 191 place count 145 transition count 242
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 195 place count 145 transition count 238
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 203 place count 137 transition count 229
Iterating global reduction 4 with 8 rules applied. Total rules applied 211 place count 137 transition count 229
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 212 place count 137 transition count 228
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 216 place count 133 transition count 224
Iterating global reduction 5 with 4 rules applied. Total rules applied 220 place count 133 transition count 224
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 229 place count 133 transition count 215
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 234 place count 128 transition count 182
Iterating global reduction 6 with 5 rules applied. Total rules applied 239 place count 128 transition count 182
Applied a total of 239 rules in 23 ms. Remains 128 /229 variables (removed 101) and now considering 182/457 (removed 275) transitions.
// Phase 1: matrix 182 rows 128 cols
[2025-05-30 13:30:56] [INFO ] Computed 2 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:30:56] [INFO ] Implicit Places using invariants in 223 ms returned []
[2025-05-30 13:30:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:30:57] [INFO ] State equation strengthened by 61 read => feed constraints.
[2025-05-30 13:30:57] [INFO ] Implicit Places using invariants and state equation in 953 ms returned []
Implicit Place search using SMT with State Equation took 1181 ms to find 0 implicit places.
Running 181 sub problems to find dead transitions.
[2025-05-30 13:30:57] [INFO ] Invariant cache hit.
[2025-05-30 13:30:57] [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/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 182/310 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 61/191 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (OVERLAPS) 0/310 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 310/310 variables, and 191 constraints, problems are : Problem set: 0 solved, 181 unsolved in 15439 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 182/310 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 61/191 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 181/372 constraints. Problems are: Problem set: 0 solved, 181 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, 181 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45619ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 45620ms
Starting structural reductions in LTL mode, iteration 1 : 128/229 places, 182/457 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46825 ms. Remains : 128/229 places, 182/457 transitions.
Stuttering acceptance computed with spot in 131 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLFireability-12
Product exploration explored 100000 steps with 23027 reset in 393 ms.
Product exploration explored 100000 steps with 23124 reset in 408 ms.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 462 edges and 128 vertex of which 127 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (9181 resets) in 224 ms. (177 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1810 resets) in 55 ms. (714 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 42541 steps, run visited all 1 properties in 152 ms. (steps per millisecond=279 )
Probabilistic random walk after 42541 steps, saw 19880 distinct states, run finished after 153 ms. (steps per millisecond=278 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 3 factoid took 141 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-12 FALSE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d2m06-LTLFireability-12 finished in 48380 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 229 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 229/229 places, 457/457 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 202 transition count 351
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 202 transition count 351
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 58 place count 202 transition count 347
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 82 place count 178 transition count 321
Iterating global reduction 1 with 24 rules applied. Total rules applied 106 place count 178 transition count 321
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 114 place count 178 transition count 313
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 135 place count 157 transition count 277
Iterating global reduction 2 with 21 rules applied. Total rules applied 156 place count 157 transition count 277
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 168 place count 157 transition count 265
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 179 place count 146 transition count 249
Iterating global reduction 3 with 11 rules applied. Total rules applied 190 place count 146 transition count 249
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 194 place count 146 transition count 245
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 201 place count 139 transition count 237
Iterating global reduction 4 with 7 rules applied. Total rules applied 208 place count 139 transition count 237
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 209 place count 139 transition count 236
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 212 place count 136 transition count 233
Iterating global reduction 5 with 3 rules applied. Total rules applied 215 place count 136 transition count 233
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 222 place count 136 transition count 226
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 228 place count 130 transition count 186
Iterating global reduction 6 with 6 rules applied. Total rules applied 234 place count 130 transition count 186
Applied a total of 234 rules in 52 ms. Remains 130 /229 variables (removed 99) and now considering 186/457 (removed 271) transitions.
// Phase 1: matrix 186 rows 130 cols
[2025-05-30 13:31:45] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:31:45] [INFO ] Implicit Places using invariants in 724 ms returned []
[2025-05-30 13:31:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:31:46] [INFO ] State equation strengthened by 61 read => feed constraints.
[2025-05-30 13:31:46] [INFO ] Implicit Places using invariants and state equation in 728 ms returned []
Implicit Place search using SMT with State Equation took 1460 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 13:31:46] [INFO ] Redundant transitions in 2 ms returned []
Running 185 sub problems to find dead transitions.
[2025-05-30 13:31:46] [INFO ] Invariant cache hit.
[2025-05-30 13:31:46] [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, 185 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (OVERLAPS) 186/316 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 61/193 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 185 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:32:02] [INFO ] Deduced a trap composed of 12 places in 133 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:32:02] [INFO ] Deduced a trap composed of 53 places in 177 ms of which 26 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/316 variables, 2/195 constraints. Problems are: Problem set: 0 solved, 185 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:32:07] [INFO ] Deduced a trap composed of 12 places in 146 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:32:08] [INFO ] Deduced a trap composed of 56 places in 151 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:32:08] [INFO ] Deduced a trap composed of 57 places in 169 ms of which 26 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/316 variables, 3/198 constraints. Problems are: Problem set: 0 solved, 185 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:32:13] [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 13:32:14] [INFO ] Deduced a trap composed of 53 places in 163 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:32:14] [INFO ] Deduced a trap composed of 56 places in 134 ms of which 14 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/316 variables, 3/201 constraints. Problems are: Problem set: 0 solved, 185 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 316/316 variables, and 201 constraints, problems are : Problem set: 0 solved, 185 unsolved in 30010 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: 185/185 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 185 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (OVERLAPS) 1/130 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (OVERLAPS) 186/316 variables, 130/140 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 61/201 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/316 variables, 185/386 constraints. Problems are: Problem set: 0 solved, 185 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 316/316 variables, and 386 constraints, problems are : Problem set: 0 solved, 185 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: 185/185 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60193ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 60194ms
Starting structural reductions in SI_LTL mode, iteration 1 : 130/229 places, 186/457 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61720 ms. Remains : 130/229 places, 186/457 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLFireability-13
Product exploration explored 100000 steps with 22940 reset in 408 ms.
Product exploration explored 100000 steps with 23002 reset in 293 ms.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 470 edges and 130 vertex of which 129 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 102 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 82 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (9186 resets) in 171 ms. (232 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1777 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 22327 steps, run visited all 1 properties in 95 ms. (steps per millisecond=235 )
Probabilistic random walk after 22327 steps, saw 10963 distinct states, run finished after 96 ms. (steps per millisecond=232 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 105 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 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 186/186 transitions.
Applied a total of 0 rules in 8 ms. Remains 130 /130 variables (removed 0) and now considering 186/186 (removed 0) transitions.
[2025-05-30 13:32:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:32:48] [INFO ] Implicit Places using invariants in 215 ms returned []
[2025-05-30 13:32:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:32:48] [INFO ] State equation strengthened by 61 read => feed constraints.
[2025-05-30 13:32:49] [INFO ] Implicit Places using invariants and state equation in 666 ms returned []
Implicit Place search using SMT with State Equation took 892 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 13:32:49] [INFO ] Redundant transitions in 2 ms returned []
Running 185 sub problems to find dead transitions.
[2025-05-30 13:32:49] [INFO ] Invariant cache hit.
[2025-05-30 13:32:49] [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, 185 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (OVERLAPS) 186/316 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 61/193 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 185 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:33:04] [INFO ] Deduced a trap composed of 12 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 13:33:04] [INFO ] Deduced a trap composed of 53 places in 113 ms of which 16 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/316 variables, 2/195 constraints. Problems are: Problem set: 0 solved, 185 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:33:09] [INFO ] Deduced a trap composed of 12 places in 129 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:33:10] [INFO ] Deduced a trap composed of 56 places in 131 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:33:10] [INFO ] Deduced a trap composed of 57 places in 128 ms of which 22 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/316 variables, 3/198 constraints. Problems are: Problem set: 0 solved, 185 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:33:15] [INFO ] Deduced a trap composed of 53 places in 147 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:33:15] [INFO ] Deduced a trap composed of 53 places in 180 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:33:15] [INFO ] Deduced a trap composed of 56 places in 243 ms of which 15 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/316 variables, 3/201 constraints. Problems are: Problem set: 0 solved, 185 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 316/316 variables, and 201 constraints, problems are : Problem set: 0 solved, 185 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: 185/185 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 185 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (OVERLAPS) 1/130 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (OVERLAPS) 186/316 variables, 130/140 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 61/201 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/316 variables, 185/386 constraints. Problems are: Problem set: 0 solved, 185 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 316/316 variables, and 386 constraints, problems are : Problem set: 0 solved, 185 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: 185/185 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60219ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 60220ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61133 ms. Remains : 130/130 places, 186/186 transitions.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 470 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 103 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 85 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (9176 resets) in 144 ms. (275 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1737 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 22327 steps, run visited all 1 properties in 62 ms. (steps per millisecond=360 )
Probabilistic random walk after 22327 steps, saw 10963 distinct states, run finished after 62 ms. (steps per millisecond=360 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 118 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 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22944 reset in 355 ms.
Product exploration explored 100000 steps with 23043 reset in 354 ms.
Built C files in :
/tmp/ltsmin8917931081431094977
[2025-05-30 13:33:50] [INFO ] Computing symmetric may disable matrix : 186 transitions.
[2025-05-30 13:33:50] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 13:33:50] [INFO ] Computing symmetric may enable matrix : 186 transitions.
[2025-05-30 13:33:50] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 13:33:50] [INFO ] Computing Do-Not-Accords matrix : 186 transitions.
[2025-05-30 13:33:50] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 13:33:50] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8917931081431094977
Running compilation step : cd /tmp/ltsmin8917931081431094977;'/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 805 ms.
Running link step : cd /tmp/ltsmin8917931081431094977;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin8917931081431094977;'/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/stateBased927617102822635774.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, 186/186 transitions.
Applied a total of 0 rules in 11 ms. Remains 130 /130 variables (removed 0) and now considering 186/186 (removed 0) transitions.
[2025-05-30 13:34:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:34:06] [INFO ] Implicit Places using invariants in 168 ms returned []
[2025-05-30 13:34:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:34:06] [INFO ] State equation strengthened by 61 read => feed constraints.
[2025-05-30 13:34:06] [INFO ] Implicit Places using invariants and state equation in 511 ms returned []
Implicit Place search using SMT with State Equation took 685 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 13:34:06] [INFO ] Redundant transitions in 1 ms returned []
Running 185 sub problems to find dead transitions.
[2025-05-30 13:34:06] [INFO ] Invariant cache hit.
[2025-05-30 13:34:06] [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, 185 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (OVERLAPS) 186/316 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 61/193 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 185 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:34:23] [INFO ] Deduced a trap composed of 12 places in 117 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:34:23] [INFO ] Deduced a trap composed of 53 places in 98 ms of which 16 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/316 variables, 2/195 constraints. Problems are: Problem set: 0 solved, 185 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:34:27] [INFO ] Deduced a trap composed of 12 places in 102 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:34:28] [INFO ] Deduced a trap composed of 56 places in 111 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:34:28] [INFO ] Deduced a trap composed of 57 places in 139 ms of which 26 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/316 variables, 3/198 constraints. Problems are: Problem set: 0 solved, 185 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:34:33] [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 13:34:33] [INFO ] Deduced a trap composed of 53 places in 149 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:34:34] [INFO ] Deduced a trap composed of 56 places in 134 ms of which 10 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/316 variables, 3/201 constraints. Problems are: Problem set: 0 solved, 185 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 316/316 variables, and 201 constraints, problems are : Problem set: 0 solved, 185 unsolved in 30027 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: 185/185 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 185 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (OVERLAPS) 1/130 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (OVERLAPS) 186/316 variables, 130/140 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 61/201 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/316 variables, 185/386 constraints. Problems are: Problem set: 0 solved, 185 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 316/316 variables, and 386 constraints, problems are : Problem set: 0 solved, 185 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: 185/185 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60187ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 60188ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60895 ms. Remains : 130/130 places, 186/186 transitions.
Built C files in :
/tmp/ltsmin4799370801448402945
[2025-05-30 13:35:06] [INFO ] Computing symmetric may disable matrix : 186 transitions.
[2025-05-30 13:35:06] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 13:35:06] [INFO ] Computing symmetric may enable matrix : 186 transitions.
[2025-05-30 13:35:06] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 13:35:06] [INFO ] Computing Do-Not-Accords matrix : 186 transitions.
[2025-05-30 13:35:06] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 13:35:06] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4799370801448402945
Running compilation step : cd /tmp/ltsmin4799370801448402945;'/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 667 ms.
Running link step : cd /tmp/ltsmin4799370801448402945;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin4799370801448402945;'/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/stateBased15303798388114135302.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-30 13:35:22] [INFO ] Flatten gal took : 12 ms
[2025-05-30 13:35:22] [INFO ] Flatten gal took : 12 ms
[2025-05-30 13:35:22] [INFO ] Time to serialize gal into /tmp/LTL15667932114578759742.gal : 2 ms
[2025-05-30 13:35:22] [INFO ] Time to serialize properties into /tmp/LTL1686102247911311928.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/LTL15667932114578759742.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10186105671669864254.hoa' '-atoms' '/tmp/LTL1686102247911311928.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...319
Loading property file /tmp/LTL1686102247911311928.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10186105671669864254.hoa
Detected timeout of ITS tools.
[2025-05-30 13:35:37] [INFO ] Flatten gal took : 19 ms
[2025-05-30 13:35:37] [INFO ] Flatten gal took : 18 ms
[2025-05-30 13:35:37] [INFO ] Time to serialize gal into /tmp/LTL15810949782832845541.gal : 4 ms
[2025-05-30 13:35:37] [INFO ] Time to serialize properties into /tmp/LTL17638523909096639831.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/LTL15810949782832845541.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17638523909096639831.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F("((s1<1)||(l4281<1))"))))
Formula 0 simplified : FG!"((s1<1)||(l4281<1))"
Detected timeout of ITS tools.
[2025-05-30 13:35:52] [INFO ] Flatten gal took : 10 ms
[2025-05-30 13:35:52] [INFO ] Applying decomposition
[2025-05-30 13:35:52] [INFO ] Flatten gal took : 26 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/graph5370771914176813419.txt' '-o' '/tmp/graph5370771914176813419.bin' '-w' '/tmp/graph5370771914176813419.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5370771914176813419.bin' '-l' '-1' '-v' '-w' '/tmp/graph5370771914176813419.weights' '-q' '0' '-e' '0.001'
[2025-05-30 13:35:52] [INFO ] Decomposing Gal with order
[2025-05-30 13:35:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 13:35:52] [INFO ] Removed a total of 194 redundant transitions.
[2025-05-30 13:35:52] [INFO ] Flatten gal took : 43 ms
[2025-05-30 13:35:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 167 labels/synchronizations in 16 ms.
[2025-05-30 13:35:52] [INFO ] Time to serialize gal into /tmp/LTL7826576333572021308.gal : 5 ms
[2025-05-30 13:35:52] [INFO ] Time to serialize properties into /tmp/LTL9308726790980639596.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/LTL7826576333572021308.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9308726790980639596.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 : !((G(F("((i1.i0.u0.s1<1)||(i6.u19.l4281<1))"))))
Formula 0 simplified : FG!"((i1.i0.u0.s1<1)||(i6.u19.l4281<1))"
Detected timeout of ITS tools.
Treatment of property DBSingleClientW-PT-d2m06-LTLFireability-13 finished in 262423 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((X(p1)&&p0)) U p2)))'
Support contains 4 out of 229 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 457/457 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 203 transition count 352
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 203 transition count 352
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 53 place count 203 transition count 351
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 77 place count 179 transition count 325
Iterating global reduction 1 with 24 rules applied. Total rules applied 101 place count 179 transition count 325
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 109 place count 179 transition count 317
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 130 place count 158 transition count 282
Iterating global reduction 2 with 21 rules applied. Total rules applied 151 place count 158 transition count 282
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 163 place count 158 transition count 270
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 174 place count 147 transition count 253
Iterating global reduction 3 with 11 rules applied. Total rules applied 185 place count 147 transition count 253
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 193 place count 147 transition count 245
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 200 place count 140 transition count 237
Iterating global reduction 4 with 7 rules applied. Total rules applied 207 place count 140 transition count 237
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 211 place count 136 transition count 233
Iterating global reduction 4 with 4 rules applied. Total rules applied 215 place count 136 transition count 233
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 224 place count 136 transition count 224
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 227 place count 133 transition count 204
Iterating global reduction 5 with 3 rules applied. Total rules applied 230 place count 133 transition count 204
Applied a total of 230 rules in 36 ms. Remains 133 /229 variables (removed 96) and now considering 204/457 (removed 253) transitions.
// Phase 1: matrix 204 rows 133 cols
[2025-05-30 13:36:07] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:36:07] [INFO ] Implicit Places using invariants in 159 ms returned []
[2025-05-30 13:36:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:36:07] [INFO ] State equation strengthened by 79 read => feed constraints.
[2025-05-30 13:36:08] [INFO ] Implicit Places using invariants and state equation in 656 ms returned []
Implicit Place search using SMT with State Equation took 817 ms to find 0 implicit places.
Running 203 sub problems to find dead transitions.
[2025-05-30 13:36:08] [INFO ] Invariant cache hit.
[2025-05-30 13:36:08] [INFO ] State equation strengthened by 79 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 204/337 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/337 variables, 79/214 constraints. Problems are: Problem set: 0 solved, 203 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:36:18] [INFO ] Deduced a trap composed of 12 places in 191 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:36:18] [INFO ] Deduced a trap composed of 12 places in 175 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:36:19] [INFO ] Deduced a trap composed of 13 places in 145 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:36:20] [INFO ] Deduced a trap composed of 57 places in 101 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 4/218 constraints. Problems are: Problem set: 0 solved, 203 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:36:26] [INFO ] Deduced a trap composed of 53 places in 159 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:36:27] [INFO ] Deduced a trap composed of 54 places in 88 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:36:27] [INFO ] Deduced a trap composed of 54 places in 89 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/337 variables, 3/221 constraints. Problems are: Problem set: 0 solved, 203 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:36:33] [INFO ] Deduced a trap composed of 55 places in 203 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:36:33] [INFO ] Deduced a trap composed of 56 places in 180 ms of which 29 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/337 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 203 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:36:37] [INFO ] Deduced a trap composed of 12 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 13:36:38] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:36:38] [INFO ] Deduced a trap composed of 56 places in 90 ms of which 8 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 337/337 variables, and 226 constraints, problems are : Problem set: 0 solved, 203 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 203 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (OVERLAPS) 1/133 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (OVERLAPS) 204/337 variables, 133/147 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/337 variables, 79/226 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/337 variables, 203/429 constraints. Problems are: Problem set: 0 solved, 203 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 337/337 variables, and 429 constraints, problems are : Problem set: 0 solved, 203 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60278ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 60280ms
Starting structural reductions in LTL mode, iteration 1 : 133/229 places, 204/457 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61134 ms. Remains : 133/229 places, 204/457 transitions.
Stuttering acceptance computed with spot in 243 ms :[(NOT p2), (NOT p2), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLFireability-14
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m06-LTLFireability-14 finished in 61402 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 229 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 229/229 places, 457/457 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 202 transition count 345
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 202 transition count 345
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 58 place count 202 transition count 341
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 82 place count 178 transition count 315
Iterating global reduction 1 with 24 rules applied. Total rules applied 106 place count 178 transition count 315
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 114 place count 178 transition count 307
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 135 place count 157 transition count 271
Iterating global reduction 2 with 21 rules applied. Total rules applied 156 place count 157 transition count 271
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 167 place count 157 transition count 260
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 179 place count 145 transition count 242
Iterating global reduction 3 with 12 rules applied. Total rules applied 191 place count 145 transition count 242
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 195 place count 145 transition count 238
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 203 place count 137 transition count 229
Iterating global reduction 4 with 8 rules applied. Total rules applied 211 place count 137 transition count 229
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 212 place count 137 transition count 228
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 216 place count 133 transition count 224
Iterating global reduction 5 with 4 rules applied. Total rules applied 220 place count 133 transition count 224
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 229 place count 133 transition count 215
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 234 place count 128 transition count 183
Iterating global reduction 6 with 5 rules applied. Total rules applied 239 place count 128 transition count 183
Applied a total of 239 rules in 38 ms. Remains 128 /229 variables (removed 101) and now considering 183/457 (removed 274) transitions.
// Phase 1: matrix 183 rows 128 cols
[2025-05-30 13:37:08] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:37:09] [INFO ] Implicit Places using invariants in 193 ms returned []
[2025-05-30 13:37:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:37:09] [INFO ] State equation strengthened by 62 read => feed constraints.
[2025-05-30 13:37:09] [INFO ] Implicit Places using invariants and state equation in 778 ms returned []
Implicit Place search using SMT with State Equation took 975 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 13:37:09] [INFO ] Redundant transitions in 1 ms returned []
Running 182 sub problems to find dead transitions.
[2025-05-30 13:37:09] [INFO ] Invariant cache hit.
[2025-05-30 13:37:09] [INFO ] State equation strengthened by 62 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (OVERLAPS) 183/311 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 62/192 constraints. Problems are: Problem set: 0 solved, 182 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (OVERLAPS) 0/311 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Real declared 311/311 variables, and 192 constraints, problems are : Problem set: 0 solved, 182 unsolved in 17011 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 182 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (OVERLAPS) 183/311 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 62/192 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 182/374 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 311/311 variables, and 374 constraints, problems are : Problem set: 0 solved, 182 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47188ms problems are : Problem set: 0 solved, 182 unsolved
Search for dead transitions found 0 dead transitions in 47189ms
Starting structural reductions in SI_LTL mode, iteration 1 : 128/229 places, 183/457 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 48212 ms. Remains : 128/229 places, 183/457 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLFireability-15
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m06-LTLFireability-15 finished in 48280 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(((!p1 U (p2||G(!p1)))||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' '!(G(F(p0)))'
[2025-05-30 13:37:57] [INFO ] Flatten gal took : 33 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin604278615892564025
[2025-05-30 13:37:57] [INFO ] Computing symmetric may disable matrix : 457 transitions.
[2025-05-30 13:37:57] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 13:37:57] [INFO ] Applying decomposition
[2025-05-30 13:37:57] [INFO ] Computing symmetric may enable matrix : 457 transitions.
[2025-05-30 13:37:57] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 13:37:57] [INFO ] Flatten gal took : 32 ms
[2025-05-30 13:37:57] [INFO ] Computing Do-Not-Accords matrix : 457 transitions.
[2025-05-30 13:37:57] [INFO ] Computation of Completed DNA matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph14765180191172896370.txt' '-o' '/tmp/graph14765180191172896370.bin' '-w' '/tmp/graph14765180191172896370.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14765180191172896370.bin' '-l' '-1' '-v' '-w' '/tmp/graph14765180191172896370.weights' '-q' '0' '-e' '0.001'
[2025-05-30 13:37:57] [INFO ] Decomposing Gal with order
[2025-05-30 13:37:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 13:37:57] [INFO ] Built C files in 133ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin604278615892564025
Running compilation step : cd /tmp/ltsmin604278615892564025;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '360' '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 13:37:57] [INFO ] Removed a total of 356 redundant transitions.
[2025-05-30 13:37:58] [INFO ] Flatten gal took : 148 ms
[2025-05-30 13:37:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 387 labels/synchronizations in 31 ms.
[2025-05-30 13:37:58] [INFO ] Time to serialize gal into /tmp/LTLFireability11476922665025459352.gal : 9 ms
[2025-05-30 13:37:58] [INFO ] Time to serialize properties into /tmp/LTLFireability3074470455635430899.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/LTLFireability11476922665025459352.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3074470455635430899.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !((G(F(("((u0.s1<1)||(u0.l2799<1))")||((!("((u0.s1>=1)&&(u0.l4272>=1))"))U(("((!((u0.s1>=1)&&(u0.l2799>=1)))&&(!((u0.s1>=1)&&(u0.l4272...209
Formula 0 simplified : FG(!"((u0.s1<1)||(u0.l2799<1))" & ("((u0.s1>=1)&&(u0.l4272>=1))" M !"((!((u0.s1>=1)&&(u0.l2799>=1)))&&(!((u0.s1>=1)&&(u0.l4272>=1)))...159
Compilation finished in 2158 ms.
Running link step : cd /tmp/ltsmin604278615892564025;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin604278615892564025;'/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' '[](<>(((!(LTLAPp1==true) U ((LTLAPp2==true)||[](!(LTLAPp1==true))))||(LTLAPp0==true))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t0, t14, t18, t53, t64, t72, t75, t82, t85, t175, t204, t206, t207, t209, t211, t220, t224, t...1288
Computing Next relation with stutter on 3.6528e+07 deadlock states
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin604278615892564025;'/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' '[](<>(((!(LTLAPp1==true) U ((LTLAPp2==true)||[](!(LTLAPp1==true))))||(LTLAPp0==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin604278615892564025;'/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' '[](<>((LTLAPp3==true)))' '--buchi-type=spotba'
24 unique states visited
0 strongly connected components in search stack
46 transitions explored
24 items max in DFS search stack
51356 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,513.652,3167372,1,0,453550,6.91175e+06,1817,1.36092e+06,1808,3.32963e+07,1393192
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(F("((u0.s1<1)||(u0.l4281<1))"))))
Formula 1 simplified : FG!"((u0.s1<1)||(u0.l4281<1))"
Computing Next relation with stutter on 3.6528e+07 deadlock states
24 unique states visited
0 strongly connected components in search stack
46 transitions explored
24 items max in DFS search stack
2287 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,536.536,3423128,1,0,526785,7.61829e+06,2132,1.52271e+06,2094,3.54964e+07,1696836
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 2515066 ms.

BK_STOP 1748613568742

--------------------
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-d2m06"
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-d2m06, 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-174854063600132"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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