Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r072-tall-174860067500484.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 DoubleExponent-PT-004, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r072-tall-174860067500484
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K 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 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 67K 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 DoubleExponent-PT-004-LTLFireability-00
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-01
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-02
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-03
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-04
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-05
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-06
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-07
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-08
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-09
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-10
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-11
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-12
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-13
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-14
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748730611169

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-004
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-31 22:30:12] [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-31 22:30:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 22:30:12] [INFO ] Load time of PNML (sax parser for PT used): 62 ms
[2025-05-31 22:30:12] [INFO ] Transformed 216 places.
[2025-05-31 22:30:12] [INFO ] Transformed 198 transitions.
[2025-05-31 22:30:12] [INFO ] Parsed PT model containing 216 places and 198 transitions and 558 arcs in 147 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Support contains 50 out of 216 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 198/198 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 212 transition count 198
Applied a total of 4 rules in 36 ms. Remains 212 /216 variables (removed 4) and now considering 198/198 (removed 0) transitions.
// Phase 1: matrix 198 rows 212 cols
[2025-05-31 22:30:12] [INFO ] Computed 21 invariants in 22 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:30:12] [INFO ] Implicit Places using invariants in 267 ms returned [86]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 305 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 211/216 places, 198/198 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 210 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 210 transition count 197
Applied a total of 2 rules in 22 ms. Remains 210 /211 variables (removed 1) and now considering 197/198 (removed 1) transitions.
// Phase 1: matrix 197 rows 210 cols
[2025-05-31 22:30:13] [INFO ] Computed 20 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:30:13] [INFO ] Implicit Places using invariants in 89 ms returned []
[2025-05-31 22:30:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:30:13] [INFO ] Implicit Places using invariants and state equation in 407 ms returned []
Implicit Place search using SMT with State Equation took 498 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 210/216 places, 197/198 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 878 ms. Remains : 210/216 places, 197/198 transitions.
Support contains 50 out of 210 places after structural reductions.
[2025-05-31 22:30:13] [INFO ] Flatten gal took : 43 ms
[2025-05-31 22:30:13] [INFO ] Flatten gal took : 16 ms
[2025-05-31 22:30:13] [INFO ] Input system was already deterministic with 197 transitions.
Support contains 49 out of 210 places (down from 50) after GAL structural reductions.
RANDOM walk for 40000 steps (1331 resets) in 1878 ms. (21 steps per ms) remains 22/36 properties
BEST_FIRST walk for 4000 steps (113 resets) in 99 ms. (40 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (110 resets) in 43 ms. (90 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (109 resets) in 62 ms. (63 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (113 resets) in 141 ms. (28 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (113 resets) in 39 ms. (100 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (110 resets) in 29 ms. (133 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (107 resets) in 47 ms. (83 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (112 resets) in 32 ms. (121 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (108 resets) in 23 ms. (166 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (117 resets) in 23 ms. (166 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (112 resets) in 51 ms. (76 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (114 resets) in 27 ms. (142 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (106 resets) in 27 ms. (142 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (110 resets) in 25 ms. (153 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (117 resets) in 26 ms. (148 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (111 resets) in 38 ms. (102 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (107 resets) in 28 ms. (138 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (114 resets) in 24 ms. (160 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (120 resets) in 27 ms. (142 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (115 resets) in 29 ms. (133 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (108 resets) in 31 ms. (125 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (116 resets) in 57 ms. (68 steps per ms) remains 22/22 properties
[2025-05-31 22:30:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 9/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 7/49 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 124/173 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 9/182 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (OVERLAPS) 187/369 variables, 182/202 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/369 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (OVERLAPS) 35/404 variables, 26/228 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:30:16] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:30:16] [INFO ] Deduced a trap composed of 49 places in 45 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/404 variables, 2/230 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/404 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp28 is UNSAT
At refinement iteration 14 (OVERLAPS) 3/407 variables, 2/232 constraints. Problems are: Problem set: 4 solved, 18 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:30:17] [INFO ] Deduced a trap composed of 47 places in 61 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:30:17] [INFO ] Deduced a trap composed of 43 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:30:17] [INFO ] Deduced a trap composed of 49 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:30:17] [INFO ] Deduced a trap composed of 55 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:30:17] [INFO ] Deduced a trap composed of 55 places in 53 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/407 variables, 5/237 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/407 variables, 0/237 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 17 (OVERLAPS) 0/407 variables, 0/237 constraints. Problems are: Problem set: 4 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 407/407 variables, and 237 constraints, problems are : Problem set: 4 solved, 18 unsolved in 4234 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 210/210 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 18 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 133/159 variables, 13/13 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 0/13 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 6/165 variables, 2/15 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/15 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 16/181 variables, 5/20 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 0/20 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 187/368 variables, 181/201 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/368 variables, 7/208 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/368 variables, 0/208 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 10 (OVERLAPS) 36/404 variables, 27/235 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/404 variables, 11/246 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/404 variables, 6/252 constraints. Problems are: Problem set: 4 solved, 18 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:30:19] [INFO ] Deduced a trap along path composed of 6 places in 52 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:30:19] [INFO ] Deduced a trap along path composed of 16 places in 57 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:30:19] [INFO ] Deduced a trap along path composed of 12 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:30:20] [INFO ] Deduced a trap along path composed of 17 places in 24 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/404 variables, 4/256 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/404 variables, 0/256 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 15 (OVERLAPS) 3/407 variables, 2/258 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/407 variables, 1/259 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/407 variables, 0/259 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 18 (OVERLAPS) 0/407 variables, 0/259 constraints. Problems are: Problem set: 4 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 407/407 variables, and 259 constraints, problems are : Problem set: 4 solved, 18 unsolved in 4775 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 210/210 constraints, PredecessorRefiner: 18/22 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 9052ms problems are : Problem set: 4 solved, 18 unsolved
Fused 18 Parikh solutions to 17 different solutions.
Parikh walk visited 0 properties in 6772 ms.
Support contains 26 out of 210 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 197/197 transitions.
Graph (complete) has 352 edges and 210 vertex of which 208 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 208 transition count 164
Reduce places removed 31 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 34 rules applied. Total rules applied 67 place count 177 transition count 161
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 70 place count 174 transition count 161
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 70 place count 174 transition count 153
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 86 place count 166 transition count 153
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 148 place count 135 transition count 122
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 156 place count 131 transition count 122
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 164 place count 131 transition count 114
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 172 place count 123 transition count 114
Partial Free-agglomeration rule applied 16 times.
Drop transitions (Partial Free agglomeration) removed 16 transitions
Iterating global reduction 4 with 16 rules applied. Total rules applied 188 place count 123 transition count 114
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 189 place count 122 transition count 113
Applied a total of 189 rules in 53 ms. Remains 122 /210 variables (removed 88) and now considering 113/197 (removed 84) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 122/210 places, 113/197 transitions.
RANDOM walk for 40000 steps (4506 resets) in 660 ms. (60 steps per ms) remains 17/18 properties
BEST_FIRST walk for 4002 steps (332 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (308 resets) in 26 ms. (148 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (295 resets) in 29 ms. (133 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (320 resets) in 36 ms. (108 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (320 resets) in 30 ms. (129 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (309 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (316 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4000 steps (292 resets) in 23 ms. (166 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (303 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (330 resets) in 22 ms. (173 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (307 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (306 resets) in 13 ms. (285 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (312 resets) in 13 ms. (285 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (288 resets) in 13 ms. (285 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4000 steps (322 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (297 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (310 resets) in 13 ms. (285 steps per ms) remains 17/17 properties
Interrupted probabilistic random walk after 478909 steps, run timeout after 3001 ms. (steps per millisecond=159 ) properties seen :16 out of 17
Probabilistic random walk after 478909 steps, saw 240146 distinct states, run finished after 3006 ms. (steps per millisecond=159 ) properties seen :16
// Phase 1: matrix 113 rows 122 cols
[2025-05-31 22:30:34] [INFO ] Computed 20 invariants in 4 ms
[2025-05-31 22:30:34] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 53/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 59/114 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:30:34] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:30:34] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:30:34] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:30:34] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:30:34] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:30:34] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:30:34] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:30:34] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:30:34] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:30:34] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 10/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 4/118 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 113/231 variables, 118/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/231 variables, 10/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/231 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/235 variables, 4/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/235 variables, 2/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/235 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/235 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 235/235 variables, and 162 constraints, problems are : Problem set: 0 solved, 1 unsolved in 644 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 122/122 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 53/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 59/114 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 10/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:30:34] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:30:34] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:30:34] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:30:34] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:30:34] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 5/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/118 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:30:34] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/118 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/118 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 113/231 variables, 118/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/231 variables, 10/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/231 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/231 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 4/235 variables, 4/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/235 variables, 2/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/235 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/235 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 235/235 variables, and 169 constraints, problems are : Problem set: 0 solved, 1 unsolved in 406 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 122/122 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1071ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 33 ms.
Support contains 2 out of 122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 113/113 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 122 transition count 108
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 117 transition count 108
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 10 place count 117 transition count 103
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 20 place count 112 transition count 103
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 32 place count 106 transition count 97
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 40 place count 102 transition count 97
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 2 with 9 rules applied. Total rules applied 49 place count 102 transition count 88
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 58 place count 93 transition count 88
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 62 place count 93 transition count 88
Applied a total of 62 rules in 23 ms. Remains 93 /122 variables (removed 29) and now considering 88/113 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 93/122 places, 88/113 transitions.
RANDOM walk for 40000 steps (5488 resets) in 81 ms. (487 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3518 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1059069 steps, run timeout after 3001 ms. (steps per millisecond=352 ) properties seen :0 out of 1
Probabilistic random walk after 1059069 steps, saw 530269 distinct states, run finished after 3001 ms. (steps per millisecond=352 ) properties seen :0
// Phase 1: matrix 88 rows 93 cols
[2025-05-31 22:30:38] [INFO ] Computed 20 invariants in 3 ms
[2025-05-31 22:30:38] [INFO ] State equation strengthened by 18 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 42/44 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:30:38] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 43/87 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:30:38] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:30:38] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:30:38] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:30:38] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:30:38] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:30:38] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:30:38] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:30:38] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:30:38] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:30:38] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 21 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 10/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/89 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/89 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 88/177 variables, 89/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/177 variables, 18/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/177 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 4/181 variables, 4/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/181 variables, 2/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/181 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/181 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 181/181 variables, and 142 constraints, problems are : Problem set: 0 solved, 1 unsolved in 672 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 93/93 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 42/44 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 43/87 variables, 13/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:30:38] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:30:39] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:30:39] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:30:39] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:30:39] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 5/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/87 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/89 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/89 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 88/177 variables, 89/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/177 variables, 18/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/177 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/177 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 4/181 variables, 4/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/181 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/181 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/181 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 181/181 variables, and 148 constraints, problems are : Problem set: 0 solved, 1 unsolved in 441 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 93/93 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1126ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 30 ms.
Support contains 2 out of 93 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 88/88 transitions.
Applied a total of 0 rules in 3 ms. Remains 93 /93 variables (removed 0) and now considering 88/88 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 93/93 places, 88/88 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 88/88 transitions.
Applied a total of 0 rules in 3 ms. Remains 93 /93 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2025-05-31 22:30:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:30:39] [INFO ] Implicit Places using invariants in 130 ms returned [22, 28, 42, 47, 61, 66, 84, 90]
[2025-05-31 22:30:39] [INFO ] Actually due to overlaps returned [66, 61, 42]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 140 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 90/93 places, 88/88 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 89 transition count 87
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 89 transition count 86
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 88 transition count 86
Applied a total of 4 rules in 14 ms. Remains 88 /90 variables (removed 2) and now considering 86/88 (removed 2) transitions.
// Phase 1: matrix 86 rows 88 cols
[2025-05-31 22:30:39] [INFO ] Computed 17 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:30:39] [INFO ] Implicit Places using invariants in 176 ms returned [22, 28, 79, 85]
[2025-05-31 22:30:39] [INFO ] Actually due to overlaps returned [85, 79]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 177 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 86/93 places, 86/88 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 86 transition count 85
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 85 transition count 85
Applied a total of 2 rules in 6 ms. Remains 85 /86 variables (removed 1) and now considering 85/86 (removed 1) transitions.
// Phase 1: matrix 85 rows 85 cols
[2025-05-31 22:30:39] [INFO ] Computed 15 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:30:39] [INFO ] Implicit Places using invariants in 116 ms returned [22, 28]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 121 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 83/93 places, 85/88 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 83 transition count 84
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 82 transition count 84
Applied a total of 2 rules in 7 ms. Remains 82 /83 variables (removed 1) and now considering 84/85 (removed 1) transitions.
// Phase 1: matrix 84 rows 82 cols
[2025-05-31 22:30:39] [INFO ] Computed 13 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:30:39] [INFO ] Implicit Places using invariants in 147 ms returned []
[2025-05-31 22:30:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:30:40] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-05-31 22:30:40] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 82/93 places, 84/88 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 841 ms. Remains : 82/93 places, 84/88 transitions.
RANDOM walk for 40000 steps (6294 resets) in 55 ms. (714 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3811 resets) in 76 ms. (519 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1204194 steps, run timeout after 3001 ms. (steps per millisecond=401 ) properties seen :0 out of 1
Probabilistic random walk after 1204194 steps, saw 602369 distinct states, run finished after 3001 ms. (steps per millisecond=401 ) properties seen :0
[2025-05-31 22:30:43] [INFO ] Invariant cache hit.
[2025-05-31 22:30:43] [INFO ] State equation strengthened by 18 read => feed constraints.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/59 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:30:43] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 18/77 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 84/161 variables, 77/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 18/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 5/166 variables, 5/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/166 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/166 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/166 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 166/166 variables, and 114 constraints, problems are : Problem set: 0 solved, 1 unsolved in 156 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 82/82 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/59 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 18/77 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 84/161 variables, 77/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 18/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:30:43] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/161 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/166 variables, 5/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/166 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/166 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/166 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 166/166 variables, and 116 constraints, problems are : Problem set: 0 solved, 1 unsolved in 154 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 82/82 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 318ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 23 ms.
Support contains 2 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 84/84 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 82/82 places, 84/84 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 84/84 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2025-05-31 22:30:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:30:43] [INFO ] Implicit Places using invariants in 73 ms returned []
[2025-05-31 22:30:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:30:43] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-05-31 22:30:43] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 22:30:43] [INFO ] Redundant transitions in 1 ms returned []
Running 83 sub problems to find dead transitions.
[2025-05-31 22:30:43] [INFO ] Invariant cache hit.
[2025-05-31 22:30:43] [INFO ] State equation strengthened by 18 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (OVERLAPS) 1/82 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 83 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:30:44] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:30:44] [INFO ] Deduced a trap composed of 39 places in 43 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:30:44] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:30:44] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 83 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:30:44] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:30:45] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (OVERLAPS) 84/166 variables, 82/101 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/166 variables, 18/119 constraints. Problems are: Problem set: 0 solved, 83 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/166 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 10 (OVERLAPS) 0/166 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Real declared 166/166 variables, and 119 constraints, problems are : Problem set: 0 solved, 83 unsolved in 2456 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 82/82 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 83 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (OVERLAPS) 1/82 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 83 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:30:46] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:30:46] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:30:46] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:30:46] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:30:46] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:30:46] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:30:46] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:30:46] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:30:47] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:30:47] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:30:47] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:30:47] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:30:47] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:30:47] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:30:47] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:30:47] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:30:47] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:30:47] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 18/37 constraints. Problems are: Problem set: 0 solved, 83 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:30:47] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 83 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:30:47] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:30:47] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/82 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 9 (OVERLAPS) 84/166 variables, 82/122 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/166 variables, 18/140 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/166 variables, 83/223 constraints. Problems are: Problem set: 0 solved, 83 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:30:48] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:30:49] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:30:49] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:30:49] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:30:49] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:30:49] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 5 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/166 variables, 6/229 constraints. Problems are: Problem set: 0 solved, 83 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:30:50] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:30:50] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 8 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/166 variables, 2/231 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/166 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 15 (OVERLAPS) 0/166 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Int declared 166/166 variables, and 231 constraints, problems are : Problem set: 0 solved, 83 unsolved in 7453 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 82/82 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9936ms problems are : Problem set: 0 solved, 83 unsolved
Search for dead transitions found 0 dead transitions in 9938ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10190 ms. Remains : 82/82 places, 84/84 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 82 transition count 79
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 77 transition count 79
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 74 transition count 76
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 74 transition count 76
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 73 transition count 75
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 73 transition count 73
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 71 transition count 73
Applied a total of 22 rules in 11 ms. Remains 71 /82 variables (removed 11) and now considering 73/84 (removed 11) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 73 rows 71 cols
[2025-05-31 22:30:53] [INFO ] Computed 13 invariants in 2 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 22:30:53] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2025-05-31 22:30:53] [INFO ] [Real]Absence check using 7 positive and 6 generalized place invariants in 1 ms returned sat
[2025-05-31 22:30:53] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 22:30:53] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2025-05-31 22:30:53] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 1 ms returned sat
[2025-05-31 22:30:53] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-05-31 22:30:53] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-31 22:30:53] [INFO ] After 4ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:30:53] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 2 ms to minimize.
[2025-05-31 22:30:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
TRAPS : Iteration 1
[2025-05-31 22:30:53] [INFO ] After 57ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 22:30:53] [INFO ] After 116ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 199 ms.
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
FORMULA DoubleExponent-PT-004-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-004-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 352 edges and 210 vertex of which 208 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
FORMULA DoubleExponent-PT-004-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((p0||X(p0)))&&(p1||X(G(p2))))))'
Support contains 5 out of 210 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 210/210 places, 197/197 transitions.
Applied a total of 0 rules in 5 ms. Remains 210 /210 variables (removed 0) and now considering 197/197 (removed 0) transitions.
// Phase 1: matrix 197 rows 210 cols
[2025-05-31 22:30:54] [INFO ] Computed 20 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:30:54] [INFO ] Implicit Places using invariants in 97 ms returned [84]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 98 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 209/210 places, 197/197 transitions.
Applied a total of 0 rules in 5 ms. Remains 209 /209 variables (removed 0) and now considering 197/197 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 108 ms. Remains : 209/210 places, 197/197 transitions.
Stuttering acceptance computed with spot in 348 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), (NOT p0), true]
Running random walk in product with property : DoubleExponent-PT-004-LTLFireability-00
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-004-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-004-LTLFireability-00 finished in 508 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) U (X(G(p0))||(G(!p1)&&X((p0&&G(p2)))))))'
Support contains 4 out of 210 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 210/210 places, 197/197 transitions.
Applied a total of 0 rules in 6 ms. Remains 210 /210 variables (removed 0) and now considering 197/197 (removed 0) transitions.
[2025-05-31 22:30:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:30:55] [INFO ] Implicit Places using invariants in 93 ms returned []
[2025-05-31 22:30:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:30:55] [INFO ] Implicit Places using invariants and state equation in 504 ms returned []
Implicit Place search using SMT with State Equation took 608 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2025-05-31 22:30:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/209 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/210 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:30:58] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:30:59] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 197/407 variables, 210/232 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:31:03] [INFO ] Deduced a trap composed of 49 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:31:03] [INFO ] Deduced a trap composed of 55 places in 43 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:31:03] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:31:03] [INFO ] Deduced a trap composed of 43 places in 47 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:31:03] [INFO ] Deduced a trap composed of 55 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:31:04] [INFO ] Deduced a trap composed of 47 places in 54 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:31:04] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/407 variables, 7/239 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:31:06] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:31:07] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/407 variables, 2/241 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:31:08] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:31:09] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/407 variables, 2/243 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/407 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 11 (OVERLAPS) 0/407 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 407/407 variables, and 243 constraints, problems are : Problem set: 0 solved, 196 unsolved in 25273 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 210/210 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/209 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/210 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 13/33 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 197/407 variables, 210/243 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/407 variables, 196/439 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:31:31] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:31:32] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/407 variables, 2/441 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:31:42] [INFO ] Deduced a trap composed of 48 places in 64 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:31:43] [INFO ] Deduced a trap composed of 36 places in 63 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/407 variables, 2/443 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 407/407 variables, and 443 constraints, problems are : Problem set: 0 solved, 196 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 210/210 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55316ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 55319ms
Finished structural reductions in LTL mode , in 1 iterations and 55935 ms. Remains : 210/210 places, 197/197 transitions.
Stuttering acceptance computed with spot in 204 ms :[true, (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (NOT p2) p1), (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-004-LTLFireability-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-004-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-004-LTLFireability-01 finished in 56168 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 210 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 210/210 places, 197/197 transitions.
Graph (complete) has 352 edges and 210 vertex of which 209 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 208 transition count 147
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 97 place count 160 transition count 147
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 97 place count 160 transition count 139
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 113 place count 152 transition count 139
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 189 place count 114 transition count 101
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 201 place count 108 transition count 101
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 202 place count 108 transition count 101
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 203 place count 107 transition count 100
Applied a total of 203 rules in 28 ms. Remains 107 /210 variables (removed 103) and now considering 100/197 (removed 97) transitions.
// Phase 1: matrix 100 rows 107 cols
[2025-05-31 22:31:51] [INFO ] Computed 20 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:31:51] [INFO ] Implicit Places using invariants in 63 ms returned [46]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 64 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 106/210 places, 100/197 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 104 transition count 98
Applied a total of 4 rules in 6 ms. Remains 104 /106 variables (removed 2) and now considering 98/100 (removed 2) transitions.
// Phase 1: matrix 98 rows 104 cols
[2025-05-31 22:31:51] [INFO ] Computed 19 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:31:51] [INFO ] Implicit Places using invariants in 97 ms returned []
[2025-05-31 22:31:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:31:51] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-05-31 22:31:51] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 104/210 places, 98/197 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 395 ms. Remains : 104/210 places, 98/197 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-004-LTLFireability-02
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-004-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-004-LTLFireability-02 finished in 440 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(p0)||(F(p1)&&(p2||X(F(p3)))))) U X(p4)))'
Support contains 6 out of 210 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 210/210 places, 197/197 transitions.
Applied a total of 0 rules in 4 ms. Remains 210 /210 variables (removed 0) and now considering 197/197 (removed 0) transitions.
// Phase 1: matrix 197 rows 210 cols
[2025-05-31 22:31:51] [INFO ] Computed 20 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:31:51] [INFO ] Implicit Places using invariants in 98 ms returned [84]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 109 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 209/210 places, 197/197 transitions.
Applied a total of 0 rules in 3 ms. Remains 209 /209 variables (removed 0) and now considering 197/197 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 116 ms. Remains : 209/210 places, 197/197 transitions.
Stuttering acceptance computed with spot in 285 ms :[(NOT p4), (AND (NOT p1) (NOT p0) (NOT p4)), (OR (AND (NOT p0) (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p1) (NOT p3) (NOT p4))), (NOT p4), (AND (NOT p1) (NOT p0)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p0) (NOT p3))]
Running random walk in product with property : DoubleExponent-PT-004-LTLFireability-03
Stuttering criterion allowed to conclude after 24 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-004-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-004-LTLFireability-03 finished in 434 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)))'
Support contains 3 out of 210 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 210/210 places, 197/197 transitions.
Applied a total of 0 rules in 5 ms. Remains 210 /210 variables (removed 0) and now considering 197/197 (removed 0) transitions.
[2025-05-31 22:31:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:31:52] [INFO ] Implicit Places using invariants in 82 ms returned []
[2025-05-31 22:31:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:31:52] [INFO ] Implicit Places using invariants and state equation in 496 ms returned []
Implicit Place search using SMT with State Equation took 580 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2025-05-31 22:31:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/209 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/210 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:31:55] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:31:55] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 197/407 variables, 210/232 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:31:59] [INFO ] Deduced a trap composed of 49 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:32:00] [INFO ] Deduced a trap composed of 55 places in 42 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:32:00] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:32:00] [INFO ] Deduced a trap composed of 43 places in 47 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:32:00] [INFO ] Deduced a trap composed of 55 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:32:00] [INFO ] Deduced a trap composed of 47 places in 54 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:32:00] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/407 variables, 7/239 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:32:03] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:32:03] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/407 variables, 2/241 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:32:05] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:32:05] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/407 variables, 2/243 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/407 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 11 (OVERLAPS) 0/407 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 407/407 variables, and 243 constraints, problems are : Problem set: 0 solved, 196 unsolved in 25109 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 210/210 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/209 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/210 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 13/33 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 197/407 variables, 210/243 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/407 variables, 196/439 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:32:28] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:32:29] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/407 variables, 2/441 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:32:38] [INFO ] Deduced a trap composed of 48 places in 57 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:32:40] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/407 variables, 2/443 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 407/407 variables, and 443 constraints, problems are : Problem set: 0 solved, 196 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 210/210 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55136ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 55138ms
Finished structural reductions in LTL mode , in 1 iterations and 55725 ms. Remains : 210/210 places, 197/197 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-004-LTLFireability-04
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-004-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-004-LTLFireability-04 finished in 55855 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(!F(p0))) U (X(X((G(p1) U p2)))&&X(p0))))'
Support contains 5 out of 210 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 210/210 places, 197/197 transitions.
Applied a total of 0 rules in 4 ms. Remains 210 /210 variables (removed 0) and now considering 197/197 (removed 0) transitions.
[2025-05-31 22:32:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:32:47] [INFO ] Implicit Places using invariants in 72 ms returned [84]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 73 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 209/210 places, 197/197 transitions.
Applied a total of 0 rules in 2 ms. Remains 209 /209 variables (removed 0) and now considering 197/197 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 79 ms. Remains : 209/210 places, 197/197 transitions.
Stuttering acceptance computed with spot in 272 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), p0, (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND p0 (NOT p1)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DoubleExponent-PT-004-LTLFireability-05
Product exploration explored 100000 steps with 3329 reset in 190 ms.
Product exploration explored 100000 steps with 3327 reset in 132 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 349 edges and 209 vertex of which 207 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 130 ms. Reduced automaton from 7 states, 21 edges and 3 AP (stutter sensitive) to 7 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 249 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), p0, (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND p0 (NOT p1)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (1327 resets) in 531 ms. (75 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40000 steps (1126 resets) in 228 ms. (174 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (1115 resets) in 299 ms. (133 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (1140 resets) in 269 ms. (148 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (1138 resets) in 182 ms. (218 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (1169 resets) in 165 ms. (240 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (1127 resets) in 140 ms. (283 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (1143 resets) in 156 ms. (254 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (1130 resets) in 180 ms. (221 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40000 steps (1141 resets) in 140 ms. (283 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (1112 resets) in 134 ms. (296 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (1157 resets) in 156 ms. (254 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (1131 resets) in 194 ms. (205 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40000 steps (1126 resets) in 191 ms. (208 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (1132 resets) in 251 ms. (158 steps per ms) remains 14/14 properties
Interrupted probabilistic random walk after 558151 steps, run timeout after 3001 ms. (steps per millisecond=185 ) properties seen :12 out of 14
Probabilistic random walk after 558151 steps, saw 279126 distinct states, run finished after 3001 ms. (steps per millisecond=185 ) properties seen :12
// Phase 1: matrix 197 rows 209 cols
[2025-05-31 22:32:53] [INFO ] Computed 19 invariants in 6 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 66/71 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 73/144 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:32:53] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 6/150 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 18/168 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/168 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 177/345 variables, 168/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:32:53] [INFO ] Deduced a trap along path composed of 13 places in 38 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:32:53] [INFO ] Deduced a trap along path composed of 17 places in 24 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/345 variables, 2/190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/345 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 47/392 variables, 33/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/392 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 8/400 variables, 4/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/400 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 5/405 variables, 3/230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/405 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf8 is UNSAT
Problem apf9 is UNSAT
After SMT solving in domain Real declared 406/406 variables, and 231 constraints, problems are : Problem set: 2 solved, 0 unsolved in 408 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 417ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p1))), (G (OR (NOT p1) (NOT p0))), (G (OR (NOT p1) (NOT p0) p2))]
False Knowledge obtained : [(F (NOT (AND (OR (NOT p1) p2) (OR (NOT p0) p2)))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p1) p0))), (F p1), (F (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (F (NOT (OR p1 (NOT p0)))), (F (NOT (OR p1 (NOT p0) p2))), (F p2), (F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (OR (NOT p1) p2))), (F p0), (F (NOT (OR (NOT p1) p0 p2)))]
Knowledge based reduction with 12 factoid took 679 ms. Reduced automaton from 7 states, 21 edges and 3 AP (stutter sensitive) to 5 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 226 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), p0, (NOT p2), (OR (NOT p1) (AND p0 (NOT p2)))]
Stuttering acceptance computed with spot in 239 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), p0, (NOT p2), (OR (NOT p1) (AND p0 (NOT p2)))]
[2025-05-31 22:32:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 22:32:54] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-05-31 22:32:54] [INFO ] [Real]Absence check using 2 positive and 17 generalized place invariants in 6 ms returned sat
[2025-05-31 22:32:55] [INFO ] [Real]Absence check using state equation in 616 ms returned sat
[2025-05-31 22:32:55] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 22:32:55] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-05-31 22:32:55] [INFO ] [Nat]Absence check using 2 positive and 17 generalized place invariants in 6 ms returned sat
[2025-05-31 22:32:55] [INFO ] [Nat]Absence check using state equation in 517 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:32:56] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:32:56] [INFO ] Deduced a trap composed of 47 places in 57 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:32:56] [INFO ] Deduced a trap composed of 48 places in 50 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:32:56] [INFO ] Deduced a trap composed of 55 places in 39 ms of which 3 ms to minimize.
[2025-05-31 22:32:56] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 386 ms
[2025-05-31 22:32:56] [INFO ] Computed and/alt/rep : 196/376/196 causal constraints (skipped 0 transitions) in 11 ms.
[2025-05-31 22:33:00] [INFO ] Added : 194 causal constraints over 40 iterations in 3888 ms. Result :sat
Could not prove EG (NOT p0)
[2025-05-31 22:33:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 22:33:00] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-05-31 22:33:00] [INFO ] [Real]Absence check using 2 positive and 17 generalized place invariants in 5 ms returned sat
[2025-05-31 22:33:00] [INFO ] [Real]Absence check using state equation in 233 ms returned unsat
Proved EG (NOT p2)
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p1))), (G (OR (NOT p1) (NOT p0))), (G (OR (NOT p1) (NOT p0) p2))]
False Knowledge obtained : [(F (NOT (AND (OR (NOT p1) p2) (OR (NOT p0) p2)))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p1) p0))), (F p1), (F (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (F (NOT (OR p1 (NOT p0)))), (F (NOT (OR p1 (NOT p0) p2))), (F p2), (F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (OR (NOT p1) p2))), (F p0), (F (NOT (OR (NOT p1) p0 p2))), (G (NOT p2))]
Property proved to be false thanks to negative knowledge :(G (NOT p2))
Knowledge based reduction with 12 factoid took 688 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA DoubleExponent-PT-004-LTLFireability-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-004-LTLFireability-05 finished in 13464 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(p0)||G(p1)))))'
Support contains 3 out of 210 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 210/210 places, 197/197 transitions.
Applied a total of 0 rules in 3 ms. Remains 210 /210 variables (removed 0) and now considering 197/197 (removed 0) transitions.
// Phase 1: matrix 197 rows 210 cols
[2025-05-31 22:33:01] [INFO ] Computed 20 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:33:01] [INFO ] Implicit Places using invariants in 77 ms returned [84]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 78 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 209/210 places, 197/197 transitions.
Applied a total of 0 rules in 2 ms. Remains 209 /209 variables (removed 0) and now considering 197/197 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 83 ms. Remains : 209/210 places, 197/197 transitions.
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DoubleExponent-PT-004-LTLFireability-07
Product exploration explored 100000 steps with 33333 reset in 156 ms.
Product exploration explored 100000 steps with 33333 reset in 121 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 349 edges and 209 vertex of which 207 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Detected a total of 7/209 stabilizing places and 7/197 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 10 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DoubleExponent-PT-004-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-004-LTLFireability-07 finished in 490 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p0)||X((X(!p1)&&F(p2)))))))'
Support contains 5 out of 210 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 210/210 places, 197/197 transitions.
Graph (complete) has 352 edges and 210 vertex of which 209 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 45 place count 208 transition count 151
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 1 with 44 rules applied. Total rules applied 89 place count 164 transition count 151
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 89 place count 164 transition count 142
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 107 place count 155 transition count 142
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 183 place count 117 transition count 104
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 195 place count 111 transition count 104
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 196 place count 110 transition count 103
Applied a total of 196 rules in 22 ms. Remains 110 /210 variables (removed 100) and now considering 103/197 (removed 94) transitions.
// Phase 1: matrix 103 rows 110 cols
[2025-05-31 22:33:01] [INFO ] Computed 20 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:33:01] [INFO ] Implicit Places using invariants in 65 ms returned [49]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 67 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 109/210 places, 103/197 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 107 transition count 101
Applied a total of 4 rules in 4 ms. Remains 107 /109 variables (removed 2) and now considering 101/103 (removed 2) transitions.
// Phase 1: matrix 101 rows 107 cols
[2025-05-31 22:33:01] [INFO ] Computed 19 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:33:01] [INFO ] Implicit Places using invariants in 54 ms returned []
[2025-05-31 22:33:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:33:01] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-05-31 22:33:02] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 107/210 places, 101/197 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 332 ms. Remains : 107/210 places, 101/197 transitions.
Stuttering acceptance computed with spot in 104 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DoubleExponent-PT-004-LTLFireability-08
Product exploration explored 100000 steps with 13896 reset in 197 ms.
Product exploration explored 100000 steps with 13873 reset in 120 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 319 edges and 107 vertex of which 106 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p2), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 118 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 137 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (5503 resets) in 173 ms. (229 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (3227 resets) in 78 ms. (506 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (3255 resets) in 83 ms. (476 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (3302 resets) in 71 ms. (555 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (3255 resets) in 60 ms. (655 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (3240 resets) in 59 ms. (666 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (3264 resets) in 60 ms. (655 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (3213 resets) in 54 ms. (727 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 341928 steps, run timeout after 3001 ms. (steps per millisecond=113 ) properties seen :1 out of 7
Probabilistic random walk after 341928 steps, saw 171027 distinct states, run finished after 3001 ms. (steps per millisecond=113 ) properties seen :1
[2025-05-31 22:33:06] [INFO ] Invariant cache hit.
[2025-05-31 22:33:06] [INFO ] State equation strengthened by 5 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 31/36 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 15/51 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 28/79 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 3/82 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:06] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/82 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/82 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 91/173 variables, 82/98 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/173 variables, 3/101 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:06] [INFO ] Deduced a trap along path composed of 2 places in 32 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:06] [INFO ] Deduced a trap along path composed of 2 places in 19 ms of which 0 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/173 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/173 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 29/202 variables, 20/123 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/202 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/202 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/202 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 2/204 variables, 2/128 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/204 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/204 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem apf0 is UNSAT
Problem apf4 is UNSAT
At refinement iteration 21 (OVERLAPS) 4/208 variables, 3/133 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/208 variables, 1/134 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/208 variables, 0/134 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 0/208 variables, 0/134 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 134 constraints, problems are : Problem set: 2 solved, 4 unsolved in 440 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 107/107 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 2 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 32/36 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 15/51 variables, 3/8 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 28/79 variables, 5/13 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 0/13 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 3/82 variables, 2/15 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/82 variables, 1/16 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/82 variables, 0/16 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 91/173 variables, 82/98 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/173 variables, 3/101 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/173 variables, 2/103 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/173 variables, 0/103 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 29/202 variables, 20/123 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/202 variables, 2/125 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/202 variables, 1/126 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/202 variables, 4/130 constraints. Problems are: Problem set: 2 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:06] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 3 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/202 variables, 1/131 constraints. Problems are: Problem set: 2 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:06] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 3 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/202 variables, 1/132 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/202 variables, 0/132 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 2/204 variables, 2/134 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/204 variables, 2/136 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/204 variables, 0/136 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 4/208 variables, 3/139 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/208 variables, 1/140 constraints. Problems are: Problem set: 2 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:06] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:06] [INFO ] Deduced a trap along path composed of 8 places in 22 ms of which 0 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/208 variables, 2/142 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/208 variables, 0/142 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 28 (OVERLAPS) 0/208 variables, 0/142 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 142 constraints, problems are : Problem set: 2 solved, 4 unsolved in 683 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 107/107 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 4/6 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 1134ms problems are : Problem set: 2 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1043 ms.
Support contains 4 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 101/101 transitions.
Graph (complete) has 305 edges and 107 vertex of which 106 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 106 transition count 100
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 105 transition count 99
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 1 with 13 rules applied. Total rules applied 17 place count 105 transition count 86
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 30 place count 92 transition count 86
Partial Free-agglomeration rule applied 14 times.
Drop transitions (Partial Free agglomeration) removed 14 transitions
Iterating global reduction 2 with 14 rules applied. Total rules applied 44 place count 92 transition count 86
Applied a total of 44 rules in 9 ms. Remains 92 /107 variables (removed 15) and now considering 86/101 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 92/107 places, 86/101 transitions.
RANDOM walk for 40000 steps (5080 resets) in 75 ms. (526 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (3322 resets) in 61 ms. (645 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (3340 resets) in 57 ms. (689 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (3412 resets) in 64 ms. (615 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (3399 resets) in 113 ms. (350 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 351857 steps, run timeout after 3001 ms. (steps per millisecond=117 ) properties seen :0 out of 4
Probabilistic random walk after 351857 steps, saw 176028 distinct states, run finished after 3001 ms. (steps per millisecond=117 ) properties seen :0
// Phase 1: matrix 86 rows 92 cols
[2025-05-31 22:33:11] [INFO ] Computed 19 invariants in 1 ms
[2025-05-31 22:33:11] [INFO ] State equation strengthened by 14 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 43/47 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 40/87 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:11] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:11] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:11] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:11] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:11] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:11] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:11] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:11] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:11] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:11] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:12] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 11/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 86/173 variables, 87/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/173 variables, 14/129 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/173 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 5/178 variables, 5/134 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/178 variables, 2/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/178 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/178 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 178/178 variables, and 136 constraints, problems are : Problem set: 0 solved, 4 unsolved in 767 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 92/92 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 43/47 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 40/87 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 11/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 86/173 variables, 87/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/173 variables, 14/129 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/173 variables, 4/133 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:12] [INFO ] Deduced a trap along path composed of 11 places in 27 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:12] [INFO ] Deduced a trap along path composed of 11 places in 19 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/173 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/173 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 5/178 variables, 5/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/178 variables, 2/142 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/178 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/178 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 178/178 variables, and 142 constraints, problems are : Problem set: 0 solved, 4 unsolved in 393 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 92/92 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 1166ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 765 ms.
Support contains 4 out of 92 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 86/86 transitions.
Applied a total of 0 rules in 2 ms. Remains 92 /92 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 92/92 places, 86/86 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 86/86 transitions.
Applied a total of 0 rules in 2 ms. Remains 92 /92 variables (removed 0) and now considering 86/86 (removed 0) transitions.
[2025-05-31 22:33:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:33:13] [INFO ] Implicit Places using invariants in 93 ms returned [22, 60, 65, 83, 89]
[2025-05-31 22:33:13] [INFO ] Actually due to overlaps returned [65, 60]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 95 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 90/92 places, 86/86 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 90 transition count 85
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 89 transition count 85
Applied a total of 2 rules in 4 ms. Remains 89 /90 variables (removed 1) and now considering 85/86 (removed 1) transitions.
// Phase 1: matrix 85 rows 89 cols
[2025-05-31 22:33:13] [INFO ] Computed 17 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:33:13] [INFO ] Implicit Places using invariants in 77 ms returned [22, 80, 86]
[2025-05-31 22:33:13] [INFO ] Actually due to overlaps returned [86, 80]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 78 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 87/92 places, 85/86 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 87 transition count 84
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 86 transition count 84
Applied a total of 2 rules in 4 ms. Remains 86 /87 variables (removed 1) and now considering 84/85 (removed 1) transitions.
// Phase 1: matrix 84 rows 86 cols
[2025-05-31 22:33:13] [INFO ] Computed 15 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:33:13] [INFO ] Implicit Places using invariants in 76 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 77 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 85/92 places, 84/86 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 85 transition count 84
Applied a total of 1 rules in 3 ms. Remains 85 /85 variables (removed 0) and now considering 84/84 (removed 0) transitions.
// Phase 1: matrix 84 rows 85 cols
[2025-05-31 22:33:13] [INFO ] Computed 14 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:33:13] [INFO ] Implicit Places using invariants in 69 ms returned []
[2025-05-31 22:33:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:33:13] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-05-31 22:33:13] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 85/92 places, 84/86 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 538 ms. Remains : 85/92 places, 84/86 transitions.
RANDOM walk for 40000 steps (5698 resets) in 104 ms. (380 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (3627 resets) in 73 ms. (540 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (3645 resets) in 49 ms. (800 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (3658 resets) in 49 ms. (800 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (3679 resets) in 47 ms. (833 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 372198 steps, run timeout after 3001 ms. (steps per millisecond=124 ) properties seen :0 out of 4
Probabilistic random walk after 372198 steps, saw 186140 distinct states, run finished after 3001 ms. (steps per millisecond=124 ) properties seen :0
[2025-05-31 22:33:16] [INFO ] Invariant cache hit.
[2025-05-31 22:33:16] [INFO ] State equation strengthened by 14 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 55/59 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:17] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 21/80 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 84/164 variables, 80/93 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 14/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 5/169 variables, 5/112 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/169 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/169 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/169 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 169/169 variables, and 114 constraints, problems are : Problem set: 0 solved, 4 unsolved in 218 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 85/85 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 55/59 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 21/80 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 84/164 variables, 80/93 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 14/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 4/111 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:17] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:17] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:17] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 3/114 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:17] [INFO ] Deduced a trap along path composed of 12 places in 24 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/164 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/164 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 5/169 variables, 5/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/169 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/169 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/169 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 169/169 variables, and 122 constraints, problems are : Problem set: 0 solved, 4 unsolved in 504 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 85/85 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 725ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 582 ms.
Support contains 4 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 85 /85 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 85/85 places, 84/84 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 84/84 transitions.
Applied a total of 0 rules in 2 ms. Remains 85 /85 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2025-05-31 22:33:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:33:18] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-05-31 22:33:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:33:18] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-05-31 22:33:18] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 22:33:18] [INFO ] Redundant transitions in 2 ms returned []
Running 83 sub problems to find dead transitions.
[2025-05-31 22:33:18] [INFO ] Invariant cache hit.
[2025-05-31 22:33:18] [INFO ] State equation strengthened by 14 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (OVERLAPS) 1/85 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 83 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:19] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:19] [INFO ] Deduced a trap composed of 41 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:19] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:19] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:19] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:19] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 83 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:19] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:19] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (OVERLAPS) 84/169 variables, 85/107 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/169 variables, 14/121 constraints. Problems are: Problem set: 0 solved, 83 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/169 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 10 (OVERLAPS) 0/169 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Real declared 169/169 variables, and 121 constraints, problems are : Problem set: 0 solved, 83 unsolved in 2664 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 85/85 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 83 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (OVERLAPS) 1/85 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 8/22 constraints. Problems are: Problem set: 0 solved, 83 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:21] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 83 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:21] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 83 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:22] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:22] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 83 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:22] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:22] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:22] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/85 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/85 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 10 (OVERLAPS) 84/169 variables, 85/114 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/169 variables, 14/128 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/169 variables, 83/211 constraints. Problems are: Problem set: 0 solved, 83 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:23] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:23] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:23] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/169 variables, 3/214 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/169 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 15 (OVERLAPS) 0/169 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Int declared 169/169 variables, and 214 constraints, problems are : Problem set: 0 solved, 83 unsolved in 6604 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 85/85 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9285ms problems are : Problem set: 0 solved, 83 unsolved
Search for dead transitions found 0 dead transitions in 9285ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9562 ms. Remains : 85/85 places, 84/84 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 85 transition count 79
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 80 transition count 79
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 78 transition count 77
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 78 transition count 77
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 77 transition count 76
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 17 place count 77 transition count 75
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 18 place count 76 transition count 75
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 76 transition count 75
Applied a total of 19 rules in 12 ms. Remains 76 /85 variables (removed 9) and now considering 75/84 (removed 9) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 75 rows 76 cols
[2025-05-31 22:33:27] [INFO ] Computed 14 invariants in 1 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 22:33:27] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2025-05-31 22:33:27] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 1 ms returned sat
[2025-05-31 22:33:27] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 22:33:27] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2025-05-31 22:33:27] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 1 ms returned sat
[2025-05-31 22:33:28] [INFO ] After 38ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2025-05-31 22:33:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 22:33:28] [INFO ] After 18ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2025-05-31 22:33:28] [INFO ] After 53ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2025-05-31 22:33:28] [INFO ] After 147ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 229 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p2), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (G (OR p2 p0)), (G (OR p2 p0 p1))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 17 factoid took 118 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 4 out of 107 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 : 107/107 places, 101/101 transitions.
Applied a total of 0 rules in 5 ms. Remains 107 /107 variables (removed 0) and now considering 101/101 (removed 0) transitions.
// Phase 1: matrix 101 rows 107 cols
[2025-05-31 22:33:28] [INFO ] Computed 19 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:33:28] [INFO ] Implicit Places using invariants in 69 ms returned []
[2025-05-31 22:33:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:33:28] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-05-31 22:33:28] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 22:33:28] [INFO ] Redundant transitions in 3 ms returned []
Running 100 sub problems to find dead transitions.
[2025-05-31 22:33:28] [INFO ] Invariant cache hit.
[2025-05-31 22:33:28] [INFO ] State equation strengthened by 5 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (OVERLAPS) 101/207 variables, 106/125 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 5/130 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (OVERLAPS) 1/208 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 100 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:30] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:30] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 2/133 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (OVERLAPS) 0/208 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 133 constraints, problems are : Problem set: 0 solved, 100 unsolved in 5576 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 107/107 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 101/207 variables, 106/126 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 97/228 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 1/208 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 3/232 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/208 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/208 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 12 (OVERLAPS) 0/208 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 233 constraints, problems are : Problem set: 0 solved, 100 unsolved in 9559 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 107/107 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15146ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 15146ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 15409 ms. Remains : 107/107 places, 101/101 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 319 edges and 107 vertex of which 106 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 108 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
RANDOM walk for 40000 steps (5617 resets) in 125 ms. (317 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (3174 resets) in 81 ms. (487 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (3258 resets) in 47 ms. (833 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (3281 resets) in 47 ms. (833 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (3199 resets) in 58 ms. (677 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 357589 steps, run timeout after 3001 ms. (steps per millisecond=119 ) properties seen :0 out of 4
Probabilistic random walk after 357589 steps, saw 178860 distinct states, run finished after 3001 ms. (steps per millisecond=119 ) properties seen :0
[2025-05-31 22:33:47] [INFO ] Invariant cache hit.
[2025-05-31 22:33:47] [INFO ] State equation strengthened by 5 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 32/36 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 15/51 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 28/79 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 3/82 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/82 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 91/173 variables, 82/97 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/173 variables, 3/100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:47] [INFO ] Deduced a trap along path composed of 2 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:47] [INFO ] Deduced a trap along path composed of 6 places in 20 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:47] [INFO ] Deduced a trap along path composed of 2 places in 18 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/173 variables, 3/103 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/173 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 29/202 variables, 20/123 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/202 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/202 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:47] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:47] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 3 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/202 variables, 2/128 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/202 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 2/204 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/204 variables, 2/132 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/204 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 4/208 variables, 3/135 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/208 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/208 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 0/208 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 136 constraints, problems are : Problem set: 0 solved, 4 unsolved in 515 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 107/107 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 32/36 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 15/51 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 28/79 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 3/82 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/82 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 91/173 variables, 82/97 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/173 variables, 3/100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/173 variables, 3/103 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/173 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 29/202 variables, 20/123 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/202 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/202 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/202 variables, 4/130 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/202 variables, 2/132 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/202 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 2/204 variables, 2/134 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/204 variables, 2/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/204 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 4/208 variables, 3/139 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/208 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/208 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 0/208 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 140 constraints, problems are : Problem set: 0 solved, 4 unsolved in 423 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 107/107 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 943ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1058 ms.
Support contains 4 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 101/101 transitions.
Graph (complete) has 305 edges and 107 vertex of which 106 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 106 transition count 100
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 105 transition count 99
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 1 with 13 rules applied. Total rules applied 17 place count 105 transition count 86
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 30 place count 92 transition count 86
Partial Free-agglomeration rule applied 14 times.
Drop transitions (Partial Free agglomeration) removed 14 transitions
Iterating global reduction 2 with 14 rules applied. Total rules applied 44 place count 92 transition count 86
Applied a total of 44 rules in 6 ms. Remains 92 /107 variables (removed 15) and now considering 86/101 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 92/107 places, 86/101 transitions.
RANDOM walk for 40000 steps (5095 resets) in 105 ms. (377 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (3438 resets) in 88 ms. (449 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (3393 resets) in 57 ms. (689 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (3387 resets) in 50 ms. (784 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (3423 resets) in 55 ms. (714 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 362589 steps, run timeout after 3001 ms. (steps per millisecond=120 ) properties seen :0 out of 4
Probabilistic random walk after 362589 steps, saw 181385 distinct states, run finished after 3001 ms. (steps per millisecond=120 ) properties seen :0
// Phase 1: matrix 86 rows 92 cols
[2025-05-31 22:33:52] [INFO ] Computed 19 invariants in 2 ms
[2025-05-31 22:33:52] [INFO ] State equation strengthened by 14 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 43/47 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 40/87 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:52] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:52] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:52] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:52] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:52] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:52] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:52] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:52] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:52] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:52] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:52] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 11/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 86/173 variables, 87/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/173 variables, 14/129 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/173 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 5/178 variables, 5/134 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/178 variables, 2/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/178 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/178 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 178/178 variables, and 136 constraints, problems are : Problem set: 0 solved, 4 unsolved in 736 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 92/92 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 43/47 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 40/87 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 11/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 86/173 variables, 87/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/173 variables, 14/129 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/173 variables, 4/133 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:53] [INFO ] Deduced a trap along path composed of 11 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:53] [INFO ] Deduced a trap along path composed of 11 places in 19 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/173 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/173 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 5/178 variables, 5/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/178 variables, 2/142 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/178 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/178 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 178/178 variables, and 142 constraints, problems are : Problem set: 0 solved, 4 unsolved in 397 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 92/92 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 1137ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 770 ms.
Support contains 4 out of 92 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 86/86 transitions.
Applied a total of 0 rules in 2 ms. Remains 92 /92 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 92/92 places, 86/86 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 86/86 transitions.
Applied a total of 0 rules in 1 ms. Remains 92 /92 variables (removed 0) and now considering 86/86 (removed 0) transitions.
[2025-05-31 22:33:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:33:54] [INFO ] Implicit Places using invariants in 81 ms returned [22, 60, 65, 83, 89]
[2025-05-31 22:33:54] [INFO ] Actually due to overlaps returned [65, 60]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 82 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 90/92 places, 86/86 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 90 transition count 85
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 89 transition count 85
Applied a total of 2 rules in 3 ms. Remains 89 /90 variables (removed 1) and now considering 85/86 (removed 1) transitions.
// Phase 1: matrix 85 rows 89 cols
[2025-05-31 22:33:54] [INFO ] Computed 17 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:33:54] [INFO ] Implicit Places using invariants in 74 ms returned [22, 80, 86]
[2025-05-31 22:33:54] [INFO ] Actually due to overlaps returned [86, 80]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 75 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 87/92 places, 85/86 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 87 transition count 84
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 86 transition count 84
Applied a total of 2 rules in 2 ms. Remains 86 /87 variables (removed 1) and now considering 84/85 (removed 1) transitions.
// Phase 1: matrix 84 rows 86 cols
[2025-05-31 22:33:54] [INFO ] Computed 15 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:33:54] [INFO ] Implicit Places using invariants in 74 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 75 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 85/92 places, 84/86 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 85 transition count 84
Applied a total of 1 rules in 2 ms. Remains 85 /85 variables (removed 0) and now considering 84/84 (removed 0) transitions.
// Phase 1: matrix 84 rows 85 cols
[2025-05-31 22:33:54] [INFO ] Computed 14 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:33:54] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-05-31 22:33:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:33:54] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-05-31 22:33:54] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 85/92 places, 84/86 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 509 ms. Remains : 85/92 places, 84/86 transitions.
RANDOM walk for 40000 steps (5699 resets) in 91 ms. (434 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (3598 resets) in 73 ms. (540 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (3646 resets) in 50 ms. (784 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (3681 resets) in 47 ms. (833 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (3629 resets) in 47 ms. (833 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 376546 steps, run timeout after 3001 ms. (steps per millisecond=125 ) properties seen :0 out of 4
Probabilistic random walk after 376546 steps, saw 188316 distinct states, run finished after 3001 ms. (steps per millisecond=125 ) properties seen :0
[2025-05-31 22:33:57] [INFO ] Invariant cache hit.
[2025-05-31 22:33:57] [INFO ] State equation strengthened by 14 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 55/59 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:57] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 21/80 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 84/164 variables, 80/93 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 14/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 5/169 variables, 5/112 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/169 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/169 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/169 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 169/169 variables, and 114 constraints, problems are : Problem set: 0 solved, 4 unsolved in 224 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 85/85 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 55/59 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 21/80 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 84/164 variables, 80/93 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 14/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 4/111 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:58] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:58] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:58] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 3/114 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:58] [INFO ] Deduced a trap along path composed of 12 places in 24 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/164 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/164 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 5/169 variables, 5/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/169 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/169 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/169 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 169/169 variables, and 122 constraints, problems are : Problem set: 0 solved, 4 unsolved in 487 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 85/85 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 714ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 563 ms.
Support contains 4 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 85 /85 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 85/85 places, 84/84 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 84/84 transitions.
Applied a total of 0 rules in 2 ms. Remains 85 /85 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2025-05-31 22:33:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:33:59] [INFO ] Implicit Places using invariants in 59 ms returned []
[2025-05-31 22:33:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:33:59] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-05-31 22:33:59] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 22:33:59] [INFO ] Redundant transitions in 3 ms returned []
Running 83 sub problems to find dead transitions.
[2025-05-31 22:33:59] [INFO ] Invariant cache hit.
[2025-05-31 22:33:59] [INFO ] State equation strengthened by 14 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (OVERLAPS) 1/85 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 83 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:59] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:34:00] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:34:00] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:34:00] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:34:00] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:34:00] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 83 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:34:00] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:34:00] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (OVERLAPS) 84/169 variables, 85/107 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/169 variables, 14/121 constraints. Problems are: Problem set: 0 solved, 83 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/169 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 10 (OVERLAPS) 0/169 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Real declared 169/169 variables, and 121 constraints, problems are : Problem set: 0 solved, 83 unsolved in 2731 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 85/85 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 83 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (OVERLAPS) 1/85 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 8/22 constraints. Problems are: Problem set: 0 solved, 83 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:34:02] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 83 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:34:02] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 83 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:34:02] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:34:02] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 83 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:34:03] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:34:03] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:34:03] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/85 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/85 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 10 (OVERLAPS) 84/169 variables, 85/114 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/169 variables, 14/128 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/169 variables, 83/211 constraints. Problems are: Problem set: 0 solved, 83 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:34:04] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:34:04] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:34:04] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/169 variables, 3/214 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/169 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 15 (OVERLAPS) 0/169 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Int declared 169/169 variables, and 214 constraints, problems are : Problem set: 0 solved, 83 unsolved in 6628 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 85/85 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9373ms problems are : Problem set: 0 solved, 83 unsolved
Search for dead transitions found 0 dead transitions in 9374ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9652 ms. Remains : 85/85 places, 84/84 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 85 transition count 79
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 80 transition count 79
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 78 transition count 77
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 78 transition count 77
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 77 transition count 76
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 17 place count 77 transition count 75
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 18 place count 76 transition count 75
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 76 transition count 75
Applied a total of 19 rules in 10 ms. Remains 76 /85 variables (removed 9) and now considering 75/84 (removed 9) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 75 rows 76 cols
[2025-05-31 22:34:08] [INFO ] Computed 14 invariants in 2 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 22:34:08] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-05-31 22:34:08] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 1 ms returned sat
[2025-05-31 22:34:08] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 22:34:08] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2025-05-31 22:34:08] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2025-05-31 22:34:08] [INFO ] After 38ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2025-05-31 22:34:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 22:34:08] [INFO ] After 18ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2025-05-31 22:34:08] [INFO ] After 46ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2025-05-31 22:34:08] [INFO ] After 153ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 240 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 111 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 13950 reset in 96 ms.
Product exploration explored 100000 steps with 13967 reset in 104 ms.
Built C files in :
/tmp/ltsmin11656841491197090215
[2025-05-31 22:34:09] [INFO ] Computing symmetric may disable matrix : 101 transitions.
[2025-05-31 22:34:09] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 22:34:09] [INFO ] Computing symmetric may enable matrix : 101 transitions.
[2025-05-31 22:34:09] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 22:34:09] [INFO ] Computing Do-Not-Accords matrix : 101 transitions.
[2025-05-31 22:34:09] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 22:34:09] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11656841491197090215
Running compilation step : cd /tmp/ltsmin11656841491197090215;'/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 341 ms.
Running link step : cd /tmp/ltsmin11656841491197090215;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin11656841491197090215;'/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/stateBased16887338978673768675.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 107/107 places, 101/101 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 106 transition count 100
Applied a total of 2 rules in 5 ms. Remains 106 /107 variables (removed 1) and now considering 100/101 (removed 1) transitions.
// Phase 1: matrix 100 rows 106 cols
[2025-05-31 22:34:24] [INFO ] Computed 19 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:34:24] [INFO ] Implicit Places using invariants in 70 ms returned []
[2025-05-31 22:34:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:34:24] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-05-31 22:34:24] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 22:34:24] [INFO ] Redundant transitions in 3 ms returned []
Running 99 sub problems to find dead transitions.
[2025-05-31 22:34:24] [INFO ] Invariant cache hit.
[2025-05-31 22:34:24] [INFO ] State equation strengthened by 5 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (OVERLAPS) 100/205 variables, 105/124 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 5/129 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (OVERLAPS) 1/206 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 99 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:34:27] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:34:27] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 2/132 constraints. Problems are: Problem set: 0 solved, 99 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:34:27] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:34:27] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 2/134 constraints. Problems are: Problem set: 0 solved, 99 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:34:28] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:34:28] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/206 variables, 2/136 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/206 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 11 (OVERLAPS) 0/206 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 136 constraints, problems are : Problem set: 0 solved, 99 unsolved in 7045 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 106/106 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (OVERLAPS) 100/205 variables, 105/124 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 5/129 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 96/225 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (OVERLAPS) 1/206 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/206 variables, 6/235 constraints. Problems are: Problem set: 0 solved, 99 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:34:38] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/206 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/206 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 12 (OVERLAPS) 0/206 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 236 constraints, problems are : Problem set: 0 solved, 99 unsolved in 12693 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 106/106 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19746ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 19746ms
Starting structural reductions in SI_LTL mode, iteration 1 : 106/107 places, 100/101 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 20004 ms. Remains : 106/107 places, 100/101 transitions.
Built C files in :
/tmp/ltsmin14078441610929063482
[2025-05-31 22:34:44] [INFO ] Computing symmetric may disable matrix : 100 transitions.
[2025-05-31 22:34:44] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 22:34:44] [INFO ] Computing symmetric may enable matrix : 100 transitions.
[2025-05-31 22:34:44] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 22:34:44] [INFO ] Computing Do-Not-Accords matrix : 100 transitions.
[2025-05-31 22:34:44] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 22:34:44] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14078441610929063482
Running compilation step : cd /tmp/ltsmin14078441610929063482;'/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 216 ms.
Running link step : cd /tmp/ltsmin14078441610929063482;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin14078441610929063482;'/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/stateBased6847453824600686344.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-31 22:34:59] [INFO ] Flatten gal took : 7 ms
[2025-05-31 22:34:59] [INFO ] Flatten gal took : 7 ms
[2025-05-31 22:34:59] [INFO ] Time to serialize gal into /tmp/LTL3136591223625775459.gal : 3 ms
[2025-05-31 22:34:59] [INFO ] Time to serialize properties into /tmp/LTL14968790728673746586.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/LTL3136591223625775459.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16792083839290501624.hoa' '-atoms' '/tmp/LTL14968790728673746586.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/LTL14968790728673746586.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16792083839290501624.hoa
Detected timeout of ITS tools.
[2025-05-31 22:35:14] [INFO ] Flatten gal took : 7 ms
[2025-05-31 22:35:14] [INFO ] Flatten gal took : 6 ms
[2025-05-31 22:35:14] [INFO ] Time to serialize gal into /tmp/LTL9995209337213959263.gal : 2 ms
[2025-05-31 22:35:14] [INFO ] Time to serialize properties into /tmp/LTL13274180217288498614.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/LTL9995209337213959263.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13274180217288498614.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G((F("(((p124<1)||(p149<1))&&((p142<1)||(p212<1)))"))||(X((X("((p142<1)||(p212<1))"))&&(F("(p133<1)"))))))))
Formula 0 simplified : G(FG!"(((p124<1)||(p149<1))&&((p142<1)||(p212<1)))" & F(!"((p142<1)||(p212<1))" | G!"(p133<1)"))
Detected timeout of ITS tools.
[2025-05-31 22:35:29] [INFO ] Flatten gal took : 10 ms
[2025-05-31 22:35:29] [INFO ] Applying decomposition
[2025-05-31 22:35:30] [INFO ] Flatten gal took : 6 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/graph4200951824450375351.txt' '-o' '/tmp/graph4200951824450375351.bin' '-w' '/tmp/graph4200951824450375351.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4200951824450375351.bin' '-l' '-1' '-v' '-w' '/tmp/graph4200951824450375351.weights' '-q' '0' '-e' '0.001'
[2025-05-31 22:35:30] [INFO ] Decomposing Gal with order
[2025-05-31 22:35:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 22:35:30] [INFO ] Removed a total of 62 redundant transitions.
[2025-05-31 22:35:30] [INFO ] Flatten gal took : 39 ms
[2025-05-31 22:35:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 5 ms.
[2025-05-31 22:35:30] [INFO ] Time to serialize gal into /tmp/LTL4687622657791560652.gal : 3 ms
[2025-05-31 22:35:30] [INFO ] Time to serialize properties into /tmp/LTL6174161302447639897.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/LTL4687622657791560652.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6174161302447639897.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F(G((F("(((i2.u2.p124<1)||(i0.i0.u9.p149<1))&&((i2.u7.p142<1)||(i2.u16.p212<1)))"))||(X((X("((i2.u7.p142<1)||(i2.u16.p212<1))"))&&(...181
Formula 0 simplified : G(FG!"(((i2.u2.p124<1)||(i0.i0.u9.p149<1))&&((i2.u7.p142<1)||(i2.u16.p212<1)))" & F(!"((i2.u7.p142<1)||(i2.u16.p212<1))" | G!"(i5.u4...166
Detected timeout of ITS tools.
Treatment of property DoubleExponent-PT-004-LTLFireability-08 finished in 163425 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((!p0||G(p0)||(X(X(p1))&&F(p2)))))'
Support contains 4 out of 210 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 210/210 places, 197/197 transitions.
Applied a total of 0 rules in 4 ms. Remains 210 /210 variables (removed 0) and now considering 197/197 (removed 0) transitions.
// Phase 1: matrix 197 rows 210 cols
[2025-05-31 22:35:45] [INFO ] Computed 20 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:35:45] [INFO ] Implicit Places using invariants in 97 ms returned [84]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 101 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 209/210 places, 197/197 transitions.
Applied a total of 0 rules in 2 ms. Remains 209 /209 variables (removed 0) and now considering 197/197 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 107 ms. Remains : 209/210 places, 197/197 transitions.
Stuttering acceptance computed with spot in 267 ms :[false, (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p1), (AND (NOT p0) (NOT p1)), true, (NOT p2), (AND (NOT p0) p1)]
Running random walk in product with property : DoubleExponent-PT-004-LTLFireability-10
Product exploration explored 100000 steps with 24983 reset in 86 ms.
Product exploration explored 100000 steps with 24975 reset in 91 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 349 edges and 209 vertex of which 207 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X p0), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p2)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 114 ms. Reduced automaton from 8 states, 13 edges and 3 AP (stutter sensitive) to 8 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 250 ms :[false, (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p1), (AND (NOT p0) (NOT p1)), true, (NOT p2), (AND (NOT p0) p1)]
RANDOM walk for 40000 steps (1332 resets) in 119 ms. (333 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (1136 resets) in 110 ms. (360 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (1145 resets) in 111 ms. (357 steps per ms) remains 4/9 properties
BEST_FIRST walk for 40000 steps (1149 resets) in 69 ms. (571 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (1127 resets) in 85 ms. (465 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (1130 resets) in 54 ms. (727 steps per ms) remains 4/4 properties
// Phase 1: matrix 197 rows 209 cols
[2025-05-31 22:35:46] [INFO ] Computed 19 invariants in 2 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 110/114 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:35:46] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 6/120 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 33/153 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 16/169 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/169 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 178/347 variables, 169/189 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:35:46] [INFO ] Deduced a trap along path composed of 13 places in 18 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/347 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/347 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 45/392 variables, 32/222 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/392 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 8/400 variables, 4/226 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/400 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 5/405 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/405 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf3 is UNSAT
Problem apf4 is UNSAT
At refinement iteration 19 (OVERLAPS) 1/406 variables, 1/230 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:35:46] [INFO ] Deduced a trap composed of 41 places in 51 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:35:46] [INFO ] Deduced a trap composed of 49 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:35:47] [INFO ] Deduced a trap composed of 43 places in 53 ms of which 5 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/406 variables, 3/233 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/406 variables, 0/233 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/406 variables, 0/233 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 406/406 variables, and 233 constraints, problems are : Problem set: 2 solved, 2 unsolved in 878 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 110/113 variables, 8/8 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 1/9 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 6/119 variables, 2/11 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 0/11 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 33/152 variables, 7/18 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 0/18 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 16/168 variables, 2/20 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/168 variables, 0/20 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 177/345 variables, 168/188 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/345 variables, 2/190 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/345 variables, 1/191 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/345 variables, 0/191 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 47/392 variables, 33/224 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/392 variables, 3/227 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/392 variables, 0/227 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 8/400 variables, 4/231 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/400 variables, 0/231 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 5/405 variables, 3/234 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:35:47] [INFO ] Deduced a trap along path composed of 17 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:35:47] [INFO ] Deduced a trap along path composed of 5 places in 25 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:35:47] [INFO ] Deduced a trap along path composed of 16 places in 26 ms of which 0 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/405 variables, 3/237 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/405 variables, 0/237 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 1/406 variables, 1/238 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/406 variables, 0/238 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/406 variables, 0/238 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 406/406 variables, and 238 constraints, problems are : Problem set: 2 solved, 2 unsolved in 699 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 2/4 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 1584ms problems are : Problem set: 2 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 278 ms.
Support contains 3 out of 209 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 197/197 transitions.
Graph (complete) has 349 edges and 209 vertex of which 207 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 207 transition count 148
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 96 place count 160 transition count 148
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 96 place count 160 transition count 140
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 112 place count 152 transition count 140
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 190 place count 113 transition count 101
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 200 place count 108 transition count 101
Free-agglomeration rule (complex) applied 15 times.
Iterating global reduction 2 with 15 rules applied. Total rules applied 215 place count 108 transition count 86
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 230 place count 93 transition count 86
Partial Free-agglomeration rule applied 16 times.
Drop transitions (Partial Free agglomeration) removed 16 transitions
Iterating global reduction 3 with 16 rules applied. Total rules applied 246 place count 93 transition count 86
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 247 place count 92 transition count 85
Applied a total of 247 rules in 10 ms. Remains 92 /209 variables (removed 117) and now considering 85/197 (removed 112) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 92/209 places, 85/197 transitions.
RANDOM walk for 40000 steps (5048 resets) in 54 ms. (727 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3309 resets) in 52 ms. (754 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3379 resets) in 60 ms. (655 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 3586 steps, run visited all 2 properties in 16 ms. (steps per millisecond=224 )
Probabilistic random walk after 3586 steps, saw 1865 distinct states, run finished after 20 ms. (steps per millisecond=179 ) properties seen :2
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X p0), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p2)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X p0)), (G (OR p0 p1)), (G (OR p2 p0))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT (OR p2 (NOT p0)))), (F (NOT p2)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 11 factoid took 368 ms. Reduced automaton from 8 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[false, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), true, (NOT p0)]
Stuttering acceptance computed with spot in 188 ms :[false, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), true, (NOT p0)]
Support contains 3 out of 209 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Applied a total of 0 rules in 2 ms. Remains 209 /209 variables (removed 0) and now considering 197/197 (removed 0) transitions.
[2025-05-31 22:35:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:35:49] [INFO ] Implicit Places using invariants in 69 ms returned []
[2025-05-31 22:35:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:35:49] [INFO ] Implicit Places using invariants and state equation in 472 ms returned []
Implicit Place search using SMT with State Equation took 543 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2025-05-31 22:35:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/209 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:35:52] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:35:53] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 197/406 variables, 209/230 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:35:56] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:35:56] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:35:56] [INFO ] Deduced a trap composed of 47 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:35:57] [INFO ] Deduced a trap composed of 55 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:35:57] [INFO ] Deduced a trap composed of 49 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:35:58] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 6/236 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:36:00] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:36:00] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 2/238 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/406 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:36:08] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 4 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/406 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/406 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:36:14] [INFO ] Deduced a trap composed of 55 places in 41 ms of which 2 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/406 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 406/406 variables, and 240 constraints, problems are : Problem set: 0 solved, 196 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/209 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 12/31 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 197/406 variables, 209/240 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 196/436 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:36:29] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:36:29] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 2/438 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:36:39] [INFO ] Deduced a trap along path composed of 17 places in 42 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:36:42] [INFO ] Deduced a trap along path composed of 13 places in 57 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:36:43] [INFO ] Deduced a trap along path composed of 5 places in 20 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/406 variables, 3/441 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 406/406 variables, and 441 constraints, problems are : Problem set: 0 solved, 196 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 60040ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 60041ms
Finished structural reductions in LTL mode , in 1 iterations and 60588 ms. Remains : 209/209 places, 197/197 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 349 edges and 209 vertex of which 207 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[false, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), true, (NOT p0)]
RANDOM walk for 40000 steps (1336 resets) in 171 ms. (232 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (1143 resets) in 65 ms. (606 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (1158 resets) in 58 ms. (677 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (1121 resets) in 64 ms. (615 steps per ms) remains 1/3 properties
[2025-05-31 22:36:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 62/63 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 81/144 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:36:50] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 6/150 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 18/168 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/168 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 177/345 variables, 168/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/345 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 47/392 variables, 33/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/392 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 8/400 variables, 4/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/400 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 5/405 variables, 3/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/405 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1/406 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/406 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/406 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 406/406 variables, and 229 constraints, problems are : Problem set: 0 solved, 1 unsolved in 288 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 62/63 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 81/144 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 6/150 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 18/168 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/168 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 177/345 variables, 168/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/345 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:36:50] [INFO ] Deduced a trap along path composed of 16 places in 25 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/345 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/345 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 47/392 variables, 33/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/392 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 8/400 variables, 4/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/400 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 5/405 variables, 3/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/405 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 1/406 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:36:50] [INFO ] Deduced a trap composed of 49 places in 36 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/406 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/406 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/406 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 406/406 variables, and 232 constraints, problems are : Problem set: 0 solved, 1 unsolved in 399 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 692ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 36 ms.
Support contains 1 out of 209 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 197/197 transitions.
Graph (complete) has 349 edges and 209 vertex of which 207 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 207 transition count 147
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 98 place count 159 transition count 147
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 98 place count 159 transition count 139
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 114 place count 151 transition count 139
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 194 place count 111 transition count 99
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 204 place count 106 transition count 99
Free-agglomeration rule (complex) applied 15 times.
Iterating global reduction 2 with 15 rules applied. Total rules applied 219 place count 106 transition count 84
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 234 place count 91 transition count 84
Partial Free-agglomeration rule applied 16 times.
Drop transitions (Partial Free agglomeration) removed 16 transitions
Iterating global reduction 3 with 16 rules applied. Total rules applied 250 place count 91 transition count 84
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 251 place count 90 transition count 83
Applied a total of 251 rules in 10 ms. Remains 90 /209 variables (removed 119) and now considering 83/197 (removed 114) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 90/209 places, 83/197 transitions.
RANDOM walk for 40000 steps (5113 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3348 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 3972 steps, run visited all 1 properties in 13 ms. (steps per millisecond=305 )
Probabilistic random walk after 3972 steps, saw 2056 distinct states, run finished after 13 ms. (steps per millisecond=305 ) properties seen :1
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p1))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 138 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[false, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), true, (NOT p0)]
Stuttering acceptance computed with spot in 173 ms :[false, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), true, (NOT p0)]
Stuttering acceptance computed with spot in 195 ms :[false, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), true, (NOT p0)]
Product exploration explored 100000 steps with 25106 reset in 78 ms.
Product exploration explored 100000 steps with 25048 reset in 85 ms.
Applying partial POR strategy [false, false, true, false, true, true]
Stuttering acceptance computed with spot in 197 ms :[false, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), true, (NOT p0)]
Support contains 3 out of 209 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Graph (complete) has 349 edges and 209 vertex of which 208 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 44 rules applied. Total rules applied 45 place count 208 transition count 196
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 9 Pre rules applied. Total rules applied 45 place count 208 transition count 202
Deduced a syphon composed of 53 places in 1 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 54 place count 208 transition count 202
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 58 place count 204 transition count 198
Deduced a syphon composed of 49 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 62 place count 204 transition count 198
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 88 places in 0 ms
Iterating global reduction 1 with 39 rules applied. Total rules applied 101 place count 204 transition count 206
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 102 place count 203 transition count 205
Deduced a syphon composed of 87 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 103 place count 203 transition count 205
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 94 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 110 place count 203 transition count 245
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 118 place count 195 transition count 229
Deduced a syphon composed of 86 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 126 place count 195 transition count 229
Deduced a syphon composed of 86 places in 1 ms
Applied a total of 126 rules in 33 ms. Remains 195 /209 variables (removed 14) and now considering 229/197 (removed -32) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 22:36:52] [INFO ] Redundant transitions in 8 ms returned []
Running 228 sub problems to find dead transitions.
// Phase 1: matrix 229 rows 195 cols
[2025-05-31 22:36:52] [INFO ] Computed 19 invariants in 3 ms
[2025-05-31 22:36:52] [INFO ] State equation strengthened by 8 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (OVERLAPS) 1/195 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 228 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:36:55] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:36:55] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
Problem TDEAD139 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 2/21 constraints. Problems are: Problem set: 1 solved, 227 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 227 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
At refinement iteration 6 (OVERLAPS) 229/424 variables, 195/216 constraints. Problems are: Problem set: 127 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/424 variables, 8/224 constraints. Problems are: Problem set: 127 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/424 variables, 0/224 constraints. Problems are: Problem set: 127 solved, 101 unsolved
At refinement iteration 9 (OVERLAPS) 0/424 variables, 0/224 constraints. Problems are: Problem set: 127 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 424/424 variables, and 224 constraints, problems are : Problem set: 127 solved, 101 unsolved in 14662 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 195/195 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 127 solved, 101 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 127 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 13/121 variables, 2/2 constraints. Problems are: Problem set: 127 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 2/4 constraints. Problems are: Problem set: 127 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/4 constraints. Problems are: Problem set: 127 solved, 101 unsolved
At refinement iteration 4 (OVERLAPS) 55/176 variables, 17/21 constraints. Problems are: Problem set: 127 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 0/21 constraints. Problems are: Problem set: 127 solved, 101 unsolved
At refinement iteration 6 (OVERLAPS) 229/405 variables, 176/197 constraints. Problems are: Problem set: 127 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/405 variables, 8/205 constraints. Problems are: Problem set: 127 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/405 variables, 101/306 constraints. Problems are: Problem set: 127 solved, 101 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/405 variables, 0/306 constraints. Problems are: Problem set: 127 solved, 101 unsolved
At refinement iteration 10 (OVERLAPS) 19/424 variables, 19/325 constraints. Problems are: Problem set: 127 solved, 101 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:37:15] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/424 variables, 1/326 constraints. Problems are: Problem set: 127 solved, 101 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/424 variables, 0/326 constraints. Problems are: Problem set: 127 solved, 101 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:37:29] [INFO ] Deduced a trap along path composed of 8 places in 27 ms of which 0 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/424 variables, 1/327 constraints. Problems are: Problem set: 127 solved, 101 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/424 variables, 0/327 constraints. Problems are: Problem set: 127 solved, 101 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 424/424 variables, and 327 constraints, problems are : Problem set: 127 solved, 101 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 195/195 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 101/228 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 44702ms problems are : Problem set: 127 solved, 101 unsolved
Search for dead transitions found 127 dead transitions in 44705ms
Found 127 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 127 transitions
Dead transitions reduction (with SMT) removed 127 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 195/209 places, 102/197 transitions.
Graph (complete) has 324 edges and 195 vertex of which 109 are kept as prefixes of interest. Removing 86 places using SCC suffix rule.1 ms
Discarding 86 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 109 /195 variables (removed 86) and now considering 102/102 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 109/209 places, 102/197 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 44757 ms. Remains : 109/209 places, 102/197 transitions.
Built C files in :
/tmp/ltsmin11008097036389290276
[2025-05-31 22:37:36] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11008097036389290276
Running compilation step : cd /tmp/ltsmin11008097036389290276;'/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 285 ms.
Running link step : cd /tmp/ltsmin11008097036389290276;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin11008097036389290276;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14831587542014476659.hoa' '--buchi-type=spotba'
LTSmin run took 1536 ms.
FORMULA DoubleExponent-PT-004-LTLFireability-10 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DoubleExponent-PT-004-LTLFireability-10 finished in 113592 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)||(p0&&F(p1)))))'
Support contains 2 out of 210 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 210/210 places, 197/197 transitions.
Applied a total of 0 rules in 7 ms. Remains 210 /210 variables (removed 0) and now considering 197/197 (removed 0) transitions.
// Phase 1: matrix 197 rows 210 cols
[2025-05-31 22:37:38] [INFO ] Computed 20 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:37:38] [INFO ] Implicit Places using invariants in 84 ms returned [84]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 85 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 209/210 places, 197/197 transitions.
Applied a total of 0 rules in 3 ms. Remains 209 /209 variables (removed 0) and now considering 197/197 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 95 ms. Remains : 209/210 places, 197/197 transitions.
Stuttering acceptance computed with spot in 131 ms :[true, (NOT p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DoubleExponent-PT-004-LTLFireability-12
Product exploration explored 100000 steps with 50000 reset in 93 ms.
Product exploration explored 100000 steps with 50000 reset in 107 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 349 edges and 209 vertex of which 207 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 14 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DoubleExponent-PT-004-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-004-LTLFireability-12 finished in 459 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 1 out of 210 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 210/210 places, 197/197 transitions.
Applied a total of 0 rules in 4 ms. Remains 210 /210 variables (removed 0) and now considering 197/197 (removed 0) transitions.
[2025-05-31 22:37:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:37:39] [INFO ] Implicit Places using invariants in 80 ms returned [84]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 84 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 209/210 places, 197/197 transitions.
Applied a total of 0 rules in 3 ms. Remains 209 /209 variables (removed 0) and now considering 197/197 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 92 ms. Remains : 209/210 places, 197/197 transitions.
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-004-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-004-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-004-LTLFireability-13 finished in 188 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F((p0 U (p1||G(p0)))))&&(p2||X(F((p2&&F(!p0))))))))'
Support contains 3 out of 210 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 210/210 places, 197/197 transitions.
Graph (complete) has 352 edges and 210 vertex of which 209 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 209 transition count 148
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 97 place count 161 transition count 148
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 97 place count 161 transition count 140
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 113 place count 153 transition count 140
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 185 place count 117 transition count 104
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 197 place count 111 transition count 104
Applied a total of 197 rules in 16 ms. Remains 111 /210 variables (removed 99) and now considering 104/197 (removed 93) transitions.
// Phase 1: matrix 104 rows 111 cols
[2025-05-31 22:37:39] [INFO ] Computed 20 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:37:39] [INFO ] Implicit Places using invariants in 73 ms returned [49]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 75 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 110/210 places, 104/197 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 108 transition count 102
Applied a total of 4 rules in 3 ms. Remains 108 /110 variables (removed 2) and now considering 102/104 (removed 2) transitions.
// Phase 1: matrix 102 rows 108 cols
[2025-05-31 22:37:39] [INFO ] Computed 19 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:37:39] [INFO ] Implicit Places using invariants in 68 ms returned []
[2025-05-31 22:37:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:37:39] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-05-31 22:37:39] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 108/210 places, 102/197 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 376 ms. Remains : 108/210 places, 102/197 transitions.
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p2)]
Running random walk in product with property : DoubleExponent-PT-004-LTLFireability-14
Product exploration explored 100000 steps with 8853 reset in 96 ms.
Product exploration explored 100000 steps with 8789 reset in 98 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Graph (complete) has 318 edges and 108 vertex of which 107 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 1 stabilizing places and 1 stable transitions
Detected a total of 1/108 stabilizing places and 1/102 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 p0 p2), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 151 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (3571 resets) in 57 ms. (689 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40001 steps (2448 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
[2025-05-31 22:37:40] [INFO ] Invariant cache hit.
[2025-05-31 22:37:40] [INFO ] State equation strengthened by 8 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 37/62 variables, 16/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 32/94 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/94 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/94 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 35/129 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/129 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/133 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/133 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/137 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/137 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 69/206 variables, 76/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/206 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:37:40] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/206 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/206 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (OVERLAPS) 4/210 variables, 4/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/210 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/210 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 136 constraints, problems are : Problem set: 0 solved, 1 unsolved in 157 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 108/108 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 37/62 variables, 16/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 32/94 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/94 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/94 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 35/129 variables, 10/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/129 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 4/133 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/133 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/137 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/137 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 69/206 variables, 76/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/206 variables, 5/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/206 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:37:40] [INFO ] Deduced a trap along path composed of 8 places in 23 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/206 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/206 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 4/210 variables, 4/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:37:40] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 5 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/210 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/210 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/210 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 139 constraints, problems are : Problem set: 0 solved, 1 unsolved in 225 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 108/108 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 386ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 10 ms.
Support contains 1 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 102/102 transitions.
Graph (complete) has 302 edges and 108 vertex of which 107 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 107 transition count 101
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 6 place count 105 transition count 99
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 1 with 13 rules applied. Total rules applied 19 place count 105 transition count 86
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 32 place count 92 transition count 86
Partial Free-agglomeration rule applied 17 times.
Drop transitions (Partial Free agglomeration) removed 17 transitions
Iterating global reduction 2 with 17 rules applied. Total rules applied 49 place count 92 transition count 86
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 91 transition count 85
Applied a total of 50 rules in 6 ms. Remains 91 /108 variables (removed 17) and now considering 85/102 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 91/108 places, 85/102 transitions.
RANDOM walk for 40000 steps (5122 resets) in 60 ms. (655 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (3412 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1732 steps, run visited all 1 properties in 7 ms. (steps per millisecond=247 )
Probabilistic random walk after 1732 steps, saw 897 distinct states, run finished after 8 ms. (steps per millisecond=216 ) properties seen :1
Knowledge obtained : [(AND p1 p0 p2), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 12 factoid took 347 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 108 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 : 108/108 places, 102/102 transitions.
Applied a total of 0 rules in 4 ms. Remains 108 /108 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2025-05-31 22:37:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:37:41] [INFO ] Implicit Places using invariants in 70 ms returned []
[2025-05-31 22:37:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:37:41] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-05-31 22:37:41] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 22:37:41] [INFO ] Redundant transitions in 1 ms returned []
Running 101 sub problems to find dead transitions.
[2025-05-31 22:37:41] [INFO ] Invariant cache hit.
[2025-05-31 22:37:41] [INFO ] State equation strengthened by 8 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (OVERLAPS) 1/108 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 102/210 variables, 108/127 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 8/135 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (OVERLAPS) 0/210 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 135 constraints, problems are : Problem set: 0 solved, 101 unsolved in 5021 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 108/108 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (OVERLAPS) 1/108 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 102/210 variables, 108/127 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 8/135 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 101/236 constraints. Problems are: Problem set: 0 solved, 101 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:37:48] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 101 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:37:51] [INFO ] Deduced a trap along path composed of 6 places in 38 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:37:51] [INFO ] Deduced a trap along path composed of 8 places in 35 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/210 variables, 2/239 constraints. Problems are: Problem set: 0 solved, 101 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:37:52] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/210 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/210 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 12 (OVERLAPS) 0/210 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 240 constraints, problems are : Problem set: 0 solved, 101 unsolved in 13523 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 108/108 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 18555ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 18557ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 18848 ms. Remains : 108/108 places, 102/102 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Graph (complete) has 318 edges and 108 vertex of which 107 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 99 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (3531 resets) in 51 ms. (769 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40002 steps (2468 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
[2025-05-31 22:38:00] [INFO ] Invariant cache hit.
[2025-05-31 22:38:00] [INFO ] State equation strengthened by 8 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 37/62 variables, 16/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 32/94 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/94 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/94 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 35/129 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/129 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/133 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/133 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/137 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/137 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 69/206 variables, 76/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/206 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:38:00] [INFO ] Deduced a trap along path composed of 2 places in 19 ms of which 0 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/206 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/206 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (OVERLAPS) 4/210 variables, 4/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/210 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/210 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 136 constraints, problems are : Problem set: 0 solved, 1 unsolved in 151 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 108/108 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 37/62 variables, 16/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 32/94 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/94 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/94 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 35/129 variables, 10/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/129 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 4/133 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/133 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/137 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/137 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 69/206 variables, 76/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/206 variables, 5/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/206 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:38:00] [INFO ] Deduced a trap along path composed of 8 places in 21 ms of which 0 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/206 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/206 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 4/210 variables, 4/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:38:00] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 5 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/210 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/210 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/210 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 139 constraints, problems are : Problem set: 0 solved, 1 unsolved in 213 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 108/108 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 366ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 10 ms.
Support contains 1 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 102/102 transitions.
Graph (complete) has 302 edges and 108 vertex of which 107 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 107 transition count 101
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 6 place count 105 transition count 99
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 1 with 13 rules applied. Total rules applied 19 place count 105 transition count 86
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 32 place count 92 transition count 86
Partial Free-agglomeration rule applied 17 times.
Drop transitions (Partial Free agglomeration) removed 17 transitions
Iterating global reduction 2 with 17 rules applied. Total rules applied 49 place count 92 transition count 86
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 91 transition count 85
Applied a total of 50 rules in 7 ms. Remains 91 /108 variables (removed 17) and now considering 85/102 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 91/108 places, 85/102 transitions.
RANDOM walk for 40000 steps (5016 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3377 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1732 steps, run visited all 1 properties in 7 ms. (steps per millisecond=247 )
Probabilistic random walk after 1732 steps, saw 897 distinct states, run finished after 7 ms. (steps per millisecond=247 ) properties seen :1
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 189 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 8865 reset in 81 ms.
Product exploration explored 100000 steps with 8803 reset in 85 ms.
Built C files in :
/tmp/ltsmin4336077231787571608
[2025-05-31 22:38:01] [INFO ] Computing symmetric may disable matrix : 102 transitions.
[2025-05-31 22:38:01] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 22:38:01] [INFO ] Computing symmetric may enable matrix : 102 transitions.
[2025-05-31 22:38:01] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 22:38:01] [INFO ] Computing Do-Not-Accords matrix : 102 transitions.
[2025-05-31 22:38:01] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 22:38:01] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4336077231787571608
Running compilation step : cd /tmp/ltsmin4336077231787571608;'/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 215 ms.
Running link step : cd /tmp/ltsmin4336077231787571608;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin4336077231787571608;'/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/stateBased12696846534915569993.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 102/102 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 5 ms. Remains 107 /108 variables (removed 1) and now considering 101/102 (removed 1) transitions.
// Phase 1: matrix 101 rows 107 cols
[2025-05-31 22:38:16] [INFO ] Computed 19 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:38:16] [INFO ] Implicit Places using invariants in 80 ms returned []
[2025-05-31 22:38:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:38:16] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-05-31 22:38:16] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 22:38:16] [INFO ] Redundant transitions in 1 ms returned []
Running 100 sub problems to find dead transitions.
[2025-05-31 22:38:16] [INFO ] Invariant cache hit.
[2025-05-31 22:38:16] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (OVERLAPS) 101/207 variables, 106/125 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 6/131 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (OVERLAPS) 1/208 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 0/208 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 132 constraints, problems are : Problem set: 0 solved, 100 unsolved in 4979 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 107/107 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (OVERLAPS) 101/207 variables, 106/125 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 6/131 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 97/228 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 1/208 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 3/232 constraints. Problems are: Problem set: 0 solved, 100 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:38:29] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/208 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 11 (OVERLAPS) 0/208 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 233 constraints, problems are : Problem set: 0 solved, 100 unsolved in 13941 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 107/107 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18932ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 18933ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 19247 ms. Remains : 107/108 places, 101/102 transitions.
Built C files in :
/tmp/ltsmin2334393210406829585
[2025-05-31 22:38:35] [INFO ] Computing symmetric may disable matrix : 101 transitions.
[2025-05-31 22:38:35] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 22:38:35] [INFO ] Computing symmetric may enable matrix : 101 transitions.
[2025-05-31 22:38:35] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 22:38:35] [INFO ] Computing Do-Not-Accords matrix : 101 transitions.
[2025-05-31 22:38:35] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 22:38:35] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2334393210406829585
Running compilation step : cd /tmp/ltsmin2334393210406829585;'/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 222 ms.
Running link step : cd /tmp/ltsmin2334393210406829585;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin2334393210406829585;'/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/stateBased10347686843576958714.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-31 22:38:51] [INFO ] Flatten gal took : 6 ms
[2025-05-31 22:38:51] [INFO ] Flatten gal took : 6 ms
[2025-05-31 22:38:51] [INFO ] Time to serialize gal into /tmp/LTL11785595513051354719.gal : 1 ms
[2025-05-31 22:38:51] [INFO ] Time to serialize properties into /tmp/LTL1154688186889665307.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/LTL11785595513051354719.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17463048219451775282.hoa' '-atoms' '/tmp/LTL1154688186889665307.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/LTL1154688186889665307.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17463048219451775282.hoa
Detected timeout of ITS tools.
[2025-05-31 22:39:06] [INFO ] Flatten gal took : 5 ms
[2025-05-31 22:39:06] [INFO ] Flatten gal took : 5 ms
[2025-05-31 22:39:06] [INFO ] Time to serialize gal into /tmp/LTL4095317361817082206.gal : 1 ms
[2025-05-31 22:39:06] [INFO ] Time to serialize properties into /tmp/LTL2607925494370819043.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/LTL4095317361817082206.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2607925494370819043.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F((G(F(("(p120<1)")U(("((p120<1)&&(p19<1))")||(G("(p120<1)"))))))&&(("(p1>=1)")||(X(F(("(p1>=1)")&&(F("(p120>=1)")))))))))
Formula 0 simplified : FG(!"(p120<1)" M !"((p120<1)&&(p19<1))") | G(!"(p1>=1)" & XG(!"(p1>=1)" | G!"(p120>=1)"))
Detected timeout of ITS tools.
[2025-05-31 22:39:21] [INFO ] Flatten gal took : 11 ms
[2025-05-31 22:39:21] [INFO ] Applying decomposition
[2025-05-31 22:39:21] [INFO ] Flatten gal took : 5 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/graph10527447489595189691.txt' '-o' '/tmp/graph10527447489595189691.bin' '-w' '/tmp/graph10527447489595189691.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10527447489595189691.bin' '-l' '-1' '-v' '-w' '/tmp/graph10527447489595189691.weights' '-q' '0' '-e' '0.001'
[2025-05-31 22:39:21] [INFO ] Decomposing Gal with order
[2025-05-31 22:39:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 22:39:21] [INFO ] Removed a total of 71 redundant transitions.
[2025-05-31 22:39:21] [INFO ] Flatten gal took : 13 ms
[2025-05-31 22:39:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2025-05-31 22:39:21] [INFO ] Time to serialize gal into /tmp/LTL5736964142633781571.gal : 3 ms
[2025-05-31 22:39:21] [INFO ] Time to serialize properties into /tmp/LTL10893626268516317704.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/LTL5736964142633781571.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10893626268516317704.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F((G(F(("(i0.u5.p120<1)")U(("((i0.u5.p120<1)&&(i3.i1.u29.p19<1))")||(G("(i0.u5.p120<1)"))))))&&(("(i3.i0.u3.p1>=1)")||(X(F(("(i3.i0...198
Formula 0 simplified : FG(!"(i0.u5.p120<1)" M !"((i0.u5.p120<1)&&(i3.i1.u29.p19<1))") | G(!"(i3.i0.u3.p1>=1)" & XG(!"(i3.i0.u3.p1>=1)" | G!"(i0.u5.p120>=1)...158
Detected timeout of ITS tools.
Treatment of property DoubleExponent-PT-004-LTLFireability-14 finished in 116841 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0)||X(X(F((!p0&&F(p1)))))))'
Support contains 3 out of 210 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 210/210 places, 197/197 transitions.
Applied a total of 0 rules in 6 ms. Remains 210 /210 variables (removed 0) and now considering 197/197 (removed 0) transitions.
// Phase 1: matrix 197 rows 210 cols
[2025-05-31 22:39:36] [INFO ] Computed 20 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:39:36] [INFO ] Implicit Places using invariants in 79 ms returned [84]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 79 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 209/210 places, 197/197 transitions.
Applied a total of 0 rules in 2 ms. Remains 209 /209 variables (removed 0) and now considering 197/197 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 88 ms. Remains : 209/210 places, 197/197 transitions.
Stuttering acceptance computed with spot in 270 ms :[(OR (NOT p1) p0), (NOT p1), (OR (NOT p1) p0), p0, p0, p0, (AND (NOT p1) p0)]
Running random walk in product with property : DoubleExponent-PT-004-LTLFireability-15
Stuttering criterion allowed to conclude after 259 steps with 9 reset in 1 ms.
FORMULA DoubleExponent-PT-004-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-004-LTLFireability-15 finished in 385 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p0)||X((X(!p1)&&F(p2)))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F((p0 U (p1||G(p0)))))&&(p2||X(F((p2&&F(!p0))))))))'
[2025-05-31 22:39:36] [INFO ] Flatten gal took : 16 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6843656339335482210
[2025-05-31 22:39:36] [INFO ] Computing symmetric may disable matrix : 197 transitions.
[2025-05-31 22:39:36] [INFO ] Applying decomposition
[2025-05-31 22:39:36] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 22:39:36] [INFO ] Computing symmetric may enable matrix : 197 transitions.
[2025-05-31 22:39:36] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 22:39:36] [INFO ] Flatten gal took : 8 ms
[2025-05-31 22:39:36] [INFO ] Computing Do-Not-Accords matrix : 197 transitions.
[2025-05-31 22:39:36] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 22:39:36] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6843656339335482210
Running compilation step : cd /tmp/ltsmin6843656339335482210;'/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'
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/graph10738495035328371780.txt' '-o' '/tmp/graph10738495035328371780.bin' '-w' '/tmp/graph10738495035328371780.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10738495035328371780.bin' '-l' '-1' '-v' '-w' '/tmp/graph10738495035328371780.weights' '-q' '0' '-e' '0.001'
[2025-05-31 22:39:36] [INFO ] Decomposing Gal with order
[2025-05-31 22:39:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 22:39:36] [INFO ] Removed a total of 48 redundant transitions.
[2025-05-31 22:39:36] [INFO ] Flatten gal took : 17 ms
[2025-05-31 22:39:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 4 ms.
[2025-05-31 22:39:36] [INFO ] Time to serialize gal into /tmp/LTLFireability6341557202657964507.gal : 4 ms
[2025-05-31 22:39:36] [INFO ] Time to serialize properties into /tmp/LTLFireability10312100348675688606.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/LTLFireability6341557202657964507.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10312100348675688606.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 : !((F(G((F("(((i4.i0.u29.p124<1)||(i4.i3.u22.p149<1))&&((i2.i0.u47.p142<1)||(i2.i2.u52.p212<1)))"))||(X((X(!("((i2.i0.u47.p142>=1)&&(i2...209
Formula 0 simplified : G(FG!"(((i4.i0.u29.p124<1)||(i4.i3.u22.p149<1))&&((i2.i0.u47.p142<1)||(i2.i2.u52.p212<1)))" & F("((i2.i0.u47.p142>=1)&&(i2.i2.u52.p2...190
Compilation finished in 356 ms.
Running link step : cd /tmp/ltsmin6843656339335482210;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin6843656339335482210;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((<>((LTLAPp0==true))||X((X(!(LTLAPp1==true))&&<>((LTLAPp2==true)))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.005: LTL layer: formula: <>([]((<>((LTLAPp0==true))||X((X(!(LTLAPp1==true))&&<>((LTLAPp2==true)))))))
pins2lts-mc-linux64( 5/ 8), 0.005: "<>([]((<>((LTLAPp0==true))||X((X(!(LTLAPp1==true))&&<>((LTLAPp2==true)))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.005: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.044: There are 204 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.044: State length is 211, there are 207 groups
pins2lts-mc-linux64( 0/ 8), 0.044: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.044: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.044: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.044: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 4/ 8), 0.063: [Blue] ~107 levels ~960 states ~1064 transitions
pins2lts-mc-linux64( 2/ 8), 0.073: [Blue] ~184 levels ~1920 states ~2128 transitions
pins2lts-mc-linux64( 2/ 8), 0.088: [Blue] ~234 levels ~3840 states ~4288 transitions
pins2lts-mc-linux64( 4/ 8), 0.119: [Blue] ~516 levels ~7680 states ~8584 transitions
pins2lts-mc-linux64( 1/ 8), 0.165: [Blue] ~885 levels ~15360 states ~17240 transitions
pins2lts-mc-linux64( 4/ 8), 0.280: [Blue] ~1127 levels ~30720 states ~34352 transitions
pins2lts-mc-linux64( 1/ 8), 0.508: [Blue] ~1358 levels ~61440 states ~68312 transitions
pins2lts-mc-linux64( 4/ 8), 0.932: [Blue] ~1383 levels ~122880 states ~137376 transitions
pins2lts-mc-linux64( 4/ 8), 1.704: [Blue] ~1518 levels ~245760 states ~274536 transitions
pins2lts-mc-linux64( 5/ 8), 2.925: [Blue] ~2496 levels ~491520 states ~548656 transitions
pins2lts-mc-linux64( 5/ 8), 4.914: [Blue] ~4105 levels ~983040 states ~1096832 transitions
pins2lts-mc-linux64( 3/ 8), 8.008: [Blue] ~6634 levels ~1966080 states ~2200528 transitions
pins2lts-mc-linux64( 3/ 8), 14.703: [Blue] ~13717 levels ~3932160 states ~4402856 transitions
pins2lts-mc-linux64( 3/ 8), 28.090: [Blue] ~25517 levels ~7864320 states ~8770024 transitions
pins2lts-mc-linux64( 3/ 8), 54.987: [Blue] ~33800 levels ~15728640 states ~17473696 transitions
pins2lts-mc-linux64( 5/ 8), 108.527: [Blue] ~19696 levels ~31457280 states ~34848928 transitions
pins2lts-mc-linux64( 5/ 8), 214.840: [Blue] ~20047 levels ~62914560 states ~69657792 transitions
pins2lts-mc-linux64( 5/ 8), 429.904: [Blue] ~20444 levels ~125829120 states ~139274696 transitions
pins2lts-mc-linux64( 1/ 8), 513.807: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 513.835:
pins2lts-mc-linux64( 0/ 8), 513.835: Explored 146608900 states 162531629 transitions, fanout: 1.109
pins2lts-mc-linux64( 0/ 8), 513.835: Total exploration time 513.780 sec (513.750 sec minimum, 513.760 sec on average)
pins2lts-mc-linux64( 0/ 8), 513.835: States per second: 285353, Transitions per second: 316345
pins2lts-mc-linux64( 0/ 8), 513.835:
pins2lts-mc-linux64( 0/ 8), 513.835: State space has 134217315 states, 1241 are accepting
pins2lts-mc-linux64( 0/ 8), 513.835: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 513.835: blue states: 146608900 (109.23%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 513.835: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 513.835: all-red states: 1241 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 513.835:
pins2lts-mc-linux64( 0/ 8), 513.835: Total memory used for local state coloring: 20.2MB
pins2lts-mc-linux64( 0/ 8), 513.835:
pins2lts-mc-linux64( 0/ 8), 513.835: Queue width: 8B, total height: 1322622, memory: 10.09MB
pins2lts-mc-linux64( 0/ 8), 513.835: Tree memory: 1099.9MB, 8.6 B/state, compr.: 1.0%
pins2lts-mc-linux64( 0/ 8), 513.835: Tree fill ratio (roots/leafs): 99.0%/29.0%
pins2lts-mc-linux64( 0/ 8), 513.835: Stored 204 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 513.835: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 513.835: Est. total memory use: 1110.0MB (~1034.1MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin6843656339335482210;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((<>((LTLAPp0==true))||X((X(!(LTLAPp1==true))&&<>((LTLAPp2==true)))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin6843656339335482210;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((<>((LTLAPp0==true))||X((X(!(LTLAPp1==true))&&<>((LTLAPp2==true)))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:1583)
Detected timeout of ITS tools.
[2025-05-31 23:02:45] [INFO ] Flatten gal took : 9 ms
[2025-05-31 23:02:45] [INFO ] Time to serialize gal into /tmp/LTLFireability16527471500038282913.gal : 1 ms
[2025-05-31 23:02:45] [INFO ] Time to serialize properties into /tmp/LTLFireability309335881365392592.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/LTLFireability16527471500038282913.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability309335881365392592.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...297
Read 2 LTL properties
Checking formula 0 : !((F(G((F("(((p124<1)||(p149<1))&&((p142<1)||(p212<1)))"))||(X((X(!("((p142>=1)&&(p212>=1))")))&&(F("(p133<1)"))))))))
Formula 0 simplified : G(FG!"(((p124<1)||(p149<1))&&((p142<1)||(p212<1)))" & F("((p142>=1)&&(p212>=1))" | G!"(p133<1)"))
Detected timeout of ITS tools.
[2025-05-31 23:25:53] [INFO ] Flatten gal took : 10 ms
[2025-05-31 23:25:53] [INFO ] Input system was already deterministic with 197 transitions.
[2025-05-31 23:25:53] [INFO ] Transformed 210 places.
[2025-05-31 23:25:53] [INFO ] Transformed 197 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2025-05-31 23:25:53] [INFO ] Time to serialize gal into /tmp/LTLFireability8059931544616765624.gal : 2 ms
[2025-05-31 23:25:53] [INFO ] Time to serialize properties into /tmp/LTLFireability4977164105141982174.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/LTLFireability8059931544616765624.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4977164105141982174.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--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...342
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G((F("(((p124<1)||(p149<1))&&((p142<1)||(p212<1)))"))||(X((X(!("((p142>=1)&&(p212>=1))")))&&(F("(p133<1)"))))))))
Formula 0 simplified : G(FG!"(((p124<1)||(p149<1))&&((p142<1)||(p212<1)))" & F("((p142>=1)&&(p212>=1))" | G!"(p133<1)"))

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DoubleExponent-PT-004"
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 DoubleExponent-PT-004, 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 r072-tall-174860067500484"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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