Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r135-tall-171631131400564.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool greatspnxred
Input is DoubleExponent-PT-020, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-tall-171631131400564
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 788K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 340K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716381165102

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-020
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 12:32:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 12:32:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 12:32:46] [INFO ] Load time of PNML (sax parser for PT used): 105 ms
[2024-05-22 12:32:46] [INFO ] Transformed 1064 places.
[2024-05-22 12:32:46] [INFO ] Transformed 998 transitions.
[2024-05-22 12:32:46] [INFO ] Parsed PT model containing 1064 places and 998 transitions and 2814 arcs in 214 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 DoubleExponent-PT-020-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-020-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-020-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 54 out of 1064 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1064/1064 places, 998/998 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 1060 transition count 998
Applied a total of 4 rules in 126 ms. Remains 1060 /1064 variables (removed 4) and now considering 998/998 (removed 0) transitions.
// Phase 1: matrix 998 rows 1060 cols
[2024-05-22 12:32:47] [INFO ] Invariants computation overflowed in 142 ms
[2024-05-22 12:32:47] [INFO ] Implicit Places using invariants in 644 ms returned []
// Phase 1: matrix 998 rows 1060 cols
[2024-05-22 12:32:47] [INFO ] Invariants computation overflowed in 83 ms
[2024-05-22 12:33:03] [INFO ] Implicit Places using invariants and state equation in 15578 ms returned [28, 30]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 16262 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1058/1064 places, 998/998 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1057 transition count 997
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1057 transition count 997
Applied a total of 2 rules in 170 ms. Remains 1057 /1058 variables (removed 1) and now considering 997/998 (removed 1) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2024-05-22 12:33:03] [INFO ] Invariants computation overflowed in 149 ms
[2024-05-22 12:33:03] [INFO ] Implicit Places using invariants in 443 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2024-05-22 12:33:03] [INFO ] Invariants computation overflowed in 113 ms
[2024-05-22 12:33:17] [INFO ] Implicit Places using invariants and state equation in 13648 ms returned []
Implicit Place search using SMT with State Equation took 14100 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1057/1064 places, 997/998 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30676 ms. Remains : 1057/1064 places, 997/998 transitions.
Support contains 54 out of 1057 places after structural reductions.
[2024-05-22 12:33:17] [INFO ] Flatten gal took : 116 ms
[2024-05-22 12:33:17] [INFO ] Flatten gal took : 55 ms
[2024-05-22 12:33:17] [INFO ] Input system was already deterministic with 997 transitions.
Support contains 52 out of 1057 places (down from 54) after GAL structural reductions.
RANDOM walk for 40000 steps (1344 resets) in 1354 ms. (29 steps per ms) remains 30/32 properties
BEST_FIRST walk for 4001 steps (112 resets) in 76 ms. (51 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4001 steps (107 resets) in 61 ms. (64 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4000 steps (111 resets) in 72 ms. (54 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4000 steps (111 resets) in 77 ms. (51 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4001 steps (118 resets) in 28 ms. (137 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4001 steps (114 resets) in 40 ms. (97 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4000 steps (103 resets) in 57 ms. (68 steps per ms) remains 28/30 properties
BEST_FIRST walk for 4001 steps (116 resets) in 24 ms. (160 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (119 resets) in 21 ms. (181 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (112 resets) in 23 ms. (166 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (113 resets) in 24 ms. (160 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (108 resets) in 35 ms. (111 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (112 resets) in 19 ms. (200 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (112 resets) in 31 ms. (125 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (117 resets) in 24 ms. (160 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (121 resets) in 67 ms. (58 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (113 resets) in 44 ms. (88 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (118 resets) in 21 ms. (181 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (116 resets) in 36 ms. (108 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (115 resets) in 31 ms. (125 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (113 resets) in 24 ms. (160 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (110 resets) in 31 ms. (125 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (112 resets) in 25 ms. (153 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (107 resets) in 24 ms. (160 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (108 resets) in 40 ms. (97 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (107 resets) in 26 ms. (148 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (114 resets) in 28 ms. (137 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (116 resets) in 23 ms. (166 steps per ms) remains 28/28 properties
// Phase 1: matrix 997 rows 1057 cols
[2024-05-22 12:33:19] [INFO ] Invariants computation overflowed in 123 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 122/171 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 408/579 variables, 184/233 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/579 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 559/1138 variables, 276/509 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1138 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 466/1604 variables, 273/782 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1604 variables, 0/782 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 238/1842 variables, 145/927 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1842 variables, 0/927 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 11 (OVERLAPS) 135/1977 variables, 76/1003 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1977 variables, 0/1003 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 13 (OVERLAPS) 67/2044 variables, 46/1049 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2044 variables, 0/1049 constraints. Problems are: Problem set: 0 solved, 28 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2054/2054 variables, and 1057 constraints, problems are : Problem set: 0 solved, 28 unsolved in 5011 ms.
Refiners :[State Equation: 1057/1057 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 122/171 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 408/579 variables, 184/233 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/579 variables, 28/261 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/579 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (OVERLAPS) 559/1138 variables, 276/537 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1138 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (OVERLAPS) 466/1604 variables, 273/810 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1604 variables, 0/810 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (OVERLAPS) 238/1842 variables, 145/955 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1842 variables, 0/955 constraints. Problems are: Problem set: 0 solved, 28 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1977/2054 variables, and 1031 constraints, problems are : Problem set: 0 solved, 28 unsolved in 5017 ms.
Refiners :[State Equation: 1003/1057 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
After SMT, in 10199ms problems are : Problem set: 0 solved, 28 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 49 out of 1057 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1055 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 192 transitions
Trivial Post-agglo rules discarded 192 transitions
Performed 192 trivial Post agglomeration. Transition count delta: 192
Iterating post reduction 0 with 193 rules applied. Total rules applied 194 place count 1055 transition count 803
Reduce places removed 192 places and 0 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 1 with 206 rules applied. Total rules applied 400 place count 863 transition count 789
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 414 place count 849 transition count 789
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 42 Pre rules applied. Total rules applied 414 place count 849 transition count 747
Deduced a syphon composed of 42 places in 10 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 498 place count 807 transition count 747
Performed 162 Post agglomeration using F-continuation condition.Transition count delta: 162
Deduced a syphon composed of 162 places in 15 ms
Reduce places removed 162 places and 0 transitions.
Iterating global reduction 3 with 324 rules applied. Total rules applied 822 place count 645 transition count 585
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 34 places in 10 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 890 place count 611 transition count 585
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 892 place count 611 transition count 583
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 894 place count 609 transition count 583
Free-agglomeration rule (complex) applied 80 times.
Iterating global reduction 4 with 80 rules applied. Total rules applied 974 place count 609 transition count 503
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 4 with 80 rules applied. Total rules applied 1054 place count 529 transition count 503
Partial Free-agglomeration rule applied 79 times.
Drop transitions (Partial Free agglomeration) removed 79 transitions
Iterating global reduction 5 with 79 rules applied. Total rules applied 1133 place count 529 transition count 503
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1134 place count 528 transition count 502
Applied a total of 1134 rules in 336 ms. Remains 528 /1057 variables (removed 529) and now considering 502/997 (removed 495) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 337 ms. Remains : 528/1057 places, 502/997 transitions.
RANDOM walk for 40000 steps (5083 resets) in 515 ms. (77 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (322 resets) in 23 ms. (166 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (343 resets) in 34 ms. (114 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (342 resets) in 20 ms. (190 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (343 resets) in 32 ms. (121 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (345 resets) in 20 ms. (190 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (347 resets) in 18 ms. (210 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (338 resets) in 19 ms. (200 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (347 resets) in 35 ms. (111 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (336 resets) in 17 ms. (222 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (329 resets) in 30 ms. (129 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (324 resets) in 20 ms. (190 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (341 resets) in 43 ms. (90 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (336 resets) in 20 ms. (190 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (346 resets) in 28 ms. (137 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (322 resets) in 26 ms. (148 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (344 resets) in 27 ms. (142 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (331 resets) in 24 ms. (160 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (336 resets) in 28 ms. (138 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (335 resets) in 20 ms. (190 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (336 resets) in 18 ms. (210 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (328 resets) in 23 ms. (166 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (352 resets) in 20 ms. (190 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (306 resets) in 34 ms. (114 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (328 resets) in 44 ms. (88 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (343 resets) in 21 ms. (181 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (335 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (340 resets) in 17 ms. (222 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (325 resets) in 26 ms. (148 steps per ms) remains 28/28 properties
Interrupted probabilistic random walk after 161863 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :1 out of 28
Probabilistic random walk after 161863 steps, saw 80952 distinct states, run finished after 3004 ms. (steps per millisecond=53 ) properties seen :1
// Phase 1: matrix 502 rows 528 cols
[2024-05-22 12:33:33] [INFO ] Invariants computation overflowed in 53 ms
[2024-05-22 12:33:33] [INFO ] State equation strengthened by 65 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 155/204 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (OVERLAPS) 482/686 variables, 232/284 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/686 variables, 24/308 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/686 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (OVERLAPS) 312/998 variables, 217/525 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/998 variables, 37/562 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/998 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 27 unsolved
Problem AtomicPropp28 is UNSAT
At refinement iteration 10 (OVERLAPS) 32/1030 variables, 30/592 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1030 variables, 1/593 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1030 variables, 0/593 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 13 (OVERLAPS) 0/1030 variables, 0/593 constraints. Problems are: Problem set: 1 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1030/1030 variables, and 593 constraints, problems are : Problem set: 1 solved, 26 unsolved in 6174 ms.
Refiners :[State Equation: 528/528 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 145/191 variables, 46/46 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 3/49 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 0/49 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 4 (OVERLAPS) 459/650 variables, 220/269 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 24/293 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/650 variables, 25/318 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/650 variables, 0/318 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 8 (OVERLAPS) 327/977 variables, 216/534 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/977 variables, 35/569 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/977 variables, 1/570 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/977 variables, 0/570 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 12 (OVERLAPS) 52/1029 variables, 45/615 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1029 variables, 3/618 constraints. Problems are: Problem set: 1 solved, 26 unsolved
[2024-05-22 12:33:48] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 13 ms to minimize.
[2024-05-22 12:33:49] [INFO ] Deduced a trap composed of 55 places in 74 ms of which 2 ms to minimize.
[2024-05-22 12:33:49] [INFO ] Deduced a trap composed of 51 places in 81 ms of which 1 ms to minimize.
[2024-05-22 12:33:49] [INFO ] Deduced a trap composed of 57 places in 110 ms of which 2 ms to minimize.
[2024-05-22 12:33:50] [INFO ] Deduced a trap composed of 64 places in 199 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1029 variables, 5/623 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1029 variables, 0/623 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 16 (OVERLAPS) 1/1030 variables, 1/624 constraints. Problems are: Problem set: 1 solved, 26 unsolved
[2024-05-22 12:33:57] [INFO ] Deduced a trap composed of 34 places in 118 ms of which 3 ms to minimize.
[2024-05-22 12:33:57] [INFO ] Deduced a trap composed of 30 places in 121 ms of which 2 ms to minimize.
[2024-05-22 12:33:57] [INFO ] Deduced a trap composed of 45 places in 115 ms of which 3 ms to minimize.
[2024-05-22 12:33:57] [INFO ] Deduced a trap composed of 41 places in 114 ms of which 2 ms to minimize.
[2024-05-22 12:33:57] [INFO ] Deduced a trap composed of 80 places in 94 ms of which 1 ms to minimize.
[2024-05-22 12:33:57] [INFO ] Deduced a trap composed of 71 places in 94 ms of which 2 ms to minimize.
[2024-05-22 12:33:58] [INFO ] Deduced a trap composed of 116 places in 89 ms of which 2 ms to minimize.
[2024-05-22 12:33:58] [INFO ] Deduced a trap composed of 113 places in 85 ms of which 1 ms to minimize.
[2024-05-22 12:33:58] [INFO ] Deduced a trap composed of 118 places in 85 ms of which 1 ms to minimize.
[2024-05-22 12:33:58] [INFO ] Deduced a trap composed of 79 places in 94 ms of which 2 ms to minimize.
[2024-05-22 12:33:58] [INFO ] Deduced a trap composed of 115 places in 90 ms of which 2 ms to minimize.
[2024-05-22 12:33:58] [INFO ] Deduced a trap composed of 43 places in 110 ms of which 2 ms to minimize.
[2024-05-22 12:33:59] [INFO ] Deduced a trap composed of 121 places in 85 ms of which 1 ms to minimize.
[2024-05-22 12:33:59] [INFO ] Deduced a trap composed of 112 places in 86 ms of which 2 ms to minimize.
[2024-05-22 12:33:59] [INFO ] Deduced a trap composed of 118 places in 84 ms of which 1 ms to minimize.
[2024-05-22 12:33:59] [INFO ] Deduced a trap composed of 85 places in 97 ms of which 1 ms to minimize.
[2024-05-22 12:33:59] [INFO ] Deduced a trap composed of 73 places in 96 ms of which 1 ms to minimize.
[2024-05-22 12:33:59] [INFO ] Deduced a trap composed of 114 places in 94 ms of which 1 ms to minimize.
[2024-05-22 12:33:59] [INFO ] Deduced a trap composed of 121 places in 108 ms of which 2 ms to minimize.
[2024-05-22 12:34:00] [INFO ] Deduced a trap composed of 79 places in 86 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1030 variables, 20/644 constraints. Problems are: Problem set: 1 solved, 26 unsolved
[2024-05-22 12:34:07] [INFO ] Deduced a trap composed of 16 places in 145 ms of which 2 ms to minimize.
[2024-05-22 12:34:07] [INFO ] Deduced a trap composed of 147 places in 170 ms of which 3 ms to minimize.
[2024-05-22 12:34:07] [INFO ] Deduced a trap composed of 19 places in 182 ms of which 3 ms to minimize.
[2024-05-22 12:34:08] [INFO ] Deduced a trap composed of 109 places in 169 ms of which 3 ms to minimize.
[2024-05-22 12:34:08] [INFO ] Deduced a trap composed of 45 places in 170 ms of which 2 ms to minimize.
[2024-05-22 12:34:08] [INFO ] Deduced a trap composed of 106 places in 174 ms of which 3 ms to minimize.
[2024-05-22 12:34:09] [INFO ] Deduced a trap composed of 153 places in 179 ms of which 3 ms to minimize.
[2024-05-22 12:34:09] [INFO ] Deduced a trap composed of 116 places in 175 ms of which 3 ms to minimize.
[2024-05-22 12:34:09] [INFO ] Deduced a trap composed of 145 places in 182 ms of which 4 ms to minimize.
[2024-05-22 12:34:10] [INFO ] Deduced a trap composed of 162 places in 171 ms of which 4 ms to minimize.
[2024-05-22 12:34:10] [INFO ] Deduced a trap composed of 169 places in 178 ms of which 3 ms to minimize.
[2024-05-22 12:34:11] [INFO ] Deduced a trap composed of 53 places in 174 ms of which 3 ms to minimize.
[2024-05-22 12:34:11] [INFO ] Deduced a trap composed of 124 places in 179 ms of which 3 ms to minimize.
[2024-05-22 12:34:12] [INFO ] Deduced a trap composed of 34 places in 178 ms of which 3 ms to minimize.
[2024-05-22 12:34:12] [INFO ] Deduced a trap composed of 108 places in 177 ms of which 4 ms to minimize.
[2024-05-22 12:34:12] [INFO ] Deduced a trap composed of 129 places in 169 ms of which 3 ms to minimize.
[2024-05-22 12:34:13] [INFO ] Deduced a trap composed of 112 places in 167 ms of which 3 ms to minimize.
[2024-05-22 12:34:13] [INFO ] Deduced a trap composed of 109 places in 170 ms of which 3 ms to minimize.
[2024-05-22 12:34:13] [INFO ] Deduced a trap composed of 136 places in 167 ms of which 3 ms to minimize.
[2024-05-22 12:34:13] [INFO ] Deduced a trap composed of 132 places in 174 ms of which 3 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1030 variables, 20/664 constraints. Problems are: Problem set: 1 solved, 26 unsolved
[2024-05-22 12:34:20] [INFO ] Deduced a trap composed of 172 places in 161 ms of which 3 ms to minimize.
[2024-05-22 12:34:20] [INFO ] Deduced a trap composed of 164 places in 158 ms of which 3 ms to minimize.
[2024-05-22 12:34:21] [INFO ] Deduced a trap composed of 28 places in 167 ms of which 3 ms to minimize.
[2024-05-22 12:34:21] [INFO ] Deduced a trap composed of 42 places in 168 ms of which 3 ms to minimize.
[2024-05-22 12:34:21] [INFO ] Deduced a trap composed of 172 places in 166 ms of which 2 ms to minimize.
[2024-05-22 12:34:21] [INFO ] Deduced a trap composed of 170 places in 156 ms of which 4 ms to minimize.
[2024-05-22 12:34:21] [INFO ] Deduced a trap composed of 118 places in 177 ms of which 3 ms to minimize.
[2024-05-22 12:34:22] [INFO ] Deduced a trap composed of 161 places in 164 ms of which 3 ms to minimize.
[2024-05-22 12:34:22] [INFO ] Deduced a trap composed of 167 places in 158 ms of which 2 ms to minimize.
[2024-05-22 12:34:22] [INFO ] Deduced a trap composed of 171 places in 159 ms of which 3 ms to minimize.
[2024-05-22 12:34:22] [INFO ] Deduced a trap composed of 51 places in 165 ms of which 8 ms to minimize.
[2024-05-22 12:34:23] [INFO ] Deduced a trap composed of 171 places in 161 ms of which 3 ms to minimize.
[2024-05-22 12:34:23] [INFO ] Deduced a trap composed of 175 places in 159 ms of which 3 ms to minimize.
[2024-05-22 12:34:23] [INFO ] Deduced a trap composed of 181 places in 166 ms of which 3 ms to minimize.
[2024-05-22 12:34:23] [INFO ] Deduced a trap composed of 172 places in 162 ms of which 3 ms to minimize.
[2024-05-22 12:34:23] [INFO ] Deduced a trap composed of 185 places in 162 ms of which 3 ms to minimize.
[2024-05-22 12:34:24] [INFO ] Deduced a trap composed of 178 places in 155 ms of which 2 ms to minimize.
[2024-05-22 12:34:24] [INFO ] Deduced a trap composed of 169 places in 160 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1030/1030 variables, and 682 constraints, problems are : Problem set: 1 solved, 26 unsolved in 45013 ms.
Refiners :[State Equation: 528/528 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 26/27 constraints, Known Traps: 63/63 constraints]
After SMT, in 51269ms problems are : Problem set: 1 solved, 26 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 46 out of 528 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 528/528 places, 502/502 transitions.
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 528 transition count 501
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 527 transition count 501
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 525 transition count 499
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 525 transition count 499
Applied a total of 7 rules in 54 ms. Remains 525 /528 variables (removed 3) and now considering 499/502 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 525/528 places, 499/502 transitions.
RANDOM walk for 40000 steps (5153 resets) in 287 ms. (138 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (345 resets) in 15 ms. (250 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (326 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (326 resets) in 33 ms. (117 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (327 resets) in 32 ms. (121 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (332 resets) in 18 ms. (210 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (354 resets) in 15 ms. (250 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (328 resets) in 39 ms. (100 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (326 resets) in 23 ms. (166 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (314 resets) in 18 ms. (210 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (339 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (334 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (342 resets) in 40 ms. (97 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (341 resets) in 18 ms. (210 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (337 resets) in 15 ms. (250 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (339 resets) in 18 ms. (210 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (352 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (344 resets) in 39 ms. (100 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (338 resets) in 20 ms. (190 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (334 resets) in 32 ms. (121 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (326 resets) in 24 ms. (160 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (335 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (346 resets) in 15 ms. (250 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (340 resets) in 23 ms. (166 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (347 resets) in 15 ms. (250 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (341 resets) in 24 ms. (160 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (334 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
Interrupted probabilistic random walk after 147910 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :0 out of 26
Probabilistic random walk after 147910 steps, saw 73985 distinct states, run finished after 3001 ms. (steps per millisecond=49 ) properties seen :0
// Phase 1: matrix 499 rows 525 cols
[2024-05-22 12:34:27] [INFO ] Invariants computation overflowed in 86 ms
[2024-05-22 12:34:27] [INFO ] State equation strengthened by 65 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 145/191 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (OVERLAPS) 459/650 variables, 220/269 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 24/293 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/650 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (OVERLAPS) 327/977 variables, 216/509 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/977 variables, 35/544 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/977 variables, 0/544 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 10 (OVERLAPS) 47/1024 variables, 43/587 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1024 variables, 3/590 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1024 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 13 (OVERLAPS) 0/1024 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1024/1024 variables, and 590 constraints, problems are : Problem set: 0 solved, 26 unsolved in 6270 ms.
Refiners :[State Equation: 525/525 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 145/191 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (OVERLAPS) 459/650 variables, 220/269 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 24/293 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/650 variables, 25/318 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/650 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (OVERLAPS) 327/977 variables, 216/534 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/977 variables, 35/569 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/977 variables, 1/570 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/977 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 12 (OVERLAPS) 47/1024 variables, 43/613 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1024 variables, 3/616 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-05-22 12:34:44] [INFO ] Deduced a trap composed of 28 places in 171 ms of which 3 ms to minimize.
[2024-05-22 12:34:44] [INFO ] Deduced a trap composed of 24 places in 169 ms of which 4 ms to minimize.
[2024-05-22 12:34:44] [INFO ] Deduced a trap composed of 34 places in 156 ms of which 3 ms to minimize.
[2024-05-22 12:34:45] [INFO ] Deduced a trap composed of 141 places in 161 ms of which 3 ms to minimize.
[2024-05-22 12:34:45] [INFO ] Deduced a trap composed of 37 places in 159 ms of which 3 ms to minimize.
[2024-05-22 12:34:45] [INFO ] Deduced a trap composed of 43 places in 175 ms of which 3 ms to minimize.
[2024-05-22 12:34:45] [INFO ] Deduced a trap composed of 141 places in 160 ms of which 3 ms to minimize.
[2024-05-22 12:34:45] [INFO ] Deduced a trap composed of 177 places in 164 ms of which 3 ms to minimize.
[2024-05-22 12:34:46] [INFO ] Deduced a trap composed of 50 places in 165 ms of which 3 ms to minimize.
[2024-05-22 12:34:46] [INFO ] Deduced a trap composed of 47 places in 165 ms of which 3 ms to minimize.
[2024-05-22 12:34:46] [INFO ] Deduced a trap composed of 141 places in 154 ms of which 2 ms to minimize.
[2024-05-22 12:34:46] [INFO ] Deduced a trap composed of 55 places in 158 ms of which 3 ms to minimize.
[2024-05-22 12:34:46] [INFO ] Deduced a trap composed of 123 places in 156 ms of which 3 ms to minimize.
[2024-05-22 12:34:47] [INFO ] Deduced a trap composed of 144 places in 170 ms of which 3 ms to minimize.
[2024-05-22 12:34:47] [INFO ] Deduced a trap composed of 143 places in 167 ms of which 3 ms to minimize.
[2024-05-22 12:34:47] [INFO ] Deduced a trap composed of 139 places in 157 ms of which 2 ms to minimize.
[2024-05-22 12:34:47] [INFO ] Deduced a trap composed of 139 places in 170 ms of which 3 ms to minimize.
[2024-05-22 12:34:47] [INFO ] Deduced a trap composed of 144 places in 153 ms of which 3 ms to minimize.
[2024-05-22 12:34:48] [INFO ] Deduced a trap composed of 151 places in 164 ms of which 3 ms to minimize.
[2024-05-22 12:34:49] [INFO ] Deduced a trap composed of 12 places in 174 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1024 variables, 20/636 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-05-22 12:34:57] [INFO ] Deduced a trap composed of 24 places in 165 ms of which 2 ms to minimize.
[2024-05-22 12:34:57] [INFO ] Deduced a trap composed of 184 places in 167 ms of which 3 ms to minimize.
[2024-05-22 12:34:57] [INFO ] Deduced a trap composed of 176 places in 176 ms of which 3 ms to minimize.
[2024-05-22 12:34:57] [INFO ] Deduced a trap composed of 17 places in 166 ms of which 3 ms to minimize.
[2024-05-22 12:34:57] [INFO ] Deduced a trap composed of 165 places in 167 ms of which 2 ms to minimize.
[2024-05-22 12:34:58] [INFO ] Deduced a trap composed of 14 places in 171 ms of which 3 ms to minimize.
[2024-05-22 12:34:58] [INFO ] Deduced a trap composed of 30 places in 158 ms of which 3 ms to minimize.
[2024-05-22 12:34:58] [INFO ] Deduced a trap composed of 14 places in 172 ms of which 2 ms to minimize.
[2024-05-22 12:34:58] [INFO ] Deduced a trap composed of 8 places in 169 ms of which 3 ms to minimize.
[2024-05-22 12:34:59] [INFO ] Deduced a trap composed of 190 places in 168 ms of which 4 ms to minimize.
[2024-05-22 12:34:59] [INFO ] Deduced a trap composed of 193 places in 163 ms of which 3 ms to minimize.
[2024-05-22 12:34:59] [INFO ] Deduced a trap composed of 177 places in 157 ms of which 3 ms to minimize.
[2024-05-22 12:34:59] [INFO ] Deduced a trap composed of 193 places in 166 ms of which 2 ms to minimize.
[2024-05-22 12:34:59] [INFO ] Deduced a trap composed of 41 places in 162 ms of which 3 ms to minimize.
[2024-05-22 12:35:00] [INFO ] Deduced a trap composed of 181 places in 167 ms of which 2 ms to minimize.
[2024-05-22 12:35:00] [INFO ] Deduced a trap composed of 176 places in 167 ms of which 3 ms to minimize.
[2024-05-22 12:35:00] [INFO ] Deduced a trap composed of 51 places in 169 ms of which 3 ms to minimize.
[2024-05-22 12:35:00] [INFO ] Deduced a trap composed of 176 places in 157 ms of which 2 ms to minimize.
[2024-05-22 12:35:00] [INFO ] Deduced a trap composed of 173 places in 157 ms of which 3 ms to minimize.
[2024-05-22 12:35:01] [INFO ] Deduced a trap composed of 51 places in 165 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1024 variables, 20/656 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-05-22 12:35:17] [INFO ] Deduced a trap composed of 17 places in 152 ms of which 3 ms to minimize.
[2024-05-22 12:35:17] [INFO ] Deduced a trap composed of 42 places in 134 ms of which 2 ms to minimize.
[2024-05-22 12:35:18] [INFO ] Deduced a trap composed of 9 places in 145 ms of which 3 ms to minimize.
[2024-05-22 12:35:18] [INFO ] Deduced a trap composed of 64 places in 93 ms of which 1 ms to minimize.
[2024-05-22 12:35:19] [INFO ] Deduced a trap composed of 168 places in 162 ms of which 3 ms to minimize.
[2024-05-22 12:35:19] [INFO ] Deduced a trap composed of 171 places in 168 ms of which 2 ms to minimize.
[2024-05-22 12:35:19] [INFO ] Deduced a trap composed of 174 places in 162 ms of which 3 ms to minimize.
[2024-05-22 12:35:19] [INFO ] Deduced a trap composed of 174 places in 162 ms of which 3 ms to minimize.
[2024-05-22 12:35:20] [INFO ] Deduced a trap composed of 185 places in 168 ms of which 3 ms to minimize.
[2024-05-22 12:35:20] [INFO ] Deduced a trap composed of 186 places in 171 ms of which 3 ms to minimize.
[2024-05-22 12:35:20] [INFO ] Deduced a trap composed of 186 places in 165 ms of which 3 ms to minimize.
[2024-05-22 12:35:20] [INFO ] Deduced a trap composed of 183 places in 166 ms of which 3 ms to minimize.
[2024-05-22 12:35:20] [INFO ] Deduced a trap composed of 169 places in 159 ms of which 3 ms to minimize.
[2024-05-22 12:35:21] [INFO ] Deduced a trap composed of 174 places in 148 ms of which 3 ms to minimize.
[2024-05-22 12:35:21] [INFO ] Deduced a trap composed of 148 places in 158 ms of which 3 ms to minimize.
[2024-05-22 12:35:21] [INFO ] Deduced a trap composed of 161 places in 170 ms of which 3 ms to minimize.
[2024-05-22 12:35:21] [INFO ] Deduced a trap composed of 158 places in 153 ms of which 2 ms to minimize.
[2024-05-22 12:35:21] [INFO ] Deduced a trap composed of 164 places in 155 ms of which 3 ms to minimize.
[2024-05-22 12:35:21] [INFO ] Deduced a trap composed of 171 places in 162 ms of which 3 ms to minimize.
[2024-05-22 12:35:22] [INFO ] Deduced a trap composed of 144 places in 177 ms of which 3 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1024 variables, 20/676 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-05-22 12:35:26] [INFO ] Deduced a trap composed of 45 places in 127 ms of which 2 ms to minimize.
[2024-05-22 12:35:26] [INFO ] Deduced a trap composed of 45 places in 115 ms of which 2 ms to minimize.
[2024-05-22 12:35:26] [INFO ] Deduced a trap composed of 59 places in 108 ms of which 2 ms to minimize.
[2024-05-22 12:35:27] [INFO ] Deduced a trap composed of 152 places in 136 ms of which 2 ms to minimize.
[2024-05-22 12:35:27] [INFO ] Deduced a trap composed of 157 places in 152 ms of which 2 ms to minimize.
[2024-05-22 12:35:27] [INFO ] Deduced a trap composed of 157 places in 150 ms of which 2 ms to minimize.
[2024-05-22 12:35:27] [INFO ] Deduced a trap composed of 157 places in 151 ms of which 3 ms to minimize.
[2024-05-22 12:35:27] [INFO ] Deduced a trap composed of 151 places in 146 ms of which 2 ms to minimize.
[2024-05-22 12:35:28] [INFO ] Deduced a trap composed of 150 places in 144 ms of which 2 ms to minimize.
[2024-05-22 12:35:28] [INFO ] Deduced a trap composed of 170 places in 142 ms of which 2 ms to minimize.
[2024-05-22 12:35:28] [INFO ] Deduced a trap composed of 161 places in 139 ms of which 2 ms to minimize.
[2024-05-22 12:35:28] [INFO ] Deduced a trap composed of 165 places in 139 ms of which 3 ms to minimize.
[2024-05-22 12:35:28] [INFO ] Deduced a trap composed of 157 places in 136 ms of which 2 ms to minimize.
[2024-05-22 12:35:29] [INFO ] Deduced a trap composed of 147 places in 149 ms of which 2 ms to minimize.
[2024-05-22 12:35:29] [INFO ] Deduced a trap composed of 149 places in 151 ms of which 3 ms to minimize.
[2024-05-22 12:35:29] [INFO ] Deduced a trap composed of 151 places in 146 ms of which 2 ms to minimize.
[2024-05-22 12:35:29] [INFO ] Deduced a trap composed of 144 places in 142 ms of which 3 ms to minimize.
[2024-05-22 12:35:29] [INFO ] Deduced a trap composed of 150 places in 150 ms of which 2 ms to minimize.
[2024-05-22 12:35:30] [INFO ] Deduced a trap composed of 159 places in 145 ms of which 3 ms to minimize.
[2024-05-22 12:35:30] [INFO ] Deduced a trap composed of 154 places in 144 ms of which 3 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1024 variables, 20/696 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-05-22 12:35:36] [INFO ] Deduced a trap composed of 138 places in 147 ms of which 3 ms to minimize.
[2024-05-22 12:35:36] [INFO ] Deduced a trap composed of 133 places in 152 ms of which 7 ms to minimize.
[2024-05-22 12:35:37] [INFO ] Deduced a trap composed of 137 places in 144 ms of which 2 ms to minimize.
[2024-05-22 12:35:37] [INFO ] Deduced a trap composed of 135 places in 145 ms of which 3 ms to minimize.
[2024-05-22 12:35:37] [INFO ] Deduced a trap composed of 134 places in 146 ms of which 2 ms to minimize.
[2024-05-22 12:35:37] [INFO ] Deduced a trap composed of 137 places in 143 ms of which 3 ms to minimize.
[2024-05-22 12:35:37] [INFO ] Deduced a trap composed of 131 places in 147 ms of which 2 ms to minimize.
[2024-05-22 12:35:38] [INFO ] Deduced a trap composed of 147 places in 137 ms of which 2 ms to minimize.
[2024-05-22 12:35:38] [INFO ] Deduced a trap composed of 140 places in 146 ms of which 3 ms to minimize.
[2024-05-22 12:35:38] [INFO ] Deduced a trap composed of 139 places in 140 ms of which 2 ms to minimize.
[2024-05-22 12:35:38] [INFO ] Deduced a trap composed of 143 places in 145 ms of which 2 ms to minimize.
[2024-05-22 12:35:39] [INFO ] Deduced a trap composed of 145 places in 142 ms of which 3 ms to minimize.
[2024-05-22 12:35:39] [INFO ] Deduced a trap composed of 133 places in 144 ms of which 3 ms to minimize.
[2024-05-22 12:35:39] [INFO ] Deduced a trap composed of 135 places in 142 ms of which 2 ms to minimize.
[2024-05-22 12:35:39] [INFO ] Deduced a trap composed of 136 places in 135 ms of which 3 ms to minimize.
[2024-05-22 12:35:39] [INFO ] Deduced a trap composed of 133 places in 137 ms of which 2 ms to minimize.
[2024-05-22 12:35:40] [INFO ] Deduced a trap composed of 141 places in 142 ms of which 3 ms to minimize.
[2024-05-22 12:35:40] [INFO ] Deduced a trap composed of 133 places in 137 ms of which 3 ms to minimize.
[2024-05-22 12:35:41] [INFO ] Deduced a trap composed of 144 places in 144 ms of which 2 ms to minimize.
[2024-05-22 12:35:41] [INFO ] Deduced a trap composed of 141 places in 137 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1024 variables, 20/716 constraints. Problems are: Problem set: 0 solved, 26 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1024/1024 variables, and 716 constraints, problems are : Problem set: 0 solved, 26 unsolved in 75014 ms.
Refiners :[State Equation: 525/525 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 100/100 constraints]
After SMT, in 81394ms problems are : Problem set: 0 solved, 26 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 46 out of 525 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 525/525 places, 499/499 transitions.
Applied a total of 0 rules in 20 ms. Remains 525 /525 variables (removed 0) and now considering 499/499 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 525/525 places, 499/499 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 525/525 places, 499/499 transitions.
Applied a total of 0 rules in 13 ms. Remains 525 /525 variables (removed 0) and now considering 499/499 (removed 0) transitions.
// Phase 1: matrix 499 rows 525 cols
[2024-05-22 12:35:49] [INFO ] Invariants computation overflowed in 149 ms
[2024-05-22 12:35:49] [INFO ] Implicit Places using invariants in 453 ms returned []
// Phase 1: matrix 499 rows 525 cols
[2024-05-22 12:35:49] [INFO ] Invariants computation overflowed in 78 ms
[2024-05-22 12:35:49] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-05-22 12:35:57] [INFO ] Implicit Places using invariants and state equation in 7476 ms returned [43, 49, 70, 75, 140, 171, 196, 202, 227, 233, 240, 262, 285, 291, 316, 321, 345, 405, 411, 433, 436, 441, 462, 468, 491, 496, 500, 517, 523]
[2024-05-22 12:35:57] [INFO ] Actually due to overlaps returned [202, 411, 240, 70, 171, 196, 405, 75, 140]
Discarding 9 places :
Implicit Place search using SMT with State Equation took 7936 ms to find 9 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 516/525 places, 499/499 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 516 transition count 496
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 513 transition count 496
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 513 transition count 496
Applied a total of 9 rules in 40 ms. Remains 513 /516 variables (removed 3) and now considering 496/499 (removed 3) transitions.
// Phase 1: matrix 496 rows 513 cols
[2024-05-22 12:35:57] [INFO ] Invariants computation overflowed in 54 ms
[2024-05-22 12:35:57] [INFO ] Implicit Places using invariants in 277 ms returned []
// Phase 1: matrix 496 rows 513 cols
[2024-05-22 12:35:57] [INFO ] Invariants computation overflowed in 55 ms
[2024-05-22 12:35:57] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-05-22 12:36:05] [INFO ] Implicit Places using invariants and state equation in 8229 ms returned [43, 49, 220, 226, 253, 276, 282, 307, 312, 336, 421, 424, 429, 450, 456, 479, 484, 488, 505, 511]
[2024-05-22 12:36:05] [INFO ] Actually due to overlaps returned [226, 429, 488, 220, 424, 421]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 8507 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 507/525 places, 496/499 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 507 transition count 493
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 504 transition count 493
Applied a total of 6 rules in 35 ms. Remains 504 /507 variables (removed 3) and now considering 493/496 (removed 3) transitions.
// Phase 1: matrix 493 rows 504 cols
[2024-05-22 12:36:05] [INFO ] Invariants computation overflowed in 37 ms
[2024-05-22 12:36:05] [INFO ] Implicit Places using invariants in 253 ms returned []
// Phase 1: matrix 493 rows 504 cols
[2024-05-22 12:36:06] [INFO ] Invariants computation overflowed in 40 ms
[2024-05-22 12:36:06] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-05-22 12:36:19] [INFO ] Implicit Places using invariants and state equation in 13433 ms returned [43, 49, 250, 273, 279, 304, 309, 333, 443, 449, 472, 477, 496, 502]
[2024-05-22 12:36:19] [INFO ] Actually due to overlaps returned [250, 449, 43, 443, 49]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 13687 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 499/525 places, 493/499 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 499 transition count 492
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 498 transition count 492
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 498 transition count 492
Applied a total of 4 rules in 32 ms. Remains 498 /499 variables (removed 1) and now considering 492/493 (removed 1) transitions.
// Phase 1: matrix 492 rows 498 cols
[2024-05-22 12:36:19] [INFO ] Invariants computation overflowed in 32 ms
[2024-05-22 12:36:19] [INFO ] Implicit Places using invariants in 258 ms returned []
// Phase 1: matrix 492 rows 498 cols
[2024-05-22 12:36:19] [INFO ] Invariants computation overflowed in 31 ms
[2024-05-22 12:36:19] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-05-22 12:36:26] [INFO ] Implicit Places using invariants and state equation in 7125 ms returned [269, 275, 300, 305, 329, 466, 471, 490, 496]
[2024-05-22 12:36:26] [INFO ] Actually due to overlaps returned [275, 471, 269, 466]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 7385 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 494/525 places, 492/499 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 494 transition count 490
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 492 transition count 490
Applied a total of 4 rules in 20 ms. Remains 492 /494 variables (removed 2) and now considering 490/492 (removed 2) transitions.
// Phase 1: matrix 490 rows 492 cols
[2024-05-22 12:36:26] [INFO ] Invariants computation overflowed in 29 ms
[2024-05-22 12:36:27] [INFO ] Implicit Places using invariants in 252 ms returned []
// Phase 1: matrix 490 rows 492 cols
[2024-05-22 12:36:27] [INFO ] Invariants computation overflowed in 27 ms
[2024-05-22 12:36:27] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-05-22 12:36:32] [INFO ] Implicit Places using invariants and state equation in 5288 ms returned [297, 302, 326, 484, 490]
[2024-05-22 12:36:32] [INFO ] Actually due to overlaps returned [302, 297, 484, 490]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 5542 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 488/525 places, 490/499 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 488 transition count 488
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 486 transition count 488
Applied a total of 4 rules in 19 ms. Remains 486 /488 variables (removed 2) and now considering 488/490 (removed 2) transitions.
// Phase 1: matrix 488 rows 486 cols
[2024-05-22 12:36:32] [INFO ] Invariants computation overflowed in 26 ms
[2024-05-22 12:36:32] [INFO ] Implicit Places using invariants in 233 ms returned []
// Phase 1: matrix 488 rows 486 cols
[2024-05-22 12:36:32] [INFO ] Invariants computation overflowed in 27 ms
[2024-05-22 12:36:32] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-05-22 12:36:38] [INFO ] Implicit Places using invariants and state equation in 5882 ms returned [323]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 6119 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 485/525 places, 488/499 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 485 transition count 488
Applied a total of 1 rules in 24 ms. Remains 485 /485 variables (removed 0) and now considering 488/488 (removed 0) transitions.
// Phase 1: matrix 488 rows 485 cols
[2024-05-22 12:36:38] [INFO ] Invariants computation overflowed in 31 ms
[2024-05-22 12:36:38] [INFO ] Implicit Places using invariants in 244 ms returned []
// Phase 1: matrix 488 rows 485 cols
[2024-05-22 12:36:38] [INFO ] Invariants computation overflowed in 31 ms
[2024-05-22 12:36:39] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-05-22 12:36:45] [INFO ] Implicit Places using invariants and state equation in 6590 ms returned []
Implicit Place search using SMT with State Equation took 6834 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 485/525 places, 488/499 transitions.
Finished structural reductions in REACHABILITY mode , in 7 iterations and 56194 ms. Remains : 485/525 places, 488/499 transitions.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 1805 edges and 1057 vertex of which 1055 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.14 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0 U p1))))'
Support contains 3 out of 1057 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Applied a total of 0 rules in 30 ms. Remains 1057 /1057 variables (removed 0) and now considering 997/997 (removed 0) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2024-05-22 12:36:45] [INFO ] Invariants computation overflowed in 105 ms
[2024-05-22 12:36:45] [INFO ] Implicit Places using invariants in 396 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2024-05-22 12:36:46] [INFO ] Invariants computation overflowed in 100 ms
[2024-05-22 12:36:59] [INFO ] Implicit Places using invariants and state equation in 13861 ms returned []
Implicit Place search using SMT with State Equation took 14262 ms to find 0 implicit places.
Running 996 sub problems to find dead transitions.
// Phase 1: matrix 997 rows 1057 cols
[2024-05-22 12:36:59] [INFO ] Invariants computation overflowed in 102 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1056 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 996 unsolved
At refinement iteration 1 (OVERLAPS) 997/2053 variables, 1056/1056 constraints. Problems are: Problem set: 0 solved, 996 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2053/2054 variables, and 1056 constraints, problems are : Problem set: 0 solved, 996 unsolved in 30044 ms.
Refiners :[State Equation: 1056/1057 constraints, PredecessorRefiner: 996/996 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 996 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1056 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 996 unsolved
At refinement iteration 1 (OVERLAPS) 997/2053 variables, 1056/1056 constraints. Problems are: Problem set: 0 solved, 996 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2053 variables, 996/2052 constraints. Problems are: Problem set: 0 solved, 996 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2053/2054 variables, and 2052 constraints, problems are : Problem set: 0 solved, 996 unsolved in 30024 ms.
Refiners :[State Equation: 1056/1057 constraints, PredecessorRefiner: 996/996 constraints, Known Traps: 0/0 constraints]
After SMT, in 60357ms problems are : Problem set: 0 solved, 996 unsolved
Search for dead transitions found 0 dead transitions in 60369ms
Finished structural reductions in LTL mode , in 1 iterations and 74668 ms. Remains : 1057/1057 places, 997/997 transitions.
Stuttering acceptance computed with spot in 257 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-00
Product exploration explored 100000 steps with 3338 reset in 269 ms.
Product exploration explored 100000 steps with 3321 reset in 165 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 1805 edges and 1057 vertex of which 1055 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.10 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p1 p0)), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p1 p0))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 90 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p1), true, (NOT p1)]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (1319 resets) in 104 ms. (380 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (1155 resets) in 92 ms. (430 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (1145 resets) in 122 ms. (325 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1142 resets) in 131 ms. (303 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (1163 resets) in 119 ms. (333 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 182778 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :0 out of 4
Probabilistic random walk after 182778 steps, saw 91402 distinct states, run finished after 3001 ms. (steps per millisecond=60 ) properties seen :0
// Phase 1: matrix 997 rows 1057 cols
[2024-05-22 12:38:04] [INFO ] Invariants computation overflowed in 101 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) 8/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 39/50 variables, 14/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 89/139 variables, 40/57 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 136/275 variables, 65/122 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/275 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 155/430 variables, 78/200 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/430 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 151/581 variables, 77/277 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/581 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 184/765 variables, 95/372 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/765 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 158/923 variables, 82/454 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/923 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 180/1103 variables, 89/543 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1103 variables, 0/543 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 165/1268 variables, 92/635 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1268 variables, 0/635 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 104/1372 variables, 61/696 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1372 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 68/1440 variables, 36/732 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1440 variables, 0/732 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 66/1506 variables, 36/768 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1506 variables, 0/768 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 51/1557 variables, 26/794 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1557 variables, 0/794 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (OVERLAPS) 60/1617 variables, 31/825 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1617 variables, 0/825 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (OVERLAPS) 48/1665 variables, 25/850 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1665 variables, 0/850 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (OVERLAPS) 56/1721 variables, 29/879 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1721 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (OVERLAPS) 47/1768 variables, 24/903 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1768 variables, 0/903 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (OVERLAPS) 56/1824 variables, 29/932 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1824 variables, 0/932 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 39 (OVERLAPS) 47/1871 variables, 24/956 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1871 variables, 0/956 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 41 (OVERLAPS) 56/1927 variables, 29/985 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1927 variables, 0/985 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 43 (OVERLAPS) 48/1975 variables, 24/1009 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1975 variables, 0/1009 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 45 (OVERLAPS) 59/2034 variables, 31/1040 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 12:38:07] [INFO ] Deduced a trap composed of 26 places in 275 ms of which 5 ms to minimize.
At refinement iteration 46 (INCLUDED_ONLY) 0/2034 variables, 1/1041 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/2034 variables, 0/1041 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf2 is UNSAT
At refinement iteration 48 (OVERLAPS) 20/2054 variables, 17/1058 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-22 12:38:08] [INFO ] Deduced a trap composed of 39 places in 270 ms of which 5 ms to minimize.
[2024-05-22 12:38:09] [INFO ] Deduced a trap composed of 16 places in 258 ms of which 5 ms to minimize.
[2024-05-22 12:38:09] [INFO ] Deduced a trap composed of 18 places in 261 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2054/2054 variables, and 1061 constraints, problems are : Problem set: 1 solved, 3 unsolved in 5054 ms.
Refiners :[State Equation: 1057/1057 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 39/50 variables, 14/17 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 3/20 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/20 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 89/139 variables, 40/60 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 0/60 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 136/275 variables, 65/125 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/275 variables, 0/125 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 155/430 variables, 78/203 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/430 variables, 0/203 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 151/581 variables, 77/280 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/581 variables, 0/280 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 184/765 variables, 95/375 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/765 variables, 0/375 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 158/923 variables, 82/457 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/923 variables, 0/457 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 180/1103 variables, 89/546 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1103 variables, 0/546 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 165/1268 variables, 92/638 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1268 variables, 0/638 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 104/1372 variables, 61/699 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1372 variables, 0/699 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 68/1440 variables, 36/735 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1440 variables, 0/735 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 26 (OVERLAPS) 66/1506 variables, 36/771 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1506 variables, 0/771 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 28 (OVERLAPS) 51/1557 variables, 26/797 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1557 variables, 0/797 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 30 (OVERLAPS) 60/1617 variables, 31/828 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1617 variables, 0/828 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 32 (OVERLAPS) 48/1665 variables, 25/853 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1665 variables, 0/853 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 34 (OVERLAPS) 56/1721 variables, 29/882 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1721 variables, 0/882 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 36 (OVERLAPS) 47/1768 variables, 24/906 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1768 variables, 0/906 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 38 (OVERLAPS) 56/1824 variables, 29/935 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1824 variables, 0/935 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 40 (OVERLAPS) 47/1871 variables, 24/959 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1871 variables, 0/959 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 42 (OVERLAPS) 56/1927 variables, 29/988 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1927 variables, 0/988 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 44 (OVERLAPS) 48/1975 variables, 24/1012 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1975 variables, 0/1012 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 46 (OVERLAPS) 59/2034 variables, 31/1043 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/2034 variables, 1/1044 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/2034 variables, 0/1044 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 49 (OVERLAPS) 20/2054 variables, 17/1061 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/2054 variables, 3/1064 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-22 12:38:13] [INFO ] Deduced a trap composed of 115 places in 235 ms of which 4 ms to minimize.
[2024-05-22 12:38:14] [INFO ] Deduced a trap composed of 89 places in 233 ms of which 4 ms to minimize.
[2024-05-22 12:38:14] [INFO ] Deduced a trap composed of 101 places in 243 ms of which 5 ms to minimize.
[2024-05-22 12:38:14] [INFO ] Deduced a trap composed of 103 places in 240 ms of which 4 ms to minimize.
SMT process timed out in 10177ms, After SMT, problems are : Problem set: 1 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 1057 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1055 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 0 with 240 rules applied. Total rules applied 241 place count 1055 transition count 756
Reduce places removed 239 places and 0 transitions.
Iterating post reduction 1 with 239 rules applied. Total rules applied 480 place count 816 transition count 756
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 480 place count 816 transition count 716
Deduced a syphon composed of 40 places in 6 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 560 place count 776 transition count 716
Performed 183 Post agglomeration using F-continuation condition.Transition count delta: 183
Deduced a syphon composed of 183 places in 2 ms
Reduce places removed 183 places and 0 transitions.
Iterating global reduction 2 with 366 rules applied. Total rules applied 926 place count 593 transition count 533
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 37 places in 2 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 1000 place count 556 transition count 533
Free-agglomeration rule (complex) applied 79 times.
Iterating global reduction 2 with 79 rules applied. Total rules applied 1079 place count 556 transition count 454
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 2 with 79 rules applied. Total rules applied 1158 place count 477 transition count 454
Partial Free-agglomeration rule applied 79 times.
Drop transitions (Partial Free agglomeration) removed 79 transitions
Iterating global reduction 3 with 79 rules applied. Total rules applied 1237 place count 477 transition count 454
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1238 place count 476 transition count 453
Applied a total of 1238 rules in 103 ms. Remains 476 /1057 variables (removed 581) and now considering 453/997 (removed 544) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 476/1057 places, 453/997 transitions.
RANDOM walk for 40000 steps (5153 resets) in 93 ms. (425 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (3362 resets) in 80 ms. (493 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (3430 resets) in 59 ms. (666 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (3391 resets) in 123 ms. (322 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 363957 steps, run timeout after 3001 ms. (steps per millisecond=121 ) properties seen :0 out of 3
Probabilistic random walk after 363957 steps, saw 182066 distinct states, run finished after 3001 ms. (steps per millisecond=121 ) properties seen :0
// Phase 1: matrix 453 rows 476 cols
[2024-05-22 12:38:17] [INFO ] Invariants computation overflowed in 32 ms
[2024-05-22 12:38:17] [INFO ] State equation strengthened by 77 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 10/13 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 176/189 variables, 36/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 529/718 variables, 266/307 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/718 variables, 46/353 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/718 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 211/929 variables, 171/524 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/929 variables, 29/553 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/929 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/929 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 929/929 variables, and 553 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1587 ms.
Refiners :[State Equation: 476/476 constraints, ReadFeed: 77/77 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 10/13 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 176/189 variables, 36/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 529/718 variables, 266/310 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/718 variables, 46/356 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/718 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 211/929 variables, 171/527 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/929 variables, 29/556 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 12:38:20] [INFO ] Deduced a trap composed of 107 places in 122 ms of which 2 ms to minimize.
[2024-05-22 12:38:21] [INFO ] Deduced a trap composed of 105 places in 113 ms of which 2 ms to minimize.
[2024-05-22 12:38:21] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 2 ms to minimize.
[2024-05-22 12:38:21] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 1 ms to minimize.
[2024-05-22 12:38:21] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 2 ms to minimize.
[2024-05-22 12:38:21] [INFO ] Deduced a trap composed of 98 places in 120 ms of which 2 ms to minimize.
[2024-05-22 12:38:21] [INFO ] Deduced a trap composed of 100 places in 115 ms of which 2 ms to minimize.
[2024-05-22 12:38:21] [INFO ] Deduced a trap composed of 22 places in 109 ms of which 2 ms to minimize.
[2024-05-22 12:38:22] [INFO ] Deduced a trap composed of 114 places in 105 ms of which 2 ms to minimize.
[2024-05-22 12:38:22] [INFO ] Deduced a trap composed of 106 places in 114 ms of which 1 ms to minimize.
[2024-05-22 12:38:22] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 2 ms to minimize.
[2024-05-22 12:38:23] [INFO ] Deduced a trap composed of 26 places in 123 ms of which 2 ms to minimize.
[2024-05-22 12:38:23] [INFO ] Deduced a trap composed of 106 places in 128 ms of which 2 ms to minimize.
[2024-05-22 12:38:24] [INFO ] Deduced a trap composed of 12 places in 147 ms of which 3 ms to minimize.
[2024-05-22 12:38:24] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 2 ms to minimize.
[2024-05-22 12:38:24] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 2 ms to minimize.
[2024-05-22 12:38:24] [INFO ] Deduced a trap composed of 117 places in 124 ms of which 2 ms to minimize.
[2024-05-22 12:38:25] [INFO ] Deduced a trap composed of 20 places in 105 ms of which 2 ms to minimize.
[2024-05-22 12:38:25] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 2 ms to minimize.
[2024-05-22 12:38:25] [INFO ] Deduced a trap composed of 101 places in 118 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/929 variables, 20/576 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 12:38:32] [INFO ] Deduced a trap composed of 96 places in 128 ms of which 2 ms to minimize.
[2024-05-22 12:38:34] [INFO ] Deduced a trap composed of 39 places in 128 ms of which 2 ms to minimize.
[2024-05-22 12:38:34] [INFO ] Deduced a trap composed of 32 places in 112 ms of which 1 ms to minimize.
[2024-05-22 12:38:34] [INFO ] Deduced a trap composed of 29 places in 106 ms of which 1 ms to minimize.
[2024-05-22 12:38:34] [INFO ] Deduced a trap composed of 19 places in 119 ms of which 2 ms to minimize.
[2024-05-22 12:38:35] [INFO ] Deduced a trap composed of 96 places in 129 ms of which 2 ms to minimize.
[2024-05-22 12:38:35] [INFO ] Deduced a trap composed of 102 places in 120 ms of which 2 ms to minimize.
[2024-05-22 12:38:35] [INFO ] Deduced a trap composed of 107 places in 128 ms of which 2 ms to minimize.
[2024-05-22 12:38:36] [INFO ] Deduced a trap composed of 95 places in 118 ms of which 2 ms to minimize.
[2024-05-22 12:38:37] [INFO ] Deduced a trap composed of 98 places in 121 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/929 variables, 10/586 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/929 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/929 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 929/929 variables, and 586 constraints, problems are : Problem set: 0 solved, 3 unsolved in 21471 ms.
Refiners :[State Equation: 476/476 constraints, ReadFeed: 77/77 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 30/30 constraints]
After SMT, in 23106ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 30002 ms.
Support contains 3 out of 476 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 453/453 transitions.
Applied a total of 0 rules in 24 ms. Remains 476 /476 variables (removed 0) and now considering 453/453 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 476/476 places, 453/453 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 453/453 transitions.
Applied a total of 0 rules in 10 ms. Remains 476 /476 variables (removed 0) and now considering 453/453 (removed 0) transitions.
// Phase 1: matrix 453 rows 476 cols
[2024-05-22 12:39:11] [INFO ] Invariants computation overflowed in 37 ms
[2024-05-22 12:39:11] [INFO ] Implicit Places using invariants in 482 ms returned []
// Phase 1: matrix 453 rows 476 cols
[2024-05-22 12:39:11] [INFO ] Invariants computation overflowed in 34 ms
[2024-05-22 12:39:11] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-22 12:39:21] [INFO ] Implicit Places using invariants and state equation in 9945 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 146, 151, 152, 172, 177, 198, 204, 211, 225, 231, 254, 260, 283, 288, 308, 313, 334, 339, 360, 366, 387, 389, 393, 414, 420, 442, 447, 451, 468, 474]
[2024-05-22 12:39:21] [INFO ] Actually due to overlaps returned [211, 151]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 10434 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 474/476 places, 453/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 474 transition count 452
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 473 transition count 452
Applied a total of 2 rules in 23 ms. Remains 473 /474 variables (removed 1) and now considering 452/453 (removed 1) transitions.
// Phase 1: matrix 452 rows 473 cols
[2024-05-22 12:39:21] [INFO ] Invariants computation overflowed in 50 ms
[2024-05-22 12:39:22] [INFO ] Implicit Places using invariants in 480 ms returned []
// Phase 1: matrix 452 rows 473 cols
[2024-05-22 12:39:22] [INFO ] Invariants computation overflowed in 45 ms
[2024-05-22 12:39:22] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-22 12:39:32] [INFO ] Implicit Places using invariants and state equation in 10267 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 146, 151, 171, 176, 197, 203, 222, 228, 251, 257, 280, 285, 305, 310, 331, 336, 357, 363, 384, 386, 390, 411, 417, 439, 444, 448, 465, 471]
[2024-05-22 12:39:32] [INFO ] Actually due to overlaps returned [448, 386]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 10755 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 471/476 places, 452/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 471 transition count 451
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 470 transition count 451
Applied a total of 2 rules in 21 ms. Remains 470 /471 variables (removed 1) and now considering 451/452 (removed 1) transitions.
// Phase 1: matrix 451 rows 470 cols
[2024-05-22 12:39:32] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-22 12:39:32] [INFO ] Implicit Places using invariants in 448 ms returned []
// Phase 1: matrix 451 rows 470 cols
[2024-05-22 12:39:32] [INFO ] Invariants computation overflowed in 29 ms
[2024-05-22 12:39:32] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-22 12:39:45] [INFO ] Implicit Places using invariants and state equation in 12651 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 146, 151, 171, 176, 197, 203, 222, 228, 251, 257, 280, 285, 305, 310, 331, 336, 357, 363, 384, 389, 410, 416, 438, 443, 462, 468]
[2024-05-22 12:39:45] [INFO ] Actually due to overlaps returned [48, 42]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 13102 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 468/476 places, 451/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 468 transition count 450
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 467 transition count 450
Applied a total of 2 rules in 18 ms. Remains 467 /468 variables (removed 1) and now considering 450/451 (removed 1) transitions.
// Phase 1: matrix 450 rows 467 cols
[2024-05-22 12:39:45] [INFO ] Computed 93 invariants in 47 ms
[2024-05-22 12:39:46] [INFO ] Implicit Places using invariants in 1180 ms returned [65, 70, 91, 96, 116, 122, 143, 148, 168, 173, 194, 200, 219, 225, 248, 254, 277, 282, 302, 307, 328, 333, 354, 360, 381, 386, 407, 413, 435, 440, 459, 465]
[2024-05-22 12:39:46] [INFO ] Actually due to overlaps returned [70, 65]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1181 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 465/476 places, 450/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 465 transition count 449
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 464 transition count 449
Applied a total of 2 rules in 19 ms. Remains 464 /465 variables (removed 1) and now considering 449/450 (removed 1) transitions.
// Phase 1: matrix 449 rows 464 cols
[2024-05-22 12:39:46] [INFO ] Computed 91 invariants in 69 ms
[2024-05-22 12:39:47] [INFO ] Implicit Places using invariants in 1025 ms returned [88, 93, 113, 119, 140, 145, 165, 170, 191, 197, 216, 222, 245, 251, 274, 279, 299, 304, 325, 330, 351, 357, 378, 383, 404, 410, 432, 437, 456, 462]
[2024-05-22 12:39:47] [INFO ] Actually due to overlaps returned [93, 88]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1026 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 462/476 places, 449/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 462 transition count 448
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 461 transition count 448
Applied a total of 2 rules in 18 ms. Remains 461 /462 variables (removed 1) and now considering 448/449 (removed 1) transitions.
// Phase 1: matrix 448 rows 461 cols
[2024-05-22 12:39:47] [INFO ] Invariants computation overflowed in 33 ms
[2024-05-22 12:39:48] [INFO ] Implicit Places using invariants in 390 ms returned []
// Phase 1: matrix 448 rows 461 cols
[2024-05-22 12:39:48] [INFO ] Invariants computation overflowed in 26 ms
[2024-05-22 12:39:48] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-22 12:40:04] [INFO ] Implicit Places using invariants and state equation in 16293 ms returned [110, 116, 137, 142, 162, 167, 188, 194, 213, 219, 242, 248, 271, 276, 296, 301, 322, 327, 348, 354, 375, 380, 401, 407, 429, 434, 453, 459]
[2024-05-22 12:40:04] [INFO ] Actually due to overlaps returned [116, 110]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 16686 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 459/476 places, 448/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 459 transition count 447
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 458 transition count 447
Applied a total of 2 rules in 23 ms. Remains 458 /459 variables (removed 1) and now considering 447/448 (removed 1) transitions.
// Phase 1: matrix 447 rows 458 cols
[2024-05-22 12:40:04] [INFO ] Invariants computation overflowed in 54 ms
[2024-05-22 12:40:04] [INFO ] Implicit Places using invariants in 399 ms returned []
// Phase 1: matrix 447 rows 458 cols
[2024-05-22 12:40:04] [INFO ] Invariants computation overflowed in 46 ms
[2024-05-22 12:40:05] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-22 12:40:21] [INFO ] Implicit Places using invariants and state equation in 16485 ms returned [134, 139, 159, 164, 185, 191, 210, 216, 239, 245, 268, 273, 293, 298, 319, 324, 345, 351, 372, 377, 398, 404, 426, 431, 450, 456]
[2024-05-22 12:40:21] [INFO ] Actually due to overlaps returned [139, 134]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 16886 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 456/476 places, 447/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 456 transition count 446
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 455 transition count 446
Applied a total of 2 rules in 22 ms. Remains 455 /456 variables (removed 1) and now considering 446/447 (removed 1) transitions.
// Phase 1: matrix 446 rows 455 cols
[2024-05-22 12:40:21] [INFO ] Computed 85 invariants in 48 ms
[2024-05-22 12:40:22] [INFO ] Implicit Places using invariants in 861 ms returned [156, 161, 182, 188, 207, 213, 236, 242, 265, 270, 290, 295, 316, 321, 342, 348, 369, 374, 395, 401, 423, 428, 447, 453]
[2024-05-22 12:40:22] [INFO ] Actually due to overlaps returned [161, 156]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 862 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 453/476 places, 446/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 453 transition count 445
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 452 transition count 445
Applied a total of 2 rules in 20 ms. Remains 452 /453 variables (removed 1) and now considering 445/446 (removed 1) transitions.
// Phase 1: matrix 445 rows 452 cols
[2024-05-22 12:40:22] [INFO ] Invariants computation overflowed in 44 ms
[2024-05-22 12:40:22] [INFO ] Implicit Places using invariants in 364 ms returned []
// Phase 1: matrix 445 rows 452 cols
[2024-05-22 12:40:22] [INFO ] Invariants computation overflowed in 40 ms
[2024-05-22 12:40:22] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-22 12:40:37] [INFO ] Implicit Places using invariants and state equation in 14648 ms returned [179, 185, 204, 210, 233, 239, 262, 267, 287, 292, 313, 318, 339, 345, 366, 371, 392, 398, 420, 425, 444, 450]
[2024-05-22 12:40:37] [INFO ] Actually due to overlaps returned [185, 179]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 15018 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 450/476 places, 445/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 450 transition count 444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 449 transition count 444
Applied a total of 2 rules in 17 ms. Remains 449 /450 variables (removed 1) and now considering 444/445 (removed 1) transitions.
// Phase 1: matrix 444 rows 449 cols
[2024-05-22 12:40:37] [INFO ] Invariants computation overflowed in 29 ms
[2024-05-22 12:40:37] [INFO ] Implicit Places using invariants in 333 ms returned []
// Phase 1: matrix 444 rows 449 cols
[2024-05-22 12:40:37] [INFO ] Invariants computation overflowed in 23 ms
[2024-05-22 12:40:37] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-22 12:40:47] [INFO ] Implicit Places using invariants and state equation in 10241 ms returned [201, 207, 230, 236, 259, 264, 284, 289, 310, 315, 336, 342, 363, 368, 389, 395, 417, 422, 441, 447]
[2024-05-22 12:40:47] [INFO ] Actually due to overlaps returned [207, 201]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 10576 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 10 : 447/476 places, 444/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 447 transition count 443
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 446 transition count 443
Applied a total of 2 rules in 18 ms. Remains 446 /447 variables (removed 1) and now considering 443/444 (removed 1) transitions.
// Phase 1: matrix 443 rows 446 cols
[2024-05-22 12:40:47] [INFO ] Invariants computation overflowed in 32 ms
[2024-05-22 12:40:48] [INFO ] Implicit Places using invariants in 331 ms returned []
// Phase 1: matrix 443 rows 446 cols
[2024-05-22 12:40:48] [INFO ] Invariants computation overflowed in 25 ms
[2024-05-22 12:40:48] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-22 12:40:55] [INFO ] Implicit Places using invariants and state equation in 7172 ms returned [227, 233, 256, 261, 281, 286, 307, 312, 333, 339, 360, 365, 386, 392, 414, 419, 438, 444]
[2024-05-22 12:40:55] [INFO ] Actually due to overlaps returned [233, 227]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 7504 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 11 : 444/476 places, 443/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 444 transition count 442
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 443 transition count 442
Applied a total of 2 rules in 16 ms. Remains 443 /444 variables (removed 1) and now considering 442/443 (removed 1) transitions.
// Phase 1: matrix 442 rows 443 cols
[2024-05-22 12:40:55] [INFO ] Invariants computation overflowed in 24 ms
[2024-05-22 12:40:55] [INFO ] Implicit Places using invariants in 335 ms returned []
// Phase 1: matrix 442 rows 443 cols
[2024-05-22 12:40:55] [INFO ] Invariants computation overflowed in 25 ms
[2024-05-22 12:40:55] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-22 12:41:03] [INFO ] Implicit Places using invariants and state equation in 7496 ms returned [253, 258, 278, 283, 304, 309, 330, 336, 357, 362, 383, 389, 411, 416, 435, 441]
[2024-05-22 12:41:03] [INFO ] Actually due to overlaps returned [258, 253]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 7832 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 12 : 441/476 places, 442/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 441 transition count 441
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 440 transition count 441
Applied a total of 2 rules in 15 ms. Remains 440 /441 variables (removed 1) and now considering 441/442 (removed 1) transitions.
// Phase 1: matrix 441 rows 440 cols
[2024-05-22 12:41:03] [INFO ] Invariants computation overflowed in 29 ms
[2024-05-22 12:41:03] [INFO ] Implicit Places using invariants in 303 ms returned []
// Phase 1: matrix 441 rows 440 cols
[2024-05-22 12:41:03] [INFO ] Invariants computation overflowed in 24 ms
[2024-05-22 12:41:03] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-22 12:41:11] [INFO ] Implicit Places using invariants and state equation in 8025 ms returned [275, 280, 301, 306, 327, 333, 354, 359, 380, 386, 408, 413, 432, 438]
[2024-05-22 12:41:11] [INFO ] Actually due to overlaps returned [280, 275]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 8331 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 13 : 438/476 places, 441/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 438 transition count 440
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 437 transition count 440
Applied a total of 2 rules in 20 ms. Remains 437 /438 variables (removed 1) and now considering 440/441 (removed 1) transitions.
// Phase 1: matrix 440 rows 437 cols
[2024-05-22 12:41:11] [INFO ] Invariants computation overflowed in 31 ms
[2024-05-22 12:41:11] [INFO ] Implicit Places using invariants in 302 ms returned []
// Phase 1: matrix 440 rows 437 cols
[2024-05-22 12:41:11] [INFO ] Invariants computation overflowed in 32 ms
[2024-05-22 12:41:12] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-22 12:41:27] [INFO ] Implicit Places using invariants and state equation in 15647 ms returned [298, 303, 324, 330, 351, 356, 377, 383, 405, 410, 429, 435]
[2024-05-22 12:41:27] [INFO ] Actually due to overlaps returned [303, 298]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 15951 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 14 : 435/476 places, 440/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 435 transition count 439
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 434 transition count 439
Applied a total of 2 rules in 15 ms. Remains 434 /435 variables (removed 1) and now considering 439/440 (removed 1) transitions.
// Phase 1: matrix 439 rows 434 cols
[2024-05-22 12:41:27] [INFO ] Invariants computation overflowed in 25 ms
[2024-05-22 12:41:27] [INFO ] Implicit Places using invariants in 287 ms returned []
// Phase 1: matrix 439 rows 434 cols
[2024-05-22 12:41:27] [INFO ] Invariants computation overflowed in 23 ms
[2024-05-22 12:41:27] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-22 12:41:35] [INFO ] Implicit Places using invariants and state equation in 8077 ms returned [321, 327, 348, 353, 374, 380, 402, 407, 426, 432]
[2024-05-22 12:41:35] [INFO ] Actually due to overlaps returned [327, 321]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 8367 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 15 : 432/476 places, 439/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 432 transition count 438
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 431 transition count 438
Applied a total of 2 rules in 20 ms. Remains 431 /432 variables (removed 1) and now considering 438/439 (removed 1) transitions.
// Phase 1: matrix 438 rows 431 cols
[2024-05-22 12:41:35] [INFO ] Invariants computation overflowed in 30 ms
[2024-05-22 12:41:36] [INFO ] Implicit Places using invariants in 294 ms returned []
// Phase 1: matrix 438 rows 431 cols
[2024-05-22 12:41:36] [INFO ] Invariants computation overflowed in 26 ms
[2024-05-22 12:41:36] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-22 12:41:48] [INFO ] Implicit Places using invariants and state equation in 12320 ms returned [345, 350, 371, 377, 399, 404, 423, 429]
[2024-05-22 12:41:48] [INFO ] Actually due to overlaps returned [350, 345]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 12616 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 16 : 429/476 places, 438/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 429 transition count 437
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 428 transition count 437
Applied a total of 2 rules in 15 ms. Remains 428 /429 variables (removed 1) and now considering 437/438 (removed 1) transitions.
// Phase 1: matrix 437 rows 428 cols
[2024-05-22 12:41:48] [INFO ] Computed 67 invariants in 42 ms
[2024-05-22 12:41:48] [INFO ] Implicit Places using invariants in 452 ms returned [368, 374, 396, 401, 420, 426]
[2024-05-22 12:41:48] [INFO ] Actually due to overlaps returned [374, 368]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 454 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 17 : 426/476 places, 437/453 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 426 transition count 437
Applied a total of 1 rules in 19 ms. Remains 426 /426 variables (removed 0) and now considering 437/437 (removed 0) transitions.
// Phase 1: matrix 437 rows 426 cols
[2024-05-22 12:41:49] [INFO ] Invariants computation overflowed in 29 ms
[2024-05-22 12:41:49] [INFO ] Implicit Places using invariants in 287 ms returned []
// Phase 1: matrix 437 rows 426 cols
[2024-05-22 12:41:49] [INFO ] Invariants computation overflowed in 25 ms
[2024-05-22 12:41:49] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-22 12:41:55] [INFO ] Implicit Places using invariants and state equation in 6547 ms returned [394, 399, 418, 424]
[2024-05-22 12:41:55] [INFO ] Actually due to overlaps returned [399, 394]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 6837 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 18 : 424/476 places, 437/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 424 transition count 436
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 423 transition count 436
Applied a total of 2 rules in 20 ms. Remains 423 /424 variables (removed 1) and now considering 436/437 (removed 1) transitions.
// Phase 1: matrix 436 rows 423 cols
[2024-05-22 12:41:55] [INFO ] Invariants computation overflowed in 26 ms
[2024-05-22 12:41:56] [INFO ] Implicit Places using invariants in 273 ms returned []
// Phase 1: matrix 436 rows 423 cols
[2024-05-22 12:41:56] [INFO ] Invariants computation overflowed in 27 ms
[2024-05-22 12:41:56] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-22 12:42:11] [INFO ] Implicit Places using invariants and state equation in 15299 ms returned [415, 421]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 15575 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 19 : 421/476 places, 436/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 421 transition count 435
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 420 transition count 435
Applied a total of 2 rules in 19 ms. Remains 420 /421 variables (removed 1) and now considering 435/436 (removed 1) transitions.
// Phase 1: matrix 435 rows 420 cols
[2024-05-22 12:42:11] [INFO ] Invariants computation overflowed in 30 ms
[2024-05-22 12:42:11] [INFO ] Implicit Places using invariants in 285 ms returned []
// Phase 1: matrix 435 rows 420 cols
[2024-05-22 12:42:11] [INFO ] Invariants computation overflowed in 25 ms
[2024-05-22 12:42:11] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-22 12:42:21] [INFO ] Implicit Places using invariants and state equation in 9922 ms returned []
Implicit Place search using SMT with State Equation took 10208 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 20 : 420/476 places, 435/453 transitions.
Finished structural reductions in REACHABILITY mode , in 20 iterations and 190570 ms. Remains : 420/476 places, 435/453 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p1 p0)), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p1 p0))), (X (X (NOT p0))), (X (X p1)), (G (OR (NOT p0) p1))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 108 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[true, (NOT p1)]
Stuttering acceptance computed with spot in 46 ms :[true, (NOT p1)]
Support contains 2 out of 1057 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 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1056 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 0 with 239 rules applied. Total rules applied 240 place count 1055 transition count 756
Reduce places removed 239 places and 0 transitions.
Iterating post reduction 1 with 239 rules applied. Total rules applied 479 place count 816 transition count 756
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 39 Pre rules applied. Total rules applied 479 place count 816 transition count 717
Deduced a syphon composed of 39 places in 6 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 557 place count 777 transition count 717
Performed 183 Post agglomeration using F-continuation condition.Transition count delta: 183
Deduced a syphon composed of 183 places in 3 ms
Reduce places removed 183 places and 0 transitions.
Iterating global reduction 2 with 366 rules applied. Total rules applied 923 place count 594 transition count 534
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 37 places in 2 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 997 place count 557 transition count 534
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 998 place count 556 transition count 533
Applied a total of 998 rules in 90 ms. Remains 556 /1057 variables (removed 501) and now considering 533/997 (removed 464) transitions.
// Phase 1: matrix 533 rows 556 cols
[2024-05-22 12:42:21] [INFO ] Invariants computation overflowed in 47 ms
[2024-05-22 12:42:22] [INFO ] Implicit Places using invariants in 291 ms returned []
// Phase 1: matrix 533 rows 556 cols
[2024-05-22 12:42:22] [INFO ] Invariants computation overflowed in 37 ms
[2024-05-22 12:42:22] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-22 12:42:30] [INFO ] Implicit Places using invariants and state equation in 8095 ms returned []
Implicit Place search using SMT with State Equation took 8389 ms to find 0 implicit places.
[2024-05-22 12:42:30] [INFO ] Redundant transitions in 34 ms returned []
Running 532 sub problems to find dead transitions.
// Phase 1: matrix 533 rows 556 cols
[2024-05-22 12:42:30] [INFO ] Invariants computation overflowed in 37 ms
[2024-05-22 12:42:30] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/555 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 532 unsolved
At refinement iteration 1 (OVERLAPS) 533/1088 variables, 555/555 constraints. Problems are: Problem set: 0 solved, 532 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1088 variables, 38/593 constraints. Problems are: Problem set: 0 solved, 532 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1088 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 532 unsolved
SMT process timed out in 30136ms, After SMT, problems are : Problem set: 0 solved, 532 unsolved
Search for dead transitions found 0 dead transitions in 30149ms
Starting structural reductions in SI_LTL mode, iteration 1 : 556/1057 places, 533/997 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 38672 ms. Remains : 556/1057 places, 533/997 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1741 edges and 556 vertex of which 555 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 64 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[true, (NOT p1)]
RANDOM walk for 40000 steps (5552 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3298 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 417395 steps, run timeout after 3001 ms. (steps per millisecond=139 ) properties seen :0 out of 1
Probabilistic random walk after 417395 steps, saw 208772 distinct states, run finished after 3001 ms. (steps per millisecond=139 ) properties seen :0
// Phase 1: matrix 533 rows 556 cols
[2024-05-22 12:43:03] [INFO ] Invariants computation overflowed in 47 ms
[2024-05-22 12:43:03] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/45 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 118/163 variables, 52/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 3/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 177/340 variables, 83/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/340 variables, 7/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/340 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 195/535 variables, 100/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/535 variables, 8/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/535 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 160/695 variables, 93/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/695 variables, 8/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/695 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 75/770 variables, 45/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/770 variables, 3/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/770 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 55/825 variables, 28/443 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/825 variables, 2/445 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/825 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 55/880 variables, 28/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/880 variables, 2/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/880 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 55/935 variables, 28/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/935 variables, 2/505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/935 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 55/990 variables, 28/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/990 variables, 2/535 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/990 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 53/1043 variables, 28/563 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1043 variables, 1/564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1043 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 38/1081 variables, 22/586 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1081 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 8/1089 variables, 8/594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1089 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 0/1089 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1089/1089 variables, and 594 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1024 ms.
Refiners :[State Equation: 556/556 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/45 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 118/163 variables, 52/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 3/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/163 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 177/340 variables, 83/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/340 variables, 7/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/340 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 195/535 variables, 100/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/535 variables, 8/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/535 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 160/695 variables, 93/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/695 variables, 8/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/695 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 75/770 variables, 45/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/770 variables, 3/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/770 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 55/825 variables, 28/444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/825 variables, 2/446 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/825 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 55/880 variables, 28/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/880 variables, 2/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/880 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 55/935 variables, 28/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/935 variables, 2/506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/935 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 55/990 variables, 28/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/990 variables, 2/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/990 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 53/1043 variables, 28/564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1043 variables, 1/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1043 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 38/1081 variables, 22/587 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 12:43:06] [INFO ] Deduced a trap composed of 34 places in 111 ms of which 2 ms to minimize.
[2024-05-22 12:43:06] [INFO ] Deduced a trap composed of 30 places in 94 ms of which 2 ms to minimize.
[2024-05-22 12:43:06] [INFO ] Deduced a trap composed of 30 places in 114 ms of which 3 ms to minimize.
[2024-05-22 12:43:06] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 2 ms to minimize.
[2024-05-22 12:43:06] [INFO ] Deduced a trap composed of 30 places in 106 ms of which 3 ms to minimize.
[2024-05-22 12:43:06] [INFO ] Deduced a trap composed of 22 places in 112 ms of which 2 ms to minimize.
[2024-05-22 12:43:06] [INFO ] Deduced a trap composed of 42 places in 110 ms of which 2 ms to minimize.
[2024-05-22 12:43:07] [INFO ] Deduced a trap composed of 47 places in 115 ms of which 2 ms to minimize.
[2024-05-22 12:43:07] [INFO ] Deduced a trap composed of 55 places in 123 ms of which 2 ms to minimize.
[2024-05-22 12:43:07] [INFO ] Deduced a trap composed of 26 places in 103 ms of which 2 ms to minimize.
[2024-05-22 12:43:07] [INFO ] Deduced a trap composed of 18 places in 116 ms of which 2 ms to minimize.
[2024-05-22 12:43:07] [INFO ] Deduced a trap composed of 65 places in 107 ms of which 2 ms to minimize.
[2024-05-22 12:43:07] [INFO ] Deduced a trap composed of 62 places in 101 ms of which 2 ms to minimize.
[2024-05-22 12:43:07] [INFO ] Deduced a trap composed of 57 places in 108 ms of which 2 ms to minimize.
[2024-05-22 12:43:08] [INFO ] Deduced a trap composed of 59 places in 107 ms of which 2 ms to minimize.
[2024-05-22 12:43:08] [INFO ] Deduced a trap composed of 55 places in 104 ms of which 2 ms to minimize.
[2024-05-22 12:43:08] [INFO ] Deduced a trap composed of 55 places in 126 ms of which 3 ms to minimize.
[2024-05-22 12:43:08] [INFO ] Deduced a trap composed of 48 places in 118 ms of which 2 ms to minimize.
[2024-05-22 12:43:08] [INFO ] Deduced a trap composed of 53 places in 124 ms of which 2 ms to minimize.
[2024-05-22 12:43:09] [INFO ] Deduced a trap composed of 61 places in 114 ms of which 2 ms to minimize.
At refinement iteration 37 (INCLUDED_ONLY) 0/1081 variables, 20/607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 12:43:09] [INFO ] Deduced a trap composed of 51 places in 128 ms of which 2 ms to minimize.
[2024-05-22 12:43:09] [INFO ] Deduced a trap composed of 60 places in 109 ms of which 3 ms to minimize.
[2024-05-22 12:43:09] [INFO ] Deduced a trap composed of 51 places in 112 ms of which 3 ms to minimize.
SMT process timed out in 6143ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 556 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 556/556 places, 533/533 transitions.
Graph (complete) has 1661 edges and 556 vertex of which 555 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 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 0 with 3 rules applied. Total rules applied 4 place count 555 transition count 530
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 553 transition count 530
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 552 transition count 530
Free-agglomeration rule (complex) applied 77 times.
Iterating global reduction 2 with 77 rules applied. Total rules applied 85 place count 552 transition count 453
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 2 with 77 rules applied. Total rules applied 162 place count 475 transition count 453
Partial Free-agglomeration rule applied 78 times.
Drop transitions (Partial Free agglomeration) removed 78 transitions
Iterating global reduction 3 with 78 rules applied. Total rules applied 240 place count 475 transition count 453
Applied a total of 240 rules in 53 ms. Remains 475 /556 variables (removed 81) and now considering 453/533 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 475/556 places, 453/533 transitions.
RANDOM walk for 40000 steps (5102 resets) in 60 ms. (655 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3378 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 440889 steps, run timeout after 3001 ms. (steps per millisecond=146 ) properties seen :0 out of 1
Probabilistic random walk after 440889 steps, saw 220576 distinct states, run finished after 3001 ms. (steps per millisecond=146 ) properties seen :0
// Phase 1: matrix 453 rows 475 cols
[2024-05-22 12:43:12] [INFO ] Computed 99 invariants in 40 ms
[2024-05-22 12:43:12] [INFO ] State equation strengthened by 77 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 212/214 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/214 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 238/452 variables, 77/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 12:43:13] [INFO ] Deduced a trap composed of 7 places in 258 ms of which 2 ms to minimize.
[2024-05-22 12:43:13] [INFO ] Deduced a trap composed of 121 places in 237 ms of which 2 ms to minimize.
[2024-05-22 12:43:13] [INFO ] Deduced a trap composed of 13 places in 256 ms of which 3 ms to minimize.
[2024-05-22 12:43:14] [INFO ] Deduced a trap composed of 13 places in 252 ms of which 2 ms to minimize.
[2024-05-22 12:43:14] [INFO ] Deduced a trap composed of 16 places in 252 ms of which 3 ms to minimize.
[2024-05-22 12:43:14] [INFO ] Deduced a trap composed of 17 places in 242 ms of which 3 ms to minimize.
[2024-05-22 12:43:14] [INFO ] Deduced a trap composed of 13 places in 250 ms of which 3 ms to minimize.
[2024-05-22 12:43:15] [INFO ] Deduced a trap composed of 19 places in 237 ms of which 4 ms to minimize.
[2024-05-22 12:43:15] [INFO ] Deduced a trap composed of 128 places in 244 ms of which 3 ms to minimize.
[2024-05-22 12:43:15] [INFO ] Deduced a trap composed of 128 places in 243 ms of which 3 ms to minimize.
[2024-05-22 12:43:15] [INFO ] Deduced a trap composed of 121 places in 252 ms of which 2 ms to minimize.
[2024-05-22 12:43:16] [INFO ] Deduced a trap composed of 18 places in 253 ms of which 3 ms to minimize.
[2024-05-22 12:43:16] [INFO ] Deduced a trap composed of 22 places in 248 ms of which 3 ms to minimize.
[2024-05-22 12:43:16] [INFO ] Deduced a trap composed of 22 places in 245 ms of which 3 ms to minimize.
[2024-05-22 12:43:16] [INFO ] Deduced a trap composed of 133 places in 248 ms of which 3 ms to minimize.
[2024-05-22 12:43:17] [INFO ] Deduced a trap composed of 124 places in 239 ms of which 3 ms to minimize.
[2024-05-22 12:43:17] [INFO ] Deduced a trap composed of 15 places in 253 ms of which 3 ms to minimize.
[2024-05-22 12:43:17] [INFO ] Deduced a trap composed of 25 places in 253 ms of which 3 ms to minimize.
[2024-05-22 12:43:18] [INFO ] Deduced a trap composed of 24 places in 251 ms of which 3 ms to minimize.
[2024-05-22 12:43:18] [INFO ] Deduced a trap composed of 31 places in 247 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/452 variables, 20/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 12:43:18] [INFO ] Deduced a trap composed of 128 places in 249 ms of which 3 ms to minimize.
[2024-05-22 12:43:18] [INFO ] Deduced a trap composed of 130 places in 246 ms of which 3 ms to minimize.
[2024-05-22 12:43:19] [INFO ] Deduced a trap composed of 129 places in 250 ms of which 2 ms to minimize.
[2024-05-22 12:43:19] [INFO ] Deduced a trap composed of 28 places in 246 ms of which 3 ms to minimize.
[2024-05-22 12:43:19] [INFO ] Deduced a trap composed of 31 places in 142 ms of which 4 ms to minimize.
[2024-05-22 12:43:19] [INFO ] Deduced a trap composed of 34 places in 133 ms of which 2 ms to minimize.
[2024-05-22 12:43:19] [INFO ] Deduced a trap composed of 20 places in 135 ms of which 2 ms to minimize.
[2024-05-22 12:43:19] [INFO ] Deduced a trap composed of 34 places in 111 ms of which 1 ms to minimize.
[2024-05-22 12:43:19] [INFO ] Deduced a trap composed of 60 places in 118 ms of which 2 ms to minimize.
[2024-05-22 12:43:20] [INFO ] Deduced a trap composed of 62 places in 112 ms of which 2 ms to minimize.
[2024-05-22 12:43:20] [INFO ] Deduced a trap composed of 75 places in 130 ms of which 2 ms to minimize.
[2024-05-22 12:43:20] [INFO ] Deduced a trap composed of 87 places in 135 ms of which 4 ms to minimize.
[2024-05-22 12:43:20] [INFO ] Deduced a trap composed of 48 places in 120 ms of which 1 ms to minimize.
[2024-05-22 12:43:20] [INFO ] Deduced a trap composed of 36 places in 118 ms of which 2 ms to minimize.
[2024-05-22 12:43:20] [INFO ] Deduced a trap composed of 37 places in 118 ms of which 1 ms to minimize.
[2024-05-22 12:43:20] [INFO ] Deduced a trap composed of 92 places in 111 ms of which 2 ms to minimize.
[2024-05-22 12:43:21] [INFO ] Deduced a trap composed of 94 places in 117 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/452 variables, 17/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/452 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 18/470 variables, 7/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/470 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 453/923 variables, 470/604 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/923 variables, 77/681 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/923 variables, 0/681 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 5/928 variables, 5/686 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/928 variables, 2/688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/928 variables, 0/688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/928 variables, 0/688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 928/928 variables, and 688 constraints, problems are : Problem set: 0 solved, 1 unsolved in 9008 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 475/475 constraints, ReadFeed: 77/77 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 37/37 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 212/214 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/214 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 238/452 variables, 77/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/452 variables, 37/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 12:43:22] [INFO ] Deduced a trap composed of 131 places in 248 ms of which 3 ms to minimize.
[2024-05-22 12:43:22] [INFO ] Deduced a trap composed of 137 places in 240 ms of which 3 ms to minimize.
[2024-05-22 12:43:22] [INFO ] Deduced a trap composed of 140 places in 226 ms of which 3 ms to minimize.
[2024-05-22 12:43:23] [INFO ] Deduced a trap composed of 33 places in 239 ms of which 2 ms to minimize.
[2024-05-22 12:43:23] [INFO ] Deduced a trap composed of 133 places in 241 ms of which 3 ms to minimize.
[2024-05-22 12:43:23] [INFO ] Deduced a trap composed of 144 places in 240 ms of which 2 ms to minimize.
[2024-05-22 12:43:23] [INFO ] Deduced a trap composed of 26 places in 224 ms of which 3 ms to minimize.
[2024-05-22 12:43:24] [INFO ] Deduced a trap composed of 140 places in 226 ms of which 2 ms to minimize.
[2024-05-22 12:43:24] [INFO ] Deduced a trap composed of 135 places in 225 ms of which 3 ms to minimize.
[2024-05-22 12:43:24] [INFO ] Deduced a trap composed of 135 places in 235 ms of which 3 ms to minimize.
[2024-05-22 12:43:24] [INFO ] Deduced a trap composed of 136 places in 251 ms of which 2 ms to minimize.
[2024-05-22 12:43:25] [INFO ] Deduced a trap composed of 136 places in 237 ms of which 3 ms to minimize.
[2024-05-22 12:43:25] [INFO ] Deduced a trap composed of 114 places in 223 ms of which 3 ms to minimize.
[2024-05-22 12:43:25] [INFO ] Deduced a trap composed of 118 places in 239 ms of which 3 ms to minimize.
[2024-05-22 12:43:25] [INFO ] Deduced a trap composed of 133 places in 224 ms of which 2 ms to minimize.
[2024-05-22 12:43:25] [INFO ] Deduced a trap composed of 123 places in 227 ms of which 2 ms to minimize.
[2024-05-22 12:43:26] [INFO ] Deduced a trap composed of 130 places in 249 ms of which 3 ms to minimize.
[2024-05-22 12:43:26] [INFO ] Deduced a trap composed of 144 places in 252 ms of which 3 ms to minimize.
[2024-05-22 12:43:26] [INFO ] Deduced a trap composed of 117 places in 237 ms of which 2 ms to minimize.
[2024-05-22 12:43:27] [INFO ] Deduced a trap composed of 136 places in 244 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/452 variables, 20/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 12:43:27] [INFO ] Deduced a trap composed of 143 places in 240 ms of which 3 ms to minimize.
[2024-05-22 12:43:27] [INFO ] Deduced a trap composed of 142 places in 214 ms of which 2 ms to minimize.
[2024-05-22 12:43:27] [INFO ] Deduced a trap composed of 137 places in 214 ms of which 3 ms to minimize.
[2024-05-22 12:43:27] [INFO ] Deduced a trap composed of 132 places in 238 ms of which 2 ms to minimize.
[2024-05-22 12:43:28] [INFO ] Deduced a trap composed of 125 places in 229 ms of which 2 ms to minimize.
[2024-05-22 12:43:28] [INFO ] Deduced a trap composed of 125 places in 232 ms of which 3 ms to minimize.
[2024-05-22 12:43:28] [INFO ] Deduced a trap composed of 140 places in 229 ms of which 2 ms to minimize.
[2024-05-22 12:43:28] [INFO ] Deduced a trap composed of 115 places in 227 ms of which 3 ms to minimize.
[2024-05-22 12:43:29] [INFO ] Deduced a trap composed of 117 places in 234 ms of which 3 ms to minimize.
[2024-05-22 12:43:29] [INFO ] Deduced a trap composed of 148 places in 226 ms of which 2 ms to minimize.
[2024-05-22 12:43:29] [INFO ] Deduced a trap composed of 13 places in 230 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/452 variables, 11/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/452 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 18/470 variables, 7/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/470 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 453/923 variables, 470/635 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/923 variables, 77/712 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/923 variables, 1/713 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/923 variables, 0/713 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 5/928 variables, 5/718 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/928 variables, 2/720 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/928 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/928 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 928/928 variables, and 720 constraints, problems are : Problem set: 0 solved, 1 unsolved in 10375 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 475/475 constraints, ReadFeed: 77/77 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 68/68 constraints]
After SMT, in 19433ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 3289 ms.
Support contains 2 out of 475 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 453/453 transitions.
Applied a total of 0 rules in 10 ms. Remains 475 /475 variables (removed 0) and now considering 453/453 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 475/475 places, 453/453 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 453/453 transitions.
Applied a total of 0 rules in 9 ms. Remains 475 /475 variables (removed 0) and now considering 453/453 (removed 0) transitions.
[2024-05-22 12:43:35] [INFO ] Invariant cache hit.
[2024-05-22 12:43:37] [INFO ] Implicit Places using invariants in 1467 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 146, 151, 152, 172, 177, 198, 204, 211, 225, 230, 253, 259, 282, 287, 307, 312, 333, 338, 359, 365, 386, 388, 392, 413, 419, 441, 446, 450, 467, 473]
[2024-05-22 12:43:37] [INFO ] Actually due to overlaps returned [211, 151]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1469 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 473/475 places, 453/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 473 transition count 452
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 472 transition count 452
Applied a total of 2 rules in 19 ms. Remains 472 /473 variables (removed 1) and now considering 452/453 (removed 1) transitions.
// Phase 1: matrix 452 rows 472 cols
[2024-05-22 12:43:37] [INFO ] Invariants computation overflowed in 46 ms
[2024-05-22 12:43:37] [INFO ] Implicit Places using invariants in 483 ms returned []
// Phase 1: matrix 452 rows 472 cols
[2024-05-22 12:43:37] [INFO ] Invariants computation overflowed in 38 ms
[2024-05-22 12:43:37] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-22 12:43:47] [INFO ] Implicit Places using invariants and state equation in 9466 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 146, 151, 171, 176, 197, 203, 222, 227, 250, 256, 279, 284, 304, 309, 330, 335, 356, 362, 383, 385, 389, 410, 416, 438, 443, 447, 464, 470]
[2024-05-22 12:43:47] [INFO ] Actually due to overlaps returned [447, 385]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 9950 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 470/475 places, 452/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 470 transition count 451
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 469 transition count 451
Applied a total of 2 rules in 18 ms. Remains 469 /470 variables (removed 1) and now considering 451/452 (removed 1) transitions.
// Phase 1: matrix 451 rows 469 cols
[2024-05-22 12:43:47] [INFO ] Invariants computation overflowed in 37 ms
[2024-05-22 12:43:47] [INFO ] Implicit Places using invariants in 440 ms returned []
// Phase 1: matrix 451 rows 469 cols
[2024-05-22 12:43:47] [INFO ] Invariants computation overflowed in 30 ms
[2024-05-22 12:43:47] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-22 12:44:00] [INFO ] Implicit Places using invariants and state equation in 12980 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 146, 151, 171, 176, 197, 203, 222, 227, 250, 256, 279, 284, 304, 309, 330, 335, 356, 362, 383, 388, 409, 415, 437, 442, 461, 467]
[2024-05-22 12:44:00] [INFO ] Actually due to overlaps returned [48, 42]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 13424 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 467/475 places, 451/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 467 transition count 450
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 466 transition count 450
Applied a total of 2 rules in 18 ms. Remains 466 /467 variables (removed 1) and now considering 450/451 (removed 1) transitions.
// Phase 1: matrix 450 rows 466 cols
[2024-05-22 12:44:00] [INFO ] Invariants computation overflowed in 24 ms
[2024-05-22 12:44:00] [INFO ] Implicit Places using invariants in 423 ms returned []
// Phase 1: matrix 450 rows 466 cols
[2024-05-22 12:44:01] [INFO ] Invariants computation overflowed in 20 ms
[2024-05-22 12:44:01] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-22 12:44:10] [INFO ] Implicit Places using invariants and state equation in 9669 ms returned [65, 70, 91, 96, 116, 122, 143, 148, 168, 173, 194, 200, 219, 224, 247, 253, 276, 281, 301, 306, 327, 332, 353, 359, 380, 385, 406, 412, 434, 439, 458, 464]
[2024-05-22 12:44:10] [INFO ] Actually due to overlaps returned [70, 65]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 10096 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 464/475 places, 450/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 464 transition count 449
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 463 transition count 449
Applied a total of 2 rules in 23 ms. Remains 463 /464 variables (removed 1) and now considering 449/450 (removed 1) transitions.
// Phase 1: matrix 449 rows 463 cols
[2024-05-22 12:44:10] [INFO ] Computed 91 invariants in 45 ms
[2024-05-22 12:44:11] [INFO ] Implicit Places using invariants in 1046 ms returned [88, 93, 113, 119, 140, 145, 165, 170, 191, 197, 216, 221, 244, 250, 273, 278, 298, 303, 324, 329, 350, 356, 377, 382, 403, 409, 431, 436, 455, 461]
[2024-05-22 12:44:11] [INFO ] Actually due to overlaps returned [93, 88]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1048 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 461/475 places, 449/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 461 transition count 448
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 460 transition count 448
Applied a total of 2 rules in 18 ms. Remains 460 /461 variables (removed 1) and now considering 448/449 (removed 1) transitions.
// Phase 1: matrix 448 rows 460 cols
[2024-05-22 12:44:11] [INFO ] Invariants computation overflowed in 35 ms
[2024-05-22 12:44:12] [INFO ] Implicit Places using invariants in 393 ms returned []
// Phase 1: matrix 448 rows 460 cols
[2024-05-22 12:44:12] [INFO ] Invariants computation overflowed in 29 ms
[2024-05-22 12:44:12] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-22 12:44:23] [INFO ] Implicit Places using invariants and state equation in 11843 ms returned [110, 116, 137, 142, 162, 167, 188, 194, 213, 218, 241, 247, 270, 275, 295, 300, 321, 326, 347, 353, 374, 379, 400, 406, 428, 433, 452, 458]
[2024-05-22 12:44:23] [INFO ] Actually due to overlaps returned [116, 110]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 12238 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 458/475 places, 448/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 458 transition count 447
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 457 transition count 447
Applied a total of 2 rules in 17 ms. Remains 457 /458 variables (removed 1) and now considering 447/448 (removed 1) transitions.
// Phase 1: matrix 447 rows 457 cols
[2024-05-22 12:44:24] [INFO ] Invariants computation overflowed in 27 ms
[2024-05-22 12:44:24] [INFO ] Implicit Places using invariants in 383 ms returned []
// Phase 1: matrix 447 rows 457 cols
[2024-05-22 12:44:24] [INFO ] Invariants computation overflowed in 22 ms
[2024-05-22 12:44:24] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-22 12:44:31] [INFO ] Implicit Places using invariants and state equation in 7442 ms returned [134, 139, 159, 164, 185, 191, 210, 215, 238, 244, 267, 272, 292, 297, 318, 323, 344, 350, 371, 376, 397, 403, 425, 430, 449, 455]
[2024-05-22 12:44:31] [INFO ] Actually due to overlaps returned [139, 134]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 7827 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 455/475 places, 447/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 455 transition count 446
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 454 transition count 446
Applied a total of 2 rules in 17 ms. Remains 454 /455 variables (removed 1) and now considering 446/447 (removed 1) transitions.
// Phase 1: matrix 446 rows 454 cols
[2024-05-22 12:44:31] [INFO ] Invariants computation overflowed in 32 ms
[2024-05-22 12:44:32] [INFO ] Implicit Places using invariants in 382 ms returned []
// Phase 1: matrix 446 rows 454 cols
[2024-05-22 12:44:32] [INFO ] Invariants computation overflowed in 26 ms
[2024-05-22 12:44:32] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-22 12:44:42] [INFO ] Implicit Places using invariants and state equation in 10334 ms returned [156, 161, 182, 188, 207, 212, 235, 241, 264, 269, 289, 294, 315, 320, 341, 347, 368, 373, 394, 400, 422, 427, 446, 452]
[2024-05-22 12:44:42] [INFO ] Actually due to overlaps returned [161, 156]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 10722 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 452/475 places, 446/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 452 transition count 445
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 451 transition count 445
Applied a total of 2 rules in 19 ms. Remains 451 /452 variables (removed 1) and now considering 445/446 (removed 1) transitions.
// Phase 1: matrix 445 rows 451 cols
[2024-05-22 12:44:42] [INFO ] Invariants computation overflowed in 26 ms
[2024-05-22 12:44:42] [INFO ] Implicit Places using invariants in 346 ms returned []
// Phase 1: matrix 445 rows 451 cols
[2024-05-22 12:44:42] [INFO ] Invariants computation overflowed in 29 ms
[2024-05-22 12:44:43] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-22 12:44:49] [INFO ] Implicit Places using invariants and state equation in 6848 ms returned [179, 185, 204, 209, 232, 238, 261, 266, 286, 291, 312, 317, 338, 344, 365, 370, 391, 397, 419, 424, 443, 449]
[2024-05-22 12:44:49] [INFO ] Actually due to overlaps returned [185, 179]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 7198 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 449/475 places, 445/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 449 transition count 444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 448 transition count 444
Applied a total of 2 rules in 21 ms. Remains 448 /449 variables (removed 1) and now considering 444/445 (removed 1) transitions.
// Phase 1: matrix 444 rows 448 cols
[2024-05-22 12:44:49] [INFO ] Invariants computation overflowed in 27 ms
[2024-05-22 12:44:50] [INFO ] Implicit Places using invariants in 333 ms returned []
// Phase 1: matrix 444 rows 448 cols
[2024-05-22 12:44:50] [INFO ] Invariants computation overflowed in 25 ms
[2024-05-22 12:44:50] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-22 12:45:05] [INFO ] Implicit Places using invariants and state equation in 15080 ms returned [201, 206, 229, 235, 258, 263, 283, 288, 309, 314, 335, 341, 362, 367, 388, 394, 416, 421, 440, 446]
[2024-05-22 12:45:05] [INFO ] Actually due to overlaps returned [206, 201]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 15415 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 10 : 446/475 places, 444/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 446 transition count 443
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 445 transition count 443
Applied a total of 2 rules in 19 ms. Remains 445 /446 variables (removed 1) and now considering 443/444 (removed 1) transitions.
// Phase 1: matrix 443 rows 445 cols
[2024-05-22 12:45:05] [INFO ] Invariants computation overflowed in 24 ms
[2024-05-22 12:45:05] [INFO ] Implicit Places using invariants in 323 ms returned []
// Phase 1: matrix 443 rows 445 cols
[2024-05-22 12:45:05] [INFO ] Invariants computation overflowed in 24 ms
[2024-05-22 12:45:05] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-22 12:45:12] [INFO ] Implicit Places using invariants and state equation in 7220 ms returned [226, 232, 255, 260, 280, 285, 306, 311, 332, 338, 359, 364, 385, 391, 413, 418, 437, 443]
[2024-05-22 12:45:12] [INFO ] Actually due to overlaps returned [232, 226]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 7544 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 11 : 443/475 places, 443/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 443 transition count 442
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 442 transition count 442
Applied a total of 2 rules in 16 ms. Remains 442 /443 variables (removed 1) and now considering 442/443 (removed 1) transitions.
// Phase 1: matrix 442 rows 442 cols
[2024-05-22 12:45:12] [INFO ] Computed 77 invariants in 51 ms
[2024-05-22 12:45:13] [INFO ] Implicit Places using invariants in 646 ms returned [252, 257, 277, 282, 303, 308, 329, 335, 356, 361, 382, 388, 410, 415, 434, 440]
[2024-05-22 12:45:13] [INFO ] Actually due to overlaps returned [257, 252]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 648 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 12 : 440/475 places, 442/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 440 transition count 441
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 439 transition count 441
Applied a total of 2 rules in 23 ms. Remains 439 /440 variables (removed 1) and now considering 441/442 (removed 1) transitions.
// Phase 1: matrix 441 rows 439 cols
[2024-05-22 12:45:13] [INFO ] Invariants computation overflowed in 31 ms
[2024-05-22 12:45:13] [INFO ] Implicit Places using invariants in 322 ms returned []
// Phase 1: matrix 441 rows 439 cols
[2024-05-22 12:45:13] [INFO ] Invariants computation overflowed in 24 ms
[2024-05-22 12:45:14] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-22 12:45:19] [INFO ] Implicit Places using invariants and state equation in 5708 ms returned [274, 279, 300, 305, 326, 332, 353, 358, 379, 385, 407, 412, 431, 437]
[2024-05-22 12:45:19] [INFO ] Actually due to overlaps returned [279, 274]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 6033 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 13 : 437/475 places, 441/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 437 transition count 440
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 436 transition count 440
Applied a total of 2 rules in 18 ms. Remains 436 /437 variables (removed 1) and now considering 440/441 (removed 1) transitions.
// Phase 1: matrix 440 rows 436 cols
[2024-05-22 12:45:19] [INFO ] Invariants computation overflowed in 26 ms
[2024-05-22 12:45:19] [INFO ] Implicit Places using invariants in 307 ms returned []
// Phase 1: matrix 440 rows 436 cols
[2024-05-22 12:45:19] [INFO ] Invariants computation overflowed in 23 ms
[2024-05-22 12:45:20] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-22 12:45:31] [INFO ] Implicit Places using invariants and state equation in 11445 ms returned [297, 302, 323, 329, 350, 355, 376, 382, 404, 409, 428, 434]
[2024-05-22 12:45:31] [INFO ] Actually due to overlaps returned [302, 297]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 11759 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 14 : 434/475 places, 440/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 434 transition count 439
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 433 transition count 439
Applied a total of 2 rules in 20 ms. Remains 433 /434 variables (removed 1) and now considering 439/440 (removed 1) transitions.
// Phase 1: matrix 439 rows 433 cols
[2024-05-22 12:45:31] [INFO ] Invariants computation overflowed in 31 ms
[2024-05-22 12:45:31] [INFO ] Implicit Places using invariants in 289 ms returned []
// Phase 1: matrix 439 rows 433 cols
[2024-05-22 12:45:31] [INFO ] Invariants computation overflowed in 23 ms
[2024-05-22 12:45:31] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-22 12:45:43] [INFO ] Implicit Places using invariants and state equation in 11708 ms returned [320, 326, 347, 352, 373, 379, 401, 406, 425, 431]
[2024-05-22 12:45:43] [INFO ] Actually due to overlaps returned [326, 320]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 12003 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 15 : 431/475 places, 439/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 431 transition count 438
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 430 transition count 438
Applied a total of 2 rules in 18 ms. Remains 430 /431 variables (removed 1) and now considering 438/439 (removed 1) transitions.
// Phase 1: matrix 438 rows 430 cols
[2024-05-22 12:45:43] [INFO ] Invariants computation overflowed in 25 ms
[2024-05-22 12:45:43] [INFO ] Implicit Places using invariants in 304 ms returned []
// Phase 1: matrix 438 rows 430 cols
[2024-05-22 12:45:43] [INFO ] Invariants computation overflowed in 22 ms
[2024-05-22 12:45:43] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-22 12:45:51] [INFO ] Implicit Places using invariants and state equation in 7563 ms returned [344, 349, 370, 376, 398, 403, 422, 428]
[2024-05-22 12:45:51] [INFO ] Actually due to overlaps returned [349, 344]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 7869 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 16 : 428/475 places, 438/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 428 transition count 437
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 427 transition count 437
Applied a total of 2 rules in 18 ms. Remains 427 /428 variables (removed 1) and now considering 437/438 (removed 1) transitions.
// Phase 1: matrix 437 rows 427 cols
[2024-05-22 12:45:51] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-22 12:45:51] [INFO ] Implicit Places using invariants in 291 ms returned []
// Phase 1: matrix 437 rows 427 cols
[2024-05-22 12:45:51] [INFO ] Invariants computation overflowed in 24 ms
[2024-05-22 12:45:51] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-22 12:45:57] [INFO ] Implicit Places using invariants and state equation in 5665 ms returned [367, 373, 395, 400, 419, 425]
[2024-05-22 12:45:57] [INFO ] Actually due to overlaps returned [373, 367]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 5959 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 17 : 425/475 places, 437/453 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 425 transition count 437
Applied a total of 1 rules in 17 ms. Remains 425 /425 variables (removed 0) and now considering 437/437 (removed 0) transitions.
// Phase 1: matrix 437 rows 425 cols
[2024-05-22 12:45:57] [INFO ] Invariants computation overflowed in 27 ms
[2024-05-22 12:45:57] [INFO ] Implicit Places using invariants in 283 ms returned []
// Phase 1: matrix 437 rows 425 cols
[2024-05-22 12:45:57] [INFO ] Invariants computation overflowed in 24 ms
[2024-05-22 12:45:57] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-22 12:46:09] [INFO ] Implicit Places using invariants and state equation in 11949 ms returned [393, 398, 417, 423]
[2024-05-22 12:46:09] [INFO ] Actually due to overlaps returned [398, 393]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 12234 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 18 : 423/475 places, 437/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 423 transition count 436
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 422 transition count 436
Applied a total of 2 rules in 26 ms. Remains 422 /423 variables (removed 1) and now considering 436/437 (removed 1) transitions.
// Phase 1: matrix 436 rows 422 cols
[2024-05-22 12:46:09] [INFO ] Invariants computation overflowed in 32 ms
[2024-05-22 12:46:09] [INFO ] Implicit Places using invariants in 288 ms returned []
// Phase 1: matrix 436 rows 422 cols
[2024-05-22 12:46:09] [INFO ] Invariants computation overflowed in 25 ms
[2024-05-22 12:46:09] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-22 12:46:19] [INFO ] Implicit Places using invariants and state equation in 9372 ms returned [414, 420]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 9661 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 19 : 420/475 places, 436/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 420 transition count 435
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 419 transition count 435
Applied a total of 2 rules in 15 ms. Remains 419 /420 variables (removed 1) and now considering 435/436 (removed 1) transitions.
// Phase 1: matrix 435 rows 419 cols
[2024-05-22 12:46:19] [INFO ] Invariants computation overflowed in 32 ms
[2024-05-22 12:46:19] [INFO ] Implicit Places using invariants in 281 ms returned []
// Phase 1: matrix 435 rows 419 cols
[2024-05-22 12:46:19] [INFO ] Invariants computation overflowed in 25 ms
[2024-05-22 12:46:19] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-22 12:46:34] [INFO ] Implicit Places using invariants and state equation in 15562 ms returned []
Implicit Place search using SMT with State Equation took 15844 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 20 : 419/475 places, 435/453 transitions.
Finished structural reductions in REACHABILITY mode , in 20 iterations and 179319 ms. Remains : 419/475 places, 435/453 transitions.
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[true, (NOT p1)]
Stuttering acceptance computed with spot in 49 ms :[true, (NOT p1)]
Stuttering acceptance computed with spot in 43 ms :[true, (NOT p1)]
Product exploration explored 100000 steps with 13920 reset in 121 ms.
Product exploration explored 100000 steps with 13941 reset in 122 ms.
Support contains 2 out of 556 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 556/556 places, 533/533 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 0 with 2 rules applied. Total rules applied 2 place count 556 transition count 531
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 554 transition count 531
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 553 transition count 531
Applied a total of 6 rules in 25 ms. Remains 553 /556 variables (removed 3) and now considering 531/533 (removed 2) transitions.
// Phase 1: matrix 531 rows 553 cols
[2024-05-22 12:46:35] [INFO ] Computed 99 invariants in 48 ms
[2024-05-22 12:46:35] [INFO ] Implicit Places using invariants in 323 ms returned []
[2024-05-22 12:46:35] [INFO ] Invariant cache hit.
[2024-05-22 12:46:36] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-22 12:46:43] [INFO ] Implicit Places using invariants and state equation in 7922 ms returned []
Implicit Place search using SMT with State Equation took 8246 ms to find 0 implicit places.
[2024-05-22 12:46:43] [INFO ] Redundant transitions in 9 ms returned []
Running 530 sub problems to find dead transitions.
[2024-05-22 12:46:43] [INFO ] Invariant cache hit.
[2024-05-22 12:46:43] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/552 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/552 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/552 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 3 (OVERLAPS) 531/1083 variables, 552/651 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1083 variables, 38/689 constraints. Problems are: Problem set: 0 solved, 530 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1083/1084 variables, and 689 constraints, problems are : Problem set: 0 solved, 530 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 552/553 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 530/530 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 530 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/552 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/552 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/552 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 3 (OVERLAPS) 531/1083 variables, 552/651 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1083 variables, 38/689 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1083 variables, 527/1216 constraints. Problems are: Problem set: 0 solved, 530 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1083/1084 variables, and 1216 constraints, problems are : Problem set: 0 solved, 530 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 552/553 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 527/530 constraints, Known Traps: 0/0 constraints]
After SMT, in 60121ms problems are : Problem set: 0 solved, 530 unsolved
Search for dead transitions found 0 dead transitions in 60126ms
Starting structural reductions in SI_LTL mode, iteration 1 : 553/556 places, 531/533 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 68413 ms. Remains : 553/556 places, 531/533 transitions.
Treatment of property DoubleExponent-PT-020-LTLFireability-00 finished in 658492 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)&&F(G(p1))))'
Support contains 4 out of 1057 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1056 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 238 transitions
Trivial Post-agglo rules discarded 238 transitions
Performed 238 trivial Post agglomeration. Transition count delta: 238
Iterating post reduction 0 with 238 rules applied. Total rules applied 239 place count 1055 transition count 757
Reduce places removed 238 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 240 rules applied. Total rules applied 479 place count 817 transition count 755
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 481 place count 815 transition count 755
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 481 place count 815 transition count 714
Deduced a syphon composed of 41 places in 6 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 563 place count 774 transition count 714
Performed 181 Post agglomeration using F-continuation condition.Transition count delta: 181
Deduced a syphon composed of 181 places in 2 ms
Reduce places removed 181 places and 0 transitions.
Iterating global reduction 3 with 362 rules applied. Total rules applied 925 place count 593 transition count 533
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 37 places in 2 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 999 place count 556 transition count 533
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 1000 place count 556 transition count 533
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1001 place count 555 transition count 532
Applied a total of 1001 rules in 83 ms. Remains 555 /1057 variables (removed 502) and now considering 532/997 (removed 465) transitions.
// Phase 1: matrix 532 rows 555 cols
[2024-05-22 12:47:44] [INFO ] Computed 99 invariants in 53 ms
[2024-05-22 12:47:44] [INFO ] Implicit Places using invariants in 331 ms returned []
[2024-05-22 12:47:44] [INFO ] Invariant cache hit.
[2024-05-22 12:47:44] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-22 12:47:57] [INFO ] Implicit Places using invariants and state equation in 13094 ms returned []
Implicit Place search using SMT with State Equation took 13428 ms to find 0 implicit places.
[2024-05-22 12:47:57] [INFO ] Redundant transitions in 7 ms returned []
Running 531 sub problems to find dead transitions.
[2024-05-22 12:47:57] [INFO ] Invariant cache hit.
[2024-05-22 12:47:57] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/554 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/554 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/554 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 3 (OVERLAPS) 532/1086 variables, 554/653 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1086 variables, 37/690 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1086 variables, 0/690 constraints. Problems are: Problem set: 0 solved, 531 unsolved
SMT process timed out in 30100ms, After SMT, problems are : Problem set: 0 solved, 531 unsolved
Search for dead transitions found 0 dead transitions in 30106ms
Starting structural reductions in SI_LTL mode, iteration 1 : 555/1057 places, 532/997 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 43629 ms. Remains : 555/1057 places, 532/997 transitions.
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-01
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-020-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-020-LTLFireability-01 finished in 43757 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&(X((!p0||G(p1)))||F(p2))))'
Support contains 4 out of 1057 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Applied a total of 0 rules in 35 ms. Remains 1057 /1057 variables (removed 0) and now considering 997/997 (removed 0) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2024-05-22 12:48:27] [INFO ] Invariants computation overflowed in 107 ms
[2024-05-22 12:48:28] [INFO ] Implicit Places using invariants in 388 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2024-05-22 12:48:28] [INFO ] Invariants computation overflowed in 99 ms
[2024-05-22 12:48:42] [INFO ] Implicit Places using invariants and state equation in 14621 ms returned []
Implicit Place search using SMT with State Equation took 15010 ms to find 0 implicit places.
Running 996 sub problems to find dead transitions.
// Phase 1: matrix 997 rows 1057 cols
[2024-05-22 12:48:42] [INFO ] Invariants computation overflowed in 104 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1056 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 996 unsolved
At refinement iteration 1 (OVERLAPS) 997/2053 variables, 1056/1056 constraints. Problems are: Problem set: 0 solved, 996 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2053/2054 variables, and 1056 constraints, problems are : Problem set: 0 solved, 996 unsolved in 30036 ms.
Refiners :[State Equation: 1056/1057 constraints, PredecessorRefiner: 996/996 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 996 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1056 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 996 unsolved
At refinement iteration 1 (OVERLAPS) 997/2053 variables, 1056/1056 constraints. Problems are: Problem set: 0 solved, 996 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2053 variables, 996/2052 constraints. Problems are: Problem set: 0 solved, 996 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2053/2054 variables, and 2052 constraints, problems are : Problem set: 0 solved, 996 unsolved in 30036 ms.
Refiners :[State Equation: 1056/1057 constraints, PredecessorRefiner: 996/996 constraints, Known Traps: 0/0 constraints]
After SMT, in 60313ms problems are : Problem set: 0 solved, 996 unsolved
Search for dead transitions found 0 dead transitions in 60322ms
Finished structural reductions in LTL mode , in 1 iterations and 75370 ms. Remains : 1057/1057 places, 997/997 transitions.
Stuttering acceptance computed with spot in 226 ms :[true, (NOT p0), (NOT p2), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-03
Product exploration explored 100000 steps with 50000 reset in 327 ms.
Product exploration explored 100000 steps with 50000 reset in 366 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 1805 edges and 1057 vertex of which 1055 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X (NOT (AND (NOT p2) p0 p1))), (X p0), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 15 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DoubleExponent-PT-020-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-020-LTLFireability-03 finished in 76350 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 1057 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1056 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 0 with 240 rules applied. Total rules applied 241 place count 1055 transition count 755
Reduce places removed 240 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 241 rules applied. Total rules applied 482 place count 815 transition count 754
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 483 place count 814 transition count 754
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 483 place count 814 transition count 714
Deduced a syphon composed of 40 places in 6 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 563 place count 774 transition count 714
Performed 182 Post agglomeration using F-continuation condition.Transition count delta: 182
Deduced a syphon composed of 182 places in 2 ms
Reduce places removed 182 places and 0 transitions.
Iterating global reduction 3 with 364 rules applied. Total rules applied 927 place count 592 transition count 532
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 38 places in 2 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 1003 place count 554 transition count 532
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 1004 place count 554 transition count 532
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1005 place count 553 transition count 531
Applied a total of 1005 rules in 86 ms. Remains 553 /1057 variables (removed 504) and now considering 531/997 (removed 466) transitions.
// Phase 1: matrix 531 rows 553 cols
[2024-05-22 12:49:44] [INFO ] Computed 99 invariants in 47 ms
[2024-05-22 12:49:44] [INFO ] Implicit Places using invariants in 332 ms returned []
[2024-05-22 12:49:44] [INFO ] Invariant cache hit.
[2024-05-22 12:49:44] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-22 12:49:53] [INFO ] Implicit Places using invariants and state equation in 9471 ms returned []
Implicit Place search using SMT with State Equation took 9805 ms to find 0 implicit places.
[2024-05-22 12:49:53] [INFO ] Redundant transitions in 6 ms returned []
Running 530 sub problems to find dead transitions.
[2024-05-22 12:49:54] [INFO ] Invariant cache hit.
[2024-05-22 12:49:54] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/552 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/552 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/552 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 3 (OVERLAPS) 531/1083 variables, 552/651 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1083 variables, 38/689 constraints. Problems are: Problem set: 0 solved, 530 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1083/1084 variables, and 689 constraints, problems are : Problem set: 0 solved, 530 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 552/553 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 530/530 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 530 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/552 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/552 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/552 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 3 (OVERLAPS) 531/1083 variables, 552/651 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1083 variables, 38/689 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1083 variables, 527/1216 constraints. Problems are: Problem set: 0 solved, 530 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1083/1084 variables, and 1216 constraints, problems are : Problem set: 0 solved, 530 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 552/553 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 527/530 constraints, Known Traps: 0/0 constraints]
After SMT, in 60123ms problems are : Problem set: 0 solved, 530 unsolved
Search for dead transitions found 0 dead transitions in 60128ms
Starting structural reductions in SI_LTL mode, iteration 1 : 553/1057 places, 531/997 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 70033 ms. Remains : 553/1057 places, 531/997 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-04
Product exploration explored 100000 steps with 13802 reset in 124 ms.
Product exploration explored 100000 steps with 14008 reset in 119 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1745 edges and 553 vertex of which 552 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 147 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
RANDOM walk for 40000 steps (5564 resets) in 69 ms. (571 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3237 resets) in 81 ms. (487 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 424533 steps, run timeout after 3001 ms. (steps per millisecond=141 ) properties seen :0 out of 1
Probabilistic random walk after 424533 steps, saw 212336 distinct states, run finished after 3001 ms. (steps per millisecond=141 ) properties seen :0
[2024-05-22 12:50:57] [INFO ] Invariant cache hit.
[2024-05-22 12:50:57] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 204/208 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 216/424 variables, 65/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/424 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 58/482 variables, 8/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/482 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 14/496 variables, 6/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 521/1017 variables, 496/591 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1017 variables, 36/627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1017 variables, 0/627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 61/1078 variables, 52/679 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1078 variables, 2/681 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1078 variables, 1/682 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1078 variables, 0/682 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/1080 variables, 2/684 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1080 variables, 2/686 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1080 variables, 0/686 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 4/1084 variables, 3/689 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1084 variables, 1/690 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1084 variables, 0/690 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1084 variables, 0/690 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1084/1084 variables, and 690 constraints, problems are : Problem set: 0 solved, 1 unsolved in 688 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 553/553 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 204/208 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 216/424 variables, 65/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/424 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 58/482 variables, 8/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 12:50:58] [INFO ] Deduced a trap composed of 6 places in 107 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/482 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/482 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 14/496 variables, 6/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/496 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 521/1017 variables, 496/592 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1017 variables, 36/628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1017 variables, 0/628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1078/1084 variables, and 680 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1438 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, Generalized P Invariants (flows): 95/97 constraints, State Equation: 548/553 constraints, ReadFeed: 36/38 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 2136ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 553 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 553/553 places, 531/531 transitions.
Graph (complete) has 1665 edges and 553 vertex of which 552 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 552 transition count 530
Free-agglomeration rule (complex) applied 72 times.
Iterating global reduction 1 with 72 rules applied. Total rules applied 74 place count 552 transition count 458
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 146 place count 480 transition count 458
Partial Free-agglomeration rule applied 81 times.
Drop transitions (Partial Free agglomeration) removed 81 transitions
Iterating global reduction 2 with 81 rules applied. Total rules applied 227 place count 480 transition count 458
Applied a total of 227 rules in 34 ms. Remains 480 /553 variables (removed 73) and now considering 458/531 (removed 73) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 480/553 places, 458/531 transitions.
RANDOM walk for 40000 steps (5071 resets) in 80 ms. (493 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3376 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 425876 steps, run timeout after 3001 ms. (steps per millisecond=141 ) properties seen :0 out of 1
Probabilistic random walk after 425876 steps, saw 213068 distinct states, run finished after 3002 ms. (steps per millisecond=141 ) properties seen :0
// Phase 1: matrix 458 rows 480 cols
[2024-05-22 12:51:02] [INFO ] Invariants computation overflowed in 34 ms
[2024-05-22 12:51:02] [INFO ] State equation strengthened by 78 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 10/14 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 177/191 variables, 40/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 534/725 variables, 264/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/725 variables, 47/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/725 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 213/938 variables, 172/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/938 variables, 30/558 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/938 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/938 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 938/938 variables, and 558 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1829 ms.
Refiners :[State Equation: 480/480 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 10/14 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 177/191 variables, 40/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 534/725 variables, 264/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/725 variables, 47/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/725 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 213/938 variables, 172/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/938 variables, 30/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/938 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/938 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 938/938 variables, and 559 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1114 ms.
Refiners :[State Equation: 480/480 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2985ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 434 ms.
Support contains 4 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 458/458 transitions.
Applied a total of 0 rules in 8 ms. Remains 480 /480 variables (removed 0) and now considering 458/458 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 480/480 places, 458/458 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 458/458 transitions.
Applied a total of 0 rules in 7 ms. Remains 480 /480 variables (removed 0) and now considering 458/458 (removed 0) transitions.
// Phase 1: matrix 458 rows 480 cols
[2024-05-22 12:51:06] [INFO ] Invariants computation overflowed in 32 ms
[2024-05-22 12:51:06] [INFO ] Implicit Places using invariants in 280 ms returned []
// Phase 1: matrix 458 rows 480 cols
[2024-05-22 12:51:06] [INFO ] Invariants computation overflowed in 25 ms
[2024-05-22 12:51:06] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 12:51:22] [INFO ] Implicit Places using invariants and state equation in 15413 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 152, 175, 180, 201, 207, 214, 228, 233, 256, 262, 284, 289, 310, 338, 343, 365, 371, 392, 394, 398, 418, 424, 446, 451, 455, 472, 478]
[2024-05-22 12:51:22] [INFO ] Actually due to overlaps returned [343, 214, 180, 152, 175, 338]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 15694 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 474/480 places, 458/458 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 474 transition count 455
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 471 transition count 455
Applied a total of 6 rules in 15 ms. Remains 471 /474 variables (removed 3) and now considering 455/458 (removed 3) transitions.
// Phase 1: matrix 455 rows 471 cols
[2024-05-22 12:51:22] [INFO ] Computed 93 invariants in 80 ms
[2024-05-22 12:51:22] [INFO ] Implicit Places using invariants in 561 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 197, 203, 222, 227, 250, 256, 278, 283, 304, 356, 362, 383, 385, 389, 409, 415, 437, 442, 446, 463, 469]
[2024-05-22 12:51:22] [INFO ] Actually due to overlaps returned [362, 446, 203, 197, 356, 385]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 562 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 465/480 places, 455/458 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 465 transition count 452
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 462 transition count 452
Applied a total of 6 rules in 15 ms. Remains 462 /465 variables (removed 3) and now considering 452/455 (removed 3) transitions.
// Phase 1: matrix 452 rows 462 cols
[2024-05-22 12:51:22] [INFO ] Invariants computation overflowed in 32 ms
[2024-05-22 12:51:22] [INFO ] Implicit Places using invariants in 263 ms returned []
// Phase 1: matrix 452 rows 462 cols
[2024-05-22 12:51:22] [INFO ] Invariants computation overflowed in 33 ms
[2024-05-22 12:51:23] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 12:51:27] [INFO ] Implicit Places using invariants and state equation in 4856 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 219, 224, 247, 253, 275, 280, 301, 377, 382, 402, 408, 430, 435, 454, 460]
[2024-05-22 12:51:27] [INFO ] Actually due to overlaps returned [382, 48, 224, 42, 219, 377]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 5122 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 456/480 places, 452/458 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 456 transition count 449
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 453 transition count 449
Applied a total of 6 rules in 19 ms. Remains 453 /456 variables (removed 3) and now considering 449/452 (removed 3) transitions.
// Phase 1: matrix 449 rows 453 cols
[2024-05-22 12:51:27] [INFO ] Invariants computation overflowed in 43 ms
[2024-05-22 12:51:28] [INFO ] Implicit Places using invariants in 266 ms returned []
// Phase 1: matrix 449 rows 453 cols
[2024-05-22 12:51:28] [INFO ] Invariants computation overflowed in 39 ms
[2024-05-22 12:51:28] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 12:51:35] [INFO ] Implicit Places using invariants and state equation in 7023 ms returned [65, 70, 91, 96, 116, 122, 241, 247, 269, 274, 295, 393, 399, 421, 426, 445, 451]
[2024-05-22 12:51:35] [INFO ] Actually due to overlaps returned [399, 70, 247, 65, 241, 393]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 7290 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 447/480 places, 449/458 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 447 transition count 446
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 444 transition count 446
Applied a total of 6 rules in 14 ms. Remains 444 /447 variables (removed 3) and now considering 446/449 (removed 3) transitions.
// Phase 1: matrix 446 rows 444 cols
[2024-05-22 12:51:35] [INFO ] Invariants computation overflowed in 30 ms
[2024-05-22 12:51:35] [INFO ] Implicit Places using invariants in 265 ms returned []
// Phase 1: matrix 446 rows 444 cols
[2024-05-22 12:51:35] [INFO ] Invariants computation overflowed in 24 ms
[2024-05-22 12:51:35] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 12:51:40] [INFO ] Implicit Places using invariants and state equation in 4758 ms returned [88, 93, 113, 119, 263, 268, 289, 412, 417, 436, 442]
[2024-05-22 12:51:40] [INFO ] Actually due to overlaps returned [417, 93, 268, 88, 263, 412]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 5027 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 438/480 places, 446/458 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 438 transition count 443
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 435 transition count 443
Applied a total of 6 rules in 18 ms. Remains 435 /438 variables (removed 3) and now considering 443/446 (removed 3) transitions.
// Phase 1: matrix 443 rows 435 cols
[2024-05-22 12:51:40] [INFO ] Invariants computation overflowed in 35 ms
[2024-05-22 12:51:40] [INFO ] Implicit Places using invariants in 245 ms returned []
// Phase 1: matrix 443 rows 435 cols
[2024-05-22 12:51:40] [INFO ] Invariants computation overflowed in 27 ms
[2024-05-22 12:51:40] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 12:51:45] [INFO ] Implicit Places using invariants and state equation in 4779 ms returned [110, 116, 283, 427, 433]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 5027 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 430/480 places, 443/458 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 430 transition count 441
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 428 transition count 441
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 428 transition count 441
Applied a total of 5 rules in 23 ms. Remains 428 /430 variables (removed 2) and now considering 441/443 (removed 2) transitions.
// Phase 1: matrix 441 rows 428 cols
[2024-05-22 12:51:45] [INFO ] Computed 64 invariants in 42 ms
[2024-05-22 12:51:45] [INFO ] Implicit Places using invariants in 308 ms returned []
[2024-05-22 12:51:45] [INFO ] Invariant cache hit.
[2024-05-22 12:51:45] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 12:51:51] [INFO ] Implicit Places using invariants and state equation in 6261 ms returned []
Implicit Place search using SMT with State Equation took 6570 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 428/480 places, 441/458 transitions.
Finished structural reductions in REACHABILITY mode , in 7 iterations and 45407 ms. Remains : 428/480 places, 441/458 transitions.
RANDOM walk for 40000 steps (5671 resets) in 319 ms. (125 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (3663 resets) in 247 ms. (161 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 469562 steps, run timeout after 3001 ms. (steps per millisecond=156 ) properties seen :0 out of 1
Probabilistic random walk after 469562 steps, saw 234826 distinct states, run finished after 3001 ms. (steps per millisecond=156 ) properties seen :0
[2024-05-22 12:51:54] [INFO ] Invariant cache hit.
[2024-05-22 12:51:54] [INFO ] State equation strengthened by 78 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 70/74 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 269/343 variables, 34/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 12:51:55] [INFO ] Deduced a trap composed of 7 places in 114 ms of which 2 ms to minimize.
[2024-05-22 12:51:55] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 2 ms to minimize.
[2024-05-22 12:51:55] [INFO ] Deduced a trap composed of 10 places in 100 ms of which 2 ms to minimize.
[2024-05-22 12:51:55] [INFO ] Deduced a trap composed of 12 places in 102 ms of which 3 ms to minimize.
[2024-05-22 12:51:55] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 2 ms to minimize.
[2024-05-22 12:51:55] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 2 ms to minimize.
[2024-05-22 12:51:55] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 2 ms to minimize.
[2024-05-22 12:51:55] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 1 ms to minimize.
[2024-05-22 12:51:55] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 2 ms to minimize.
[2024-05-22 12:51:56] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 1 ms to minimize.
[2024-05-22 12:51:56] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 2 ms to minimize.
[2024-05-22 12:51:56] [INFO ] Deduced a trap composed of 42 places in 73 ms of which 1 ms to minimize.
[2024-05-22 12:51:56] [INFO ] Deduced a trap composed of 41 places in 80 ms of which 1 ms to minimize.
[2024-05-22 12:51:56] [INFO ] Deduced a trap composed of 40 places in 69 ms of which 1 ms to minimize.
[2024-05-22 12:51:56] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 1 ms to minimize.
[2024-05-22 12:51:56] [INFO ] Deduced a trap composed of 43 places in 65 ms of which 1 ms to minimize.
[2024-05-22 12:51:56] [INFO ] Deduced a trap composed of 43 places in 66 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/343 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 76/419 variables, 25/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 12:51:56] [INFO ] Deduced a trap composed of 4 places in 144 ms of which 2 ms to minimize.
[2024-05-22 12:51:56] [INFO ] Deduced a trap composed of 21 places in 128 ms of which 3 ms to minimize.
[2024-05-22 12:51:57] [INFO ] Deduced a trap composed of 14 places in 128 ms of which 3 ms to minimize.
[2024-05-22 12:51:57] [INFO ] Deduced a trap composed of 10 places in 135 ms of which 2 ms to minimize.
[2024-05-22 12:51:57] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 3 ms to minimize.
[2024-05-22 12:51:57] [INFO ] Deduced a trap composed of 16 places in 140 ms of which 3 ms to minimize.
[2024-05-22 12:51:57] [INFO ] Deduced a trap composed of 7 places in 137 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/419 variables, 7/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/419 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/423 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 12:51:57] [INFO ] Deduced a trap composed of 31 places in 135 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/423 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/423 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 441/864 variables, 423/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/864 variables, 78/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/864 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 5/869 variables, 5/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/869 variables, 2/595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/869 variables, 0/595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/869 variables, 0/595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 869/869 variables, and 595 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3595 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 61/61 constraints, State Equation: 428/428 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 70/74 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 269/343 variables, 34/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/343 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 12:51:58] [INFO ] Deduced a trap composed of 28 places in 99 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/343 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 76/419 variables, 25/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/419 variables, 7/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 12:51:58] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 2 ms to minimize.
[2024-05-22 12:51:59] [INFO ] Deduced a trap composed of 19 places in 129 ms of which 2 ms to minimize.
[2024-05-22 12:51:59] [INFO ] Deduced a trap composed of 16 places in 149 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/419 variables, 3/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/419 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/423 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/423 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/423 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 441/864 variables, 423/514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/864 variables, 78/592 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/864 variables, 1/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/864 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 5/869 variables, 5/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/869 variables, 2/600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/869 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/869 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 869/869 variables, and 600 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1399 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 61/61 constraints, State Equation: 428/428 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 29/29 constraints]
After SMT, in 5001ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 341 ms.
Support contains 4 out of 428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 428/428 places, 441/441 transitions.
Applied a total of 0 rules in 6 ms. Remains 428 /428 variables (removed 0) and now considering 441/441 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 428/428 places, 441/441 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 428/428 places, 441/441 transitions.
Applied a total of 0 rules in 6 ms. Remains 428 /428 variables (removed 0) and now considering 441/441 (removed 0) transitions.
[2024-05-22 12:52:00] [INFO ] Invariant cache hit.
[2024-05-22 12:52:00] [INFO ] Implicit Places using invariants in 277 ms returned []
[2024-05-22 12:52:00] [INFO ] Invariant cache hit.
[2024-05-22 12:52:00] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 12:52:06] [INFO ] Implicit Places using invariants and state equation in 6333 ms returned []
Implicit Place search using SMT with State Equation took 6613 ms to find 0 implicit places.
[2024-05-22 12:52:06] [INFO ] Redundant transitions in 3 ms returned []
Running 440 sub problems to find dead transitions.
[2024-05-22 12:52:06] [INFO ] Invariant cache hit.
[2024-05-22 12:52:06] [INFO ] State equation strengthened by 78 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/427 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/427 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/427 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 3 (OVERLAPS) 1/428 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/428 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 440 unsolved
[2024-05-22 12:52:16] [INFO ] Deduced a trap composed of 160 places in 124 ms of which 2 ms to minimize.
[2024-05-22 12:52:16] [INFO ] Deduced a trap composed of 165 places in 114 ms of which 2 ms to minimize.
[2024-05-22 12:52:16] [INFO ] Deduced a trap composed of 196 places in 106 ms of which 2 ms to minimize.
[2024-05-22 12:52:16] [INFO ] Deduced a trap composed of 196 places in 105 ms of which 2 ms to minimize.
[2024-05-22 12:52:17] [INFO ] Deduced a trap composed of 132 places in 109 ms of which 2 ms to minimize.
[2024-05-22 12:52:17] [INFO ] Deduced a trap composed of 120 places in 111 ms of which 2 ms to minimize.
[2024-05-22 12:52:17] [INFO ] Deduced a trap composed of 174 places in 106 ms of which 2 ms to minimize.
[2024-05-22 12:52:18] [INFO ] Deduced a trap composed of 148 places in 122 ms of which 2 ms to minimize.
[2024-05-22 12:52:18] [INFO ] Deduced a trap composed of 175 places in 109 ms of which 2 ms to minimize.
[2024-05-22 12:52:18] [INFO ] Deduced a trap composed of 167 places in 110 ms of which 2 ms to minimize.
[2024-05-22 12:52:19] [INFO ] Deduced a trap composed of 171 places in 101 ms of which 2 ms to minimize.
[2024-05-22 12:52:19] [INFO ] Deduced a trap composed of 149 places in 108 ms of which 2 ms to minimize.
[2024-05-22 12:52:19] [INFO ] Deduced a trap composed of 167 places in 109 ms of which 2 ms to minimize.
[2024-05-22 12:52:19] [INFO ] Deduced a trap composed of 192 places in 103 ms of which 2 ms to minimize.
[2024-05-22 12:52:19] [INFO ] Deduced a trap composed of 187 places in 117 ms of which 2 ms to minimize.
[2024-05-22 12:52:19] [INFO ] Deduced a trap composed of 168 places in 104 ms of which 2 ms to minimize.
[2024-05-22 12:52:22] [INFO ] Deduced a trap composed of 174 places in 104 ms of which 2 ms to minimize.
[2024-05-22 12:52:22] [INFO ] Deduced a trap composed of 193 places in 106 ms of which 2 ms to minimize.
[2024-05-22 12:52:22] [INFO ] Deduced a trap composed of 173 places in 101 ms of which 2 ms to minimize.
[2024-05-22 12:52:23] [INFO ] Deduced a trap composed of 187 places in 100 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/428 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 440 unsolved
[2024-05-22 12:52:23] [INFO ] Deduced a trap composed of 184 places in 116 ms of which 2 ms to minimize.
[2024-05-22 12:52:24] [INFO ] Deduced a trap composed of 165 places in 120 ms of which 2 ms to minimize.
[2024-05-22 12:52:25] [INFO ] Deduced a trap composed of 154 places in 113 ms of which 2 ms to minimize.
[2024-05-22 12:52:25] [INFO ] Deduced a trap composed of 160 places in 105 ms of which 2 ms to minimize.
[2024-05-22 12:52:25] [INFO ] Deduced a trap composed of 188 places in 100 ms of which 2 ms to minimize.
[2024-05-22 12:52:25] [INFO ] Deduced a trap composed of 171 places in 109 ms of which 2 ms to minimize.
[2024-05-22 12:52:25] [INFO ] Deduced a trap composed of 146 places in 112 ms of which 2 ms to minimize.
[2024-05-22 12:52:25] [INFO ] Deduced a trap composed of 154 places in 109 ms of which 2 ms to minimize.
[2024-05-22 12:52:25] [INFO ] Deduced a trap composed of 185 places in 102 ms of which 2 ms to minimize.
[2024-05-22 12:52:25] [INFO ] Deduced a trap composed of 176 places in 118 ms of which 2 ms to minimize.
[2024-05-22 12:52:25] [INFO ] Deduced a trap composed of 140 places in 113 ms of which 1 ms to minimize.
[2024-05-22 12:52:26] [INFO ] Deduced a trap composed of 144 places in 113 ms of which 2 ms to minimize.
[2024-05-22 12:52:26] [INFO ] Deduced a trap composed of 124 places in 113 ms of which 2 ms to minimize.
[2024-05-22 12:52:26] [INFO ] Deduced a trap composed of 173 places in 107 ms of which 2 ms to minimize.
[2024-05-22 12:52:26] [INFO ] Deduced a trap composed of 128 places in 110 ms of which 2 ms to minimize.
[2024-05-22 12:52:26] [INFO ] Deduced a trap composed of 177 places in 110 ms of which 2 ms to minimize.
[2024-05-22 12:52:26] [INFO ] Deduced a trap composed of 175 places in 115 ms of which 3 ms to minimize.
[2024-05-22 12:52:30] [INFO ] Deduced a trap composed of 157 places in 105 ms of which 2 ms to minimize.
[2024-05-22 12:52:30] [INFO ] Deduced a trap composed of 154 places in 108 ms of which 2 ms to minimize.
[2024-05-22 12:52:30] [INFO ] Deduced a trap composed of 152 places in 109 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/428 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 440 unsolved
[2024-05-22 12:52:34] [INFO ] Deduced a trap composed of 183 places in 113 ms of which 2 ms to minimize.
[2024-05-22 12:52:35] [INFO ] Deduced a trap composed of 182 places in 111 ms of which 2 ms to minimize.
[2024-05-22 12:52:35] [INFO ] Deduced a trap composed of 97 places in 111 ms of which 2 ms to minimize.
[2024-05-22 12:52:36] [INFO ] Deduced a trap composed of 143 places in 116 ms of which 2 ms to minimize.
[2024-05-22 12:52:36] [INFO ] Deduced a trap composed of 173 places in 113 ms of which 2 ms to minimize.
[2024-05-22 12:52:36] [INFO ] Deduced a trap composed of 182 places in 116 ms of which 2 ms to minimize.
[2024-05-22 12:52:36] [INFO ] Deduced a trap composed of 174 places in 115 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 428/869 variables, and 111 constraints, problems are : Problem set: 0 solved, 440 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 61/61 constraints, State Equation: 0/428 constraints, ReadFeed: 0/78 constraints, PredecessorRefiner: 440/440 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 440 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/427 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/427 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/427 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 3 (OVERLAPS) 1/428 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/428 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/428 variables, 47/111 constraints. Problems are: Problem set: 0 solved, 440 unsolved
[2024-05-22 12:52:41] [INFO ] Deduced a trap composed of 182 places in 110 ms of which 2 ms to minimize.
[2024-05-22 12:52:41] [INFO ] Deduced a trap composed of 183 places in 120 ms of which 2 ms to minimize.
[2024-05-22 12:52:41] [INFO ] Deduced a trap composed of 167 places in 107 ms of which 2 ms to minimize.
[2024-05-22 12:52:41] [INFO ] Deduced a trap composed of 188 places in 108 ms of which 2 ms to minimize.
[2024-05-22 12:52:41] [INFO ] Deduced a trap composed of 186 places in 99 ms of which 2 ms to minimize.
[2024-05-22 12:52:42] [INFO ] Deduced a trap composed of 173 places in 110 ms of which 2 ms to minimize.
[2024-05-22 12:52:43] [INFO ] Deduced a trap composed of 191 places in 113 ms of which 2 ms to minimize.
[2024-05-22 12:52:43] [INFO ] Deduced a trap composed of 177 places in 106 ms of which 2 ms to minimize.
[2024-05-22 12:52:43] [INFO ] Deduced a trap composed of 190 places in 112 ms of which 2 ms to minimize.
[2024-05-22 12:52:43] [INFO ] Deduced a trap composed of 173 places in 107 ms of which 2 ms to minimize.
[2024-05-22 12:52:44] [INFO ] Deduced a trap composed of 64 places in 114 ms of which 2 ms to minimize.
[2024-05-22 12:52:44] [INFO ] Deduced a trap composed of 160 places in 109 ms of which 2 ms to minimize.
[2024-05-22 12:52:44] [INFO ] Deduced a trap composed of 111 places in 114 ms of which 2 ms to minimize.
[2024-05-22 12:52:44] [INFO ] Deduced a trap composed of 153 places in 109 ms of which 2 ms to minimize.
[2024-05-22 12:52:44] [INFO ] Deduced a trap composed of 188 places in 122 ms of which 2 ms to minimize.
[2024-05-22 12:52:44] [INFO ] Deduced a trap composed of 192 places in 114 ms of which 2 ms to minimize.
[2024-05-22 12:52:48] [INFO ] Deduced a trap composed of 198 places in 119 ms of which 2 ms to minimize.
[2024-05-22 12:52:48] [INFO ] Deduced a trap composed of 190 places in 105 ms of which 2 ms to minimize.
[2024-05-22 12:52:48] [INFO ] Deduced a trap composed of 177 places in 109 ms of which 2 ms to minimize.
[2024-05-22 12:52:48] [INFO ] Deduced a trap composed of 179 places in 110 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/428 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 440 unsolved
[2024-05-22 12:52:49] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 1 ms to minimize.
[2024-05-22 12:52:49] [INFO ] Deduced a trap composed of 192 places in 105 ms of which 2 ms to minimize.
[2024-05-22 12:52:50] [INFO ] Deduced a trap composed of 194 places in 97 ms of which 2 ms to minimize.
[2024-05-22 12:52:50] [INFO ] Deduced a trap composed of 203 places in 105 ms of which 2 ms to minimize.
[2024-05-22 12:52:50] [INFO ] Deduced a trap composed of 177 places in 111 ms of which 2 ms to minimize.
[2024-05-22 12:52:50] [INFO ] Deduced a trap composed of 166 places in 109 ms of which 2 ms to minimize.
[2024-05-22 12:52:50] [INFO ] Deduced a trap composed of 150 places in 107 ms of which 2 ms to minimize.
[2024-05-22 12:52:50] [INFO ] Deduced a trap composed of 143 places in 112 ms of which 2 ms to minimize.
[2024-05-22 12:52:50] [INFO ] Deduced a trap composed of 166 places in 104 ms of which 2 ms to minimize.
[2024-05-22 12:52:50] [INFO ] Deduced a trap composed of 141 places in 116 ms of which 2 ms to minimize.
[2024-05-22 12:52:52] [INFO ] Deduced a trap composed of 167 places in 119 ms of which 2 ms to minimize.
[2024-05-22 12:52:52] [INFO ] Deduced a trap composed of 158 places in 124 ms of which 2 ms to minimize.
[2024-05-22 12:52:52] [INFO ] Deduced a trap composed of 171 places in 119 ms of which 2 ms to minimize.
[2024-05-22 12:52:52] [INFO ] Deduced a trap composed of 175 places in 116 ms of which 3 ms to minimize.
[2024-05-22 12:52:52] [INFO ] Deduced a trap composed of 176 places in 114 ms of which 2 ms to minimize.
[2024-05-22 12:52:52] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 2 ms to minimize.
[2024-05-22 12:52:53] [INFO ] Deduced a trap composed of 172 places in 110 ms of which 2 ms to minimize.
[2024-05-22 12:52:53] [INFO ] Deduced a trap composed of 180 places in 109 ms of which 2 ms to minimize.
[2024-05-22 12:52:53] [INFO ] Deduced a trap composed of 166 places in 114 ms of which 2 ms to minimize.
[2024-05-22 12:52:53] [INFO ] Deduced a trap composed of 3 places in 168 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/428 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 440 unsolved
[2024-05-22 12:52:54] [INFO ] Deduced a trap composed of 197 places in 107 ms of which 2 ms to minimize.
[2024-05-22 12:52:55] [INFO ] Deduced a trap composed of 169 places in 113 ms of which 2 ms to minimize.
[2024-05-22 12:52:55] [INFO ] Deduced a trap composed of 171 places in 123 ms of which 2 ms to minimize.
[2024-05-22 12:52:56] [INFO ] Deduced a trap composed of 145 places in 118 ms of which 2 ms to minimize.
[2024-05-22 12:52:56] [INFO ] Deduced a trap composed of 190 places in 136 ms of which 3 ms to minimize.
[2024-05-22 12:52:56] [INFO ] Deduced a trap composed of 194 places in 113 ms of which 2 ms to minimize.
[2024-05-22 12:52:56] [INFO ] Deduced a trap composed of 132 places in 106 ms of which 2 ms to minimize.
[2024-05-22 12:52:56] [INFO ] Deduced a trap composed of 184 places in 109 ms of which 2 ms to minimize.
[2024-05-22 12:52:57] [INFO ] Deduced a trap composed of 135 places in 112 ms of which 2 ms to minimize.
[2024-05-22 12:52:57] [INFO ] Deduced a trap composed of 186 places in 104 ms of which 2 ms to minimize.
[2024-05-22 12:52:57] [INFO ] Deduced a trap composed of 192 places in 107 ms of which 2 ms to minimize.
[2024-05-22 12:52:57] [INFO ] Deduced a trap composed of 134 places in 114 ms of which 2 ms to minimize.
[2024-05-22 12:52:57] [INFO ] Deduced a trap composed of 173 places in 118 ms of which 2 ms to minimize.
[2024-05-22 12:52:57] [INFO ] Deduced a trap composed of 189 places in 107 ms of which 2 ms to minimize.
[2024-05-22 12:52:57] [INFO ] Deduced a trap composed of 186 places in 110 ms of which 2 ms to minimize.
[2024-05-22 12:52:57] [INFO ] Deduced a trap composed of 122 places in 109 ms of which 2 ms to minimize.
[2024-05-22 12:52:58] [INFO ] Deduced a trap composed of 186 places in 106 ms of which 2 ms to minimize.
[2024-05-22 12:52:58] [INFO ] Deduced a trap composed of 193 places in 113 ms of which 2 ms to minimize.
[2024-05-22 12:53:02] [INFO ] Deduced a trap composed of 196 places in 101 ms of which 2 ms to minimize.
[2024-05-22 12:53:02] [INFO ] Deduced a trap composed of 196 places in 106 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/428 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 440 unsolved
[2024-05-22 12:53:03] [INFO ] Deduced a trap composed of 194 places in 115 ms of which 5 ms to minimize.
[2024-05-22 12:53:03] [INFO ] Deduced a trap composed of 193 places in 105 ms of which 2 ms to minimize.
[2024-05-22 12:53:04] [INFO ] Deduced a trap composed of 181 places in 122 ms of which 2 ms to minimize.
[2024-05-22 12:53:04] [INFO ] Deduced a trap composed of 181 places in 113 ms of which 2 ms to minimize.
[2024-05-22 12:53:04] [INFO ] Deduced a trap composed of 193 places in 112 ms of which 2 ms to minimize.
[2024-05-22 12:53:04] [INFO ] Deduced a trap composed of 192 places in 114 ms of which 2 ms to minimize.
[2024-05-22 12:53:04] [INFO ] Deduced a trap composed of 191 places in 103 ms of which 2 ms to minimize.
[2024-05-22 12:53:05] [INFO ] Deduced a trap composed of 180 places in 108 ms of which 2 ms to minimize.
[2024-05-22 12:53:05] [INFO ] Deduced a trap composed of 177 places in 108 ms of which 2 ms to minimize.
[2024-05-22 12:53:05] [INFO ] Deduced a trap composed of 178 places in 121 ms of which 2 ms to minimize.
[2024-05-22 12:53:06] [INFO ] Deduced a trap composed of 145 places in 113 ms of which 2 ms to minimize.
[2024-05-22 12:53:06] [INFO ] Deduced a trap composed of 147 places in 106 ms of which 2 ms to minimize.
[2024-05-22 12:53:06] [INFO ] Deduced a trap composed of 149 places in 105 ms of which 2 ms to minimize.
[2024-05-22 12:53:06] [INFO ] Deduced a trap composed of 192 places in 120 ms of which 2 ms to minimize.
[2024-05-22 12:53:06] [INFO ] Deduced a trap composed of 191 places in 113 ms of which 2 ms to minimize.
[2024-05-22 12:53:07] [INFO ] Deduced a trap composed of 175 places in 116 ms of which 2 ms to minimize.
SMT process timed out in 60180ms, After SMT, problems are : Problem set: 0 solved, 440 unsolved
Search for dead transitions found 0 dead transitions in 60185ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66813 ms. Remains : 428/428 places, 441/441 transitions.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Support contains 4 out of 553 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 553/553 places, 531/531 transitions.
Applied a total of 0 rules in 9 ms. Remains 553 /553 variables (removed 0) and now considering 531/531 (removed 0) transitions.
// Phase 1: matrix 531 rows 553 cols
[2024-05-22 12:53:07] [INFO ] Computed 99 invariants in 49 ms
[2024-05-22 12:53:07] [INFO ] Implicit Places using invariants in 315 ms returned []
[2024-05-22 12:53:07] [INFO ] Invariant cache hit.
[2024-05-22 12:53:07] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-22 12:53:16] [INFO ] Implicit Places using invariants and state equation in 9353 ms returned []
Implicit Place search using SMT with State Equation took 9669 ms to find 0 implicit places.
[2024-05-22 12:53:16] [INFO ] Redundant transitions in 3 ms returned []
Running 530 sub problems to find dead transitions.
[2024-05-22 12:53:16] [INFO ] Invariant cache hit.
[2024-05-22 12:53:16] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/552 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/552 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/552 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 3 (OVERLAPS) 531/1083 variables, 552/651 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1083 variables, 38/689 constraints. Problems are: Problem set: 0 solved, 530 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1083/1084 variables, and 689 constraints, problems are : Problem set: 0 solved, 530 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 552/553 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 530/530 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 530 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/552 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/552 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/552 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 3 (OVERLAPS) 531/1083 variables, 552/651 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1083 variables, 38/689 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1083 variables, 527/1216 constraints. Problems are: Problem set: 0 solved, 530 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1083/1084 variables, and 1216 constraints, problems are : Problem set: 0 solved, 530 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 552/553 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 527/530 constraints, Known Traps: 0/0 constraints]
After SMT, in 60130ms problems are : Problem set: 0 solved, 530 unsolved
Search for dead transitions found 0 dead transitions in 60136ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 69824 ms. Remains : 553/553 places, 531/531 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1745 edges and 553 vertex of which 552 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
RANDOM walk for 40000 steps (5558 resets) in 57 ms. (689 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3199 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 427453 steps, run timeout after 3001 ms. (steps per millisecond=142 ) properties seen :0 out of 1
Probabilistic random walk after 427453 steps, saw 213797 distinct states, run finished after 3001 ms. (steps per millisecond=142 ) properties seen :0
[2024-05-22 12:54:20] [INFO ] Invariant cache hit.
[2024-05-22 12:54:20] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 204/208 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 216/424 variables, 65/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/424 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 58/482 variables, 8/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/482 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 14/496 variables, 6/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 521/1017 variables, 496/591 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1017 variables, 36/627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1017 variables, 0/627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 61/1078 variables, 52/679 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1078 variables, 2/681 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1078 variables, 1/682 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1078 variables, 0/682 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/1080 variables, 2/684 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1080 variables, 2/686 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1080 variables, 0/686 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 4/1084 variables, 3/689 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1084 variables, 1/690 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1084 variables, 0/690 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1084 variables, 0/690 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1084/1084 variables, and 690 constraints, problems are : Problem set: 0 solved, 1 unsolved in 690 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 553/553 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 204/208 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 216/424 variables, 65/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/424 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 58/482 variables, 8/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 12:54:21] [INFO ] Deduced a trap composed of 6 places in 99 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/482 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/482 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 14/496 variables, 6/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/496 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 521/1017 variables, 496/592 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1017 variables, 36/628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1017 variables, 0/628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1078/1084 variables, and 680 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1443 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, Generalized P Invariants (flows): 95/97 constraints, State Equation: 548/553 constraints, ReadFeed: 36/38 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 2147ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 553 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 553/553 places, 531/531 transitions.
Graph (complete) has 1665 edges and 553 vertex of which 552 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 552 transition count 530
Free-agglomeration rule (complex) applied 72 times.
Iterating global reduction 1 with 72 rules applied. Total rules applied 74 place count 552 transition count 458
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 146 place count 480 transition count 458
Partial Free-agglomeration rule applied 81 times.
Drop transitions (Partial Free agglomeration) removed 81 transitions
Iterating global reduction 2 with 81 rules applied. Total rules applied 227 place count 480 transition count 458
Applied a total of 227 rules in 34 ms. Remains 480 /553 variables (removed 73) and now considering 458/531 (removed 73) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 480/553 places, 458/531 transitions.
RANDOM walk for 40000 steps (5052 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (3385 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 436794 steps, run timeout after 3001 ms. (steps per millisecond=145 ) properties seen :0 out of 1
Probabilistic random walk after 436794 steps, saw 218514 distinct states, run finished after 3001 ms. (steps per millisecond=145 ) properties seen :0
// Phase 1: matrix 458 rows 480 cols
[2024-05-22 12:54:25] [INFO ] Invariants computation overflowed in 35 ms
[2024-05-22 12:54:25] [INFO ] State equation strengthened by 78 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 10/14 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 177/191 variables, 40/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 534/725 variables, 264/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/725 variables, 47/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/725 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 213/938 variables, 172/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/938 variables, 30/558 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/938 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/938 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 938/938 variables, and 558 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1781 ms.
Refiners :[State Equation: 480/480 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 10/14 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 177/191 variables, 40/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 534/725 variables, 264/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/725 variables, 47/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/725 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 213/938 variables, 172/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/938 variables, 30/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/938 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/938 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 938/938 variables, and 559 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1097 ms.
Refiners :[State Equation: 480/480 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2931ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 406 ms.
Support contains 4 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 458/458 transitions.
Applied a total of 0 rules in 7 ms. Remains 480 /480 variables (removed 0) and now considering 458/458 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 480/480 places, 458/458 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 458/458 transitions.
Applied a total of 0 rules in 7 ms. Remains 480 /480 variables (removed 0) and now considering 458/458 (removed 0) transitions.
// Phase 1: matrix 458 rows 480 cols
[2024-05-22 12:54:28] [INFO ] Invariants computation overflowed in 32 ms
[2024-05-22 12:54:29] [INFO ] Implicit Places using invariants in 280 ms returned []
// Phase 1: matrix 458 rows 480 cols
[2024-05-22 12:54:29] [INFO ] Invariants computation overflowed in 25 ms
[2024-05-22 12:54:29] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 12:54:44] [INFO ] Implicit Places using invariants and state equation in 15349 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 152, 175, 180, 201, 207, 214, 228, 233, 256, 262, 284, 289, 310, 338, 343, 365, 371, 392, 394, 398, 418, 424, 446, 451, 455, 472, 478]
[2024-05-22 12:54:44] [INFO ] Actually due to overlaps returned [343, 214, 180, 152, 175, 338]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 15630 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 474/480 places, 458/458 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 474 transition count 455
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 471 transition count 455
Applied a total of 6 rules in 20 ms. Remains 471 /474 variables (removed 3) and now considering 455/458 (removed 3) transitions.
// Phase 1: matrix 455 rows 471 cols
[2024-05-22 12:54:44] [INFO ] Computed 93 invariants in 79 ms
[2024-05-22 12:54:45] [INFO ] Implicit Places using invariants in 548 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 197, 203, 222, 227, 250, 256, 278, 283, 304, 356, 362, 383, 385, 389, 409, 415, 437, 442, 446, 463, 469]
[2024-05-22 12:54:45] [INFO ] Actually due to overlaps returned [362, 446, 203, 197, 356, 385]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 549 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 465/480 places, 455/458 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 465 transition count 452
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 462 transition count 452
Applied a total of 6 rules in 14 ms. Remains 462 /465 variables (removed 3) and now considering 452/455 (removed 3) transitions.
// Phase 1: matrix 452 rows 462 cols
[2024-05-22 12:54:45] [INFO ] Invariants computation overflowed in 32 ms
[2024-05-22 12:54:45] [INFO ] Implicit Places using invariants in 252 ms returned []
// Phase 1: matrix 452 rows 462 cols
[2024-05-22 12:54:45] [INFO ] Invariants computation overflowed in 27 ms
[2024-05-22 12:54:45] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 12:54:49] [INFO ] Implicit Places using invariants and state equation in 4642 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 219, 224, 247, 253, 275, 280, 301, 377, 382, 402, 408, 430, 435, 454, 460]
[2024-05-22 12:54:49] [INFO ] Actually due to overlaps returned [382, 48, 224, 42, 219, 377]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 4896 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 456/480 places, 452/458 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 456 transition count 449
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 453 transition count 449
Applied a total of 6 rules in 19 ms. Remains 453 /456 variables (removed 3) and now considering 449/452 (removed 3) transitions.
// Phase 1: matrix 449 rows 453 cols
[2024-05-22 12:54:49] [INFO ] Invariants computation overflowed in 44 ms
[2024-05-22 12:54:50] [INFO ] Implicit Places using invariants in 259 ms returned []
// Phase 1: matrix 449 rows 453 cols
[2024-05-22 12:54:50] [INFO ] Invariants computation overflowed in 38 ms
[2024-05-22 12:54:50] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 12:54:57] [INFO ] Implicit Places using invariants and state equation in 6881 ms returned [65, 70, 91, 96, 116, 122, 241, 247, 269, 274, 295, 393, 399, 421, 426, 445, 451]
[2024-05-22 12:54:57] [INFO ] Actually due to overlaps returned [399, 70, 247, 65, 241, 393]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 7142 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 447/480 places, 449/458 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 447 transition count 446
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 444 transition count 446
Applied a total of 6 rules in 13 ms. Remains 444 /447 variables (removed 3) and now considering 446/449 (removed 3) transitions.
// Phase 1: matrix 446 rows 444 cols
[2024-05-22 12:54:57] [INFO ] Invariants computation overflowed in 24 ms
[2024-05-22 12:54:57] [INFO ] Implicit Places using invariants in 219 ms returned []
// Phase 1: matrix 446 rows 444 cols
[2024-05-22 12:54:57] [INFO ] Invariants computation overflowed in 23 ms
[2024-05-22 12:54:57] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 12:55:01] [INFO ] Implicit Places using invariants and state equation in 4575 ms returned [88, 93, 113, 119, 263, 268, 289, 412, 417, 436, 442]
[2024-05-22 12:55:01] [INFO ] Actually due to overlaps returned [417, 93, 268, 88, 263, 412]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 4797 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 438/480 places, 446/458 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 438 transition count 443
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 435 transition count 443
Applied a total of 6 rules in 17 ms. Remains 435 /438 variables (removed 3) and now considering 443/446 (removed 3) transitions.
// Phase 1: matrix 443 rows 435 cols
[2024-05-22 12:55:01] [INFO ] Invariants computation overflowed in 32 ms
[2024-05-22 12:55:02] [INFO ] Implicit Places using invariants in 240 ms returned []
// Phase 1: matrix 443 rows 435 cols
[2024-05-22 12:55:02] [INFO ] Invariants computation overflowed in 26 ms
[2024-05-22 12:55:02] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 12:55:06] [INFO ] Implicit Places using invariants and state equation in 4729 ms returned [110, 116, 283, 427, 433]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 4982 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 430/480 places, 443/458 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 430 transition count 441
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 428 transition count 441
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 428 transition count 441
Applied a total of 5 rules in 19 ms. Remains 428 /430 variables (removed 2) and now considering 441/443 (removed 2) transitions.
// Phase 1: matrix 441 rows 428 cols
[2024-05-22 12:55:06] [INFO ] Computed 64 invariants in 39 ms
[2024-05-22 12:55:07] [INFO ] Implicit Places using invariants in 311 ms returned []
[2024-05-22 12:55:07] [INFO ] Invariant cache hit.
[2024-05-22 12:55:07] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 12:55:13] [INFO ] Implicit Places using invariants and state equation in 6307 ms returned []
Implicit Place search using SMT with State Equation took 6618 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 428/480 places, 441/458 transitions.
Finished structural reductions in REACHABILITY mode , in 7 iterations and 44724 ms. Remains : 428/480 places, 441/458 transitions.
RANDOM walk for 40000 steps (5647 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (3643 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 462939 steps, run timeout after 3001 ms. (steps per millisecond=154 ) properties seen :0 out of 1
Probabilistic random walk after 462939 steps, saw 231517 distinct states, run finished after 3001 ms. (steps per millisecond=154 ) properties seen :0
[2024-05-22 12:55:16] [INFO ] Invariant cache hit.
[2024-05-22 12:55:16] [INFO ] State equation strengthened by 78 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 70/74 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 269/343 variables, 34/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 12:55:16] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 2 ms to minimize.
[2024-05-22 12:55:16] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 2 ms to minimize.
[2024-05-22 12:55:17] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 3 ms to minimize.
[2024-05-22 12:55:17] [INFO ] Deduced a trap composed of 12 places in 109 ms of which 2 ms to minimize.
[2024-05-22 12:55:17] [INFO ] Deduced a trap composed of 22 places in 98 ms of which 2 ms to minimize.
[2024-05-22 12:55:17] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 2 ms to minimize.
[2024-05-22 12:55:17] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 2 ms to minimize.
[2024-05-22 12:55:17] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 1 ms to minimize.
[2024-05-22 12:55:17] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 2 ms to minimize.
[2024-05-22 12:55:17] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 1 ms to minimize.
[2024-05-22 12:55:17] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 1 ms to minimize.
[2024-05-22 12:55:17] [INFO ] Deduced a trap composed of 42 places in 67 ms of which 1 ms to minimize.
[2024-05-22 12:55:17] [INFO ] Deduced a trap composed of 41 places in 68 ms of which 2 ms to minimize.
[2024-05-22 12:55:17] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 1 ms to minimize.
[2024-05-22 12:55:18] [INFO ] Deduced a trap composed of 39 places in 65 ms of which 1 ms to minimize.
[2024-05-22 12:55:18] [INFO ] Deduced a trap composed of 43 places in 65 ms of which 1 ms to minimize.
[2024-05-22 12:55:18] [INFO ] Deduced a trap composed of 43 places in 62 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/343 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 76/419 variables, 25/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 12:55:18] [INFO ] Deduced a trap composed of 4 places in 140 ms of which 2 ms to minimize.
[2024-05-22 12:55:18] [INFO ] Deduced a trap composed of 21 places in 136 ms of which 3 ms to minimize.
[2024-05-22 12:55:18] [INFO ] Deduced a trap composed of 14 places in 131 ms of which 2 ms to minimize.
[2024-05-22 12:55:18] [INFO ] Deduced a trap composed of 10 places in 127 ms of which 3 ms to minimize.
[2024-05-22 12:55:18] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 2 ms to minimize.
[2024-05-22 12:55:19] [INFO ] Deduced a trap composed of 16 places in 130 ms of which 3 ms to minimize.
[2024-05-22 12:55:19] [INFO ] Deduced a trap composed of 7 places in 124 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/419 variables, 7/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/419 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/423 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 12:55:19] [INFO ] Deduced a trap composed of 31 places in 128 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/423 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/423 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 441/864 variables, 423/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/864 variables, 78/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/864 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 5/869 variables, 5/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/869 variables, 2/595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/869 variables, 0/595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/869 variables, 0/595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 869/869 variables, and 595 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3497 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 61/61 constraints, State Equation: 428/428 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 70/74 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 269/343 variables, 34/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/343 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 12:55:20] [INFO ] Deduced a trap composed of 28 places in 96 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/343 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 76/419 variables, 25/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/419 variables, 7/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 12:55:20] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 3 ms to minimize.
[2024-05-22 12:55:20] [INFO ] Deduced a trap composed of 19 places in 129 ms of which 3 ms to minimize.
[2024-05-22 12:55:20] [INFO ] Deduced a trap composed of 16 places in 131 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/419 variables, 3/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/419 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/423 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/423 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/423 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 441/864 variables, 423/514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/864 variables, 78/592 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/864 variables, 1/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/864 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 5/869 variables, 5/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/869 variables, 2/600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/869 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/869 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 869/869 variables, and 600 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1369 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 61/61 constraints, State Equation: 428/428 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 29/29 constraints]
After SMT, in 4874ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 343 ms.
Support contains 4 out of 428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 428/428 places, 441/441 transitions.
Applied a total of 0 rules in 6 ms. Remains 428 /428 variables (removed 0) and now considering 441/441 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 428/428 places, 441/441 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 428/428 places, 441/441 transitions.
Applied a total of 0 rules in 6 ms. Remains 428 /428 variables (removed 0) and now considering 441/441 (removed 0) transitions.
[2024-05-22 12:55:21] [INFO ] Invariant cache hit.
[2024-05-22 12:55:22] [INFO ] Implicit Places using invariants in 266 ms returned []
[2024-05-22 12:55:22] [INFO ] Invariant cache hit.
[2024-05-22 12:55:22] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 12:55:28] [INFO ] Implicit Places using invariants and state equation in 6519 ms returned []
Implicit Place search using SMT with State Equation took 6786 ms to find 0 implicit places.
[2024-05-22 12:55:28] [INFO ] Redundant transitions in 3 ms returned []
Running 440 sub problems to find dead transitions.
[2024-05-22 12:55:28] [INFO ] Invariant cache hit.
[2024-05-22 12:55:28] [INFO ] State equation strengthened by 78 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/427 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/427 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/427 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 3 (OVERLAPS) 1/428 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/428 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 440 unsolved
[2024-05-22 12:55:37] [INFO ] Deduced a trap composed of 160 places in 113 ms of which 2 ms to minimize.
[2024-05-22 12:55:37] [INFO ] Deduced a trap composed of 165 places in 106 ms of which 2 ms to minimize.
[2024-05-22 12:55:38] [INFO ] Deduced a trap composed of 196 places in 99 ms of which 2 ms to minimize.
[2024-05-22 12:55:38] [INFO ] Deduced a trap composed of 196 places in 100 ms of which 2 ms to minimize.
[2024-05-22 12:55:38] [INFO ] Deduced a trap composed of 132 places in 115 ms of which 2 ms to minimize.
[2024-05-22 12:55:38] [INFO ] Deduced a trap composed of 120 places in 117 ms of which 2 ms to minimize.
[2024-05-22 12:55:39] [INFO ] Deduced a trap composed of 174 places in 114 ms of which 2 ms to minimize.
[2024-05-22 12:55:39] [INFO ] Deduced a trap composed of 148 places in 118 ms of which 2 ms to minimize.
[2024-05-22 12:55:40] [INFO ] Deduced a trap composed of 175 places in 105 ms of which 2 ms to minimize.
[2024-05-22 12:55:40] [INFO ] Deduced a trap composed of 167 places in 119 ms of which 2 ms to minimize.
[2024-05-22 12:55:40] [INFO ] Deduced a trap composed of 171 places in 114 ms of which 2 ms to minimize.
[2024-05-22 12:55:40] [INFO ] Deduced a trap composed of 149 places in 113 ms of which 2 ms to minimize.
[2024-05-22 12:55:40] [INFO ] Deduced a trap composed of 167 places in 121 ms of which 2 ms to minimize.
[2024-05-22 12:55:40] [INFO ] Deduced a trap composed of 192 places in 111 ms of which 2 ms to minimize.
[2024-05-22 12:55:41] [INFO ] Deduced a trap composed of 187 places in 119 ms of which 2 ms to minimize.
[2024-05-22 12:55:41] [INFO ] Deduced a trap composed of 168 places in 117 ms of which 2 ms to minimize.
[2024-05-22 12:55:44] [INFO ] Deduced a trap composed of 174 places in 112 ms of which 2 ms to minimize.
[2024-05-22 12:55:44] [INFO ] Deduced a trap composed of 193 places in 107 ms of which 1 ms to minimize.
[2024-05-22 12:55:44] [INFO ] Deduced a trap composed of 173 places in 104 ms of which 2 ms to minimize.
[2024-05-22 12:55:44] [INFO ] Deduced a trap composed of 187 places in 108 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/428 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 440 unsolved
[2024-05-22 12:55:45] [INFO ] Deduced a trap composed of 184 places in 116 ms of which 2 ms to minimize.
[2024-05-22 12:55:46] [INFO ] Deduced a trap composed of 165 places in 114 ms of which 2 ms to minimize.
[2024-05-22 12:55:46] [INFO ] Deduced a trap composed of 154 places in 112 ms of which 2 ms to minimize.
[2024-05-22 12:55:46] [INFO ] Deduced a trap composed of 160 places in 103 ms of which 2 ms to minimize.
[2024-05-22 12:55:46] [INFO ] Deduced a trap composed of 188 places in 98 ms of which 2 ms to minimize.
[2024-05-22 12:55:46] [INFO ] Deduced a trap composed of 171 places in 103 ms of which 2 ms to minimize.
[2024-05-22 12:55:46] [INFO ] Deduced a trap composed of 146 places in 107 ms of which 2 ms to minimize.
[2024-05-22 12:55:47] [INFO ] Deduced a trap composed of 154 places in 104 ms of which 2 ms to minimize.
[2024-05-22 12:55:47] [INFO ] Deduced a trap composed of 185 places in 107 ms of which 2 ms to minimize.
[2024-05-22 12:55:47] [INFO ] Deduced a trap composed of 176 places in 110 ms of which 2 ms to minimize.
[2024-05-22 12:55:47] [INFO ] Deduced a trap composed of 140 places in 107 ms of which 2 ms to minimize.
[2024-05-22 12:55:47] [INFO ] Deduced a trap composed of 144 places in 103 ms of which 2 ms to minimize.
[2024-05-22 12:55:47] [INFO ] Deduced a trap composed of 124 places in 115 ms of which 2 ms to minimize.
[2024-05-22 12:55:47] [INFO ] Deduced a trap composed of 173 places in 111 ms of which 2 ms to minimize.
[2024-05-22 12:55:48] [INFO ] Deduced a trap composed of 128 places in 103 ms of which 2 ms to minimize.
[2024-05-22 12:55:48] [INFO ] Deduced a trap composed of 177 places in 100 ms of which 2 ms to minimize.
[2024-05-22 12:55:48] [INFO ] Deduced a trap composed of 175 places in 112 ms of which 5 ms to minimize.
[2024-05-22 12:55:51] [INFO ] Deduced a trap composed of 157 places in 107 ms of which 2 ms to minimize.
[2024-05-22 12:55:51] [INFO ] Deduced a trap composed of 154 places in 99 ms of which 1 ms to minimize.
[2024-05-22 12:55:52] [INFO ] Deduced a trap composed of 152 places in 105 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/428 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 440 unsolved
[2024-05-22 12:55:56] [INFO ] Deduced a trap composed of 183 places in 112 ms of which 2 ms to minimize.
[2024-05-22 12:55:56] [INFO ] Deduced a trap composed of 182 places in 126 ms of which 1 ms to minimize.
[2024-05-22 12:55:57] [INFO ] Deduced a trap composed of 97 places in 110 ms of which 2 ms to minimize.
[2024-05-22 12:55:57] [INFO ] Deduced a trap composed of 143 places in 120 ms of which 2 ms to minimize.
[2024-05-22 12:55:57] [INFO ] Deduced a trap composed of 173 places in 113 ms of which 2 ms to minimize.
[2024-05-22 12:55:57] [INFO ] Deduced a trap composed of 182 places in 111 ms of which 3 ms to minimize.
[2024-05-22 12:55:58] [INFO ] Deduced a trap composed of 174 places in 107 ms of which 2 ms to minimize.
[2024-05-22 12:55:58] [INFO ] Deduced a trap composed of 183 places in 114 ms of which 2 ms to minimize.
[2024-05-22 12:55:58] [INFO ] Deduced a trap composed of 183 places in 112 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 428/869 variables, and 113 constraints, problems are : Problem set: 0 solved, 440 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 61/61 constraints, State Equation: 0/428 constraints, ReadFeed: 0/78 constraints, PredecessorRefiner: 440/440 constraints, Known Traps: 49/49 constraints]
Escalating to Integer solving :Problem set: 0 solved, 440 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/427 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/427 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/427 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 3 (OVERLAPS) 1/428 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/428 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/428 variables, 49/113 constraints. Problems are: Problem set: 0 solved, 440 unsolved
[2024-05-22 12:56:07] [INFO ] Deduced a trap composed of 194 places in 120 ms of which 2 ms to minimize.
[2024-05-22 12:56:08] [INFO ] Deduced a trap composed of 197 places in 110 ms of which 2 ms to minimize.
[2024-05-22 12:56:08] [INFO ] Deduced a trap composed of 147 places in 110 ms of which 2 ms to minimize.
[2024-05-22 12:56:08] [INFO ] Deduced a trap composed of 193 places in 105 ms of which 2 ms to minimize.
[2024-05-22 12:56:08] [INFO ] Deduced a trap composed of 174 places in 111 ms of which 2 ms to minimize.
[2024-05-22 12:56:08] [INFO ] Deduced a trap composed of 193 places in 112 ms of which 2 ms to minimize.
[2024-05-22 12:56:09] [INFO ] Deduced a trap composed of 167 places in 108 ms of which 2 ms to minimize.
[2024-05-22 12:56:09] [INFO ] Deduced a trap composed of 168 places in 112 ms of which 2 ms to minimize.
[2024-05-22 12:56:09] [INFO ] Deduced a trap composed of 173 places in 111 ms of which 2 ms to minimize.
[2024-05-22 12:56:09] [INFO ] Deduced a trap composed of 171 places in 104 ms of which 2 ms to minimize.
[2024-05-22 12:56:09] [INFO ] Deduced a trap composed of 139 places in 113 ms of which 2 ms to minimize.
[2024-05-22 12:56:09] [INFO ] Deduced a trap composed of 181 places in 123 ms of which 2 ms to minimize.
[2024-05-22 12:56:09] [INFO ] Deduced a trap composed of 181 places in 114 ms of which 2 ms to minimize.
[2024-05-22 12:56:10] [INFO ] Deduced a trap composed of 186 places in 117 ms of which 2 ms to minimize.
[2024-05-22 12:56:10] [INFO ] Deduced a trap composed of 187 places in 112 ms of which 2 ms to minimize.
[2024-05-22 12:56:10] [INFO ] Deduced a trap composed of 179 places in 106 ms of which 2 ms to minimize.
[2024-05-22 12:56:10] [INFO ] Deduced a trap composed of 180 places in 111 ms of which 2 ms to minimize.
[2024-05-22 12:56:10] [INFO ] Deduced a trap composed of 174 places in 114 ms of which 5 ms to minimize.
[2024-05-22 12:56:10] [INFO ] Deduced a trap composed of 173 places in 110 ms of which 2 ms to minimize.
[2024-05-22 12:56:10] [INFO ] Deduced a trap composed of 182 places in 118 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/428 variables, 20/133 constraints. Problems are: Problem set: 0 solved, 440 unsolved
[2024-05-22 12:56:12] [INFO ] Deduced a trap composed of 173 places in 123 ms of which 2 ms to minimize.
[2024-05-22 12:56:12] [INFO ] Deduced a trap composed of 3 places in 173 ms of which 3 ms to minimize.
[2024-05-22 12:56:12] [INFO ] Deduced a trap composed of 7 places in 184 ms of which 2 ms to minimize.
[2024-05-22 12:56:12] [INFO ] Deduced a trap composed of 4 places in 159 ms of which 2 ms to minimize.
[2024-05-22 12:56:13] [INFO ] Deduced a trap composed of 113 places in 158 ms of which 3 ms to minimize.
[2024-05-22 12:56:13] [INFO ] Deduced a trap composed of 119 places in 157 ms of which 3 ms to minimize.
[2024-05-22 12:56:13] [INFO ] Deduced a trap composed of 127 places in 162 ms of which 3 ms to minimize.
[2024-05-22 12:56:13] [INFO ] Deduced a trap composed of 124 places in 158 ms of which 3 ms to minimize.
[2024-05-22 12:56:13] [INFO ] Deduced a trap composed of 10 places in 151 ms of which 3 ms to minimize.
[2024-05-22 12:56:13] [INFO ] Deduced a trap composed of 10 places in 150 ms of which 3 ms to minimize.
[2024-05-22 12:56:14] [INFO ] Deduced a trap composed of 4 places in 159 ms of which 3 ms to minimize.
[2024-05-22 12:56:14] [INFO ] Deduced a trap composed of 117 places in 164 ms of which 2 ms to minimize.
[2024-05-22 12:56:14] [INFO ] Deduced a trap composed of 9 places in 160 ms of which 3 ms to minimize.
[2024-05-22 12:56:14] [INFO ] Deduced a trap composed of 12 places in 149 ms of which 3 ms to minimize.
[2024-05-22 12:56:14] [INFO ] Deduced a trap composed of 123 places in 161 ms of which 3 ms to minimize.
[2024-05-22 12:56:14] [INFO ] Deduced a trap composed of 13 places in 130 ms of which 2 ms to minimize.
[2024-05-22 12:56:15] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 3 ms to minimize.
[2024-05-22 12:56:15] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 2 ms to minimize.
[2024-05-22 12:56:15] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 2 ms to minimize.
[2024-05-22 12:56:15] [INFO ] Deduced a trap composed of 22 places in 114 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/428 variables, 20/153 constraints. Problems are: Problem set: 0 solved, 440 unsolved
[2024-05-22 12:56:16] [INFO ] Deduced a trap composed of 197 places in 110 ms of which 2 ms to minimize.
[2024-05-22 12:56:17] [INFO ] Deduced a trap composed of 190 places in 117 ms of which 2 ms to minimize.
[2024-05-22 12:56:18] [INFO ] Deduced a trap composed of 191 places in 114 ms of which 1 ms to minimize.
[2024-05-22 12:56:18] [INFO ] Deduced a trap composed of 195 places in 109 ms of which 2 ms to minimize.
[2024-05-22 12:56:18] [INFO ] Deduced a trap composed of 199 places in 108 ms of which 2 ms to minimize.
[2024-05-22 12:56:18] [INFO ] Deduced a trap composed of 148 places in 113 ms of which 2 ms to minimize.
[2024-05-22 12:56:18] [INFO ] Deduced a trap composed of 201 places in 98 ms of which 2 ms to minimize.
[2024-05-22 12:56:18] [INFO ] Deduced a trap composed of 199 places in 103 ms of which 2 ms to minimize.
[2024-05-22 12:56:18] [INFO ] Deduced a trap composed of 146 places in 100 ms of which 2 ms to minimize.
[2024-05-22 12:56:18] [INFO ] Deduced a trap composed of 137 places in 109 ms of which 2 ms to minimize.
[2024-05-22 12:56:19] [INFO ] Deduced a trap composed of 167 places in 115 ms of which 2 ms to minimize.
[2024-05-22 12:56:19] [INFO ] Deduced a trap composed of 138 places in 109 ms of which 2 ms to minimize.
[2024-05-22 12:56:19] [INFO ] Deduced a trap composed of 189 places in 110 ms of which 1 ms to minimize.
[2024-05-22 12:56:19] [INFO ] Deduced a trap composed of 193 places in 102 ms of which 2 ms to minimize.
[2024-05-22 12:56:19] [INFO ] Deduced a trap composed of 190 places in 110 ms of which 2 ms to minimize.
[2024-05-22 12:56:19] [INFO ] Deduced a trap composed of 112 places in 121 ms of which 2 ms to minimize.
[2024-05-22 12:56:20] [INFO ] Deduced a trap composed of 193 places in 115 ms of which 2 ms to minimize.
[2024-05-22 12:56:23] [INFO ] Deduced a trap composed of 181 places in 105 ms of which 2 ms to minimize.
[2024-05-22 12:56:24] [INFO ] Deduced a trap composed of 210 places in 102 ms of which 2 ms to minimize.
[2024-05-22 12:56:24] [INFO ] Deduced a trap composed of 210 places in 106 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/428 variables, 20/173 constraints. Problems are: Problem set: 0 solved, 440 unsolved
[2024-05-22 12:56:25] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 1 ms to minimize.
[2024-05-22 12:56:25] [INFO ] Deduced a trap composed of 37 places in 67 ms of which 2 ms to minimize.
[2024-05-22 12:56:25] [INFO ] Deduced a trap composed of 198 places in 121 ms of which 2 ms to minimize.
[2024-05-22 12:56:26] [INFO ] Deduced a trap composed of 195 places in 102 ms of which 2 ms to minimize.
[2024-05-22 12:56:27] [INFO ] Deduced a trap composed of 155 places in 112 ms of which 2 ms to minimize.
[2024-05-22 12:56:27] [INFO ] Deduced a trap composed of 183 places in 107 ms of which 2 ms to minimize.
[2024-05-22 12:56:27] [INFO ] Deduced a trap composed of 156 places in 114 ms of which 2 ms to minimize.
[2024-05-22 12:56:28] [INFO ] Deduced a trap composed of 183 places in 109 ms of which 3 ms to minimize.
[2024-05-22 12:56:28] [INFO ] Deduced a trap composed of 149 places in 118 ms of which 2 ms to minimize.
[2024-05-22 12:56:28] [INFO ] Deduced a trap composed of 148 places in 110 ms of which 2 ms to minimize.
[2024-05-22 12:56:28] [INFO ] Deduced a trap composed of 157 places in 100 ms of which 2 ms to minimize.
[2024-05-22 12:56:28] [INFO ] Deduced a trap composed of 189 places in 104 ms of which 2 ms to minimize.
[2024-05-22 12:56:28] [INFO ] Deduced a trap composed of 156 places in 106 ms of which 2 ms to minimize.
[2024-05-22 12:56:28] [INFO ] Deduced a trap composed of 185 places in 121 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 428/869 variables, and 187 constraints, problems are : Problem set: 0 solved, 440 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 61/61 constraints, State Equation: 0/428 constraints, ReadFeed: 0/78 constraints, PredecessorRefiner: 0/440 constraints, Known Traps: 123/123 constraints]
After SMT, in 60166ms problems are : Problem set: 0 solved, 440 unsolved
Search for dead transitions found 0 dead transitions in 60172ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66975 ms. Remains : 428/428 places, 441/441 transitions.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 13826 reset in 116 ms.
Product exploration explored 100000 steps with 13846 reset in 120 ms.
Support contains 4 out of 553 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 553/553 places, 531/531 transitions.
Applied a total of 0 rules in 18 ms. Remains 553 /553 variables (removed 0) and now considering 531/531 (removed 0) transitions.
// Phase 1: matrix 531 rows 553 cols
[2024-05-22 12:56:29] [INFO ] Computed 99 invariants in 55 ms
[2024-05-22 12:56:29] [INFO ] Implicit Places using invariants in 321 ms returned []
[2024-05-22 12:56:29] [INFO ] Invariant cache hit.
[2024-05-22 12:56:29] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-22 12:56:39] [INFO ] Implicit Places using invariants and state equation in 9529 ms returned []
Implicit Place search using SMT with State Equation took 9851 ms to find 0 implicit places.
[2024-05-22 12:56:39] [INFO ] Redundant transitions in 4 ms returned []
Running 530 sub problems to find dead transitions.
[2024-05-22 12:56:39] [INFO ] Invariant cache hit.
[2024-05-22 12:56:39] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/552 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/552 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/552 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 3 (OVERLAPS) 531/1083 variables, 552/651 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1083 variables, 38/689 constraints. Problems are: Problem set: 0 solved, 530 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1083/1084 variables, and 689 constraints, problems are : Problem set: 0 solved, 530 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 552/553 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 530/530 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 530 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/552 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/552 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/552 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 3 (OVERLAPS) 531/1083 variables, 552/651 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1083 variables, 38/689 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1083 variables, 527/1216 constraints. Problems are: Problem set: 0 solved, 530 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1083/1084 variables, and 1216 constraints, problems are : Problem set: 0 solved, 530 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 552/553 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 527/530 constraints, Known Traps: 0/0 constraints]
After SMT, in 60120ms problems are : Problem set: 0 solved, 530 unsolved
Search for dead transitions found 0 dead transitions in 60126ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 70006 ms. Remains : 553/553 places, 531/531 transitions.
Treatment of property DoubleExponent-PT-020-LTLFireability-04 finished in 475180 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(X(G(p1)))))'
Support contains 5 out of 1057 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Applied a total of 0 rules in 31 ms. Remains 1057 /1057 variables (removed 0) and now considering 997/997 (removed 0) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2024-05-22 12:57:39] [INFO ] Invariants computation overflowed in 101 ms
[2024-05-22 12:57:39] [INFO ] Implicit Places using invariants in 367 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2024-05-22 12:57:39] [INFO ] Invariants computation overflowed in 108 ms
[2024-05-22 12:57:53] [INFO ] Implicit Places using invariants and state equation in 14137 ms returned []
Implicit Place search using SMT with State Equation took 14505 ms to find 0 implicit places.
Running 996 sub problems to find dead transitions.
// Phase 1: matrix 997 rows 1057 cols
[2024-05-22 12:57:53] [INFO ] Invariants computation overflowed in 102 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1056 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 996 unsolved
At refinement iteration 1 (OVERLAPS) 997/2053 variables, 1056/1056 constraints. Problems are: Problem set: 0 solved, 996 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2053/2054 variables, and 1056 constraints, problems are : Problem set: 0 solved, 996 unsolved in 30033 ms.
Refiners :[State Equation: 1056/1057 constraints, PredecessorRefiner: 996/996 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 996 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1056 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 996 unsolved
At refinement iteration 1 (OVERLAPS) 997/2053 variables, 1056/1056 constraints. Problems are: Problem set: 0 solved, 996 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2053 variables, 996/2052 constraints. Problems are: Problem set: 0 solved, 996 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2053/2054 variables, and 2052 constraints, problems are : Problem set: 0 solved, 996 unsolved in 30036 ms.
Refiners :[State Equation: 1056/1057 constraints, PredecessorRefiner: 996/996 constraints, Known Traps: 0/0 constraints]
After SMT, in 60321ms problems are : Problem set: 0 solved, 996 unsolved
Search for dead transitions found 0 dead transitions in 60330ms
Finished structural reductions in LTL mode , in 1 iterations and 74868 ms. Remains : 1057/1057 places, 997/997 transitions.
Stuttering acceptance computed with spot in 262 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-05
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-020-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-020-LTLFireability-05 finished in 75165 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(p1||F(p2))))))'
Support contains 4 out of 1057 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1056 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 234 transitions
Trivial Post-agglo rules discarded 234 transitions
Performed 234 trivial Post agglomeration. Transition count delta: 234
Iterating post reduction 0 with 234 rules applied. Total rules applied 235 place count 1055 transition count 761
Reduce places removed 234 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 236 rules applied. Total rules applied 471 place count 821 transition count 759
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 473 place count 819 transition count 759
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 473 place count 819 transition count 719
Deduced a syphon composed of 40 places in 7 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 553 place count 779 transition count 719
Performed 183 Post agglomeration using F-continuation condition.Transition count delta: 183
Deduced a syphon composed of 183 places in 2 ms
Reduce places removed 183 places and 0 transitions.
Iterating global reduction 3 with 366 rules applied. Total rules applied 919 place count 596 transition count 536
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 37 places in 2 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 993 place count 559 transition count 536
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 994 place count 558 transition count 535
Applied a total of 994 rules in 73 ms. Remains 558 /1057 variables (removed 499) and now considering 535/997 (removed 462) transitions.
// Phase 1: matrix 535 rows 558 cols
[2024-05-22 12:58:54] [INFO ] Invariants computation overflowed in 43 ms
[2024-05-22 12:58:54] [INFO ] Implicit Places using invariants in 298 ms returned []
// Phase 1: matrix 535 rows 558 cols
[2024-05-22 12:58:54] [INFO ] Invariants computation overflowed in 34 ms
[2024-05-22 12:58:55] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-22 12:59:02] [INFO ] Implicit Places using invariants and state equation in 7496 ms returned []
Implicit Place search using SMT with State Equation took 7796 ms to find 0 implicit places.
[2024-05-22 12:59:02] [INFO ] Redundant transitions in 7 ms returned []
Running 534 sub problems to find dead transitions.
// Phase 1: matrix 535 rows 558 cols
[2024-05-22 12:59:02] [INFO ] Invariants computation overflowed in 39 ms
[2024-05-22 12:59:02] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/557 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 1 (OVERLAPS) 535/1092 variables, 557/557 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1092 variables, 37/594 constraints. Problems are: Problem set: 0 solved, 534 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/1092 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 534 unsolved
SMT process timed out in 30157ms, After SMT, problems are : Problem set: 0 solved, 534 unsolved
Search for dead transitions found 0 dead transitions in 30164ms
Starting structural reductions in SI_LTL mode, iteration 1 : 558/1057 places, 535/997 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 38052 ms. Remains : 558/1057 places, 535/997 transitions.
Stuttering acceptance computed with spot in 68 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-07
Product exploration explored 100000 steps with 13879 reset in 220 ms.
Product exploration explored 100000 steps with 13912 reset in 143 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1742 edges and 558 vertex of which 557 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p2), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X p0), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X p0)), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 125 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
RANDOM walk for 40000 steps (5487 resets) in 69 ms. (571 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40001 steps (3184 resets) in 112 ms. (353 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (3268 resets) in 72 ms. (547 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (3212 resets) in 185 ms. (215 steps per ms) remains 3/3 properties
// Phase 1: matrix 535 rows 558 cols
[2024-05-22 12:59:33] [INFO ] Invariants computation overflowed in 39 ms
[2024-05-22 12:59:33] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 16/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 74/94 variables, 29/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 134/228 variables, 63/96 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 4/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 139/367 variables, 75/175 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/367 variables, 4/179 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/367 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 128/495 variables, 65/244 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/495 variables, 5/249 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/495 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 119/614 variables, 66/315 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/614 variables, 5/320 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/614 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 64/678 variables, 37/357 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/678 variables, 2/359 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/678 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 55/733 variables, 28/387 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/733 variables, 2/389 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/733 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 55/788 variables, 28/417 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/788 variables, 2/419 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/788 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (OVERLAPS) 55/843 variables, 28/447 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/843 variables, 2/449 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/843 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 55/898 variables, 28/477 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/898 variables, 2/479 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/898 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (OVERLAPS) 55/953 variables, 28/507 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/953 variables, 2/509 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/953 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (OVERLAPS) 55/1008 variables, 28/537 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1008 variables, 2/539 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1008 variables, 0/539 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (OVERLAPS) 53/1061 variables, 28/567 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1061 variables, 2/569 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1061 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (OVERLAPS) 30/1091 variables, 21/590 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1091 variables, 3/593 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1091 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf2 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1093/1093 variables, and 595 constraints, problems are : Problem set: 1 solved, 2 unsolved in 3453 ms.
Refiners :[State Equation: 558/558 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 12/15 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 59/74 variables, 23/26 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 2/28 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/28 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 98/172 variables, 49/77 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/172 variables, 4/81 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/172 variables, 0/81 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 92/264 variables, 47/128 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/264 variables, 3/131 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/264 variables, 0/131 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 95/359 variables, 48/179 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/359 variables, 4/183 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/359 variables, 0/183 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 106/465 variables, 53/236 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/465 variables, 4/240 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/465 variables, 0/240 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 109/574 variables, 55/295 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/574 variables, 4/299 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/574 variables, 0/299 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 107/681 variables, 56/355 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/681 variables, 3/358 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/681 variables, 0/358 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 91/772 variables, 49/407 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/772 variables, 2/409 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-22 12:59:37] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 2 ms to minimize.
[2024-05-22 12:59:37] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 2 ms to minimize.
[2024-05-22 12:59:37] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 2 ms to minimize.
[2024-05-22 12:59:37] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 2 ms to minimize.
[2024-05-22 12:59:37] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 2 ms to minimize.
[2024-05-22 12:59:37] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 2 ms to minimize.
[2024-05-22 12:59:37] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 2 ms to minimize.
[2024-05-22 12:59:38] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 1 ms to minimize.
[2024-05-22 12:59:38] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 2 ms to minimize.
[2024-05-22 12:59:38] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 2 ms to minimize.
[2024-05-22 12:59:38] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 2 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/772 variables, 11/420 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/772 variables, 0/420 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 70/842 variables, 39/459 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/842 variables, 2/461 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/842 variables, 0/461 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 56/898 variables, 29/490 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/898 variables, 2/492 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/898 variables, 0/492 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 34 (OVERLAPS) 55/953 variables, 28/520 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/953 variables, 2/522 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/953 variables, 0/522 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 37 (OVERLAPS) 55/1008 variables, 28/550 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1008 variables, 2/552 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1008 variables, 0/552 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 40 (OVERLAPS) 53/1061 variables, 28/580 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1061 variables, 2/582 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1061 variables, 0/582 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 43 (OVERLAPS) 30/1091 variables, 21/603 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1091 variables, 3/606 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1091 variables, 0/606 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 46 (OVERLAPS) 2/1093 variables, 2/608 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1093 variables, 0/608 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 48 (OVERLAPS) 0/1093 variables, 0/608 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1093/1093 variables, and 608 constraints, problems are : Problem set: 1 solved, 2 unsolved in 2348 ms.
Refiners :[State Equation: 558/558 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 11/11 constraints]
After SMT, in 5850ms problems are : Problem set: 1 solved, 2 unsolved
Parikh walk visited 0 properties in 4312 ms.
Support contains 3 out of 558 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 558/558 places, 535/535 transitions.
Graph (complete) has 1664 edges and 558 vertex of which 557 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
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 0 with 3 rules applied. Total rules applied 4 place count 557 transition count 532
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 555 transition count 532
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 554 transition count 532
Free-agglomeration rule (complex) applied 77 times.
Iterating global reduction 2 with 77 rules applied. Total rules applied 85 place count 554 transition count 455
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 2 with 77 rules applied. Total rules applied 162 place count 477 transition count 455
Partial Free-agglomeration rule applied 81 times.
Drop transitions (Partial Free agglomeration) removed 81 transitions
Iterating global reduction 3 with 81 rules applied. Total rules applied 243 place count 477 transition count 455
Applied a total of 243 rules in 51 ms. Remains 477 /558 variables (removed 81) and now considering 455/535 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 477/558 places, 455/535 transitions.
RANDOM walk for 40000 steps (5046 resets) in 533 ms. (74 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3346 resets) in 292 ms. (136 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3386 resets) in 335 ms. (119 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 278619 steps, run timeout after 3001 ms. (steps per millisecond=92 ) properties seen :0 out of 2
Probabilistic random walk after 278619 steps, saw 139397 distinct states, run finished after 3003 ms. (steps per millisecond=92 ) properties seen :0
// Phase 1: matrix 455 rows 477 cols
[2024-05-22 12:59:47] [INFO ] Invariants computation overflowed in 36 ms
[2024-05-22 12:59:47] [INFO ] State equation strengthened by 77 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 15/18 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 174/192 variables, 37/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 501/693 variables, 248/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/693 variables, 43/336 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/693 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 239/932 variables, 189/525 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/932 variables, 29/554 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/932 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/932 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 932/932 variables, and 554 constraints, problems are : Problem set: 0 solved, 2 unsolved in 794 ms.
Refiners :[State Equation: 477/477 constraints, ReadFeed: 77/77 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 15/18 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 174/192 variables, 37/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 501/693 variables, 248/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/693 variables, 43/338 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/693 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 239/932 variables, 189/527 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/932 variables, 29/556 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 12:59:48] [INFO ] Deduced a trap composed of 12 places in 182 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/932 variables, 1/557 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/932 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/932 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 932/932 variables, and 557 constraints, problems are : Problem set: 0 solved, 2 unsolved in 882 ms.
Refiners :[State Equation: 477/477 constraints, ReadFeed: 77/77 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 1725ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 11326 ms.
Support contains 3 out of 477 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 477/477 places, 455/455 transitions.
Applied a total of 0 rules in 11 ms. Remains 477 /477 variables (removed 0) and now considering 455/455 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 477/477 places, 455/455 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 477/477 places, 455/455 transitions.
Applied a total of 0 rules in 10 ms. Remains 477 /477 variables (removed 0) and now considering 455/455 (removed 0) transitions.
// Phase 1: matrix 455 rows 477 cols
[2024-05-22 13:00:00] [INFO ] Invariants computation overflowed in 35 ms
[2024-05-22 13:00:00] [INFO ] Implicit Places using invariants in 502 ms returned []
// Phase 1: matrix 455 rows 477 cols
[2024-05-22 13:00:00] [INFO ] Invariants computation overflowed in 32 ms
[2024-05-22 13:00:00] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-22 13:00:11] [INFO ] Implicit Places using invariants and state equation in 10614 ms returned [42, 48, 68, 73, 94, 99, 121, 127, 150, 155, 156, 176, 181, 202, 208, 215, 229, 234, 257, 263, 285, 290, 310, 315, 336, 341, 362, 368, 389, 391, 395, 415, 421, 443, 448, 452, 469, 475]
[2024-05-22 13:00:11] [INFO ] Actually due to overlaps returned [215, 155]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 11119 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 475/477 places, 455/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 475 transition count 454
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 474 transition count 454
Applied a total of 2 rules in 25 ms. Remains 474 /475 variables (removed 1) and now considering 454/455 (removed 1) transitions.
// Phase 1: matrix 454 rows 474 cols
[2024-05-22 13:00:11] [INFO ] Invariants computation overflowed in 37 ms
[2024-05-22 13:00:11] [INFO ] Implicit Places using invariants in 484 ms returned []
// Phase 1: matrix 454 rows 474 cols
[2024-05-22 13:00:11] [INFO ] Invariants computation overflowed in 35 ms
[2024-05-22 13:00:11] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-22 13:00:21] [INFO ] Implicit Places using invariants and state equation in 10003 ms returned [42, 48, 68, 73, 94, 99, 121, 127, 150, 155, 175, 180, 201, 207, 226, 231, 254, 260, 282, 287, 307, 312, 333, 338, 359, 365, 386, 388, 392, 412, 418, 440, 445, 449, 466, 472]
[2024-05-22 13:00:21] [INFO ] Actually due to overlaps returned [449, 388]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 10494 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 472/477 places, 454/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 472 transition count 453
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 471 transition count 453
Applied a total of 2 rules in 19 ms. Remains 471 /472 variables (removed 1) and now considering 453/454 (removed 1) transitions.
// Phase 1: matrix 453 rows 471 cols
[2024-05-22 13:00:21] [INFO ] Invariants computation overflowed in 40 ms
[2024-05-22 13:00:22] [INFO ] Implicit Places using invariants in 451 ms returned []
// Phase 1: matrix 453 rows 471 cols
[2024-05-22 13:00:22] [INFO ] Invariants computation overflowed in 37 ms
[2024-05-22 13:00:22] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-22 13:00:32] [INFO ] Implicit Places using invariants and state equation in 10420 ms returned [42, 48, 68, 73, 94, 99, 121, 127, 150, 155, 175, 180, 201, 207, 226, 231, 254, 260, 282, 287, 307, 312, 333, 338, 359, 365, 386, 391, 411, 417, 439, 444, 463, 469]
[2024-05-22 13:00:32] [INFO ] Actually due to overlaps returned [48, 42]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 10876 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 469/477 places, 453/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 469 transition count 452
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 468 transition count 452
Applied a total of 2 rules in 19 ms. Remains 468 /469 variables (removed 1) and now considering 452/453 (removed 1) transitions.
// Phase 1: matrix 452 rows 468 cols
[2024-05-22 13:00:32] [INFO ] Invariants computation overflowed in 53 ms
[2024-05-22 13:00:33] [INFO ] Implicit Places using invariants in 459 ms returned []
// Phase 1: matrix 452 rows 468 cols
[2024-05-22 13:00:33] [INFO ] Invariants computation overflowed in 48 ms
[2024-05-22 13:00:33] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-22 13:00:55] [INFO ] Implicit Places using invariants and state equation in 22076 ms returned [65, 70, 91, 96, 118, 124, 147, 152, 172, 177, 198, 204, 223, 228, 251, 257, 279, 284, 304, 309, 330, 335, 356, 362, 383, 388, 408, 414, 436, 441, 460, 466]
[2024-05-22 13:00:55] [INFO ] Actually due to overlaps returned [70, 65]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 22540 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 466/477 places, 452/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 466 transition count 451
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 465 transition count 451
Applied a total of 2 rules in 26 ms. Remains 465 /466 variables (removed 1) and now considering 451/452 (removed 1) transitions.
// Phase 1: matrix 451 rows 465 cols
[2024-05-22 13:00:55] [INFO ] Invariants computation overflowed in 34 ms
[2024-05-22 13:00:55] [INFO ] Implicit Places using invariants in 418 ms returned []
// Phase 1: matrix 451 rows 465 cols
[2024-05-22 13:00:55] [INFO ] Invariants computation overflowed in 27 ms
[2024-05-22 13:00:55] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-22 13:01:04] [INFO ] Implicit Places using invariants and state equation in 8752 ms returned [88, 93, 115, 121, 144, 149, 169, 174, 195, 201, 220, 225, 248, 254, 276, 281, 301, 306, 327, 332, 353, 359, 380, 385, 405, 411, 433, 438, 457, 463]
[2024-05-22 13:01:04] [INFO ] Actually due to overlaps returned [93, 88]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 9177 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 463/477 places, 451/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 463 transition count 450
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 462 transition count 450
Applied a total of 2 rules in 17 ms. Remains 462 /463 variables (removed 1) and now considering 450/451 (removed 1) transitions.
// Phase 1: matrix 450 rows 462 cols
[2024-05-22 13:01:04] [INFO ] Invariants computation overflowed in 40 ms
[2024-05-22 13:01:04] [INFO ] Implicit Places using invariants in 411 ms returned []
// Phase 1: matrix 450 rows 462 cols
[2024-05-22 13:01:04] [INFO ] Invariants computation overflowed in 44 ms
[2024-05-22 13:01:05] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-22 13:01:19] [INFO ] Implicit Places using invariants and state equation in 14717 ms returned [112, 118, 141, 146, 166, 171, 192, 198, 217, 222, 245, 251, 273, 278, 298, 303, 324, 329, 350, 356, 377, 382, 402, 408, 430, 435, 454, 460]
[2024-05-22 13:01:19] [INFO ] Actually due to overlaps returned [118, 112]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 15130 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 460/477 places, 450/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 460 transition count 449
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 459 transition count 449
Applied a total of 2 rules in 20 ms. Remains 459 /460 variables (removed 1) and now considering 449/450 (removed 1) transitions.
// Phase 1: matrix 449 rows 459 cols
[2024-05-22 13:01:19] [INFO ] Invariants computation overflowed in 30 ms
[2024-05-22 13:01:19] [INFO ] Implicit Places using invariants in 383 ms returned []
// Phase 1: matrix 449 rows 459 cols
[2024-05-22 13:01:19] [INFO ] Invariants computation overflowed in 24 ms
[2024-05-22 13:01:20] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-22 13:01:37] [INFO ] Implicit Places using invariants and state equation in 17878 ms returned [138, 143, 163, 168, 189, 195, 214, 219, 242, 248, 270, 275, 295, 300, 321, 326, 347, 353, 374, 379, 399, 405, 427, 432, 451, 457]
[2024-05-22 13:01:37] [INFO ] Actually due to overlaps returned [143, 138]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 18262 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 457/477 places, 449/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 457 transition count 448
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 456 transition count 448
Applied a total of 2 rules in 16 ms. Remains 456 /457 variables (removed 1) and now considering 448/449 (removed 1) transitions.
// Phase 1: matrix 448 rows 456 cols
[2024-05-22 13:01:37] [INFO ] Invariants computation overflowed in 26 ms
[2024-05-22 13:01:38] [INFO ] Implicit Places using invariants in 385 ms returned []
// Phase 1: matrix 448 rows 456 cols
[2024-05-22 13:01:38] [INFO ] Invariants computation overflowed in 25 ms
[2024-05-22 13:01:38] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-22 13:01:48] [INFO ] Implicit Places using invariants and state equation in 10245 ms returned [160, 165, 186, 192, 211, 216, 239, 245, 267, 272, 292, 297, 318, 323, 344, 350, 371, 376, 396, 402, 424, 429, 448, 454]
[2024-05-22 13:01:48] [INFO ] Actually due to overlaps returned [165, 160]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 10632 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 454/477 places, 448/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 454 transition count 447
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 453 transition count 447
Applied a total of 2 rules in 23 ms. Remains 453 /454 variables (removed 1) and now considering 447/448 (removed 1) transitions.
// Phase 1: matrix 447 rows 453 cols
[2024-05-22 13:01:48] [INFO ] Invariants computation overflowed in 32 ms
[2024-05-22 13:01:48] [INFO ] Implicit Places using invariants in 371 ms returned []
// Phase 1: matrix 447 rows 453 cols
[2024-05-22 13:01:48] [INFO ] Invariants computation overflowed in 26 ms
[2024-05-22 13:01:49] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-22 13:02:03] [INFO ] Implicit Places using invariants and state equation in 14868 ms returned [183, 189, 208, 213, 236, 242, 264, 269, 289, 294, 315, 320, 341, 347, 368, 373, 393, 399, 421, 426, 445, 451]
[2024-05-22 13:02:03] [INFO ] Actually due to overlaps returned [189, 183]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 15241 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 451/477 places, 447/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 451 transition count 446
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 450 transition count 446
Applied a total of 2 rules in 23 ms. Remains 450 /451 variables (removed 1) and now considering 446/447 (removed 1) transitions.
// Phase 1: matrix 446 rows 450 cols
[2024-05-22 13:02:03] [INFO ] Computed 81 invariants in 48 ms
[2024-05-22 13:02:04] [INFO ] Implicit Places using invariants in 717 ms returned [205, 210, 233, 239, 261, 266, 286, 291, 312, 317, 338, 344, 365, 370, 390, 396, 418, 423, 442, 448]
[2024-05-22 13:02:04] [INFO ] Actually due to overlaps returned [210, 205]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 719 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 10 : 448/477 places, 446/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 448 transition count 445
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 447 transition count 445
Applied a total of 2 rules in 16 ms. Remains 447 /448 variables (removed 1) and now considering 445/446 (removed 1) transitions.
// Phase 1: matrix 445 rows 447 cols
[2024-05-22 13:02:04] [INFO ] Invariants computation overflowed in 33 ms
[2024-05-22 13:02:04] [INFO ] Implicit Places using invariants in 335 ms returned []
// Phase 1: matrix 445 rows 447 cols
[2024-05-22 13:02:04] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-22 13:02:05] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-22 13:02:14] [INFO ] Implicit Places using invariants and state equation in 10016 ms returned [230, 236, 258, 263, 283, 288, 309, 314, 335, 341, 362, 367, 387, 393, 415, 420, 439, 445]
[2024-05-22 13:02:14] [INFO ] Actually due to overlaps returned [236, 230]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 10354 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 11 : 445/477 places, 445/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 445 transition count 444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 444 transition count 444
Applied a total of 2 rules in 20 ms. Remains 444 /445 variables (removed 1) and now considering 444/445 (removed 1) transitions.
// Phase 1: matrix 444 rows 444 cols
[2024-05-22 13:02:14] [INFO ] Computed 77 invariants in 63 ms
[2024-05-22 13:02:15] [INFO ] Implicit Places using invariants in 634 ms returned [255, 260, 280, 285, 306, 311, 332, 338, 359, 364, 384, 390, 412, 417, 436, 442]
[2024-05-22 13:02:15] [INFO ] Actually due to overlaps returned [260, 255]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 635 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 12 : 442/477 places, 444/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 442 transition count 443
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 441 transition count 443
Applied a total of 2 rules in 19 ms. Remains 441 /442 variables (removed 1) and now considering 443/444 (removed 1) transitions.
// Phase 1: matrix 443 rows 441 cols
[2024-05-22 13:02:15] [INFO ] Invariants computation overflowed in 32 ms
[2024-05-22 13:02:15] [INFO ] Implicit Places using invariants in 324 ms returned []
// Phase 1: matrix 443 rows 441 cols
[2024-05-22 13:02:15] [INFO ] Invariants computation overflowed in 25 ms
[2024-05-22 13:02:16] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-22 13:02:25] [INFO ] Implicit Places using invariants and state equation in 9982 ms returned [277, 282, 303, 308, 329, 335, 356, 361, 381, 387, 409, 414, 433, 439]
[2024-05-22 13:02:25] [INFO ] Actually due to overlaps returned [282, 277]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 10308 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 13 : 439/477 places, 443/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 439 transition count 442
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 438 transition count 442
Applied a total of 2 rules in 21 ms. Remains 438 /439 variables (removed 1) and now considering 442/443 (removed 1) transitions.
// Phase 1: matrix 442 rows 438 cols
[2024-05-22 13:02:25] [INFO ] Invariants computation overflowed in 31 ms
[2024-05-22 13:02:26] [INFO ] Implicit Places using invariants in 304 ms returned []
// Phase 1: matrix 442 rows 438 cols
[2024-05-22 13:02:26] [INFO ] Invariants computation overflowed in 26 ms
[2024-05-22 13:02:26] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-22 13:02:33] [INFO ] Implicit Places using invariants and state equation in 6950 ms returned [300, 305, 326, 332, 353, 358, 378, 384, 406, 411, 430, 436]
[2024-05-22 13:02:33] [INFO ] Actually due to overlaps returned [305, 300]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 7258 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 14 : 436/477 places, 442/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 436 transition count 441
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 435 transition count 441
Applied a total of 2 rules in 17 ms. Remains 435 /436 variables (removed 1) and now considering 441/442 (removed 1) transitions.
// Phase 1: matrix 441 rows 435 cols
[2024-05-22 13:02:33] [INFO ] Invariants computation overflowed in 29 ms
[2024-05-22 13:02:33] [INFO ] Implicit Places using invariants in 307 ms returned []
// Phase 1: matrix 441 rows 435 cols
[2024-05-22 13:02:33] [INFO ] Invariants computation overflowed in 25 ms
[2024-05-22 13:02:33] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-22 13:02:41] [INFO ] Implicit Places using invariants and state equation in 8159 ms returned [323, 329, 350, 355, 375, 381, 403, 408, 427, 433]
[2024-05-22 13:02:41] [INFO ] Actually due to overlaps returned [329, 323]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 8469 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 15 : 433/477 places, 441/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 433 transition count 440
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 432 transition count 440
Applied a total of 2 rules in 19 ms. Remains 432 /433 variables (removed 1) and now considering 440/441 (removed 1) transitions.
// Phase 1: matrix 440 rows 432 cols
[2024-05-22 13:02:41] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-22 13:02:41] [INFO ] Implicit Places using invariants in 294 ms returned []
// Phase 1: matrix 440 rows 432 cols
[2024-05-22 13:02:41] [INFO ] Invariants computation overflowed in 26 ms
[2024-05-22 13:02:42] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-22 13:02:54] [INFO ] Implicit Places using invariants and state equation in 12741 ms returned [347, 352, 372, 378, 400, 405, 424, 430]
[2024-05-22 13:02:54] [INFO ] Actually due to overlaps returned [352, 347]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 13039 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 16 : 430/477 places, 440/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 430 transition count 439
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 429 transition count 439
Applied a total of 2 rules in 19 ms. Remains 429 /430 variables (removed 1) and now considering 439/440 (removed 1) transitions.
// Phase 1: matrix 439 rows 429 cols
[2024-05-22 13:02:54] [INFO ] Invariants computation overflowed in 29 ms
[2024-05-22 13:02:54] [INFO ] Implicit Places using invariants in 295 ms returned []
// Phase 1: matrix 439 rows 429 cols
[2024-05-22 13:02:54] [INFO ] Invariants computation overflowed in 24 ms
[2024-05-22 13:02:55] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-22 13:03:06] [INFO ] Implicit Places using invariants and state equation in 11920 ms returned [369, 375, 397, 402, 421, 427]
[2024-05-22 13:03:06] [INFO ] Actually due to overlaps returned [375, 369]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 12219 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 17 : 427/477 places, 439/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 427 transition count 438
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 426 transition count 438
Applied a total of 2 rules in 17 ms. Remains 426 /427 variables (removed 1) and now considering 438/439 (removed 1) transitions.
// Phase 1: matrix 438 rows 426 cols
[2024-05-22 13:03:06] [INFO ] Invariants computation overflowed in 30 ms
[2024-05-22 13:03:07] [INFO ] Implicit Places using invariants in 285 ms returned []
// Phase 1: matrix 438 rows 426 cols
[2024-05-22 13:03:07] [INFO ] Invariants computation overflowed in 25 ms
[2024-05-22 13:03:07] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-22 13:03:13] [INFO ] Implicit Places using invariants and state equation in 6808 ms returned [394, 399, 418, 424]
[2024-05-22 13:03:13] [INFO ] Actually due to overlaps returned [399, 394]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 7096 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 18 : 424/477 places, 438/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 424 transition count 437
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 423 transition count 437
Applied a total of 2 rules in 17 ms. Remains 423 /424 variables (removed 1) and now considering 437/438 (removed 1) transitions.
// Phase 1: matrix 437 rows 423 cols
[2024-05-22 13:03:14] [INFO ] Invariants computation overflowed in 33 ms
[2024-05-22 13:03:14] [INFO ] Implicit Places using invariants in 285 ms returned []
// Phase 1: matrix 437 rows 423 cols
[2024-05-22 13:03:14] [INFO ] Invariants computation overflowed in 26 ms
[2024-05-22 13:03:14] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-22 13:03:23] [INFO ] Implicit Places using invariants and state equation in 8896 ms returned [415, 421]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 9184 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 19 : 421/477 places, 437/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 421 transition count 436
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 420 transition count 436
Applied a total of 2 rules in 19 ms. Remains 420 /421 variables (removed 1) and now considering 436/437 (removed 1) transitions.
// Phase 1: matrix 436 rows 420 cols
[2024-05-22 13:03:23] [INFO ] Invariants computation overflowed in 34 ms
[2024-05-22 13:03:23] [INFO ] Implicit Places using invariants in 278 ms returned []
// Phase 1: matrix 436 rows 420 cols
[2024-05-22 13:03:23] [INFO ] Invariants computation overflowed in 26 ms
[2024-05-22 13:03:23] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-22 13:03:32] [INFO ] Implicit Places using invariants and state equation in 9008 ms returned []
Implicit Place search using SMT with State Equation took 9287 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 20 : 420/477 places, 436/455 transitions.
Finished structural reductions in REACHABILITY mode , in 20 iterations and 212433 ms. Remains : 420/477 places, 436/455 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p2), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X p0), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X p0)), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT p1))), (G (OR p2 (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p2 (NOT p0) p1))), (F (NOT p2)), (F (NOT (AND (OR p2 p0) (OR p2 p1))))]
Knowledge based reduction with 14 factoid took 230 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 62 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Support contains 3 out of 558 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 : 558/558 places, 535/535 transitions.
Applied a total of 0 rules in 12 ms. Remains 558 /558 variables (removed 0) and now considering 535/535 (removed 0) transitions.
// Phase 1: matrix 535 rows 558 cols
[2024-05-22 13:03:32] [INFO ] Invariants computation overflowed in 39 ms
[2024-05-22 13:03:33] [INFO ] Implicit Places using invariants in 275 ms returned []
// Phase 1: matrix 535 rows 558 cols
[2024-05-22 13:03:33] [INFO ] Invariants computation overflowed in 35 ms
[2024-05-22 13:03:33] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-22 13:03:40] [INFO ] Implicit Places using invariants and state equation in 7635 ms returned []
Implicit Place search using SMT with State Equation took 7912 ms to find 0 implicit places.
[2024-05-22 13:03:40] [INFO ] Redundant transitions in 6 ms returned []
Running 534 sub problems to find dead transitions.
// Phase 1: matrix 535 rows 558 cols
[2024-05-22 13:03:40] [INFO ] Invariants computation overflowed in 40 ms
[2024-05-22 13:03:40] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/557 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 1 (OVERLAPS) 535/1092 variables, 557/557 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1092 variables, 37/594 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1092 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 534 unsolved
SMT process timed out in 30142ms, After SMT, problems are : Problem set: 0 solved, 534 unsolved
Search for dead transitions found 0 dead transitions in 30148ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38090 ms. Remains : 558/558 places, 535/535 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1742 edges and 558 vertex of which 557 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2), (X p2), (X (NOT (AND (NOT p2) p0))), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p2) p0)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 78 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
RANDOM walk for 40000 steps (5433 resets) in 56 ms. (701 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40001 steps (3206 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
// Phase 1: matrix 535 rows 558 cols
[2024-05-22 13:04:11] [INFO ] Invariants computation overflowed in 36 ms
[2024-05-22 13:04:11] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 10/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 52/64 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 95/159 variables, 44/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 4/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 100/259 variables, 53/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/259 variables, 3/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/259 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 97/356 variables, 49/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/356 variables, 4/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/356 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 108/464 variables, 54/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/464 variables, 4/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/464 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 110/574 variables, 56/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/574 variables, 4/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/574 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 107/681 variables, 56/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/681 variables, 3/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/681 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 91/772 variables, 49/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/772 variables, 2/407 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/772 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 70/842 variables, 39/446 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/842 variables, 2/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/842 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 56/898 variables, 29/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/898 variables, 2/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/898 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 55/953 variables, 28/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/953 variables, 2/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/953 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 55/1008 variables, 28/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1008 variables, 2/539 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1008 variables, 0/539 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 53/1061 variables, 28/567 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1061 variables, 2/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1061 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 30/1091 variables, 21/590 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1091 variables, 3/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1091 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 2/1093 variables, 2/595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1093 variables, 0/595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (OVERLAPS) 0/1093 variables, 0/595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1093/1093 variables, and 595 constraints, problems are : Problem set: 0 solved, 1 unsolved in 411 ms.
Refiners :[State Equation: 558/558 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 10/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 52/64 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 95/159 variables, 44/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 4/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 100/259 variables, 53/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/259 variables, 3/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/259 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 97/356 variables, 49/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/356 variables, 4/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/356 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 108/464 variables, 54/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/464 variables, 4/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/464 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 110/574 variables, 56/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/574 variables, 4/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/574 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 107/681 variables, 56/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/681 variables, 3/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/681 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 91/772 variables, 49/406 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/772 variables, 2/408 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 13:04:11] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 2 ms to minimize.
[2024-05-22 13:04:12] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 2 ms to minimize.
[2024-05-22 13:04:12] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 2 ms to minimize.
[2024-05-22 13:04:12] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 2 ms to minimize.
[2024-05-22 13:04:12] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 2 ms to minimize.
[2024-05-22 13:04:12] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 2 ms to minimize.
[2024-05-22 13:04:12] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 2 ms to minimize.
[2024-05-22 13:04:12] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 2 ms to minimize.
[2024-05-22 13:04:12] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 1 ms to minimize.
[2024-05-22 13:04:12] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 2 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/772 variables, 10/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/772 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 70/842 variables, 39/457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/842 variables, 2/459 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/842 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 56/898 variables, 29/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/898 variables, 2/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/898 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 55/953 variables, 28/518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/953 variables, 2/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/953 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 55/1008 variables, 28/548 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1008 variables, 2/550 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1008 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 53/1061 variables, 28/578 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1061 variables, 2/580 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1061 variables, 0/580 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 30/1091 variables, 21/601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1091 variables, 3/604 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1091 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (OVERLAPS) 2/1093 variables, 2/606 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1093 variables, 0/606 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (OVERLAPS) 0/1093 variables, 0/606 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1093/1093 variables, and 606 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1617 ms.
Refiners :[State Equation: 558/558 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 10/10 constraints]
After SMT, in 2077ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 458 ms.
Support contains 2 out of 558 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 558/558 places, 535/535 transitions.
Graph (complete) has 1664 edges and 558 vertex of which 557 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
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 0 with 4 rules applied. Total rules applied 5 place count 557 transition count 531
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 8 place count 554 transition count 531
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 553 transition count 531
Free-agglomeration rule (complex) applied 78 times.
Iterating global reduction 2 with 78 rules applied. Total rules applied 88 place count 553 transition count 453
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 2 with 78 rules applied. Total rules applied 166 place count 475 transition count 453
Partial Free-agglomeration rule applied 80 times.
Drop transitions (Partial Free agglomeration) removed 80 transitions
Iterating global reduction 3 with 80 rules applied. Total rules applied 246 place count 475 transition count 453
Applied a total of 246 rules in 38 ms. Remains 475 /558 variables (removed 83) and now considering 453/535 (removed 82) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 475/558 places, 453/535 transitions.
RANDOM walk for 40000 steps (5080 resets) in 72 ms. (547 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3357 resets) in 49 ms. (800 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 447949 steps, run timeout after 3001 ms. (steps per millisecond=149 ) properties seen :0 out of 1
Probabilistic random walk after 447949 steps, saw 224098 distinct states, run finished after 3001 ms. (steps per millisecond=149 ) properties seen :0
// Phase 1: matrix 453 rows 475 cols
[2024-05-22 13:04:16] [INFO ] Invariants computation overflowed in 44 ms
[2024-05-22 13:04:16] [INFO ] State equation strengthened by 77 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/15 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 173/188 variables, 36/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 4/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 501/689 variables, 248/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/689 variables, 43/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/689 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 239/928 variables, 189/523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/928 variables, 29/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/928 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/928 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 928/928 variables, and 552 constraints, problems are : Problem set: 0 solved, 1 unsolved in 302 ms.
Refiners :[State Equation: 475/475 constraints, ReadFeed: 77/77 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/15 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 173/188 variables, 36/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 4/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 501/689 variables, 248/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/689 variables, 43/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/689 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 239/928 variables, 189/524 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/928 variables, 29/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 13:04:17] [INFO ] Deduced a trap composed of 20 places in 173 ms of which 3 ms to minimize.
[2024-05-22 13:04:17] [INFO ] Deduced a trap composed of 15 places in 171 ms of which 3 ms to minimize.
[2024-05-22 13:04:18] [INFO ] Deduced a trap composed of 17 places in 175 ms of which 2 ms to minimize.
[2024-05-22 13:04:18] [INFO ] Deduced a trap composed of 16 places in 168 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/928 variables, 4/557 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/928 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/928 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 928/928 variables, and 557 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1243 ms.
Refiners :[State Equation: 475/475 constraints, ReadFeed: 77/77 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 1598ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 458 ms.
Support contains 2 out of 475 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 453/453 transitions.
Applied a total of 0 rules in 8 ms. Remains 475 /475 variables (removed 0) and now considering 453/453 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 475/475 places, 453/453 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 453/453 transitions.
Applied a total of 0 rules in 8 ms. Remains 475 /475 variables (removed 0) and now considering 453/453 (removed 0) transitions.
// Phase 1: matrix 453 rows 475 cols
[2024-05-22 13:04:18] [INFO ] Invariants computation overflowed in 43 ms
[2024-05-22 13:04:19] [INFO ] Implicit Places using invariants in 508 ms returned []
// Phase 1: matrix 453 rows 475 cols
[2024-05-22 13:04:19] [INFO ] Invariants computation overflowed in 37 ms
[2024-05-22 13:04:19] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-22 13:04:46] [INFO ] Implicit Places using invariants and state equation in 27436 ms returned [42, 48, 68, 73, 94, 99, 120, 126, 148, 153, 154, 174, 179, 200, 206, 213, 227, 232, 255, 261, 283, 288, 308, 313, 334, 339, 360, 366, 387, 389, 393, 413, 419, 441, 446, 450, 467, 473]
[2024-05-22 13:04:46] [INFO ] Actually due to overlaps returned [213, 153]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 27946 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 473/475 places, 453/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 473 transition count 452
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 472 transition count 452
Applied a total of 2 rules in 18 ms. Remains 472 /473 variables (removed 1) and now considering 452/453 (removed 1) transitions.
// Phase 1: matrix 452 rows 472 cols
[2024-05-22 13:04:46] [INFO ] Invariants computation overflowed in 35 ms
[2024-05-22 13:04:47] [INFO ] Implicit Places using invariants in 478 ms returned []
// Phase 1: matrix 452 rows 472 cols
[2024-05-22 13:04:47] [INFO ] Invariants computation overflowed in 32 ms
[2024-05-22 13:04:47] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-22 13:04:57] [INFO ] Implicit Places using invariants and state equation in 10231 ms returned [42, 48, 68, 73, 94, 99, 120, 126, 148, 153, 173, 178, 199, 205, 224, 229, 252, 258, 280, 285, 305, 310, 331, 336, 357, 363, 384, 386, 390, 410, 416, 438, 443, 447, 464, 470]
[2024-05-22 13:04:57] [INFO ] Actually due to overlaps returned [447, 386]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 10713 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 470/475 places, 452/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 470 transition count 451
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 469 transition count 451
Applied a total of 2 rules in 22 ms. Remains 469 /470 variables (removed 1) and now considering 451/452 (removed 1) transitions.
// Phase 1: matrix 451 rows 469 cols
[2024-05-22 13:04:57] [INFO ] Invariants computation overflowed in 38 ms
[2024-05-22 13:04:57] [INFO ] Implicit Places using invariants in 462 ms returned []
// Phase 1: matrix 451 rows 469 cols
[2024-05-22 13:04:58] [INFO ] Invariants computation overflowed in 31 ms
[2024-05-22 13:04:58] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-22 13:05:13] [INFO ] Implicit Places using invariants and state equation in 15359 ms returned [42, 48, 68, 73, 94, 99, 120, 126, 148, 153, 173, 178, 199, 205, 224, 229, 252, 258, 280, 285, 305, 310, 331, 336, 357, 363, 384, 389, 409, 415, 437, 442, 461, 467]
[2024-05-22 13:05:13] [INFO ] Actually due to overlaps returned [48, 42]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 15825 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 467/475 places, 451/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 467 transition count 450
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 466 transition count 450
Applied a total of 2 rules in 23 ms. Remains 466 /467 variables (removed 1) and now considering 450/451 (removed 1) transitions.
// Phase 1: matrix 450 rows 466 cols
[2024-05-22 13:05:13] [INFO ] Invariants computation overflowed in 36 ms
[2024-05-22 13:05:13] [INFO ] Implicit Places using invariants in 431 ms returned []
// Phase 1: matrix 450 rows 466 cols
[2024-05-22 13:05:13] [INFO ] Invariants computation overflowed in 34 ms
[2024-05-22 13:05:14] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-22 13:05:31] [INFO ] Implicit Places using invariants and state equation in 18027 ms returned [65, 70, 91, 96, 117, 123, 145, 150, 170, 175, 196, 202, 221, 226, 249, 255, 277, 282, 302, 307, 328, 333, 354, 360, 381, 386, 406, 412, 434, 439, 458, 464]
[2024-05-22 13:05:31] [INFO ] Actually due to overlaps returned [70, 65]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 18462 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 464/475 places, 450/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 464 transition count 449
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 463 transition count 449
Applied a total of 2 rules in 24 ms. Remains 463 /464 variables (removed 1) and now considering 449/450 (removed 1) transitions.
// Phase 1: matrix 449 rows 463 cols
[2024-05-22 13:05:31] [INFO ] Invariants computation overflowed in 32 ms
[2024-05-22 13:05:32] [INFO ] Implicit Places using invariants in 420 ms returned []
// Phase 1: matrix 449 rows 463 cols
[2024-05-22 13:05:32] [INFO ] Invariants computation overflowed in 29 ms
[2024-05-22 13:05:32] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-22 13:05:45] [INFO ] Implicit Places using invariants and state equation in 13226 ms returned [88, 93, 114, 120, 142, 147, 167, 172, 193, 199, 218, 223, 246, 252, 274, 279, 299, 304, 325, 330, 351, 357, 378, 383, 403, 409, 431, 436, 455, 461]
[2024-05-22 13:05:45] [INFO ] Actually due to overlaps returned [93, 88]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 13650 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 461/475 places, 449/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 461 transition count 448
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 460 transition count 448
Applied a total of 2 rules in 20 ms. Remains 460 /461 variables (removed 1) and now considering 448/449 (removed 1) transitions.
// Phase 1: matrix 448 rows 460 cols
[2024-05-22 13:05:45] [INFO ] Invariants computation overflowed in 32 ms
[2024-05-22 13:05:45] [INFO ] Implicit Places using invariants in 417 ms returned []
// Phase 1: matrix 448 rows 460 cols
[2024-05-22 13:05:45] [INFO ] Invariants computation overflowed in 25 ms
[2024-05-22 13:05:46] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-22 13:06:04] [INFO ] Implicit Places using invariants and state equation in 18118 ms returned [111, 117, 139, 144, 164, 169, 190, 196, 215, 220, 243, 249, 271, 276, 296, 301, 322, 327, 348, 354, 375, 380, 400, 406, 428, 433, 452, 458]
[2024-05-22 13:06:04] [INFO ] Actually due to overlaps returned [117, 111]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 18539 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 458/475 places, 448/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 458 transition count 447
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 457 transition count 447
Applied a total of 2 rules in 18 ms. Remains 457 /458 variables (removed 1) and now considering 447/448 (removed 1) transitions.
// Phase 1: matrix 447 rows 457 cols
[2024-05-22 13:06:04] [INFO ] Invariants computation overflowed in 36 ms
[2024-05-22 13:06:04] [INFO ] Implicit Places using invariants in 392 ms returned []
// Phase 1: matrix 447 rows 457 cols
[2024-05-22 13:06:04] [INFO ] Invariants computation overflowed in 32 ms
[2024-05-22 13:06:04] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-22 13:06:15] [INFO ] Implicit Places using invariants and state equation in 11060 ms returned [136, 141, 161, 166, 187, 193, 212, 217, 240, 246, 268, 273, 293, 298, 319, 324, 345, 351, 372, 377, 397, 403, 425, 430, 449, 455]
[2024-05-22 13:06:15] [INFO ] Actually due to overlaps returned [141, 136]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 11454 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 455/475 places, 447/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 455 transition count 446
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 454 transition count 446
Applied a total of 2 rules in 18 ms. Remains 454 /455 variables (removed 1) and now considering 446/447 (removed 1) transitions.
// Phase 1: matrix 446 rows 454 cols
[2024-05-22 13:06:15] [INFO ] Invariants computation overflowed in 43 ms
[2024-05-22 13:06:15] [INFO ] Implicit Places using invariants in 371 ms returned []
// Phase 1: matrix 446 rows 454 cols
[2024-05-22 13:06:15] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-22 13:06:16] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-22 13:06:26] [INFO ] Implicit Places using invariants and state equation in 10606 ms returned [158, 163, 184, 190, 209, 214, 237, 243, 265, 270, 290, 295, 316, 321, 342, 348, 369, 374, 394, 400, 422, 427, 446, 452]
[2024-05-22 13:06:26] [INFO ] Actually due to overlaps returned [163, 158]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 10979 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 452/475 places, 446/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 452 transition count 445
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 451 transition count 445
Applied a total of 2 rules in 17 ms. Remains 451 /452 variables (removed 1) and now considering 445/446 (removed 1) transitions.
// Phase 1: matrix 445 rows 451 cols
[2024-05-22 13:06:26] [INFO ] Invariants computation overflowed in 29 ms
[2024-05-22 13:06:26] [INFO ] Implicit Places using invariants in 361 ms returned []
// Phase 1: matrix 445 rows 451 cols
[2024-05-22 13:06:26] [INFO ] Invariants computation overflowed in 23 ms
[2024-05-22 13:06:27] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-22 13:06:34] [INFO ] Implicit Places using invariants and state equation in 7651 ms returned [181, 187, 206, 211, 234, 240, 262, 267, 287, 292, 313, 318, 339, 345, 366, 371, 391, 397, 419, 424, 443, 449]
[2024-05-22 13:06:34] [INFO ] Actually due to overlaps returned [187, 181]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 8013 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 449/475 places, 445/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 449 transition count 444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 448 transition count 444
Applied a total of 2 rules in 20 ms. Remains 448 /449 variables (removed 1) and now considering 444/445 (removed 1) transitions.
// Phase 1: matrix 444 rows 448 cols
[2024-05-22 13:06:34] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-22 13:06:34] [INFO ] Implicit Places using invariants in 336 ms returned []
// Phase 1: matrix 444 rows 448 cols
[2024-05-22 13:06:34] [INFO ] Invariants computation overflowed in 25 ms
[2024-05-22 13:06:35] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-22 13:06:48] [INFO ] Implicit Places using invariants and state equation in 13598 ms returned [203, 208, 231, 237, 259, 264, 284, 289, 310, 315, 336, 342, 363, 368, 388, 394, 416, 421, 440, 446]
[2024-05-22 13:06:48] [INFO ] Actually due to overlaps returned [208, 203]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 13936 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 10 : 446/475 places, 444/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 446 transition count 443
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 445 transition count 443
Applied a total of 2 rules in 19 ms. Remains 445 /446 variables (removed 1) and now considering 443/444 (removed 1) transitions.
// Phase 1: matrix 443 rows 445 cols
[2024-05-22 13:06:48] [INFO ] Invariants computation overflowed in 32 ms
[2024-05-22 13:06:48] [INFO ] Implicit Places using invariants in 338 ms returned []
// Phase 1: matrix 443 rows 445 cols
[2024-05-22 13:06:48] [INFO ] Invariants computation overflowed in 24 ms
[2024-05-22 13:06:49] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-22 13:06:57] [INFO ] Implicit Places using invariants and state equation in 8636 ms returned [228, 234, 256, 261, 281, 286, 307, 312, 333, 339, 360, 365, 385, 391, 413, 418, 437, 443]
[2024-05-22 13:06:57] [INFO ] Actually due to overlaps returned [234, 228]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 8979 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 11 : 443/475 places, 443/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 443 transition count 442
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 442 transition count 442
Applied a total of 2 rules in 18 ms. Remains 442 /443 variables (removed 1) and now considering 442/443 (removed 1) transitions.
// Phase 1: matrix 442 rows 442 cols
[2024-05-22 13:06:57] [INFO ] Invariants computation overflowed in 32 ms
[2024-05-22 13:06:57] [INFO ] Implicit Places using invariants in 335 ms returned []
// Phase 1: matrix 442 rows 442 cols
[2024-05-22 13:06:57] [INFO ] Invariants computation overflowed in 23 ms
[2024-05-22 13:06:58] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-22 13:07:06] [INFO ] Implicit Places using invariants and state equation in 9110 ms returned [253, 258, 278, 283, 304, 309, 330, 336, 357, 362, 382, 388, 410, 415, 434, 440]
[2024-05-22 13:07:06] [INFO ] Actually due to overlaps returned [258, 253]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 9447 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 12 : 440/475 places, 442/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 440 transition count 441
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 439 transition count 441
Applied a total of 2 rules in 16 ms. Remains 439 /440 variables (removed 1) and now considering 441/442 (removed 1) transitions.
// Phase 1: matrix 441 rows 439 cols
[2024-05-22 13:07:07] [INFO ] Invariants computation overflowed in 30 ms
[2024-05-22 13:07:07] [INFO ] Implicit Places using invariants in 318 ms returned []
// Phase 1: matrix 441 rows 439 cols
[2024-05-22 13:07:07] [INFO ] Invariants computation overflowed in 23 ms
[2024-05-22 13:07:07] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-22 13:07:15] [INFO ] Implicit Places using invariants and state equation in 7971 ms returned [275, 280, 301, 306, 327, 333, 354, 359, 379, 385, 407, 412, 431, 437]
[2024-05-22 13:07:15] [INFO ] Actually due to overlaps returned [280, 275]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 8290 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 13 : 437/475 places, 441/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 437 transition count 440
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 436 transition count 440
Applied a total of 2 rules in 16 ms. Remains 436 /437 variables (removed 1) and now considering 440/441 (removed 1) transitions.
// Phase 1: matrix 440 rows 436 cols
[2024-05-22 13:07:15] [INFO ] Invariants computation overflowed in 27 ms
[2024-05-22 13:07:15] [INFO ] Implicit Places using invariants in 309 ms returned []
// Phase 1: matrix 440 rows 436 cols
[2024-05-22 13:07:15] [INFO ] Invariants computation overflowed in 23 ms
[2024-05-22 13:07:15] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-22 13:07:22] [INFO ] Implicit Places using invariants and state equation in 6944 ms returned [298, 303, 324, 330, 351, 356, 376, 382, 404, 409, 428, 434]
[2024-05-22 13:07:22] [INFO ] Actually due to overlaps returned [303, 298]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 7255 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 14 : 434/475 places, 440/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 434 transition count 439
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 433 transition count 439
Applied a total of 2 rules in 15 ms. Remains 433 /434 variables (removed 1) and now considering 439/440 (removed 1) transitions.
// Phase 1: matrix 439 rows 433 cols
[2024-05-22 13:07:22] [INFO ] Invariants computation overflowed in 31 ms
[2024-05-22 13:07:22] [INFO ] Implicit Places using invariants in 306 ms returned []
// Phase 1: matrix 439 rows 433 cols
[2024-05-22 13:07:22] [INFO ] Invariants computation overflowed in 25 ms
[2024-05-22 13:07:23] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-22 13:07:30] [INFO ] Implicit Places using invariants and state equation in 7443 ms returned [321, 327, 348, 353, 373, 379, 401, 406, 425, 431]
[2024-05-22 13:07:30] [INFO ] Actually due to overlaps returned [327, 321]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 7750 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 15 : 431/475 places, 439/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 431 transition count 438
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 430 transition count 438
Applied a total of 2 rules in 15 ms. Remains 430 /431 variables (removed 1) and now considering 438/439 (removed 1) transitions.
// Phase 1: matrix 438 rows 430 cols
[2024-05-22 13:07:30] [INFO ] Invariants computation overflowed in 25 ms
[2024-05-22 13:07:30] [INFO ] Implicit Places using invariants in 293 ms returned []
// Phase 1: matrix 438 rows 430 cols
[2024-05-22 13:07:30] [INFO ] Invariants computation overflowed in 25 ms
[2024-05-22 13:07:30] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-22 13:07:36] [INFO ] Implicit Places using invariants and state equation in 6344 ms returned [345, 350, 370, 376, 398, 403, 422, 428]
[2024-05-22 13:07:36] [INFO ] Actually due to overlaps returned [350, 345]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 6639 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 16 : 428/475 places, 438/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 428 transition count 437
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 427 transition count 437
Applied a total of 2 rules in 20 ms. Remains 427 /428 variables (removed 1) and now considering 437/438 (removed 1) transitions.
// Phase 1: matrix 437 rows 427 cols
[2024-05-22 13:07:37] [INFO ] Invariants computation overflowed in 26 ms
[2024-05-22 13:07:37] [INFO ] Implicit Places using invariants in 289 ms returned []
// Phase 1: matrix 437 rows 427 cols
[2024-05-22 13:07:37] [INFO ] Invariants computation overflowed in 25 ms
[2024-05-22 13:07:37] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-22 13:07:43] [INFO ] Implicit Places using invariants and state equation in 6693 ms returned [367, 373, 395, 400, 419, 425]
[2024-05-22 13:07:43] [INFO ] Actually due to overlaps returned [373, 367]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 6985 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 17 : 425/475 places, 437/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 425 transition count 436
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 424 transition count 436
Applied a total of 2 rules in 18 ms. Remains 424 /425 variables (removed 1) and now considering 436/437 (removed 1) transitions.
// Phase 1: matrix 436 rows 424 cols
[2024-05-22 13:07:44] [INFO ] Invariants computation overflowed in 29 ms
[2024-05-22 13:07:44] [INFO ] Implicit Places using invariants in 287 ms returned []
// Phase 1: matrix 436 rows 424 cols
[2024-05-22 13:07:44] [INFO ] Invariants computation overflowed in 23 ms
[2024-05-22 13:07:44] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-22 13:07:55] [INFO ] Implicit Places using invariants and state equation in 11325 ms returned [392, 397, 416, 422]
[2024-05-22 13:07:55] [INFO ] Actually due to overlaps returned [397, 392]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 11614 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 18 : 422/475 places, 436/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 422 transition count 435
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 421 transition count 435
Applied a total of 2 rules in 18 ms. Remains 421 /422 variables (removed 1) and now considering 435/436 (removed 1) transitions.
// Phase 1: matrix 435 rows 421 cols
[2024-05-22 13:07:55] [INFO ] Invariants computation overflowed in 26 ms
[2024-05-22 13:07:55] [INFO ] Implicit Places using invariants in 275 ms returned []
// Phase 1: matrix 435 rows 421 cols
[2024-05-22 13:07:55] [INFO ] Invariants computation overflowed in 23 ms
[2024-05-22 13:07:56] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-22 13:08:02] [INFO ] Implicit Places using invariants and state equation in 6968 ms returned [413, 419]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 7245 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 19 : 419/475 places, 435/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 419 transition count 434
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 418 transition count 434
Applied a total of 2 rules in 14 ms. Remains 418 /419 variables (removed 1) and now considering 434/435 (removed 1) transitions.
// Phase 1: matrix 434 rows 418 cols
[2024-05-22 13:08:02] [INFO ] Invariants computation overflowed in 25 ms
[2024-05-22 13:08:03] [INFO ] Implicit Places using invariants in 268 ms returned []
// Phase 1: matrix 434 rows 418 cols
[2024-05-22 13:08:03] [INFO ] Invariants computation overflowed in 22 ms
[2024-05-22 13:08:03] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-22 13:08:14] [INFO ] Implicit Places using invariants and state equation in 10980 ms returned []
Implicit Place search using SMT with State Equation took 11249 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 20 : 418/475 places, 434/453 transitions.
Finished structural reductions in REACHABILITY mode , in 20 iterations and 235334 ms. Remains : 418/475 places, 434/453 transitions.
Knowledge obtained : [(AND p0 p2), (X p2), (X (NOT (AND (NOT p2) p0))), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p2) p0)))), (X (X p0))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT (OR p2 (NOT p0))))]
Knowledge based reduction with 7 factoid took 122 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 63 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 66 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 13997 reset in 120 ms.
Product exploration explored 100000 steps with 14032 reset in 119 ms.
Support contains 3 out of 558 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 558/558 places, 535/535 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 558 transition count 534
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 557 transition count 534
Applied a total of 2 rules in 12 ms. Remains 557 /558 variables (removed 1) and now considering 534/535 (removed 1) transitions.
// Phase 1: matrix 534 rows 557 cols
[2024-05-22 13:08:14] [INFO ] Invariants computation overflowed in 38 ms
[2024-05-22 13:08:15] [INFO ] Implicit Places using invariants in 277 ms returned []
// Phase 1: matrix 534 rows 557 cols
[2024-05-22 13:08:15] [INFO ] Invariants computation overflowed in 32 ms
[2024-05-22 13:08:15] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-22 13:08:26] [INFO ] Implicit Places using invariants and state equation in 11206 ms returned []
Implicit Place search using SMT with State Equation took 11484 ms to find 0 implicit places.
[2024-05-22 13:08:26] [INFO ] Redundant transitions in 8 ms returned []
Running 533 sub problems to find dead transitions.
// Phase 1: matrix 534 rows 557 cols
[2024-05-22 13:08:26] [INFO ] Invariants computation overflowed in 34 ms
[2024-05-22 13:08:26] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/556 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 1 (OVERLAPS) 534/1090 variables, 556/556 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1090 variables, 37/593 constraints. Problems are: Problem set: 0 solved, 533 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 27.0)
(s7 1.0)
(s8 26.0)
(s9 11.0)
(s10 1.0)
(s11 2.0)
(s12 19.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 9.0)
(s18 0.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 0.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 5.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 0.0)
(s33 282.0)
(s34 292.0)
(s35 1.0)
(s36 290.0)
(s37 11.0)
(s38 1.0)
(s39 5.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 5.0)
(s44 6.0)
(s45 1.0)
(s46 2.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 1.0)
(s64 43116145.0)
(s65 1.0)
(s66 268.0)
(s67 279.0)
(s68 276.0)
(s69 12.0)
(s70 1.0)
(s71 6.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 5.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 0.0)
(s89 0.0)
(s90 1.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 266.0)
(s95 263.0)
(s96 253.0)
(s97 1.0)
(s98 4.0)
(s99 16.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 13.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 9.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 5.0)
(s123 1.0)
(s124 1.0)
(s125 246.0)
(s126 254.0)
(s127 256.0)
(s128 13.0)
(s129 5.0)
(s130 5.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 0.0)
(s135 1.0)
(s136 13.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 9.0)
(s149 1.0)
(s150 1.0)
(s151 0.0)
(s152 1.0)
(s153 1.0)
(s154 5.0)
(s155 1.0)
(s156 1.0)
(s157 229.0)
(s158 240.0)
(s159 235.0)
(s160 13.0)
(s161 1.0)
(s162 9.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 13.0)
(s168 0.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 0.0)
(s181 9.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 5.0)
(s187 0.0)
(s188 1.0)
(s189 1.0)
(s190 224.0)
(s191 221.0)
(s192 211.0)
(s193 1.0)
(s194 4.0)
(s195 16.0)
(s196 1.0)
(s197 0.0)
(s198 1.0)
(s199 1.0)
(s200 14.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 0.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 10.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 6.0)
(s219 1.0)
(s220 1.0)
(s221 208.0)
(s222 208.0)
(s223 184.0)
(s224 1.0)
(s225 0.0)
(s226 1.0)
(s227 27.0)
(s228 1.0)
(s229 1.0)
(s230 13.0)
(s231 5.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 9.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 5.0)
(s249 1.0)
(s250 1.0)
(s251 191.0)
(s252 0.0)
(s253 188.0)
(s254 178.0)
(s255 1.0)
(s256 4.0)
(s257 16.0)
(s258 1.0)
(s259 1.0)
(s260 0.0)
(s261 1.0)
(s262 9.0)
(s263 1.0)
(s264 0.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 5.0)
(s275 0.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 160.0)
(s284 171.0)
(s285 166.0)
(s286 12.0)
(s287 1.0)
(s288 8.0)
(s289 1.0)
(s290 0.0)
(s291 1.0)
(s292 1.0)
(s293 13.0)
(s294 288.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 297.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 299.0)
(s306 1.0)
(s307 9.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 10.0)
(s313 5.0)
(s314 1.0)
(s315 1.0)
(s316 159.0)
(s317 156.0)
(s318 146.0)
(s319 1.0)
(s320 4.0)
(s321 1.0)
(s322 16.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 13.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 9.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 timeout
5.0)
(s346 1.0)
(s347 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/1090 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 533 unsolved
SMT process timed out in 30125ms, After SMT, problems are : Problem set: 0 solved, 533 unsolved
Search for dead transitions found 0 dead transitions in 30132ms
Starting structural reductions in SI_LTL mode, iteration 1 : 557/558 places, 534/535 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 41645 ms. Remains : 557/558 places, 534/535 transitions.
Treatment of property DoubleExponent-PT-020-LTLFireability-07 finished in 601972 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(!(((F(p0) U p1)||!p0) U X(p2))))'
Support contains 4 out of 1057 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Applied a total of 0 rules in 39 ms. Remains 1057 /1057 variables (removed 0) and now considering 997/997 (removed 0) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2024-05-22 13:08:56] [INFO ] Invariants computation overflowed in 105 ms
[2024-05-22 13:08:56] [INFO ] Implicit Places using invariants in 386 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2024-05-22 13:08:56] [INFO ] Invariants computation overflowed in 95 ms
[2024-05-22 13:09:10] [INFO ] Implicit Places using invariants and state equation in 13689 ms returned []
Implicit Place search using SMT with State Equation took 14075 ms to find 0 implicit places.
Running 996 sub problems to find dead transitions.
// Phase 1: matrix 997 rows 1057 cols
[2024-05-22 13:09:10] [INFO ] Invariants computation overflowed in 98 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1056 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 996 unsolved
At refinement iteration 1 (OVERLAPS) 997/2053 variables, 1056/1056 constraints. Problems are: Problem set: 0 solved, 996 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2053/2054 variables, and 1056 constraints, problems are : Problem set: 0 solved, 996 unsolved in 30026 ms.
Refiners :[State Equation: 1056/1057 constraints, PredecessorRefiner: 996/996 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 996 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1056 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 996 unsolved
At refinement iteration 1 (OVERLAPS) 997/2053 variables, 1056/1056 constraints. Problems are: Problem set: 0 solved, 996 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2053 variables, 996/2052 constraints. Problems are: Problem set: 0 solved, 996 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2053/2054 variables, and 2052 constraints, problems are : Problem set: 0 solved, 996 unsolved in 30025 ms.
Refiners :[State Equation: 1056/1057 constraints, PredecessorRefiner: 996/996 constraints, Known Traps: 0/0 constraints]
After SMT, in 60299ms problems are : Problem set: 0 solved, 996 unsolved
Search for dead transitions found 0 dead transitions in 60311ms
Finished structural reductions in LTL mode , in 1 iterations and 74431 ms. Remains : 1057/1057 places, 997/997 transitions.
Stuttering acceptance computed with spot in 322 ms :[p2, p2, (AND p1 p2), (AND p0 p2 p1), false, (AND p1 p2), (AND p0 p2), false]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-08
Product exploration explored 100000 steps with 33439 reset in 234 ms.
Product exploration explored 100000 steps with 33369 reset in 347 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 1805 edges and 1057 vertex of which 1055 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (OR (NOT p0) p1)), (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (OR (NOT p0) p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 25 factoid took 142 ms. Reduced automaton from 8 states, 44 edges and 3 AP (stutter sensitive) to 8 states, 44 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 311 ms :[p2, p2, (AND p1 p2), (AND p0 p2 p1), false, (AND p1 p2), (AND p0 p2), false]
Reduction of identical properties reduced properties to check from 20 to 19
RANDOM walk for 40000 steps (1303 resets) in 312 ms. (127 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (112 resets) in 29 ms. (133 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (112 resets) in 75 ms. (52 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (115 resets) in 98 ms. (40 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (113 resets) in 54 ms. (72 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (108 resets) in 48 ms. (81 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (120 resets) in 54 ms. (72 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (114 resets) in 103 ms. (38 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (116 resets) in 88 ms. (44 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (113 resets) in 63 ms. (62 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (113 resets) in 81 ms. (48 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (115 resets) in 124 ms. (32 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (113 resets) in 59 ms. (66 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (115 resets) in 69 ms. (57 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (109 resets) in 47 ms. (83 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (106 resets) in 52 ms. (75 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (110 resets) in 53 ms. (74 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (108 resets) in 66 ms. (59 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (111 resets) in 42 ms. (93 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (104 resets) in 140 ms. (28 steps per ms) remains 19/19 properties
Interrupted probabilistic random walk after 66244 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :0 out of 19
Probabilistic random walk after 66244 steps, saw 33132 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
// Phase 1: matrix 997 rows 1057 cols
[2024-05-22 13:10:16] [INFO ] Invariants computation overflowed in 94 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 9/13 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 45/58 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 125/183 variables, 49/69 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 215/398 variables, 105/174 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 274/672 variables, 128/302 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/672 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (OVERLAPS) 282/954 variables, 161/463 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/954 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 13 (OVERLAPS) 199/1153 variables, 106/569 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1153 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 19 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 190/1343 variables, 99/668 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1343 variables, 0/668 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 17 (OVERLAPS) 181/1524 variables, 89/757 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1524 variables, 0/757 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 19 (OVERLAPS) 212/1736 variables, 112/869 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1736 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 21 (OVERLAPS) 137/1873 variables, 82/951 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1873 variables, 0/951 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 23 (OVERLAPS) 98/1971 variables, 52/1003 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1971 variables, 0/1003 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 25 (OVERLAPS) 65/2036 variables, 41/1044 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2036 variables, 0/1044 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 27 (OVERLAPS) 13/2049 variables, 10/1054 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-22 13:10:21] [INFO ] Deduced a trap composed of 24 places in 269 ms of which 5 ms to minimize.
[2024-05-22 13:10:21] [INFO ] Deduced a trap composed of 25 places in 281 ms of which 5 ms to minimize.
SMT process timed out in 5383ms, After SMT, problems are : Problem set: 0 solved, 19 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 1057 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1055 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 0 with 240 rules applied. Total rules applied 241 place count 1055 transition count 756
Reduce places removed 239 places and 0 transitions.
Iterating post reduction 1 with 239 rules applied. Total rules applied 480 place count 816 transition count 756
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 480 place count 816 transition count 716
Deduced a syphon composed of 40 places in 7 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 560 place count 776 transition count 716
Performed 182 Post agglomeration using F-continuation condition.Transition count delta: 182
Deduced a syphon composed of 182 places in 2 ms
Reduce places removed 182 places and 0 transitions.
Iterating global reduction 2 with 364 rules applied. Total rules applied 924 place count 594 transition count 534
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 998 place count 557 transition count 534
Free-agglomeration rule (complex) applied 78 times.
Iterating global reduction 2 with 78 rules applied. Total rules applied 1076 place count 557 transition count 456
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 2 with 78 rules applied. Total rules applied 1154 place count 479 transition count 456
Partial Free-agglomeration rule applied 81 times.
Drop transitions (Partial Free agglomeration) removed 81 transitions
Iterating global reduction 3 with 81 rules applied. Total rules applied 1235 place count 479 transition count 456
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1236 place count 478 transition count 455
Applied a total of 1236 rules in 77 ms. Remains 478 /1057 variables (removed 579) and now considering 455/997 (removed 542) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 478/1057 places, 455/997 transitions.
RANDOM walk for 40000 steps (5134 resets) in 856 ms. (46 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (334 resets) in 64 ms. (61 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (332 resets) in 90 ms. (43 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (344 resets) in 59 ms. (66 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (335 resets) in 50 ms. (78 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (340 resets) in 45 ms. (86 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (335 resets) in 61 ms. (64 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (339 resets) in 79 ms. (50 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (330 resets) in 53 ms. (74 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (323 resets) in 31 ms. (125 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (315 resets) in 26 ms. (148 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (339 resets) in 82 ms. (48 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (330 resets) in 33 ms. (117 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (341 resets) in 52 ms. (75 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (341 resets) in 39 ms. (100 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (326 resets) in 51 ms. (76 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (350 resets) in 83 ms. (47 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (337 resets) in 53 ms. (74 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (332 resets) in 58 ms. (67 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (340 resets) in 39 ms. (100 steps per ms) remains 19/19 properties
Interrupted probabilistic random walk after 68687 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :0 out of 19
Probabilistic random walk after 68687 steps, saw 34357 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
// Phase 1: matrix 455 rows 478 cols
[2024-05-22 13:10:25] [INFO ] Invariants computation overflowed in 40 ms
[2024-05-22 13:10:25] [INFO ] State equation strengthened by 78 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 12/16 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 217/233 variables, 53/57 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 5/62 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 538/771 variables, 287/349 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/771 variables, 50/399 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/771 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Problem apf3 is UNSAT
Problem apf5 is UNSAT
Problem apf6 is UNSAT
Problem apf11 is UNSAT
Problem apf14 is UNSAT
Problem apf19 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 162/933 variables, 134/533 constraints. Problems are: Problem set: 6 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/933 variables, 23/556 constraints. Problems are: Problem set: 6 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/933 variables, 0/556 constraints. Problems are: Problem set: 6 solved, 13 unsolved
At refinement iteration 12 (OVERLAPS) 0/933 variables, 0/556 constraints. Problems are: Problem set: 6 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 933/933 variables, and 556 constraints, problems are : Problem set: 6 solved, 13 unsolved in 3294 ms.
Refiners :[State Equation: 478/478 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 12/16 variables, 4/4 constraints. Problems are: Problem set: 6 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/4 constraints. Problems are: Problem set: 6 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 217/233 variables, 53/57 constraints. Problems are: Problem set: 6 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 5/62 constraints. Problems are: Problem set: 6 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 13/75 constraints. Problems are: Problem set: 6 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 0/75 constraints. Problems are: Problem set: 6 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 538/771 variables, 287/362 constraints. Problems are: Problem set: 6 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/771 variables, 50/412 constraints. Problems are: Problem set: 6 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/771 variables, 0/412 constraints. Problems are: Problem set: 6 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 162/933 variables, 134/546 constraints. Problems are: Problem set: 6 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/933 variables, 23/569 constraints. Problems are: Problem set: 6 solved, 13 unsolved
[2024-05-22 13:10:30] [INFO ] Deduced a trap composed of 33 places in 94 ms of which 2 ms to minimize.
[2024-05-22 13:10:31] [INFO ] Deduced a trap composed of 36 places in 108 ms of which 1 ms to minimize.
[2024-05-22 13:10:31] [INFO ] Deduced a trap composed of 30 places in 100 ms of which 2 ms to minimize.
[2024-05-22 13:10:31] [INFO ] Deduced a trap composed of 34 places in 105 ms of which 2 ms to minimize.
[2024-05-22 13:10:31] [INFO ] Deduced a trap composed of 29 places in 112 ms of which 2 ms to minimize.
[2024-05-22 13:10:31] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 2 ms to minimize.
[2024-05-22 13:10:31] [INFO ] Deduced a trap composed of 26 places in 103 ms of which 2 ms to minimize.
[2024-05-22 13:10:31] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 2 ms to minimize.
[2024-05-22 13:10:31] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 2 ms to minimize.
[2024-05-22 13:10:32] [INFO ] Deduced a trap composed of 22 places in 118 ms of which 2 ms to minimize.
[2024-05-22 13:10:32] [INFO ] Deduced a trap composed of 19 places in 119 ms of which 2 ms to minimize.
[2024-05-22 13:10:32] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 2 ms to minimize.
[2024-05-22 13:10:32] [INFO ] Deduced a trap composed of 17 places in 127 ms of which 2 ms to minimize.
[2024-05-22 13:10:32] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 2 ms to minimize.
[2024-05-22 13:10:32] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/933 variables, 15/584 constraints. Problems are: Problem set: 6 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/933 variables, 0/584 constraints. Problems are: Problem set: 6 solved, 13 unsolved
At refinement iteration 14 (OVERLAPS) 0/933 variables, 0/584 constraints. Problems are: Problem set: 6 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 933/933 variables, and 584 constraints, problems are : Problem set: 6 solved, 13 unsolved in 5556 ms.
Refiners :[State Equation: 478/478 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 13/19 constraints, Known Traps: 15/15 constraints]
After SMT, in 8904ms problems are : Problem set: 6 solved, 13 unsolved
Fused 13 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 30001 ms.
Support contains 4 out of 478 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 478/478 places, 455/455 transitions.
Applied a total of 0 rules in 8 ms. Remains 478 /478 variables (removed 0) and now considering 455/455 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 478/478 places, 455/455 transitions.
RANDOM walk for 40000 steps (5096 resets) in 922 ms. (43 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (3382 resets) in 517 ms. (77 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (3371 resets) in 540 ms. (73 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (3366 resets) in 550 ms. (72 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (3387 resets) in 538 ms. (74 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (3376 resets) in 521 ms. (76 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (3407 resets) in 645 ms. (61 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (3422 resets) in 379 ms. (105 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (3421 resets) in 608 ms. (65 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (3381 resets) in 401 ms. (99 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (3435 resets) in 417 ms. (95 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (3420 resets) in 535 ms. (74 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (3380 resets) in 402 ms. (99 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (3365 resets) in 514 ms. (77 steps per ms) remains 13/13 properties
Interrupted probabilistic random walk after 174817 steps, run timeout after 6001 ms. (steps per millisecond=29 ) properties seen :0 out of 13
Probabilistic random walk after 174817 steps, saw 87435 distinct states, run finished after 6001 ms. (steps per millisecond=29 ) properties seen :0
// Phase 1: matrix 455 rows 478 cols
[2024-05-22 13:11:13] [INFO ] Invariants computation overflowed in 47 ms
[2024-05-22 13:11:13] [INFO ] State equation strengthened by 78 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 12/16 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 217/233 variables, 53/57 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 5/62 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 13 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 538/771 variables, 287/349 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/771 variables, 50/399 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/771 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 162/933 variables, 134/533 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/933 variables, 23/556 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/933 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (OVERLAPS) 0/933 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 933/933 variables, and 556 constraints, problems are : Problem set: 0 solved, 13 unsolved in 4527 ms.
Refiners :[State Equation: 478/478 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 12/16 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 217/233 variables, 53/57 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 5/62 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 13/75 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 538/771 variables, 287/362 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/771 variables, 50/412 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/771 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 162/933 variables, 134/546 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/933 variables, 23/569 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 13:11:19] [INFO ] Deduced a trap composed of 33 places in 91 ms of which 2 ms to minimize.
[2024-05-22 13:11:20] [INFO ] Deduced a trap composed of 36 places in 105 ms of which 1 ms to minimize.
[2024-05-22 13:11:20] [INFO ] Deduced a trap composed of 30 places in 96 ms of which 2 ms to minimize.
[2024-05-22 13:11:20] [INFO ] Deduced a trap composed of 34 places in 108 ms of which 1 ms to minimize.
[2024-05-22 13:11:20] [INFO ] Deduced a trap composed of 29 places in 104 ms of which 2 ms to minimize.
[2024-05-22 13:11:20] [INFO ] Deduced a trap composed of 24 places in 114 ms of which 2 ms to minimize.
[2024-05-22 13:11:20] [INFO ] Deduced a trap composed of 26 places in 110 ms of which 2 ms to minimize.
[2024-05-22 13:11:20] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 2 ms to minimize.
[2024-05-22 13:11:20] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 2 ms to minimize.
[2024-05-22 13:11:21] [INFO ] Deduced a trap composed of 22 places in 107 ms of which 2 ms to minimize.
[2024-05-22 13:11:21] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 2 ms to minimize.
[2024-05-22 13:11:21] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 2 ms to minimize.
[2024-05-22 13:11:21] [INFO ] Deduced a trap composed of 17 places in 128 ms of which 3 ms to minimize.
[2024-05-22 13:11:21] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 2 ms to minimize.
[2024-05-22 13:11:21] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/933 variables, 15/584 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/933 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (OVERLAPS) 0/933 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 933/933 variables, and 584 constraints, problems are : Problem set: 0 solved, 13 unsolved in 5217 ms.
Refiners :[State Equation: 478/478 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 15/15 constraints]
After SMT, in 9800ms problems are : Problem set: 0 solved, 13 unsolved
Fused 13 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 30000 ms.
Support contains 4 out of 478 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 478/478 places, 455/455 transitions.
Applied a total of 0 rules in 12 ms. Remains 478 /478 variables (removed 0) and now considering 455/455 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 478/478 places, 455/455 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 478/478 places, 455/455 transitions.
Applied a total of 0 rules in 8 ms. Remains 478 /478 variables (removed 0) and now considering 455/455 (removed 0) transitions.
// Phase 1: matrix 455 rows 478 cols
[2024-05-22 13:11:53] [INFO ] Invariants computation overflowed in 50 ms
[2024-05-22 13:11:53] [INFO ] Implicit Places using invariants in 388 ms returned []
// Phase 1: matrix 455 rows 478 cols
[2024-05-22 13:11:53] [INFO ] Invariants computation overflowed in 41 ms
[2024-05-22 13:11:53] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 13:12:04] [INFO ] Implicit Places using invariants and state equation in 10744 ms returned [42, 48, 68, 73, 122, 128, 149, 154, 155, 175, 180, 201, 207, 214, 228, 233, 256, 262, 284, 289, 310, 315, 336, 341, 362, 368, 389, 392, 396, 416, 422, 444, 449, 453, 470, 476]
[2024-05-22 13:12:04] [INFO ] Actually due to overlaps returned [128, 214, 122, 154]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 11138 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 474/478 places, 455/455 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 474 transition count 453
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 472 transition count 453
Applied a total of 4 rules in 25 ms. Remains 472 /474 variables (removed 2) and now considering 453/455 (removed 2) transitions.
// Phase 1: matrix 453 rows 472 cols
[2024-05-22 13:12:04] [INFO ] Invariants computation overflowed in 33 ms
[2024-05-22 13:12:04] [INFO ] Implicit Places using invariants in 358 ms returned []
// Phase 1: matrix 453 rows 472 cols
[2024-05-22 13:12:04] [INFO ] Invariants computation overflowed in 31 ms
[2024-05-22 13:12:04] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 13:12:14] [INFO ] Implicit Places using invariants and state equation in 9557 ms returned [42, 48, 68, 73, 146, 151, 171, 176, 197, 203, 222, 227, 250, 256, 278, 283, 304, 309, 330, 335, 356, 362, 383, 386, 390, 410, 416, 438, 443, 447, 464, 470]
[2024-05-22 13:12:14] [INFO ] Actually due to overlaps returned [151, 447, 146, 386]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 9919 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 468/478 places, 453/455 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 468 transition count 451
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 466 transition count 451
Applied a total of 4 rules in 19 ms. Remains 466 /468 variables (removed 2) and now considering 451/453 (removed 2) transitions.
// Phase 1: matrix 451 rows 466 cols
[2024-05-22 13:12:14] [INFO ] Invariants computation overflowed in 33 ms
[2024-05-22 13:12:14] [INFO ] Implicit Places using invariants in 341 ms returned []
// Phase 1: matrix 451 rows 466 cols
[2024-05-22 13:12:14] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-22 13:12:14] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 13:12:23] [INFO ] Implicit Places using invariants and state equation in 8734 ms returned [42, 48, 68, 73, 168, 173, 194, 200, 219, 224, 247, 253, 275, 280, 301, 306, 327, 332, 353, 359, 380, 386, 406, 412, 434, 439, 458, 464]
[2024-05-22 13:12:23] [INFO ] Actually due to overlaps returned [173, 48, 42, 168]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 9080 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 462/478 places, 451/455 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 462 transition count 449
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 460 transition count 449
Applied a total of 4 rules in 17 ms. Remains 460 /462 variables (removed 2) and now considering 449/451 (removed 2) transitions.
// Phase 1: matrix 449 rows 460 cols
[2024-05-22 13:12:23] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-22 13:12:23] [INFO ] Implicit Places using invariants in 314 ms returned []
// Phase 1: matrix 449 rows 460 cols
[2024-05-22 13:12:23] [INFO ] Invariants computation overflowed in 30 ms
[2024-05-22 13:12:23] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 13:12:36] [INFO ] Implicit Places using invariants and state equation in 12580 ms returned [65, 70, 188, 194, 213, 218, 241, 247, 269, 274, 295, 300, 321, 326, 347, 353, 374, 380, 400, 406, 428, 433, 452, 458]
[2024-05-22 13:12:36] [INFO ] Actually due to overlaps returned [194, 65, 188, 70]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 12896 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 456/478 places, 449/455 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 456 transition count 447
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 454 transition count 447
Applied a total of 4 rules in 16 ms. Remains 454 /456 variables (removed 2) and now considering 447/449 (removed 2) transitions.
// Phase 1: matrix 447 rows 454 cols
[2024-05-22 13:12:36] [INFO ] Invariants computation overflowed in 34 ms
[2024-05-22 13:12:36] [INFO ] Implicit Places using invariants in 313 ms returned []
// Phase 1: matrix 447 rows 454 cols
[2024-05-22 13:12:36] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-22 13:12:36] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 13:12:44] [INFO ] Implicit Places using invariants and state equation in 7731 ms returned [207, 212, 235, 241, 263, 268, 289, 294, 315, 320, 341, 347, 368, 374, 394, 400, 422, 427, 446, 452]
[2024-05-22 13:12:44] [INFO ] Actually due to overlaps returned [212, 207]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 8047 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 452/478 places, 447/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 452 transition count 446
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 451 transition count 446
Applied a total of 2 rules in 15 ms. Remains 451 /452 variables (removed 1) and now considering 446/447 (removed 1) transitions.
// Phase 1: matrix 446 rows 451 cols
[2024-05-22 13:12:44] [INFO ] Invariants computation overflowed in 24 ms
[2024-05-22 13:12:44] [INFO ] Implicit Places using invariants in 295 ms returned []
// Phase 1: matrix 446 rows 451 cols
[2024-05-22 13:12:44] [INFO ] Invariants computation overflowed in 23 ms
[2024-05-22 13:12:44] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 13:12:55] [INFO ] Implicit Places using invariants and state equation in 11073 ms returned [232, 238, 260, 265, 286, 291, 312, 317, 338, 344, 365, 371, 391, 397, 419, 424, 443, 449]
[2024-05-22 13:12:55] [INFO ] Actually due to overlaps returned [238, 232]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 11370 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 449/478 places, 446/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 449 transition count 445
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 448 transition count 445
Applied a total of 2 rules in 15 ms. Remains 448 /449 variables (removed 1) and now considering 445/446 (removed 1) transitions.
// Phase 1: matrix 445 rows 448 cols
[2024-05-22 13:12:55] [INFO ] Invariants computation overflowed in 44 ms
[2024-05-22 13:12:56] [INFO ] Implicit Places using invariants in 295 ms returned []
// Phase 1: matrix 445 rows 448 cols
[2024-05-22 13:12:56] [INFO ] Invariants computation overflowed in 29 ms
[2024-05-22 13:12:56] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 13:13:09] [INFO ] Implicit Places using invariants and state equation in 12953 ms returned [257, 262, 283, 288, 309, 314, 335, 341, 362, 368, 388, 394, 416, 421, 440, 446]
[2024-05-22 13:13:09] [INFO ] Actually due to overlaps returned [262, 257]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 13252 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 446/478 places, 445/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 446 transition count 444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 445 transition count 444
Applied a total of 2 rules in 20 ms. Remains 445 /446 variables (removed 1) and now considering 444/445 (removed 1) transitions.
// Phase 1: matrix 444 rows 445 cols
[2024-05-22 13:13:09] [INFO ] Invariants computation overflowed in 31 ms
[2024-05-22 13:13:09] [INFO ] Implicit Places using invariants in 299 ms returned []
// Phase 1: matrix 444 rows 445 cols
[2024-05-22 13:13:09] [INFO ] Invariants computation overflowed in 25 ms
[2024-05-22 13:13:09] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 13:13:14] [INFO ] Implicit Places using invariants and state equation in 5116 ms returned [280, 285, 306, 311, 332, 338, 359, 365, 385, 391, 413, 418, 437, 443]
[2024-05-22 13:13:14] [INFO ] Actually due to overlaps returned [285, 280]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 5417 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 443/478 places, 444/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 443 transition count 443
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 442 transition count 443
Applied a total of 2 rules in 18 ms. Remains 442 /443 variables (removed 1) and now considering 443/444 (removed 1) transitions.
// Phase 1: matrix 443 rows 442 cols
[2024-05-22 13:13:14] [INFO ] Computed 75 invariants in 45 ms
[2024-05-22 13:13:14] [INFO ] Implicit Places using invariants in 490 ms returned [303, 308, 329, 335, 356, 362, 382, 388, 410, 415, 434, 440]
[2024-05-22 13:13:14] [INFO ] Actually due to overlaps returned [308, 303]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 491 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 440/478 places, 443/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 440 transition count 442
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 439 transition count 442
Applied a total of 2 rules in 16 ms. Remains 439 /440 variables (removed 1) and now considering 442/443 (removed 1) transitions.
// Phase 1: matrix 442 rows 439 cols
[2024-05-22 13:13:15] [INFO ] Computed 73 invariants in 45 ms
[2024-05-22 13:13:15] [INFO ] Implicit Places using invariants in 471 ms returned [326, 332, 353, 359, 379, 385, 407, 412, 431, 437]
[2024-05-22 13:13:15] [INFO ] Actually due to overlaps returned [332, 326]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 472 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 10 : 437/478 places, 442/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 437 transition count 441
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 436 transition count 441
Applied a total of 2 rules in 14 ms. Remains 436 /437 variables (removed 1) and now considering 441/442 (removed 1) transitions.
// Phase 1: matrix 441 rows 436 cols
[2024-05-22 13:13:15] [INFO ] Computed 71 invariants in 58 ms
[2024-05-22 13:13:15] [INFO ] Implicit Places using invariants in 442 ms returned [350, 356, 376, 382, 404, 409, 428, 434]
[2024-05-22 13:13:15] [INFO ] Actually due to overlaps returned [356, 350]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 443 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 11 : 434/478 places, 441/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 434 transition count 440
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 433 transition count 440
Applied a total of 2 rules in 14 ms. Remains 433 /434 variables (removed 1) and now considering 440/441 (removed 1) transitions.
// Phase 1: matrix 440 rows 433 cols
[2024-05-22 13:13:15] [INFO ] Invariants computation overflowed in 39 ms
[2024-05-22 13:13:16] [INFO ] Implicit Places using invariants in 283 ms returned []
// Phase 1: matrix 440 rows 433 cols
[2024-05-22 13:13:16] [INFO ] Invariants computation overflowed in 36 ms
[2024-05-22 13:13:16] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 13:13:20] [INFO ] Implicit Places using invariants and state equation in 4474 ms returned [373, 379, 401, 406, 425, 431]
[2024-05-22 13:13:20] [INFO ] Actually due to overlaps returned [379, 373]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 4760 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 12 : 431/478 places, 440/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 431 transition count 439
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 430 transition count 439
Applied a total of 2 rules in 19 ms. Remains 430 /431 variables (removed 1) and now considering 439/440 (removed 1) transitions.
// Phase 1: matrix 439 rows 430 cols
[2024-05-22 13:13:20] [INFO ] Invariants computation overflowed in 37 ms
[2024-05-22 13:13:21] [INFO ] Implicit Places using invariants in 273 ms returned []
// Phase 1: matrix 439 rows 430 cols
[2024-05-22 13:13:21] [INFO ] Invariants computation overflowed in 31 ms
[2024-05-22 13:13:21] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 13:13:27] [INFO ] Implicit Places using invariants and state equation in 6457 ms returned [398, 403, 422, 428]
[2024-05-22 13:13:27] [INFO ] Actually due to overlaps returned [403, 398]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 6737 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 13 : 428/478 places, 439/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 428 transition count 438
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 427 transition count 438
Applied a total of 2 rules in 15 ms. Remains 427 /428 variables (removed 1) and now considering 438/439 (removed 1) transitions.
// Phase 1: matrix 438 rows 427 cols
[2024-05-22 13:13:27] [INFO ] Computed 65 invariants in 43 ms
[2024-05-22 13:13:27] [INFO ] Implicit Places using invariants in 384 ms returned [419, 425]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 385 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 14 : 425/478 places, 438/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 425 transition count 437
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 424 transition count 437
Applied a total of 2 rules in 15 ms. Remains 424 /425 variables (removed 1) and now considering 437/438 (removed 1) transitions.
// Phase 1: matrix 437 rows 424 cols
[2024-05-22 13:13:27] [INFO ] Invariants computation overflowed in 34 ms
[2024-05-22 13:13:28] [INFO ] Implicit Places using invariants in 262 ms returned []
// Phase 1: matrix 437 rows 424 cols
[2024-05-22 13:13:28] [INFO ] Invariants computation overflowed in 33 ms
[2024-05-22 13:13:28] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 13:13:34] [INFO ] Implicit Places using invariants and state equation in 6523 ms returned []
Implicit Place search using SMT with State Equation took 6789 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 15 : 424/478 places, 437/455 transitions.
Finished structural reductions in REACHABILITY mode , in 15 iterations and 101450 ms. Remains : 424/478 places, 437/455 transitions.
Found 6 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (OR (NOT p0) p1)), (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (OR (NOT p0) p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1 p2)))), (G (OR (NOT p0) (NOT p2) (NOT p1))), (G (OR p0 (NOT p2) (NOT p1))), (G (OR (NOT p2) (NOT p1))), (G (OR (NOT p0) (NOT p2) p1)), (G (OR (NOT p0) p2 (NOT p1))), (G (OR (NOT p0) (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 31 factoid took 600 ms. Reduced automaton from 8 states, 44 edges and 3 AP (stutter sensitive) to 7 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 343 ms :[p2, p2, (AND p1 p2), (AND p0 p2 p1), (AND p0 p2 p1), (AND p0 p2), (AND p0 p2)]
Stuttering acceptance computed with spot in 305 ms :[p2, p2, (AND p1 p2), (AND p0 p2 p1), (AND p0 p2 p1), (AND p0 p2), (AND p0 p2)]
Support contains 4 out of 1057 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Applied a total of 0 rules in 29 ms. Remains 1057 /1057 variables (removed 0) and now considering 997/997 (removed 0) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2024-05-22 13:13:36] [INFO ] Invariants computation overflowed in 106 ms
[2024-05-22 13:13:36] [INFO ] Implicit Places using invariants in 395 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2024-05-22 13:13:36] [INFO ] Invariants computation overflowed in 104 ms
[2024-05-22 13:13:50] [INFO ] Implicit Places using invariants and state equation in 14448 ms returned []
Implicit Place search using SMT with State Equation took 14844 ms to find 0 implicit places.
Running 996 sub problems to find dead transitions.
// Phase 1: matrix 997 rows 1057 cols
[2024-05-22 13:13:50] [INFO ] Invariants computation overflowed in 106 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1056 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 996 unsolved
At refinement iteration 1 (OVERLAPS) 997/2053 variables, 1056/1056 constraints. Problems are: Problem set: 0 solved, 996 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2053/2054 variables, and 1056 constraints, problems are : Problem set: 0 solved, 996 unsolved in 30028 ms.
Refiners :[State Equation: 1056/1057 constraints, PredecessorRefiner: 996/996 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 996 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1056 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 996 unsolved
At refinement iteration 1 (OVERLAPS) 997/2053 variables, 1056/1056 constraints. Problems are: Problem set: 0 solved, 996 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2053 variables, 996/2052 constraints. Problems are: Problem set: 0 solved, 996 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2053/2054 variables, and 2052 constraints, problems are : Problem set: 0 solved, 996 unsolved in 30030 ms.
Refiners :[State Equation: 1056/1057 constraints, PredecessorRefiner: 996/996 constraints, Known Traps: 0/0 constraints]
After SMT, in 60316ms problems are : Problem set: 0 solved, 996 unsolved
Search for dead transitions found 0 dead transitions in 60333ms
Finished structural reductions in LTL mode , in 1 iterations and 75209 ms. Remains : 1057/1057 places, 997/997 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 1805 edges and 1057 vertex of which 1055 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 606 ms. Reduced automaton from 7 states, 25 edges and 3 AP (stutter sensitive) to 7 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 327 ms :[p2, p2, (AND p1 p2), (AND p0 p2 p1), (AND p0 p2 p1), (AND p0 p2), (AND p0 p2)]
RANDOM walk for 40000 steps (1324 resets) in 687 ms. (58 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (1124 resets) in 387 ms. (103 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (1122 resets) in 713 ms. (56 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (1133 resets) in 609 ms. (65 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (1141 resets) in 567 ms. (70 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (1147 resets) in 593 ms. (67 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (1134 resets) in 352 ms. (113 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 156112 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :0 out of 6
Probabilistic random walk after 156112 steps, saw 78069 distinct states, run finished after 3001 ms. (steps per millisecond=52 ) properties seen :0
// Phase 1: matrix 997 rows 1057 cols
[2024-05-22 13:14:56] [INFO ] Invariants computation overflowed in 103 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) 9/13 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 45/58 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 125/183 variables, 49/69 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 215/398 variables, 105/174 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 274/672 variables, 128/302 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/672 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 282/954 variables, 161/463 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/954 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 199/1153 variables, 106/569 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1153 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 190/1343 variables, 99/668 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1343 variables, 0/668 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 181/1524 variables, 89/757 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1524 variables, 0/757 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 212/1736 variables, 112/869 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1736 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 137/1873 variables, 82/951 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1873 variables, 0/951 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 98/1971 variables, 52/1003 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1971 variables, 0/1003 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (OVERLAPS) 65/2036 variables, 41/1044 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2036 variables, 0/1044 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (OVERLAPS) 13/2049 variables, 10/1054 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 13:14:59] [INFO ] Deduced a trap composed of 121 places in 242 ms of which 5 ms to minimize.
[2024-05-22 13:14:59] [INFO ] Deduced a trap composed of 115 places in 237 ms of which 7 ms to minimize.
[2024-05-22 13:14:59] [INFO ] Deduced a trap composed of 101 places in 239 ms of which 4 ms to minimize.
[2024-05-22 13:14:59] [INFO ] Deduced a trap composed of 127 places in 232 ms of which 4 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/2049 variables, 4/1058 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2049 variables, 0/1058 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 30 (OVERLAPS) 4/2053 variables, 2/1060 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2053 variables, 0/1060 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 32 (OVERLAPS) 1/2054 variables, 1/1061 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 13:15:01] [INFO ] Deduced a trap composed of 137 places in 215 ms of which 4 ms to minimize.
[2024-05-22 13:15:02] [INFO ] Deduced a trap composed of 139 places in 241 ms of which 4 ms to minimize.
SMT process timed out in 5319ms, After SMT, problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 1057 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1055 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 0 with 240 rules applied. Total rules applied 241 place count 1055 transition count 756
Reduce places removed 239 places and 0 transitions.
Iterating post reduction 1 with 239 rules applied. Total rules applied 480 place count 816 transition count 756
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 480 place count 816 transition count 716
Deduced a syphon composed of 40 places in 7 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 560 place count 776 transition count 716
Performed 182 Post agglomeration using F-continuation condition.Transition count delta: 182
Deduced a syphon composed of 182 places in 3 ms
Reduce places removed 182 places and 0 transitions.
Iterating global reduction 2 with 364 rules applied. Total rules applied 924 place count 594 transition count 534
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 37 places in 2 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 998 place count 557 transition count 534
Free-agglomeration rule (complex) applied 78 times.
Iterating global reduction 2 with 78 rules applied. Total rules applied 1076 place count 557 transition count 456
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 2 with 78 rules applied. Total rules applied 1154 place count 479 transition count 456
Partial Free-agglomeration rule applied 81 times.
Drop transitions (Partial Free agglomeration) removed 81 transitions
Iterating global reduction 3 with 81 rules applied. Total rules applied 1235 place count 479 transition count 456
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1236 place count 478 transition count 455
Applied a total of 1236 rules in 83 ms. Remains 478 /1057 variables (removed 579) and now considering 455/997 (removed 542) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 478/1057 places, 455/997 transitions.
RANDOM walk for 40000 steps (5140 resets) in 548 ms. (72 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (3412 resets) in 309 ms. (129 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (3376 resets) in 388 ms. (102 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (3366 resets) in 402 ms. (99 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (3411 resets) in 494 ms. (80 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (3410 resets) in 451 ms. (88 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (3353 resets) in 522 ms. (76 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 168456 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :0 out of 6
Probabilistic random walk after 168456 steps, saw 84254 distinct states, run finished after 3001 ms. (steps per millisecond=56 ) properties seen :0
// Phase 1: matrix 455 rows 478 cols
[2024-05-22 13:15:06] [INFO ] Invariants computation overflowed in 44 ms
[2024-05-22 13:15:06] [INFO ] State equation strengthened by 78 read => feed constraints.
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) 12/16 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 217/233 variables, 53/57 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 5/62 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 538/771 variables, 287/349 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/771 variables, 50/399 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/771 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 162/933 variables, 134/533 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/933 variables, 23/556 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/933 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/933 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 933/933 variables, and 556 constraints, problems are : Problem set: 0 solved, 6 unsolved in 6476 ms.
Refiners :[State Equation: 478/478 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
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) 12/16 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 217/233 variables, 53/57 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 5/62 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 6/68 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 538/771 variables, 287/355 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/771 variables, 50/405 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/771 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 162/933 variables, 134/539 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/933 variables, 23/562 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 13:15:14] [INFO ] Deduced a trap composed of 36 places in 105 ms of which 2 ms to minimize.
[2024-05-22 13:15:14] [INFO ] Deduced a trap composed of 38 places in 100 ms of which 1 ms to minimize.
[2024-05-22 13:15:15] [INFO ] Deduced a trap composed of 37 places in 108 ms of which 2 ms to minimize.
[2024-05-22 13:15:15] [INFO ] Deduced a trap composed of 35 places in 106 ms of which 2 ms to minimize.
[2024-05-22 13:15:15] [INFO ] Deduced a trap composed of 30 places in 110 ms of which 2 ms to minimize.
[2024-05-22 13:15:15] [INFO ] Deduced a trap composed of 31 places in 111 ms of which 2 ms to minimize.
[2024-05-22 13:15:15] [INFO ] Deduced a trap composed of 24 places in 120 ms of which 2 ms to minimize.
[2024-05-22 13:15:15] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 1 ms to minimize.
[2024-05-22 13:15:15] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 2 ms to minimize.
[2024-05-22 13:15:15] [INFO ] Deduced a trap composed of 21 places in 119 ms of which 2 ms to minimize.
[2024-05-22 13:15:16] [INFO ] Deduced a trap composed of 22 places in 119 ms of which 2 ms to minimize.
[2024-05-22 13:15:16] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 2 ms to minimize.
[2024-05-22 13:15:16] [INFO ] Deduced a trap composed of 17 places in 124 ms of which 2 ms to minimize.
[2024-05-22 13:15:16] [INFO ] Deduced a trap composed of 16 places in 130 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/933 variables, 14/576 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/933 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/933 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 933/933 variables, and 576 constraints, problems are : Problem set: 0 solved, 6 unsolved in 4521 ms.
Refiners :[State Equation: 478/478 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 14/14 constraints]
After SMT, in 11053ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 30000 ms.
Support contains 4 out of 478 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 478/478 places, 455/455 transitions.
Applied a total of 0 rules in 8 ms. Remains 478 /478 variables (removed 0) and now considering 455/455 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 478/478 places, 455/455 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 478/478 places, 455/455 transitions.
Applied a total of 0 rules in 8 ms. Remains 478 /478 variables (removed 0) and now considering 455/455 (removed 0) transitions.
// Phase 1: matrix 455 rows 478 cols
[2024-05-22 13:15:47] [INFO ] Invariants computation overflowed in 43 ms
[2024-05-22 13:15:47] [INFO ] Implicit Places using invariants in 382 ms returned []
// Phase 1: matrix 455 rows 478 cols
[2024-05-22 13:15:47] [INFO ] Invariants computation overflowed in 46 ms
[2024-05-22 13:15:48] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 13:15:58] [INFO ] Implicit Places using invariants and state equation in 10989 ms returned [42, 48, 68, 73, 122, 128, 149, 154, 155, 175, 180, 201, 207, 214, 228, 233, 256, 262, 284, 289, 310, 315, 336, 341, 362, 368, 389, 392, 396, 416, 422, 444, 449, 453, 470, 476]
[2024-05-22 13:15:58] [INFO ] Actually due to overlaps returned [128, 214, 122, 154]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 11375 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 474/478 places, 455/455 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 474 transition count 453
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 472 transition count 453
Applied a total of 4 rules in 22 ms. Remains 472 /474 variables (removed 2) and now considering 453/455 (removed 2) transitions.
// Phase 1: matrix 453 rows 472 cols
[2024-05-22 13:15:58] [INFO ] Invariants computation overflowed in 35 ms
[2024-05-22 13:15:59] [INFO ] Implicit Places using invariants in 351 ms returned []
// Phase 1: matrix 453 rows 472 cols
[2024-05-22 13:15:59] [INFO ] Invariants computation overflowed in 30 ms
[2024-05-22 13:15:59] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 13:16:08] [INFO ] Implicit Places using invariants and state equation in 9733 ms returned [42, 48, 68, 73, 146, 151, 171, 176, 197, 203, 222, 227, 250, 256, 278, 283, 304, 309, 330, 335, 356, 362, 383, 386, 390, 410, 416, 438, 443, 447, 464, 470]
[2024-05-22 13:16:08] [INFO ] Actually due to overlaps returned [151, 447, 146, 386]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 10087 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 468/478 places, 453/455 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 468 transition count 451
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 466 transition count 451
Applied a total of 4 rules in 19 ms. Remains 466 /468 variables (removed 2) and now considering 451/453 (removed 2) transitions.
// Phase 1: matrix 451 rows 466 cols
[2024-05-22 13:16:08] [INFO ] Invariants computation overflowed in 36 ms
[2024-05-22 13:16:09] [INFO ] Implicit Places using invariants in 361 ms returned []
// Phase 1: matrix 451 rows 466 cols
[2024-05-22 13:16:09] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-22 13:16:09] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 13:16:18] [INFO ] Implicit Places using invariants and state equation in 9156 ms returned [42, 48, 68, 73, 168, 173, 194, 200, 219, 224, 247, 253, 275, 280, 301, 306, 327, 332, 353, 359, 380, 386, 406, 412, 434, 439, 458, 464]
[2024-05-22 13:16:18] [INFO ] Actually due to overlaps returned [173, 48, 42, 168]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 9520 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 462/478 places, 451/455 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 462 transition count 449
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 460 transition count 449
Applied a total of 4 rules in 23 ms. Remains 460 /462 variables (removed 2) and now considering 449/451 (removed 2) transitions.
// Phase 1: matrix 449 rows 460 cols
[2024-05-22 13:16:18] [INFO ] Invariants computation overflowed in 34 ms
[2024-05-22 13:16:18] [INFO ] Implicit Places using invariants in 326 ms returned []
// Phase 1: matrix 449 rows 460 cols
[2024-05-22 13:16:18] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-22 13:16:18] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 13:16:31] [INFO ] Implicit Places using invariants and state equation in 12955 ms returned [65, 70, 188, 194, 213, 218, 241, 247, 269, 274, 295, 300, 321, 326, 347, 353, 374, 380, 400, 406, 428, 433, 452, 458]
[2024-05-22 13:16:31] [INFO ] Actually due to overlaps returned [194, 65, 188, 70]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 13285 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 456/478 places, 449/455 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 456 transition count 447
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 454 transition count 447
Applied a total of 4 rules in 16 ms. Remains 454 /456 variables (removed 2) and now considering 447/449 (removed 2) transitions.
// Phase 1: matrix 447 rows 454 cols
[2024-05-22 13:16:31] [INFO ] Invariants computation overflowed in 30 ms
[2024-05-22 13:16:32] [INFO ] Implicit Places using invariants in 314 ms returned []
// Phase 1: matrix 447 rows 454 cols
[2024-05-22 13:16:32] [INFO ] Invariants computation overflowed in 30 ms
[2024-05-22 13:16:32] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 13:16:40] [INFO ] Implicit Places using invariants and state equation in 8457 ms returned [207, 212, 235, 241, 263, 268, 289, 294, 315, 320, 341, 347, 368, 374, 394, 400, 422, 427, 446, 452]
[2024-05-22 13:16:40] [INFO ] Actually due to overlaps returned [212, 207]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 8772 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 452/478 places, 447/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 452 transition count 446
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 451 transition count 446
Applied a total of 2 rules in 15 ms. Remains 451 /452 variables (removed 1) and now considering 446/447 (removed 1) transitions.
// Phase 1: matrix 446 rows 451 cols
[2024-05-22 13:16:40] [INFO ] Invariants computation overflowed in 30 ms
[2024-05-22 13:16:40] [INFO ] Implicit Places using invariants in 325 ms returned []
// Phase 1: matrix 446 rows 451 cols
[2024-05-22 13:16:40] [INFO ] Invariants computation overflowed in 23 ms
[2024-05-22 13:16:41] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 13:16:52] [INFO ] Implicit Places using invariants and state equation in 11740 ms returned [232, 238, 260, 265, 286, 291, 312, 317, 338, 344, 365, 371, 391, 397, 419, 424, 443, 449]
[2024-05-22 13:16:52] [INFO ] Actually due to overlaps returned [238, 232]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 12070 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 449/478 places, 446/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 449 transition count 445
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 448 transition count 445
Applied a total of 2 rules in 20 ms. Remains 448 /449 variables (removed 1) and now considering 445/446 (removed 1) transitions.
// Phase 1: matrix 445 rows 448 cols
[2024-05-22 13:16:52] [INFO ] Invariants computation overflowed in 33 ms
[2024-05-22 13:16:52] [INFO ] Implicit Places using invariants in 294 ms returned []
// Phase 1: matrix 445 rows 448 cols
[2024-05-22 13:16:52] [INFO ] Invariants computation overflowed in 31 ms
[2024-05-22 13:16:53] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 13:17:06] [INFO ] Implicit Places using invariants and state equation in 13424 ms returned [257, 262, 283, 288, 309, 314, 335, 341, 362, 368, 388, 394, 416, 421, 440, 446]
[2024-05-22 13:17:06] [INFO ] Actually due to overlaps returned [262, 257]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 13719 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 446/478 places, 445/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 446 transition count 444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 445 transition count 444
Applied a total of 2 rules in 14 ms. Remains 445 /446 variables (removed 1) and now considering 444/445 (removed 1) transitions.
// Phase 1: matrix 444 rows 445 cols
[2024-05-22 13:17:06] [INFO ] Invariants computation overflowed in 26 ms
[2024-05-22 13:17:06] [INFO ] Implicit Places using invariants in 300 ms returned []
// Phase 1: matrix 444 rows 445 cols
[2024-05-22 13:17:06] [INFO ] Invariants computation overflowed in 25 ms
[2024-05-22 13:17:06] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 13:17:11] [INFO ] Implicit Places using invariants and state equation in 5159 ms returned [280, 285, 306, 311, 332, 338, 359, 365, 385, 391, 413, 418, 437, 443]
[2024-05-22 13:17:11] [INFO ] Actually due to overlaps returned [285, 280]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 5462 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 443/478 places, 444/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 443 transition count 443
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 442 transition count 443
Applied a total of 2 rules in 23 ms. Remains 442 /443 variables (removed 1) and now considering 443/444 (removed 1) transitions.
// Phase 1: matrix 443 rows 442 cols
[2024-05-22 13:17:11] [INFO ] Computed 75 invariants in 44 ms
[2024-05-22 13:17:12] [INFO ] Implicit Places using invariants in 487 ms returned [303, 308, 329, 335, 356, 362, 382, 388, 410, 415, 434, 440]
[2024-05-22 13:17:12] [INFO ] Actually due to overlaps returned [308, 303]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 488 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 440/478 places, 443/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 440 transition count 442
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 439 transition count 442
Applied a total of 2 rules in 15 ms. Remains 439 /440 variables (removed 1) and now considering 442/443 (removed 1) transitions.
// Phase 1: matrix 442 rows 439 cols
[2024-05-22 13:17:12] [INFO ] Computed 73 invariants in 46 ms
[2024-05-22 13:17:12] [INFO ] Implicit Places using invariants in 466 ms returned [326, 332, 353, 359, 379, 385, 407, 412, 431, 437]
[2024-05-22 13:17:12] [INFO ] Actually due to overlaps returned [332, 326]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 467 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 10 : 437/478 places, 442/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 437 transition count 441
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 436 transition count 441
Applied a total of 2 rules in 15 ms. Remains 436 /437 variables (removed 1) and now considering 441/442 (removed 1) transitions.
// Phase 1: matrix 441 rows 436 cols
[2024-05-22 13:17:12] [INFO ] Computed 71 invariants in 56 ms
[2024-05-22 13:17:13] [INFO ] Implicit Places using invariants in 450 ms returned [350, 356, 376, 382, 404, 409, 428, 434]
[2024-05-22 13:17:13] [INFO ] Actually due to overlaps returned [356, 350]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 451 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 11 : 434/478 places, 441/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 434 transition count 440
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 433 transition count 440
Applied a total of 2 rules in 14 ms. Remains 433 /434 variables (removed 1) and now considering 440/441 (removed 1) transitions.
// Phase 1: matrix 440 rows 433 cols
[2024-05-22 13:17:13] [INFO ] Invariants computation overflowed in 41 ms
[2024-05-22 13:17:13] [INFO ] Implicit Places using invariants in 275 ms returned []
// Phase 1: matrix 440 rows 433 cols
[2024-05-22 13:17:13] [INFO ] Invariants computation overflowed in 35 ms
[2024-05-22 13:17:13] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 13:17:17] [INFO ] Implicit Places using invariants and state equation in 4416 ms returned [373, 379, 401, 406, 425, 431]
[2024-05-22 13:17:17] [INFO ] Actually due to overlaps returned [379, 373]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 4692 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 12 : 431/478 places, 440/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 431 transition count 439
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 430 transition count 439
Applied a total of 2 rules in 14 ms. Remains 430 /431 variables (removed 1) and now considering 439/440 (removed 1) transitions.
// Phase 1: matrix 439 rows 430 cols
[2024-05-22 13:17:18] [INFO ] Invariants computation overflowed in 30 ms
[2024-05-22 13:17:18] [INFO ] Implicit Places using invariants in 263 ms returned []
// Phase 1: matrix 439 rows 430 cols
[2024-05-22 13:17:18] [INFO ] Invariants computation overflowed in 30 ms
[2024-05-22 13:17:18] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 13:17:24] [INFO ] Implicit Places using invariants and state equation in 6504 ms returned [398, 403, 422, 428]
[2024-05-22 13:17:24] [INFO ] Actually due to overlaps returned [403, 398]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 6769 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 13 : 428/478 places, 439/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 428 transition count 438
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 427 transition count 438
Applied a total of 2 rules in 19 ms. Remains 427 /428 variables (removed 1) and now considering 438/439 (removed 1) transitions.
// Phase 1: matrix 438 rows 427 cols
[2024-05-22 13:17:24] [INFO ] Computed 65 invariants in 37 ms
[2024-05-22 13:17:25] [INFO ] Implicit Places using invariants in 373 ms returned [419, 425]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 374 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 14 : 425/478 places, 438/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 425 transition count 437
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 424 transition count 437
Applied a total of 2 rules in 14 ms. Remains 424 /425 variables (removed 1) and now considering 437/438 (removed 1) transitions.
// Phase 1: matrix 437 rows 424 cols
[2024-05-22 13:17:25] [INFO ] Invariants computation overflowed in 34 ms
[2024-05-22 13:17:25] [INFO ] Implicit Places using invariants in 264 ms returned []
// Phase 1: matrix 437 rows 424 cols
[2024-05-22 13:17:25] [INFO ] Invariants computation overflowed in 34 ms
[2024-05-22 13:17:25] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 13:17:32] [INFO ] Implicit Places using invariants and state equation in 6579 ms returned []
Implicit Place search using SMT with State Equation took 6844 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 15 : 424/478 places, 437/455 transitions.
Finished structural reductions in REACHABILITY mode , in 15 iterations and 104629 ms. Remains : 424/478 places, 437/455 transitions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 617 ms. Reduced automaton from 7 states, 25 edges and 3 AP (stutter sensitive) to 7 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 273 ms :[p2, p2, (AND p1 p2), (AND p0 p2 p1), (AND p0 p2 p1), (AND p0 p2), (AND p0 p2)]
Stuttering acceptance computed with spot in 300 ms :[p2, p2, (AND p1 p2), (AND p0 p2 p1), (AND p0 p2 p1), (AND p0 p2), (AND p0 p2)]
Stuttering acceptance computed with spot in 319 ms :[p2, p2, (AND p1 p2), (AND p0 p2 p1), (AND p0 p2 p1), (AND p0 p2), (AND p0 p2)]
Product exploration explored 100000 steps with 33284 reset in 215 ms.
Product exploration explored 100000 steps with 33170 reset in 220 ms.
Support contains 4 out of 1057 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Applied a total of 0 rules in 34 ms. Remains 1057 /1057 variables (removed 0) and now considering 997/997 (removed 0) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2024-05-22 13:17:35] [INFO ] Invariants computation overflowed in 117 ms
[2024-05-22 13:17:35] [INFO ] Implicit Places using invariants in 407 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2024-05-22 13:17:35] [INFO ] Invariants computation overflowed in 99 ms
[2024-05-22 13:17:49] [INFO ] Implicit Places using invariants and state equation in 14186 ms returned []
Implicit Place search using SMT with State Equation took 14593 ms to find 0 implicit places.
Running 996 sub problems to find dead transitions.
// Phase 1: matrix 997 rows 1057 cols
[2024-05-22 13:17:49] [INFO ] Invariants computation overflowed in 111 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1056 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 996 unsolved
At refinement iteration 1 (OVERLAPS) 997/2053 variables, 1056/1056 constraints. Problems are: Problem set: 0 solved, 996 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2053/2054 variables, and 1056 constraints, problems are : Problem set: 0 solved, 996 unsolved in 30033 ms.
Refiners :[State Equation: 1056/1057 constraints, PredecessorRefiner: 996/996 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 996 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1056 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 996 unsolved
At refinement iteration 1 (OVERLAPS) 997/2053 variables, 1056/1056 constraints. Problems are: Problem set: 0 solved, 996 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2053 variables, 996/2052 constraints. Problems are: Problem set: 0 solved, 996 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2053/2054 variables, and 2052 constraints, problems are : Problem set: 0 solved, 996 unsolved in 30032 ms.
Refiners :[State Equation: 1056/1057 constraints, PredecessorRefiner: 996/996 constraints, Known Traps: 0/0 constraints]
After SMT, in 60317ms problems are : Problem set: 0 solved, 996 unsolved
Search for dead transitions found 0 dead transitions in 60325ms
Finished structural reductions in LTL mode , in 1 iterations and 74954 ms. Remains : 1057/1057 places, 997/997 transitions.
Treatment of property DoubleExponent-PT-020-LTLFireability-08 finished in 593613 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0&&F((!p1 U (p2||G(!p1)))))))'
Support contains 4 out of 1057 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1056 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 237 transitions
Trivial Post-agglo rules discarded 237 transitions
Performed 237 trivial Post agglomeration. Transition count delta: 237
Iterating post reduction 0 with 237 rules applied. Total rules applied 238 place count 1055 transition count 758
Reduce places removed 237 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 238 rules applied. Total rules applied 476 place count 818 transition count 757
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 477 place count 817 transition count 757
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 477 place count 817 transition count 717
Deduced a syphon composed of 40 places in 6 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 557 place count 777 transition count 717
Performed 181 Post agglomeration using F-continuation condition.Transition count delta: 181
Deduced a syphon composed of 181 places in 3 ms
Reduce places removed 181 places and 0 transitions.
Iterating global reduction 3 with 362 rules applied. Total rules applied 919 place count 596 transition count 536
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 38 places in 2 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 995 place count 558 transition count 536
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 996 place count 557 transition count 535
Applied a total of 996 rules in 64 ms. Remains 557 /1057 variables (removed 500) and now considering 535/997 (removed 462) transitions.
// Phase 1: matrix 535 rows 557 cols
[2024-05-22 13:18:50] [INFO ] Computed 99 invariants in 61 ms
[2024-05-22 13:18:50] [INFO ] Implicit Places using invariants in 334 ms returned []
[2024-05-22 13:18:50] [INFO ] Invariant cache hit.
[2024-05-22 13:18:50] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-22 13:18:57] [INFO ] Implicit Places using invariants and state equation in 6986 ms returned []
Implicit Place search using SMT with State Equation took 7321 ms to find 0 implicit places.
[2024-05-22 13:18:57] [INFO ] Redundant transitions in 6 ms returned []
Running 534 sub problems to find dead transitions.
[2024-05-22 13:18:57] [INFO ] Invariant cache hit.
[2024-05-22 13:18:57] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/556 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/556 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/556 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 3 (OVERLAPS) 535/1091 variables, 556/655 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1091 variables, 37/692 constraints. Problems are: Problem set: 0 solved, 534 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1091/1092 variables, and 692 constraints, problems are : Problem set: 0 solved, 534 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 556/557 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 534/534 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 534 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/556 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/556 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/556 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 3 (OVERLAPS) 535/1091 variables, 556/655 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1091 variables, 37/692 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1091 variables, 531/1223 constraints. Problems are: Problem set: 0 solved, 534 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1091/1092 variables, and 1223 constraints, problems are : Problem set: 0 solved, 534 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 556/557 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 531/534 constraints, Known Traps: 0/0 constraints]
After SMT, in 60114ms problems are : Problem set: 0 solved, 534 unsolved
Search for dead transitions found 0 dead transitions in 60120ms
Starting structural reductions in SI_LTL mode, iteration 1 : 557/1057 places, 535/997 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 67517 ms. Remains : 557/1057 places, 535/997 transitions.
Stuttering acceptance computed with spot in 93 ms :[(OR (NOT p0) (AND p1 (NOT p2))), true, (AND (NOT p2) p1)]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-10
Product exploration explored 100000 steps with 13905 reset in 116 ms.
Product exploration explored 100000 steps with 13857 reset in 131 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1738 edges and 557 vertex of which 556 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) p1))), (X p0), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p0)), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 117 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(OR (NOT p0) (AND p1 (NOT p2))), true, (AND p1 (NOT p2))]
RANDOM walk for 40000 steps (5580 resets) in 630 ms. (63 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (3260 resets) in 400 ms. (99 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (3215 resets) in 476 ms. (83 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (3219 resets) in 501 ms. (79 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (3245 resets) in 392 ms. (101 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (3258 resets) in 582 ms. (68 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (3273 resets) in 137 ms. (289 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 136569 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :0 out of 6
Probabilistic random walk after 136569 steps, saw 68316 distinct states, run finished after 3001 ms. (steps per millisecond=45 ) properties seen :0
[2024-05-22 13:20:02] [INFO ] Invariant cache hit.
[2024-05-22 13:20:02] [INFO ] State equation strengthened by 37 read => feed constraints.
All remaining problems are real, not stopping.
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) 135/139 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 200/339 variables, 50/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/339 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 71/410 variables, 22/78 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/410 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 19/429 variables, 3/81 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/429 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 57/486 variables, 8/89 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/486 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 14/500 variables, 6/95 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/500 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 525/1025 variables, 500/595 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1025 variables, 35/630 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1025 variables, 0/630 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 61/1086 variables, 52/682 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1086 variables, 2/684 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1086 variables, 1/685 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1086 variables, 0/685 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 2/1088 variables, 2/687 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1088 variables, 2/689 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1088 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 4/1092 variables, 3/692 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1092 variables, 1/693 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1092 variables, 0/693 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (OVERLAPS) 0/1092 variables, 0/693 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1092/1092 variables, and 693 constraints, problems are : Problem set: 0 solved, 6 unsolved in 3809 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 557/557 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
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) 135/139 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 200/339 variables, 50/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/339 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 71/410 variables, 22/78 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/410 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 19/429 variables, 3/81 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/429 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 57/486 variables, 8/89 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/486 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 14/500 variables, 6/95 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/500 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 525/1025 variables, 500/595 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1025 variables, 35/630 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1025 variables, 1/631 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 13:20:06] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1025 variables, 1/632 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1025 variables, 0/632 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 61/1086 variables, 52/684 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1086 variables, 2/686 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1086 variables, 1/687 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1086 variables, 5/692 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 13:20:10] [INFO ] Deduced a trap composed of 26 places in 135 ms of which 3 ms to minimize.
[2024-05-22 13:20:10] [INFO ] Deduced a trap composed of 28 places in 126 ms of which 2 ms to minimize.
[2024-05-22 13:20:10] [INFO ] Deduced a trap composed of 33 places in 137 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1086 variables, 3/695 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1086 variables, 0/695 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (OVERLAPS) 2/1088 variables, 2/697 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1088 variables, 2/699 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1088 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (OVERLAPS) 4/1092 variables, 3/702 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1092 variables, 1/703 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1092 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 30 (OVERLAPS) 0/1092 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1092/1092 variables, and 703 constraints, problems are : Problem set: 0 solved, 6 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 557/557 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 4/4 constraints]
After SMT, in 8823ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 6917 ms.
Support contains 4 out of 557 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 557/557 places, 535/535 transitions.
Graph (complete) has 1660 edges and 557 vertex of which 556 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 556 transition count 534
Free-agglomeration rule (complex) applied 79 times.
Iterating global reduction 1 with 79 rules applied. Total rules applied 81 place count 556 transition count 455
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 160 place count 477 transition count 455
Partial Free-agglomeration rule applied 82 times.
Drop transitions (Partial Free agglomeration) removed 82 transitions
Iterating global reduction 2 with 82 rules applied. Total rules applied 242 place count 477 transition count 455
Applied a total of 242 rules in 31 ms. Remains 477 /557 variables (removed 80) and now considering 455/535 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 477/557 places, 455/535 transitions.
RANDOM walk for 40000 steps (5058 resets) in 519 ms. (76 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (3354 resets) in 435 ms. (91 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (3347 resets) in 253 ms. (157 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (3399 resets) in 398 ms. (100 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (3405 resets) in 505 ms. (79 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (3345 resets) in 504 ms. (79 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (3389 resets) in 658 ms. (60 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 181244 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :0 out of 6
Probabilistic random walk after 181244 steps, saw 90660 distinct states, run finished after 3001 ms. (steps per millisecond=60 ) properties seen :0
// Phase 1: matrix 455 rows 477 cols
[2024-05-22 13:20:22] [INFO ] Invariants computation overflowed in 31 ms
[2024-05-22 13:20:22] [INFO ] State equation strengthened by 78 read => feed constraints.
All remaining problems are real, not stopping.
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) 14/18 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 186/204 variables, 37/41 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 7/48 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 499/703 variables, 255/303 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/703 variables, 44/347 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/703 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 229/932 variables, 181/528 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/932 variables, 27/555 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/932 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/932 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 932/932 variables, and 555 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1316 ms.
Refiners :[State Equation: 477/477 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
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) 14/18 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 186/204 variables, 37/41 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 7/48 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 499/703 variables, 255/304 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/703 variables, 44/348 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/703 variables, 5/353 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/703 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 229/932 variables, 181/534 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/932 variables, 27/561 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/932 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/932 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 932/932 variables, and 561 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1740 ms.
Refiners :[State Equation: 477/477 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 3099ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 12127 ms.
Support contains 4 out of 477 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 477/477 places, 455/455 transitions.
Applied a total of 0 rules in 12 ms. Remains 477 /477 variables (removed 0) and now considering 455/455 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 477/477 places, 455/455 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 477/477 places, 455/455 transitions.
Applied a total of 0 rules in 9 ms. Remains 477 /477 variables (removed 0) and now considering 455/455 (removed 0) transitions.
// Phase 1: matrix 455 rows 477 cols
[2024-05-22 13:20:37] [INFO ] Invariants computation overflowed in 34 ms
[2024-05-22 13:20:38] [INFO ] Implicit Places using invariants in 508 ms returned []
// Phase 1: matrix 455 rows 477 cols
[2024-05-22 13:20:38] [INFO ] Invariants computation overflowed in 29 ms
[2024-05-22 13:20:38] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 13:20:49] [INFO ] Implicit Places using invariants and state equation in 11515 ms returned [42, 48, 68, 73, 95, 100, 122, 128, 150, 155, 156, 176, 181, 202, 208, 215, 229, 234, 257, 263, 285, 290, 310, 315, 336, 341, 362, 368, 389, 391, 395, 415, 421, 443, 448, 452, 469, 475]
[2024-05-22 13:20:49] [INFO ] Actually due to overlaps returned [215, 155]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 12026 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 475/477 places, 455/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 475 transition count 454
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 474 transition count 454
Applied a total of 2 rules in 21 ms. Remains 474 /475 variables (removed 1) and now considering 454/455 (removed 1) transitions.
// Phase 1: matrix 454 rows 474 cols
[2024-05-22 13:20:49] [INFO ] Computed 97 invariants in 54 ms
[2024-05-22 13:20:51] [INFO ] Implicit Places using invariants in 1488 ms returned [42, 48, 68, 73, 95, 100, 122, 128, 150, 155, 175, 180, 201, 207, 226, 231, 254, 260, 282, 287, 307, 312, 333, 338, 359, 365, 386, 388, 392, 412, 418, 440, 445, 449, 466, 472]
[2024-05-22 13:20:51] [INFO ] Actually due to overlaps returned [449, 388]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1489 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 472/477 places, 454/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 472 transition count 453
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 471 transition count 453
Applied a total of 2 rules in 20 ms. Remains 471 /472 variables (removed 1) and now considering 453/454 (removed 1) transitions.
// Phase 1: matrix 453 rows 471 cols
[2024-05-22 13:20:51] [INFO ] Invariants computation overflowed in 32 ms
[2024-05-22 13:20:51] [INFO ] Implicit Places using invariants in 458 ms returned []
// Phase 1: matrix 453 rows 471 cols
[2024-05-22 13:20:51] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-22 13:20:52] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 13:21:06] [INFO ] Implicit Places using invariants and state equation in 14823 ms returned [42, 48, 68, 73, 95, 100, 122, 128, 150, 155, 175, 180, 201, 207, 226, 231, 254, 260, 282, 287, 307, 312, 333, 338, 359, 365, 386, 391, 411, 417, 439, 444, 463, 469]
[2024-05-22 13:21:06] [INFO ] Actually due to overlaps returned [48, 42]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 15284 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 469/477 places, 453/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 469 transition count 452
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 468 transition count 452
Applied a total of 2 rules in 25 ms. Remains 468 /469 variables (removed 1) and now considering 452/453 (removed 1) transitions.
// Phase 1: matrix 452 rows 468 cols
[2024-05-22 13:21:06] [INFO ] Computed 93 invariants in 77 ms
[2024-05-22 13:21:07] [INFO ] Implicit Places using invariants in 1243 ms returned [65, 70, 92, 97, 119, 125, 147, 152, 172, 177, 198, 204, 223, 228, 251, 257, 279, 284, 304, 309, 330, 335, 356, 362, 383, 388, 408, 414, 436, 441, 460, 466]
[2024-05-22 13:21:07] [INFO ] Actually due to overlaps returned [70, 65]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1245 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 466/477 places, 452/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 466 transition count 451
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 465 transition count 451
Applied a total of 2 rules in 20 ms. Remains 465 /466 variables (removed 1) and now considering 451/452 (removed 1) transitions.
// Phase 1: matrix 451 rows 465 cols
[2024-05-22 13:21:07] [INFO ] Invariants computation overflowed in 57 ms
[2024-05-22 13:21:08] [INFO ] Implicit Places using invariants in 449 ms returned []
// Phase 1: matrix 451 rows 465 cols
[2024-05-22 13:21:08] [INFO ] Invariants computation overflowed in 50 ms
[2024-05-22 13:21:08] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 13:21:25] [INFO ] Implicit Places using invariants and state equation in 17093 ms returned [89, 94, 116, 122, 144, 149, 169, 174, 195, 201, 220, 225, 248, 254, 276, 281, 301, 306, 327, 332, 353, 359, 380, 385, 405, 411, 433, 438, 457, 463]
[2024-05-22 13:21:25] [INFO ] Actually due to overlaps returned [94, 89]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 17547 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 463/477 places, 451/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 463 transition count 450
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 462 transition count 450
Applied a total of 2 rules in 17 ms. Remains 462 /463 variables (removed 1) and now considering 450/451 (removed 1) transitions.
// Phase 1: matrix 450 rows 462 cols
[2024-05-22 13:21:25] [INFO ] Invariants computation overflowed in 44 ms
[2024-05-22 13:21:25] [INFO ] Implicit Places using invariants in 425 ms returned []
// Phase 1: matrix 450 rows 462 cols
[2024-05-22 13:21:25] [INFO ] Invariants computation overflowed in 44 ms
[2024-05-22 13:21:26] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 13:21:51] [INFO ] Implicit Places using invariants and state equation in 25522 ms returned [113, 119, 141, 146, 166, 171, 192, 198, 217, 222, 245, 251, 273, 278, 298, 303, 324, 329, 350, 356, 377, 382, 402, 408, 430, 435, 454, 460]
[2024-05-22 13:21:51] [INFO ] Actually due to overlaps returned [119, 113]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 25950 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 460/477 places, 450/455 transitions.
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 460 transition count 450
Applied a total of 2 rules in 19 ms. Remains 460 /460 variables (removed 0) and now considering 450/450 (removed 0) transitions.
// Phase 1: matrix 450 rows 460 cols
[2024-05-22 13:21:51] [INFO ] Invariants computation overflowed in 32 ms
[2024-05-22 13:21:51] [INFO ] Implicit Places using invariants in 395 ms returned []
// Phase 1: matrix 450 rows 460 cols
[2024-05-22 13:21:51] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-22 13:21:52] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 13:21:59] [INFO ] Implicit Places using invariants and state equation in 7969 ms returned [139, 144, 164, 169, 190, 196, 215, 220, 243, 249, 271, 276, 296, 301, 322, 327, 348, 354, 375, 380, 400, 406, 428, 433, 452, 458]
[2024-05-22 13:21:59] [INFO ] Actually due to overlaps returned [144, 139]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 8370 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 458/477 places, 450/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 458 transition count 449
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 457 transition count 449
Applied a total of 2 rules in 21 ms. Remains 457 /458 variables (removed 1) and now considering 449/450 (removed 1) transitions.
// Phase 1: matrix 449 rows 457 cols
[2024-05-22 13:21:59] [INFO ] Invariants computation overflowed in 38 ms
[2024-05-22 13:22:00] [INFO ] Implicit Places using invariants in 414 ms returned []
// Phase 1: matrix 449 rows 457 cols
[2024-05-22 13:22:00] [INFO ] Invariants computation overflowed in 32 ms
[2024-05-22 13:22:00] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 13:22:08] [INFO ] Implicit Places using invariants and state equation in 8453 ms returned [161, 166, 187, 193, 212, 217, 240, 246, 268, 273, 293, 298, 319, 324, 345, 351, 372, 377, 397, 403, 425, 430, 449, 455]
[2024-05-22 13:22:08] [INFO ] Actually due to overlaps returned [166, 161]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 8873 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 455/477 places, 449/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 455 transition count 448
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 454 transition count 448
Applied a total of 2 rules in 19 ms. Remains 454 /455 variables (removed 1) and now considering 448/449 (removed 1) transitions.
// Phase 1: matrix 448 rows 454 cols
[2024-05-22 13:22:08] [INFO ] Invariants computation overflowed in 35 ms
[2024-05-22 13:22:09] [INFO ] Implicit Places using invariants in 380 ms returned []
// Phase 1: matrix 448 rows 454 cols
[2024-05-22 13:22:09] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-22 13:22:09] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 13:22:17] [INFO ] Implicit Places using invariants and state equation in 8212 ms returned [184, 190, 209, 214, 237, 243, 265, 270, 290, 295, 316, 321, 342, 348, 369, 374, 394, 400, 422, 427, 446, 452]
[2024-05-22 13:22:17] [INFO ] Actually due to overlaps returned [190, 184]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 8594 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 452/477 places, 448/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 452 transition count 447
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 451 transition count 447
Applied a total of 2 rules in 21 ms. Remains 451 /452 variables (removed 1) and now considering 447/448 (removed 1) transitions.
// Phase 1: matrix 447 rows 451 cols
[2024-05-22 13:22:17] [INFO ] Invariants computation overflowed in 29 ms
[2024-05-22 13:22:17] [INFO ] Implicit Places using invariants in 354 ms returned []
// Phase 1: matrix 447 rows 451 cols
[2024-05-22 13:22:17] [INFO ] Invariants computation overflowed in 23 ms
[2024-05-22 13:22:17] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 13:22:26] [INFO ] Implicit Places using invariants and state equation in 9155 ms returned [206, 211, 234, 240, 262, 267, 287, 292, 313, 318, 339, 345, 366, 371, 391, 397, 419, 424, 443, 449]
[2024-05-22 13:22:26] [INFO ] Actually due to overlaps returned [211, 206]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 9511 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 10 : 449/477 places, 447/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 449 transition count 446
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 448 transition count 446
Applied a total of 2 rules in 16 ms. Remains 448 /449 variables (removed 1) and now considering 446/447 (removed 1) transitions.
// Phase 1: matrix 446 rows 448 cols
[2024-05-22 13:22:26] [INFO ] Invariants computation overflowed in 31 ms
[2024-05-22 13:22:27] [INFO ] Implicit Places using invariants in 349 ms returned []
// Phase 1: matrix 446 rows 448 cols
[2024-05-22 13:22:27] [INFO ] Invariants computation overflowed in 25 ms
[2024-05-22 13:22:27] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 13:22:41] [INFO ] Implicit Places using invariants and state equation in 13986 ms returned [231, 237, 259, 264, 284, 289, 310, 315, 336, 342, 363, 368, 388, 394, 416, 421, 440, 446]
[2024-05-22 13:22:41] [INFO ] Actually due to overlaps returned [237, 231]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 14338 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 11 : 446/477 places, 446/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 446 transition count 445
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 445 transition count 445
Applied a total of 2 rules in 20 ms. Remains 445 /446 variables (removed 1) and now considering 445/446 (removed 1) transitions.
// Phase 1: matrix 445 rows 445 cols
[2024-05-22 13:22:41] [INFO ] Invariants computation overflowed in 38 ms
[2024-05-22 13:22:41] [INFO ] Implicit Places using invariants in 341 ms returned []
// Phase 1: matrix 445 rows 445 cols
[2024-05-22 13:22:41] [INFO ] Invariants computation overflowed in 34 ms
[2024-05-22 13:22:41] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 13:22:51] [INFO ] Implicit Places using invariants and state equation in 10148 ms returned [256, 261, 281, 286, 307, 312, 333, 339, 360, 365, 385, 391, 413, 418, 437, 443]
[2024-05-22 13:22:51] [INFO ] Actually due to overlaps returned [261, 256]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 10491 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 12 : 443/477 places, 445/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 443 transition count 444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 442 transition count 444
Applied a total of 2 rules in 15 ms. Remains 442 /443 variables (removed 1) and now considering 444/445 (removed 1) transitions.
// Phase 1: matrix 444 rows 442 cols
[2024-05-22 13:22:51] [INFO ] Invariants computation overflowed in 34 ms
[2024-05-22 13:22:52] [INFO ] Implicit Places using invariants in 325 ms returned []
// Phase 1: matrix 444 rows 442 cols
[2024-05-22 13:22:52] [INFO ] Invariants computation overflowed in 30 ms
[2024-05-22 13:22:52] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 13:23:01] [INFO ] Implicit Places using invariants and state equation in 9290 ms returned [278, 283, 304, 309, 330, 336, 357, 362, 382, 388, 410, 415, 434, 440]
[2024-05-22 13:23:01] [INFO ] Actually due to overlaps returned [283, 278]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 9618 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 13 : 440/477 places, 444/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 440 transition count 443
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 439 transition count 443
Applied a total of 2 rules in 21 ms. Remains 439 /440 variables (removed 1) and now considering 443/444 (removed 1) transitions.
// Phase 1: matrix 443 rows 439 cols
[2024-05-22 13:23:01] [INFO ] Computed 73 invariants in 45 ms
[2024-05-22 13:23:01] [INFO ] Implicit Places using invariants in 517 ms returned [301, 306, 327, 333, 354, 359, 379, 385, 407, 412, 431, 437]
[2024-05-22 13:23:01] [INFO ] Actually due to overlaps returned [306, 301]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 519 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 14 : 437/477 places, 443/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 437 transition count 442
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 436 transition count 442
Applied a total of 2 rules in 16 ms. Remains 436 /437 variables (removed 1) and now considering 442/443 (removed 1) transitions.
// Phase 1: matrix 442 rows 436 cols
[2024-05-22 13:23:01] [INFO ] Invariants computation overflowed in 38 ms
[2024-05-22 13:23:02] [INFO ] Implicit Places using invariants in 310 ms returned []
// Phase 1: matrix 442 rows 436 cols
[2024-05-22 13:23:02] [INFO ] Invariants computation overflowed in 32 ms
[2024-05-22 13:23:02] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 13:23:07] [INFO ] Implicit Places using invariants and state equation in 5465 ms returned [324, 330, 351, 356, 376, 382, 404, 409, 428, 434]
[2024-05-22 13:23:07] [INFO ] Actually due to overlaps returned [330, 324]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 5779 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 15 : 434/477 places, 442/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 434 transition count 441
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 433 transition count 441
Applied a total of 2 rules in 20 ms. Remains 433 /434 variables (removed 1) and now considering 441/442 (removed 1) transitions.
// Phase 1: matrix 441 rows 433 cols
[2024-05-22 13:23:07] [INFO ] Invariants computation overflowed in 38 ms
[2024-05-22 13:23:07] [INFO ] Implicit Places using invariants in 308 ms returned []
// Phase 1: matrix 441 rows 433 cols
[2024-05-22 13:23:08] [INFO ] Invariants computation overflowed in 37 ms
[2024-05-22 13:23:08] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 13:23:25] [INFO ] Implicit Places using invariants and state equation in 17615 ms returned [348, 353, 373, 379, 401, 406, 425, 431]
[2024-05-22 13:23:25] [INFO ] Actually due to overlaps returned [353, 348]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 17926 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 16 : 431/477 places, 441/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 431 transition count 440
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 430 transition count 440
Applied a total of 2 rules in 21 ms. Remains 430 /431 variables (removed 1) and now considering 440/441 (removed 1) transitions.
// Phase 1: matrix 440 rows 430 cols
[2024-05-22 13:23:25] [INFO ] Invariants computation overflowed in 43 ms
[2024-05-22 13:23:25] [INFO ] Implicit Places using invariants in 304 ms returned []
// Phase 1: matrix 440 rows 430 cols
[2024-05-22 13:23:25] [INFO ] Invariants computation overflowed in 39 ms
[2024-05-22 13:23:26] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 13:23:38] [INFO ] Implicit Places using invariants and state equation in 12934 ms returned [370, 376, 398, 403, 422, 428]
[2024-05-22 13:23:38] [INFO ] Actually due to overlaps returned [376, 370]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 13243 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 17 : 428/477 places, 440/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 428 transition count 439
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 427 transition count 439
Applied a total of 2 rules in 16 ms. Remains 427 /428 variables (removed 1) and now considering 439/440 (removed 1) transitions.
// Phase 1: matrix 439 rows 427 cols
[2024-05-22 13:23:38] [INFO ] Computed 65 invariants in 53 ms
[2024-05-22 13:23:39] [INFO ] Implicit Places using invariants in 438 ms returned [395, 400, 419, 425]
[2024-05-22 13:23:39] [INFO ] Actually due to overlaps returned [400, 395]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 439 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 18 : 425/477 places, 439/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 425 transition count 438
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 424 transition count 438
Applied a total of 2 rules in 15 ms. Remains 424 /425 variables (removed 1) and now considering 438/439 (removed 1) transitions.
// Phase 1: matrix 438 rows 424 cols
[2024-05-22 13:23:39] [INFO ] Invariants computation overflowed in 42 ms
[2024-05-22 13:23:39] [INFO ] Implicit Places using invariants in 292 ms returned []
// Phase 1: matrix 438 rows 424 cols
[2024-05-22 13:23:39] [INFO ] Invariants computation overflowed in 39 ms
[2024-05-22 13:23:39] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 13:23:56] [INFO ] Implicit Places using invariants and state equation in 17037 ms returned [416, 422]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 17330 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 19 : 422/477 places, 438/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 422 transition count 437
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 421 transition count 437
Applied a total of 2 rules in 15 ms. Remains 421 /422 variables (removed 1) and now considering 437/438 (removed 1) transitions.
// Phase 1: matrix 437 rows 421 cols
[2024-05-22 13:23:56] [INFO ] Invariants computation overflowed in 43 ms
[2024-05-22 13:23:56] [INFO ] Implicit Places using invariants in 298 ms returned []
// Phase 1: matrix 437 rows 421 cols
[2024-05-22 13:23:57] [INFO ] Invariants computation overflowed in 38 ms
[2024-05-22 13:23:57] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 13:24:10] [INFO ] Implicit Places using invariants and state equation in 13357 ms returned []
Implicit Place search using SMT with State Equation took 13659 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 20 : 421/477 places, 437/455 transitions.
Finished structural reductions in REACHABILITY mode , in 20 iterations and 212605 ms. Remains : 421/477 places, 437/455 transitions.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) p1))), (X p0), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p0)), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 120 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p0) (AND p1 (NOT p2))), true, (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 82 ms :[(OR (NOT p0) (AND p1 (NOT p2))), true, (AND p1 (NOT p2))]
Support contains 4 out of 557 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 557/557 places, 535/535 transitions.
Applied a total of 0 rules in 15 ms. Remains 557 /557 variables (removed 0) and now considering 535/535 (removed 0) transitions.
// Phase 1: matrix 535 rows 557 cols
[2024-05-22 13:24:10] [INFO ] Computed 99 invariants in 52 ms
[2024-05-22 13:24:11] [INFO ] Implicit Places using invariants in 299 ms returned []
[2024-05-22 13:24:11] [INFO ] Invariant cache hit.
[2024-05-22 13:24:11] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-22 13:24:17] [INFO ] Implicit Places using invariants and state equation in 6469 ms returned []
Implicit Place search using SMT with State Equation took 6769 ms to find 0 implicit places.
[2024-05-22 13:24:17] [INFO ] Redundant transitions in 4 ms returned []
Running 534 sub problems to find dead transitions.
[2024-05-22 13:24:17] [INFO ] Invariant cache hit.
[2024-05-22 13:24:17] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/556 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/556 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/556 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 3 (OVERLAPS) 535/1091 variables, 556/655 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1091 variables, 37/692 constraints. Problems are: Problem set: 0 solved, 534 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1091/1092 variables, and 692 constraints, problems are : Problem set: 0 solved, 534 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 556/557 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 534/534 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 534 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/556 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/556 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/556 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 3 (OVERLAPS) 535/1091 variables, 556/655 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1091 variables, 37/692 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1091 variables, 531/1223 constraints. Problems are: Problem set: 0 solved, 534 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1091/1092 variables, and 1223 constraints, problems are : Problem set: 0 solved, 534 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 556/557 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 531/534 constraints, Known Traps: 0/0 constraints]
After SMT, in 60130ms problems are : Problem set: 0 solved, 534 unsolved
Search for dead transitions found 0 dead transitions in 60135ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 66936 ms. Remains : 557/557 places, 535/535 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1738 edges and 557 vertex of which 556 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND p1 (NOT p2)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 153 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(OR (NOT p0) (AND p1 (NOT p2))), true, (AND p1 (NOT p2))]
RANDOM walk for 40000 steps (5528 resets) in 690 ms. (57 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (3272 resets) in 583 ms. (68 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (3289 resets) in 556 ms. (71 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (3237 resets) in 222 ms. (179 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (3227 resets) in 289 ms. (137 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (3277 resets) in 275 ms. (144 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (3257 resets) in 191 ms. (208 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 144192 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :0 out of 6
Probabilistic random walk after 144192 steps, saw 72129 distinct states, run finished after 3001 ms. (steps per millisecond=48 ) properties seen :0
[2024-05-22 13:25:22] [INFO ] Invariant cache hit.
[2024-05-22 13:25:22] [INFO ] State equation strengthened by 37 read => feed constraints.
All remaining problems are real, not stopping.
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) 135/139 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 200/339 variables, 50/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/339 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 71/410 variables, 22/78 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/410 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 19/429 variables, 3/81 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/429 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 57/486 variables, 8/89 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/486 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 14/500 variables, 6/95 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/500 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 525/1025 variables, 500/595 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1025 variables, 35/630 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1025 variables, 0/630 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 61/1086 variables, 52/682 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1086 variables, 2/684 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1086 variables, 1/685 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1086 variables, 0/685 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 2/1088 variables, 2/687 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1088 variables, 2/689 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1088 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 4/1092 variables, 3/692 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1092 variables, 1/693 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1092 variables, 0/693 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (OVERLAPS) 0/1092 variables, 0/693 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1092/1092 variables, and 693 constraints, problems are : Problem set: 0 solved, 6 unsolved in 3858 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 557/557 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
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) 135/139 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 200/339 variables, 50/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/339 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 71/410 variables, 22/78 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/410 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 19/429 variables, 3/81 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/429 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 57/486 variables, 8/89 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/486 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 14/500 variables, 6/95 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/500 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 525/1025 variables, 500/595 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1025 variables, 35/630 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1025 variables, 1/631 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 13:25:26] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1025 variables, 1/632 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1025 variables, 0/632 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 61/1086 variables, 52/684 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1086 variables, 2/686 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1086 variables, 1/687 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1086 variables, 5/692 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 13:25:30] [INFO ] Deduced a trap composed of 24 places in 137 ms of which 2 ms to minimize.
[2024-05-22 13:25:30] [INFO ] Deduced a trap composed of 22 places in 139 ms of which 2 ms to minimize.
[2024-05-22 13:25:30] [INFO ] Deduced a trap composed of 18 places in 142 ms of which 3 ms to minimize.
[2024-05-22 13:25:30] [INFO ] Deduced a trap composed of 18 places in 136 ms of which 2 ms to minimize.
[2024-05-22 13:25:30] [INFO ] Deduced a trap composed of 14 places in 150 ms of which 3 ms to minimize.
SMT process timed out in 8899ms, After SMT, problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 557 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 557/557 places, 535/535 transitions.
Graph (complete) has 1660 edges and 557 vertex of which 556 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 556 transition count 534
Free-agglomeration rule (complex) applied 79 times.
Iterating global reduction 1 with 79 rules applied. Total rules applied 81 place count 556 transition count 455
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 160 place count 477 transition count 455
Partial Free-agglomeration rule applied 82 times.
Drop transitions (Partial Free agglomeration) removed 82 transitions
Iterating global reduction 2 with 82 rules applied. Total rules applied 242 place count 477 transition count 455
Applied a total of 242 rules in 32 ms. Remains 477 /557 variables (removed 80) and now considering 455/535 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 477/557 places, 455/535 transitions.
RANDOM walk for 40000 steps (5167 resets) in 1030 ms. (38 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (3372 resets) in 546 ms. (73 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (3345 resets) in 455 ms. (87 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (3436 resets) in 452 ms. (88 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (3427 resets) in 522 ms. (76 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (3366 resets) in 256 ms. (155 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (3331 resets) in 279 ms. (142 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 155487 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :0 out of 6
Probabilistic random walk after 155487 steps, saw 77768 distinct states, run finished after 3001 ms. (steps per millisecond=51 ) properties seen :0
// Phase 1: matrix 455 rows 477 cols
[2024-05-22 13:25:35] [INFO ] Invariants computation overflowed in 30 ms
[2024-05-22 13:25:35] [INFO ] State equation strengthened by 78 read => feed constraints.
All remaining problems are real, not stopping.
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) 14/18 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 186/204 variables, 37/41 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 7/48 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 499/703 variables, 255/303 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/703 variables, 44/347 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/703 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 229/932 variables, 181/528 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/932 variables, 27/555 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/932 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/932 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 932/932 variables, and 555 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1333 ms.
Refiners :[State Equation: 477/477 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
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) 14/18 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 186/204 variables, 37/41 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 7/48 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 499/703 variables, 255/304 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/703 variables, 44/348 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/703 variables, 5/353 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/703 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 229/932 variables, 181/534 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/932 variables, 27/561 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/932 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/932 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 932/932 variables, and 561 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1736 ms.
Refiners :[State Equation: 477/477 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 3108ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 12649 ms.
Support contains 4 out of 477 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 477/477 places, 455/455 transitions.
Applied a total of 0 rules in 8 ms. Remains 477 /477 variables (removed 0) and now considering 455/455 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 477/477 places, 455/455 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 477/477 places, 455/455 transitions.
Applied a total of 0 rules in 9 ms. Remains 477 /477 variables (removed 0) and now considering 455/455 (removed 0) transitions.
// Phase 1: matrix 455 rows 477 cols
[2024-05-22 13:25:51] [INFO ] Invariants computation overflowed in 37 ms
[2024-05-22 13:25:51] [INFO ] Implicit Places using invariants in 497 ms returned []
// Phase 1: matrix 455 rows 477 cols
[2024-05-22 13:25:51] [INFO ] Invariants computation overflowed in 34 ms
[2024-05-22 13:25:51] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 13:26:02] [INFO ] Implicit Places using invariants and state equation in 10877 ms returned [42, 48, 68, 73, 95, 100, 122, 128, 150, 155, 156, 176, 181, 202, 208, 215, 229, 234, 257, 263, 285, 290, 310, 315, 336, 341, 362, 368, 389, 391, 395, 415, 421, 443, 448, 452, 469, 475]
[2024-05-22 13:26:02] [INFO ] Actually due to overlaps returned [215, 155]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 11377 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 475/477 places, 455/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 475 transition count 454
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 474 transition count 454
Applied a total of 2 rules in 21 ms. Remains 474 /475 variables (removed 1) and now considering 454/455 (removed 1) transitions.
// Phase 1: matrix 454 rows 474 cols
[2024-05-22 13:26:02] [INFO ] Computed 97 invariants in 52 ms
[2024-05-22 13:26:03] [INFO ] Implicit Places using invariants in 1446 ms returned [42, 48, 68, 73, 95, 100, 122, 128, 150, 155, 175, 180, 201, 207, 226, 231, 254, 260, 282, 287, 307, 312, 333, 338, 359, 365, 386, 388, 392, 412, 418, 440, 445, 449, 466, 472]
[2024-05-22 13:26:03] [INFO ] Actually due to overlaps returned [449, 388]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1448 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 472/477 places, 454/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 472 transition count 453
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 471 transition count 453
Applied a total of 2 rules in 19 ms. Remains 471 /472 variables (removed 1) and now considering 453/454 (removed 1) transitions.
// Phase 1: matrix 453 rows 471 cols
[2024-05-22 13:26:03] [INFO ] Invariants computation overflowed in 34 ms
[2024-05-22 13:26:04] [INFO ] Implicit Places using invariants in 474 ms returned []
// Phase 1: matrix 453 rows 471 cols
[2024-05-22 13:26:04] [INFO ] Invariants computation overflowed in 30 ms
[2024-05-22 13:26:04] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 13:26:18] [INFO ] Implicit Places using invariants and state equation in 13894 ms returned [42, 48, 68, 73, 95, 100, 122, 128, 150, 155, 175, 180, 201, 207, 226, 231, 254, 260, 282, 287, 307, 312, 333, 338, 359, 365, 386, 391, 411, 417, 439, 444, 463, 469]
[2024-05-22 13:26:18] [INFO ] Actually due to overlaps returned [48, 42]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 14368 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 469/477 places, 453/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 469 transition count 452
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 468 transition count 452
Applied a total of 2 rules in 16 ms. Remains 468 /469 variables (removed 1) and now considering 452/453 (removed 1) transitions.
// Phase 1: matrix 452 rows 468 cols
[2024-05-22 13:26:18] [INFO ] Computed 93 invariants in 71 ms
[2024-05-22 13:26:19] [INFO ] Implicit Places using invariants in 1212 ms returned [65, 70, 92, 97, 119, 125, 147, 152, 172, 177, 198, 204, 223, 228, 251, 257, 279, 284, 304, 309, 330, 335, 356, 362, 383, 388, 408, 414, 436, 441, 460, 466]
[2024-05-22 13:26:19] [INFO ] Actually due to overlaps returned [70, 65]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1213 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 466/477 places, 452/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 466 transition count 451
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 465 transition count 451
Applied a total of 2 rules in 17 ms. Remains 465 /466 variables (removed 1) and now considering 451/452 (removed 1) transitions.
// Phase 1: matrix 451 rows 465 cols
[2024-05-22 13:26:19] [INFO ] Invariants computation overflowed in 56 ms
[2024-05-22 13:26:19] [INFO ] Implicit Places using invariants in 424 ms returned []
// Phase 1: matrix 451 rows 465 cols
[2024-05-22 13:26:19] [INFO ] Invariants computation overflowed in 48 ms
[2024-05-22 13:26:20] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 13:26:36] [INFO ] Implicit Places using invariants and state equation in 16875 ms returned [89, 94, 116, 122, 144, 149, 169, 174, 195, 201, 220, 225, 248, 254, 276, 281, 301, 306, 327, 332, 353, 359, 380, 385, 405, 411, 433, 438, 457, 463]
[2024-05-22 13:26:36] [INFO ] Actually due to overlaps returned [94, 89]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 17300 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 463/477 places, 451/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 463 transition count 450
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 462 transition count 450
Applied a total of 2 rules in 18 ms. Remains 462 /463 variables (removed 1) and now considering 450/451 (removed 1) transitions.
// Phase 1: matrix 450 rows 462 cols
[2024-05-22 13:26:36] [INFO ] Invariants computation overflowed in 45 ms
[2024-05-22 13:26:37] [INFO ] Implicit Places using invariants in 419 ms returned []
// Phase 1: matrix 450 rows 462 cols
[2024-05-22 13:26:37] [INFO ] Invariants computation overflowed in 41 ms
[2024-05-22 13:26:37] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 13:27:01] [INFO ] Implicit Places using invariants and state equation in 23998 ms returned [113, 119, 141, 146, 166, 171, 192, 198, 217, 222, 245, 251, 273, 278, 298, 303, 324, 329, 350, 356, 377, 382, 402, 408, 430, 435, 454, 460]
[2024-05-22 13:27:01] [INFO ] Actually due to overlaps returned [119, 113]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 24419 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 460/477 places, 450/455 transitions.
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 460 transition count 450
Applied a total of 2 rules in 15 ms. Remains 460 /460 variables (removed 0) and now considering 450/450 (removed 0) transitions.
// Phase 1: matrix 450 rows 460 cols
[2024-05-22 13:27:01] [INFO ] Invariants computation overflowed in 31 ms
[2024-05-22 13:27:01] [INFO ] Implicit Places using invariants in 386 ms returned []
// Phase 1: matrix 450 rows 460 cols
[2024-05-22 13:27:01] [INFO ] Invariants computation overflowed in 26 ms
[2024-05-22 13:27:01] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 13:27:09] [INFO ] Implicit Places using invariants and state equation in 7394 ms returned [139, 144, 164, 169, 190, 196, 215, 220, 243, 249, 271, 276, 296, 301, 322, 327, 348, 354, 375, 380, 400, 406, 428, 433, 452, 458]
[2024-05-22 13:27:09] [INFO ] Actually due to overlaps returned [144, 139]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 7781 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 458/477 places, 450/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 458 transition count 449
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 457 transition count 449
Applied a total of 2 rules in 23 ms. Remains 457 /458 variables (removed 1) and now considering 449/450 (removed 1) transitions.
// Phase 1: matrix 449 rows 457 cols
[2024-05-22 13:27:09] [INFO ] Invariants computation overflowed in 37 ms
[2024-05-22 13:27:09] [INFO ] Implicit Places using invariants in 370 ms returned []
// Phase 1: matrix 449 rows 457 cols
[2024-05-22 13:27:09] [INFO ] Invariants computation overflowed in 31 ms
[2024-05-22 13:27:09] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 13:27:17] [INFO ] Implicit Places using invariants and state equation in 7843 ms returned [161, 166, 187, 193, 212, 217, 240, 246, 268, 273, 293, 298, 319, 324, 345, 351, 372, 377, 397, 403, 425, 430, 449, 455]
[2024-05-22 13:27:17] [INFO ] Actually due to overlaps returned [166, 161]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 8214 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 455/477 places, 449/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 455 transition count 448
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 454 transition count 448
Applied a total of 2 rules in 17 ms. Remains 454 /455 variables (removed 1) and now considering 448/449 (removed 1) transitions.
// Phase 1: matrix 448 rows 454 cols
[2024-05-22 13:27:17] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-22 13:27:17] [INFO ] Implicit Places using invariants in 353 ms returned []
// Phase 1: matrix 448 rows 454 cols
[2024-05-22 13:27:17] [INFO ] Invariants computation overflowed in 27 ms
[2024-05-22 13:27:17] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 13:27:25] [INFO ] Implicit Places using invariants and state equation in 7648 ms returned [184, 190, 209, 214, 237, 243, 265, 270, 290, 295, 316, 321, 342, 348, 369, 374, 394, 400, 422, 427, 446, 452]
[2024-05-22 13:27:25] [INFO ] Actually due to overlaps returned [190, 184]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 8003 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 452/477 places, 448/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 452 transition count 447
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 451 transition count 447
Applied a total of 2 rules in 20 ms. Remains 451 /452 variables (removed 1) and now considering 447/448 (removed 1) transitions.
// Phase 1: matrix 447 rows 451 cols
[2024-05-22 13:27:25] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-22 13:27:25] [INFO ] Implicit Places using invariants in 344 ms returned []
// Phase 1: matrix 447 rows 451 cols
[2024-05-22 13:27:25] [INFO ] Invariants computation overflowed in 23 ms
[2024-05-22 13:27:25] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 13:27:34] [INFO ] Implicit Places using invariants and state equation in 8524 ms returned [206, 211, 234, 240, 262, 267, 287, 292, 313, 318, 339, 345, 366, 371, 391, 397, 419, 424, 443, 449]
[2024-05-22 13:27:34] [INFO ] Actually due to overlaps returned [211, 206]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 8869 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 10 : 449/477 places, 447/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 449 transition count 446
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 448 transition count 446
Applied a total of 2 rules in 20 ms. Remains 448 /449 variables (removed 1) and now considering 446/447 (removed 1) transitions.
// Phase 1: matrix 446 rows 448 cols
[2024-05-22 13:27:34] [INFO ] Invariants computation overflowed in 25 ms
[2024-05-22 13:27:34] [INFO ] Implicit Places using invariants in 333 ms returned []
// Phase 1: matrix 446 rows 448 cols
[2024-05-22 13:27:34] [INFO ] Invariants computation overflowed in 24 ms
[2024-05-22 13:27:34] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 13:27:48] [INFO ] Implicit Places using invariants and state equation in 13791 ms returned [231, 237, 259, 264, 284, 289, 310, 315, 336, 342, 363, 368, 388, 394, 416, 421, 440, 446]
[2024-05-22 13:27:48] [INFO ] Actually due to overlaps returned [237, 231]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 14126 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 11 : 446/477 places, 446/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 446 transition count 445
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 445 transition count 445
Applied a total of 2 rules in 22 ms. Remains 445 /446 variables (removed 1) and now considering 445/446 (removed 1) transitions.
// Phase 1: matrix 445 rows 445 cols
[2024-05-22 13:27:48] [INFO ] Invariants computation overflowed in 36 ms
[2024-05-22 13:27:48] [INFO ] Implicit Places using invariants in 329 ms returned []
// Phase 1: matrix 445 rows 445 cols
[2024-05-22 13:27:48] [INFO ] Invariants computation overflowed in 33 ms
[2024-05-22 13:27:48] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 13:27:58] [INFO ] Implicit Places using invariants and state equation in 10158 ms returned [256, 261, 281, 286, 307, 312, 333, 339, 360, 365, 385, 391, 413, 418, 437, 443]
[2024-05-22 13:27:58] [INFO ] Actually due to overlaps returned [261, 256]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 10489 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 12 : 443/477 places, 445/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 443 transition count 444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 442 transition count 444
Applied a total of 2 rules in 21 ms. Remains 442 /443 variables (removed 1) and now considering 444/445 (removed 1) transitions.
// Phase 1: matrix 444 rows 442 cols
[2024-05-22 13:27:58] [INFO ] Invariants computation overflowed in 33 ms
[2024-05-22 13:27:59] [INFO ] Implicit Places using invariants in 321 ms returned []
// Phase 1: matrix 444 rows 442 cols
[2024-05-22 13:27:59] [INFO ] Invariants computation overflowed in 30 ms
[2024-05-22 13:27:59] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 13:28:08] [INFO ] Implicit Places using invariants and state equation in 9268 ms returned [278, 283, 304, 309, 330, 336, 357, 362, 382, 388, 410, 415, 434, 440]
[2024-05-22 13:28:08] [INFO ] Actually due to overlaps returned [283, 278]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 9593 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 13 : 440/477 places, 444/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 440 transition count 443
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 439 transition count 443
Applied a total of 2 rules in 20 ms. Remains 439 /440 variables (removed 1) and now considering 443/444 (removed 1) transitions.
// Phase 1: matrix 443 rows 439 cols
[2024-05-22 13:28:08] [INFO ] Computed 73 invariants in 47 ms
[2024-05-22 13:28:08] [INFO ] Implicit Places using invariants in 524 ms returned [301, 306, 327, 333, 354, 359, 379, 385, 407, 412, 431, 437]
[2024-05-22 13:28:08] [INFO ] Actually due to overlaps returned [306, 301]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 525 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 14 : 437/477 places, 443/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 437 transition count 442
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 436 transition count 442
Applied a total of 2 rules in 15 ms. Remains 436 /437 variables (removed 1) and now considering 442/443 (removed 1) transitions.
// Phase 1: matrix 442 rows 436 cols
[2024-05-22 13:28:09] [INFO ] Invariants computation overflowed in 39 ms
[2024-05-22 13:28:09] [INFO ] Implicit Places using invariants in 302 ms returned []
// Phase 1: matrix 442 rows 436 cols
[2024-05-22 13:28:09] [INFO ] Invariants computation overflowed in 31 ms
[2024-05-22 13:28:09] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 13:28:14] [INFO ] Implicit Places using invariants and state equation in 5208 ms returned [324, 330, 351, 356, 376, 382, 404, 409, 428, 434]
[2024-05-22 13:28:14] [INFO ] Actually due to overlaps returned [330, 324]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 5512 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 15 : 434/477 places, 442/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 434 transition count 441
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 433 transition count 441
Applied a total of 2 rules in 18 ms. Remains 433 /434 variables (removed 1) and now considering 441/442 (removed 1) transitions.
// Phase 1: matrix 441 rows 433 cols
[2024-05-22 13:28:14] [INFO ] Invariants computation overflowed in 38 ms
[2024-05-22 13:28:14] [INFO ] Implicit Places using invariants in 303 ms returned []
// Phase 1: matrix 441 rows 433 cols
[2024-05-22 13:28:14] [INFO ] Invariants computation overflowed in 44 ms
[2024-05-22 13:28:15] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 13:28:32] [INFO ] Implicit Places using invariants and state equation in 17619 ms returned [348, 353, 373, 379, 401, 406, 425, 431]
[2024-05-22 13:28:32] [INFO ] Actually due to overlaps returned [353, 348]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 17925 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 16 : 431/477 places, 441/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 431 transition count 440
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 430 transition count 440
Applied a total of 2 rules in 18 ms. Remains 430 /431 variables (removed 1) and now considering 440/441 (removed 1) transitions.
// Phase 1: matrix 440 rows 430 cols
[2024-05-22 13:28:32] [INFO ] Invariants computation overflowed in 39 ms
[2024-05-22 13:28:32] [INFO ] Implicit Places using invariants in 292 ms returned []
// Phase 1: matrix 440 rows 430 cols
[2024-05-22 13:28:32] [INFO ] Invariants computation overflowed in 45 ms
[2024-05-22 13:28:33] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 13:28:45] [INFO ] Implicit Places using invariants and state equation in 12846 ms returned [370, 376, 398, 403, 422, 428]
[2024-05-22 13:28:45] [INFO ] Actually due to overlaps returned [376, 370]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 13141 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 17 : 428/477 places, 440/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 428 transition count 439
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 427 transition count 439
Applied a total of 2 rules in 19 ms. Remains 427 /428 variables (removed 1) and now considering 439/440 (removed 1) transitions.
// Phase 1: matrix 439 rows 427 cols
[2024-05-22 13:28:45] [INFO ] Computed 65 invariants in 49 ms
[2024-05-22 13:28:46] [INFO ] Implicit Places using invariants in 425 ms returned [395, 400, 419, 425]
[2024-05-22 13:28:46] [INFO ] Actually due to overlaps returned [400, 395]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 426 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 18 : 425/477 places, 439/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 425 transition count 438
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 424 transition count 438
Applied a total of 2 rules in 16 ms. Remains 424 /425 variables (removed 1) and now considering 438/439 (removed 1) transitions.
// Phase 1: matrix 438 rows 424 cols
[2024-05-22 13:28:46] [INFO ] Invariants computation overflowed in 44 ms
[2024-05-22 13:28:46] [INFO ] Implicit Places using invariants in 293 ms returned []
// Phase 1: matrix 438 rows 424 cols
[2024-05-22 13:28:46] [INFO ] Invariants computation overflowed in 41 ms
[2024-05-22 13:28:46] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 13:29:03] [INFO ] Implicit Places using invariants and state equation in 17319 ms returned [416, 422]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 17617 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 19 : 422/477 places, 438/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 422 transition count 437
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 421 transition count 437
Applied a total of 2 rules in 19 ms. Remains 421 /422 variables (removed 1) and now considering 437/438 (removed 1) transitions.
// Phase 1: matrix 437 rows 421 cols
[2024-05-22 13:29:03] [INFO ] Invariants computation overflowed in 43 ms
[2024-05-22 13:29:04] [INFO ] Implicit Places using invariants in 293 ms returned []
// Phase 1: matrix 437 rows 421 cols
[2024-05-22 13:29:04] [INFO ] Invariants computation overflowed in 37 ms
[2024-05-22 13:29:04] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 13:29:17] [INFO ] Implicit Places using invariants and state equation in 13305 ms returned []
Implicit Place search using SMT with State Equation took 13598 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 20 : 421/477 places, 437/455 transitions.
Finished structural reductions in REACHABILITY mode , in 20 iterations and 206310 ms. Remains : 421/477 places, 437/455 transitions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND p1 (NOT p2)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 205 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(OR (NOT p0) (AND p1 (NOT p2))), true, (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 92 ms :[(OR (NOT p0) (AND p1 (NOT p2))), true, (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 84 ms :[(OR (NOT p0) (AND p1 (NOT p2))), true, (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 13903 reset in 107 ms.
Product exploration explored 100000 steps with 13789 reset in 122 ms.
Support contains 4 out of 557 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 557/557 places, 535/535 transitions.
Applied a total of 0 rules in 8 ms. Remains 557 /557 variables (removed 0) and now considering 535/535 (removed 0) transitions.
// Phase 1: matrix 535 rows 557 cols
[2024-05-22 13:29:18] [INFO ] Computed 99 invariants in 48 ms
[2024-05-22 13:29:18] [INFO ] Implicit Places using invariants in 301 ms returned []
[2024-05-22 13:29:18] [INFO ] Invariant cache hit.
[2024-05-22 13:29:18] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-22 13:29:24] [INFO ] Implicit Places using invariants and state equation in 6386 ms returned []
Implicit Place search using SMT with State Equation took 6689 ms to find 0 implicit places.
[2024-05-22 13:29:24] [INFO ] Redundant transitions in 3 ms returned []
Running 534 sub problems to find dead transitions.
[2024-05-22 13:29:24] [INFO ] Invariant cache hit.
[2024-05-22 13:29:24] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/556 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/556 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/556 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 3 (OVERLAPS) 535/1091 variables, 556/655 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1091 variables, 37/692 constraints. Problems are: Problem set: 0 solved, 534 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 5.0)
(s4 1.0)
(s5 1.0)
(s6 17.0)
(s7 1.0)
(s8 30.0)
(s9 29.0)
(s10 15.0)
(s11 2.0)
(s12 5.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 9.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 5.0)
(s28 0.0)
(s29 1.0)
(s30 1.0)
(s31 0.0)
(s32 287.0)
(s33 298.0)
(s34 1.0)
(s35 296.0)
(s36 12.0)
(s37 1.0)
(s38 5.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 5.0)
(s44 1.0)
(s45 2.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 46578847.0)
(s64 1.0)
(s65 266.0)
(s66 285.0)
(s67 280.0)
(s68 20.0)
(s69 1.0)
(s70 8.0)
(s71 1.0)
(s72 1.0)
(s73 13.0)
(s74 5.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 9.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 5.0)
(s91 1.0)
(s92 1.0)
(s93 276.0)
(s94 277.0)
(s95 255.0)
(s96 1.0)
(s97 1.0)
(s98 25.0)
(s99 5.0)
(s100 1.0)
(s101 1.0)
(s102 9.0)
(s103 1.0)
(s104 6.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 5.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 244.0)
(s126 256.0)
(s127 251.0)
(s128 14.0)
(s129 1.0)
(s130 9.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 9.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 5.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 237.0)
(s159 232.0)
(s160 222.0)
(s161 1.0)
(s162 5.0)
(s163 18.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 13.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 9.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 5.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 212.0)
(s192 223.0)
(s193 218.0)
(s194 12.0)
(s195 1.0)
(s196 8.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 13.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 0.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 9.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 5.0)
(s219 1.0)
(s220 1.0)
(s221 207.0)
(s222 204.0)
(s223 194.0)
(s224 1.0)
(s225 0.0)
(s226 4.0)
(s227 16.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 13.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 0.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 9.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 5.0)
(s249 1.0)
(s250 1.0)
(s251 180.0)
(s252 0.0)
(s253 191.0)
(s254 186.0)
(s255 12.0)
(s256 1.0)
(s257 8.0)
(s258 1.0)
(s259 1.0)
(s260 0.0)
(s261 1.0)
(s262 13.0)
(s263 1.0)
(s264 0.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 9.0)
(s275 0.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 5.0)
(s281 1.0)
(s282 1.0)
(s283 175.0)
(s284 172.0)
(s285 162.0)
(s286 1.0)
(s287 4.0)
(s288 16.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 13.0)
(s294 297.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 304.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 306.0)
(s306 1.0)
(s307 9.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 10.0)
(s313 5.0)
(s314 1.0)
(s315 1.0)
(s316 148.0)
(s317 159.0)
(s318 154.0)
(s319 12.0)
(s320 1.0)
(s321 3.0)
(s322 8.0)
(s323 1.0)
(s324 1.0)
(s325 5.0)
(s326 3.0)
(s327 13.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 9.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 5.0)
(s346 1.0)
(s347 1.0)
(s348 143.0)
(s349 140.0)
(s350 126.0)
(s351 1.0)
(s352 4.0)
(s353 20.0)
(s354 1.0)
(s355 1.0)
(s356 9.0)
(s357 5.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 5.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 5.0)
(s376 1.0)
(s377 123.0)
(s378 123.0)
(s379 103.0)
(s380 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1091/1092 variables, and 692 constraints, problems are : Problem set: 0 solved, 534 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 556/557 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 534/534 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 534 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/556 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/556 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/556 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 3 (OVERLAPS) 535/1091 variables, 556/655 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1091 variables, 37/692 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1091 variables, 531/1223 constraints. Problems are: Problem set: 0 solved, 534 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1091/1092 variables, and 1223 constraints, problems are : Problem set: 0 solved, 534 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 556/557 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 531/534 constraints, Known Traps: 0/0 constraints]
After SMT, in 60129ms problems are : Problem set: 0 solved, 534 unsolved
Search for dead transitions found 0 dead transitions in 60136ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 66844 ms. Remains : 557/557 places, 535/535 transitions.
Treatment of property DoubleExponent-PT-020-LTLFireability-10 finished in 694887 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G((X(!p1) U p2))))'
Support contains 5 out of 1057 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Applied a total of 0 rules in 34 ms. Remains 1057 /1057 variables (removed 0) and now considering 997/997 (removed 0) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2024-05-22 13:30:25] [INFO ] Invariants computation overflowed in 115 ms
[2024-05-22 13:30:25] [INFO ] Implicit Places using invariants in 407 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2024-05-22 13:30:25] [INFO ] Invariants computation overflowed in 113 ms
[2024-05-22 13:30:38] [INFO ] Implicit Places using invariants and state equation in 13378 ms returned []
Implicit Place search using SMT with State Equation took 13785 ms to find 0 implicit places.
Running 996 sub problems to find dead transitions.
// Phase 1: matrix 997 rows 1057 cols
[2024-05-22 13:30:38] [INFO ] Invariants computation overflowed in 102 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1056 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 996 unsolved
At refinement iteration 1 (OVERLAPS) 997/2053 variables, 1056/1056 constraints. Problems are: Problem set: 0 solved, 996 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2053/2054 variables, and 1056 constraints, problems are : Problem set: 0 solved, 996 unsolved in 30036 ms.
Refiners :[State Equation: 1056/1057 constraints, PredecessorRefiner: 996/996 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 996 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1056 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 996 unsolved
At refinement iteration 1 (OVERLAPS) 997/2053 variables, 1056/1056 constraints. Problems are: Problem set: 0 solved, 996 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2053 variables, 996/2052 constraints. Problems are: Problem set: 0 solved, 996 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2053/2054 variables, and 2052 constraints, problems are : Problem set: 0 solved, 996 unsolved in 30030 ms.
Refiners :[State Equation: 1056/1057 constraints, PredecessorRefiner: 996/996 constraints, Known Traps: 0/0 constraints]
After SMT, in 60311ms problems are : Problem set: 0 solved, 996 unsolved
Search for dead transitions found 0 dead transitions in 60319ms
Finished structural reductions in LTL mode , in 1 iterations and 74140 ms. Remains : 1057/1057 places, 997/997 transitions.
Stuttering acceptance computed with spot in 175 ms :[(NOT p2), (OR (NOT p2) p1), (NOT p2), (NOT p2), true]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-11
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-020-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-020-LTLFireability-11 finished in 74356 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(!p0))||((G(F(!p0))||(F(!p0)&&F(p1)))&&F(p2))))'
Support contains 3 out of 1057 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1056 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 0 with 240 rules applied. Total rules applied 241 place count 1055 transition count 755
Reduce places removed 240 places and 0 transitions.
Iterating post reduction 1 with 240 rules applied. Total rules applied 481 place count 815 transition count 755
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 39 Pre rules applied. Total rules applied 481 place count 815 transition count 716
Deduced a syphon composed of 39 places in 6 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 559 place count 776 transition count 716
Performed 182 Post agglomeration using F-continuation condition.Transition count delta: 182
Deduced a syphon composed of 182 places in 2 ms
Reduce places removed 182 places and 0 transitions.
Iterating global reduction 2 with 364 rules applied. Total rules applied 923 place count 594 transition count 534
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 37 places in 2 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 997 place count 557 transition count 534
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 998 place count 556 transition count 533
Applied a total of 998 rules in 67 ms. Remains 556 /1057 variables (removed 501) and now considering 533/997 (removed 464) transitions.
// Phase 1: matrix 533 rows 556 cols
[2024-05-22 13:31:39] [INFO ] Computed 99 invariants in 53 ms
[2024-05-22 13:31:39] [INFO ] Implicit Places using invariants in 328 ms returned []
[2024-05-22 13:31:39] [INFO ] Invariant cache hit.
[2024-05-22 13:31:39] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-22 13:31:47] [INFO ] Implicit Places using invariants and state equation in 7682 ms returned []
Implicit Place search using SMT with State Equation took 8011 ms to find 0 implicit places.
[2024-05-22 13:31:47] [INFO ] Redundant transitions in 5 ms returned []
Running 532 sub problems to find dead transitions.
[2024-05-22 13:31:47] [INFO ] Invariant cache hit.
[2024-05-22 13:31:47] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/555 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 532 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/555 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 532 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/555 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 532 unsolved
At refinement iteration 3 (OVERLAPS) 533/1088 variables, 555/654 constraints. Problems are: Problem set: 0 solved, 532 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1088 variables, 38/692 constraints. Problems are: Problem set: 0 solved, 532 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1088/1089 variables, and 692 constraints, problems are : Problem set: 0 solved, 532 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 555/556 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 532/532 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 532 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/555 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 532 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/555 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 532 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/555 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 532 unsolved
At refinement iteration 3 (OVERLAPS) 533/1088 variables, 555/654 constraints. Problems are: Problem set: 0 solved, 532 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1088 variables, 38/692 constraints. Problems are: Problem set: 0 solved, 532 unsolved

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DoubleExponent-PT-020"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is DoubleExponent-PT-020, 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 r135-tall-171631131400564"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-020.tgz
mv DoubleExponent-PT-020 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;