Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K 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.0K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 82K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K 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 3.9K 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 795K 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 ASLink-PT-05b-LTLFireability-00
FORMULA_NAME ASLink-PT-05b-LTLFireability-01
FORMULA_NAME ASLink-PT-05b-LTLFireability-02
FORMULA_NAME ASLink-PT-05b-LTLFireability-03
FORMULA_NAME ASLink-PT-05b-LTLFireability-04
FORMULA_NAME ASLink-PT-05b-LTLFireability-05
FORMULA_NAME ASLink-PT-05b-LTLFireability-06
FORMULA_NAME ASLink-PT-05b-LTLFireability-07
FORMULA_NAME ASLink-PT-05b-LTLFireability-08
FORMULA_NAME ASLink-PT-05b-LTLFireability-09
FORMULA_NAME ASLink-PT-05b-LTLFireability-10
FORMULA_NAME ASLink-PT-05b-LTLFireability-11
FORMULA_NAME ASLink-PT-05b-LTLFireability-12
FORMULA_NAME ASLink-PT-05b-LTLFireability-13
FORMULA_NAME ASLink-PT-05b-LTLFireability-14
FORMULA_NAME ASLink-PT-05b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748584627816

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-05b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-30 05:57:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 05:57:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 05:57:09] [INFO ] Load time of PNML (sax parser for PT used): 165 ms
[2025-05-30 05:57:09] [INFO ] Transformed 2430 places.
[2025-05-30 05:57:09] [INFO ] Transformed 3040 transitions.
[2025-05-30 05:57:09] [INFO ] Found NUPN structural information;
[2025-05-30 05:57:09] [INFO ] Parsed PT model containing 2430 places and 3040 transitions and 9292 arcs in 299 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ASLink-PT-05b-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05b-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05b-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 55 out of 2430 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2430/2430 places, 3040/3040 transitions.
Discarding 148 places :
Symmetric choice reduction at 0 with 148 rule applications. Total rules 148 place count 2282 transition count 2892
Iterating global reduction 0 with 148 rules applied. Total rules applied 296 place count 2282 transition count 2892
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 297 place count 2282 transition count 2891
Discarding 58 places :
Symmetric choice reduction at 1 with 58 rule applications. Total rules 355 place count 2224 transition count 2800
Iterating global reduction 1 with 58 rules applied. Total rules applied 413 place count 2224 transition count 2800
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 431 place count 2224 transition count 2782
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 439 place count 2216 transition count 2774
Iterating global reduction 2 with 8 rules applied. Total rules applied 447 place count 2216 transition count 2774
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 450 place count 2213 transition count 2771
Iterating global reduction 2 with 3 rules applied. Total rules applied 453 place count 2213 transition count 2771
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 455 place count 2211 transition count 2769
Iterating global reduction 2 with 2 rules applied. Total rules applied 457 place count 2211 transition count 2769
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 459 place count 2209 transition count 2767
Iterating global reduction 2 with 2 rules applied. Total rules applied 461 place count 2209 transition count 2767
Applied a total of 461 rules in 1573 ms. Remains 2209 /2430 variables (removed 221) and now considering 2767/3040 (removed 273) transitions.
// Phase 1: matrix 2767 rows 2209 cols
[2025-05-30 05:57:11] [INFO ] Computed 238 invariants in 113 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:57:12] [INFO ] Implicit Places using invariants in 1699 ms returned [2043, 2054, 2065, 2073, 2081, 2089, 2097, 2108, 2116, 2124, 2135]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 1736 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2198/2430 places, 2767/3040 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 2185 transition count 2754
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 2185 transition count 2754
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 36 place count 2175 transition count 2744
Iterating global reduction 0 with 10 rules applied. Total rules applied 46 place count 2175 transition count 2744
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 54 place count 2167 transition count 2736
Iterating global reduction 0 with 8 rules applied. Total rules applied 62 place count 2167 transition count 2736
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 65 place count 2164 transition count 2733
Iterating global reduction 0 with 3 rules applied. Total rules applied 68 place count 2164 transition count 2733
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 70 place count 2162 transition count 2731
Iterating global reduction 0 with 2 rules applied. Total rules applied 72 place count 2162 transition count 2731
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 74 place count 2160 transition count 2729
Iterating global reduction 0 with 2 rules applied. Total rules applied 76 place count 2160 transition count 2729
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 2159 transition count 2728
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 2159 transition count 2728
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 2158 transition count 2727
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 2158 transition count 2727
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 2157 transition count 2726
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 2157 transition count 2726
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 2156 transition count 2725
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 2156 transition count 2725
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 2155 transition count 2724
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 2155 transition count 2724
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 2154 transition count 2723
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 2154 transition count 2723
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 2153 transition count 2722
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 2153 transition count 2722
Applied a total of 90 rules in 1835 ms. Remains 2153 /2198 variables (removed 45) and now considering 2722/2767 (removed 45) transitions.
// Phase 1: matrix 2722 rows 2153 cols
[2025-05-30 05:57:14] [INFO ] Computed 227 invariants in 59 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:57:15] [INFO ] Implicit Places using invariants in 1214 ms returned []
[2025-05-30 05:57:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:57:21] [INFO ] Implicit Places using invariants and state equation in 5812 ms returned []
Implicit Place search using SMT with State Equation took 7030 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 2153/2430 places, 2722/3040 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 12188 ms. Remains : 2153/2430 places, 2722/3040 transitions.
Support contains 55 out of 2153 places after structural reductions.
[2025-05-30 05:57:22] [INFO ] Flatten gal took : 185 ms
[2025-05-30 05:57:22] [INFO ] Flatten gal took : 126 ms
[2025-05-30 05:57:22] [INFO ] Input system was already deterministic with 2722 transitions.
Support contains 53 out of 2153 places (down from 55) after GAL structural reductions.
RANDOM walk for 40000 steps (76 resets) in 1851 ms. (21 steps per ms) remains 18/35 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 18/18 properties
[2025-05-30 05:57:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 202/233 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 414/647 variables, 50/55 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/647 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 1425/2072 variables, 164/219 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:57:24] [INFO ] Deduced a trap composed of 88 places in 351 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:57:25] [INFO ] Deduced a trap composed of 64 places in 357 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:57:25] [INFO ] Deduced a trap composed of 38 places in 194 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:57:26] [INFO ] Deduced a trap composed of 41 places in 447 ms of which 77 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/2072 variables, 4/223 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2072/4875 variables, and 223 constraints, problems are : Problem set: 0 solved, 18 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 164/172 constraints, State Equation: 0/2153 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 202/233 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 414/647 variables, 50/55 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/647 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 1425/2072 variables, 164/219 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2072 variables, 4/223 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:57:29] [INFO ] Deduced a trap composed of 17 places in 456 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:57:29] [INFO ] Deduced a trap composed of 23 places in 444 ms of which 45 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2072 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:57:31] [INFO ] Deduced a trap composed of 73 places in 349 ms of which 62 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/2072 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:57:33] [INFO ] Deduced a trap composed of 73 places in 170 ms of which 28 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2072/4875 variables, and 227 constraints, problems are : Problem set: 0 solved, 18 unsolved in 5007 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 164/172 constraints, State Equation: 0/2153 constraints, PredecessorRefiner: 0/18 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10085ms problems are : Problem set: 0 solved, 18 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 31 out of 2153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2153/2153 places, 2722/2722 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 385 transitions
Trivial Post-agglo rules discarded 385 transitions
Performed 385 trivial Post agglomeration. Transition count delta: 385
Iterating post reduction 0 with 385 rules applied. Total rules applied 385 place count 2153 transition count 2337
Reduce places removed 385 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 388 rules applied. Total rules applied 773 place count 1768 transition count 2334
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 777 place count 1766 transition count 2332
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 779 place count 1764 transition count 2332
Performed 573 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 573 Pre rules applied. Total rules applied 779 place count 1764 transition count 1759
Deduced a syphon composed of 573 places in 2 ms
Ensure Unique test removed 52 places
Reduce places removed 625 places and 0 transitions.
Iterating global reduction 4 with 1198 rules applied. Total rules applied 1977 place count 1139 transition count 1759
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 4 with 39 rules applied. Total rules applied 2016 place count 1133 transition count 1726
Reduce places removed 33 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 34 rules applied. Total rules applied 2050 place count 1100 transition count 1725
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2051 place count 1099 transition count 1725
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 20 Pre rules applied. Total rules applied 2051 place count 1099 transition count 1705
Deduced a syphon composed of 20 places in 3 ms
Ensure Unique test removed 20 places
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 7 with 60 rules applied. Total rules applied 2111 place count 1059 transition count 1705
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 19 Pre rules applied. Total rules applied 2111 place count 1059 transition count 1686
Deduced a syphon composed of 19 places in 9 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 7 with 38 rules applied. Total rules applied 2149 place count 1040 transition count 1686
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 2152 place count 1037 transition count 1683
Iterating global reduction 7 with 3 rules applied. Total rules applied 2155 place count 1037 transition count 1683
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 2155 place count 1037 transition count 1682
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 2157 place count 1036 transition count 1682
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 2159 place count 1034 transition count 1673
Iterating global reduction 7 with 2 rules applied. Total rules applied 2161 place count 1034 transition count 1673
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2162 place count 1033 transition count 1665
Iterating global reduction 7 with 1 rules applied. Total rules applied 2163 place count 1033 transition count 1665
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2164 place count 1032 transition count 1657
Iterating global reduction 7 with 1 rules applied. Total rules applied 2165 place count 1032 transition count 1657
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2166 place count 1031 transition count 1649
Iterating global reduction 7 with 1 rules applied. Total rules applied 2167 place count 1031 transition count 1649
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2168 place count 1030 transition count 1641
Iterating global reduction 7 with 1 rules applied. Total rules applied 2169 place count 1030 transition count 1641
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2170 place count 1029 transition count 1633
Iterating global reduction 7 with 1 rules applied. Total rules applied 2171 place count 1029 transition count 1633
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2172 place count 1028 transition count 1625
Iterating global reduction 7 with 1 rules applied. Total rules applied 2173 place count 1028 transition count 1625
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2174 place count 1027 transition count 1617
Iterating global reduction 7 with 1 rules applied. Total rules applied 2175 place count 1027 transition count 1617
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2176 place count 1026 transition count 1609
Iterating global reduction 7 with 1 rules applied. Total rules applied 2177 place count 1026 transition count 1609
Performed 169 Post agglomeration using F-continuation condition.Transition count delta: 169
Deduced a syphon composed of 169 places in 3 ms
Ensure Unique test removed 2 places
Reduce places removed 171 places and 0 transitions.
Iterating global reduction 7 with 340 rules applied. Total rules applied 2517 place count 855 transition count 1440
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2521 place count 851 transition count 1436
Ensure Unique test removed 1 places
Iterating global reduction 7 with 5 rules applied. Total rules applied 2526 place count 850 transition count 1436
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 2527 place count 850 transition count 1435
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2528 place count 849 transition count 1435
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 2528 place count 849 transition count 1434
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2530 place count 848 transition count 1434
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 2532 place count 846 transition count 1432
Iterating global reduction 9 with 2 rules applied. Total rules applied 2534 place count 846 transition count 1432
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 9 with 2 rules applied. Total rules applied 2536 place count 846 transition count 1430
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 2537 place count 845 transition count 1430
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 2539 place count 844 transition count 1435
Free-agglomeration rule applied 6 times.
Iterating global reduction 11 with 6 rules applied. Total rules applied 2545 place count 844 transition count 1429
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 2551 place count 838 transition count 1429
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 12 with 3 rules applied. Total rules applied 2554 place count 838 transition count 1426
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 12 with 3 rules applied. Total rules applied 2557 place count 835 transition count 1426
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 13 with 5 rules applied. Total rules applied 2562 place count 835 transition count 1426
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 2563 place count 834 transition count 1425
Reduce places removed 9 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 13 with 12 rules applied. Total rules applied 2575 place count 825 transition count 1422
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 14 with 4 rules applied. Total rules applied 2579 place count 822 transition count 1421
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 2580 place count 821 transition count 1421
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 13 Pre rules applied. Total rules applied 2580 place count 821 transition count 1408
Deduced a syphon composed of 13 places in 30 ms
Ensure Unique test removed 1 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 16 with 27 rules applied. Total rules applied 2607 place count 807 transition count 1408
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 16 with 6 rules applied. Total rules applied 2613 place count 801 transition count 1408
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 17 with 1 Pre rules applied. Total rules applied 2613 place count 801 transition count 1407
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 17 with 2 rules applied. Total rules applied 2615 place count 800 transition count 1407
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 17 with 22 rules applied. Total rules applied 2637 place count 789 transition count 1396
Discarding 5 places :
Symmetric choice reduction at 17 with 5 rule applications. Total rules 2642 place count 784 transition count 1391
Iterating global reduction 17 with 5 rules applied. Total rules applied 2647 place count 784 transition count 1391
Free-agglomeration rule applied 5 times.
Iterating global reduction 17 with 5 rules applied. Total rules applied 2652 place count 784 transition count 1386
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 17 with 5 rules applied. Total rules applied 2657 place count 779 transition count 1386
Applied a total of 2657 rules in 1268 ms. Remains 779 /2153 variables (removed 1374) and now considering 1386/2722 (removed 1336) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1268 ms. Remains : 779/2153 places, 1386/2722 transitions.
RANDOM walk for 40000 steps (438 resets) in 459 ms. (86 steps per ms) remains 17/18 properties
BEST_FIRST walk for 4002 steps (9 resets) in 18 ms. (210 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (9 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (9 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (9 resets) in 10 ms. (363 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (9 resets) in 21 ms. (181 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (9 resets) in 10 ms. (364 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (9 resets) in 10 ms. (364 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (9 resets) in 12 ms. (307 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (8 resets) in 9 ms. (400 steps per ms) remains 17/17 properties
Interrupted probabilistic random walk after 225741 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :0 out of 17
Probabilistic random walk after 225741 steps, saw 55788 distinct states, run finished after 3007 ms. (steps per millisecond=75 ) properties seen :0
// Phase 1: matrix 1386 rows 779 cols
[2025-05-30 05:57:37] [INFO ] Computed 130 invariants in 16 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 95/124 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 13/137 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 391/528 variables, 46/60 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/528 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 66/594 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:57:38] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 8 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/594 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/594 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 2/596 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/596 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (OVERLAPS) 168/764 variables, 43/126 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/764 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 14 (OVERLAPS) 2/766 variables, 2/128 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/766 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 16 (OVERLAPS) 13/779 variables, 3/131 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/779 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 18 (OVERLAPS) 1386/2165 variables, 779/910 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2165 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 20 (OVERLAPS) 0/2165 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2165/2165 variables, and 910 constraints, problems are : Problem set: 0 solved, 17 unsolved in 6453 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, Generalized P Invariants (flows): 92/92 constraints, State Equation: 779/779 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 95/124 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 13/137 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 391/528 variables, 46/60 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/528 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:57:44] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/528 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/528 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 66/594 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:57:45] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/594 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/594 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (OVERLAPS) 2/596 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/596 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 14 (OVERLAPS) 168/764 variables, 43/128 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/764 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 16 (OVERLAPS) 2/766 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/766 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 18 (OVERLAPS) 13/779 variables, 3/133 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/779 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp31 is UNSAT
At refinement iteration 20 (OVERLAPS) 1386/2165 variables, 779/912 constraints. Problems are: Problem set: 11 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2165 variables, 6/918 constraints. Problems are: Problem set: 11 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2165 variables, 0/918 constraints. Problems are: Problem set: 11 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 0/2165 variables, 0/918 constraints. Problems are: Problem set: 11 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2165/2165 variables, and 918 constraints, problems are : Problem set: 11 solved, 6 unsolved in 7858 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, Generalized P Invariants (flows): 92/92 constraints, State Equation: 779/779 constraints, PredecessorRefiner: 6/17 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14350ms problems are : Problem set: 11 solved, 6 unsolved
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 1 properties in 2181 ms.
Support contains 8 out of 779 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 779/779 places, 1386/1386 transitions.
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 0 place count 779 transition count 1376
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 769 transition count 1376
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 768 transition count 1368
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 768 transition count 1368
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 767 transition count 1360
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 767 transition count 1360
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 766 transition count 1352
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 766 transition count 1352
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 765 transition count 1344
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 765 transition count 1344
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 764 transition count 1336
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 764 transition count 1336
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 763 transition count 1328
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 763 transition count 1328
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 762 transition count 1320
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 762 transition count 1320
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 761 transition count 1319
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 37 place count 760 transition count 1318
Applied a total of 37 rules in 199 ms. Remains 760 /779 variables (removed 19) and now considering 1318/1386 (removed 68) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 199 ms. Remains : 760/779 places, 1318/1386 transitions.
RANDOM walk for 40000 steps (461 resets) in 211 ms. (188 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (68 resets) in 97 ms. (408 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (89 resets) in 117 ms. (339 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (93 resets) in 101 ms. (392 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (90 resets) in 107 ms. (370 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (92 resets) in 72 ms. (548 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 272689 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :0 out of 5
Probabilistic random walk after 272689 steps, saw 64761 distinct states, run finished after 3001 ms. (steps per millisecond=90 ) properties seen :0
// Phase 1: matrix 1318 rows 760 cols
[2025-05-30 05:57:57] [INFO ] Computed 130 invariants in 14 ms
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 81/89 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 13/102 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 260/362 variables, 36/48 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:57:58] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/362 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/362 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 66/428 variables, 15/64 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/428 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 2/430 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/430 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 243/673 variables, 43/109 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/673 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 14/687 variables, 6/115 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/687 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 72/759 variables, 15/130 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/759 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 1/760 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/760 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 1318/2078 variables, 760/891 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2078 variables, 0/891 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 0/2078 variables, 0/891 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2078/2078 variables, and 891 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1907 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 94/94 constraints, State Equation: 760/760 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 81/89 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 13/102 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 260/362 variables, 36/48 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/362 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/362 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 66/428 variables, 15/64 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:58:00] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/428 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/428 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 2/430 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/430 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 243/673 variables, 43/110 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/673 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 14/687 variables, 6/116 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/687 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 72/759 variables, 15/131 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/759 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 1/760 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/760 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 1318/2078 variables, 760/892 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2078 variables, 5/897 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2078 variables, 0/897 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (OVERLAPS) 0/2078 variables, 0/897 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2078/2078 variables, and 897 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2450 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 94/94 constraints, State Equation: 760/760 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4387ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1002 ms.
Support contains 8 out of 760 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 760/760 places, 1318/1318 transitions.
Applied a total of 0 rules in 25 ms. Remains 760 /760 variables (removed 0) and now considering 1318/1318 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 760/760 places, 1318/1318 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 760/760 places, 1318/1318 transitions.
Applied a total of 0 rules in 25 ms. Remains 760 /760 variables (removed 0) and now considering 1318/1318 (removed 0) transitions.
[2025-05-30 05:58:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:58:04] [INFO ] Implicit Places using invariants in 677 ms returned [1, 18, 19, 31, 48, 66, 137, 141, 150, 151, 153, 170, 188, 225, 228, 267, 282, 283, 286, 303, 321, 390, 395, 408, 409, 411, 428, 446, 515, 519, 520, 531, 532, 534, 551, 569, 638, 642, 643, 646, 657, 658, 659, 677, 698, 699, 700, 701]
[2025-05-30 05:58:04] [INFO ] Actually due to overlaps returned [677, 659, 48, 170, 303, 428, 551, 31, 153, 286, 411, 534, 150, 282, 408, 531, 657, 698, 151, 283, 409, 532, 658, 699, 1, 18, 267, 395, 519, 520, 642, 643, 66, 188, 321, 446, 569, 700, 19, 646, 701]
Discarding 41 places :
Implicit Place search using SMT only with invariants took 679 ms to find 41 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 719/760 places, 1318/1318 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 92 rules applied. Total rules applied 92 place count 715 transition count 1230
Reduce places removed 88 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 93 rules applied. Total rules applied 185 place count 627 transition count 1225
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 187 place count 625 transition count 1225
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 187 place count 625 transition count 1198
Deduced a syphon composed of 27 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 55 rules applied. Total rules applied 242 place count 597 transition count 1198
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 254 place count 593 transition count 1190
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 262 place count 585 transition count 1190
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 265 place count 582 transition count 1187
Iterating global reduction 5 with 3 rules applied. Total rules applied 268 place count 582 transition count 1187
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 271 place count 582 transition count 1184
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 6 with 74 rules applied. Total rules applied 345 place count 545 transition count 1147
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 349 place count 541 transition count 1143
Iterating global reduction 6 with 4 rules applied. Total rules applied 353 place count 541 transition count 1143
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 356 place count 541 transition count 1140
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 360 place count 539 transition count 1141
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 7 with 11 rules applied. Total rules applied 371 place count 539 transition count 1130
Ensure Unique test removed 1 places
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 7 with 12 rules applied. Total rules applied 383 place count 527 transition count 1130
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 386 place count 527 transition count 1127
Partial Free-agglomeration rule applied 15 times.
Drop transitions (Partial Free agglomeration) removed 15 transitions
Iterating global reduction 8 with 15 rules applied. Total rules applied 401 place count 527 transition count 1127
Applied a total of 401 rules in 151 ms. Remains 527 /719 variables (removed 192) and now considering 1127/1318 (removed 191) transitions.
// Phase 1: matrix 1127 rows 527 cols
[2025-05-30 05:58:04] [INFO ] Computed 79 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:58:04] [INFO ] Implicit Places using invariants in 496 ms returned [74, 90, 96, 99, 101, 102, 105, 106, 168, 171, 179, 185, 188, 190, 193, 261, 277, 283, 286, 288, 295, 296, 349, 365, 371, 374, 376, 381, 382, 434, 451, 457, 460, 462]
[2025-05-30 05:58:04] [INFO ] Actually due to overlaps returned [105, 295, 381, 106, 296, 382, 90, 96, 101, 179, 185, 190, 277, 283, 288, 365, 371, 376, 451, 457, 462, 74, 102, 168, 193, 261, 349, 434]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 498 ms to find 28 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 499/760 places, 1127/1318 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 478 transition count 1106
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 478 transition count 1106
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 47 place count 473 transition count 1101
Iterating global reduction 0 with 5 rules applied. Total rules applied 52 place count 473 transition count 1101
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 70 place count 464 transition count 1092
Free-agglomeration rule applied 15 times.
Iterating global reduction 0 with 15 rules applied. Total rules applied 85 place count 464 transition count 1077
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 100 place count 449 transition count 1077
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 103 place count 449 transition count 1074
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 106 place count 446 transition count 1074
Applied a total of 106 rules in 80 ms. Remains 446 /499 variables (removed 53) and now considering 1074/1127 (removed 53) transitions.
// Phase 1: matrix 1074 rows 446 cols
[2025-05-30 05:58:04] [INFO ] Computed 51 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:58:05] [INFO ] Implicit Places using invariants in 293 ms returned [153]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 294 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 445/760 places, 1074/1318 transitions.
Applied a total of 0 rules in 15 ms. Remains 445 /445 variables (removed 0) and now considering 1074/1074 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 1744 ms. Remains : 445/760 places, 1074/1318 transitions.
RANDOM walk for 40000 steps (675 resets) in 133 ms. (298 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (148 resets) in 55 ms. (714 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (166 resets) in 55 ms. (714 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (158 resets) in 59 ms. (666 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (160 resets) in 55 ms. (714 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (172 resets) in 54 ms. (727 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 333310 steps, run timeout after 3001 ms. (steps per millisecond=111 ) properties seen :0 out of 5
Probabilistic random walk after 333310 steps, saw 107648 distinct states, run finished after 3001 ms. (steps per millisecond=111 ) properties seen :0
// Phase 1: matrix 1074 rows 445 cols
[2025-05-30 05:58:08] [INFO ] Computed 50 invariants in 11 ms
[2025-05-30 05:58:08] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 45/53 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 17/70 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 5/75 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 325/400 variables, 33/41 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 20/420 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/420 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 25/445 variables, 6/50 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/445 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 1074/1519 variables, 445/495 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1519 variables, 1/496 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1519 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/1519 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1519/1519 variables, and 496 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1044 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 445/445 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 45/53 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 17/70 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 5/75 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 325/400 variables, 33/41 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:58:09] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/400 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 20/420 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/420 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 25/445 variables, 6/51 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/445 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 1074/1519 variables, 445/496 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1519 variables, 1/497 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1519 variables, 5/502 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:58:10] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 5 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1519 variables, 1/503 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1519 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 0/1519 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1519/1519 variables, and 503 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1764 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 445/445 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2828ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 2131 ms.
Support contains 8 out of 445 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 445/445 places, 1074/1074 transitions.
Applied a total of 0 rules in 18 ms. Remains 445 /445 variables (removed 0) and now considering 1074/1074 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 445/445 places, 1074/1074 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 445/445 places, 1074/1074 transitions.
Applied a total of 0 rules in 14 ms. Remains 445 /445 variables (removed 0) and now considering 1074/1074 (removed 0) transitions.
[2025-05-30 05:58:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:58:13] [INFO ] Implicit Places using invariants in 280 ms returned []
[2025-05-30 05:58:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:58:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 05:58:14] [INFO ] Implicit Places using invariants and state equation in 814 ms returned []
Implicit Place search using SMT with State Equation took 1101 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 05:58:14] [INFO ] Redundant transitions in 78 ms returned []
Running 1049 sub problems to find dead transitions.
[2025-05-30 05:58:14] [INFO ] Invariant cache hit.
[2025-05-30 05:58:14] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/443 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1049 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/443 variables, 35/41 constraints. Problems are: Problem set: 0 solved, 1049 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/443 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1049 unsolved
At refinement iteration 3 (OVERLAPS) 2/445 variables, 5/46 constraints. Problems are: Problem set: 0 solved, 1049 unsolved
SMT process timed out in 30364ms, After SMT, problems are : Problem set: 0 solved, 1049 unsolved
Search for dead transitions found 0 dead transitions in 30370ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31572 ms. Remains : 445/445 places, 1074/1074 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 445 transition count 1073
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 444 transition count 1073
Applied a total of 2 rules in 18 ms. Remains 444 /445 variables (removed 1) and now considering 1073/1074 (removed 1) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 1073 rows 444 cols
[2025-05-30 05:58:44] [INFO ] Computed 50 invariants in 12 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-30 05:58:45] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2025-05-30 05:58:45] [INFO ] [Real]Absence check using 12 positive and 38 generalized place invariants in 49 ms returned sat
[2025-05-30 05:58:45] [INFO ] After 620ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-30 05:58:45] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2025-05-30 05:58:45] [INFO ] [Nat]Absence check using 12 positive and 38 generalized place invariants in 13 ms returned sat
[2025-05-30 05:58:46] [INFO ] After 420ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
TRAPS : Iteration 0
[2025-05-30 05:58:46] [INFO ] After 688ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
[2025-05-30 05:58:46] [INFO ] After 977ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Over-approximation ignoring read arcs solved 0 properties in 1642 ms.
Successfully simplified 11 atomic propositions for a total of 13 simplifications.
FORMULA ASLink-PT-05b-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05b-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05b-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 86 stabilizing places and 86 stable transitions
FORMULA ASLink-PT-05b-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05b-LTLFireability-10 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)&&F(!p1))) U ((!p2&&X((X(p0)&&F(!p1))))||X(G((X(p0)&&F(!p1)))))))'
Support contains 6 out of 2153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2153/2153 places, 2722/2722 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 2149 transition count 2718
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 2149 transition count 2718
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 2147 transition count 2709
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 2147 transition count 2709
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 2145 transition count 2707
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 2145 transition count 2707
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 2143 transition count 2698
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 2143 transition count 2698
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 2141 transition count 2689
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 2141 transition count 2689
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 2140 transition count 2688
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 2140 transition count 2688
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 2139 transition count 2680
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 2139 transition count 2680
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 2138 transition count 2672
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 2138 transition count 2672
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 2137 transition count 2671
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 2137 transition count 2671
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 2136 transition count 2663
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 2136 transition count 2663
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 2135 transition count 2655
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 2135 transition count 2655
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 2134 transition count 2654
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 2134 transition count 2654
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 2133 transition count 2646
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 2133 transition count 2646
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 2132 transition count 2638
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 2132 transition count 2638
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 2131 transition count 2637
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 2131 transition count 2637
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 2130 transition count 2629
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 2130 transition count 2629
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 2129 transition count 2621
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 2129 transition count 2621
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 2128 transition count 2620
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 2128 transition count 2620
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 2127 transition count 2612
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 2127 transition count 2612
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 2126 transition count 2604
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 2126 transition count 2604
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 2125 transition count 2603
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 2125 transition count 2603
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 2124 transition count 2595
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 2124 transition count 2595
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 2123 transition count 2587
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 2123 transition count 2587
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 2122 transition count 2586
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 2122 transition count 2586
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 2121 transition count 2578
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 2121 transition count 2578
Applied a total of 64 rules in 3235 ms. Remains 2121 /2153 variables (removed 32) and now considering 2578/2722 (removed 144) transitions.
// Phase 1: matrix 2578 rows 2121 cols
[2025-05-30 05:58:50] [INFO ] Computed 227 invariants in 25 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:58:51] [INFO ] Implicit Places using invariants in 1127 ms returned []
[2025-05-30 05:58:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:59:01] [INFO ] Implicit Places using invariants and state equation in 10098 ms returned []
Implicit Place search using SMT with State Equation took 11228 ms to find 0 implicit places.
Running 2577 sub problems to find dead transitions.
[2025-05-30 05:59:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2120 variables, 131/131 constraints. Problems are: Problem set: 0 solved, 2577 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2120/4699 variables, and 131 constraints, problems are : Problem set: 0 solved, 2577 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 0/54 constraints, Generalized P Invariants (flows): 131/173 constraints, State Equation: 0/2121 constraints, PredecessorRefiner: 2577/2577 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2577 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2120 variables, 131/131 constraints. Problems are: Problem set: 0 solved, 2577 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2120/4699 variables, and 131 constraints, problems are : Problem set: 0 solved, 2577 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 0/54 constraints, Generalized P Invariants (flows): 131/173 constraints, State Equation: 0/2121 constraints, PredecessorRefiner: 0/2577 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60746ms problems are : Problem set: 0 solved, 2577 unsolved
Search for dead transitions found 0 dead transitions in 60753ms
Starting structural reductions in LTL mode, iteration 1 : 2121/2153 places, 2578/2722 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 75229 ms. Remains : 2121/2153 places, 2578/2722 transitions.
Stuttering acceptance computed with spot in 406 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (NOT p0), p1, true, (NOT p0)]
Running random walk in product with property : ASLink-PT-05b-LTLFireability-01
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-05b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-05b-LTLFireability-01 finished in 75838 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)&&X(p1)))))'
Support contains 3 out of 2153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2153/2153 places, 2722/2722 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 2149 transition count 2718
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 2149 transition count 2718
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 2147 transition count 2709
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 2147 transition count 2709
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 2145 transition count 2707
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 2145 transition count 2707
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 2143 transition count 2698
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 2143 transition count 2698
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 2141 transition count 2689
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 2141 transition count 2689
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 2140 transition count 2688
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 2140 transition count 2688
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 2139 transition count 2680
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 2139 transition count 2680
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 2138 transition count 2672
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 2138 transition count 2672
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 2137 transition count 2671
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 2137 transition count 2671
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 2136 transition count 2663
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 2136 transition count 2663
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 2135 transition count 2655
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 2135 transition count 2655
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 2134 transition count 2654
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 2134 transition count 2654
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 2133 transition count 2646
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 2133 transition count 2646
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 2132 transition count 2638
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 2132 transition count 2638
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 2131 transition count 2637
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 2131 transition count 2637
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 2130 transition count 2629
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 2130 transition count 2629
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 2129 transition count 2621
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 2129 transition count 2621
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 2128 transition count 2620
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 2128 transition count 2620
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 2127 transition count 2612
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 2127 transition count 2612
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 2126 transition count 2604
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 2126 transition count 2604
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 2125 transition count 2603
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 2125 transition count 2603
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 2124 transition count 2595
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 2124 transition count 2595
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 2123 transition count 2587
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 2123 transition count 2587
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 2122 transition count 2586
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 2122 transition count 2586
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 2121 transition count 2578
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 2121 transition count 2578
Applied a total of 64 rules in 3256 ms. Remains 2121 /2153 variables (removed 32) and now considering 2578/2722 (removed 144) transitions.
[2025-05-30 06:00:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:00:07] [INFO ] Implicit Places using invariants in 1156 ms returned []
[2025-05-30 06:00:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:00:15] [INFO ] Implicit Places using invariants and state equation in 8619 ms returned []
Implicit Place search using SMT with State Equation took 9782 ms to find 0 implicit places.
Running 2577 sub problems to find dead transitions.
[2025-05-30 06:00:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2120 variables, 131/131 constraints. Problems are: Problem set: 0 solved, 2577 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2120/4699 variables, and 131 constraints, problems are : Problem set: 0 solved, 2577 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 0/54 constraints, Generalized P Invariants (flows): 131/173 constraints, State Equation: 0/2121 constraints, PredecessorRefiner: 2577/2577 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2577 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2120 variables, 131/131 constraints. Problems are: Problem set: 0 solved, 2577 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2120/4699 variables, and 131 constraints, problems are : Problem set: 0 solved, 2577 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 0/54 constraints, Generalized P Invariants (flows): 131/173 constraints, State Equation: 0/2121 constraints, PredecessorRefiner: 0/2577 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60758ms problems are : Problem set: 0 solved, 2577 unsolved
Search for dead transitions found 0 dead transitions in 60763ms
Starting structural reductions in LTL mode, iteration 1 : 2121/2153 places, 2578/2722 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 73813 ms. Remains : 2121/2153 places, 2578/2722 transitions.
Stuttering acceptance computed with spot in 184 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : ASLink-PT-05b-LTLFireability-02
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-05b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-05b-LTLFireability-02 finished in 74026 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((G(p0) U p1))) U p2))'
Support contains 6 out of 2153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2153/2153 places, 2722/2722 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 2150 transition count 2719
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 2150 transition count 2719
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 2149 transition count 2711
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 2149 transition count 2711
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 2148 transition count 2710
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 2148 transition count 2710
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 2147 transition count 2702
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 2147 transition count 2702
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 2146 transition count 2694
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 2146 transition count 2694
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 2145 transition count 2693
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 2145 transition count 2693
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 2144 transition count 2685
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 2144 transition count 2685
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 2143 transition count 2677
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 2143 transition count 2677
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 2142 transition count 2676
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 2142 transition count 2676
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 2141 transition count 2668
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 2141 transition count 2668
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 2140 transition count 2660
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 2140 transition count 2660
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 2139 transition count 2659
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 2139 transition count 2659
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 2138 transition count 2651
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 2138 transition count 2651
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 2137 transition count 2643
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 2137 transition count 2643
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 2136 transition count 2642
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 2136 transition count 2642
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 2135 transition count 2634
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 2135 transition count 2634
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 2134 transition count 2626
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 2134 transition count 2626
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 2133 transition count 2625
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 2133 transition count 2625
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 2132 transition count 2617
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 2132 transition count 2617
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 2131 transition count 2609
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 2131 transition count 2609
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 2130 transition count 2608
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 2130 transition count 2608
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 2129 transition count 2600
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 2129 transition count 2600
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 2128 transition count 2592
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 2128 transition count 2592
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 2127 transition count 2591
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 2127 transition count 2591
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 2126 transition count 2583
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 2126 transition count 2583
Applied a total of 54 rules in 3266 ms. Remains 2126 /2153 variables (removed 27) and now considering 2583/2722 (removed 139) transitions.
// Phase 1: matrix 2583 rows 2126 cols
[2025-05-30 06:01:19] [INFO ] Computed 227 invariants in 22 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:01:21] [INFO ] Implicit Places using invariants in 1142 ms returned []
[2025-05-30 06:01:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:01:27] [INFO ] Implicit Places using invariants and state equation in 6062 ms returned []
Implicit Place search using SMT with State Equation took 7206 ms to find 0 implicit places.
Running 2582 sub problems to find dead transitions.
[2025-05-30 06:01:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 13.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 0.0)
(s16 1.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 1.0)
(s26 6.0)
(s27 0.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 0.0)
(s32 1.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 3.0)
(s48 1.0)
(s49 1.0)
(s50 6.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 22.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 6.0)
(s96 0.0)
(s97 0.0)
(s98 1.0)
(s99 1.0)
(s100 0.0)
(s101 0.0)
(s102 1.0)
(s103 1.0)
(s104 0.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 1.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 1.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 1.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 1.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 1.0)
(s142 1.0)
(s143 0.0)
(s144 0.0)
(s145 1.0)
(s146 0.0)
(s147 0.0)
(s148 1.0)
(s149 0.0)
(s150 0.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 5.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 0.0)
(s251 0.0)
(s252 1.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 1.0)
(s260 1.0)
(s261 0.0)
(s262 1.0)
(s263 1.0)
(s264 0.0)
(s265 1.0)
(s266 0.0)
(s267 0.0)
(s268 1.0)
(s269 0.0)
(s270 0.0)
(s271 1.0)
(s272 0.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 0.0)
(s284 1.0)
(s285 1.0)
(s286 0.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 0.0)
(s293 0.0)
(s294 1.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 1.0)
(s300 1.0)
(s301 0.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 0.0)
(s307 1.0)
(s308 1.0)
(s309 0.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 0.0)
(s320 0.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 0.0)
(s329 0.0)
(s330 1.0)
(s331 1.0)
(s332 0.0)
(s333 1.0)
(s334 0.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 0.0)
(s339 0.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 0.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 0.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 4.0)
(s362 1.0)
(s363 0.0)
(s364 1.0)
(s365 1.0)
(s366 0.0)
(s367 0.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 23.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 17.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 17.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 14.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2125 variables, 129/129 constraints. Problems are: Problem set: 0 solved, 2582 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2125/4709 variables, and 129 constraints, problems are : Problem set: 0 solved, 2582 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 0/55 constraints, Generalized P Invariants (flows): 129/172 constraints, State Equation: 0/2126 constraints, PredecessorRefiner: 2582/2582 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2582 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2125 variables, 129/129 constraints. Problems are: Problem set: 0 solved, 2582 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2125/4709 variables, and 129 constraints, problems are : Problem set: 0 solved, 2582 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 0/55 constraints, Generalized P Invariants (flows): 129/172 constraints, State Equation: 0/2126 constraints, PredecessorRefiner: 0/2582 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60719ms problems are : Problem set: 0 solved, 2582 unsolved
Search for dead transitions found 0 dead transitions in 60726ms
Starting structural reductions in LTL mode, iteration 1 : 2126/2153 places, 2583/2722 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71207 ms. Remains : 2126/2153 places, 2583/2722 transitions.
Stuttering acceptance computed with spot in 193 ms :[(NOT p2), (OR (NOT p2) (NOT p1)), (NOT p1), true, (NOT p0)]
Running random walk in product with property : ASLink-PT-05b-LTLFireability-04
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-05b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-05b-LTLFireability-04 finished in 71439 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(p1))))'
Support contains 2 out of 2153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2153/2153 places, 2722/2722 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 2149 transition count 2718
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 2149 transition count 2718
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 2147 transition count 2709
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 2147 transition count 2709
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 2145 transition count 2707
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 2145 transition count 2707
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 2143 transition count 2698
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 2143 transition count 2698
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 2141 transition count 2689
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 2141 transition count 2689
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 2140 transition count 2688
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 2140 transition count 2688
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 2139 transition count 2680
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 2139 transition count 2680
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 2138 transition count 2672
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 2138 transition count 2672
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 2137 transition count 2671
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 2137 transition count 2671
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 2136 transition count 2663
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 2136 transition count 2663
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 2135 transition count 2655
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 2135 transition count 2655
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 2134 transition count 2654
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 2134 transition count 2654
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 2133 transition count 2646
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 2133 transition count 2646
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 2132 transition count 2638
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 2132 transition count 2638
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 2131 transition count 2637
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 2131 transition count 2637
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 2130 transition count 2629
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 2130 transition count 2629
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 2129 transition count 2621
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 2129 transition count 2621
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 2128 transition count 2620
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 2128 transition count 2620
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 2127 transition count 2612
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 2127 transition count 2612
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 2126 transition count 2604
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 2126 transition count 2604
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 2125 transition count 2603
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 2125 transition count 2603
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 2124 transition count 2595
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 2124 transition count 2595
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 2123 transition count 2587
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 2123 transition count 2587
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 2122 transition count 2586
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 2122 transition count 2586
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 2121 transition count 2578
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 2121 transition count 2578
Applied a total of 64 rules in 3233 ms. Remains 2121 /2153 variables (removed 32) and now considering 2578/2722 (removed 144) transitions.
// Phase 1: matrix 2578 rows 2121 cols
[2025-05-30 06:02:31] [INFO ] Computed 227 invariants in 25 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:02:32] [INFO ] Implicit Places using invariants in 1121 ms returned []
[2025-05-30 06:02:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:02:41] [INFO ] Implicit Places using invariants and state equation in 9097 ms returned []
Implicit Place search using SMT with State Equation took 10222 ms to find 0 implicit places.
Running 2577 sub problems to find dead transitions.
[2025-05-30 06:02:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/2120 variables, 131/131 constraints. Problems are: Problem set: 0 solved, 2577 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2120/4699 variables, and 131 constraints, problems are : Problem set: 0 solved, 2577 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 0/54 constraints, Generalized P Invariants (flows): 131/173 constraints, State Equation: 0/2121 constraints, PredecessorRefiner: 2577/2577 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2577 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2120 variables, 131/131 constraints. Problems are: Problem set: 0 solved, 2577 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 13)
(s12 1)
(s13 1)
(s14 0)
(s15 0)
(s16 1)
(s17 1)
(s18 0)
(s19 0)
(s20 1)
(s21 1)
(s22 0)
(s23 0)
(s24 1)
(s25 1)
(s26 0)
(s27 0)
(s28 1)
(s29 1)
(s30 0)
(s31 0)
(s32 1)
(s33 1)
(s34 0)
(s35 0)
(s36 1)
(s37 1)
(s38 0)
(s39 0)
(s40 1)
(s41 1)
(s42 0)
(s43 0)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 3)
(s49 1)
(s50 6)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 22)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 6)
(s92 1)
(s93 0)
(s94 1)
(s95 1)
(s96 0)
(s97 1)
(s98 1)
(s99 1)
(s100 0)
(s101 0)
(s102 1)
(s103 1)
(s104 0)
(s105 0)
(s106 1)
(s107 1)
(s108 0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2120/4699 variables, and 131 constraints, problems are : Problem set: 0 solved, 2577 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 0/54 constraints, Generalized P Invariants (flows): 131/173 constraints, State Equation: 0/2121 constraints, PredecessorRefiner: 0/2577 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60735ms problems are : Problem set: 0 solved, 2577 unsolved
Search for dead transitions found 0 dead transitions in 60739ms
Starting structural reductions in LTL mode, iteration 1 : 2121/2153 places, 2578/2722 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 74204 ms. Remains : 2121/2153 places, 2578/2722 transitions.
Stuttering acceptance computed with spot in 155 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : ASLink-PT-05b-LTLFireability-05
Stuttering criterion allowed to conclude after 692 steps with 0 reset in 7 ms.
FORMULA ASLink-PT-05b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-05b-LTLFireability-05 finished in 74393 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 2153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2153/2153 places, 2722/2722 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 393 transitions
Trivial Post-agglo rules discarded 393 transitions
Performed 393 trivial Post agglomeration. Transition count delta: 393
Iterating post reduction 0 with 393 rules applied. Total rules applied 393 place count 2152 transition count 2328
Reduce places removed 393 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 396 rules applied. Total rules applied 789 place count 1759 transition count 2325
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 791 place count 1757 transition count 2325
Performed 580 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 580 Pre rules applied. Total rules applied 791 place count 1757 transition count 1745
Deduced a syphon composed of 580 places in 3 ms
Ensure Unique test removed 54 places
Reduce places removed 634 places and 0 transitions.
Iterating global reduction 3 with 1214 rules applied. Total rules applied 2005 place count 1123 transition count 1745
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 3 with 39 rules applied. Total rules applied 2044 place count 1118 transition count 1711
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 4 with 34 rules applied. Total rules applied 2078 place count 1084 transition count 1711
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 21 Pre rules applied. Total rules applied 2078 place count 1084 transition count 1690
Deduced a syphon composed of 21 places in 3 ms
Ensure Unique test removed 21 places
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 5 with 63 rules applied. Total rules applied 2141 place count 1042 transition count 1690
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 20 Pre rules applied. Total rules applied 2141 place count 1042 transition count 1670
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 2181 place count 1022 transition count 1670
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 2183 place count 1020 transition count 1668
Iterating global reduction 5 with 2 rules applied. Total rules applied 2185 place count 1020 transition count 1668
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 2185 place count 1020 transition count 1667
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 2187 place count 1019 transition count 1667
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 2189 place count 1017 transition count 1658
Iterating global reduction 5 with 2 rules applied. Total rules applied 2191 place count 1017 transition count 1658
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2192 place count 1016 transition count 1650
Iterating global reduction 5 with 1 rules applied. Total rules applied 2193 place count 1016 transition count 1650
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2194 place count 1015 transition count 1642
Iterating global reduction 5 with 1 rules applied. Total rules applied 2195 place count 1015 transition count 1642
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2196 place count 1014 transition count 1634
Iterating global reduction 5 with 1 rules applied. Total rules applied 2197 place count 1014 transition count 1634
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2198 place count 1013 transition count 1626
Iterating global reduction 5 with 1 rules applied. Total rules applied 2199 place count 1013 transition count 1626
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2200 place count 1012 transition count 1618
Iterating global reduction 5 with 1 rules applied. Total rules applied 2201 place count 1012 transition count 1618
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2202 place count 1011 transition count 1610
Iterating global reduction 5 with 1 rules applied. Total rules applied 2203 place count 1011 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2204 place count 1010 transition count 1602
Iterating global reduction 5 with 1 rules applied. Total rules applied 2205 place count 1010 transition count 1602
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2206 place count 1009 transition count 1594
Iterating global reduction 5 with 1 rules applied. Total rules applied 2207 place count 1009 transition count 1594
Performed 170 Post agglomeration using F-continuation condition.Transition count delta: 170
Deduced a syphon composed of 170 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 172 places and 0 transitions.
Iterating global reduction 5 with 342 rules applied. Total rules applied 2549 place count 837 transition count 1424
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 2553 place count 833 transition count 1420
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 2558 place count 832 transition count 1420
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 2559 place count 832 transition count 1419
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2560 place count 831 transition count 1419
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 2560 place count 831 transition count 1418
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 2562 place count 830 transition count 1418
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 2564 place count 828 transition count 1416
Iterating global reduction 7 with 2 rules applied. Total rules applied 2566 place count 828 transition count 1416
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 2568 place count 828 transition count 1414
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2569 place count 827 transition count 1414
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2571 place count 826 transition count 1419
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2573 place count 824 transition count 1417
Reduce places removed 10 places and 0 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 9 with 15 rules applied. Total rules applied 2588 place count 814 transition count 1412
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 2593 place count 809 transition count 1412
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 15 Pre rules applied. Total rules applied 2593 place count 809 transition count 1397
Deduced a syphon composed of 15 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 11 with 31 rules applied. Total rules applied 2624 place count 793 transition count 1397
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 11 with 11 rules applied. Total rules applied 2635 place count 782 transition count 1397
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 2635 place count 782 transition count 1396
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 2637 place count 781 transition count 1396
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 12 with 32 rules applied. Total rules applied 2669 place count 765 transition count 1380
Discarding 10 places :
Symmetric choice reduction at 12 with 10 rule applications. Total rules 2679 place count 755 transition count 1370
Iterating global reduction 12 with 10 rules applied. Total rules applied 2689 place count 755 transition count 1370
Discarding 5 places :
Symmetric choice reduction at 12 with 5 rule applications. Total rules 2694 place count 750 transition count 1365
Iterating global reduction 12 with 5 rules applied. Total rules applied 2699 place count 750 transition count 1365
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 12 with 5 rules applied. Total rules applied 2704 place count 750 transition count 1360
Applied a total of 2704 rules in 672 ms. Remains 750 /2153 variables (removed 1403) and now considering 1360/2722 (removed 1362) transitions.
// Phase 1: matrix 1360 rows 750 cols
[2025-05-30 06:03:43] [INFO ] Computed 122 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:03:43] [INFO ] Implicit Places using invariants in 568 ms returned [1, 18, 19, 31, 48, 66, 86, 137, 147, 148, 150, 167, 185, 205, 256, 257, 271, 272, 274, 291, 309, 329, 380, 381, 393, 394, 396, 413, 431, 451, 502, 503, 515, 516, 518, 535, 553, 572, 624, 625, 628, 639, 640, 641, 667, 688, 689, 690, 691]
Discarding 49 places :
Implicit Place search using SMT only with invariants took 569 ms to find 49 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 701/2153 places, 1360/2722 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 88 rules applied. Total rules applied 88 place count 701 transition count 1272
Reduce places removed 88 places and 0 transitions.
Iterating post reduction 1 with 88 rules applied. Total rules applied 176 place count 613 transition count 1272
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 176 place count 613 transition count 1245
Deduced a syphon composed of 27 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 55 rules applied. Total rules applied 231 place count 585 transition count 1245
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 243 place count 581 transition count 1237
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 251 place count 573 transition count 1237
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 254 place count 570 transition count 1234
Iterating global reduction 4 with 3 rules applied. Total rules applied 257 place count 570 transition count 1234
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 260 place count 570 transition count 1231
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 2 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 5 with 82 rules applied. Total rules applied 342 place count 529 transition count 1190
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 346 place count 527 transition count 1191
Applied a total of 346 rules in 68 ms. Remains 527 /701 variables (removed 174) and now considering 1191/1360 (removed 169) transitions.
// Phase 1: matrix 1191 rows 527 cols
[2025-05-30 06:03:43] [INFO ] Computed 68 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:03:44] [INFO ] Implicit Places using invariants in 368 ms returned [88, 94, 99, 174, 180, 185, 264, 270, 275, 352, 358, 363, 440, 446, 451, 524]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 371 ms to find 16 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 511/2153 places, 1191/2722 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 511 transition count 1190
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 510 transition count 1190
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 12 place count 500 transition count 1180
Iterating global reduction 2 with 10 rules applied. Total rules applied 22 place count 500 transition count 1180
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 32 place count 490 transition count 1170
Iterating global reduction 2 with 10 rules applied. Total rules applied 42 place count 490 transition count 1170
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 47 place count 485 transition count 1165
Iterating global reduction 2 with 5 rules applied. Total rules applied 52 place count 485 transition count 1165
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 62 place count 480 transition count 1160
Applied a total of 62 rules in 58 ms. Remains 480 /511 variables (removed 31) and now considering 1160/1191 (removed 31) transitions.
// Phase 1: matrix 1160 rows 480 cols
[2025-05-30 06:03:44] [INFO ] Computed 52 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:03:44] [INFO ] Implicit Places using invariants in 321 ms returned []
[2025-05-30 06:03:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:03:45] [INFO ] Implicit Places using invariants and state equation in 888 ms returned []
Implicit Place search using SMT with State Equation took 1210 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 480/2153 places, 1160/2722 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 2948 ms. Remains : 480/2153 places, 1160/2722 transitions.
Stuttering acceptance computed with spot in 98 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ASLink-PT-05b-LTLFireability-06
Stuttering criterion allowed to conclude after 148 steps with 0 reset in 4 ms.
FORMULA ASLink-PT-05b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-05b-LTLFireability-06 finished in 3069 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||X((p1||F(G(p2)))))))'
Support contains 3 out of 2153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2153/2153 places, 2722/2722 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 2150 transition count 2719
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 2150 transition count 2719
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 2149 transition count 2718
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 2149 transition count 2718
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 2148 transition count 2717
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 2148 transition count 2717
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 2147 transition count 2716
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 2147 transition count 2716
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 2146 transition count 2715
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 2146 transition count 2715
Applied a total of 14 rules in 739 ms. Remains 2146 /2153 variables (removed 7) and now considering 2715/2722 (removed 7) transitions.
// Phase 1: matrix 2715 rows 2146 cols
[2025-05-30 06:03:46] [INFO ] Computed 227 invariants in 26 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:03:47] [INFO ] Implicit Places using invariants in 1253 ms returned []
[2025-05-30 06:03:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:03:52] [INFO ] Implicit Places using invariants and state equation in 4629 ms returned []
Implicit Place search using SMT with State Equation took 5894 ms to find 0 implicit places.
Running 2714 sub problems to find dead transitions.
[2025-05-30 06:03: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/2145 variables, 133/133 constraints. Problems are: Problem set: 0 solved, 2714 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2145/4861 variables, and 133 constraints, problems are : Problem set: 0 solved, 2714 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 0/53 constraints, Generalized P Invariants (flows): 133/174 constraints, State Equation: 0/2146 constraints, PredecessorRefiner: 2714/2714 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2714 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2145 variables, 133/133 constraints. Problems are: Problem set: 0 solved, 2714 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2145/4861 variables, and 133 constraints, problems are : Problem set: 0 solved, 2714 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 0/53 constraints, Generalized P Invariants (flows): 133/174 constraints, State Equation: 0/2146 constraints, PredecessorRefiner: 0/2714 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60797ms problems are : Problem set: 0 solved, 2714 unsolved
Search for dead transitions found 0 dead transitions in 60802ms
Starting structural reductions in LTL mode, iteration 1 : 2146/2153 places, 2715/2722 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67442 ms. Remains : 2146/2153 places, 2715/2722 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : ASLink-PT-05b-LTLFireability-07
Product exploration explored 100000 steps with 223 reset in 391 ms.
Product exploration explored 100000 steps with 216 reset in 472 ms.
Computed a total of 86 stabilizing places and 86 stable transitions
Computed a total of 86 stabilizing places and 86 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p1) p0))), (X (AND (NOT p2) (NOT p1) p0)), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (AND (NOT p2) (NOT p1) p0))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 15 factoid took 178 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter sensitive) to 6 states, 17 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), false, false, false, false]
RANDOM walk for 40000 steps (76 resets) in 252 ms. (158 steps per ms) remains 4/11 properties
BEST_FIRST walk for 40003 steps (11 resets) in 130 ms. (305 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (9 resets) in 128 ms. (310 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 92 ms. (430 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (9 resets) in 154 ms. (258 steps per ms) remains 4/4 properties
[2025-05-30 06:04:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 168/171 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf2 is UNSAT
Problem apf3 is UNSAT
At refinement iteration 3 (OVERLAPS) 238/409 variables, 18/23 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:04:54] [INFO ] Deduced a trap composed of 43 places in 81 ms of which 11 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/409 variables, 1/24 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/409 variables, 0/24 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 291/700 variables, 35/59 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/700 variables, 0/59 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1387/2087 variables, 161/220 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:04:55] [INFO ] Deduced a trap composed of 17 places in 310 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:04:55] [INFO ] Deduced a trap composed of 21 places in 259 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:04:56] [INFO ] Deduced a trap composed of 41 places in 213 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:04:56] [INFO ] Deduced a trap composed of 45 places in 214 ms of which 24 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/2087 variables, 4/224 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2087 variables, 0/224 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 59/2146 variables, 8/232 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2146 variables, 0/232 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2715/4861 variables, 2146/2378 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4861 variables, 0/2378 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/4861 variables, 0/2378 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4861/4861 variables, and 2378 constraints, problems are : Problem set: 2 solved, 2 unsolved in 3771 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, Generalized P Invariants (flows): 174/174 constraints, State Equation: 2146/2146 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 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) 168/171 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 238/409 variables, 18/23 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/409 variables, 1/24 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/409 variables, 0/24 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 291/700 variables, 35/59 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/700 variables, 0/59 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1387/2087 variables, 161/220 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2087 variables, 4/224 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:04:59] [INFO ] Deduced a trap composed of 75 places in 268 ms of which 53 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/2087 variables, 1/225 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2087 variables, 0/225 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 59/2146 variables, 8/233 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2146 variables, 0/233 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2715/4861 variables, 2146/2379 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4861/4861 variables, and 2381 constraints, problems are : Problem set: 2 solved, 2 unsolved in 3021 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, Generalized P Invariants (flows): 174/174 constraints, State Equation: 2146/2146 constraints, PredecessorRefiner: 2/4 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6805ms problems are : Problem set: 2 solved, 2 unsolved
Parikh walk visited 0 properties in 962 ms.
Support contains 3 out of 2146 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2146/2146 places, 2715/2715 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 387 transitions
Trivial Post-agglo rules discarded 387 transitions
Performed 387 trivial Post agglomeration. Transition count delta: 387
Iterating post reduction 0 with 387 rules applied. Total rules applied 387 place count 2146 transition count 2328
Reduce places removed 387 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 390 rules applied. Total rules applied 777 place count 1759 transition count 2325
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 780 place count 1757 transition count 2324
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 781 place count 1756 transition count 2324
Performed 580 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 580 Pre rules applied. Total rules applied 781 place count 1756 transition count 1744
Deduced a syphon composed of 580 places in 3 ms
Ensure Unique test removed 52 places
Reduce places removed 632 places and 0 transitions.
Iterating global reduction 4 with 1212 rules applied. Total rules applied 1993 place count 1124 transition count 1744
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 4 with 39 rules applied. Total rules applied 2032 place count 1119 transition count 1710
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 5 with 34 rules applied. Total rules applied 2066 place count 1085 transition count 1710
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 19 Pre rules applied. Total rules applied 2066 place count 1085 transition count 1691
Deduced a syphon composed of 19 places in 3 ms
Ensure Unique test removed 19 places
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 6 with 57 rules applied. Total rules applied 2123 place count 1047 transition count 1691
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 18 Pre rules applied. Total rules applied 2123 place count 1047 transition count 1673
Deduced a syphon composed of 18 places in 3 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 6 with 36 rules applied. Total rules applied 2159 place count 1029 transition count 1673
Performed 176 Post agglomeration using F-continuation condition.Transition count delta: 176
Deduced a syphon composed of 176 places in 2 ms
Ensure Unique test removed 3 places
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 6 with 355 rules applied. Total rules applied 2514 place count 850 transition count 1497
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 2518 place count 846 transition count 1493
Ensure Unique test removed 1 places
Iterating global reduction 6 with 5 rules applied. Total rules applied 2523 place count 845 transition count 1493
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 2524 place count 845 transition count 1492
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2525 place count 844 transition count 1492
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 2525 place count 844 transition count 1491
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 2527 place count 843 transition count 1491
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 2529 place count 841 transition count 1489
Iterating global reduction 8 with 2 rules applied. Total rules applied 2531 place count 841 transition count 1489
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 2533 place count 841 transition count 1487
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 2534 place count 840 transition count 1487
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 2536 place count 839 transition count 1492
Free-agglomeration rule applied 6 times.
Iterating global reduction 10 with 6 rules applied. Total rules applied 2542 place count 839 transition count 1486
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 2548 place count 833 transition count 1486
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 11 with 4 rules applied. Total rules applied 2552 place count 833 transition count 1482
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 2556 place count 829 transition count 1482
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 12 with 5 rules applied. Total rules applied 2561 place count 829 transition count 1482
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 2562 place count 828 transition count 1481
Reduce places removed 10 places and 0 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 12 with 15 rules applied. Total rules applied 2577 place count 818 transition count 1476
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 13 with 5 rules applied. Total rules applied 2582 place count 813 transition count 1476
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 15 Pre rules applied. Total rules applied 2582 place count 813 transition count 1461
Deduced a syphon composed of 15 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 14 with 31 rules applied. Total rules applied 2613 place count 797 transition count 1461
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 14 with 6 rules applied. Total rules applied 2619 place count 791 transition count 1461
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 1 Pre rules applied. Total rules applied 2619 place count 791 transition count 1460
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 2621 place count 790 transition count 1460
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 15 with 22 rules applied. Total rules applied 2643 place count 779 transition count 1449
Discarding 5 places :
Symmetric choice reduction at 15 with 5 rule applications. Total rules 2648 place count 774 transition count 1444
Iterating global reduction 15 with 5 rules applied. Total rules applied 2653 place count 774 transition count 1444
Free-agglomeration rule applied 5 times.
Iterating global reduction 15 with 5 rules applied. Total rules applied 2658 place count 774 transition count 1439
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 15 with 5 rules applied. Total rules applied 2663 place count 769 transition count 1439
Applied a total of 2663 rules in 496 ms. Remains 769 /2146 variables (removed 1377) and now considering 1439/2715 (removed 1276) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 496 ms. Remains : 769/2146 places, 1439/2715 transitions.
RANDOM walk for 40000 steps (473 resets) in 205 ms. (194 steps per ms) remains 2/2 properties
BEST_FIRST walk for 17801 steps (37 resets) in 30 ms. (574 steps per ms) remains 0/2 properties
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p1) p0))), (X (AND (NOT p2) (NOT p1) p0)), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (AND (NOT p2) (NOT p1) p0))), (X (X p0)), (X (X (NOT p1))), (G (OR p0 (NOT p2) p1)), (G (OR p0 (NOT p2) (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT (AND p0 (NOT p2) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1)))), (F p2), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (OR p0 p2 p1))), (F (NOT p0)), (F p1)]
Knowledge based reduction with 17 factoid took 390 ms. Reduced automaton from 6 states, 17 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Support contains 2 out of 2146 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 : 2146/2146 places, 2715/2715 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 387 transitions
Trivial Post-agglo rules discarded 387 transitions
Performed 387 trivial Post agglomeration. Transition count delta: 387
Iterating post reduction 0 with 387 rules applied. Total rules applied 387 place count 2145 transition count 2327
Reduce places removed 387 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 390 rules applied. Total rules applied 777 place count 1758 transition count 2324
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 780 place count 1756 transition count 2323
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 781 place count 1755 transition count 2323
Performed 580 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 580 Pre rules applied. Total rules applied 781 place count 1755 transition count 1743
Deduced a syphon composed of 580 places in 2 ms
Ensure Unique test removed 52 places
Reduce places removed 632 places and 0 transitions.
Iterating global reduction 4 with 1212 rules applied. Total rules applied 1993 place count 1123 transition count 1743
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 4 with 39 rules applied. Total rules applied 2032 place count 1118 transition count 1709
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 5 with 34 rules applied. Total rules applied 2066 place count 1084 transition count 1709
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 19 Pre rules applied. Total rules applied 2066 place count 1084 transition count 1690
Deduced a syphon composed of 19 places in 2 ms
Ensure Unique test removed 19 places
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 6 with 57 rules applied. Total rules applied 2123 place count 1046 transition count 1690
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 18 Pre rules applied. Total rules applied 2123 place count 1046 transition count 1672
Deduced a syphon composed of 18 places in 3 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 6 with 36 rules applied. Total rules applied 2159 place count 1028 transition count 1672
Performed 174 Post agglomeration using F-continuation condition.Transition count delta: 174
Deduced a syphon composed of 174 places in 2 ms
Ensure Unique test removed 3 places
Reduce places removed 177 places and 0 transitions.
Iterating global reduction 6 with 351 rules applied. Total rules applied 2510 place count 851 transition count 1498
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 2514 place count 847 transition count 1494
Ensure Unique test removed 1 places
Iterating global reduction 6 with 5 rules applied. Total rules applied 2519 place count 846 transition count 1494
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 2520 place count 846 transition count 1493
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2521 place count 845 transition count 1493
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 2521 place count 845 transition count 1492
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 2523 place count 844 transition count 1492
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 2525 place count 842 transition count 1490
Iterating global reduction 8 with 2 rules applied. Total rules applied 2527 place count 842 transition count 1490
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 2529 place count 842 transition count 1488
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 2530 place count 841 transition count 1488
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 2532 place count 840 transition count 1493
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 2534 place count 838 transition count 1491
Reduce places removed 10 places and 0 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 10 with 15 rules applied. Total rules applied 2549 place count 828 transition count 1486
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 11 with 5 rules applied. Total rules applied 2554 place count 823 transition count 1486
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 15 Pre rules applied. Total rules applied 2554 place count 823 transition count 1471
Deduced a syphon composed of 15 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 12 with 31 rules applied. Total rules applied 2585 place count 807 transition count 1471
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 12 with 11 rules applied. Total rules applied 2596 place count 796 transition count 1471
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 2596 place count 796 transition count 1470
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 2598 place count 795 transition count 1470
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 13 with 32 rules applied. Total rules applied 2630 place count 779 transition count 1454
Discarding 10 places :
Symmetric choice reduction at 13 with 10 rule applications. Total rules 2640 place count 769 transition count 1444
Iterating global reduction 13 with 10 rules applied. Total rules applied 2650 place count 769 transition count 1444
Discarding 5 places :
Symmetric choice reduction at 13 with 5 rule applications. Total rules 2655 place count 764 transition count 1439
Iterating global reduction 13 with 5 rules applied. Total rules applied 2660 place count 764 transition count 1439
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 13 with 5 rules applied. Total rules applied 2665 place count 764 transition count 1434
Applied a total of 2665 rules in 386 ms. Remains 764 /2146 variables (removed 1382) and now considering 1434/2715 (removed 1281) transitions.
// Phase 1: matrix 1434 rows 764 cols
[2025-05-30 06:05:04] [INFO ] Computed 125 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:05:04] [INFO ] Implicit Places using invariants in 562 ms returned [1, 18, 19, 31, 48, 66, 86, 137, 147, 148, 150, 167, 185, 205, 256, 257, 269, 270, 272, 289, 307, 327, 360, 361, 374, 385, 386, 398, 399, 401, 418, 436, 456, 507, 508, 520, 521, 523, 540, 558, 578, 629, 630, 633, 644, 645, 646, 681, 702, 703, 704, 705]
[2025-05-30 06:05:04] [INFO ] Actually due to overlaps returned [681, 646, 48, 167, 289, 418, 540, 31, 147, 150, 269, 272, 398, 401, 520, 523, 644, 702, 148, 270, 399, 521, 645, 703, 1, 18, 256, 257, 385, 386, 507, 508, 629, 630, 704, 19, 66, 86, 137, 185, 205, 307, 327, 436, 456, 558, 578, 633, 705]
Discarding 49 places :
Implicit Place search using SMT only with invariants took 567 ms to find 49 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 715/2146 places, 1434/2715 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 87 rules applied. Total rules applied 87 place count 714 transition count 1348
Reduce places removed 86 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 87 rules applied. Total rules applied 174 place count 628 transition count 1347
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 175 place count 627 transition count 1347
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 175 place count 627 transition count 1320
Deduced a syphon composed of 27 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 55 rules applied. Total rules applied 230 place count 599 transition count 1320
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 242 place count 595 transition count 1312
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 250 place count 587 transition count 1312
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 253 place count 584 transition count 1309
Iterating global reduction 5 with 3 rules applied. Total rules applied 256 place count 584 transition count 1309
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 259 place count 584 transition count 1306
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 6 with 84 rules applied. Total rules applied 343 place count 542 transition count 1264
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 347 place count 540 transition count 1265
Applied a total of 347 rules in 82 ms. Remains 540 /715 variables (removed 175) and now considering 1265/1434 (removed 169) transitions.
// Phase 1: matrix 1265 rows 540 cols
[2025-05-30 06:05:04] [INFO ] Computed 70 invariants in 18 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:05:05] [INFO ] Implicit Places using invariants in 368 ms returned [88, 94, 99, 174, 180, 185, 265, 266, 279, 356, 362, 367, 444, 450, 455, 537]
[2025-05-30 06:05:05] [INFO ] Actually due to overlaps returned [88, 94, 99, 174, 180, 185, 265, 279, 356, 362, 367, 444, 450, 455, 537]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 370 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 525/2146 places, 1265/2715 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 525 transition count 1264
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 524 transition count 1264
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 10 place count 516 transition count 1256
Iterating global reduction 2 with 8 rules applied. Total rules applied 18 place count 516 transition count 1256
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 26 place count 508 transition count 1248
Iterating global reduction 2 with 8 rules applied. Total rules applied 34 place count 508 transition count 1248
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 38 place count 504 transition count 1244
Iterating global reduction 2 with 4 rules applied. Total rules applied 42 place count 504 transition count 1244
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 52 place count 499 transition count 1239
Applied a total of 52 rules in 86 ms. Remains 499 /525 variables (removed 26) and now considering 1239/1265 (removed 26) transitions.
// Phase 1: matrix 1239 rows 499 cols
[2025-05-30 06:05:05] [INFO ] Computed 55 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:05:05] [INFO ] Implicit Places using invariants in 331 ms returned [247]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 332 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 498/2146 places, 1239/2715 transitions.
Applied a total of 0 rules in 15 ms. Remains 498 /498 variables (removed 0) and now considering 1239/1239 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 4 iterations and 1841 ms. Remains : 498/2146 places, 1239/2715 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 10 factoid took 257 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
RANDOM walk for 40000 steps (560 resets) in 173 ms. (229 steps per ms) remains 1/6 properties
BEST_FIRST walk for 17924 steps (54 resets) in 33 ms. (527 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (OR p0 p1))), (F (NOT p0)), (F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 10 factoid took 528 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Product exploration explored 100000 steps with 1680 reset in 198 ms.
Product exploration explored 100000 steps with 1701 reset in 246 ms.
Built C files in :
/tmp/ltsmin14439122985835347326
[2025-05-30 06:05:07] [INFO ] Computing symmetric may disable matrix : 1239 transitions.
[2025-05-30 06:05:07] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 06:05:07] [INFO ] Computing symmetric may enable matrix : 1239 transitions.
[2025-05-30 06:05:07] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 06:05:07] [INFO ] Computing Do-Not-Accords matrix : 1239 transitions.
[2025-05-30 06:05:07] [INFO ] Computation of Completed DNA matrix. took 39 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 06:05:07] [INFO ] Built C files in 302ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14439122985835347326
Running compilation step : cd /tmp/ltsmin14439122985835347326;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14439122985835347326;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14439122985835347326;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 2 out of 498 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 498/498 places, 1239/1239 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 498 transition count 1238
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 497 transition count 1238
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 497 transition count 1237
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 496 transition count 1237
Applied a total of 4 rules in 24 ms. Remains 496 /498 variables (removed 2) and now considering 1237/1239 (removed 2) transitions.
// Phase 1: matrix 1237 rows 496 cols
[2025-05-30 06:05:10] [INFO ] Computed 54 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:05:11] [INFO ] Implicit Places using invariants in 327 ms returned [252]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 329 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 495/498 places, 1237/1239 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 494 transition count 1236
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 493 transition count 1235
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 493 transition count 1235
Applied a total of 4 rules in 36 ms. Remains 493 /495 variables (removed 2) and now considering 1235/1237 (removed 2) transitions.
// Phase 1: matrix 1235 rows 493 cols
[2025-05-30 06:05:11] [INFO ] Computed 53 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:05:11] [INFO ] Implicit Places using invariants in 345 ms returned []
[2025-05-30 06:05:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:05:12] [INFO ] Implicit Places using invariants and state equation in 950 ms returned []
Implicit Place search using SMT with State Equation took 1298 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 493/498 places, 1235/1239 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1687 ms. Remains : 493/498 places, 1235/1239 transitions.
Built C files in :
/tmp/ltsmin9479922461434889911
[2025-05-30 06:05:12] [INFO ] Computing symmetric may disable matrix : 1235 transitions.
[2025-05-30 06:05:12] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 06:05:12] [INFO ] Computing symmetric may enable matrix : 1235 transitions.
[2025-05-30 06:05:12] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 06:05:12] [INFO ] Computing Do-Not-Accords matrix : 1235 transitions.
[2025-05-30 06:05:12] [INFO ] Computation of Completed DNA matrix. took 19 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 06:05:12] [INFO ] Built C files in 266ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9479922461434889911
Running compilation step : cd /tmp/ltsmin9479922461434889911;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9479922461434889911;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9479922461434889911;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-05-30 06:05:16] [INFO ] Flatten gal took : 48 ms
[2025-05-30 06:05:16] [INFO ] Flatten gal took : 45 ms
[2025-05-30 06:05:16] [INFO ] Time to serialize gal into /tmp/LTL2102527613895724500.gal : 14 ms
[2025-05-30 06:05:16] [INFO ] Time to serialize properties into /tmp/LTL2122192744277726882.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/LTL2102527613895724500.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9655546819984383209.hoa' '-atoms' '/tmp/LTL2122192744277726882.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL2122192744277726882.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9655546819984383209.hoa
Detected timeout of ITS tools.
[2025-05-30 06:05:31] [INFO ] Flatten gal took : 44 ms
[2025-05-30 06:05:31] [INFO ] Flatten gal took : 43 ms
[2025-05-30 06:05:31] [INFO ] Time to serialize gal into /tmp/LTL8866158866481593325.gal : 9 ms
[2025-05-30 06:05:31] [INFO ] Time to serialize properties into /tmp/LTL12863241097545121281.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8866158866481593325.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12863241097545121281.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("(p1092==0)"))||(X(("(p2063==1)")||(F(G("(p1131==1)"))))))))
Formula 0 simplified : G(F!"(p1092==0)" & X(!"(p2063==1)" & GF!"(p1131==1)"))
Detected timeout of ITS tools.
[2025-05-30 06:05:46] [INFO ] Flatten gal took : 42 ms
[2025-05-30 06:05:46] [INFO ] Applying decomposition
[2025-05-30 06:05:46] [INFO ] Flatten gal took : 40 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/graph6775368478793132600.txt' '-o' '/tmp/graph6775368478793132600.bin' '-w' '/tmp/graph6775368478793132600.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6775368478793132600.bin' '-l' '-1' '-v' '-w' '/tmp/graph6775368478793132600.weights' '-q' '0' '-e' '0.001'
[2025-05-30 06:05:46] [INFO ] Decomposing Gal with order
[2025-05-30 06:05:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 06:05:46] [INFO ] Removed a total of 2522 redundant transitions.
[2025-05-30 06:05:46] [INFO ] Flatten gal took : 138 ms
[2025-05-30 06:05:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 65 labels/synchronizations in 37 ms.
[2025-05-30 06:05:46] [INFO ] Time to serialize gal into /tmp/LTL3824264564487276552.gal : 11 ms
[2025-05-30 06:05:46] [INFO ] Time to serialize properties into /tmp/LTL16191448727978665355.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/LTL3824264564487276552.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16191448727978665355.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("(i6.u63.p1092==0)"))||(X(("(i8.u105.p2063==1)")||(F(G("(i6.u64.p1131==1)"))))))))
Formula 0 simplified : G(F!"(i6.u63.p1092==0)" & X(!"(i8.u105.p2063==1)" & GF!"(i6.u64.p1131==1)"))
Detected timeout of ITS tools.
Treatment of property ASLink-PT-05b-LTLFireability-07 finished in 136437 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 2153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2153/2153 places, 2722/2722 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 392 transitions
Trivial Post-agglo rules discarded 392 transitions
Performed 392 trivial Post agglomeration. Transition count delta: 392
Iterating post reduction 0 with 392 rules applied. Total rules applied 392 place count 2152 transition count 2329
Reduce places removed 392 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 395 rules applied. Total rules applied 787 place count 1760 transition count 2326
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 789 place count 1758 transition count 2326
Performed 581 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 581 Pre rules applied. Total rules applied 789 place count 1758 transition count 1745
Deduced a syphon composed of 581 places in 3 ms
Ensure Unique test removed 54 places
Reduce places removed 635 places and 0 transitions.
Iterating global reduction 3 with 1216 rules applied. Total rules applied 2005 place count 1123 transition count 1745
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 3 with 39 rules applied. Total rules applied 2044 place count 1118 transition count 1711
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 4 with 34 rules applied. Total rules applied 2078 place count 1084 transition count 1711
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 21 Pre rules applied. Total rules applied 2078 place count 1084 transition count 1690
Deduced a syphon composed of 21 places in 3 ms
Ensure Unique test removed 21 places
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 5 with 63 rules applied. Total rules applied 2141 place count 1042 transition count 1690
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 20 Pre rules applied. Total rules applied 2141 place count 1042 transition count 1670
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 2181 place count 1022 transition count 1670
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 2184 place count 1019 transition count 1667
Iterating global reduction 5 with 3 rules applied. Total rules applied 2187 place count 1019 transition count 1667
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 2187 place count 1019 transition count 1666
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 2189 place count 1018 transition count 1666
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 2191 place count 1016 transition count 1657
Iterating global reduction 5 with 2 rules applied. Total rules applied 2193 place count 1016 transition count 1657
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2194 place count 1015 transition count 1649
Iterating global reduction 5 with 1 rules applied. Total rules applied 2195 place count 1015 transition count 1649
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2196 place count 1014 transition count 1641
Iterating global reduction 5 with 1 rules applied. Total rules applied 2197 place count 1014 transition count 1641
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2198 place count 1013 transition count 1633
Iterating global reduction 5 with 1 rules applied. Total rules applied 2199 place count 1013 transition count 1633
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2200 place count 1012 transition count 1625
Iterating global reduction 5 with 1 rules applied. Total rules applied 2201 place count 1012 transition count 1625
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2202 place count 1011 transition count 1617
Iterating global reduction 5 with 1 rules applied. Total rules applied 2203 place count 1011 transition count 1617
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2204 place count 1010 transition count 1609
Iterating global reduction 5 with 1 rules applied. Total rules applied 2205 place count 1010 transition count 1609
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2206 place count 1009 transition count 1601
Iterating global reduction 5 with 1 rules applied. Total rules applied 2207 place count 1009 transition count 1601
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2208 place count 1008 transition count 1593
Iterating global reduction 5 with 1 rules applied. Total rules applied 2209 place count 1008 transition count 1593
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2210 place count 1007 transition count 1585
Iterating global reduction 5 with 1 rules applied. Total rules applied 2211 place count 1007 transition count 1585
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2212 place count 1006 transition count 1577
Iterating global reduction 5 with 1 rules applied. Total rules applied 2213 place count 1006 transition count 1577
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2214 place count 1005 transition count 1569
Iterating global reduction 5 with 1 rules applied. Total rules applied 2215 place count 1005 transition count 1569
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2216 place count 1004 transition count 1561
Iterating global reduction 5 with 1 rules applied. Total rules applied 2217 place count 1004 transition count 1561
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2218 place count 1003 transition count 1553
Iterating global reduction 5 with 1 rules applied. Total rules applied 2219 place count 1003 transition count 1553
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2220 place count 1002 transition count 1545
Iterating global reduction 5 with 1 rules applied. Total rules applied 2221 place count 1002 transition count 1545
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2222 place count 1001 transition count 1537
Iterating global reduction 5 with 1 rules applied. Total rules applied 2223 place count 1001 transition count 1537
Performed 171 Post agglomeration using F-continuation condition.Transition count delta: 171
Deduced a syphon composed of 171 places in 2 ms
Ensure Unique test removed 2 places
Reduce places removed 173 places and 0 transitions.
Iterating global reduction 5 with 344 rules applied. Total rules applied 2567 place count 828 transition count 1366
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 2571 place count 824 transition count 1362
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 2576 place count 823 transition count 1362
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 2577 place count 823 transition count 1361
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2578 place count 822 transition count 1361
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 2578 place count 822 transition count 1360
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 2580 place count 821 transition count 1360
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 2582 place count 819 transition count 1358
Iterating global reduction 7 with 2 rules applied. Total rules applied 2584 place count 819 transition count 1358
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 2586 place count 819 transition count 1356
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2587 place count 818 transition count 1356
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2589 place count 817 transition count 1361
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2591 place count 815 transition count 1359
Reduce places removed 10 places and 0 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 9 with 15 rules applied. Total rules applied 2606 place count 805 transition count 1354
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 2611 place count 800 transition count 1354
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 15 Pre rules applied. Total rules applied 2611 place count 800 transition count 1339
Deduced a syphon composed of 15 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 11 with 31 rules applied. Total rules applied 2642 place count 784 transition count 1339
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 11 with 11 rules applied. Total rules applied 2653 place count 773 transition count 1339
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 2653 place count 773 transition count 1338
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 2655 place count 772 transition count 1338
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 12 with 30 rules applied. Total rules applied 2685 place count 757 transition count 1323
Discarding 9 places :
Symmetric choice reduction at 12 with 9 rule applications. Total rules 2694 place count 748 transition count 1314
Iterating global reduction 12 with 9 rules applied. Total rules applied 2703 place count 748 transition count 1314
Discarding 5 places :
Symmetric choice reduction at 12 with 5 rule applications. Total rules 2708 place count 743 transition count 1309
Iterating global reduction 12 with 5 rules applied. Total rules applied 2713 place count 743 transition count 1309
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 12 with 5 rules applied. Total rules applied 2718 place count 743 transition count 1304
Applied a total of 2718 rules in 836 ms. Remains 743 /2153 variables (removed 1410) and now considering 1304/2722 (removed 1418) transitions.
// Phase 1: matrix 1304 rows 743 cols
[2025-05-30 06:06:02] [INFO ] Computed 122 invariants in 18 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:06:03] [INFO ] Implicit Places using invariants in 615 ms returned [1, 18, 19, 31, 48, 66, 86, 137, 147, 148, 150, 167, 185, 205, 256, 257, 269, 270, 272, 289, 307, 327, 378, 379, 391, 392, 394, 411, 429, 449, 500, 501, 513, 514, 516, 533, 551, 571, 625, 626, 629, 640, 641, 642, 660, 681, 682, 683, 684]
Discarding 49 places :
Implicit Place search using SMT only with invariants took 633 ms to find 49 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 694/2153 places, 1304/2722 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 89 transitions
Trivial Post-agglo rules discarded 89 transitions
Performed 89 trivial Post agglomeration. Transition count delta: 89
Iterating post reduction 0 with 89 rules applied. Total rules applied 89 place count 694 transition count 1215
Reduce places removed 89 places and 0 transitions.
Iterating post reduction 1 with 89 rules applied. Total rules applied 178 place count 605 transition count 1215
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 178 place count 605 transition count 1188
Deduced a syphon composed of 27 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 55 rules applied. Total rules applied 233 place count 577 transition count 1188
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 245 place count 573 transition count 1180
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 253 place count 565 transition count 1180
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 256 place count 562 transition count 1177
Iterating global reduction 4 with 3 rules applied. Total rules applied 259 place count 562 transition count 1177
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 262 place count 562 transition count 1174
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 5 with 82 rules applied. Total rules applied 344 place count 521 transition count 1133
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 348 place count 519 transition count 1134
Applied a total of 348 rules in 65 ms. Remains 519 /694 variables (removed 175) and now considering 1134/1304 (removed 170) transitions.
// Phase 1: matrix 1134 rows 519 cols
[2025-05-30 06:06:03] [INFO ] Computed 68 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:06:03] [INFO ] Implicit Places using invariants in 364 ms returned [88, 94, 99, 174, 180, 185, 262, 268, 273, 350, 356, 361, 439, 445, 450, 516]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 365 ms to find 16 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 503/2153 places, 1134/2722 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 503 transition count 1133
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 502 transition count 1133
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 12 place count 492 transition count 1123
Iterating global reduction 2 with 10 rules applied. Total rules applied 22 place count 492 transition count 1123
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 32 place count 482 transition count 1113
Iterating global reduction 2 with 10 rules applied. Total rules applied 42 place count 482 transition count 1113
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 47 place count 477 transition count 1108
Iterating global reduction 2 with 5 rules applied. Total rules applied 52 place count 477 transition count 1108
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 62 place count 472 transition count 1103
Applied a total of 62 rules in 59 ms. Remains 472 /503 variables (removed 31) and now considering 1103/1134 (removed 31) transitions.
// Phase 1: matrix 1103 rows 472 cols
[2025-05-30 06:06:03] [INFO ] Computed 52 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:06:04] [INFO ] Implicit Places using invariants in 303 ms returned []
[2025-05-30 06:06:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:06:05] [INFO ] Implicit Places using invariants and state equation in 899 ms returned []
Implicit Place search using SMT with State Equation took 1206 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 472/2153 places, 1103/2722 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 3164 ms. Remains : 472/2153 places, 1103/2722 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-05b-LTLFireability-09
Stuttering criterion allowed to conclude after 63 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-05b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-05b-LTLFireability-09 finished in 3221 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!X(X(((p0 U p1)&&p2))) U p0))'
Support contains 4 out of 2153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2153/2153 places, 2722/2722 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 2149 transition count 2718
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 2149 transition count 2718
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 2147 transition count 2709
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 2147 transition count 2709
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 2145 transition count 2707
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 2145 transition count 2707
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 2143 transition count 2698
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 2143 transition count 2698
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 2141 transition count 2689
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 2141 transition count 2689
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 2140 transition count 2688
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 2140 transition count 2688
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 2139 transition count 2680
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 2139 transition count 2680
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 2138 transition count 2672
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 2138 transition count 2672
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 2137 transition count 2671
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 2137 transition count 2671
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 2136 transition count 2663
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 2136 transition count 2663
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 2135 transition count 2655
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 2135 transition count 2655
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 2134 transition count 2654
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 2134 transition count 2654
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 2133 transition count 2646
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 2133 transition count 2646
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 2132 transition count 2638
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 2132 transition count 2638
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 2131 transition count 2637
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 2131 transition count 2637
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 2130 transition count 2629
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 2130 transition count 2629
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 2129 transition count 2621
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 2129 transition count 2621
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 2128 transition count 2620
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 2128 transition count 2620
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 2127 transition count 2612
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 2127 transition count 2612
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 2126 transition count 2604
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 2126 transition count 2604
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 2125 transition count 2603
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 2125 transition count 2603
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 2124 transition count 2595
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 2124 transition count 2595
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 2123 transition count 2587
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 2123 transition count 2587
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 2122 transition count 2586
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 2122 transition count 2586
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 2121 transition count 2578
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 2121 transition count 2578
Applied a total of 64 rules in 3243 ms. Remains 2121 /2153 variables (removed 32) and now considering 2578/2722 (removed 144) transitions.
// Phase 1: matrix 2578 rows 2121 cols
[2025-05-30 06:06:08] [INFO ] Computed 227 invariants in 24 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:06:09] [INFO ] Implicit Places using invariants in 1108 ms returned []
[2025-05-30 06:06:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:06:19] [INFO ] Implicit Places using invariants and state equation in 9892 ms returned []
Implicit Place search using SMT with State Equation took 11003 ms to find 0 implicit places.
Running 2577 sub problems to find dead transitions.
[2025-05-30 06:06:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2120 variables, 131/131 constraints. Problems are: Problem set: 0 solved, 2577 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2120/4699 variables, and 131 constraints, problems are : Problem set: 0 solved, 2577 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 0/54 constraints, Generalized P Invariants (flows): 131/173 constraints, State Equation: 0/2121 constraints, PredecessorRefiner: 2577/2577 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2577 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2120 variables, 131/131 constraints. Problems are: Problem set: 0 solved, 2577 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2120/4699 variables, and 131 constraints, problems are : Problem set: 0 solved, 2577 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 0/54 constraints, Generalized P Invariants (flows): 131/173 constraints, State Equation: 0/2121 constraints, PredecessorRefiner: 0/2577 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60717ms problems are : Problem set: 0 solved, 2577 unsolved
Search for dead transitions found 0 dead transitions in 60722ms
Starting structural reductions in LTL mode, iteration 1 : 2121/2153 places, 2578/2722 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 74977 ms. Remains : 2121/2153 places, 2578/2722 transitions.
Stuttering acceptance computed with spot in 189 ms :[(NOT p0), (OR (NOT p0) (AND p1 p2)), (AND p1 p2), true, p1]
Running random walk in product with property : ASLink-PT-05b-LTLFireability-15
Product exploration explored 100000 steps with 24940 reset in 320 ms.
Product exploration explored 100000 steps with 25024 reset in 302 ms.
Computed a total of 86 stabilizing places and 86 stable transitions
Computed a total of 86 stabilizing places and 86 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND p2 p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 94 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p0) (AND p1 p2)), (OR (NOT p0) (AND p1 p2)), (AND p1 p2), true, p1]
RANDOM walk for 40000 steps (78 resets) in 257 ms. (155 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (11 resets) in 154 ms. (258 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 189 ms. (210 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (11 resets) in 125 ms. (317 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (11 resets) in 88 ms. (449 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (10 resets) in 86 ms. (459 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (11 resets) in 58 ms. (678 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 223543 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :0 out of 6
Probabilistic random walk after 223543 steps, saw 39991 distinct states, run finished after 3001 ms. (steps per millisecond=74 ) properties seen :0
[2025-05-30 06:07:24] [INFO ] Invariant cache hit.
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, 6 unsolved
At refinement iteration 1 (OVERLAPS) 150/154 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 425/579 variables, 51/54 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/579 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1483/2062 variables, 165/219 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:07:25] [INFO ] Deduced a trap composed of 22 places in 290 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:07:25] [INFO ] Deduced a trap composed of 24 places in 283 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:07:26] [INFO ] Deduced a trap composed of 41 places in 317 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:07:26] [INFO ] Deduced a trap composed of 43 places in 322 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:07:26] [INFO ] Deduced a trap composed of 45 places in 298 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:07:27] [INFO ] Deduced a trap composed of 53 places in 315 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:07:27] [INFO ] Deduced a trap composed of 55 places in 309 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:07:27] [INFO ] Deduced a trap composed of 25 places in 280 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:07:28] [INFO ] Deduced a trap composed of 57 places in 310 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:07:28] [INFO ] Deduced a trap composed of 79 places in 269 ms of which 47 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/2062 variables, 10/229 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2062 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 59/2121 variables, 8/237 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2121 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SMT process timed out in 5019ms, After SMT, problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 2121 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2121/2121 places, 2578/2578 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 388 transitions
Trivial Post-agglo rules discarded 388 transitions
Performed 388 trivial Post agglomeration. Transition count delta: 388
Iterating post reduction 0 with 388 rules applied. Total rules applied 388 place count 2121 transition count 2190
Reduce places removed 388 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 391 rules applied. Total rules applied 779 place count 1733 transition count 2187
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 782 place count 1731 transition count 2186
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 783 place count 1730 transition count 2186
Performed 573 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 573 Pre rules applied. Total rules applied 783 place count 1730 transition count 1613
Deduced a syphon composed of 573 places in 2 ms
Ensure Unique test removed 53 places
Reduce places removed 626 places and 0 transitions.
Iterating global reduction 4 with 1199 rules applied. Total rules applied 1982 place count 1104 transition count 1613
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 4 with 39 rules applied. Total rules applied 2021 place count 1099 transition count 1579
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 5 with 34 rules applied. Total rules applied 2055 place count 1065 transition count 1579
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 20 Pre rules applied. Total rules applied 2055 place count 1065 transition count 1559
Deduced a syphon composed of 20 places in 3 ms
Ensure Unique test removed 20 places
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 6 with 60 rules applied. Total rules applied 2115 place count 1025 transition count 1559
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 19 Pre rules applied. Total rules applied 2115 place count 1025 transition count 1540
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 6 with 38 rules applied. Total rules applied 2153 place count 1006 transition count 1540
Performed 171 Post agglomeration using F-continuation condition.Transition count delta: 171
Deduced a syphon composed of 171 places in 2 ms
Ensure Unique test removed 2 places
Reduce places removed 173 places and 0 transitions.
Iterating global reduction 6 with 344 rules applied. Total rules applied 2497 place count 833 transition count 1369
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 2501 place count 829 transition count 1365
Ensure Unique test removed 1 places
Iterating global reduction 6 with 5 rules applied. Total rules applied 2506 place count 828 transition count 1365
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 2507 place count 828 transition count 1364
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2508 place count 827 transition count 1364
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 2508 place count 827 transition count 1363
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 2510 place count 826 transition count 1363
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 2512 place count 824 transition count 1361
Iterating global reduction 8 with 2 rules applied. Total rules applied 2514 place count 824 transition count 1361
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 2516 place count 824 transition count 1359
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 2517 place count 823 transition count 1359
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 2519 place count 822 transition count 1364
Free-agglomeration rule applied 6 times.
Iterating global reduction 10 with 6 rules applied. Total rules applied 2525 place count 822 transition count 1358
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 2531 place count 816 transition count 1358
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 11 with 4 rules applied. Total rules applied 2535 place count 816 transition count 1354
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 2539 place count 812 transition count 1354
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 12 with 5 rules applied. Total rules applied 2544 place count 812 transition count 1354
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 2545 place count 811 transition count 1353
Reduce places removed 10 places and 0 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 12 with 15 rules applied. Total rules applied 2560 place count 801 transition count 1348
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 13 with 5 rules applied. Total rules applied 2565 place count 796 transition count 1348
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 15 Pre rules applied. Total rules applied 2565 place count 796 transition count 1333
Deduced a syphon composed of 15 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 14 with 31 rules applied. Total rules applied 2596 place count 780 transition count 1333
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 14 with 6 rules applied. Total rules applied 2602 place count 774 transition count 1333
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 1 Pre rules applied. Total rules applied 2602 place count 774 transition count 1332
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 2604 place count 773 transition count 1332
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 15 with 22 rules applied. Total rules applied 2626 place count 762 transition count 1321
Discarding 5 places :
Symmetric choice reduction at 15 with 5 rule applications. Total rules 2631 place count 757 transition count 1316
Iterating global reduction 15 with 5 rules applied. Total rules applied 2636 place count 757 transition count 1316
Free-agglomeration rule applied 5 times.
Iterating global reduction 15 with 5 rules applied. Total rules applied 2641 place count 757 transition count 1311
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 15 with 5 rules applied. Total rules applied 2646 place count 752 transition count 1311
Applied a total of 2646 rules in 404 ms. Remains 752 /2121 variables (removed 1369) and now considering 1311/2578 (removed 1267) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 404 ms. Remains : 752/2121 places, 1311/2578 transitions.
RANDOM walk for 40000 steps (503 resets) in 191 ms. (208 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (89 resets) in 68 ms. (579 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (89 resets) in 67 ms. (588 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (83 resets) in 64 ms. (615 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (88 resets) in 66 ms. (597 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (85 resets) in 70 ms. (563 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (84 resets) in 74 ms. (533 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 314474 steps, run timeout after 3001 ms. (steps per millisecond=104 ) properties seen :0 out of 6
Probabilistic random walk after 314474 steps, saw 64515 distinct states, run finished after 3001 ms. (steps per millisecond=104 ) properties seen :0
// Phase 1: matrix 1311 rows 752 cols
[2025-05-30 06:07:33] [INFO ] Computed 129 invariants in 8 ms
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, 6 unsolved
At refinement iteration 1 (OVERLAPS) 50/54 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 3/57 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 172/229 variables, 19/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 65/294 variables, 13/38 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/294 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 2/296 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/296 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 214/510 variables, 37/77 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/510 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 41/551 variables, 9/86 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/551 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 3/554 variables, 3/89 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/554 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 155/709 variables, 26/115 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/709 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 4/713 variables, 4/119 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/713 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 37/750 variables, 9/128 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/750 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 2/752 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/752 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (OVERLAPS) 1311/2063 variables, 752/881 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2063 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (OVERLAPS) 0/2063 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2063/2063 variables, and 881 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2498 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 92/92 constraints, State Equation: 752/752 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 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, 6 unsolved
At refinement iteration 1 (OVERLAPS) 50/54 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 3/57 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 172/229 variables, 19/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 65/294 variables, 13/38 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/294 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 2/296 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/296 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 214/510 variables, 37/77 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/510 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 41/551 variables, 9/86 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/551 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 3/554 variables, 3/89 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/554 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 155/709 variables, 26/115 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/709 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 4/713 variables, 4/119 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/713 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 37/750 variables, 9/128 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/750 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 2/752 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/752 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (OVERLAPS) 1311/2063 variables, 752/881 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2063 variables, 6/887 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2063 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 28 (OVERLAPS) 0/2063 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2063/2063 variables, and 887 constraints, problems are : Problem set: 0 solved, 6 unsolved in 3005 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 92/92 constraints, State Equation: 752/752 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5519ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 2 properties in 4236 ms.
Support contains 4 out of 752 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 752/752 places, 1311/1311 transitions.
Applied a total of 0 rules in 22 ms. Remains 752 /752 variables (removed 0) and now considering 1311/1311 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 752/752 places, 1311/1311 transitions.
RANDOM walk for 40000 steps (505 resets) in 233 ms. (170 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (85 resets) in 71 ms. (555 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (89 resets) in 58 ms. (678 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (89 resets) in 54 ms. (727 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (85 resets) in 60 ms. (655 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 317701 steps, run timeout after 3001 ms. (steps per millisecond=105 ) properties seen :0 out of 4
Probabilistic random walk after 317701 steps, saw 64897 distinct states, run finished after 3001 ms. (steps per millisecond=105 ) properties seen :0
[2025-05-30 06:07:46] [INFO ] Invariant cache hit.
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) 50/54 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 3/57 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 172/229 variables, 19/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 65/294 variables, 13/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/294 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2/296 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/296 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 214/510 variables, 37/77 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/510 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 41/551 variables, 9/86 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/551 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 3/554 variables, 3/89 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/554 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 155/709 variables, 26/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/709 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 4/713 variables, 4/119 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/713 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 37/750 variables, 9/128 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/750 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 2/752 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/752 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 1311/2063 variables, 752/881 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2063 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 0/2063 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2063/2063 variables, and 881 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1263 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 92/92 constraints, State Equation: 752/752 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 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) 50/54 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 3/57 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 172/229 variables, 19/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 65/294 variables, 13/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/294 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2/296 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/296 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 214/510 variables, 37/77 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/510 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 41/551 variables, 9/86 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/551 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 3/554 variables, 3/89 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/554 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 155/709 variables, 26/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/709 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 4/713 variables, 4/119 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/713 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 37/750 variables, 9/128 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/750 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 2/752 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/752 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 1311/2063 variables, 752/881 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2063 variables, 4/885 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:07:49] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:07:49] [INFO ] Deduced a trap composed of 28 places in 113 ms of which 12 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/2063 variables, 2/887 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2063 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (OVERLAPS) 0/2063 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2063/2063 variables, and 887 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2864 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 92/92 constraints, State Equation: 752/752 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4135ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2022 ms.
Support contains 4 out of 752 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 752/752 places, 1311/1311 transitions.
Applied a total of 0 rules in 21 ms. Remains 752 /752 variables (removed 0) and now considering 1311/1311 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 752/752 places, 1311/1311 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 752/752 places, 1311/1311 transitions.
Applied a total of 0 rules in 21 ms. Remains 752 /752 variables (removed 0) and now considering 1311/1311 (removed 0) transitions.
[2025-05-30 06:07:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:07:53] [INFO ] Implicit Places using invariants in 493 ms returned [1, 18, 19, 32, 68, 137, 141, 150, 151, 153, 170, 188, 224, 227, 261, 265, 266, 277, 278, 280, 297, 315, 384, 388, 389, 400, 401, 403, 420, 438, 507, 511, 512, 523, 524, 526, 543, 561, 630, 634, 635, 638, 649, 650, 651, 669, 690, 691, 692, 693]
[2025-05-30 06:07:53] [INFO ] Actually due to overlaps returned [669, 651, 170, 297, 420, 543, 32, 153, 280, 403, 526, 150, 277, 400, 523, 649, 690, 151, 278, 401, 524, 650, 691, 1, 18, 265, 266, 388, 389, 511, 512, 634, 635, 68, 188, 315, 438, 561, 692, 19, 638, 693]
Discarding 42 places :
Implicit Place search using SMT only with invariants took 495 ms to find 42 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 710/752 places, 1311/1311 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 93 rules applied. Total rules applied 93 place count 705 transition count 1223
Reduce places removed 88 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 93 rules applied. Total rules applied 186 place count 617 transition count 1218
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 186 place count 617 transition count 1191
Deduced a syphon composed of 27 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 55 rules applied. Total rules applied 241 place count 589 transition count 1191
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 253 place count 585 transition count 1183
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 261 place count 577 transition count 1183
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 264 place count 574 transition count 1180
Iterating global reduction 4 with 3 rules applied. Total rules applied 267 place count 574 transition count 1180
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 270 place count 574 transition count 1177
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 2 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 5 with 68 rules applied. Total rules applied 338 place count 540 transition count 1143
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 343 place count 535 transition count 1138
Iterating global reduction 5 with 5 rules applied. Total rules applied 348 place count 535 transition count 1138
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 353 place count 535 transition count 1133
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 357 place count 533 transition count 1134
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 6 with 10 rules applied. Total rules applied 367 place count 533 transition count 1124
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 378 place count 522 transition count 1124
Partial Free-agglomeration rule applied 12 times.
Drop transitions (Partial Free agglomeration) removed 12 transitions
Iterating global reduction 7 with 12 rules applied. Total rules applied 390 place count 522 transition count 1124
Applied a total of 390 rules in 104 ms. Remains 522 /710 variables (removed 188) and now considering 1124/1311 (removed 187) transitions.
// Phase 1: matrix 1124 rows 522 cols
[2025-05-30 06:07:53] [INFO ] Computed 76 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:07:53] [INFO ] Implicit Places using invariants in 380 ms returned [76, 96, 104, 110, 111, 114, 115, 168, 177, 180, 188, 194, 197, 199, 204, 205, 258, 274, 280, 283, 285, 290, 291, 344, 360, 366, 369, 371, 376, 377, 430, 446, 452, 455, 457]
[2025-05-30 06:07:53] [INFO ] Actually due to overlaps returned [114, 204, 290, 376, 115, 205, 291, 377, 188, 194, 199, 274, 280, 285, 360, 366, 371, 446, 452, 457, 76, 96, 104, 110, 111, 168, 177, 258, 344, 430]
Discarding 30 places :
Implicit Place search using SMT only with invariants took 381 ms to find 30 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 492/752 places, 1124/1311 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 474 transition count 1106
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 474 transition count 1106
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 42 place count 468 transition count 1100
Iterating global reduction 0 with 6 rules applied. Total rules applied 48 place count 468 transition count 1100
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 466 transition count 1098
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 466 transition count 1098
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 465 transition count 1097
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 465 transition count 1097
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 464 transition count 1096
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 464 transition count 1096
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 76 place count 454 transition count 1086
Free-agglomeration rule applied 15 times.
Iterating global reduction 0 with 15 rules applied. Total rules applied 91 place count 454 transition count 1071
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 106 place count 439 transition count 1071
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 111 place count 439 transition count 1066
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 116 place count 434 transition count 1066
Applied a total of 116 rules in 99 ms. Remains 434 /492 variables (removed 58) and now considering 1066/1124 (removed 58) transitions.
// Phase 1: matrix 1066 rows 434 cols
[2025-05-30 06:07:53] [INFO ] Computed 46 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:07:53] [INFO ] Implicit Places using invariants in 299 ms returned [155]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 300 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 433/752 places, 1066/1311 transitions.
Applied a total of 0 rules in 13 ms. Remains 433 /433 variables (removed 0) and now considering 1066/1066 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 1414 ms. Remains : 433/752 places, 1066/1311 transitions.
RANDOM walk for 40000 steps (747 resets) in 143 ms. (277 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (166 resets) in 54 ms. (727 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (167 resets) in 45 ms. (869 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (170 resets) in 45 ms. (869 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (168 resets) in 50 ms. (784 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 359792 steps, run timeout after 3001 ms. (steps per millisecond=119 ) properties seen :0 out of 4
Probabilistic random walk after 359792 steps, saw 92009 distinct states, run finished after 3001 ms. (steps per millisecond=119 ) properties seen :0
// Phase 1: matrix 1066 rows 433 cols
[2025-05-30 06:07:57] [INFO ] Computed 45 invariants in 6 ms
Starting Z3 with timeout 90.0 s and query timeout 9000.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) 42/46 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 220/266 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 46/312 variables, 9/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 121/433 variables, 18/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/433 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1066/1499 variables, 433/478 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1499 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/1499 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1499/1499 variables, and 478 constraints, problems are : Problem set: 0 solved, 4 unsolved in 460 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 433/433 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.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) 42/46 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-30 06:07:57] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 220/266 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/266 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 46/312 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 121/433 variables, 18/46 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/433 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 1066/1499 variables, 433/479 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1499 variables, 4/483 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1499 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/1499 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1499/1499 variables, and 483 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1226 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 433/433 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1702ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1301 ms.
Support contains 4 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 1066/1066 transitions.
Applied a total of 0 rules in 13 ms. Remains 433 /433 variables (removed 0) and now considering 1066/1066 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 433/433 places, 1066/1066 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 1066/1066 transitions.
Applied a total of 0 rules in 13 ms. Remains 433 /433 variables (removed 0) and now considering 1066/1066 (removed 0) transitions.
[2025-05-30 06:08:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:08:00] [INFO ] Implicit Places using invariants in 280 ms returned []
[2025-05-30 06:08:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:08:01] [INFO ] Implicit Places using invariants and state equation in 792 ms returned []
Implicit Place search using SMT with State Equation took 1072 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 06:08:01] [INFO ] Redundant transitions in 11 ms returned []
Running 1037 sub problems to find dead transitions.
[2025-05-30 06:08:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/431 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1037 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/431 variables, 29/38 constraints. Problems are: Problem set: 0 solved, 1037 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/431 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1037 unsolved
At refinement iteration 3 (OVERLAPS) 2/433 variables, 4/42 constraints. Problems are: Problem set: 0 solved, 1037 unsolved
SMT process timed out in 30247ms, After SMT, problems are : Problem set: 0 solved, 1037 unsolved
Search for dead transitions found 0 dead transitions in 30250ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31356 ms. Remains : 433/433 places, 1066/1066 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 15 ms. Remains 433 /433 variables (removed 0) and now considering 1066/1066 (removed 0) transitions.
Running SMT prover for 4 properties.
[2025-05-30 06:08:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-30 06:08:31] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-05-30 06:08:31] [INFO ] [Real]Absence check using 13 positive and 32 generalized place invariants in 13 ms returned sat
[2025-05-30 06:08:31] [INFO ] After 133ms 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-30 06:08:31] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-05-30 06:08:31] [INFO ] [Nat]Absence check using 13 positive and 32 generalized place invariants in 12 ms returned sat
[2025-05-30 06:08:32] [INFO ] After 380ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:08:32] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 9 ms to minimize.
[2025-05-30 06:08:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 140 ms
TRAPS : Iteration 1
[2025-05-30 06:08:32] [INFO ] After 917ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2025-05-30 06:08:32] [INFO ] After 1163ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 1321 ms.
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND p2 p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p2) (NOT p1))))]
Knowledge based reduction with 7 factoid took 173 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p0) (AND p1 p2)), (OR (NOT p0) (AND p1 p2)), (AND p1 p2), true, p1]
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p0) (AND p1 p2)), (OR (NOT p0) (AND p1 p2)), (AND p1 p2), true, p1]
// Phase 1: matrix 2578 rows 2121 cols
[2025-05-30 06:08:33] [INFO ] Computed 227 invariants in 17 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 06:08:34] [INFO ] [Real]Absence check using 54 positive place invariants in 213 ms returned sat
[2025-05-30 06:08:44] [INFO ] [Real]Absence check using 54 positive and 173 generalized place invariants in 9213 ms returned sat
[2025-05-30 06:08:48] [INFO ] [Real]Absence check using state equation in 4237 ms returned unknown
Could not prove EG (NOT p0)
Support contains 4 out of 2121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2121/2121 places, 2578/2578 transitions.
Applied a total of 0 rules in 121 ms. Remains 2121 /2121 variables (removed 0) and now considering 2578/2578 (removed 0) transitions.
[2025-05-30 06:08:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:08:49] [INFO ] Implicit Places using invariants in 1107 ms returned []
[2025-05-30 06:08:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:08:59] [INFO ] Implicit Places using invariants and state equation in 10036 ms returned []
Implicit Place search using SMT with State Equation took 11145 ms to find 0 implicit places.
Running 2577 sub problems to find dead transitions.
[2025-05-30 06:08:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2120 variables, 131/131 constraints. Problems are: Problem set: 0 solved, 2577 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2120/4699 variables, and 131 constraints, problems are : Problem set: 0 solved, 2577 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 0/54 constraints, Generalized P Invariants (flows): 131/173 constraints, State Equation: 0/2121 constraints, PredecessorRefiner: 2577/2577 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2577 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2120 variables, 131/131 constraints. Problems are: Problem set: 0 solved, 2577 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2120/4699 variables, and 131 constraints, problems are : Problem set: 0 solved, 2577 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 0/54 constraints, Generalized P Invariants (flows): 131/173 constraints, State Equation: 0/2121 constraints, PredecessorRefiner: 0/2577 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60737ms problems are : Problem set: 0 solved, 2577 unsolved
Search for dead transitions found 0 dead transitions in 60741ms
Finished structural reductions in LTL mode , in 1 iterations and 72021 ms. Remains : 2121/2121 places, 2578/2578 transitions.
Computed a total of 86 stabilizing places and 86 stable transitions
Computed a total of 86 stabilizing places and 86 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND p2 p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 89 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p0) (AND p1 p2)), (OR (NOT p0) (AND p1 p2)), (AND p1 p2), true, p1]
RANDOM walk for 40000 steps (74 resets) in 210 ms. (189 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40004 steps (10 resets) in 65 ms. (606 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (10 resets) in 63 ms. (625 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (9 resets) in 54 ms. (727 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (10 resets) in 52 ms. (754 steps per ms) remains 4/4 properties
[2025-05-30 06:10:00] [INFO ] Invariant cache hit.
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) 150/154 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 425/579 variables, 51/54 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/579 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1483/2062 variables, 165/219 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2062 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 59/2121 variables, 8/227 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2121 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2578/4699 variables, 2121/2348 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4699 variables, 0/2348 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/4699 variables, 0/2348 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4699/4699 variables, and 2348 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1761 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, Generalized P Invariants (flows): 173/173 constraints, State Equation: 2121/2121 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 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) 150/154 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 425/579 variables, 51/54 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/579 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1483/2062 variables, 165/219 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:10:03] [INFO ] Deduced a trap composed of 35 places in 449 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:10:03] [INFO ] Deduced a trap composed of 37 places in 458 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:10:04] [INFO ] Deduced a trap composed of 39 places in 483 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:10:04] [INFO ] Deduced a trap composed of 42 places in 439 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:10:05] [INFO ] Deduced a trap composed of 42 places in 437 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:10:05] [INFO ] Deduced a trap composed of 47 places in 450 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:10:06] [INFO ] Deduced a trap composed of 72 places in 493 ms of which 119 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:10:06] [INFO ] Deduced a trap composed of 76 places in 441 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:10:07] [INFO ] Deduced a trap composed of 70 places in 427 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:10:07] [INFO ] Deduced a trap composed of 81 places in 364 ms of which 63 ms to minimize.
SMT process timed out in 7142ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 2121 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2121/2121 places, 2578/2578 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 388 transitions
Trivial Post-agglo rules discarded 388 transitions
Performed 388 trivial Post agglomeration. Transition count delta: 388
Iterating post reduction 0 with 388 rules applied. Total rules applied 388 place count 2121 transition count 2190
Reduce places removed 388 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 391 rules applied. Total rules applied 779 place count 1733 transition count 2187
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 782 place count 1731 transition count 2186
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 783 place count 1730 transition count 2186
Performed 573 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 573 Pre rules applied. Total rules applied 783 place count 1730 transition count 1613
Deduced a syphon composed of 573 places in 4 ms
Ensure Unique test removed 53 places
Reduce places removed 626 places and 0 transitions.
Iterating global reduction 4 with 1199 rules applied. Total rules applied 1982 place count 1104 transition count 1613
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 4 with 39 rules applied. Total rules applied 2021 place count 1099 transition count 1579
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 5 with 34 rules applied. Total rules applied 2055 place count 1065 transition count 1579
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 20 Pre rules applied. Total rules applied 2055 place count 1065 transition count 1559
Deduced a syphon composed of 20 places in 2 ms
Ensure Unique test removed 20 places
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 6 with 60 rules applied. Total rules applied 2115 place count 1025 transition count 1559
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 19 Pre rules applied. Total rules applied 2115 place count 1025 transition count 1540
Deduced a syphon composed of 19 places in 3 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 6 with 38 rules applied. Total rules applied 2153 place count 1006 transition count 1540
Performed 171 Post agglomeration using F-continuation condition.Transition count delta: 171
Deduced a syphon composed of 171 places in 2 ms
Ensure Unique test removed 2 places
Reduce places removed 173 places and 0 transitions.
Iterating global reduction 6 with 344 rules applied. Total rules applied 2497 place count 833 transition count 1369
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 2501 place count 829 transition count 1365
Ensure Unique test removed 1 places
Iterating global reduction 6 with 5 rules applied. Total rules applied 2506 place count 828 transition count 1365
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 2507 place count 828 transition count 1364
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2508 place count 827 transition count 1364
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 2508 place count 827 transition count 1363
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 2510 place count 826 transition count 1363
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 2512 place count 824 transition count 1361
Iterating global reduction 8 with 2 rules applied. Total rules applied 2514 place count 824 transition count 1361
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 2516 place count 824 transition count 1359
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 2517 place count 823 transition count 1359
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 2519 place count 822 transition count 1364
Free-agglomeration rule applied 6 times.
Iterating global reduction 10 with 6 rules applied. Total rules applied 2525 place count 822 transition count 1358
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 2531 place count 816 transition count 1358
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 11 with 4 rules applied. Total rules applied 2535 place count 816 transition count 1354
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 2539 place count 812 transition count 1354
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 12 with 5 rules applied. Total rules applied 2544 place count 812 transition count 1354
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 2545 place count 811 transition count 1353
Reduce places removed 10 places and 0 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 12 with 15 rules applied. Total rules applied 2560 place count 801 transition count 1348
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 13 with 5 rules applied. Total rules applied 2565 place count 796 transition count 1348
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 15 Pre rules applied. Total rules applied 2565 place count 796 transition count 1333
Deduced a syphon composed of 15 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 14 with 31 rules applied. Total rules applied 2596 place count 780 transition count 1333
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 14 with 6 rules applied. Total rules applied 2602 place count 774 transition count 1333
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 1 Pre rules applied. Total rules applied 2602 place count 774 transition count 1332
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 2604 place count 773 transition count 1332
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 15 with 22 rules applied. Total rules applied 2626 place count 762 transition count 1321
Discarding 5 places :
Symmetric choice reduction at 15 with 5 rule applications. Total rules 2631 place count 757 transition count 1316
Iterating global reduction 15 with 5 rules applied. Total rules applied 2636 place count 757 transition count 1316
Free-agglomeration rule applied 5 times.
Iterating global reduction 15 with 5 rules applied. Total rules applied 2641 place count 757 transition count 1311
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 15 with 5 rules applied. Total rules applied 2646 place count 752 transition count 1311
Applied a total of 2646 rules in 389 ms. Remains 752 /2121 variables (removed 1369) and now considering 1311/2578 (removed 1267) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 389 ms. Remains : 752/2121 places, 1311/2578 transitions.
RANDOM walk for 40000 steps (474 resets) in 195 ms. (204 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (88 resets) in 68 ms. (579 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (90 resets) in 66 ms. (597 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (85 resets) in 77 ms. (512 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (88 resets) in 75 ms. (526 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 329294 steps, run timeout after 3001 ms. (steps per millisecond=109 ) properties seen :0 out of 4
Probabilistic random walk after 329294 steps, saw 67156 distinct states, run finished after 3001 ms. (steps per millisecond=109 ) properties seen :0
// Phase 1: matrix 1311 rows 752 cols
[2025-05-30 06:10:11] [INFO ] Computed 129 invariants in 10 ms
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) 50/54 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 3/57 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 172/229 variables, 19/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 65/294 variables, 13/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/294 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2/296 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/296 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 214/510 variables, 37/77 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/510 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 41/551 variables, 9/86 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/551 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 3/554 variables, 3/89 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/554 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 155/709 variables, 26/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/709 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 4/713 variables, 4/119 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/713 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 37/750 variables, 9/128 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/750 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 2/752 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/752 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 1311/2063 variables, 752/881 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2063 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 0/2063 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2063/2063 variables, and 881 constraints, problems are : Problem set: 0 solved, 4 unsolved in 982 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 92/92 constraints, State Equation: 752/752 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 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) 50/54 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 3/57 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 172/229 variables, 19/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 65/294 variables, 13/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/294 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2/296 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/296 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 214/510 variables, 37/77 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/510 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 41/551 variables, 9/86 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/551 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 3/554 variables, 3/89 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/554 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 155/709 variables, 26/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/709 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 4/713 variables, 4/119 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/713 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 37/750 variables, 9/128 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/750 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 2/752 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/752 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 1311/2063 variables, 752/881 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2063 variables, 4/885 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:10:14] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:10:14] [INFO ] Deduced a trap composed of 28 places in 112 ms of which 12 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/2063 variables, 2/887 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2063 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (OVERLAPS) 0/2063 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2063/2063 variables, and 887 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2609 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 92/92 constraints, State Equation: 752/752 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3609ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1101 ms.
Support contains 4 out of 752 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 752/752 places, 1311/1311 transitions.
Applied a total of 0 rules in 21 ms. Remains 752 /752 variables (removed 0) and now considering 1311/1311 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 752/752 places, 1311/1311 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 752/752 places, 1311/1311 transitions.
Applied a total of 0 rules in 21 ms. Remains 752 /752 variables (removed 0) and now considering 1311/1311 (removed 0) transitions.
[2025-05-30 06:10:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:10:16] [INFO ] Implicit Places using invariants in 514 ms returned [1, 18, 19, 32, 68, 137, 141, 150, 151, 153, 170, 188, 224, 227, 261, 265, 266, 277, 278, 280, 297, 315, 384, 388, 389, 400, 401, 403, 420, 438, 507, 511, 512, 523, 524, 526, 543, 561, 630, 634, 635, 638, 649, 650, 651, 669, 690, 691, 692, 693]
[2025-05-30 06:10:16] [INFO ] Actually due to overlaps returned [669, 651, 170, 297, 420, 543, 32, 153, 280, 403, 526, 150, 277, 400, 523, 649, 690, 151, 278, 401, 524, 650, 691, 1, 18, 265, 266, 388, 389, 511, 512, 634, 635, 68, 188, 315, 438, 561, 692, 19, 638, 693]
Discarding 42 places :
Implicit Place search using SMT only with invariants took 516 ms to find 42 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 710/752 places, 1311/1311 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 93 rules applied. Total rules applied 93 place count 705 transition count 1223
Reduce places removed 88 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 93 rules applied. Total rules applied 186 place count 617 transition count 1218
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 186 place count 617 transition count 1191
Deduced a syphon composed of 27 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 55 rules applied. Total rules applied 241 place count 589 transition count 1191
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 253 place count 585 transition count 1183
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 261 place count 577 transition count 1183
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 264 place count 574 transition count 1180
Iterating global reduction 4 with 3 rules applied. Total rules applied 267 place count 574 transition count 1180
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 270 place count 574 transition count 1177
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 2 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 5 with 68 rules applied. Total rules applied 338 place count 540 transition count 1143
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 343 place count 535 transition count 1138
Iterating global reduction 5 with 5 rules applied. Total rules applied 348 place count 535 transition count 1138
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 353 place count 535 transition count 1133
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 357 place count 533 transition count 1134
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 6 with 10 rules applied. Total rules applied 367 place count 533 transition count 1124
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 378 place count 522 transition count 1124
Partial Free-agglomeration rule applied 12 times.
Drop transitions (Partial Free agglomeration) removed 12 transitions
Iterating global reduction 7 with 12 rules applied. Total rules applied 390 place count 522 transition count 1124
Applied a total of 390 rules in 109 ms. Remains 522 /710 variables (removed 188) and now considering 1124/1311 (removed 187) transitions.
// Phase 1: matrix 1124 rows 522 cols
[2025-05-30 06:10:16] [INFO ] Computed 76 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:10:17] [INFO ] Implicit Places using invariants in 381 ms returned [76, 96, 104, 110, 111, 114, 115, 168, 177, 180, 188, 194, 197, 199, 204, 205, 258, 274, 280, 283, 285, 290, 291, 344, 360, 366, 369, 371, 376, 377, 430, 446, 452, 455, 457]
[2025-05-30 06:10:17] [INFO ] Actually due to overlaps returned [114, 204, 290, 376, 115, 205, 291, 377, 188, 194, 199, 274, 280, 285, 360, 366, 371, 446, 452, 457, 76, 96, 104, 110, 111, 168, 177, 258, 344, 430]
Discarding 30 places :
Implicit Place search using SMT only with invariants took 383 ms to find 30 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 492/752 places, 1124/1311 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 474 transition count 1106
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 474 transition count 1106
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 42 place count 468 transition count 1100
Iterating global reduction 0 with 6 rules applied. Total rules applied 48 place count 468 transition count 1100
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 466 transition count 1098
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 466 transition count 1098
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 465 transition count 1097
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 465 transition count 1097
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 464 transition count 1096
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 464 transition count 1096
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 76 place count 454 transition count 1086
Free-agglomeration rule applied 15 times.
Iterating global reduction 0 with 15 rules applied. Total rules applied 91 place count 454 transition count 1071
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 106 place count 439 transition count 1071
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 111 place count 439 transition count 1066
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 116 place count 434 transition count 1066
Applied a total of 116 rules in 100 ms. Remains 434 /492 variables (removed 58) and now considering 1066/1124 (removed 58) transitions.
// Phase 1: matrix 1066 rows 434 cols
[2025-05-30 06:10:17] [INFO ] Computed 46 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:10:17] [INFO ] Implicit Places using invariants in 309 ms returned [155]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 326 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 433/752 places, 1066/1311 transitions.
Applied a total of 0 rules in 13 ms. Remains 433 /433 variables (removed 0) and now considering 1066/1066 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 1468 ms. Remains : 433/752 places, 1066/1311 transitions.
RANDOM walk for 40000 steps (733 resets) in 137 ms. (289 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (171 resets) in 49 ms. (800 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (183 resets) in 48 ms. (816 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (176 resets) in 51 ms. (769 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (172 resets) in 55 ms. (714 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 370001 steps, run timeout after 3001 ms. (steps per millisecond=123 ) properties seen :0 out of 4
Probabilistic random walk after 370001 steps, saw 94138 distinct states, run finished after 3001 ms. (steps per millisecond=123 ) properties seen :0
// Phase 1: matrix 1066 rows 433 cols
[2025-05-30 06:10:20] [INFO ] Computed 45 invariants in 6 ms
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) 42/46 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 220/266 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 46/312 variables, 9/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 121/433 variables, 18/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/433 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1066/1499 variables, 433/478 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1499 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/1499 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1499/1499 variables, and 478 constraints, problems are : Problem set: 0 solved, 4 unsolved in 468 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 433/433 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 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) 42/46 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-30 06:10:21] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 220/266 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/266 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 46/312 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 121/433 variables, 18/46 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/433 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 1066/1499 variables, 433/479 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1499 variables, 4/483 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1499 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/1499 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1499/1499 variables, and 483 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1137 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 433/433 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1616ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 756 ms.
Support contains 4 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 1066/1066 transitions.
Applied a total of 0 rules in 14 ms. Remains 433 /433 variables (removed 0) and now considering 1066/1066 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 433/433 places, 1066/1066 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 1066/1066 transitions.
Applied a total of 0 rules in 13 ms. Remains 433 /433 variables (removed 0) and now considering 1066/1066 (removed 0) transitions.
[2025-05-30 06:10:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:10:23] [INFO ] Implicit Places using invariants in 283 ms returned []
[2025-05-30 06:10:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:10:24] [INFO ] Implicit Places using invariants and state equation in 801 ms returned []
Implicit Place search using SMT with State Equation took 1094 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 06:10:24] [INFO ] Redundant transitions in 52 ms returned []
Running 1037 sub problems to find dead transitions.
[2025-05-30 06:10:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/431 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1037 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/431 variables, 29/38 constraints. Problems are: Problem set: 0 solved, 1037 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/431 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1037 unsolved
At refinement iteration 3 (OVERLAPS) 2/433 variables, 4/42 constraints. Problems are: Problem set: 0 solved, 1037 unsolved
SMT process timed out in 30268ms, After SMT, problems are : Problem set: 0 solved, 1037 unsolved
Search for dead transitions found 0 dead transitions in 30270ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31434 ms. Remains : 433/433 places, 1066/1066 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 14 ms. Remains 433 /433 variables (removed 0) and now considering 1066/1066 (removed 0) transitions.
Running SMT prover for 4 properties.
[2025-05-30 06:10:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-30 06:10:54] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-05-30 06:10:54] [INFO ] [Real]Absence check using 13 positive and 32 generalized place invariants in 13 ms returned sat
[2025-05-30 06:10:54] [INFO ] After 113ms 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-30 06:10:54] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-05-30 06:10:54] [INFO ] [Nat]Absence check using 13 positive and 32 generalized place invariants in 20 ms returned sat
[2025-05-30 06:10:55] [INFO ] After 382ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:10:55] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 9 ms to minimize.
[2025-05-30 06:10:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
TRAPS : Iteration 1
[2025-05-30 06:10:55] [INFO ] After 928ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2025-05-30 06:10:56] [INFO ] After 1184ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 1320 ms.
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND p2 p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p2) (NOT p1))))]
Knowledge based reduction with 7 factoid took 152 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p0) (AND p1 p2)), (OR (NOT p0) (AND p1 p2)), (AND p1 p2), true, p1]
Stuttering acceptance computed with spot in 170 ms :[(OR (NOT p0) (AND p1 p2)), (OR (NOT p0) (AND p1 p2)), (AND p1 p2), true, p1]
// Phase 1: matrix 2578 rows 2121 cols
[2025-05-30 06:10:56] [INFO ] Computed 227 invariants in 19 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 06:10:58] [INFO ] [Real]Absence check using 54 positive place invariants in 214 ms returned sat
[2025-05-30 06:11:07] [INFO ] [Real]Absence check using 54 positive and 173 generalized place invariants in 9219 ms returned sat
[2025-05-30 06:11:11] [INFO ] [Real]Absence check using state equation in 4211 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p0) (AND p1 p2)), (OR (NOT p0) (AND p1 p2)), (AND p1 p2), true, p1]
Product exploration explored 100000 steps with 25014 reset in 294 ms.
Product exploration explored 100000 steps with 24970 reset in 284 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p0) (AND p1 p2)), (OR (NOT p0) (AND p1 p2)), (AND p1 p2), true, p1]
Support contains 4 out of 2121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2121/2121 places, 2578/2578 transitions.
Performed 379 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 379 rules applied. Total rules applied 379 place count 2121 transition count 2578
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 380 place count 2121 transition count 2577
Performed 387 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 387 Pre rules applied. Total rules applied 380 place count 2121 transition count 2674
Deduced a syphon composed of 766 places in 5 ms
Iterating global reduction 2 with 387 rules applied. Total rules applied 767 place count 2121 transition count 2674
Discarding 209 places :
Symmetric choice reduction at 2 with 209 rule applications. Total rules 976 place count 1912 transition count 2465
Deduced a syphon composed of 557 places in 4 ms
Iterating global reduction 2 with 209 rules applied. Total rules applied 1185 place count 1912 transition count 2465
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 1185 place count 1912 transition count 2470
Deduced a syphon composed of 562 places in 4 ms
Iterating global reduction 2 with 5 rules applied. Total rules applied 1190 place count 1912 transition count 2470
Performed 363 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 925 places in 3 ms
Iterating global reduction 2 with 363 rules applied. Total rules applied 1553 place count 1912 transition count 2471
Discarding 146 places :
Symmetric choice reduction at 2 with 146 rule applications. Total rules 1699 place count 1766 transition count 2323
Deduced a syphon composed of 783 places in 3 ms
Iterating global reduction 2 with 146 rules applied. Total rules applied 1845 place count 1766 transition count 2323
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1847 place count 1764 transition count 2320
Deduced a syphon composed of 783 places in 3 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1849 place count 1764 transition count 2320
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1851 place count 1764 transition count 2318
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: -107
Deduced a syphon composed of 814 places in 3 ms
Iterating global reduction 3 with 31 rules applied. Total rules applied 1882 place count 1764 transition count 2425
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 1891 place count 1755 transition count 2405
Deduced a syphon composed of 805 places in 3 ms
Iterating global reduction 3 with 9 rules applied. Total rules applied 1900 place count 1755 transition count 2405
Performed 1(complex) Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Deduced a syphon composed of 806 places in 3 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 1901 place count 1755 transition count 2407
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1902 place count 1754 transition count 2405
Deduced a syphon composed of 805 places in 3 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 1903 place count 1754 transition count 2405
Deduced a syphon composed of 805 places in 3 ms
Applied a total of 1903 rules in 1100 ms. Remains 1754 /2121 variables (removed 367) and now considering 2405/2578 (removed 173) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 06:11:13] [INFO ] Redundant transitions in 64 ms returned []
Running 2404 sub problems to find dead transitions.
// Phase 1: matrix 2405 rows 1754 cols
[2025-05-30 06:11:13] [INFO ] Computed 227 invariants in 30 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1753 variables, 159/159 constraints. Problems are: Problem set: 0 solved, 2404 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1753/4159 variables, and 159 constraints, problems are : Problem set: 0 solved, 2404 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/51 constraints, Generalized P Invariants (flows): 159/176 constraints, State Equation: 0/1754 constraints, PredecessorRefiner: 2404/2404 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2404 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1753 variables, 159/159 constraints. Problems are: Problem set: 0 solved, 2404 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1753/4159 variables, and 159 constraints, problems are : Problem set: 0 solved, 2404 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 0/51 constraints, Generalized P Invariants (flows): 159/176 constraints, State Equation: 0/1754 constraints, PredecessorRefiner: 0/2404 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60829ms problems are : Problem set: 0 solved, 2404 unsolved
Search for dead transitions found 0 dead transitions in 60833ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1754/2121 places, 2405/2578 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62012 ms. Remains : 1754/2121 places, 2405/2578 transitions.
Built C files in :
/tmp/ltsmin14973455244454952650
[2025-05-30 06:12:14] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14973455244454952650
Running compilation step : cd /tmp/ltsmin14973455244454952650;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14973455244454952650;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14973455244454952650;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 4 out of 2121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2121/2121 places, 2578/2578 transitions.
Applied a total of 0 rules in 112 ms. Remains 2121 /2121 variables (removed 0) and now considering 2578/2578 (removed 0) transitions.
// Phase 1: matrix 2578 rows 2121 cols
[2025-05-30 06:12:17] [INFO ] Computed 227 invariants in 22 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:12:19] [INFO ] Implicit Places using invariants in 1142 ms returned []
[2025-05-30 06:12:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:12:29] [INFO ] Implicit Places using invariants and state equation in 10274 ms returned []
Implicit Place search using SMT with State Equation took 11419 ms to find 0 implicit places.
Running 2577 sub problems to find dead transitions.
[2025-05-30 06:12:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2120 variables, 131/131 constraints. Problems are: Problem set: 0 solved, 2577 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2120/4699 variables, and 131 constraints, problems are : Problem set: 0 solved, 2577 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 0/54 constraints, Generalized P Invariants (flows): 131/173 constraints, State Equation: 0/2121 constraints, PredecessorRefiner: 2577/2577 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2577 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2120 variables, 131/131 constraints. Problems are: Problem set: 0 solved, 2577 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2120/4699 variables, and 131 constraints, problems are : Problem set: 0 solved, 2577 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 0/54 constraints, Generalized P Invariants (flows): 131/173 constraints, State Equation: 0/2121 constraints, PredecessorRefiner: 0/2577 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60726ms problems are : Problem set: 0 solved, 2577 unsolved
Search for dead transitions found 0 dead transitions in 60731ms
Finished structural reductions in LTL mode , in 1 iterations and 72275 ms. Remains : 2121/2121 places, 2578/2578 transitions.
Built C files in :
/tmp/ltsmin7052164253331264367
[2025-05-30 06:13:30] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7052164253331264367
Running compilation step : cd /tmp/ltsmin7052164253331264367;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7052164253331264367;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7052164253331264367;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-05-30 06:13:33] [INFO ] Flatten gal took : 67 ms
[2025-05-30 06:13:33] [INFO ] Flatten gal took : 64 ms
[2025-05-30 06:13:33] [INFO ] Time to serialize gal into /tmp/LTL2329054001943838858.gal : 10 ms
[2025-05-30 06:13:33] [INFO ] Time to serialize properties into /tmp/LTL1119138104991497783.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/LTL2329054001943838858.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1098705018595223081.hoa' '-atoms' '/tmp/LTL1119138104991497783.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL1119138104991497783.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1098705018595223081.hoa
Detected timeout of ITS tools.
[2025-05-30 06:13:48] [INFO ] Flatten gal took : 59 ms
[2025-05-30 06:13:48] [INFO ] Flatten gal took : 59 ms
[2025-05-30 06:13:48] [INFO ] Time to serialize gal into /tmp/LTL4801697423330582552.gal : 11 ms
[2025-05-30 06:13:48] [INFO ] Time to serialize properties into /tmp/LTL4795732404552219393.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/LTL4801697423330582552.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4795732404552219393.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 : !(((!(X(X((("(p658==1)")U("((p130==1)&&(p287==1))"))&&("(((p2206==1)&&(p658==1))||(p658!=1))")))))U("(p658==1)")))
Formula 0 simplified : !"(p658==1)" & X(!"(p658==1)" W X("(((p2206==1)&&(p658==1))||(p658!=1))" & ("(p658==1)" U "((p130==1)&&(p287==1))")))
Detected timeout of ITS tools.
[2025-05-30 06:14:03] [INFO ] Flatten gal took : 60 ms
[2025-05-30 06:14:03] [INFO ] Applying decomposition
[2025-05-30 06:14:03] [INFO ] Flatten gal took : 61 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/graph18240242375487807690.txt' '-o' '/tmp/graph18240242375487807690.bin' '-w' '/tmp/graph18240242375487807690.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph18240242375487807690.bin' '-l' '-1' '-v' '-w' '/tmp/graph18240242375487807690.weights' '-q' '0' '-e' '0.001'
[2025-05-30 06:14:03] [INFO ] Decomposing Gal with order
[2025-05-30 06:14:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 06:14:04] [INFO ] Removed a total of 1926 redundant transitions.
[2025-05-30 06:14:04] [INFO ] Flatten gal took : 111 ms
[2025-05-30 06:14:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 23 ms.
[2025-05-30 06:14:04] [INFO ] Time to serialize gal into /tmp/LTL3696954364152243246.gal : 22 ms
[2025-05-30 06:14:04] [INFO ] Time to serialize properties into /tmp/LTL5835936483555380041.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/LTL3696954364152243246.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5835936483555380041.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 : !(((!(X(X((("(i6.u222.p658==1)")U("((i3.i0.i0.u50.p130==1)&&(i3.i0.i0.u94.p287==1))"))&&("(((i30.u755.p2206==1)&&(i6.u222.p658==1))||(...202
Formula 0 simplified : !"(i6.u222.p658==1)" & X(!"(i6.u222.p658==1)" W X("(((i30.u755.p2206==1)&&(i6.u222.p658==1))||(i6.u222.p658!=1))" & ("(i6.u222.p658=...215
Detected timeout of ITS tools.
Treatment of property ASLink-PT-05b-LTLFireability-15 finished in 494156 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||X((p1||F(G(p2)))))))'
Found a Shortening insensitive property : ASLink-PT-05b-LTLFireability-07
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Support contains 3 out of 2153 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2153/2153 places, 2722/2722 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 390 transitions
Trivial Post-agglo rules discarded 390 transitions
Performed 390 trivial Post agglomeration. Transition count delta: 390
Iterating post reduction 0 with 390 rules applied. Total rules applied 390 place count 2152 transition count 2331
Reduce places removed 390 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 393 rules applied. Total rules applied 783 place count 1762 transition count 2328
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 786 place count 1760 transition count 2327
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 787 place count 1759 transition count 2327
Performed 580 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 580 Pre rules applied. Total rules applied 787 place count 1759 transition count 1747
Deduced a syphon composed of 580 places in 3 ms
Ensure Unique test removed 52 places
Reduce places removed 632 places and 0 transitions.
Iterating global reduction 4 with 1212 rules applied. Total rules applied 1999 place count 1127 transition count 1747
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 4 with 39 rules applied. Total rules applied 2038 place count 1122 transition count 1713
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 5 with 34 rules applied. Total rules applied 2072 place count 1088 transition count 1713
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 19 Pre rules applied. Total rules applied 2072 place count 1088 transition count 1694
Deduced a syphon composed of 19 places in 2 ms
Ensure Unique test removed 19 places
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 6 with 57 rules applied. Total rules applied 2129 place count 1050 transition count 1694
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 18 Pre rules applied. Total rules applied 2129 place count 1050 transition count 1676
Deduced a syphon composed of 18 places in 3 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 6 with 36 rules applied. Total rules applied 2165 place count 1032 transition count 1676
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 2167 place count 1030 transition count 1674
Iterating global reduction 6 with 2 rules applied. Total rules applied 2169 place count 1030 transition count 1674
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2170 place count 1029 transition count 1673
Iterating global reduction 6 with 1 rules applied. Total rules applied 2171 place count 1029 transition count 1673
Performed 175 Post agglomeration using F-continuation condition.Transition count delta: 175
Deduced a syphon composed of 175 places in 2 ms
Ensure Unique test removed 3 places
Reduce places removed 178 places and 0 transitions.
Iterating global reduction 6 with 353 rules applied. Total rules applied 2524 place count 851 transition count 1498
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 2528 place count 847 transition count 1494
Ensure Unique test removed 1 places
Iterating global reduction 6 with 5 rules applied. Total rules applied 2533 place count 846 transition count 1494
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 2534 place count 846 transition count 1493
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2535 place count 845 transition count 1493
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 2535 place count 845 transition count 1492
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 2537 place count 844 transition count 1492
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 2539 place count 842 transition count 1490
Iterating global reduction 8 with 2 rules applied. Total rules applied 2541 place count 842 transition count 1490
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 2543 place count 842 transition count 1488
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 2544 place count 841 transition count 1488
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 2546 place count 840 transition count 1493
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 2548 place count 838 transition count 1491
Reduce places removed 10 places and 0 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 10 with 15 rules applied. Total rules applied 2563 place count 828 transition count 1486
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 11 with 5 rules applied. Total rules applied 2568 place count 823 transition count 1486
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 15 Pre rules applied. Total rules applied 2568 place count 823 transition count 1471
Deduced a syphon composed of 15 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 12 with 31 rules applied. Total rules applied 2599 place count 807 transition count 1471
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 12 with 11 rules applied. Total rules applied 2610 place count 796 transition count 1471
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 2610 place count 796 transition count 1470
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 2612 place count 795 transition count 1470
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 13 with 32 rules applied. Total rules applied 2644 place count 779 transition count 1454
Discarding 10 places :
Symmetric choice reduction at 13 with 10 rule applications. Total rules 2654 place count 769 transition count 1444
Iterating global reduction 13 with 10 rules applied. Total rules applied 2664 place count 769 transition count 1444
Discarding 5 places :
Symmetric choice reduction at 13 with 5 rule applications. Total rules 2669 place count 764 transition count 1439
Iterating global reduction 13 with 5 rules applied. Total rules applied 2674 place count 764 transition count 1439
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 13 with 5 rules applied. Total rules applied 2679 place count 764 transition count 1434
Applied a total of 2679 rules in 418 ms. Remains 764 /2153 variables (removed 1389) and now considering 1434/2722 (removed 1288) transitions.
// Phase 1: matrix 1434 rows 764 cols
[2025-05-30 06:14:19] [INFO ] Computed 125 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:14:20] [INFO ] Implicit Places using invariants in 583 ms returned [1, 18, 19, 31, 48, 66, 86, 137, 147, 148, 150, 167, 185, 205, 256, 257, 269, 270, 272, 289, 307, 327, 360, 361, 374, 385, 386, 398, 399, 401, 418, 436, 456, 507, 508, 520, 521, 523, 540, 558, 577, 629, 630, 633, 644, 645, 646, 681, 702, 703, 704, 705]
[2025-05-30 06:14:20] [INFO ] Actually due to overlaps returned [681, 646, 48, 167, 289, 418, 540, 31, 147, 150, 269, 272, 398, 401, 520, 523, 644, 702, 148, 270, 399, 521, 645, 703, 1, 18, 256, 257, 385, 386, 507, 508, 629, 630, 704, 19, 66, 86, 137, 185, 205, 307, 327, 436, 456, 558, 577, 633, 705]
Discarding 49 places :
Implicit Place search using SMT only with invariants took 585 ms to find 49 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 715/2153 places, 1434/2722 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 87 rules applied. Total rules applied 87 place count 714 transition count 1348
Reduce places removed 86 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 87 rules applied. Total rules applied 174 place count 628 transition count 1347
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 175 place count 627 transition count 1347
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 175 place count 627 transition count 1320
Deduced a syphon composed of 27 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 55 rules applied. Total rules applied 230 place count 599 transition count 1320
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 242 place count 595 transition count 1312
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 250 place count 587 transition count 1312
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 253 place count 584 transition count 1309
Iterating global reduction 5 with 3 rules applied. Total rules applied 256 place count 584 transition count 1309
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 259 place count 584 transition count 1306
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 6 with 84 rules applied. Total rules applied 343 place count 542 transition count 1264
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 347 place count 540 transition count 1265
Applied a total of 347 rules in 68 ms. Remains 540 /715 variables (removed 175) and now considering 1265/1434 (removed 169) transitions.
// Phase 1: matrix 1265 rows 540 cols
[2025-05-30 06:14:20] [INFO ] Computed 70 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:14:20] [INFO ] Implicit Places using invariants in 367 ms returned [88, 94, 99, 174, 180, 185, 265, 266, 279, 356, 362, 367, 444, 450, 455, 537]
[2025-05-30 06:14:20] [INFO ] Actually due to overlaps returned [88, 94, 99, 174, 180, 185, 265, 279, 356, 362, 367, 444, 450, 455, 537]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 369 ms to find 15 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 525/2153 places, 1265/2722 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 525 transition count 1264
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 524 transition count 1264
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 10 place count 516 transition count 1256
Iterating global reduction 2 with 8 rules applied. Total rules applied 18 place count 516 transition count 1256
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 26 place count 508 transition count 1248
Iterating global reduction 2 with 8 rules applied. Total rules applied 34 place count 508 transition count 1248
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 38 place count 504 transition count 1244
Iterating global reduction 2 with 4 rules applied. Total rules applied 42 place count 504 transition count 1244
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 52 place count 499 transition count 1239
Applied a total of 52 rules in 59 ms. Remains 499 /525 variables (removed 26) and now considering 1239/1265 (removed 26) transitions.
// Phase 1: matrix 1239 rows 499 cols
[2025-05-30 06:14:21] [INFO ] Computed 55 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:14:21] [INFO ] Implicit Places using invariants in 336 ms returned [247]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 337 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 3 : 498/2153 places, 1239/2722 transitions.
Applied a total of 0 rules in 14 ms. Remains 498 /498 variables (removed 0) and now considering 1239/1239 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 4 iterations and 1850 ms. Remains : 498/2153 places, 1239/2722 transitions.
Running random walk in product with property : ASLink-PT-05b-LTLFireability-07
Product exploration explored 100000 steps with 1755 reset in 218 ms.
Product exploration explored 100000 steps with 1704 reset in 249 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p1) p0))), (X (AND (NOT p2) (NOT p1) p0)), (X p0), (X (NOT p1)), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (AND p2 (NOT p1) p0))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 406 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter sensitive) to 6 states, 17 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), false, false, false, false]
RANDOM walk for 40000 steps (544 resets) in 208 ms. (191 steps per ms) remains 4/11 properties
BEST_FIRST walk for 40002 steps (113 resets) in 47 ms. (833 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (112 resets) in 41 ms. (952 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (113 resets) in 50 ms. (784 steps per ms) remains 2/2 properties
// Phase 1: matrix 1239 rows 498 cols
[2025-05-30 06:14:22] [INFO ] Computed 54 invariants in 7 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf2 is UNSAT
Problem apf3 is UNSAT
After SMT solving in domain Real declared 42/1737 variables, and 2 constraints, problems are : Problem set: 2 solved, 0 unsolved in 24 ms.
Refiners :[Positive P Invariants (semi-flows): 2/12 constraints, Generalized P Invariants (flows): 0/42 constraints, State Equation: 0/498 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 35ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p1) p0))), (X (AND (NOT p2) (NOT p1) p0)), (X p0), (X (NOT p1)), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT p1))), (G (OR p0 (NOT p2) p1)), (G (OR p0 (NOT p2) (NOT p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (AND p2 (NOT p1) p0))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0))), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT (AND p0 (NOT p2) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1)))), (F p2), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (OR p0 p2 p1))), (F (NOT p0)), (F p1)]
Knowledge based reduction with 12 factoid took 837 ms. Reduced automaton from 6 states, 17 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Support contains 2 out of 498 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 : 498/498 places, 1239/1239 transitions.
Applied a total of 0 rules in 21 ms. Remains 498 /498 variables (removed 0) and now considering 1239/1239 (removed 0) transitions.
[2025-05-30 06:14:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:14:24] [INFO ] Implicit Places using invariants in 325 ms returned []
[2025-05-30 06:14:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:14:25] [INFO ] Implicit Places using invariants and state equation in 1042 ms returned []
Implicit Place search using SMT with State Equation took 1372 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 06:14:25] [INFO ] Redundant transitions in 13 ms returned []
Running 1200 sub problems to find dead transitions.
[2025-05-30 06:14:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/492 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/492 variables, 27/32 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/492 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 3 (OVERLAPS) 3/495 variables, 7/39 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
SMT process timed out in 30324ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 30326ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 31740 ms. Remains : 498/498 places, 1239/1239 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 10 factoid took 279 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
RANDOM walk for 40000 steps (541 resets) in 111 ms. (357 steps per ms) remains 1/6 properties
BEST_FIRST walk for 26732 steps (80 resets) in 28 ms. (921 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (OR p0 p1))), (F (NOT p0)), (F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 10 factoid took 481 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Product exploration explored 100000 steps with 1708 reset in 201 ms.
Product exploration explored 100000 steps with 1736 reset in 207 ms.
Built C files in :
/tmp/ltsmin14862304918975577476
[2025-05-30 06:14:57] [INFO ] Computing symmetric may disable matrix : 1239 transitions.
[2025-05-30 06:14:57] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 06:14:57] [INFO ] Computing symmetric may enable matrix : 1239 transitions.
[2025-05-30 06:14:57] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 06:14:57] [INFO ] Computing Do-Not-Accords matrix : 1239 transitions.
[2025-05-30 06:14:57] [INFO ] Computation of Completed DNA matrix. took 19 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 06:14:57] [INFO ] Built C files in 237ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14862304918975577476
Running compilation step : cd /tmp/ltsmin14862304918975577476;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14862304918975577476;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14862304918975577476;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 2 out of 498 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 498/498 places, 1239/1239 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 498 transition count 1238
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 497 transition count 1238
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 497 transition count 1237
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 496 transition count 1237
Applied a total of 4 rules in 30 ms. Remains 496 /498 variables (removed 2) and now considering 1237/1239 (removed 2) transitions.
// Phase 1: matrix 1237 rows 496 cols
[2025-05-30 06:15:00] [INFO ] Computed 54 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:15:01] [INFO ] Implicit Places using invariants in 328 ms returned [252]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 329 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 495/498 places, 1237/1239 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 494 transition count 1236
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 493 transition count 1235
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 493 transition count 1235
Applied a total of 4 rules in 36 ms. Remains 493 /495 variables (removed 2) and now considering 1235/1237 (removed 2) transitions.
// Phase 1: matrix 1235 rows 493 cols
[2025-05-30 06:15:01] [INFO ] Computed 53 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:15:01] [INFO ] Implicit Places using invariants in 337 ms returned []
[2025-05-30 06:15:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:15:02] [INFO ] Implicit Places using invariants and state equation in 1181 ms returned []
Implicit Place search using SMT with State Equation took 1520 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 493/498 places, 1235/1239 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1915 ms. Remains : 493/498 places, 1235/1239 transitions.
Built C files in :
/tmp/ltsmin6259532965512065210
[2025-05-30 06:15:02] [INFO ] Computing symmetric may disable matrix : 1235 transitions.
[2025-05-30 06:15:02] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 06:15:02] [INFO ] Computing symmetric may enable matrix : 1235 transitions.
[2025-05-30 06:15:02] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 06:15:02] [INFO ] Computing Do-Not-Accords matrix : 1235 transitions.
[2025-05-30 06:15:02] [INFO ] Computation of Completed DNA matrix. took 19 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 06:15:02] [INFO ] Built C files in 237ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6259532965512065210
Running compilation step : cd /tmp/ltsmin6259532965512065210;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6259532965512065210;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6259532965512065210;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-05-30 06:15:05] [INFO ] Flatten gal took : 30 ms
[2025-05-30 06:15:05] [INFO ] Flatten gal took : 30 ms
[2025-05-30 06:15:05] [INFO ] Time to serialize gal into /tmp/LTL12438174140210093460.gal : 5 ms
[2025-05-30 06:15:05] [INFO ] Time to serialize properties into /tmp/LTL16083978346915134391.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/LTL12438174140210093460.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11550186864617528312.hoa' '-atoms' '/tmp/LTL16083978346915134391.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...320
Loading property file /tmp/LTL16083978346915134391.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11550186864617528312.hoa
Detected timeout of ITS tools.
[2025-05-30 06:15:21] [INFO ] Flatten gal took : 31 ms
[2025-05-30 06:15:21] [INFO ] Flatten gal took : 30 ms
[2025-05-30 06:15:21] [INFO ] Time to serialize gal into /tmp/LTL11267955072337668756.gal : 5 ms
[2025-05-30 06:15:21] [INFO ] Time to serialize properties into /tmp/LTL1259089311794246660.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/LTL11267955072337668756.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1259089311794246660.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("(p1092==0)"))||(X(("(p2063==1)")||(F(G("(p1131==1)"))))))))
Formula 0 simplified : G(F!"(p1092==0)" & X(!"(p2063==1)" & GF!"(p1131==1)"))
Detected timeout of ITS tools.
[2025-05-30 06:15:36] [INFO ] Flatten gal took : 31 ms
[2025-05-30 06:15:36] [INFO ] Applying decomposition
[2025-05-30 06:15:36] [INFO ] Flatten gal took : 31 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/graph1567863088065830638.txt' '-o' '/tmp/graph1567863088065830638.bin' '-w' '/tmp/graph1567863088065830638.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1567863088065830638.bin' '-l' '-1' '-v' '-w' '/tmp/graph1567863088065830638.weights' '-q' '0' '-e' '0.001'
[2025-05-30 06:15:36] [INFO ] Decomposing Gal with order
[2025-05-30 06:15:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 06:15:36] [INFO ] Removed a total of 2539 redundant transitions.
[2025-05-30 06:15:36] [INFO ] Flatten gal took : 51 ms
[2025-05-30 06:15:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 68 labels/synchronizations in 10 ms.
[2025-05-30 06:15:36] [INFO ] Time to serialize gal into /tmp/LTL16645469186105638972.gal : 6 ms
[2025-05-30 06:15:36] [INFO ] Time to serialize properties into /tmp/LTL10879086234972483549.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/LTL16645469186105638972.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10879086234972483549.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F((G("(i5.u63.p1092==0)"))||(X(("(i9.u108.p2063==1)")||(F(G("(i5.u65.p1131==1)"))))))))
Formula 0 simplified : G(F!"(i5.u63.p1092==0)" & X(!"(i9.u108.p2063==1)" & GF!"(i5.u65.p1131==1)"))
Detected timeout of ITS tools.
Treatment of property ASLink-PT-05b-LTLFireability-07 finished in 92104 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!X(X(((p0 U p1)&&p2))) U p0))'
[2025-05-30 06:15:51] [INFO ] Flatten gal took : 54 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11749175625530621499
[2025-05-30 06:15:51] [INFO ] Too many transitions (2722) to apply POR reductions. Disabling POR matrices.
[2025-05-30 06:15:51] [INFO ] Applying decomposition
[2025-05-30 06:15:51] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11749175625530621499
Running compilation step : cd /tmp/ltsmin11749175625530621499;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-05-30 06:15:51] [INFO ] Flatten gal took : 56 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/graph18379094242034465186.txt' '-o' '/tmp/graph18379094242034465186.bin' '-w' '/tmp/graph18379094242034465186.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph18379094242034465186.bin' '-l' '-1' '-v' '-w' '/tmp/graph18379094242034465186.weights' '-q' '0' '-e' '0.001'
[2025-05-30 06:15:51] [INFO ] Decomposing Gal with order
[2025-05-30 06:15:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 06:15:52] [INFO ] Removed a total of 2172 redundant transitions.
[2025-05-30 06:15:52] [INFO ] Flatten gal took : 140 ms
[2025-05-30 06:15:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 11 labels/synchronizations in 21 ms.
[2025-05-30 06:15:52] [INFO ] Time to serialize gal into /tmp/LTLFireability12167923354216512457.gal : 19 ms
[2025-05-30 06:15:52] [INFO ] Time to serialize properties into /tmp/LTLFireability9562059139150505780.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/LTLFireability12167923354216512457.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9562059139150505780.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("(i13.u379.p1092==0)"))||(X(("(i26.u725.p2063==1)")||(F(G("(i14.u394.p1131==1)"))))))))
Formula 0 simplified : G(F!"(i13.u379.p1092==0)" & X(!"(i26.u725.p2063==1)" & GF!"(i14.u394.p1131==1)"))
Compilation finished in 6431 ms.
Running link step : cd /tmp/ltsmin11749175625530621499;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 64 ms.
Running LTSmin : cd /tmp/ltsmin11749175625530621499;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([]((LTLAPp0==true))||X(((LTLAPp1==true)||<>([]((LTLAPp2==true)))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin11749175625530621499;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([]((LTLAPp0==true))||X(((LTLAPp1==true)||<>([]((LTLAPp2==true)))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin11749175625530621499;'/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' '(!X(X((((LTLAPp3==true) U (LTLAPp4==true))&&(LTLAPp5==true)))) U (LTLAPp3==true))' '--buchi-type=spotba'
LTSmin run took 1822 ms.
FORMULA ASLink-PT-05b-LTLFireability-15 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin11749175625530621499;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([]((LTLAPp0==true))||X(((LTLAPp1==true)||<>([]((LTLAPp2==true)))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2025-05-30 06:42:06] [INFO ] Applying decomposition
[2025-05-30 06:42:06] [INFO ] Flatten gal took : 132 ms
[2025-05-30 06:42:07] [INFO ] Decomposing Gal with order
[2025-05-30 06:42:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 06:42:07] [INFO ] Removed a total of 2004 redundant transitions.
[2025-05-30 06:42:07] [INFO ] Flatten gal took : 294 ms
[2025-05-30 06:42:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 2952 labels/synchronizations in 160 ms.
[2025-05-30 06:42:07] [INFO ] Time to serialize gal into /tmp/LTLFireability18026141881033767852.gal : 36 ms
[2025-05-30 06:42:07] [INFO ] Time to serialize properties into /tmp/LTLFireability10683472979343940663.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/LTLFireability18026141881033767852.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10683472979343940663.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...278
Read 1 LTL properties
Checking formula 0 : !((F((G("(i0.i0.i0.i1.i0.i0.i0.i0.i0.i1.i3.i0.u126.p1092==0)"))||(X(("(i1.i0.i0.i0.u250.p2063==1)")||(F(G("(i0.i0.i0.i1.i0.i0.i0.i0.i0...188
Formula 0 simplified : G(F!"(i0.i0.i0.i1.i0.i0.i0.i0.i0.i1.i3.i0.u126.p1092==0)" & X(!"(i1.i0.i0.i0.u250.p2063==1)" & GF!"(i0.i0.i0.i1.i0.i0.i0.i0.i0.i1.i5...176

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="ASLink-PT-05b"
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 ASLink-PT-05b, 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 r002-tall-174853729100356"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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