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.r488-tall-171631132900563.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 ltsminxred
Input is DoubleExponent-PT-020, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r488-tall-171631132900563
=====================================================================

--------------------
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-LTLCardinality-00
FORMULA_NAME DoubleExponent-PT-020-LTLCardinality-01
FORMULA_NAME DoubleExponent-PT-020-LTLCardinality-02
FORMULA_NAME DoubleExponent-PT-020-LTLCardinality-03
FORMULA_NAME DoubleExponent-PT-020-LTLCardinality-04
FORMULA_NAME DoubleExponent-PT-020-LTLCardinality-05
FORMULA_NAME DoubleExponent-PT-020-LTLCardinality-06
FORMULA_NAME DoubleExponent-PT-020-LTLCardinality-07
FORMULA_NAME DoubleExponent-PT-020-LTLCardinality-08
FORMULA_NAME DoubleExponent-PT-020-LTLCardinality-09
FORMULA_NAME DoubleExponent-PT-020-LTLCardinality-10
FORMULA_NAME DoubleExponent-PT-020-LTLCardinality-11
FORMULA_NAME DoubleExponent-PT-020-LTLCardinality-12
FORMULA_NAME DoubleExponent-PT-020-LTLCardinality-13
FORMULA_NAME DoubleExponent-PT-020-LTLCardinality-14
FORMULA_NAME DoubleExponent-PT-020-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717194640139

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-020
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:30:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 22:30:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:30:41] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2024-05-31 22:30:41] [INFO ] Transformed 1064 places.
[2024-05-31 22:30:41] [INFO ] Transformed 998 transitions.
[2024-05-31 22:30:41] [INFO ] Parsed PT model containing 1064 places and 998 transitions and 2814 arcs in 201 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA DoubleExponent-PT-020-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-020-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-020-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-020-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 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 168 ms. Remains 1060 /1064 variables (removed 4) and now considering 998/998 (removed 0) transitions.
// Phase 1: matrix 998 rows 1060 cols
[2024-05-31 22:30:42] [INFO ] Invariants computation overflowed in 163 ms
[2024-05-31 22:30:42] [INFO ] Implicit Places using invariants in 980 ms returned []
// Phase 1: matrix 998 rows 1060 cols
[2024-05-31 22:30:43] [INFO ] Invariants computation overflowed in 103 ms
[2024-05-31 22:30:56] [INFO ] Implicit Places using invariants and state equation in 13785 ms returned [28, 30]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 14809 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-31 22:30:57] [INFO ] Invariants computation overflowed in 133 ms
[2024-05-31 22:30:57] [INFO ] Implicit Places using invariants in 414 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2024-05-31 22:30:57] [INFO ] Invariants computation overflowed in 118 ms
[2024-05-31 22:31:14] [INFO ] Implicit Places using invariants and state equation in 17464 ms returned []
Implicit Place search using SMT with State Equation took 17884 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 33047 ms. Remains : 1057/1064 places, 997/998 transitions.
Support contains 42 out of 1057 places after structural reductions.
[2024-05-31 22:31:15] [INFO ] Flatten gal took : 93 ms
[2024-05-31 22:31:15] [INFO ] Flatten gal took : 52 ms
[2024-05-31 22:31:15] [INFO ] Input system was already deterministic with 997 transitions.
Support contains 38 out of 1057 places (down from 42) after GAL structural reductions.
RANDOM walk for 40000 steps (1311 resets) in 1979 ms. (20 steps per ms) remains 21/23 properties
BEST_FIRST walk for 4001 steps (113 resets) in 86 ms. (45 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (119 resets) in 31 ms. (125 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (112 resets) in 52 ms. (75 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (108 resets) in 49 ms. (80 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (113 resets) in 43 ms. (90 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (105 resets) in 34 ms. (114 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (108 resets) in 52 ms. (75 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (112 resets) in 34 ms. (114 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (113 resets) in 28 ms. (137 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (111 resets) in 47 ms. (83 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (107 resets) in 23 ms. (166 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (112 resets) in 21 ms. (181 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (108 resets) in 22 ms. (173 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (110 resets) in 38 ms. (102 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (110 resets) in 24 ms. (160 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (109 resets) in 39 ms. (100 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (111 resets) in 37 ms. (105 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (113 resets) in 51 ms. (76 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (111 resets) in 37 ms. (105 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (115 resets) in 45 ms. (86 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (115 resets) in 54 ms. (72 steps per ms) remains 21/21 properties
Interrupted probabilistic random walk after 151561 steps, run timeout after 3004 ms. (steps per millisecond=50 ) properties seen :0 out of 21
Probabilistic random walk after 151561 steps, saw 75796 distinct states, run finished after 3008 ms. (steps per millisecond=50 ) properties seen :0
// Phase 1: matrix 997 rows 1057 cols
[2024-05-31 22:31:19] [INFO ] Invariants computation overflowed in 95 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 95/129 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 421/550 variables, 167/201 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/550 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 689/1239 variables, 354/555 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1239 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 499/1738 variables, 295/850 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1738 variables, 0/850 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (OVERLAPS) 180/1918 variables, 127/977 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1918 variables, 0/977 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (OVERLAPS) 54/1972 variables, 31/1008 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1972 variables, 0/1008 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 13 (OVERLAPS) 55/2027 variables, 29/1037 constraints. Problems are: Problem set: 0 solved, 21 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2027/2054 variables, and 1037 constraints, problems are : Problem set: 0 solved, 21 unsolved in 5012 ms.
Refiners :[State Equation: 1037/1057 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 95/129 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 421/550 variables, 167/201 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/550 variables, 21/222 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/550 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 689/1239 variables, 354/576 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1239 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 499/1738 variables, 295/871 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1738 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (OVERLAPS) 180/1918 variables, 127/998 constraints. Problems are: Problem set: 0 solved, 21 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1918/2054 variables, and 998 constraints, problems are : Problem set: 0 solved, 21 unsolved in 5022 ms.
Refiners :[State Equation: 977/1057 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
After SMT, in 10185ms problems are : Problem set: 0 solved, 21 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 34 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 206 transitions
Trivial Post-agglo rules discarded 206 transitions
Performed 206 trivial Post agglomeration. Transition count delta: 206
Iterating post reduction 0 with 207 rules applied. Total rules applied 208 place count 1055 transition count 789
Reduce places removed 206 places and 0 transitions.
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Iterating post reduction 1 with 223 rules applied. Total rules applied 431 place count 849 transition count 772
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 448 place count 832 transition count 772
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 448 place count 832 transition count 728
Deduced a syphon composed of 44 places in 7 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 536 place count 788 transition count 728
Performed 160 Post agglomeration using F-continuation condition.Transition count delta: 160
Deduced a syphon composed of 160 places in 3 ms
Reduce places removed 160 places and 0 transitions.
Iterating global reduction 3 with 320 rules applied. Total rules applied 856 place count 628 transition count 568
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 34 places in 27 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 924 place count 594 transition count 568
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 925 place count 594 transition count 567
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 926 place count 593 transition count 567
Free-agglomeration rule (complex) applied 78 times.
Iterating global reduction 4 with 78 rules applied. Total rules applied 1004 place count 593 transition count 489
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 4 with 78 rules applied. Total rules applied 1082 place count 515 transition count 489
Partial Free-agglomeration rule applied 78 times.
Drop transitions (Partial Free agglomeration) removed 78 transitions
Iterating global reduction 5 with 78 rules applied. Total rules applied 1160 place count 515 transition count 489
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1161 place count 514 transition count 488
Applied a total of 1161 rules in 385 ms. Remains 514 /1057 variables (removed 543) and now considering 488/997 (removed 509) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 385 ms. Remains : 514/1057 places, 488/997 transitions.
RANDOM walk for 40000 steps (5159 resets) in 943 ms. (42 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (346 resets) in 39 ms. (100 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (344 resets) in 54 ms. (72 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (332 resets) in 48 ms. (81 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (336 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (334 resets) in 26 ms. (148 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (349 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (326 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (325 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (348 resets) in 34 ms. (114 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (326 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (332 resets) in 39 ms. (100 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (338 resets) in 30 ms. (129 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (338 resets) in 31 ms. (125 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (348 resets) in 22 ms. (173 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (336 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (339 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (344 resets) in 21 ms. (181 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (341 resets) in 30 ms. (129 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (338 resets) in 24 ms. (160 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (318 resets) in 31 ms. (125 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (318 resets) in 22 ms. (173 steps per ms) remains 21/21 properties
Interrupted probabilistic random walk after 169041 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :0 out of 21
Probabilistic random walk after 169041 steps, saw 84541 distinct states, run finished after 3001 ms. (steps per millisecond=56 ) properties seen :0
// Phase 1: matrix 488 rows 514 cols
[2024-05-31 22:31:33] [INFO ] Computed 99 invariants in 59 ms
[2024-05-31 22:31:33] [INFO ] State equation strengthened by 64 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 376/410 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 21 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp22 is UNSAT
At refinement iteration 3 (OVERLAPS) 97/507 variables, 39/96 constraints. Problems are: Problem set: 8 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/507 variables, 0/96 constraints. Problems are: Problem set: 8 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 2/509 variables, 1/97 constraints. Problems are: Problem set: 8 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/509 variables, 0/97 constraints. Problems are: Problem set: 8 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 488/997 variables, 509/606 constraints. Problems are: Problem set: 8 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/997 variables, 64/670 constraints. Problems are: Problem set: 8 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/997 variables, 0/670 constraints. Problems are: Problem set: 8 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 5/1002 variables, 5/675 constraints. Problems are: Problem set: 8 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1002 variables, 2/677 constraints. Problems are: Problem set: 8 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1002 variables, 0/677 constraints. Problems are: Problem set: 8 solved, 13 unsolved
At refinement iteration 13 (OVERLAPS) 0/1002 variables, 0/677 constraints. Problems are: Problem set: 8 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1002/1002 variables, and 677 constraints, problems are : Problem set: 8 solved, 13 unsolved in 5703 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 514/514 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 374/399 variables, 53/53 constraints. Problems are: Problem set: 8 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/399 variables, 0/53 constraints. Problems are: Problem set: 8 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 108/507 variables, 43/96 constraints. Problems are: Problem set: 8 solved, 13 unsolved
[2024-05-31 22:31:40] [INFO ] Deduced a trap composed of 11 places in 311 ms of which 27 ms to minimize.
[2024-05-31 22:31:40] [INFO ] Deduced a trap composed of 7 places in 322 ms of which 7 ms to minimize.
[2024-05-31 22:31:41] [INFO ] Deduced a trap composed of 7 places in 458 ms of which 9 ms to minimize.
[2024-05-31 22:31:41] [INFO ] Deduced a trap composed of 10 places in 209 ms of which 4 ms to minimize.
[2024-05-31 22:31:41] [INFO ] Deduced a trap composed of 15 places in 346 ms of which 3 ms to minimize.
[2024-05-31 22:31:41] [INFO ] Deduced a trap composed of 16 places in 191 ms of which 3 ms to minimize.
[2024-05-31 22:31:42] [INFO ] Deduced a trap composed of 138 places in 311 ms of which 6 ms to minimize.
[2024-05-31 22:31:42] [INFO ] Deduced a trap composed of 151 places in 339 ms of which 7 ms to minimize.
[2024-05-31 22:31:42] [INFO ] Deduced a trap composed of 13 places in 238 ms of which 3 ms to minimize.
[2024-05-31 22:31:43] [INFO ] Deduced a trap composed of 139 places in 428 ms of which 44 ms to minimize.
[2024-05-31 22:31:43] [INFO ] Deduced a trap composed of 154 places in 607 ms of which 3 ms to minimize.
[2024-05-31 22:31:44] [INFO ] Deduced a trap composed of 153 places in 198 ms of which 5 ms to minimize.
[2024-05-31 22:31:44] [INFO ] Deduced a trap composed of 151 places in 228 ms of which 10 ms to minimize.
[2024-05-31 22:31:44] [INFO ] Deduced a trap composed of 132 places in 192 ms of which 3 ms to minimize.
[2024-05-31 22:31:44] [INFO ] Deduced a trap composed of 13 places in 195 ms of which 3 ms to minimize.
[2024-05-31 22:31:45] [INFO ] Deduced a trap composed of 15 places in 197 ms of which 3 ms to minimize.
[2024-05-31 22:31:45] [INFO ] Deduced a trap composed of 14 places in 195 ms of which 3 ms to minimize.
[2024-05-31 22:31:45] [INFO ] Deduced a trap composed of 136 places in 204 ms of which 3 ms to minimize.
[2024-05-31 22:31:45] [INFO ] Deduced a trap composed of 135 places in 193 ms of which 3 ms to minimize.
[2024-05-31 22:31:45] [INFO ] Deduced a trap composed of 144 places in 187 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/507 variables, 20/116 constraints. Problems are: Problem set: 8 solved, 13 unsolved
[2024-05-31 22:31:46] [INFO ] Deduced a trap composed of 16 places in 201 ms of which 3 ms to minimize.
[2024-05-31 22:31:46] [INFO ] Deduced a trap composed of 168 places in 188 ms of which 3 ms to minimize.
[2024-05-31 22:31:46] [INFO ] Deduced a trap composed of 155 places in 202 ms of which 3 ms to minimize.
[2024-05-31 22:31:46] [INFO ] Deduced a trap composed of 162 places in 194 ms of which 3 ms to minimize.
[2024-05-31 22:31:46] [INFO ] Deduced a trap composed of 157 places in 199 ms of which 3 ms to minimize.
[2024-05-31 22:31:47] [INFO ] Deduced a trap composed of 155 places in 198 ms of which 3 ms to minimize.
[2024-05-31 22:31:47] [INFO ] Deduced a trap composed of 19 places in 201 ms of which 3 ms to minimize.
[2024-05-31 22:31:47] [INFO ] Deduced a trap composed of 142 places in 231 ms of which 3 ms to minimize.
[2024-05-31 22:31:47] [INFO ] Deduced a trap composed of 155 places in 189 ms of which 3 ms to minimize.
[2024-05-31 22:31:47] [INFO ] Deduced a trap composed of 142 places in 204 ms of which 3 ms to minimize.
[2024-05-31 22:31:48] [INFO ] Deduced a trap composed of 140 places in 220 ms of which 3 ms to minimize.
[2024-05-31 22:31:48] [INFO ] Deduced a trap composed of 139 places in 208 ms of which 3 ms to minimize.
[2024-05-31 22:31:48] [INFO ] Deduced a trap composed of 143 places in 185 ms of which 3 ms to minimize.
[2024-05-31 22:31:48] [INFO ] Deduced a trap composed of 138 places in 183 ms of which 3 ms to minimize.
[2024-05-31 22:31:49] [INFO ] Deduced a trap composed of 132 places in 200 ms of which 6 ms to minimize.
[2024-05-31 22:31:49] [INFO ] Deduced a trap composed of 140 places in 196 ms of which 3 ms to minimize.
[2024-05-31 22:31:49] [INFO ] Deduced a trap composed of 20 places in 180 ms of which 3 ms to minimize.
[2024-05-31 22:31:49] [INFO ] Deduced a trap composed of 152 places in 223 ms of which 3 ms to minimize.
[2024-05-31 22:31:49] [INFO ] Deduced a trap composed of 22 places in 200 ms of which 3 ms to minimize.
[2024-05-31 22:31:50] [INFO ] Deduced a trap composed of 151 places in 226 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/507 variables, 20/136 constraints. Problems are: Problem set: 8 solved, 13 unsolved
[2024-05-31 22:31:50] [INFO ] Deduced a trap composed of 19 places in 191 ms of which 3 ms to minimize.
[2024-05-31 22:31:50] [INFO ] Deduced a trap composed of 150 places in 193 ms of which 3 ms to minimize.
[2024-05-31 22:31:50] [INFO ] Deduced a trap composed of 154 places in 192 ms of which 2 ms to minimize.
[2024-05-31 22:31:50] [INFO ] Deduced a trap composed of 143 places in 205 ms of which 3 ms to minimize.
[2024-05-31 22:31:51] [INFO ] Deduced a trap composed of 149 places in 186 ms of which 3 ms to minimize.
[2024-05-31 22:31:51] [INFO ] Deduced a trap composed of 156 places in 193 ms of which 3 ms to minimize.
[2024-05-31 22:31:51] [INFO ] Deduced a trap composed of 149 places in 201 ms of which 3 ms to minimize.
[2024-05-31 22:31:51] [INFO ] Deduced a trap composed of 146 places in 191 ms of which 3 ms to minimize.
[2024-05-31 22:31:51] [INFO ] Deduced a trap composed of 145 places in 195 ms of which 2 ms to minimize.
[2024-05-31 22:31:52] [INFO ] Deduced a trap composed of 151 places in 187 ms of which 5 ms to minimize.
[2024-05-31 22:31:52] [INFO ] Deduced a trap composed of 159 places in 201 ms of which 3 ms to minimize.
[2024-05-31 22:31:52] [INFO ] Deduced a trap composed of 149 places in 187 ms of which 3 ms to minimize.
[2024-05-31 22:31:52] [INFO ] Deduced a trap composed of 143 places in 206 ms of which 3 ms to minimize.
[2024-05-31 22:31:53] [INFO ] Deduced a trap composed of 149 places in 197 ms of which 3 ms to minimize.
[2024-05-31 22:31:53] [INFO ] Deduced a trap composed of 156 places in 185 ms of which 3 ms to minimize.
[2024-05-31 22:31:53] [INFO ] Deduced a trap composed of 146 places in 215 ms of which 5 ms to minimize.
[2024-05-31 22:31:53] [INFO ] Deduced a trap composed of 124 places in 190 ms of which 3 ms to minimize.
[2024-05-31 22:31:53] [INFO ] Deduced a trap composed of 150 places in 190 ms of which 3 ms to minimize.
[2024-05-31 22:31:54] [INFO ] Deduced a trap composed of 146 places in 210 ms of which 3 ms to minimize.
[2024-05-31 22:31:54] [INFO ] Deduced a trap composed of 28 places in 204 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/507 variables, 20/156 constraints. Problems are: Problem set: 8 solved, 13 unsolved
[2024-05-31 22:31:54] [INFO ] Deduced a trap composed of 9 places in 189 ms of which 3 ms to minimize.
[2024-05-31 22:31:54] [INFO ] Deduced a trap composed of 12 places in 206 ms of which 3 ms to minimize.
[2024-05-31 22:31:55] [INFO ] Deduced a trap composed of 25 places in 183 ms of which 3 ms to minimize.
[2024-05-31 22:31:55] [INFO ] Deduced a trap composed of 31 places in 183 ms of which 4 ms to minimize.
[2024-05-31 22:31:55] [INFO ] Deduced a trap composed of 142 places in 183 ms of which 4 ms to minimize.
[2024-05-31 22:31:55] [INFO ] Deduced a trap composed of 17 places in 182 ms of which 3 ms to minimize.
[2024-05-31 22:31:55] [INFO ] Deduced a trap composed of 28 places in 171 ms of which 3 ms to minimize.
[2024-05-31 22:31:55] [INFO ] Deduced a trap composed of 141 places in 170 ms of which 3 ms to minimize.
[2024-05-31 22:31:56] [INFO ] Deduced a trap composed of 23 places in 170 ms of which 3 ms to minimize.
[2024-05-31 22:31:56] [INFO ] Deduced a trap composed of 28 places in 167 ms of which 3 ms to minimize.
[2024-05-31 22:31:56] [INFO ] Deduced a trap composed of 27 places in 185 ms of which 3 ms to minimize.
[2024-05-31 22:31:56] [INFO ] Deduced a trap composed of 21 places in 183 ms of which 3 ms to minimize.
[2024-05-31 22:31:56] [INFO ] Deduced a trap composed of 130 places in 181 ms of which 2 ms to minimize.
[2024-05-31 22:31:57] [INFO ] Deduced a trap composed of 144 places in 178 ms of which 3 ms to minimize.
[2024-05-31 22:31:57] [INFO ] Deduced a trap composed of 128 places in 177 ms of which 3 ms to minimize.
[2024-05-31 22:31:57] [INFO ] Deduced a trap composed of 29 places in 172 ms of which 3 ms to minimize.
[2024-05-31 22:31:57] [INFO ] Deduced a trap composed of 32 places in 180 ms of which 3 ms to minimize.
[2024-05-31 22:31:57] [INFO ] Deduced a trap composed of 31 places in 175 ms of which 3 ms to minimize.
[2024-05-31 22:31:58] [INFO ] Deduced a trap composed of 129 places in 175 ms of which 2 ms to minimize.
[2024-05-31 22:31:58] [INFO ] Deduced a trap composed of 123 places in 191 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/507 variables, 20/176 constraints. Problems are: Problem set: 8 solved, 13 unsolved
[2024-05-31 22:31:58] [INFO ] Deduced a trap composed of 36 places in 172 ms of which 3 ms to minimize.
[2024-05-31 22:31:58] [INFO ] Deduced a trap composed of 36 places in 165 ms of which 3 ms to minimize.
[2024-05-31 22:31:58] [INFO ] Deduced a trap composed of 32 places in 168 ms of which 2 ms to minimize.
[2024-05-31 22:31:58] [INFO ] Deduced a trap composed of 148 places in 167 ms of which 3 ms to minimize.
[2024-05-31 22:31:59] [INFO ] Deduced a trap composed of 101 places in 166 ms of which 3 ms to minimize.
[2024-05-31 22:31:59] [INFO ] Deduced a trap composed of 32 places in 166 ms of which 3 ms to minimize.
[2024-05-31 22:31:59] [INFO ] Deduced a trap composed of 102 places in 178 ms of which 3 ms to minimize.
[2024-05-31 22:31:59] [INFO ] Deduced a trap composed of 45 places in 168 ms of which 3 ms to minimize.
[2024-05-31 22:31:59] [INFO ] Deduced a trap composed of 134 places in 161 ms of which 2 ms to minimize.
[2024-05-31 22:32:00] [INFO ] Deduced a trap composed of 109 places in 163 ms of which 3 ms to minimize.
[2024-05-31 22:32:00] [INFO ] Deduced a trap composed of 37 places in 182 ms of which 3 ms to minimize.
[2024-05-31 22:32:00] [INFO ] Deduced a trap composed of 94 places in 179 ms of which 3 ms to minimize.
[2024-05-31 22:32:00] [INFO ] Deduced a trap composed of 146 places in 178 ms of which 3 ms to minimize.
[2024-05-31 22:32:00] [INFO ] Deduced a trap composed of 136 places in 184 ms of which 2 ms to minimize.
[2024-05-31 22:32:01] [INFO ] Deduced a trap composed of 94 places in 179 ms of which 3 ms to minimize.
[2024-05-31 22:32:01] [INFO ] Deduced a trap composed of 90 places in 180 ms of which 3 ms to minimize.
[2024-05-31 22:32:01] [INFO ] Deduced a trap composed of 30 places in 169 ms of which 3 ms to minimize.
[2024-05-31 22:32:01] [INFO ] Deduced a trap composed of 139 places in 167 ms of which 3 ms to minimize.
[2024-05-31 22:32:01] [INFO ] Deduced a trap composed of 134 places in 184 ms of which 3 ms to minimize.
[2024-05-31 22:32:01] [INFO ] Deduced a trap composed of 152 places in 168 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/507 variables, 20/196 constraints. Problems are: Problem set: 8 solved, 13 unsolved
[2024-05-31 22:32:02] [INFO ] Deduced a trap composed of 152 places in 164 ms of which 3 ms to minimize.
[2024-05-31 22:32:02] [INFO ] Deduced a trap composed of 130 places in 183 ms of which 3 ms to minimize.
[2024-05-31 22:32:02] [INFO ] Deduced a trap composed of 115 places in 172 ms of which 3 ms to minimize.
[2024-05-31 22:32:02] [INFO ] Deduced a trap composed of 143 places in 164 ms of which 2 ms to minimize.
[2024-05-31 22:32:02] [INFO ] Deduced a trap composed of 110 places in 178 ms of which 3 ms to minimize.
[2024-05-31 22:32:03] [INFO ] Deduced a trap composed of 106 places in 177 ms of which 3 ms to minimize.
[2024-05-31 22:32:03] [INFO ] Deduced a trap composed of 42 places in 176 ms of which 3 ms to minimize.
[2024-05-31 22:32:03] [INFO ] Deduced a trap composed of 120 places in 179 ms of which 3 ms to minimize.
[2024-05-31 22:32:03] [INFO ] Deduced a trap composed of 131 places in 173 ms of which 3 ms to minimize.
[2024-05-31 22:32:03] [INFO ] Deduced a trap composed of 148 places in 169 ms of which 3 ms to minimize.
[2024-05-31 22:32:04] [INFO ] Deduced a trap composed of 50 places in 162 ms of which 3 ms to minimize.
[2024-05-31 22:32:04] [INFO ] Deduced a trap composed of 148 places in 167 ms of which 2 ms to minimize.
[2024-05-31 22:32:04] [INFO ] Deduced a trap composed of 27 places in 163 ms of which 3 ms to minimize.
[2024-05-31 22:32:04] [INFO ] Deduced a trap composed of 112 places in 164 ms of which 3 ms to minimize.
[2024-05-31 22:32:04] [INFO ] Deduced a trap composed of 118 places in 175 ms of which 3 ms to minimize.
[2024-05-31 22:32:04] [INFO ] Deduced a trap composed of 117 places in 161 ms of which 3 ms to minimize.
[2024-05-31 22:32:05] [INFO ] Deduced a trap composed of 138 places in 170 ms of which 2 ms to minimize.
[2024-05-31 22:32:05] [INFO ] Deduced a trap composed of 148 places in 161 ms of which 3 ms to minimize.
[2024-05-31 22:32:05] [INFO ] Deduced a trap composed of 127 places in 173 ms of which 3 ms to minimize.
[2024-05-31 22:32:05] [INFO ] Deduced a trap composed of 136 places in 176 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/507 variables, 20/216 constraints. Problems are: Problem set: 8 solved, 13 unsolved
[2024-05-31 22:32:05] [INFO ] Deduced a trap composed of 50 places in 94 ms of which 2 ms to minimize.
[2024-05-31 22:32:05] [INFO ] Deduced a trap composed of 52 places in 79 ms of which 1 ms to minimize.
[2024-05-31 22:32:06] [INFO ] Deduced a trap composed of 61 places in 74 ms of which 1 ms to minimize.
[2024-05-31 22:32:06] [INFO ] Deduced a trap composed of 122 places in 160 ms of which 3 ms to minimize.
[2024-05-31 22:32:06] [INFO ] Deduced a trap composed of 108 places in 158 ms of which 2 ms to minimize.
[2024-05-31 22:32:06] [INFO ] Deduced a trap composed of 145 places in 155 ms of which 2 ms to minimize.
[2024-05-31 22:32:06] [INFO ] Deduced a trap composed of 163 places in 168 ms of which 3 ms to minimize.
[2024-05-31 22:32:06] [INFO ] Deduced a trap composed of 96 places in 169 ms of which 3 ms to minimize.
[2024-05-31 22:32:07] [INFO ] Deduced a trap composed of 128 places in 166 ms of which 3 ms to minimize.
[2024-05-31 22:32:07] [INFO ] Deduced a trap composed of 143 places in 163 ms of which 3 ms to minimize.
[2024-05-31 22:32:07] [INFO ] Deduced a trap composed of 156 places in 164 ms of which 3 ms to minimize.
[2024-05-31 22:32:07] [INFO ] Deduced a trap composed of 150 places in 168 ms of which 3 ms to minimize.
[2024-05-31 22:32:07] [INFO ] Deduced a trap composed of 132 places in 157 ms of which 2 ms to minimize.
[2024-05-31 22:32:08] [INFO ] Deduced a trap composed of 135 places in 178 ms of which 3 ms to minimize.
[2024-05-31 22:32:08] [INFO ] Deduced a trap composed of 128 places in 164 ms of which 3 ms to minimize.
[2024-05-31 22:32:08] [INFO ] Deduced a trap composed of 141 places in 157 ms of which 3 ms to minimize.
[2024-05-31 22:32:08] [INFO ] Deduced a trap composed of 138 places in 157 ms of which 2 ms to minimize.
[2024-05-31 22:32:08] [INFO ] Deduced a trap composed of 143 places in 168 ms of which 3 ms to minimize.
[2024-05-31 22:32:09] [INFO ] Deduced a trap composed of 135 places in 171 ms of which 3 ms to minimize.
[2024-05-31 22:32:09] [INFO ] Deduced a trap composed of 138 places in 164 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/507 variables, 20/236 constraints. Problems are: Problem set: 8 solved, 13 unsolved
[2024-05-31 22:32:09] [INFO ] Deduced a trap composed of 134 places in 159 ms of which 3 ms to minimize.
[2024-05-31 22:32:09] [INFO ] Deduced a trap composed of 135 places in 170 ms of which 3 ms to minimize.
[2024-05-31 22:32:09] [INFO ] Deduced a trap composed of 143 places in 164 ms of which 4 ms to minimize.
[2024-05-31 22:32:09] [INFO ] Deduced a trap composed of 140 places in 174 ms of which 3 ms to minimize.
[2024-05-31 22:32:10] [INFO ] Deduced a trap composed of 139 places in 169 ms of which 3 ms to minimize.
[2024-05-31 22:32:10] [INFO ] Deduced a trap composed of 140 places in 157 ms of which 3 ms to minimize.
[2024-05-31 22:32:10] [INFO ] Deduced a trap composed of 133 places in 158 ms of which 2 ms to minimize.
[2024-05-31 22:32:10] [INFO ] Deduced a trap composed of 132 places in 157 ms of which 3 ms to minimize.
[2024-05-31 22:32:10] [INFO ] Deduced a trap composed of 148 places in 156 ms of which 3 ms to minimize.
[2024-05-31 22:32:10] [INFO ] Deduced a trap composed of 131 places in 159 ms of which 3 ms to minimize.
[2024-05-31 22:32:11] [INFO ] Deduced a trap composed of 129 places in 159 ms of which 3 ms to minimize.
[2024-05-31 22:32:11] [INFO ] Deduced a trap composed of 135 places in 159 ms of which 3 ms to minimize.
[2024-05-31 22:32:11] [INFO ] Deduced a trap composed of 71 places in 157 ms of which 3 ms to minimize.
[2024-05-31 22:32:11] [INFO ] Deduced a trap composed of 153 places in 178 ms of which 3 ms to minimize.
[2024-05-31 22:32:11] [INFO ] Deduced a trap composed of 54 places in 163 ms of which 2 ms to minimize.
[2024-05-31 22:32:12] [INFO ] Deduced a trap composed of 94 places in 162 ms of which 2 ms to minimize.
[2024-05-31 22:32:12] [INFO ] Deduced a trap composed of 94 places in 158 ms of which 3 ms to minimize.
[2024-05-31 22:32:12] [INFO ] Deduced a trap composed of 162 places in 157 ms of which 3 ms to minimize.
[2024-05-31 22:32:12] [INFO ] Deduced a trap composed of 155 places in 161 ms of which 3 ms to minimize.
[2024-05-31 22:32:12] [INFO ] Deduced a trap composed of 162 places in 162 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/507 variables, 20/256 constraints. Problems are: Problem set: 8 solved, 13 unsolved
[2024-05-31 22:32:12] [INFO ] Deduced a trap composed of 168 places in 161 ms of which 2 ms to minimize.
[2024-05-31 22:32:13] [INFO ] Deduced a trap composed of 146 places in 161 ms of which 3 ms to minimize.
[2024-05-31 22:32:13] [INFO ] Deduced a trap composed of 139 places in 175 ms of which 2 ms to minimize.
[2024-05-31 22:32:13] [INFO ] Deduced a trap composed of 135 places in 192 ms of which 3 ms to minimize.
[2024-05-31 22:32:13] [INFO ] Deduced a trap composed of 146 places in 188 ms of which 3 ms to minimize.
[2024-05-31 22:32:13] [INFO ] Deduced a trap composed of 144 places in 187 ms of which 3 ms to minimize.
[2024-05-31 22:32:14] [INFO ] Deduced a trap composed of 138 places in 196 ms of which 3 ms to minimize.
[2024-05-31 22:32:14] [INFO ] Deduced a trap composed of 144 places in 186 ms of which 3 ms to minimize.
[2024-05-31 22:32:14] [INFO ] Deduced a trap composed of 134 places in 188 ms of which 2 ms to minimize.
[2024-05-31 22:32:14] [INFO ] Deduced a trap composed of 134 places in 183 ms of which 3 ms to minimize.
[2024-05-31 22:32:14] [INFO ] Deduced a trap composed of 131 places in 190 ms of which 3 ms to minimize.
[2024-05-31 22:32:15] [INFO ] Deduced a trap composed of 11 places in 174 ms of which 3 ms to minimize.
[2024-05-31 22:32:15] [INFO ] Deduced a trap composed of 143 places in 173 ms of which 2 ms to minimize.
[2024-05-31 22:32:15] [INFO ] Deduced a trap composed of 131 places in 170 ms of which 3 ms to minimize.
[2024-05-31 22:32:15] [INFO ] Deduced a trap composed of 145 places in 188 ms of which 3 ms to minimize.
[2024-05-31 22:32:15] [INFO ] Deduced a trap composed of 135 places in 175 ms of which 3 ms to minimize.
[2024-05-31 22:32:16] [INFO ] Deduced a trap composed of 133 places in 186 ms of which 3 ms to minimize.
[2024-05-31 22:32:16] [INFO ] Deduced a trap composed of 127 places in 177 ms of which 3 ms to minimize.
[2024-05-31 22:32:16] [INFO ] Deduced a trap composed of 151 places in 175 ms of which 3 ms to minimize.
[2024-05-31 22:32:16] [INFO ] Deduced a trap composed of 131 places in 188 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/507 variables, 20/276 constraints. Problems are: Problem set: 8 solved, 13 unsolved
[2024-05-31 22:32:16] [INFO ] Deduced a trap composed of 18 places in 167 ms of which 3 ms to minimize.
[2024-05-31 22:32:17] [INFO ] Deduced a trap composed of 46 places in 168 ms of which 3 ms to minimize.
[2024-05-31 22:32:17] [INFO ] Deduced a trap composed of 57 places in 170 ms of which 3 ms to minimize.
[2024-05-31 22:32:17] [INFO ] Deduced a trap composed of 58 places in 172 ms of which 3 ms to minimize.
[2024-05-31 22:32:17] [INFO ] Deduced a trap composed of 27 places in 165 ms of which 3 ms to minimize.
[2024-05-31 22:32:17] [INFO ] Deduced a trap composed of 135 places in 158 ms of which 2 ms to minimize.
[2024-05-31 22:32:18] [INFO ] Deduced a trap composed of 159 places in 177 ms of which 2 ms to minimize.
[2024-05-31 22:32:18] [INFO ] Deduced a trap composed of 148 places in 170 ms of which 3 ms to minimize.
[2024-05-31 22:32:18] [INFO ] Deduced a trap composed of 138 places in 185 ms of which 3 ms to minimize.
[2024-05-31 22:32:18] [INFO ] Deduced a trap composed of 141 places in 184 ms of which 3 ms to minimize.
[2024-05-31 22:32:18] [INFO ] Deduced a trap composed of 145 places in 181 ms of which 3 ms to minimize.
[2024-05-31 22:32:18] [INFO ] Deduced a trap composed of 143 places in 182 ms of which 3 ms to minimize.
[2024-05-31 22:32:19] [INFO ] Deduced a trap composed of 126 places in 196 ms of which 3 ms to minimize.
[2024-05-31 22:32:19] [INFO ] Deduced a trap composed of 141 places in 182 ms of which 3 ms to minimize.
[2024-05-31 22:32:19] [INFO ] Deduced a trap composed of 124 places in 187 ms of which 3 ms to minimize.
[2024-05-31 22:32:19] [INFO ] Deduced a trap composed of 157 places in 187 ms of which 3 ms to minimize.
[2024-05-31 22:32:20] [INFO ] Deduced a trap composed of 142 places in 189 ms of which 3 ms to minimize.
[2024-05-31 22:32:20] [INFO ] Deduced a trap composed of 123 places in 294 ms of which 3 ms to minimize.
[2024-05-31 22:32:20] [INFO ] Deduced a trap composed of 114 places in 212 ms of which 5 ms to minimize.
[2024-05-31 22:32:20] [INFO ] Deduced a trap composed of 138 places in 181 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/507 variables, 20/296 constraints. Problems are: Problem set: 8 solved, 13 unsolved
[2024-05-31 22:32:20] [INFO ] Deduced a trap composed of 69 places in 114 ms of which 4 ms to minimize.
[2024-05-31 22:32:21] [INFO ] Deduced a trap composed of 115 places in 191 ms of which 2 ms to minimize.
[2024-05-31 22:32:21] [INFO ] Deduced a trap composed of 64 places in 156 ms of which 3 ms to minimize.
[2024-05-31 22:32:21] [INFO ] Deduced a trap composed of 140 places in 157 ms of which 3 ms to minimize.
[2024-05-31 22:32:21] [INFO ] Deduced a trap composed of 170 places in 153 ms of which 2 ms to minimize.
[2024-05-31 22:32:22] [INFO ] Deduced a trap composed of 157 places in 175 ms of which 4 ms to minimize.
[2024-05-31 22:32:22] [INFO ] Deduced a trap composed of 139 places in 166 ms of which 3 ms to minimize.
[2024-05-31 22:32:22] [INFO ] Deduced a trap composed of 102 places in 152 ms of which 2 ms to minimize.
[2024-05-31 22:32:22] [INFO ] Deduced a trap composed of 120 places in 172 ms of which 3 ms to minimize.
[2024-05-31 22:32:22] [INFO ] Deduced a trap composed of 41 places in 171 ms of which 3 ms to minimize.
[2024-05-31 22:32:22] [INFO ] Deduced a trap composed of 105 places in 170 ms of which 4 ms to minimize.
[2024-05-31 22:32:23] [INFO ] Deduced a trap composed of 149 places in 168 ms of which 3 ms to minimize.
[2024-05-31 22:32:23] [INFO ] Deduced a trap composed of 160 places in 166 ms of which 3 ms to minimize.
[2024-05-31 22:32:23] [INFO ] Deduced a trap composed of 105 places in 163 ms of which 3 ms to minimize.
[2024-05-31 22:32:23] [INFO ] Deduced a trap composed of 159 places in 170 ms of which 3 ms to minimize.
[2024-05-31 22:32:23] [INFO ] Deduced a trap composed of 104 places in 168 ms of which 3 ms to minimize.
[2024-05-31 22:32:23] [INFO ] Deduced a trap composed of 136 places in 158 ms of which 3 ms to minimize.
[2024-05-31 22:32:24] [INFO ] Deduced a trap composed of 150 places in 178 ms of which 3 ms to minimize.
[2024-05-31 22:32:24] [INFO ] Deduced a trap composed of 134 places in 166 ms of which 3 ms to minimize.
[2024-05-31 22:32:24] [INFO ] Deduced a trap composed of 167 places in 164 ms of which 3 ms to minimize.
SMT process timed out in 50971ms, After SMT, problems are : Problem set: 8 solved, 13 unsolved
Fused 13 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 25 out of 514 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 514/514 places, 488/488 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 514 transition count 487
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 513 transition count 487
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 513 transition count 486
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 512 transition count 486
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 12 place count 508 transition count 482
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 506 transition count 482
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 506 transition count 478
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 24 place count 502 transition count 478
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 27 place count 502 transition count 478
Applied a total of 27 rules in 97 ms. Remains 502 /514 variables (removed 12) and now considering 478/488 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 502/514 places, 478/488 transitions.
RANDOM walk for 40000 steps (5187 resets) in 187 ms. (212 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (3382 resets) in 163 ms. (243 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (3372 resets) in 160 ms. (248 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (3376 resets) in 194 ms. (205 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (3374 resets) in 174 ms. (228 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (3380 resets) in 133 ms. (298 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (3321 resets) in 141 ms. (281 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (3322 resets) in 178 ms. (223 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (3413 resets) in 170 ms. (233 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (3419 resets) in 157 ms. (253 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (3324 resets) in 131 ms. (303 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (3386 resets) in 132 ms. (300 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (3365 resets) in 189 ms. (210 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (3401 resets) in 184 ms. (216 steps per ms) remains 13/13 properties
Interrupted probabilistic random walk after 166018 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :0 out of 13
Probabilistic random walk after 166018 steps, saw 83036 distinct states, run finished after 3003 ms. (steps per millisecond=55 ) properties seen :0
// Phase 1: matrix 478 rows 502 cols
[2024-05-31 22:32:28] [INFO ] Invariants computation overflowed in 71 ms
[2024-05-31 22:32:28] [INFO ] State equation strengthened by 68 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 104/129 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 488/617 variables, 201/228 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/617 variables, 36/264 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/617 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 348/965 variables, 262/526 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/965 variables, 30/556 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/965 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 15/980 variables, 14/570 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/980 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (OVERLAPS) 0/980 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 980/980 variables, and 570 constraints, problems are : Problem set: 0 solved, 13 unsolved in 8085 ms.
Refiners :[State Equation: 502/502 constraints, ReadFeed: 68/68 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/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 104/129 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 488/617 variables, 201/228 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/617 variables, 36/264 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/617 variables, 13/277 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/617 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 348/965 variables, 262/539 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/965 variables, 30/569 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/965 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 15/980 variables, 14/583 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-31 22:32:44] [INFO ] Deduced a trap composed of 18 places in 195 ms of which 2 ms to minimize.
[2024-05-31 22:32:45] [INFO ] Deduced a trap composed of 13 places in 177 ms of which 2 ms to minimize.
[2024-05-31 22:32:45] [INFO ] Deduced a trap composed of 144 places in 180 ms of which 2 ms to minimize.
[2024-05-31 22:32:45] [INFO ] Deduced a trap composed of 20 places in 136 ms of which 2 ms to minimize.
[2024-05-31 22:32:45] [INFO ] Deduced a trap composed of 13 places in 141 ms of which 3 ms to minimize.
[2024-05-31 22:32:45] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 2 ms to minimize.
[2024-05-31 22:32:45] [INFO ] Deduced a trap composed of 41 places in 124 ms of which 2 ms to minimize.
[2024-05-31 22:32:46] [INFO ] Deduced a trap composed of 29 places in 126 ms of which 2 ms to minimize.
[2024-05-31 22:32:46] [INFO ] Deduced a trap composed of 36 places in 125 ms of which 2 ms to minimize.
[2024-05-31 22:32:46] [INFO ] Deduced a trap composed of 45 places in 120 ms of which 2 ms to minimize.
[2024-05-31 22:32:46] [INFO ] Deduced a trap composed of 63 places in 121 ms of which 2 ms to minimize.
[2024-05-31 22:32:46] [INFO ] Deduced a trap composed of 57 places in 119 ms of which 3 ms to minimize.
[2024-05-31 22:32:46] [INFO ] Deduced a trap composed of 59 places in 117 ms of which 2 ms to minimize.
[2024-05-31 22:32:47] [INFO ] Deduced a trap composed of 57 places in 116 ms of which 2 ms to minimize.
[2024-05-31 22:32:47] [INFO ] Deduced a trap composed of 32 places in 117 ms of which 3 ms to minimize.
[2024-05-31 22:32:47] [INFO ] Deduced a trap composed of 46 places in 125 ms of which 2 ms to minimize.
[2024-05-31 22:32:47] [INFO ] Deduced a trap composed of 19 places in 119 ms of which 2 ms to minimize.
[2024-05-31 22:32:47] [INFO ] Deduced a trap composed of 16 places in 122 ms of which 2 ms to minimize.
[2024-05-31 22:32:48] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 2 ms to minimize.
[2024-05-31 22:32:48] [INFO ] Deduced a trap composed of 114 places in 179 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/980 variables, 20/603 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-31 22:32:50] [INFO ] Deduced a trap composed of 163 places in 171 ms of which 2 ms to minimize.
[2024-05-31 22:32:50] [INFO ] Deduced a trap composed of 158 places in 174 ms of which 2 ms to minimize.
[2024-05-31 22:32:50] [INFO ] Deduced a trap composed of 13 places in 188 ms of which 3 ms to minimize.
[2024-05-31 22:32:51] [INFO ] Deduced a trap composed of 183 places in 197 ms of which 2 ms to minimize.
[2024-05-31 22:32:51] [INFO ] Deduced a trap composed of 125 places in 183 ms of which 3 ms to minimize.
[2024-05-31 22:32:51] [INFO ] Deduced a trap composed of 41 places in 184 ms of which 3 ms to minimize.
[2024-05-31 22:32:51] [INFO ] Deduced a trap composed of 152 places in 170 ms of which 3 ms to minimize.
[2024-05-31 22:32:52] [INFO ] Deduced a trap composed of 155 places in 162 ms of which 2 ms to minimize.
[2024-05-31 22:32:52] [INFO ] Deduced a trap composed of 161 places in 159 ms of which 4 ms to minimize.
[2024-05-31 22:32:52] [INFO ] Deduced a trap composed of 163 places in 157 ms of which 3 ms to minimize.
[2024-05-31 22:32:52] [INFO ] Deduced a trap composed of 159 places in 173 ms of which 3 ms to minimize.
[2024-05-31 22:32:53] [INFO ] Deduced a trap composed of 165 places in 174 ms of which 2 ms to minimize.
[2024-05-31 22:32:53] [INFO ] Deduced a trap composed of 168 places in 183 ms of which 2 ms to minimize.
[2024-05-31 22:32:53] [INFO ] Deduced a trap composed of 153 places in 170 ms of which 3 ms to minimize.
[2024-05-31 22:32:53] [INFO ] Deduced a trap composed of 153 places in 160 ms of which 3 ms to minimize.
[2024-05-31 22:32:53] [INFO ] Deduced a trap composed of 92 places in 172 ms of which 7 ms to minimize.
[2024-05-31 22:32:54] [INFO ] Deduced a trap composed of 92 places in 181 ms of which 2 ms to minimize.
[2024-05-31 22:32:54] [INFO ] Deduced a trap composed of 53 places in 168 ms of which 3 ms to minimize.
[2024-05-31 22:32:54] [INFO ] Deduced a trap composed of 51 places in 187 ms of which 2 ms to minimize.
[2024-05-31 22:32:54] [INFO ] Deduced a trap composed of 70 places in 179 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/980 variables, 20/623 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-31 22:32:56] [INFO ] Deduced a trap composed of 17 places in 162 ms of which 2 ms to minimize.
[2024-05-31 22:32:56] [INFO ] Deduced a trap composed of 141 places in 191 ms of which 3 ms to minimize.
[2024-05-31 22:32:56] [INFO ] Deduced a trap composed of 169 places in 197 ms of which 4 ms to minimize.
[2024-05-31 22:32:56] [INFO ] Deduced a trap composed of 163 places in 189 ms of which 3 ms to minimize.
[2024-05-31 22:32:57] [INFO ] Deduced a trap composed of 161 places in 177 ms of which 3 ms to minimize.
[2024-05-31 22:32:57] [INFO ] Deduced a trap composed of 161 places in 186 ms of which 2 ms to minimize.
[2024-05-31 22:32:57] [INFO ] Deduced a trap composed of 150 places in 176 ms of which 3 ms to minimize.
[2024-05-31 22:32:57] [INFO ] Deduced a trap composed of 155 places in 160 ms of which 3 ms to minimize.
[2024-05-31 22:32:57] [INFO ] Deduced a trap composed of 159 places in 197 ms of which 3 ms to minimize.
[2024-05-31 22:32:58] [INFO ] Deduced a trap composed of 157 places in 177 ms of which 3 ms to minimize.
[2024-05-31 22:32:58] [INFO ] Deduced a trap composed of 159 places in 175 ms of which 3 ms to minimize.
[2024-05-31 22:32:58] [INFO ] Deduced a trap composed of 149 places in 174 ms of which 3 ms to minimize.
[2024-05-31 22:32:58] [INFO ] Deduced a trap composed of 167 places in 175 ms of which 3 ms to minimize.
[2024-05-31 22:32:59] [INFO ] Deduced a trap composed of 153 places in 181 ms of which 3 ms to minimize.
[2024-05-31 22:32:59] [INFO ] Deduced a trap composed of 169 places in 175 ms of which 3 ms to minimize.
[2024-05-31 22:32:59] [INFO ] Deduced a trap composed of 164 places in 175 ms of which 3 ms to minimize.
[2024-05-31 22:32:59] [INFO ] Deduced a trap composed of 155 places in 184 ms of which 3 ms to minimize.
[2024-05-31 22:33:00] [INFO ] Deduced a trap composed of 148 places in 179 ms of which 3 ms to minimize.
[2024-05-31 22:33:00] [INFO ] Deduced a trap composed of 141 places in 180 ms of which 3 ms to minimize.
[2024-05-31 22:33:00] [INFO ] Deduced a trap composed of 167 places in 175 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/980 variables, 20/643 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-31 22:33:02] [INFO ] Deduced a trap composed of 77 places in 70 ms of which 1 ms to minimize.
[2024-05-31 22:33:02] [INFO ] Deduced a trap composed of 138 places in 120 ms of which 2 ms to minimize.
[2024-05-31 22:33:02] [INFO ] Deduced a trap composed of 66 places in 63 ms of which 1 ms to minimize.
[2024-05-31 22:33:02] [INFO ] Deduced a trap composed of 169 places in 174 ms of which 3 ms to minimize.
[2024-05-31 22:33:03] [INFO ] Deduced a trap composed of 177 places in 180 ms of which 3 ms to minimize.
[2024-05-31 22:33:03] [INFO ] Deduced a trap composed of 159 places in 166 ms of which 3 ms to minimize.
[2024-05-31 22:33:03] [INFO ] Deduced a trap composed of 153 places in 173 ms of which 2 ms to minimize.
[2024-05-31 22:33:03] [INFO ] Deduced a trap composed of 149 places in 163 ms of which 2 ms to minimize.
[2024-05-31 22:33:03] [INFO ] Deduced a trap composed of 155 places in 168 ms of which 3 ms to minimize.
[2024-05-31 22:33:04] [INFO ] Deduced a trap composed of 152 places in 169 ms of which 3 ms to minimize.
[2024-05-31 22:33:04] [INFO ] Deduced a trap composed of 153 places in 168 ms of which 3 ms to minimize.
[2024-05-31 22:33:04] [INFO ] Deduced a trap composed of 166 places in 165 ms of which 3 ms to minimize.
[2024-05-31 22:33:04] [INFO ] Deduced a trap composed of 163 places in 165 ms of which 2 ms to minimize.
[2024-05-31 22:33:05] [INFO ] Deduced a trap composed of 156 places in 168 ms of which 3 ms to minimize.
[2024-05-31 22:33:05] [INFO ] Deduced a trap composed of 150 places in 166 ms of which 3 ms to minimize.
[2024-05-31 22:33:05] [INFO ] Deduced a trap composed of 170 places in 170 ms of which 2 ms to minimize.
[2024-05-31 22:33:06] [INFO ] Deduced a trap composed of 157 places in 170 ms of which 2 ms to minimize.
[2024-05-31 22:33:06] [INFO ] Deduced a trap composed of 164 places in 156 ms of which 2 ms to minimize.
[2024-05-31 22:33:06] [INFO ] Deduced a trap composed of 154 places in 158 ms of which 2 ms to minimize.
[2024-05-31 22:33:06] [INFO ] Deduced a trap composed of 160 places in 159 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/980 variables, 20/663 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-31 22:33:13] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 2 ms to minimize.
[2024-05-31 22:33:16] [INFO ] Deduced a trap composed of 117 places in 127 ms of which 2 ms to minimize.
[2024-05-31 22:33:17] [INFO ] Deduced a trap composed of 48 places in 181 ms of which 4 ms to minimize.
[2024-05-31 22:33:17] [INFO ] Deduced a trap composed of 143 places in 177 ms of which 2 ms to minimize.
[2024-05-31 22:33:18] [INFO ] Deduced a trap composed of 156 places in 171 ms of which 3 ms to minimize.
[2024-05-31 22:33:18] [INFO ] Deduced a trap composed of 141 places in 178 ms of which 3 ms to minimize.
[2024-05-31 22:33:18] [INFO ] Deduced a trap composed of 151 places in 182 ms of which 2 ms to minimize.
[2024-05-31 22:33:18] [INFO ] Deduced a trap composed of 90 places in 178 ms of which 2 ms to minimize.
[2024-05-31 22:33:19] [INFO ] Deduced a trap composed of 147 places in 181 ms of which 3 ms to minimize.
[2024-05-31 22:33:19] [INFO ] Deduced a trap composed of 94 places in 172 ms of which 3 ms to minimize.
[2024-05-31 22:33:19] [INFO ] Deduced a trap composed of 143 places in 164 ms of which 3 ms to minimize.
[2024-05-31 22:33:19] [INFO ] Deduced a trap composed of 162 places in 176 ms of which 3 ms to minimize.
[2024-05-31 22:33:20] [INFO ] Deduced a trap composed of 156 places in 168 ms of which 3 ms to minimize.
[2024-05-31 22:33:20] [INFO ] Deduced a trap composed of 147 places in 158 ms of which 3 ms to minimize.
[2024-05-31 22:33:20] [INFO ] Deduced a trap composed of 118 places in 159 ms of which 2 ms to minimize.
[2024-05-31 22:33:21] [INFO ] Deduced a trap composed of 153 places in 171 ms of which 3 ms to minimize.
[2024-05-31 22:33:21] [INFO ] Deduced a trap composed of 162 places in 181 ms of which 2 ms to minimize.
[2024-05-31 22:33:21] [INFO ] Deduced a trap composed of 22 places in 174 ms of which 2 ms to minimize.
[2024-05-31 22:33:22] [INFO ] Deduced a trap composed of 179 places in 162 ms of which 2 ms to minimize.
[2024-05-31 22:33:22] [INFO ] Deduced a trap composed of 119 places in 166 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/980 variables, 20/683 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-31 22:33:27] [INFO ] Deduced a trap composed of 8 places in 142 ms of which 2 ms to minimize.
[2024-05-31 22:33:28] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 2 ms to minimize.
[2024-05-31 22:33:28] [INFO ] Deduced a trap composed of 145 places in 188 ms of which 3 ms to minimize.
[2024-05-31 22:33:29] [INFO ] Deduced a trap composed of 154 places in 178 ms of which 3 ms to minimize.
[2024-05-31 22:33:29] [INFO ] Deduced a trap composed of 147 places in 174 ms of which 3 ms to minimize.
[2024-05-31 22:33:29] [INFO ] Deduced a trap composed of 150 places in 176 ms of which 3 ms to minimize.
[2024-05-31 22:33:29] [INFO ] Deduced a trap composed of 161 places in 174 ms of which 2 ms to minimize.
[2024-05-31 22:33:29] [INFO ] Deduced a trap composed of 165 places in 180 ms of which 3 ms to minimize.
[2024-05-31 22:33:30] [INFO ] Deduced a trap composed of 152 places in 177 ms of which 4 ms to minimize.
[2024-05-31 22:33:30] [INFO ] Deduced a trap composed of 172 places in 180 ms of which 2 ms to minimize.
[2024-05-31 22:33:30] [INFO ] Deduced a trap composed of 149 places in 176 ms of which 3 ms to minimize.
[2024-05-31 22:33:30] [INFO ] Deduced a trap composed of 161 places in 174 ms of which 2 ms to minimize.
[2024-05-31 22:33:31] [INFO ] Deduced a trap composed of 163 places in 172 ms of which 3 ms to minimize.
[2024-05-31 22:33:31] [INFO ] Deduced a trap composed of 171 places in 175 ms of which 2 ms to minimize.
[2024-05-31 22:33:31] [INFO ] Deduced a trap composed of 167 places in 176 ms of which 3 ms to minimize.
[2024-05-31 22:33:32] [INFO ] Deduced a trap composed of 156 places in 190 ms of which 3 ms to minimize.
[2024-05-31 22:33:32] [INFO ] Deduced a trap composed of 161 places in 191 ms of which 3 ms to minimize.
[2024-05-31 22:33:32] [INFO ] Deduced a trap composed of 152 places in 180 ms of which 3 ms to minimize.
[2024-05-31 22:33:32] [INFO ] Deduced a trap composed of 144 places in 186 ms of which 3 ms to minimize.
[2024-05-31 22:33:33] [INFO ] Deduced a trap composed of 149 places in 187 ms of which 3 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/980 variables, 20/703 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-31 22:33:43] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 2 ms to minimize.
[2024-05-31 22:33:43] [INFO ] Deduced a trap composed of 39 places in 128 ms of which 2 ms to minimize.
[2024-05-31 22:33:44] [INFO ] Deduced a trap composed of 52 places in 133 ms of which 2 ms to minimize.
[2024-05-31 22:33:44] [INFO ] Deduced a trap composed of 77 places in 153 ms of which 2 ms to minimize.
[2024-05-31 22:33:44] [INFO ] Deduced a trap composed of 145 places in 170 ms of which 2 ms to minimize.
[2024-05-31 22:33:45] [INFO ] Deduced a trap composed of 151 places in 175 ms of which 2 ms to minimize.
[2024-05-31 22:33:45] [INFO ] Deduced a trap composed of 151 places in 179 ms of which 3 ms to minimize.
[2024-05-31 22:33:45] [INFO ] Deduced a trap composed of 143 places in 182 ms of which 3 ms to minimize.
[2024-05-31 22:33:46] [INFO ] Deduced a trap composed of 144 places in 169 ms of which 3 ms to minimize.
[2024-05-31 22:33:46] [INFO ] Deduced a trap composed of 147 places in 183 ms of which 3 ms to minimize.
[2024-05-31 22:33:47] [INFO ] Deduced a trap composed of 150 places in 174 ms of which 3 ms to minimize.
[2024-05-31 22:33:47] [INFO ] Deduced a trap composed of 153 places in 170 ms of which 3 ms to minimize.
[2024-05-31 22:33:47] [INFO ] Deduced a trap composed of 150 places in 185 ms of which 3 ms to minimize.
[2024-05-31 22:33:47] [INFO ] Deduced a trap composed of 155 places in 182 ms of which 3 ms to minimize.
[2024-05-31 22:33:49] [INFO ] Deduced a trap composed of 130 places in 176 ms of which 2 ms to minimize.
[2024-05-31 22:33:49] [INFO ] Deduced a trap composed of 149 places in 175 ms of which 3 ms to minimize.
[2024-05-31 22:33:49] [INFO ] Deduced a trap composed of 133 places in 190 ms of which 3 ms to minimize.
[2024-05-31 22:33:49] [INFO ] Deduced a trap composed of 126 places in 171 ms of which 3 ms to minimize.
[2024-05-31 22:33:50] [INFO ] Deduced a trap composed of 147 places in 180 ms of which 3 ms to minimize.
[2024-05-31 22:33:50] [INFO ] Deduced a trap composed of 156 places in 182 ms of which 3 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 20/723 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 980/980 variables, and 723 constraints, problems are : Problem set: 0 solved, 13 unsolved in 75021 ms.
Refiners :[State Equation: 502/502 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 140/140 constraints]
After SMT, in 83191ms problems are : Problem set: 0 solved, 13 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 25 out of 502 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 502/502 places, 478/478 transitions.
Applied a total of 0 rules in 28 ms. Remains 502 /502 variables (removed 0) and now considering 478/478 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 502/502 places, 478/478 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 502/502 places, 478/478 transitions.
Applied a total of 0 rules in 18 ms. Remains 502 /502 variables (removed 0) and now considering 478/478 (removed 0) transitions.
// Phase 1: matrix 478 rows 502 cols
[2024-05-31 22:33:51] [INFO ] Invariants computation overflowed in 57 ms
[2024-05-31 22:33:52] [INFO ] Implicit Places using invariants in 674 ms returned []
// Phase 1: matrix 478 rows 502 cols
[2024-05-31 22:33:52] [INFO ] Invariants computation overflowed in 38 ms
[2024-05-31 22:33:52] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-31 22:34:00] [INFO ] Implicit Places using invariants and state equation in 8462 ms returned [42, 48, 69, 74, 96, 101, 121, 127, 148, 153, 154, 182, 203, 210, 217, 233, 238, 262, 293, 299, 322, 328, 351, 356, 377, 384, 405, 407, 412, 433, 439, 463, 468, 472, 493, 500]
[2024-05-31 22:34:00] [INFO ] Actually due to overlaps returned [299, 74, 217, 69, 153, 293]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 9142 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 496/502 places, 478/478 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 496 transition count 476
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 494 transition count 476
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 6 place count 494 transition count 476
Applied a total of 6 rules in 41 ms. Remains 494 /496 variables (removed 2) and now considering 476/478 (removed 2) transitions.
// Phase 1: matrix 476 rows 494 cols
[2024-05-31 22:34:01] [INFO ] Invariants computation overflowed in 52 ms
[2024-05-31 22:34:01] [INFO ] Implicit Places using invariants in 839 ms returned []
// Phase 1: matrix 476 rows 494 cols
[2024-05-31 22:34:01] [INFO ] Invariants computation overflowed in 36 ms
[2024-05-31 22:34:02] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-31 22:34:07] [INFO ] Implicit Places using invariants and state equation in 5322 ms returned [42, 48, 94, 99, 119, 125, 146, 151, 179, 200, 207, 228, 233, 257, 314, 320, 343, 348, 369, 376, 397, 399, 404, 425, 431, 455, 460, 464, 485, 492]
[2024-05-31 22:34:07] [INFO ] Actually due to overlaps returned [320, 99, 464, 94, 314, 399]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 6188 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 488/502 places, 476/478 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 488 transition count 473
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 485 transition count 473
Applied a total of 6 rules in 24 ms. Remains 485 /488 variables (removed 3) and now considering 473/476 (removed 3) transitions.
// Phase 1: matrix 473 rows 485 cols
[2024-05-31 22:34:07] [INFO ] Invariants computation overflowed in 47 ms
[2024-05-31 22:34:07] [INFO ] Implicit Places using invariants in 378 ms returned []
// Phase 1: matrix 473 rows 485 cols
[2024-05-31 22:34:07] [INFO ] Invariants computation overflowed in 33 ms
[2024-05-31 22:34:07] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-31 22:34:22] [INFO ] Implicit Places using invariants and state equation in 15093 ms returned [42, 48, 116, 122, 143, 148, 176, 197, 204, 225, 230, 254, 337, 342, 363, 370, 391, 397, 418, 424, 448, 453, 476, 483]
[2024-05-31 22:34:22] [INFO ] Actually due to overlaps returned [342, 122, 42, 116, 337, 48]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 15490 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 479/502 places, 473/478 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 479 transition count 471
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 477 transition count 471
Applied a total of 4 rules in 24 ms. Remains 477 /479 variables (removed 2) and now considering 471/473 (removed 2) transitions.
// Phase 1: matrix 471 rows 477 cols
[2024-05-31 22:34:22] [INFO ] Invariants computation overflowed in 42 ms
[2024-05-31 22:34:23] [INFO ] Implicit Places using invariants in 310 ms returned []
// Phase 1: matrix 471 rows 477 cols
[2024-05-31 22:34:23] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-31 22:34:23] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-31 22:34:30] [INFO ] Implicit Places using invariants and state equation in 7144 ms returned [137, 142, 170, 191, 198, 219, 224, 248, 355, 362, 383, 389, 410, 416, 440, 445, 468, 475]
[2024-05-31 22:34:30] [INFO ] Actually due to overlaps returned [362, 142, 137, 355]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 7459 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 473/502 places, 471/478 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 473 transition count 469
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 471 transition count 469
Applied a total of 4 rules in 41 ms. Remains 471 /473 variables (removed 2) and now considering 469/471 (removed 2) transitions.
// Phase 1: matrix 469 rows 471 cols
[2024-05-31 22:34:30] [INFO ] Invariants computation overflowed in 29 ms
[2024-05-31 22:34:30] [INFO ] Implicit Places using invariants in 251 ms returned []
// Phase 1: matrix 469 rows 471 cols
[2024-05-31 22:34:30] [INFO ] Invariants computation overflowed in 27 ms
[2024-05-31 22:34:30] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-31 22:34:36] [INFO ] Implicit Places using invariants and state equation in 6379 ms returned [167, 188, 195, 216, 221, 245, 377, 383, 404, 410, 434, 439, 462, 469]
[2024-05-31 22:34:36] [INFO ] Actually due to overlaps returned [167, 383, 377]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 6635 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 468/502 places, 469/478 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 468 transition count 469
Applied a total of 2 rules in 22 ms. Remains 468 /468 variables (removed 0) and now considering 469/469 (removed 0) transitions.
// Phase 1: matrix 469 rows 468 cols
[2024-05-31 22:34:36] [INFO ] Invariants computation overflowed in 25 ms
[2024-05-31 22:34:37] [INFO ] Implicit Places using invariants in 299 ms returned []
// Phase 1: matrix 469 rows 468 cols
[2024-05-31 22:34:37] [INFO ] Invariants computation overflowed in 33 ms
[2024-05-31 22:34:37] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-31 22:34:53] [INFO ] Implicit Places using invariants and state equation in 15806 ms returned [187, 194, 215, 220, 244, 401, 407, 431, 436, 459, 466]
[2024-05-31 22:34:53] [INFO ] Actually due to overlaps returned [194, 407, 187, 401]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 16134 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 464/502 places, 469/478 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 464 transition count 467
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 462 transition count 467
Applied a total of 4 rules in 23 ms. Remains 462 /464 variables (removed 2) and now considering 467/469 (removed 2) transitions.
// Phase 1: matrix 467 rows 462 cols
[2024-05-31 22:34:53] [INFO ] Invariants computation overflowed in 36 ms
[2024-05-31 22:34:53] [INFO ] Implicit Places using invariants in 240 ms returned []
// Phase 1: matrix 467 rows 462 cols
[2024-05-31 22:34:53] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-31 22:34:53] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-31 22:35:10] [INFO ] Implicit Places using invariants and state equation in 17458 ms returned [212, 217, 241, 425, 430, 453, 460]
[2024-05-31 22:35:10] [INFO ] Actually due to overlaps returned [430, 217, 212, 425]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 17702 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 458/502 places, 467/478 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 458 transition count 465
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 456 transition count 465
Applied a total of 4 rules in 31 ms. Remains 456 /458 variables (removed 2) and now considering 465/467 (removed 2) transitions.
// Phase 1: matrix 465 rows 456 cols
[2024-05-31 22:35:10] [INFO ] Invariants computation overflowed in 26 ms
[2024-05-31 22:35:11] [INFO ] Implicit Places using invariants in 230 ms returned []
// Phase 1: matrix 465 rows 456 cols
[2024-05-31 22:35:11] [INFO ] Invariants computation overflowed in 32 ms
[2024-05-31 22:35:11] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-31 22:35:22] [INFO ] Implicit Places using invariants and state equation in 11662 ms returned [238, 447, 454]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 11913 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 453/502 places, 465/478 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 464
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 464
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 3 place count 452 transition count 464
Applied a total of 3 rules in 27 ms. Remains 452 /453 variables (removed 1) and now considering 464/465 (removed 1) transitions.
// Phase 1: matrix 464 rows 452 cols
[2024-05-31 22:35:22] [INFO ] Invariants computation overflowed in 27 ms
[2024-05-31 22:35:22] [INFO ] Implicit Places using invariants in 238 ms returned []
// Phase 1: matrix 464 rows 452 cols
[2024-05-31 22:35:23] [INFO ] Invariants computation overflowed in 26 ms
[2024-05-31 22:35:23] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-31 22:35:28] [INFO ] Implicit Places using invariants and state equation in 5072 ms returned []
Implicit Place search using SMT with State Equation took 5324 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 452/502 places, 464/478 transitions.
Finished structural reductions in REACHABILITY mode , in 9 iterations and 96243 ms. Remains : 452/502 places, 464/478 transitions.
Successfully simplified 8 atomic propositions for a total of 12 simplifications.
FORMULA DoubleExponent-PT-020-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-020-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-020-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-020-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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.11 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)))'
Support contains 2 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.4 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 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 241 rules applied. Total rules applied 242 place count 1055 transition count 754
Reduce places removed 241 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 242 rules applied. Total rules applied 484 place count 814 transition count 753
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 485 place count 813 transition count 753
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 485 place count 813 transition count 713
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 565 place count 773 transition count 713
Performed 180 Post agglomeration using F-continuation condition.Transition count delta: 180
Deduced a syphon composed of 180 places in 2 ms
Reduce places removed 180 places and 0 transitions.
Iterating global reduction 3 with 360 rules applied. Total rules applied 925 place count 593 transition count 533
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 1001 place count 555 transition count 533
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1002 place count 554 transition count 532
Applied a total of 1002 rules in 85 ms. Remains 554 /1057 variables (removed 503) and now considering 532/997 (removed 465) transitions.
// Phase 1: matrix 532 rows 554 cols
[2024-05-31 22:35:28] [INFO ] Invariants computation overflowed in 37 ms
[2024-05-31 22:35:28] [INFO ] Implicit Places using invariants in 271 ms returned []
// Phase 1: matrix 532 rows 554 cols
[2024-05-31 22:35:28] [INFO ] Invariants computation overflowed in 37 ms
[2024-05-31 22:35:28] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-31 22:35:41] [INFO ] Implicit Places using invariants and state equation in 12958 ms returned []
Implicit Place search using SMT with State Equation took 13241 ms to find 0 implicit places.
[2024-05-31 22:35:41] [INFO ] Redundant transitions in 36 ms returned []
Running 531 sub problems to find dead transitions.
// Phase 1: matrix 532 rows 554 cols
[2024-05-31 22:35:41] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-31 22:35:41] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/553 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 1 (OVERLAPS) 532/1085 variables, 553/553 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1085 variables, 38/591 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1085 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 531 unsolved
SMT process timed out in 30238ms, After SMT, problems are : Problem set: 0 solved, 531 unsolved
Search for dead transitions found 0 dead transitions in 30254ms
Starting structural reductions in SI_LTL mode, iteration 1 : 554/1057 places, 532/997 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 43633 ms. Remains : 554/1057 places, 532/997 transitions.
Stuttering acceptance computed with spot in 185 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-020-LTLCardinality-02
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-020-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-020-LTLCardinality-02 finished in 43882 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)&&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.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 235 transitions
Trivial Post-agglo rules discarded 235 transitions
Performed 235 trivial Post agglomeration. Transition count delta: 235
Iterating post reduction 0 with 235 rules applied. Total rules applied 236 place count 1055 transition count 760
Reduce places removed 235 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 238 rules applied. Total rules applied 474 place count 820 transition count 757
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 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 7 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 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 3 with 366 rules applied. Total rules applied 923 place count 594 transition count 534
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 999 place count 556 transition count 534
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1000 place count 555 transition count 533
Applied a total of 1000 rules in 90 ms. Remains 555 /1057 variables (removed 502) and now considering 533/997 (removed 464) transitions.
// Phase 1: matrix 533 rows 555 cols
[2024-05-31 22:36:12] [INFO ] Invariants computation overflowed in 46 ms
[2024-05-31 22:36:12] [INFO ] Implicit Places using invariants in 270 ms returned []
// Phase 1: matrix 533 rows 555 cols
[2024-05-31 22:36:12] [INFO ] Invariants computation overflowed in 47 ms
[2024-05-31 22:36:12] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-31 22:36:24] [INFO ] Implicit Places using invariants and state equation in 12025 ms returned []
Implicit Place search using SMT with State Equation took 12297 ms to find 0 implicit places.
[2024-05-31 22:36:24] [INFO ] Redundant transitions in 8 ms returned []
Running 532 sub problems to find dead transitions.
// Phase 1: matrix 533 rows 555 cols
[2024-05-31 22:36:24] [INFO ] Invariants computation overflowed in 47 ms
[2024-05-31 22:36:24] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/554 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 532 unsolved
At refinement iteration 1 (OVERLAPS) 533/1087 variables, 554/554 constraints. Problems are: Problem set: 0 solved, 532 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1087 variables, 38/592 constraints. Problems are: Problem set: 0 solved, 532 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1087 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 532 unsolved
SMT process timed out in 30172ms, After SMT, problems are : Problem set: 0 solved, 532 unsolved
Search for dead transitions found 0 dead transitions in 30178ms
Starting structural reductions in SI_LTL mode, iteration 1 : 555/1057 places, 533/997 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 42587 ms. Remains : 555/1057 places, 533/997 transitions.
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-020-LTLCardinality-03
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-020-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-020-LTLCardinality-03 finished in 42750 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)&&F((X(F(p0))&&(p0||X((G(p1) U (p0&&G(p1)))))))))'
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 43 ms. Remains 1057 /1057 variables (removed 0) and now considering 997/997 (removed 0) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2024-05-31 22:36:54] [INFO ] Invariants computation overflowed in 104 ms
[2024-05-31 22:36:55] [INFO ] Implicit Places using invariants in 426 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2024-05-31 22:36:55] [INFO ] Invariants computation overflowed in 101 ms
[2024-05-31 22:37:09] [INFO ] Implicit Places using invariants and state equation in 13815 ms returned []
Implicit Place search using SMT with State Equation took 14243 ms to find 0 implicit places.
Running 996 sub problems to find dead transitions.
// Phase 1: matrix 997 rows 1057 cols
[2024-05-31 22:37:09] [INFO ] Invariants computation overflowed in 100 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 30037 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 60314ms 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 74613 ms. Remains : 1057/1057 places, 997/997 transitions.
Stuttering acceptance computed with spot in 206 ms :[true, (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-020-LTLCardinality-04
Product exploration explored 100000 steps with 50000 reset in 338 ms.
Product exploration explored 100000 steps with 50000 reset in 313 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.8 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (AND p0 p1)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 16 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DoubleExponent-PT-020-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-020-LTLCardinality-04 finished in 75563 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(G((p0&&(p1||X(p2)))))&&(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 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-31 22:38:10] [INFO ] Invariants computation overflowed in 124 ms
[2024-05-31 22:38:10] [INFO ] Implicit Places using invariants in 406 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2024-05-31 22:38:10] [INFO ] Invariants computation overflowed in 118 ms
[2024-05-31 22:38:25] [INFO ] Implicit Places using invariants and state equation in 14319 ms returned []
Implicit Place search using SMT with State Equation took 14727 ms to find 0 implicit places.
Running 996 sub problems to find dead transitions.
// Phase 1: matrix 997 rows 1057 cols
[2024-05-31 22:38:25] [INFO ] Invariants computation overflowed in 109 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 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 30044 ms.
Refiners :[State Equation: 1056/1057 constraints, PredecessorRefiner: 996/996 constraints, Known Traps: 0/0 constraints]
After SMT, in 60352ms problems are : Problem set: 0 solved, 996 unsolved
Search for dead transitions found 0 dead transitions in 60365ms
Finished structural reductions in LTL mode , in 1 iterations and 75140 ms. Remains : 1057/1057 places, 997/997 transitions.
Stuttering acceptance computed with spot in 203 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : DoubleExponent-PT-020-LTLCardinality-06
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-020-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-020-LTLCardinality-06 finished in 75380 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(F((p0||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 33 ms. Remains 1057 /1057 variables (removed 0) and now considering 997/997 (removed 0) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2024-05-31 22:39:25] [INFO ] Invariants computation overflowed in 114 ms
[2024-05-31 22:39:26] [INFO ] Implicit Places using invariants in 383 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2024-05-31 22:39:26] [INFO ] Invariants computation overflowed in 118 ms
[2024-05-31 22:39:43] [INFO ] Implicit Places using invariants and state equation in 17600 ms returned []
Implicit Place search using SMT with State Equation took 17994 ms to find 0 implicit places.
Running 996 sub problems to find dead transitions.
// Phase 1: matrix 997 rows 1057 cols
[2024-05-31 22:39:43] [INFO ] Invariants computation overflowed in 118 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
(s215 12.0timeout
^^^^^^^^^^^
(error "Invalid token: 12.0timeout")
Error getting values : (error "ParserException while parsing response: ((s1 210326498.0)
(s2 0.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 73.0)
(s13 0.0)
(s14 72.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 75.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 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 0.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 10.0)
(s41 1.0)
(s42 1.0)
(s43 0.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 0.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 464.0)
(s70 466.0)
(s71 10.0)
(s72 471.0)
(s73 10.0)
(s74 6.0)
(s75 2.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 1.0)
(s93 210326509.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 1.0)
(s114 0.0)
(s115 1.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 1.0)
(s120 1.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 105162739.0)
(s127 0.0)
(s128 461.0)
(s129 456.0)
(s130 453.0)
(s131 1.0)
(s132 5.0)
(s133 8.0)
(s134 1.0)
(s135 1.0)
(s136 1.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 0.0)
(s148 1.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 1.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 1.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 1.0)
(s171 1.0)
(s172 0.0)
(s173 2.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 1.0)
(s183 2.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 449.0)
(s188 444.0)
(s189 441.0)
(s190 1.0)
(s191 5.0)
(s192 8.0)
(s193 12.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 1.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 12.0timeout
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 30047 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 30031 ms.
Refiners :[State Equation: 1056/1057 constraints, PredecessorRefiner: 996/996 constraints, Known Traps: 0/0 constraints]
After SMT, in 60359ms problems are : Problem set: 0 solved, 996 unsolved
Search for dead transitions found 0 dead transitions in 60373ms
Finished structural reductions in LTL mode , in 1 iterations and 78404 ms. Remains : 1057/1057 places, 997/997 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DoubleExponent-PT-020-LTLCardinality-09
Product exploration explored 100000 steps with 50000 reset in 278 ms.
Product exploration explored 100000 steps with 50000 reset in 271 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 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 12 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DoubleExponent-PT-020-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-020-LTLCardinality-09 finished in 79088 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||F(p1)))))'
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 33 ms. Remains 1057 /1057 variables (removed 0) and now considering 997/997 (removed 0) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2024-05-31 22:40:44] [INFO ] Invariants computation overflowed in 106 ms
[2024-05-31 22:40:45] [INFO ] Implicit Places using invariants in 413 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2024-05-31 22:40:45] [INFO ] Invariants computation overflowed in 100 ms
[2024-05-31 22:40:58] [INFO ] Implicit Places using invariants and state equation in 13426 ms returned []
Implicit Place search using SMT with State Equation took 13841 ms to find 0 implicit places.
Running 996 sub problems to find dead transitions.
// Phase 1: matrix 997 rows 1057 cols
[2024-05-31 22:40:58] [INFO ] Invariants computation overflowed in 109 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 30030 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 30034 ms.
Refiners :[State Equation: 1056/1057 constraints, PredecessorRefiner: 996/996 constraints, Known Traps: 0/0 constraints]
After SMT, in 60318ms problems are : Problem set: 0 solved, 996 unsolved
Search for dead transitions found 0 dead transitions in 60326ms
Finished structural reductions in LTL mode , in 1 iterations and 74203 ms. Remains : 1057/1057 places, 997/997 transitions.
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-020-LTLCardinality-11
Product exploration explored 100000 steps with 3357 reset in 163 ms.
Product exploration explored 100000 steps with 3376 reset in 179 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.4 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 98 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (1324 resets) in 210 ms. (189 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1138 resets) in 118 ms. (336 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (1132 resets) in 128 ms. (310 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (1150 resets) in 147 ms. (270 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 184203 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :0 out of 3
Probabilistic random walk after 184203 steps, saw 92117 distinct states, run finished after 3001 ms. (steps per millisecond=61 ) properties seen :0
// Phase 1: matrix 997 rows 1057 cols
[2024-05-31 22:42:03] [INFO ] Invariants computation overflowed in 107 ms
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, 3 unsolved
At refinement iteration 1 (OVERLAPS) 15/19 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 64/83 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 147/230 variables, 62/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 239/469 variables, 111/203 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/469 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 312/781 variables, 159/362 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/781 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 284/1065 variables, 154/516 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1065 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 216/1281 variables, 119/635 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1281 variables, 0/635 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 185/1466 variables, 97/732 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1466 variables, 0/732 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 133/1599 variables, 80/812 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1599 variables, 0/812 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 65/1664 variables, 37/849 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1664 variables, 0/849 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 57/1721 variables, 30/879 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1721 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 47/1768 variables, 24/903 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1768 variables, 0/903 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 56/1824 variables, 29/932 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1824 variables, 0/932 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 47/1871 variables, 24/956 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1871 variables, 0/956 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 56/1927 variables, 29/985 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1927 variables, 0/985 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (OVERLAPS) 48/1975 variables, 24/1009 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1975 variables, 0/1009 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (OVERLAPS) 59/2034 variables, 31/1040 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/2034 variables, 0/1040 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (OVERLAPS) 20/2054 variables, 17/1057 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/2054 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (OVERLAPS) 0/2054 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2054/2054 variables, and 1057 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1952 ms.
Refiners :[State Equation: 1057/1057 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 15/19 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 64/83 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 147/230 variables, 62/95 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 239/469 variables, 111/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/469 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 312/781 variables, 159/365 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/781 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 284/1065 variables, 154/519 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1065 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 216/1281 variables, 119/638 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1281 variables, 0/638 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 185/1466 variables, 97/735 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1466 variables, 0/735 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 133/1599 variables, 80/815 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1599 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 65/1664 variables, 37/852 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1664 variables, 0/852 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 57/1721 variables, 30/882 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1721 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 47/1768 variables, 24/906 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1768 variables, 0/906 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (OVERLAPS) 56/1824 variables, 29/935 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1824 variables, 0/935 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (OVERLAPS) 47/1871 variables, 24/959 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1871 variables, 0/959 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (OVERLAPS) 56/1927 variables, 29/988 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1927 variables, 0/988 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (OVERLAPS) 48/1975 variables, 24/1012 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1975 variables, 0/1012 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (OVERLAPS) 59/2034 variables, 31/1043 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/2034 variables, 0/1043 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (OVERLAPS) 20/2054 variables, 17/1060 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 22:42:09] [INFO ] Deduced a trap composed of 200 places in 187 ms of which 3 ms to minimize.
[2024-05-31 22:42:09] [INFO ] Deduced a trap composed of 203 places in 197 ms of which 3 ms to minimize.
[2024-05-31 22:42:09] [INFO ] Deduced a trap composed of 163 places in 192 ms of which 4 ms to minimize.
[2024-05-31 22:42:10] [INFO ] Deduced a trap composed of 183 places in 196 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2054/2054 variables, and 1064 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5014 ms.
Refiners :[State Equation: 1057/1057 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 4/4 constraints]
After SMT, in 7080ms problems are : Problem set: 0 solved, 3 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.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 234 transitions
Trivial Post-agglo rules discarded 234 transitions
Performed 234 trivial Post agglomeration. Transition count delta: 234
Iterating post reduction 0 with 235 rules applied. Total rules applied 236 place count 1055 transition count 761
Reduce places removed 234 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 239 rules applied. Total rules applied 475 place count 821 transition count 756
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 480 place count 816 transition count 756
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 480 place count 816 transition count 715
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 562 place count 775 transition count 715
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 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 3 with 74 rules applied. Total rules applied 1000 place count 556 transition count 533
Free-agglomeration rule (complex) applied 77 times.
Iterating global reduction 3 with 77 rules applied. Total rules applied 1077 place count 556 transition count 456
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 3 with 77 rules applied. Total rules applied 1154 place count 479 transition count 456
Partial Free-agglomeration rule applied 82 times.
Drop transitions (Partial Free agglomeration) removed 82 transitions
Iterating global reduction 4 with 82 rules applied. Total rules applied 1236 place count 479 transition count 456
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1237 place count 478 transition count 455
Applied a total of 1237 rules in 96 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 97 ms. Remains : 478/1057 places, 455/997 transitions.
RANDOM walk for 40000 steps (5033 resets) in 99 ms. (400 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (3439 resets) in 112 ms. (353 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (3426 resets) in 219 ms. (181 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (3424 resets) in 112 ms. (354 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 275387 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :0 out of 3
Probabilistic random walk after 275387 steps, saw 137752 distinct states, run finished after 3001 ms. (steps per millisecond=91 ) properties seen :0
// Phase 1: matrix 455 rows 478 cols
[2024-05-31 22:42:13] [INFO ] Invariants computation overflowed in 41 ms
[2024-05-31 22:42:13] [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, 3 unsolved
At refinement iteration 1 (OVERLAPS) 23/27 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 242/269 variables, 67/72 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/269 variables, 8/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 517/786 variables, 285/365 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/786 variables, 49/414 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/786 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 147/933 variables, 122/536 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/933 variables, 20/556 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/933 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/933 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 933/933 variables, and 556 constraints, problems are : Problem set: 0 solved, 3 unsolved in 483 ms.
Refiners :[State Equation: 478/478 constraints, ReadFeed: 78/78 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 23/27 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 242/269 variables, 67/72 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/269 variables, 8/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 3/83 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 517/786 variables, 285/368 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/786 variables, 49/417 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/786 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 147/933 variables, 122/539 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/933 variables, 20/559 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 22:42:15] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 2 ms to minimize.
[2024-05-31 22:42:16] [INFO ] Deduced a trap composed of 37 places in 92 ms of which 2 ms to minimize.
[2024-05-31 22:42:16] [INFO ] Deduced a trap composed of 37 places in 93 ms of which 1 ms to minimize.
[2024-05-31 22:42:16] [INFO ] Deduced a trap composed of 42 places in 89 ms of which 1 ms to minimize.
Problem apf0 is UNSAT
[2024-05-31 22:42:16] [INFO ] Deduced a trap composed of 25 places in 117 ms of which 2 ms to minimize.
[2024-05-31 22:42:16] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 2 ms to minimize.
[2024-05-31 22:42:16] [INFO ] Deduced a trap composed of 18 places in 116 ms of which 2 ms to minimize.
[2024-05-31 22:42:16] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 2 ms to minimize.
[2024-05-31 22:42:17] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 2 ms to minimize.
[2024-05-31 22:42:17] [INFO ] Deduced a trap composed of 12 places in 134 ms of which 2 ms to minimize.
[2024-05-31 22:42:17] [INFO ] Deduced a trap composed of 14 places in 139 ms of which 3 ms to minimize.
[2024-05-31 22:42:17] [INFO ] Deduced a trap composed of 9 places in 138 ms of which 2 ms to minimize.
[2024-05-31 22:42:17] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 3 ms to minimize.
[2024-05-31 22:42:17] [INFO ] Deduced a trap composed of 34 places in 83 ms of which 2 ms to minimize.
[2024-05-31 22:42:18] [INFO ] Deduced a trap composed of 37 places in 88 ms of which 1 ms to minimize.
[2024-05-31 22:42:18] [INFO ] Deduced a trap composed of 47 places in 67 ms of which 1 ms to minimize.
[2024-05-31 22:42:18] [INFO ] Deduced a trap composed of 46 places in 59 ms of which 1 ms to minimize.
[2024-05-31 22:42:18] [INFO ] Deduced a trap composed of 48 places in 61 ms of which 1 ms to minimize.
[2024-05-31 22:42:18] [INFO ] Deduced a trap composed of 43 places in 61 ms of which 1 ms to minimize.
[2024-05-31 22:42:18] [INFO ] Deduced a trap composed of 50 places in 63 ms of which 1 ms to minimize.
Problem apf0 is UNSAT
At refinement iteration 13 (INCLUDED_ONLY) 0/933 variables, 20/579 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-31 22:42:18] [INFO ] Deduced a trap composed of 29 places in 104 ms of which 2 ms to minimize.
[2024-05-31 22:42:18] [INFO ] Deduced a trap composed of 34 places in 96 ms of which 1 ms to minimize.
[2024-05-31 22:42:19] [INFO ] Deduced a trap composed of 79 places in 76 ms of which 1 ms to minimize.
[2024-05-31 22:42:19] [INFO ] Deduced a trap composed of 81 places in 78 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/933 variables, 4/583 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-31 22:42:19] [INFO ] Deduced a trap composed of 99 places in 70 ms of which 1 ms to minimize.
[2024-05-31 22:42:19] [INFO ] Deduced a trap composed of 98 places in 71 ms of which 1 ms to minimize.
[2024-05-31 22:42:19] [INFO ] Deduced a trap composed of 55 places in 78 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/933 variables, 3/586 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/933 variables, 0/586 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/933 variables, 0/586 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 933/933 variables, and 586 constraints, problems are : Problem set: 1 solved, 2 unsolved in 5925 ms.
Refiners :[State Equation: 478/478 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 27/27 constraints]
After SMT, in 6480ms problems are : Problem set: 1 solved, 2 unsolved
Parikh walk visited 0 properties in 30003 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 18 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 18 ms. Remains : 478/478 places, 455/455 transitions.
RANDOM walk for 40000 steps (5085 resets) in 108 ms. (366 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3389 resets) in 73 ms. (540 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3397 resets) in 75 ms. (526 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 299517 steps, run timeout after 3001 ms. (steps per millisecond=99 ) properties seen :0 out of 2
Probabilistic random walk after 299517 steps, saw 149847 distinct states, run finished after 3001 ms. (steps per millisecond=99 ) properties seen :0
// Phase 1: matrix 455 rows 478 cols
[2024-05-31 22:42:53] [INFO ] Invariants computation overflowed in 41 ms
[2024-05-31 22:42:53] [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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 23/27 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 242/269 variables, 67/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/269 variables, 8/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 517/786 variables, 285/365 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/786 variables, 49/414 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/786 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 147/933 variables, 122/536 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/933 variables, 20/556 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/933 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/933 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 933/933 variables, and 556 constraints, problems are : Problem set: 0 solved, 2 unsolved in 399 ms.
Refiners :[State Equation: 478/478 constraints, ReadFeed: 78/78 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 23/27 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 242/269 variables, 67/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/269 variables, 8/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 517/786 variables, 285/367 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/786 variables, 49/416 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/786 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 147/933 variables, 122/538 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/933 variables, 20/558 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:42:55] [INFO ] Deduced a trap composed of 25 places in 132 ms of which 2 ms to minimize.
[2024-05-31 22:42:55] [INFO ] Deduced a trap composed of 26 places in 133 ms of which 2 ms to minimize.
[2024-05-31 22:42:55] [INFO ] Deduced a trap composed of 18 places in 132 ms of which 2 ms to minimize.
[2024-05-31 22:42:55] [INFO ] Deduced a trap composed of 20 places in 139 ms of which 3 ms to minimize.
[2024-05-31 22:42:55] [INFO ] Deduced a trap composed of 19 places in 142 ms of which 2 ms to minimize.
[2024-05-31 22:42:56] [INFO ] Deduced a trap composed of 17 places in 137 ms of which 2 ms to minimize.
[2024-05-31 22:42:56] [INFO ] Deduced a trap composed of 16 places in 158 ms of which 3 ms to minimize.
[2024-05-31 22:42:56] [INFO ] Deduced a trap composed of 13 places in 154 ms of which 2 ms to minimize.
[2024-05-31 22:42:56] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 3 ms to minimize.
[2024-05-31 22:42:57] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 2 ms to minimize.
[2024-05-31 22:42:57] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 2 ms to minimize.
[2024-05-31 22:42:57] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 1 ms to minimize.
[2024-05-31 22:42:57] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 2 ms to minimize.
[2024-05-31 22:42:57] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 2 ms to minimize.
[2024-05-31 22:42:57] [INFO ] Deduced a trap composed of 37 places in 84 ms of which 1 ms to minimize.
[2024-05-31 22:42:57] [INFO ] Deduced a trap composed of 44 places in 74 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/933 variables, 16/574 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:42:58] [INFO ] Deduced a trap composed of 37 places in 98 ms of which 2 ms to minimize.
[2024-05-31 22:42:58] [INFO ] Deduced a trap composed of 110 places in 104 ms of which 1 ms to minimize.
[2024-05-31 22:42:58] [INFO ] Deduced a trap composed of 39 places in 102 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/933 variables, 3/577 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:42:59] [INFO ] Deduced a trap composed of 46 places in 91 ms of which 2 ms to minimize.
[2024-05-31 22:42:59] [INFO ] Deduced a trap composed of 109 places in 88 ms of which 2 ms to minimize.
[2024-05-31 22:42:59] [INFO ] Deduced a trap composed of 116 places in 92 ms of which 1 ms to minimize.
[2024-05-31 22:42:59] [INFO ] Deduced a trap composed of 108 places in 87 ms of which 1 ms to minimize.
[2024-05-31 22:42:59] [INFO ] Deduced a trap composed of 106 places in 89 ms of which 1 ms to minimize.
[2024-05-31 22:42:59] [INFO ] Deduced a trap composed of 102 places in 84 ms of which 2 ms to minimize.
[2024-05-31 22:42:59] [INFO ] Deduced a trap composed of 115 places in 86 ms of which 1 ms to minimize.
[2024-05-31 22:42:59] [INFO ] Deduced a trap composed of 113 places in 84 ms of which 2 ms to minimize.
[2024-05-31 22:43:00] [INFO ] Deduced a trap composed of 111 places in 87 ms of which 1 ms to minimize.
[2024-05-31 22:43:00] [INFO ] Deduced a trap composed of 106 places in 81 ms of which 1 ms to minimize.
[2024-05-31 22:43:00] [INFO ] Deduced a trap composed of 112 places in 80 ms of which 1 ms to minimize.
[2024-05-31 22:43:00] [INFO ] Deduced a trap composed of 108 places in 88 ms of which 2 ms to minimize.
[2024-05-31 22:43:00] [INFO ] Deduced a trap composed of 101 places in 91 ms of which 1 ms to minimize.
[2024-05-31 22:43:00] [INFO ] Deduced a trap composed of 103 places in 86 ms of which 1 ms to minimize.
[2024-05-31 22:43:00] [INFO ] Deduced a trap composed of 106 places in 83 ms of which 1 ms to minimize.
[2024-05-31 22:43:01] [INFO ] Deduced a trap composed of 105 places in 83 ms of which 1 ms to minimize.
[2024-05-31 22:43:02] [INFO ] Deduced a trap composed of 102 places in 85 ms of which 2 ms to minimize.
[2024-05-31 22:43:02] [INFO ] Deduced a trap composed of 112 places in 93 ms of which 2 ms to minimize.
[2024-05-31 22:43:02] [INFO ] Deduced a trap composed of 115 places in 89 ms of which 1 ms to minimize.
[2024-05-31 22:43:02] [INFO ] Deduced a trap composed of 104 places in 81 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/933 variables, 20/597 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:43:02] [INFO ] Deduced a trap composed of 50 places in 63 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/933 variables, 1/598 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/933 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:43:03] [INFO ] Deduced a trap composed of 109 places in 93 ms of which 2 ms to minimize.
[2024-05-31 22:43:03] [INFO ] Deduced a trap composed of 108 places in 80 ms of which 1 ms to minimize.
[2024-05-31 22:43:03] [INFO ] Deduced a trap composed of 105 places in 78 ms of which 1 ms to minimize.
[2024-05-31 22:43:03] [INFO ] Deduced a trap composed of 105 places in 81 ms of which 2 ms to minimize.
[2024-05-31 22:43:03] [INFO ] Deduced a trap composed of 110 places in 90 ms of which 2 ms to minimize.
[2024-05-31 22:43:03] [INFO ] Deduced a trap composed of 107 places in 86 ms of which 2 ms to minimize.
[2024-05-31 22:43:04] [INFO ] Deduced a trap composed of 107 places in 95 ms of which 1 ms to minimize.
[2024-05-31 22:43:07] [INFO ] Deduced a trap composed of 111 places in 90 ms of which 1 ms to minimize.
[2024-05-31 22:43:07] [INFO ] Deduced a trap composed of 101 places in 87 ms of which 1 ms to minimize.
[2024-05-31 22:43:08] [INFO ] Deduced a trap composed of 42 places in 77 ms of which 2 ms to minimize.
[2024-05-31 22:43:08] [INFO ] Deduced a trap composed of 117 places in 79 ms of which 1 ms to minimize.
[2024-05-31 22:43:09] [INFO ] Deduced a trap composed of 111 places in 89 ms of which 2 ms to minimize.
[2024-05-31 22:43:09] [INFO ] Deduced a trap composed of 111 places in 87 ms of which 2 ms to minimize.
[2024-05-31 22:43:09] [INFO ] Deduced a trap composed of 105 places in 91 ms of which 1 ms to minimize.
[2024-05-31 22:43:10] [INFO ] Deduced a trap composed of 108 places in 89 ms of which 2 ms to minimize.
[2024-05-31 22:43:10] [INFO ] Deduced a trap composed of 92 places in 88 ms of which 2 ms to minimize.
[2024-05-31 22:43:10] [INFO ] Deduced a trap composed of 100 places in 89 ms of which 1 ms to minimize.
[2024-05-31 22:43:10] [INFO ] Deduced a trap composed of 107 places in 87 ms of which 1 ms to minimize.
[2024-05-31 22:43:10] [INFO ] Deduced a trap composed of 40 places in 89 ms of which 2 ms to minimize.
[2024-05-31 22:43:11] [INFO ] Deduced a trap composed of 105 places in 89 ms of which 2 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/933 variables, 20/618 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/933 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:43:12] [INFO ] Deduced a trap composed of 43 places in 95 ms of which 1 ms to minimize.
[2024-05-31 22:43:12] [INFO ] Deduced a trap composed of 114 places in 90 ms of which 2 ms to minimize.
[2024-05-31 22:43:12] [INFO ] Deduced a trap composed of 114 places in 92 ms of which 1 ms to minimize.
[2024-05-31 22:43:12] [INFO ] Deduced a trap composed of 111 places in 86 ms of which 1 ms to minimize.
[2024-05-31 22:43:12] [INFO ] Deduced a trap composed of 105 places in 95 ms of which 1 ms to minimize.
[2024-05-31 22:43:13] [INFO ] Deduced a trap composed of 110 places in 95 ms of which 1 ms to minimize.
[2024-05-31 22:43:13] [INFO ] Deduced a trap composed of 105 places in 91 ms of which 1 ms to minimize.
At refinement iteration 20 (OVERLAPS) 0/933 variables, 7/625 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/933 variables, 0/625 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:43:15] [INFO ] Deduced a trap composed of 102 places in 87 ms of which 1 ms to minimize.
At refinement iteration 22 (OVERLAPS) 0/933 variables, 1/626 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:43:15] [INFO ] Deduced a trap composed of 84 places in 90 ms of which 2 ms to minimize.
[2024-05-31 22:43:15] [INFO ] Deduced a trap composed of 51 places in 83 ms of which 1 ms to minimize.
[2024-05-31 22:43:16] [INFO ] Deduced a trap composed of 101 places in 81 ms of which 2 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/933 variables, 3/629 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:43:17] [INFO ] Deduced a trap composed of 52 places in 60 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/933 variables, 1/630 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/933 variables, 0/630 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:43:18] [INFO ] Deduced a trap composed of 131 places in 119 ms of which 1 ms to minimize.
[2024-05-31 22:43:18] [INFO ] Deduced a trap composed of 122 places in 113 ms of which 2 ms to minimize.
[2024-05-31 22:43:18] [INFO ] Deduced a trap composed of 129 places in 110 ms of which 2 ms to minimize.
[2024-05-31 22:43:18] [INFO ] Deduced a trap composed of 125 places in 111 ms of which 2 ms to minimize.
[2024-05-31 22:43:19] [INFO ] Deduced a trap composed of 129 places in 112 ms of which 2 ms to minimize.
[2024-05-31 22:43:19] [INFO ] Deduced a trap composed of 93 places in 85 ms of which 1 ms to minimize.
At refinement iteration 26 (OVERLAPS) 0/933 variables, 6/636 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/933 variables, 0/636 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:43:21] [INFO ] Deduced a trap composed of 131 places in 106 ms of which 2 ms to minimize.
At refinement iteration 28 (OVERLAPS) 0/933 variables, 1/637 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/933 variables, 0/637 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:43:21] [INFO ] Deduced a trap composed of 56 places in 70 ms of which 1 ms to minimize.
At refinement iteration 30 (OVERLAPS) 0/933 variables, 1/638 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/933 variables, 0/638 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (OVERLAPS) 0/933 variables, 0/638 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 933/933 variables, and 638 constraints, problems are : Problem set: 0 solved, 2 unsolved in 29157 ms.
Refiners :[State Equation: 478/478 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 80/80 constraints]
After SMT, in 29611ms problems are : Problem set: 0 solved, 2 unsolved
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 11 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 10 ms. Remains 478 /478 variables (removed 0) and now considering 455/455 (removed 0) transitions.
// Phase 1: matrix 455 rows 478 cols
[2024-05-31 22:43:52] [INFO ] Invariants computation overflowed in 38 ms
[2024-05-31 22:43:53] [INFO ] Implicit Places using invariants in 491 ms returned []
// Phase 1: matrix 455 rows 478 cols
[2024-05-31 22:43:53] [INFO ] Invariants computation overflowed in 40 ms
[2024-05-31 22:43:53] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 22:44:10] [INFO ] Implicit Places using invariants and state equation in 17474 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 146, 151, 152, 178, 199, 205, 212, 226, 231, 255, 261, 283, 289, 309, 314, 335, 340, 361, 367, 388, 390, 394, 414, 420, 442, 447, 451, 470, 476]
[2024-05-31 22:44:10] [INFO ] Actually due to overlaps returned [212, 151]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 17978 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 476/478 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 476 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 475 transition count 454
Applied a total of 2 rules in 20 ms. Remains 475 /476 variables (removed 1) and now considering 454/455 (removed 1) transitions.
// Phase 1: matrix 454 rows 475 cols
[2024-05-31 22:44:10] [INFO ] Invariants computation overflowed in 38 ms
[2024-05-31 22:44:11] [INFO ] Implicit Places using invariants in 494 ms returned []
// Phase 1: matrix 454 rows 475 cols
[2024-05-31 22:44:11] [INFO ] Invariants computation overflowed in 39 ms
[2024-05-31 22:44:11] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 22:44:24] [INFO ] Implicit Places using invariants and state equation in 13408 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 146, 151, 177, 198, 204, 223, 228, 252, 258, 280, 286, 306, 311, 332, 337, 358, 364, 385, 387, 391, 411, 417, 439, 444, 448, 467, 473]
[2024-05-31 22:44:24] [INFO ] Actually due to overlaps returned [448, 387]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 13914 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 473/478 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 473 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 472 transition count 453
Applied a total of 2 rules in 27 ms. Remains 472 /473 variables (removed 1) and now considering 453/454 (removed 1) transitions.
// Phase 1: matrix 453 rows 472 cols
[2024-05-31 22:44:24] [INFO ] Invariants computation overflowed in 32 ms
[2024-05-31 22:44:25] [INFO ] Implicit Places using invariants in 461 ms returned []
// Phase 1: matrix 453 rows 472 cols
[2024-05-31 22:44:25] [INFO ] Invariants computation overflowed in 38 ms
[2024-05-31 22:44:25] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 22:44:45] [INFO ] Implicit Places using invariants and state equation in 20501 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 146, 151, 177, 198, 204, 223, 228, 252, 258, 280, 286, 306, 311, 332, 337, 358, 364, 385, 390, 410, 416, 438, 443, 464, 470]
[2024-05-31 22:44:45] [INFO ] Actually due to overlaps returned [48, 42]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 20965 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 470/478 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 470 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 469 transition count 452
Applied a total of 2 rules in 30 ms. Remains 469 /470 variables (removed 1) and now considering 452/453 (removed 1) transitions.
// Phase 1: matrix 452 rows 469 cols
[2024-05-31 22:44:45] [INFO ] Invariants computation overflowed in 24 ms
[2024-05-31 22:44:46] [INFO ] Implicit Places using invariants in 638 ms returned []
// Phase 1: matrix 452 rows 469 cols
[2024-05-31 22:44:46] [INFO ] Invariants computation overflowed in 24 ms
[2024-05-31 22:44:46] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 22:44:57] [INFO ] Implicit Places using invariants and state equation in 10886 ms returned [65, 70, 91, 96, 116, 122, 143, 148, 174, 195, 201, 220, 225, 249, 255, 277, 283, 303, 308, 329, 334, 355, 361, 382, 387, 407, 413, 435, 440, 461, 467]
[2024-05-31 22:44:57] [INFO ] Actually due to overlaps returned [70, 65]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 11550 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 467/478 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 467 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 466 transition count 451
Applied a total of 2 rules in 19 ms. Remains 466 /467 variables (removed 1) and now considering 451/452 (removed 1) transitions.
// Phase 1: matrix 451 rows 466 cols
[2024-05-31 22:44:57] [INFO ] Invariants computation overflowed in 35 ms
[2024-05-31 22:44:57] [INFO ] Implicit Places using invariants in 444 ms returned []
// Phase 1: matrix 451 rows 466 cols
[2024-05-31 22:44:57] [INFO ] Invariants computation overflowed in 35 ms
[2024-05-31 22:44:57] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 22:45:08] [INFO ] Implicit Places using invariants and state equation in 10702 ms returned [88, 93, 113, 119, 140, 145, 171, 192, 198, 217, 222, 246, 252, 274, 280, 300, 305, 326, 331, 352, 358, 379, 384, 404, 410, 432, 437, 458, 464]
[2024-05-31 22:45:08] [INFO ] Actually due to overlaps returned [93, 88]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 11147 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 464/478 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 464 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 463 transition count 450
Applied a total of 2 rules in 27 ms. Remains 463 /464 variables (removed 1) and now considering 450/451 (removed 1) transitions.
// Phase 1: matrix 450 rows 463 cols
[2024-05-31 22:45:08] [INFO ] Invariants computation overflowed in 34 ms
[2024-05-31 22:45:08] [INFO ] Implicit Places using invariants in 401 ms returned []
// Phase 1: matrix 450 rows 463 cols
[2024-05-31 22:45:08] [INFO ] Invariants computation overflowed in 34 ms
[2024-05-31 22:45:08] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 22:45:20] [INFO ] Implicit Places using invariants and state equation in 12054 ms returned [110, 116, 137, 142, 168, 189, 195, 214, 219, 243, 249, 271, 277, 297, 302, 323, 328, 349, 355, 376, 381, 401, 407, 429, 434, 455, 461]
[2024-05-31 22:45:20] [INFO ] Actually due to overlaps returned [116, 110]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 12461 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 461/478 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 461 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 460 transition count 449
Applied a total of 2 rules in 22 ms. Remains 460 /461 variables (removed 1) and now considering 449/450 (removed 1) transitions.
// Phase 1: matrix 449 rows 460 cols
[2024-05-31 22:45:20] [INFO ] Invariants computation overflowed in 32 ms
[2024-05-31 22:45:21] [INFO ] Implicit Places using invariants in 397 ms returned []
// Phase 1: matrix 449 rows 460 cols
[2024-05-31 22:45:21] [INFO ] Invariants computation overflowed in 26 ms
[2024-05-31 22:45:21] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 22:45:30] [INFO ] Implicit Places using invariants and state equation in 9104 ms returned [134, 139, 165, 186, 192, 211, 216, 240, 246, 268, 274, 294, 299, 320, 325, 346, 352, 373, 378, 398, 404, 426, 431, 452, 458]
[2024-05-31 22:45:30] [INFO ] Actually due to overlaps returned [139, 134]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 9502 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 458/478 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 458 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 457 transition count 448
Applied a total of 2 rules in 18 ms. Remains 457 /458 variables (removed 1) and now considering 448/449 (removed 1) transitions.
// Phase 1: matrix 448 rows 457 cols
[2024-05-31 22:45:30] [INFO ] Invariants computation overflowed in 36 ms
[2024-05-31 22:45:30] [INFO ] Implicit Places using invariants in 397 ms returned []
// Phase 1: matrix 448 rows 457 cols
[2024-05-31 22:45:30] [INFO ] Invariants computation overflowed in 36 ms
[2024-05-31 22:45:30] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 22:45:48] [INFO ] Implicit Places using invariants and state equation in 18163 ms returned [162, 183, 189, 208, 213, 237, 243, 265, 271, 291, 296, 317, 322, 343, 349, 370, 375, 395, 401, 423, 428, 449, 455]
[2024-05-31 22:45:48] [INFO ] Actually due to overlaps returned [162]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 18571 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 456/478 places, 448/455 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 456 transition count 448
Applied a total of 1 rules in 16 ms. Remains 456 /456 variables (removed 0) and now considering 448/448 (removed 0) transitions.
// Phase 1: matrix 448 rows 456 cols
[2024-05-31 22:45:48] [INFO ] Invariants computation overflowed in 30 ms
[2024-05-31 22:45:49] [INFO ] Implicit Places using invariants in 394 ms returned []
// Phase 1: matrix 448 rows 456 cols
[2024-05-31 22:45:49] [INFO ] Invariants computation overflowed in 33 ms
[2024-05-31 22:45:49] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 22:45:57] [INFO ] Implicit Places using invariants and state equation in 8148 ms returned [182, 188, 207, 212, 236, 242, 264, 270, 290, 295, 316, 321, 342, 348, 369, 374, 394, 400, 422, 427, 448, 454]
[2024-05-31 22:45:57] [INFO ] Actually due to overlaps returned [188, 182]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 8557 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 454/478 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 20 ms. Remains 453 /454 variables (removed 1) and now considering 447/448 (removed 1) transitions.
// Phase 1: matrix 447 rows 453 cols
[2024-05-31 22:45:57] [INFO ] Invariants computation overflowed in 33 ms
[2024-05-31 22:45:57] [INFO ] Implicit Places using invariants in 349 ms returned []
// Phase 1: matrix 447 rows 453 cols
[2024-05-31 22:45:57] [INFO ] Invariants computation overflowed in 34 ms
[2024-05-31 22:45:58] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 22:46:06] [INFO ] Implicit Places using invariants and state equation in 8207 ms returned [204, 209, 233, 239, 261, 267, 287, 292, 313, 318, 339, 345, 366, 371, 391, 397, 419, 424, 445, 451]
[2024-05-31 22:46:06] [INFO ] Actually due to overlaps returned [209, 204]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 8575 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 10 : 451/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 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 20 ms. Remains 450 /451 variables (removed 1) and now considering 446/447 (removed 1) transitions.
// Phase 1: matrix 446 rows 450 cols
[2024-05-31 22:46:06] [INFO ] Invariants computation overflowed in 36 ms
[2024-05-31 22:46:06] [INFO ] Implicit Places using invariants in 345 ms returned []
// Phase 1: matrix 446 rows 450 cols
[2024-05-31 22:46:06] [INFO ] Invariants computation overflowed in 37 ms
[2024-05-31 22:46:06] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 22:46:13] [INFO ] Implicit Places using invariants and state equation in 7027 ms returned [230, 236, 258, 264, 284, 289, 310, 315, 336, 342, 363, 368, 388, 394, 416, 421, 442, 448]
[2024-05-31 22:46:13] [INFO ] Actually due to overlaps returned [236, 230]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 7389 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 11 : 448/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 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 21 ms. Remains 447 /448 variables (removed 1) and now considering 445/446 (removed 1) transitions.
// Phase 1: matrix 445 rows 447 cols
[2024-05-31 22:46:13] [INFO ] Invariants computation overflowed in 34 ms
[2024-05-31 22:46:13] [INFO ] Implicit Places using invariants in 347 ms returned []
// Phase 1: matrix 445 rows 447 cols
[2024-05-31 22:46:13] [INFO ] Invariants computation overflowed in 31 ms
[2024-05-31 22:46:14] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 22:46:22] [INFO ] Implicit Places using invariants and state equation in 8461 ms returned [255, 261, 281, 286, 307, 312, 333, 339, 360, 365, 385, 391, 413, 418, 439, 445]
[2024-05-31 22:46:22] [INFO ] Actually due to overlaps returned [261, 255]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 8808 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 12 : 445/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 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 17 ms. Remains 444 /445 variables (removed 1) and now considering 444/445 (removed 1) transitions.
// Phase 1: matrix 444 rows 444 cols
[2024-05-31 22:46:22] [INFO ] Invariants computation overflowed in 33 ms
[2024-05-31 22:46:22] [INFO ] Implicit Places using invariants in 340 ms returned []
// Phase 1: matrix 444 rows 444 cols
[2024-05-31 22:46:22] [INFO ] Invariants computation overflowed in 26 ms
[2024-05-31 22:46:22] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 22:46:30] [INFO ] Implicit Places using invariants and state equation in 7827 ms returned [278, 283, 304, 309, 330, 336, 357, 362, 382, 388, 410, 415, 436, 442]
[2024-05-31 22:46:30] [INFO ] Actually due to overlaps returned [283, 278]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 8169 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 13 : 442/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 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 20 ms. Remains 441 /442 variables (removed 1) and now considering 443/444 (removed 1) transitions.
// Phase 1: matrix 443 rows 441 cols
[2024-05-31 22:46:30] [INFO ] Computed 74 invariants in 47 ms
[2024-05-31 22:46:31] [INFO ] Implicit Places using invariants in 557 ms returned [301, 306, 327, 333, 354, 359, 379, 385, 407, 412, 433, 439]
[2024-05-31 22:46:31] [INFO ] Actually due to overlaps returned [306, 301]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 558 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 14 : 439/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 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 16 ms. Remains 438 /439 variables (removed 1) and now considering 442/443 (removed 1) transitions.
// Phase 1: matrix 442 rows 438 cols
[2024-05-31 22:46:31] [INFO ] Invariants computation overflowed in 33 ms
[2024-05-31 22:46:31] [INFO ] Implicit Places using invariants in 319 ms returned []
// Phase 1: matrix 442 rows 438 cols
[2024-05-31 22:46:31] [INFO ] Invariants computation overflowed in 27 ms
[2024-05-31 22:46:31] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 22:46:39] [INFO ] Implicit Places using invariants and state equation in 8430 ms returned [324, 330, 351, 356, 376, 382, 404, 409, 430, 436]
[2024-05-31 22:46:39] [INFO ] Actually due to overlaps returned [330, 324]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 8752 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 15 : 436/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 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 16 ms. Remains 435 /436 variables (removed 1) and now considering 441/442 (removed 1) transitions.
// Phase 1: matrix 441 rows 435 cols
[2024-05-31 22:46:39] [INFO ] Invariants computation overflowed in 34 ms
[2024-05-31 22:46:40] [INFO ] Implicit Places using invariants in 315 ms returned []
// Phase 1: matrix 441 rows 435 cols
[2024-05-31 22:46:40] [INFO ] Invariants computation overflowed in 35 ms
[2024-05-31 22:46:40] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 22:46:48] [INFO ] Implicit Places using invariants and state equation in 8295 ms returned [348, 353, 373, 379, 401, 406, 427, 433]
[2024-05-31 22:46:48] [INFO ] Actually due to overlaps returned [353, 348]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 8612 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 16 : 433/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 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 17 ms. Remains 432 /433 variables (removed 1) and now considering 440/441 (removed 1) transitions.
// Phase 1: matrix 440 rows 432 cols
[2024-05-31 22:46:48] [INFO ] Invariants computation overflowed in 36 ms
[2024-05-31 22:46:48] [INFO ] Implicit Places using invariants in 311 ms returned []
// Phase 1: matrix 440 rows 432 cols
[2024-05-31 22:46:48] [INFO ] Invariants computation overflowed in 35 ms
[2024-05-31 22:46:49] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 22:46:56] [INFO ] Implicit Places using invariants and state equation in 7538 ms returned [370, 376, 398, 403, 424, 430]
[2024-05-31 22:46:56] [INFO ] Actually due to overlaps returned [376, 370]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 7851 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 17 : 430/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 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 16 ms. Remains 429 /430 variables (removed 1) and now considering 439/440 (removed 1) transitions.
// Phase 1: matrix 439 rows 429 cols
[2024-05-31 22:46:56] [INFO ] Invariants computation overflowed in 27 ms
[2024-05-31 22:46:56] [INFO ] Implicit Places using invariants in 286 ms returned []
// Phase 1: matrix 439 rows 429 cols
[2024-05-31 22:46:56] [INFO ] Invariants computation overflowed in 26 ms
[2024-05-31 22:46:56] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 22:47:04] [INFO ] Implicit Places using invariants and state equation in 7740 ms returned [395, 400, 421, 427]
[2024-05-31 22:47:04] [INFO ] Actually due to overlaps returned [400, 395]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 8026 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 18 : 427/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 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 15 ms. Remains 426 /427 variables (removed 1) and now considering 438/439 (removed 1) transitions.
// Phase 1: matrix 438 rows 426 cols
[2024-05-31 22:47:04] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-31 22:47:04] [INFO ] Implicit Places using invariants in 283 ms returned []
// Phase 1: matrix 438 rows 426 cols
[2024-05-31 22:47:04] [INFO ] Invariants computation overflowed in 27 ms
[2024-05-31 22:47:04] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 22:47:12] [INFO ] Implicit Places using invariants and state equation in 7640 ms returned [418, 424]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 7926 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 19 : 424/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 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 15 ms. Remains 423 /424 variables (removed 1) and now considering 437/438 (removed 1) transitions.
// Phase 1: matrix 437 rows 423 cols
[2024-05-31 22:47:12] [INFO ] Invariants computation overflowed in 27 ms
[2024-05-31 22:47:12] [INFO ] Implicit Places using invariants in 274 ms returned []
// Phase 1: matrix 437 rows 423 cols
[2024-05-31 22:47:12] [INFO ] Invariants computation overflowed in 32 ms
[2024-05-31 22:47:12] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 22:47:19] [INFO ] Implicit Places using invariants and state equation in 6761 ms returned []
Implicit Place search using SMT with State Equation took 7059 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 20 : 423/478 places, 437/455 transitions.
Finished structural reductions in REACHABILITY mode , in 20 iterations and 206762 ms. Remains : 423/478 places, 437/455 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 20 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DoubleExponent-PT-020-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-020-LTLCardinality-11 finished in 394622 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)))'
Support contains 1 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 242 transitions
Trivial Post-agglo rules discarded 242 transitions
Performed 242 trivial Post agglomeration. Transition count delta: 242
Iterating post reduction 0 with 242 rules applied. Total rules applied 243 place count 1055 transition count 753
Reduce places removed 242 places and 0 transitions.
Iterating post reduction 1 with 242 rules applied. Total rules applied 485 place count 813 transition count 753
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 485 place count 813 transition count 713
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 565 place count 773 transition count 713
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 2 with 362 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 2 with 76 rules applied. Total rules applied 1003 place count 554 transition count 532
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1004 place count 553 transition count 531
Applied a total of 1004 rules in 66 ms. Remains 553 /1057 variables (removed 504) and now considering 531/997 (removed 466) transitions.
// Phase 1: matrix 531 rows 553 cols
[2024-05-31 22:47:19] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-31 22:47:20] [INFO ] Implicit Places using invariants in 519 ms returned []
// Phase 1: matrix 531 rows 553 cols
[2024-05-31 22:47:20] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-31 22:47:20] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-31 22:47:48] [INFO ] Implicit Places using invariants and state equation in 28108 ms returned []
Implicit Place search using SMT with State Equation took 28632 ms to find 0 implicit places.
[2024-05-31 22:47:48] [INFO ] Redundant transitions in 2 ms returned []
Running 530 sub problems to find dead transitions.
// Phase 1: matrix 531 rows 553 cols
[2024-05-31 22:47:48] [INFO ] Invariants computation overflowed in 46 ms
[2024-05-31 22:47:48] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/552 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 1 (OVERLAPS) 531/1083 variables, 552/552 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1083 variables, 38/590 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1083 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 530 unsolved
SMT process timed out in 30170ms, After SMT, problems are : Problem set: 0 solved, 530 unsolved
Search for dead transitions found 0 dead transitions in 30176ms
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 58890 ms. Remains : 553/1057 places, 531/997 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-020-LTLCardinality-12
Product exploration explored 100000 steps with 13844 reset in 104 ms.
Product exploration explored 100000 steps with 13831 reset in 115 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1740 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 117 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 83 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (5545 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (3253 resets) in 64 ms. (615 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 379460 steps, run timeout after 3001 ms. (steps per millisecond=126 ) properties seen :0 out of 1
Probabilistic random walk after 379460 steps, saw 189781 distinct states, run finished after 3001 ms. (steps per millisecond=126 ) properties seen :0
// Phase 1: matrix 531 rows 553 cols
[2024-05-31 22:48:21] [INFO ] Invariants computation overflowed in 36 ms
[2024-05-31 22:48:21] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/31 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 75/106 variables, 33/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 94/200 variables, 48/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/200 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 97/297 variables, 49/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/297 variables, 4/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/297 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 108/405 variables, 54/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/405 variables, 4/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/405 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 110/515 variables, 56/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/515 variables, 4/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/515 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 110/625 variables, 56/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/625 variables, 4/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/625 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 110/735 variables, 56/382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/735 variables, 4/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/735 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 110/845 variables, 56/442 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/845 variables, 4/446 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/845 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 108/953 variables, 56/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/953 variables, 4/506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/953 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 83/1036 variables, 49/555 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1036 variables, 4/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1036 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 40/1076 variables, 24/583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1076 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 8/1084 variables, 8/591 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1084 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 0/1084 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1084/1084 variables, and 591 constraints, problems are : Problem set: 0 solved, 1 unsolved in 460 ms.
Refiners :[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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/31 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 75/106 variables, 33/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/106 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 94/200 variables, 48/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/200 variables, 3/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/200 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 97/297 variables, 49/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/297 variables, 4/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/297 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 108/405 variables, 54/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/405 variables, 4/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/405 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 110/515 variables, 56/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/515 variables, 4/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/515 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 110/625 variables, 56/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/625 variables, 4/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/625 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 110/735 variables, 56/383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/735 variables, 4/387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/735 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 110/845 variables, 56/443 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/845 variables, 4/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/845 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 108/953 variables, 56/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/953 variables, 4/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/953 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 83/1036 variables, 49/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1036 variables, 4/560 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1036 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 40/1076 variables, 24/584 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:48:23] [INFO ] Deduced a trap composed of 5 places in 134 ms of which 3 ms to minimize.
[2024-05-31 22:48:23] [INFO ] Deduced a trap composed of 44 places in 135 ms of which 2 ms to minimize.
At refinement iteration 37 (INCLUDED_ONLY) 0/1076 variables, 2/586 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1076 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 8/1084 variables, 8/594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1084 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 0/1084 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1084/1084 variables, and 594 constraints, problems are : Problem set: 0 solved, 1 unsolved in 917 ms.
Refiners :[State Equation: 553/553 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 1444ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2029 ms.
Support contains 1 out of 553 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 553/553 places, 531/531 transitions.
Graph (complete) has 1660 edges and 553 vertex of which 552 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 552 transition count 530
Free-agglomeration rule (complex) applied 77 times.
Iterating global reduction 1 with 77 rules applied. Total rules applied 79 place count 552 transition count 453
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 1 with 77 rules applied. Total rules applied 156 place count 475 transition count 453
Partial Free-agglomeration rule applied 80 times.
Drop transitions (Partial Free agglomeration) removed 80 transitions
Iterating global reduction 2 with 80 rules applied. Total rules applied 236 place count 475 transition count 453
Applied a total of 236 rules in 30 ms. Remains 475 /553 variables (removed 78) and now considering 453/531 (removed 78) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 475/553 places, 453/531 transitions.
RANDOM walk for 40000 steps (5089 resets) in 77 ms. (512 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (3407 resets) in 58 ms. (677 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 416821 steps, run timeout after 3001 ms. (steps per millisecond=138 ) properties seen :0 out of 1
Probabilistic random walk after 416821 steps, saw 208530 distinct states, run finished after 3001 ms. (steps per millisecond=138 ) properties seen :0
// Phase 1: matrix 453 rows 475 cols
[2024-05-31 22:48:28] [INFO ] Invariants computation overflowed in 35 ms
[2024-05-31 22:48:28] [INFO ] State equation strengthened by 78 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 29/33 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 201/234 variables, 56/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 8/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 491/725 variables, 248/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/725 variables, 41/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/725 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 203/928 variables, 163/526 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/928 variables, 27/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/928 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/928 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 928/928 variables, and 553 constraints, problems are : Problem set: 0 solved, 1 unsolved in 514 ms.
Refiners :[State Equation: 475/475 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 29/33 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 201/234 variables, 56/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 8/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 491/725 variables, 248/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/725 variables, 41/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/725 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 203/928 variables, 163/527 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/928 variables, 27/554 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/928 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/928 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 928/928 variables, and 554 constraints, problems are : Problem set: 0 solved, 1 unsolved in 433 ms.
Refiners :[State Equation: 475/475 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1014ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2831 ms.
Support contains 1 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 9 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-31 22:48:32] [INFO ] Invariants computation overflowed in 36 ms
[2024-05-31 22:48:32] [INFO ] Implicit Places using invariants in 514 ms returned []
// Phase 1: matrix 453 rows 475 cols
[2024-05-31 22:48:32] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-31 22:48:33] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 22:48:42] [INFO ] Implicit Places using invariants and state equation in 9562 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 146, 151, 152, 172, 177, 198, 204, 211, 227, 232, 255, 261, 283, 288, 308, 313, 334, 339, 360, 366, 387, 389, 393, 413, 419, 441, 446, 450, 467, 473]
[2024-05-31 22:48:42] [INFO ] Actually due to overlaps returned [211, 151]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 10086 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 17 ms. Remains 472 /473 variables (removed 1) and now considering 452/453 (removed 1) transitions.
// Phase 1: matrix 452 rows 472 cols
[2024-05-31 22:48:42] [INFO ] Invariants computation overflowed in 35 ms
[2024-05-31 22:48:42] [INFO ] Implicit Places using invariants in 486 ms returned []
// Phase 1: matrix 452 rows 472 cols
[2024-05-31 22:48:42] [INFO ] Invariants computation overflowed in 34 ms
[2024-05-31 22:48:43] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 22:48:52] [INFO ] Implicit Places using invariants and state equation in 9435 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 146, 151, 171, 176, 197, 203, 224, 229, 252, 258, 280, 285, 305, 310, 331, 336, 357, 363, 384, 386, 390, 410, 416, 438, 443, 447, 464, 470]
[2024-05-31 22:48:52] [INFO ] Actually due to overlaps returned [447, 386]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 9930 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-31 22:48:52] [INFO ] Invariants computation overflowed in 38 ms
[2024-05-31 22:48:52] [INFO ] Implicit Places using invariants in 459 ms returned []
// Phase 1: matrix 451 rows 469 cols
[2024-05-31 22:48:52] [INFO ] Invariants computation overflowed in 32 ms
[2024-05-31 22:48:53] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 22:49:03] [INFO ] Implicit Places using invariants and state equation in 10252 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 146, 151, 171, 176, 197, 203, 224, 229, 252, 258, 280, 285, 305, 310, 331, 336, 357, 363, 384, 389, 409, 415, 437, 442, 461, 467]
[2024-05-31 22:49:03] [INFO ] Actually due to overlaps returned [48, 42]
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 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 24 ms. Remains 466 /467 variables (removed 1) and now considering 450/451 (removed 1) transitions.
// Phase 1: matrix 450 rows 466 cols
[2024-05-31 22:49:03] [INFO ] Invariants computation overflowed in 29 ms
[2024-05-31 22:49:03] [INFO ] Implicit Places using invariants in 469 ms returned []
// Phase 1: matrix 450 rows 466 cols
[2024-05-31 22:49:03] [INFO ] Invariants computation overflowed in 24 ms
[2024-05-31 22:49:03] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 22:49:17] [INFO ] Implicit Places using invariants and state equation in 13657 ms returned [65, 70, 91, 96, 116, 122, 143, 148, 168, 173, 194, 200, 221, 226, 249, 255, 277, 282, 302, 307, 328, 333, 354, 360, 381, 386, 406, 412, 434, 439, 458, 464]
[2024-05-31 22:49:17] [INFO ] Actually due to overlaps returned [70, 65]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 14128 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 17 ms. Remains 463 /464 variables (removed 1) and now considering 449/450 (removed 1) transitions.
// Phase 1: matrix 449 rows 463 cols
[2024-05-31 22:49:17] [INFO ] Computed 91 invariants in 56 ms
[2024-05-31 22:49:18] [INFO ] Implicit Places using invariants in 1074 ms returned [88, 93, 113, 119, 140, 145, 165, 170, 191, 197, 218, 223, 246, 252, 274, 279, 299, 304, 325, 330, 351, 357, 378, 383, 403, 409, 431, 436, 455, 461]
[2024-05-31 22:49:18] [INFO ] Actually due to overlaps returned [93, 88]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1075 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 41 ms. Remains 460 /461 variables (removed 1) and now considering 448/449 (removed 1) transitions.
// Phase 1: matrix 448 rows 460 cols
[2024-05-31 22:49:18] [INFO ] Invariants computation overflowed in 27 ms
[2024-05-31 22:49:18] [INFO ] Implicit Places using invariants in 416 ms returned []
// Phase 1: matrix 448 rows 460 cols
[2024-05-31 22:49:18] [INFO ] Invariants computation overflowed in 24 ms
[2024-05-31 22:49:19] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 22:49:29] [INFO ] Implicit Places using invariants and state equation in 10529 ms returned [110, 116, 137, 142, 162, 167, 188, 194, 215, 220, 243, 249, 271, 276, 296, 301, 322, 327, 348, 354, 375, 380, 400, 406, 428, 433, 452, 458]
[2024-05-31 22:49:29] [INFO ] Actually due to overlaps returned [116, 110]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 10968 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-31 22:49:29] [INFO ] Invariants computation overflowed in 27 ms
[2024-05-31 22:49:29] [INFO ] Implicit Places using invariants in 363 ms returned []
// Phase 1: matrix 447 rows 457 cols
[2024-05-31 22:49:29] [INFO ] Invariants computation overflowed in 27 ms
[2024-05-31 22:49:29] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 22:49:38] [INFO ] Implicit Places using invariants and state equation in 8888 ms returned [134, 139, 159, 164, 185, 191, 212, 217, 240, 246, 268, 273, 293, 298, 319, 324, 345, 351, 372, 377, 397, 403, 425, 430, 449, 455]
[2024-05-31 22:49:38] [INFO ] Actually due to overlaps returned [139, 134]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 9268 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-31 22:49:38] [INFO ] Invariants computation overflowed in 39 ms
[2024-05-31 22:49:39] [INFO ] Implicit Places using invariants in 371 ms returned []
// Phase 1: matrix 446 rows 454 cols
[2024-05-31 22:49:39] [INFO ] Invariants computation overflowed in 35 ms
[2024-05-31 22:49:39] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 22:49:46] [INFO ] Implicit Places using invariants and state equation in 7637 ms returned [156, 161, 182, 188, 209, 214, 237, 243, 265, 270, 290, 295, 316, 321, 342, 348, 369, 374, 394, 400, 422, 427, 446, 452]
[2024-05-31 22:49:46] [INFO ] Actually due to overlaps returned [161, 156]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 8040 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 18 ms. Remains 451 /452 variables (removed 1) and now considering 445/446 (removed 1) transitions.
// Phase 1: matrix 445 rows 451 cols
[2024-05-31 22:49:46] [INFO ] Invariants computation overflowed in 35 ms
[2024-05-31 22:49:47] [INFO ] Implicit Places using invariants in 360 ms returned []
// Phase 1: matrix 445 rows 451 cols
[2024-05-31 22:49:47] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-31 22:49:47] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 22:49:59] [INFO ] Implicit Places using invariants and state equation in 12855 ms returned [179, 185, 206, 211, 234, 240, 262, 267, 287, 292, 313, 318, 339, 345, 366, 371, 391, 397, 419, 424, 443, 449]
[2024-05-31 22:49:59] [INFO ] Actually due to overlaps returned [185, 179]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 13229 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-31 22:50:00] [INFO ] Invariants computation overflowed in 29 ms
[2024-05-31 22:50:00] [INFO ] Implicit Places using invariants in 356 ms returned []
// Phase 1: matrix 444 rows 448 cols
[2024-05-31 22:50:00] [INFO ] Invariants computation overflowed in 25 ms
[2024-05-31 22:50:00] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 22:50:13] [INFO ] Implicit Places using invariants and state equation in 13263 ms returned [203, 208, 231, 237, 259, 264, 284, 289, 310, 315, 336, 342, 363, 368, 388, 394, 416, 421, 440, 446]
[2024-05-31 22:50:13] [INFO ] Actually due to overlaps returned [208, 203]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 13655 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 18 ms. Remains 445 /446 variables (removed 1) and now considering 443/444 (removed 1) transitions.
// Phase 1: matrix 443 rows 445 cols
[2024-05-31 22:50:13] [INFO ] Computed 79 invariants in 34 ms
[2024-05-31 22:50:14] [INFO ] Implicit Places using invariants in 762 ms returned [228, 234, 256, 261, 281, 286, 307, 312, 333, 339, 360, 365, 385, 391, 413, 418, 437, 443]
[2024-05-31 22:50:14] [INFO ] Actually due to overlaps returned [234, 228]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 776 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 26 ms. Remains 442 /443 variables (removed 1) and now considering 442/443 (removed 1) transitions.
// Phase 1: matrix 442 rows 442 cols
[2024-05-31 22:50:14] [INFO ] Invariants computation overflowed in 24 ms
[2024-05-31 22:50:14] [INFO ] Implicit Places using invariants in 322 ms returned []
// Phase 1: matrix 442 rows 442 cols
[2024-05-31 22:50:14] [INFO ] Invariants computation overflowed in 23 ms
[2024-05-31 22:50:14] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 22:50:23] [INFO ] Implicit Places using invariants and state equation in 8383 ms returned [253, 258, 278, 283, 304, 309, 330, 336, 357, 362, 382, 388, 410, 415, 434, 440]
[2024-05-31 22:50:23] [INFO ] Actually due to overlaps returned [258, 253]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 8719 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 15 ms. Remains 439 /440 variables (removed 1) and now considering 441/442 (removed 1) transitions.
// Phase 1: matrix 441 rows 439 cols
[2024-05-31 22:50:23] [INFO ] Invariants computation overflowed in 22 ms
[2024-05-31 22:50:23] [INFO ] Implicit Places using invariants in 309 ms returned []
// Phase 1: matrix 441 rows 439 cols
[2024-05-31 22:50:23] [INFO ] Invariants computation overflowed in 26 ms
[2024-05-31 22:50:23] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 22:50:32] [INFO ] Implicit Places using invariants and state equation in 8942 ms returned [275, 280, 301, 306, 327, 333, 354, 359, 379, 385, 407, 412, 431, 437]
[2024-05-31 22:50:32] [INFO ] Actually due to overlaps returned [280, 275]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 9264 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 22 ms. Remains 436 /437 variables (removed 1) and now considering 440/441 (removed 1) transitions.
// Phase 1: matrix 440 rows 436 cols
[2024-05-31 22:50:32] [INFO ] Invariants computation overflowed in 23 ms
[2024-05-31 22:50:32] [INFO ] Implicit Places using invariants in 295 ms returned []
// Phase 1: matrix 440 rows 436 cols
[2024-05-31 22:50:32] [INFO ] Invariants computation overflowed in 22 ms
[2024-05-31 22:50:32] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 22:50:40] [INFO ] Implicit Places using invariants and state equation in 8083 ms returned [298, 303, 324, 330, 351, 356, 376, 382, 404, 409, 428, 434]
[2024-05-31 22:50:40] [INFO ] Actually due to overlaps returned [303, 298]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 8387 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 16 ms. Remains 433 /434 variables (removed 1) and now considering 439/440 (removed 1) transitions.
// Phase 1: matrix 439 rows 433 cols
[2024-05-31 22:50:40] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-31 22:50:41] [INFO ] Implicit Places using invariants in 296 ms returned []
// Phase 1: matrix 439 rows 433 cols
[2024-05-31 22:50:41] [INFO ] Invariants computation overflowed in 24 ms
[2024-05-31 22:50:41] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 22:50:53] [INFO ] Implicit Places using invariants and state equation in 12159 ms returned [321, 327, 348, 353, 373, 379, 401, 406, 425, 431]
[2024-05-31 22:50:53] [INFO ] Actually due to overlaps returned [327, 321]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 12474 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 16 ms. Remains 430 /431 variables (removed 1) and now considering 438/439 (removed 1) transitions.
// Phase 1: matrix 438 rows 430 cols
[2024-05-31 22:50:53] [INFO ] Invariants computation overflowed in 24 ms
[2024-05-31 22:50:53] [INFO ] Implicit Places using invariants in 298 ms returned []
// Phase 1: matrix 438 rows 430 cols
[2024-05-31 22:50:53] [INFO ] Invariants computation overflowed in 23 ms
[2024-05-31 22:50:53] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 22:51:01] [INFO ] Implicit Places using invariants and state equation in 7463 ms returned [345, 350, 370, 376, 398, 403, 422, 428]
[2024-05-31 22:51:01] [INFO ] Actually due to overlaps returned [350, 345]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 7762 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 15 ms. Remains 427 /428 variables (removed 1) and now considering 437/438 (removed 1) transitions.
// Phase 1: matrix 437 rows 427 cols
[2024-05-31 22:51:01] [INFO ] Invariants computation overflowed in 24 ms
[2024-05-31 22:51:01] [INFO ] Implicit Places using invariants in 276 ms returned []
// Phase 1: matrix 437 rows 427 cols
[2024-05-31 22:51:01] [INFO ] Invariants computation overflowed in 23 ms
[2024-05-31 22:51:01] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 22:51:08] [INFO ] Implicit Places using invariants and state equation in 7117 ms returned [367, 373, 395, 400, 419, 425]
[2024-05-31 22:51:08] [INFO ] Actually due to overlaps returned [373, 367]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 7405 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 14 ms. Remains 424 /425 variables (removed 1) and now considering 436/437 (removed 1) transitions.
// Phase 1: matrix 436 rows 424 cols
[2024-05-31 22:51:08] [INFO ] Computed 65 invariants in 40 ms
[2024-05-31 22:51:09] [INFO ] Implicit Places using invariants in 495 ms returned [392, 397, 416, 422]
[2024-05-31 22:51:09] [INFO ] Actually due to overlaps returned [397, 392]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 506 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 14 ms. Remains 421 /422 variables (removed 1) and now considering 435/436 (removed 1) transitions.
// Phase 1: matrix 435 rows 421 cols
[2024-05-31 22:51:09] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-31 22:51:09] [INFO ] Implicit Places using invariants in 273 ms returned []
// Phase 1: matrix 435 rows 421 cols
[2024-05-31 22:51:09] [INFO ] Invariants computation overflowed in 23 ms
[2024-05-31 22:51:09] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 22:51:20] [INFO ] Implicit Places using invariants and state equation in 10700 ms returned [413, 419]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 10984 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-31 22:51:20] [INFO ] Computed 61 invariants in 47 ms
[2024-05-31 22:51:20] [INFO ] Implicit Places using invariants in 414 ms returned []
[2024-05-31 22:51:20] [INFO ] Invariant cache hit.
[2024-05-31 22:51:20] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 22:51:25] [INFO ] Implicit Places using invariants and state equation in 5120 ms returned []
Implicit Place search using SMT with State Equation took 5574 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 173328 ms. Remains : 418/475 places, 434/453 transitions.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 68 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Support contains 1 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 12 ms. Remains 553 /553 variables (removed 0) and now considering 531/531 (removed 0) transitions.
// Phase 1: matrix 531 rows 553 cols
[2024-05-31 22:51:25] [INFO ] Invariants computation overflowed in 27 ms
[2024-05-31 22:51:26] [INFO ] Implicit Places using invariants in 333 ms returned []
// Phase 1: matrix 531 rows 553 cols
[2024-05-31 22:51:26] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-31 22:51:26] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-31 22:51:54] [INFO ] Implicit Places using invariants and state equation in 28266 ms returned []
Implicit Place search using SMT with State Equation took 28601 ms to find 0 implicit places.
[2024-05-31 22:51:54] [INFO ] Redundant transitions in 4 ms returned []
Running 530 sub problems to find dead transitions.
// Phase 1: matrix 531 rows 553 cols
[2024-05-31 22:51:54] [INFO ] Invariants computation overflowed in 33 ms
[2024-05-31 22:51:54] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/552 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 1 (OVERLAPS) 531/1083 variables, 552/552 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1083 variables, 38/590 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1083 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 530 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1084/1084 variables, and 591 constraints, problems are : Problem set: 0 solved, 530 unsolved in 30018 ms.
Refiners :[State Equation: 553/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, 0/0 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 1 (OVERLAPS) 531/1083 variables, 552/552 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1083 variables, 38/590 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1083 variables, 527/1117 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 1117 constraints, problems are : Problem set: 0 solved, 530 unsolved in 30022 ms.
Refiners :[State Equation: 552/553 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 527/530 constraints, Known Traps: 0/0 constraints]
After SMT, in 60171ms problems are : Problem set: 0 solved, 530 unsolved
Search for dead transitions found 0 dead transitions in 60178ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 88812 ms. Remains : 553/553 places, 531/531 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1740 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 115 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 61 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (5585 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3290 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 384431 steps, run timeout after 3001 ms. (steps per millisecond=128 ) properties seen :0 out of 1
Probabilistic random walk after 384431 steps, saw 192269 distinct states, run finished after 3001 ms. (steps per millisecond=128 ) properties seen :0
// Phase 1: matrix 531 rows 553 cols
[2024-05-31 22:52:57] [INFO ] Invariants computation overflowed in 38 ms
[2024-05-31 22:52:57] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/31 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 75/106 variables, 33/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 94/200 variables, 48/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/200 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 97/297 variables, 49/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/297 variables, 4/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/297 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 108/405 variables, 54/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/405 variables, 4/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/405 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 110/515 variables, 56/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/515 variables, 4/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/515 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 110/625 variables, 56/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/625 variables, 4/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/625 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 110/735 variables, 56/382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/735 variables, 4/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/735 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 110/845 variables, 56/442 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/845 variables, 4/446 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/845 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 108/953 variables, 56/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/953 variables, 4/506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/953 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 83/1036 variables, 49/555 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1036 variables, 4/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1036 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 40/1076 variables, 24/583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1076 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 8/1084 variables, 8/591 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1084 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 0/1084 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1084/1084 variables, and 591 constraints, problems are : Problem set: 0 solved, 1 unsolved in 403 ms.
Refiners :[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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/31 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 75/106 variables, 33/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/106 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 94/200 variables, 48/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/200 variables, 3/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/200 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 97/297 variables, 49/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/297 variables, 4/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/297 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 108/405 variables, 54/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/405 variables, 4/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/405 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 110/515 variables, 56/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/515 variables, 4/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/515 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 110/625 variables, 56/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/625 variables, 4/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/625 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 110/735 variables, 56/383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/735 variables, 4/387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/735 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 110/845 variables, 56/443 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/845 variables, 4/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/845 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 108/953 variables, 56/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/953 variables, 4/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/953 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 83/1036 variables, 49/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1036 variables, 4/560 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1036 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 40/1076 variables, 24/584 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:52:58] [INFO ] Deduced a trap composed of 5 places in 128 ms of which 2 ms to minimize.
[2024-05-31 22:52:59] [INFO ] Deduced a trap composed of 44 places in 121 ms of which 2 ms to minimize.
At refinement iteration 37 (INCLUDED_ONLY) 0/1076 variables, 2/586 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1076 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 8/1084 variables, 8/594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1084 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 0/1084 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1084/1084 variables, and 594 constraints, problems are : Problem set: 0 solved, 1 unsolved in 897 ms.
Refiners :[State Equation: 553/553 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 1361ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2028 ms.
Support contains 1 out of 553 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 553/553 places, 531/531 transitions.
Graph (complete) has 1660 edges and 553 vertex of which 552 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 552 transition count 530
Free-agglomeration rule (complex) applied 77 times.
Iterating global reduction 1 with 77 rules applied. Total rules applied 79 place count 552 transition count 453
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 1 with 77 rules applied. Total rules applied 156 place count 475 transition count 453
Partial Free-agglomeration rule applied 80 times.
Drop transitions (Partial Free agglomeration) removed 80 transitions
Iterating global reduction 2 with 80 rules applied. Total rules applied 236 place count 475 transition count 453
Applied a total of 236 rules in 30 ms. Remains 475 /553 variables (removed 78) and now considering 453/531 (removed 78) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 475/553 places, 453/531 transitions.
RANDOM walk for 40000 steps (5087 resets) in 58 ms. (677 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (3346 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 426751 steps, run timeout after 3001 ms. (steps per millisecond=142 ) properties seen :0 out of 1
Probabilistic random walk after 426751 steps, saw 213502 distinct states, run finished after 3003 ms. (steps per millisecond=142 ) properties seen :0
// Phase 1: matrix 453 rows 475 cols
[2024-05-31 22:53:04] [INFO ] Invariants computation overflowed in 36 ms
[2024-05-31 22:53:04] [INFO ] State equation strengthened by 78 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 29/33 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 201/234 variables, 56/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 8/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 491/725 variables, 248/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/725 variables, 41/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/725 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 203/928 variables, 163/526 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/928 variables, 27/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/928 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/928 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 928/928 variables, and 553 constraints, problems are : Problem set: 0 solved, 1 unsolved in 485 ms.
Refiners :[State Equation: 475/475 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 29/33 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 201/234 variables, 56/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 8/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 491/725 variables, 248/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/725 variables, 41/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/725 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 203/928 variables, 163/527 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/928 variables, 27/554 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/928 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/928 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 928/928 variables, and 554 constraints, problems are : Problem set: 0 solved, 1 unsolved in 441 ms.
Refiners :[State Equation: 475/475 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 997ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2733 ms.
Support contains 1 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 9 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 9 ms. Remains 475 /475 variables (removed 0) and now considering 453/453 (removed 0) transitions.
// Phase 1: matrix 453 rows 475 cols
[2024-05-31 22:53:08] [INFO ] Invariants computation overflowed in 31 ms
[2024-05-31 22:53:08] [INFO ] Implicit Places using invariants in 476 ms returned []
// Phase 1: matrix 453 rows 475 cols
[2024-05-31 22:53:08] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-31 22:53:08] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 22:53:18] [INFO ] Implicit Places using invariants and state equation in 9528 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 146, 151, 152, 172, 177, 198, 204, 211, 227, 232, 255, 261, 283, 288, 308, 313, 334, 339, 360, 366, 387, 389, 393, 413, 419, 441, 446, 450, 467, 473]
[2024-05-31 22:53:18] [INFO ] Actually due to overlaps returned [211, 151]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 10015 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-31 22:53:18] [INFO ] Invariants computation overflowed in 35 ms
[2024-05-31 22:53:18] [INFO ] Implicit Places using invariants in 463 ms returned []
// Phase 1: matrix 452 rows 472 cols
[2024-05-31 22:53:18] [INFO ] Invariants computation overflowed in 33 ms
[2024-05-31 22:53:18] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 22:53:27] [INFO ] Implicit Places using invariants and state equation in 9346 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 146, 151, 171, 176, 197, 203, 224, 229, 252, 258, 280, 285, 305, 310, 331, 336, 357, 363, 384, 386, 390, 410, 416, 438, 443, 447, 464, 470]
[2024-05-31 22:53:27] [INFO ] Actually due to overlaps returned [447, 386]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 9825 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 21 ms. Remains 469 /470 variables (removed 1) and now considering 451/452 (removed 1) transitions.
// Phase 1: matrix 451 rows 469 cols
[2024-05-31 22:53:28] [INFO ] Invariants computation overflowed in 39 ms
[2024-05-31 22:53:28] [INFO ] Implicit Places using invariants in 453 ms returned []
// Phase 1: matrix 451 rows 469 cols
[2024-05-31 22:53:28] [INFO ] Invariants computation overflowed in 32 ms
[2024-05-31 22:53:28] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 22:53:39] [INFO ] Implicit Places using invariants and state equation in 10623 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 146, 151, 171, 176, 197, 203, 224, 229, 252, 258, 280, 285, 305, 310, 331, 336, 357, 363, 384, 389, 409, 415, 437, 442, 461, 467]
[2024-05-31 22:53:39] [INFO ] Actually due to overlaps returned [48, 42]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 11091 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-31 22:53:39] [INFO ] Invariants computation overflowed in 24 ms
[2024-05-31 22:53:39] [INFO ] Implicit Places using invariants in 432 ms returned []
// Phase 1: matrix 450 rows 466 cols
[2024-05-31 22:53:39] [INFO ] Invariants computation overflowed in 24 ms
[2024-05-31 22:53:39] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 22:53:53] [INFO ] Implicit Places using invariants and state equation in 14053 ms returned [65, 70, 91, 96, 116, 122, 143, 148, 168, 173, 194, 200, 221, 226, 249, 255, 277, 282, 302, 307, 328, 333, 354, 360, 381, 386, 406, 412, 434, 439, 458, 464]
[2024-05-31 22:53:53] [INFO ] Actually due to overlaps returned [70, 65]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 14494 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 17 ms. Remains 463 /464 variables (removed 1) and now considering 449/450 (removed 1) transitions.
// Phase 1: matrix 449 rows 463 cols
[2024-05-31 22:53:53] [INFO ] Computed 91 invariants in 57 ms
[2024-05-31 22:53:54] [INFO ] Implicit Places using invariants in 1078 ms returned [88, 93, 113, 119, 140, 145, 165, 170, 191, 197, 218, 223, 246, 252, 274, 279, 299, 304, 325, 330, 351, 357, 378, 383, 403, 409, 431, 436, 455, 461]
[2024-05-31 22:53:54] [INFO ] Actually due to overlaps returned [93, 88]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1092 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 16 ms. Remains 460 /461 variables (removed 1) and now considering 448/449 (removed 1) transitions.
// Phase 1: matrix 448 rows 460 cols
[2024-05-31 22:53:54] [INFO ] Invariants computation overflowed in 30 ms
[2024-05-31 22:53:55] [INFO ] Implicit Places using invariants in 409 ms returned []
// Phase 1: matrix 448 rows 460 cols
[2024-05-31 22:53:55] [INFO ] Invariants computation overflowed in 25 ms
[2024-05-31 22:53:55] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 22:54:05] [INFO ] Implicit Places using invariants and state equation in 10773 ms returned [110, 116, 137, 142, 162, 167, 188, 194, 215, 220, 243, 249, 271, 276, 296, 301, 322, 327, 348, 354, 375, 380, 400, 406, 428, 433, 452, 458]
[2024-05-31 22:54:05] [INFO ] Actually due to overlaps returned [116, 110]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 11194 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 21 ms. Remains 457 /458 variables (removed 1) and now considering 447/448 (removed 1) transitions.
// Phase 1: matrix 447 rows 457 cols
[2024-05-31 22:54:05] [INFO ] Invariants computation overflowed in 35 ms
[2024-05-31 22:54:06] [INFO ] Implicit Places using invariants in 385 ms returned []
// Phase 1: matrix 447 rows 457 cols
[2024-05-31 22:54:06] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-31 22:54:06] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 22:54:15] [INFO ] Implicit Places using invariants and state equation in 8823 ms returned [134, 139, 159, 164, 185, 191, 212, 217, 240, 246, 268, 273, 293, 298, 319, 324, 345, 351, 372, 377, 397, 403, 425, 430, 449, 455]
[2024-05-31 22:54:15] [INFO ] Actually due to overlaps returned [139, 134]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 9234 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 16 ms. Remains 454 /455 variables (removed 1) and now considering 446/447 (removed 1) transitions.
// Phase 1: matrix 446 rows 454 cols
[2024-05-31 22:54:15] [INFO ] Invariants computation overflowed in 38 ms
[2024-05-31 22:54:15] [INFO ] Implicit Places using invariants in 401 ms returned []
// Phase 1: matrix 446 rows 454 cols
[2024-05-31 22:54:15] [INFO ] Invariants computation overflowed in 34 ms
[2024-05-31 22:54:15] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 22:54:23] [INFO ] Implicit Places using invariants and state equation in 7797 ms returned [156, 161, 182, 188, 209, 214, 237, 243, 265, 270, 290, 295, 316, 321, 342, 348, 369, 374, 394, 400, 422, 427, 446, 452]
[2024-05-31 22:54:23] [INFO ] Actually due to overlaps returned [161, 156]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 8226 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-31 22:54:23] [INFO ] Invariants computation overflowed in 29 ms
[2024-05-31 22:54:23] [INFO ] Implicit Places using invariants in 355 ms returned []
// Phase 1: matrix 445 rows 451 cols
[2024-05-31 22:54:23] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-31 22:54:24] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 22:54:36] [INFO ] Implicit Places using invariants and state equation in 13012 ms returned [179, 185, 206, 211, 234, 240, 262, 267, 287, 292, 313, 318, 339, 345, 366, 371, 391, 397, 419, 424, 443, 449]
[2024-05-31 22:54:36] [INFO ] Actually due to overlaps returned [185, 179]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 13389 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 16 ms. Remains 448 /449 variables (removed 1) and now considering 444/445 (removed 1) transitions.
// Phase 1: matrix 444 rows 448 cols
[2024-05-31 22:54:36] [INFO ] Invariants computation overflowed in 25 ms
[2024-05-31 22:54:37] [INFO ] Implicit Places using invariants in 335 ms returned []
// Phase 1: matrix 444 rows 448 cols
[2024-05-31 22:54:37] [INFO ] Invariants computation overflowed in 25 ms
[2024-05-31 22:54:37] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 22:54:49] [INFO ] Implicit Places using invariants and state equation in 12707 ms returned [203, 208, 231, 237, 259, 264, 284, 289, 310, 315, 336, 342, 363, 368, 388, 394, 416, 421, 440, 446]
[2024-05-31 22:54:49] [INFO ] Actually due to overlaps returned [208, 203]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 13086 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 17 ms. Remains 445 /446 variables (removed 1) and now considering 443/444 (removed 1) transitions.
// Phase 1: matrix 443 rows 445 cols
[2024-05-31 22:54:49] [INFO ] Computed 79 invariants in 42 ms
[2024-05-31 22:54:50] [INFO ] Implicit Places using invariants in 669 ms returned [228, 234, 256, 261, 281, 286, 307, 312, 333, 339, 360, 365, 385, 391, 413, 418, 437, 443]
[2024-05-31 22:54:50] [INFO ] Actually due to overlaps returned [234, 228]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 690 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 15 ms. Remains 442 /443 variables (removed 1) and now considering 442/443 (removed 1) transitions.
// Phase 1: matrix 442 rows 442 cols
[2024-05-31 22:54:50] [INFO ] Invariants computation overflowed in 23 ms
[2024-05-31 22:54:50] [INFO ] Implicit Places using invariants in 312 ms returned []
// Phase 1: matrix 442 rows 442 cols
[2024-05-31 22:54:51] [INFO ] Invariants computation overflowed in 24 ms
[2024-05-31 22:54:51] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 22:54:59] [INFO ] Implicit Places using invariants and state equation in 8338 ms returned [253, 258, 278, 283, 304, 309, 330, 336, 357, 362, 382, 388, 410, 415, 434, 440]
[2024-05-31 22:54:59] [INFO ] Actually due to overlaps returned [258, 253]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 8698 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-31 22:54:59] [INFO ] Invariants computation overflowed in 29 ms
[2024-05-31 22:54:59] [INFO ] Implicit Places using invariants in 308 ms returned []
// Phase 1: matrix 441 rows 439 cols
[2024-05-31 22:54:59] [INFO ] Invariants computation overflowed in 23 ms
[2024-05-31 22:54:59] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 22:55:08] [INFO ] Implicit Places using invariants and state equation in 8820 ms returned [275, 280, 301, 306, 327, 333, 354, 359, 379, 385, 407, 412, 431, 437]
[2024-05-31 22:55:08] [INFO ] Actually due to overlaps returned [280, 275]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 9147 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 14 ms. Remains 436 /437 variables (removed 1) and now considering 440/441 (removed 1) transitions.
// Phase 1: matrix 440 rows 436 cols
[2024-05-31 22:55:08] [INFO ] Invariants computation overflowed in 23 ms
[2024-05-31 22:55:08] [INFO ] Implicit Places using invariants in 290 ms returned []
// Phase 1: matrix 440 rows 436 cols
[2024-05-31 22:55:08] [INFO ] Invariants computation overflowed in 22 ms
[2024-05-31 22:55:09] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 22:55:16] [INFO ] Implicit Places using invariants and state equation in 8018 ms returned [298, 303, 324, 330, 351, 356, 376, 382, 404, 409, 428, 434]
[2024-05-31 22:55:16] [INFO ] Actually due to overlaps returned [303, 298]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 8325 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 17 ms. Remains 433 /434 variables (removed 1) and now considering 439/440 (removed 1) transitions.
// Phase 1: matrix 439 rows 433 cols
[2024-05-31 22:55:16] [INFO ] Invariants computation overflowed in 24 ms
[2024-05-31 22:55:17] [INFO ] Implicit Places using invariants in 308 ms returned []
// Phase 1: matrix 439 rows 433 cols
[2024-05-31 22:55:17] [INFO ] Invariants computation overflowed in 35 ms
[2024-05-31 22:55:17] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 22:55:29] [INFO ] Implicit Places using invariants and state equation in 12111 ms returned [321, 327, 348, 353, 373, 379, 401, 406, 425, 431]
[2024-05-31 22:55:29] [INFO ] Actually due to overlaps returned [327, 321]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 12423 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 21 ms. Remains 430 /431 variables (removed 1) and now considering 438/439 (removed 1) transitions.
// Phase 1: matrix 438 rows 430 cols
[2024-05-31 22:55:29] [INFO ] Invariants computation overflowed in 27 ms
[2024-05-31 22:55:29] [INFO ] Implicit Places using invariants in 303 ms returned []
// Phase 1: matrix 438 rows 430 cols
[2024-05-31 22:55:29] [INFO ] Invariants computation overflowed in 30 ms
[2024-05-31 22:55:29] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 22:55:37] [INFO ] Implicit Places using invariants and state equation in 7788 ms returned [345, 350, 370, 376, 398, 403, 422, 428]
[2024-05-31 22:55:37] [INFO ] Actually due to overlaps returned [350, 345]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 8093 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 16 ms. Remains 427 /428 variables (removed 1) and now considering 437/438 (removed 1) transitions.
// Phase 1: matrix 437 rows 427 cols
[2024-05-31 22:55:37] [INFO ] Invariants computation overflowed in 26 ms
[2024-05-31 22:55:37] [INFO ] Implicit Places using invariants in 294 ms returned []
// Phase 1: matrix 437 rows 427 cols
[2024-05-31 22:55:37] [INFO ] Invariants computation overflowed in 31 ms
[2024-05-31 22:55:37] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 22:55:44] [INFO ] Implicit Places using invariants and state equation in 7111 ms returned [367, 373, 395, 400, 419, 425]
[2024-05-31 22:55:44] [INFO ] Actually due to overlaps returned [373, 367]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 7407 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 15 ms. Remains 424 /425 variables (removed 1) and now considering 436/437 (removed 1) transitions.
// Phase 1: matrix 436 rows 424 cols
[2024-05-31 22:55:44] [INFO ] Computed 65 invariants in 43 ms
[2024-05-31 22:55:45] [INFO ] Implicit Places using invariants in 428 ms returned [392, 397, 416, 422]
[2024-05-31 22:55:45] [INFO ] Actually due to overlaps returned [397, 392]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 429 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 16 ms. Remains 421 /422 variables (removed 1) and now considering 435/436 (removed 1) transitions.
// Phase 1: matrix 435 rows 421 cols
[2024-05-31 22:55:45] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-31 22:55:45] [INFO ] Implicit Places using invariants in 287 ms returned []
// Phase 1: matrix 435 rows 421 cols
[2024-05-31 22:55:45] [INFO ] Invariants computation overflowed in 22 ms
[2024-05-31 22:55:45] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 22:55:55] [INFO ] Implicit Places using invariants and state equation in 10410 ms returned [413, 419]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 10699 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 19 ms. Remains 418 /419 variables (removed 1) and now considering 434/435 (removed 1) transitions.
// Phase 1: matrix 434 rows 418 cols
[2024-05-31 22:55:56] [INFO ] Computed 61 invariants in 45 ms
[2024-05-31 22:55:56] [INFO ] Implicit Places using invariants in 411 ms returned []
[2024-05-31 22:55:56] [INFO ] Invariant cache hit.
[2024-05-31 22:55:56] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 22:56:01] [INFO ] Implicit Places using invariants and state equation in 4946 ms returned []
Implicit Place search using SMT with State Equation took 5360 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 173263 ms. Remains : 418/475 places, 434/453 transitions.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 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 92 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 13823 reset in 100 ms.
Product exploration explored 100000 steps with 13936 reset in 107 ms.
Support contains 1 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 20 ms. Remains 553 /553 variables (removed 0) and now considering 531/531 (removed 0) transitions.
// Phase 1: matrix 531 rows 553 cols
[2024-05-31 22:56:01] [INFO ] Invariants computation overflowed in 36 ms
[2024-05-31 22:56:02] [INFO ] Implicit Places using invariants in 258 ms returned []
// Phase 1: matrix 531 rows 553 cols
[2024-05-31 22:56:02] [INFO ] Invariants computation overflowed in 27 ms
[2024-05-31 22:56:02] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-31 22:56:31] [INFO ] Implicit Places using invariants and state equation in 29143 ms returned []
Implicit Place search using SMT with State Equation took 29405 ms to find 0 implicit places.
[2024-05-31 22:56:31] [INFO ] Redundant transitions in 5 ms returned []
Running 530 sub problems to find dead transitions.
// Phase 1: matrix 531 rows 553 cols
[2024-05-31 22:56:31] [INFO ] Invariants computation overflowed in 32 ms
[2024-05-31 22:56:31] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/552 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 1 (OVERLAPS) 531/1083 variables, 552/552 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1083 variables, 38/590 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1083 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 4 (OVERLAPS) 1/1084 variables, 1/591 constraints. Problems are: Problem set: 0 solved, 530 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1084/1084 variables, and 591 constraints, problems are : Problem set: 0 solved, 530 unsolved in 30029 ms.
Refiners :[State Equation: 553/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, 0/0 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 1 (OVERLAPS) 531/1083 variables, 552/552 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1083 variables, 38/590 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1083 variables, 527/1117 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 1117 constraints, problems are : Problem set: 0 solved, 530 unsolved in 30019 ms.
Refiners :[State Equation: 552/553 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 527/530 constraints, Known Traps: 0/0 constraints]
After SMT, in 60157ms problems are : Problem set: 0 solved, 530 unsolved
Search for dead transitions found 0 dead transitions in 60162ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 89602 ms. Remains : 553/553 places, 531/531 transitions.
Treatment of property DoubleExponent-PT-020-LTLCardinality-12 finished in 612214 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(p1)))))'
Support contains 6 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 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 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 239 rules applied. Total rules applied 477 place count 818 transition count 756
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 479 place count 816 transition count 756
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 42 Pre rules applied. Total rules applied 479 place count 816 transition count 714
Deduced a syphon composed of 42 places in 6 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 563 place count 774 transition count 714
Performed 178 Post agglomeration using F-continuation condition.Transition count delta: 178
Deduced a syphon composed of 178 places in 3 ms
Reduce places removed 178 places and 0 transitions.
Iterating global reduction 3 with 356 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
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 994 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 995 place count 558 transition count 535
Applied a total of 995 rules in 76 ms. Remains 558 /1057 variables (removed 499) and now considering 535/997 (removed 462) transitions.
// Phase 1: matrix 535 rows 558 cols
[2024-05-31 22:57:31] [INFO ] Computed 99 invariants in 52 ms
[2024-05-31 22:57:32] [INFO ] Implicit Places using invariants in 318 ms returned []
[2024-05-31 22:57:32] [INFO ] Invariant cache hit.
[2024-05-31 22:57:32] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-31 22:57:40] [INFO ] Implicit Places using invariants and state equation in 8531 ms returned []
Implicit Place search using SMT with State Equation took 8851 ms to find 0 implicit places.
[2024-05-31 22:57:40] [INFO ] Redundant transitions in 6 ms returned []
Running 534 sub problems to find dead transitions.
[2024-05-31 22:57:40] [INFO ] Invariant cache hit.
[2024-05-31 22:57:40] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/557 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/557 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/557 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 3 (OVERLAPS) 535/1092 variables, 557/656 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1092 variables, 38/694 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1092 variables, 0/694 constraints. Problems are: Problem set: 0 solved, 534 unsolved
SMT process timed out in 30093ms, After SMT, problems are : Problem set: 0 solved, 534 unsolved
Search for dead transitions found 0 dead transitions in 30099ms
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 39038 ms. Remains : 558/1057 places, 535/997 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DoubleExponent-PT-020-LTLCardinality-14
Product exploration explored 100000 steps with 13929 reset in 125 ms.
Product exploration explored 100000 steps with 13822 reset in 161 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1738 edges and 558 vertex of which 557 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 (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 101 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 90 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (5507 resets) in 324 ms. (123 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (3222 resets) in 476 ms. (83 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (3316 resets) in 340 ms. (117 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (3190 resets) in 449 ms. (88 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (3232 resets) in 278 ms. (143 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 183501 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :0 out of 4
Probabilistic random walk after 183501 steps, saw 91777 distinct states, run finished after 3001 ms. (steps per millisecond=61 ) properties seen :0
[2024-05-31 22:58:14] [INFO ] Invariant cache hit.
[2024-05-31 22:58:14] [INFO ] State equation strengthened by 38 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 271/277 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 211/488 variables, 52/90 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/488 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 14/502 variables, 5/95 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/502 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 525/1027 variables, 502/597 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1027 variables, 36/633 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1027 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 60/1087 variables, 51/684 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1087 variables, 2/686 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1087 variables, 1/687 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1087 variables, 0/687 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 2/1089 variables, 2/689 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1089 variables, 2/691 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1089 variables, 0/691 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 4/1093 variables, 3/694 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1093 variables, 1/695 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1093 variables, 0/695 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/1093 variables, 0/695 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1093/1093 variables, and 695 constraints, problems are : Problem set: 0 solved, 4 unsolved in 832 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 558/558 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 271/277 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 211/488 variables, 52/90 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/488 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 14/502 variables, 5/95 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 22:58:16] [INFO ] Deduced a trap composed of 6 places in 120 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/502 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/502 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 525/1027 variables, 502/598 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1027 variables, 36/634 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1027 variables, 4/638 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1027 variables, 0/638 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 60/1087 variables, 51/689 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1087 variables, 2/691 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1087 variables, 1/692 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 22:58:18] [INFO ] Deduced a trap composed of 14 places in 115 ms of which 2 ms to minimize.
[2024-05-31 22:58:19] [INFO ] Deduced a trap composed of 14 places in 115 ms of which 2 ms to minimize.
[2024-05-31 22:58:19] [INFO ] Deduced a trap composed of 44 places in 89 ms of which 2 ms to minimize.
[2024-05-31 22:58:19] [INFO ] Deduced a trap composed of 42 places in 97 ms of which 2 ms to minimize.
[2024-05-31 22:58:19] [INFO ] Deduced a trap composed of 47 places in 100 ms of which 2 ms to minimize.
[2024-05-31 22:58:19] [INFO ] Deduced a trap composed of 48 places in 110 ms of which 2 ms to minimize.
[2024-05-31 22:58:19] [INFO ] Deduced a trap composed of 51 places in 88 ms of which 2 ms to minimize.
[2024-05-31 22:58:20] [INFO ] Deduced a trap composed of 44 places in 89 ms of which 2 ms to minimize.
[2024-05-31 22:58:20] [INFO ] Deduced a trap composed of 36 places in 91 ms of which 1 ms to minimize.
[2024-05-31 22:58:20] [INFO ] Deduced a trap composed of 34 places in 87 ms of which 1 ms to minimize.
[2024-05-31 22:58:20] [INFO ] Deduced a trap composed of 46 places in 91 ms of which 2 ms to minimize.
[2024-05-31 22:58:20] [INFO ] Deduced a trap composed of 46 places in 98 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1087/1093 variables, and 704 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 95/97 constraints, State Equation: 553/558 constraints, ReadFeed: 37/38 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 13/13 constraints]
After SMT, in 5854ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 558 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 558/558 places, 535/535 transitions.
Graph (complete) has 1658 edges and 558 vertex of which 557 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 557 transition count 534
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 557 transition count 533
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 556 transition count 533
Free-agglomeration rule (complex) applied 78 times.
Iterating global reduction 2 with 78 rules applied. Total rules applied 82 place count 556 transition count 455
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 2 with 78 rules applied. Total rules applied 160 place count 478 transition count 455
Partial Free-agglomeration rule applied 75 times.
Drop transitions (Partial Free agglomeration) removed 75 transitions
Iterating global reduction 3 with 75 rules applied. Total rules applied 235 place count 478 transition count 455
Applied a total of 235 rules in 49 ms. Remains 478 /558 variables (removed 80) and now considering 455/535 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 478/558 places, 455/535 transitions.
RANDOM walk for 40000 steps (5032 resets) in 443 ms. (90 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (3388 resets) in 274 ms. (145 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (3367 resets) in 437 ms. (91 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (3357 resets) in 423 ms. (94 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (3372 resets) in 574 ms. (69 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 180075 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :0 out of 4
Probabilistic random walk after 180075 steps, saw 90048 distinct states, run finished after 3001 ms. (steps per millisecond=60 ) properties seen :0
// Phase 1: matrix 455 rows 478 cols
[2024-05-31 22:58:24] [INFO ] Computed 99 invariants in 42 ms
[2024-05-31 22:58:24] [INFO ] State equation strengthened by 73 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 261/267 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 53/320 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/320 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 149/469 variables, 54/95 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/469 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 4/473 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/473 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 455/928 variables, 473/570 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/928 variables, 73/643 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/928 variables, 0/643 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 5/933 variables, 5/648 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/933 variables, 2/650 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/933 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/933 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 933/933 variables, and 650 constraints, problems are : Problem set: 0 solved, 4 unsolved in 641 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 96/96 constraints, State Equation: 478/478 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 261/267 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 53/320 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/320 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 149/469 variables, 54/95 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 22:58:25] [INFO ] Deduced a trap composed of 4 places in 250 ms of which 3 ms to minimize.
[2024-05-31 22:58:25] [INFO ] Deduced a trap composed of 7 places in 245 ms of which 2 ms to minimize.
[2024-05-31 22:58:26] [INFO ] Deduced a trap composed of 7 places in 247 ms of which 3 ms to minimize.
[2024-05-31 22:58:26] [INFO ] Deduced a trap composed of 9 places in 241 ms of which 3 ms to minimize.
[2024-05-31 22:58:26] [INFO ] Deduced a trap composed of 4 places in 243 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/469 variables, 5/100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/469 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 4/473 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 22:58:27] [INFO ] Deduced a trap composed of 11 places in 250 ms of which 2 ms to minimize.
[2024-05-31 22:58:27] [INFO ] Deduced a trap composed of 12 places in 241 ms of which 3 ms to minimize.
[2024-05-31 22:58:27] [INFO ] Deduced a trap composed of 10 places in 243 ms of which 3 ms to minimize.
[2024-05-31 22:58:27] [INFO ] Deduced a trap composed of 13 places in 242 ms of which 3 ms to minimize.
[2024-05-31 22:58:28] [INFO ] Deduced a trap composed of 114 places in 242 ms of which 3 ms to minimize.
[2024-05-31 22:58:28] [INFO ] Deduced a trap composed of 16 places in 242 ms of which 3 ms to minimize.
[2024-05-31 22:58:28] [INFO ] Deduced a trap composed of 22 places in 234 ms of which 2 ms to minimize.
[2024-05-31 22:58:28] [INFO ] Deduced a trap composed of 21 places in 236 ms of which 3 ms to minimize.
[2024-05-31 22:58:29] [INFO ] Deduced a trap composed of 24 places in 234 ms of which 3 ms to minimize.
[2024-05-31 22:58:29] [INFO ] Deduced a trap composed of 27 places in 241 ms of which 3 ms to minimize.
[2024-05-31 22:58:29] [INFO ] Deduced a trap composed of 13 places in 237 ms of which 3 ms to minimize.
[2024-05-31 22:58:29] [INFO ] Deduced a trap composed of 16 places in 241 ms of which 3 ms to minimize.
[2024-05-31 22:58:30] [INFO ] Deduced a trap composed of 14 places in 234 ms of which 2 ms to minimize.
[2024-05-31 22:58:30] [INFO ] Deduced a trap composed of 20 places in 234 ms of which 3 ms to minimize.
[2024-05-31 22:58:30] [INFO ] Deduced a trap composed of 18 places in 229 ms of which 3 ms to minimize.
[2024-05-31 22:58:30] [INFO ] Deduced a trap composed of 124 places in 237 ms of which 3 ms to minimize.
[2024-05-31 22:58:31] [INFO ] Deduced a trap composed of 16 places in 236 ms of which 3 ms to minimize.
[2024-05-31 22:58:31] [INFO ] Deduced a trap composed of 28 places in 233 ms of which 3 ms to minimize.
[2024-05-31 22:58:31] [INFO ] Deduced a trap composed of 31 places in 241 ms of which 4 ms to minimize.
[2024-05-31 22:58:31] [INFO ] Deduced a trap composed of 126 places in 234 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/473 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 22:58:32] [INFO ] Deduced a trap composed of 29 places in 247 ms of which 3 ms to minimize.
[2024-05-31 22:58:32] [INFO ] Deduced a trap composed of 31 places in 240 ms of which 3 ms to minimize.
[2024-05-31 22:58:32] [INFO ] Deduced a trap composed of 137 places in 237 ms of which 3 ms to minimize.
[2024-05-31 22:58:32] [INFO ] Deduced a trap composed of 34 places in 236 ms of which 3 ms to minimize.
[2024-05-31 22:58:33] [INFO ] Deduced a trap composed of 37 places in 232 ms of which 3 ms to minimize.
[2024-05-31 22:58:33] [INFO ] Deduced a trap composed of 35 places in 236 ms of which 3 ms to minimize.
[2024-05-31 22:58:33] [INFO ] Deduced a trap composed of 37 places in 229 ms of which 2 ms to minimize.
[2024-05-31 22:58:33] [INFO ] Deduced a trap composed of 40 places in 228 ms of which 3 ms to minimize.
[2024-05-31 22:58:34] [INFO ] Deduced a trap composed of 48 places in 229 ms of which 3 ms to minimize.
[2024-05-31 22:58:34] [INFO ] Deduced a trap composed of 108 places in 230 ms of which 3 ms to minimize.
[2024-05-31 22:58:34] [INFO ] Deduced a trap composed of 15 places in 231 ms of which 3 ms to minimize.
[2024-05-31 22:58:34] [INFO ] Deduced a trap composed of 44 places in 233 ms of which 3 ms to minimize.
[2024-05-31 22:58:34] [INFO ] Deduced a trap composed of 112 places in 229 ms of which 3 ms to minimize.
[2024-05-31 22:58:35] [INFO ] Deduced a trap composed of 131 places in 230 ms of which 2 ms to minimize.
[2024-05-31 22:58:35] [INFO ] Deduced a trap composed of 9 places in 238 ms of which 3 ms to minimize.
[2024-05-31 22:58:35] [INFO ] Deduced a trap composed of 136 places in 221 ms of which 3 ms to minimize.
[2024-05-31 22:58:35] [INFO ] Deduced a trap composed of 30 places in 232 ms of which 3 ms to minimize.
[2024-05-31 22:58:36] [INFO ] Deduced a trap composed of 133 places in 235 ms of which 3 ms to minimize.
[2024-05-31 22:58:36] [INFO ] Deduced a trap composed of 124 places in 233 ms of which 3 ms to minimize.
[2024-05-31 22:58:36] [INFO ] Deduced a trap composed of 37 places in 228 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/473 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 22:58:36] [INFO ] Deduced a trap composed of 37 places in 227 ms of which 3 ms to minimize.
[2024-05-31 22:58:37] [INFO ] Deduced a trap composed of 125 places in 222 ms of which 2 ms to minimize.
[2024-05-31 22:58:37] [INFO ] Deduced a trap composed of 120 places in 227 ms of which 2 ms to minimize.
[2024-05-31 22:58:37] [INFO ] Deduced a trap composed of 140 places in 216 ms of which 3 ms to minimize.
[2024-05-31 22:58:37] [INFO ] Deduced a trap composed of 129 places in 232 ms of which 3 ms to minimize.
[2024-05-31 22:58:38] [INFO ] Deduced a trap composed of 120 places in 229 ms of which 2 ms to minimize.
[2024-05-31 22:58:38] [INFO ] Deduced a trap composed of 38 places in 123 ms of which 2 ms to minimize.
[2024-05-31 22:58:38] [INFO ] Deduced a trap composed of 41 places in 124 ms of which 2 ms to minimize.
[2024-05-31 22:58:38] [INFO ] Deduced a trap composed of 42 places in 115 ms of which 2 ms to minimize.
[2024-05-31 22:58:38] [INFO ] Deduced a trap composed of 136 places in 232 ms of which 3 ms to minimize.
[2024-05-31 22:58:39] [INFO ] Deduced a trap composed of 144 places in 229 ms of which 2 ms to minimize.
[2024-05-31 22:58:39] [INFO ] Deduced a trap composed of 33 places in 233 ms of which 3 ms to minimize.
[2024-05-31 22:58:39] [INFO ] Deduced a trap composed of 134 places in 230 ms of which 3 ms to minimize.
[2024-05-31 22:58:39] [INFO ] Deduced a trap composed of 135 places in 234 ms of which 2 ms to minimize.
[2024-05-31 22:58:40] [INFO ] Deduced a trap composed of 117 places in 234 ms of which 3 ms to minimize.
[2024-05-31 22:58:40] [INFO ] Deduced a trap composed of 130 places in 233 ms of which 3 ms to minimize.
[2024-05-31 22:58:40] [INFO ] Deduced a trap composed of 17 places in 240 ms of which 6 ms to minimize.
[2024-05-31 22:58:40] [INFO ] Deduced a trap composed of 124 places in 231 ms of which 3 ms to minimize.
[2024-05-31 22:58:41] [INFO ] Deduced a trap composed of 122 places in 236 ms of which 3 ms to minimize.
[2024-05-31 22:58:41] [INFO ] Deduced a trap composed of 121 places in 231 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/473 variables, 20/162 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 22:58:41] [INFO ] Deduced a trap composed of 141 places in 228 ms of which 3 ms to minimize.
[2024-05-31 22:58:41] [INFO ] Deduced a trap composed of 141 places in 229 ms of which 3 ms to minimize.
[2024-05-31 22:58:42] [INFO ] Deduced a trap composed of 137 places in 232 ms of which 3 ms to minimize.
[2024-05-31 22:58:42] [INFO ] Deduced a trap composed of 135 places in 231 ms of which 3 ms to minimize.
[2024-05-31 22:58:42] [INFO ] Deduced a trap composed of 136 places in 240 ms of which 3 ms to minimize.
[2024-05-31 22:58:42] [INFO ] Deduced a trap composed of 134 places in 232 ms of which 2 ms to minimize.
[2024-05-31 22:58:43] [INFO ] Deduced a trap composed of 136 places in 234 ms of which 3 ms to minimize.
[2024-05-31 22:58:43] [INFO ] Deduced a trap composed of 19 places in 230 ms of which 3 ms to minimize.
[2024-05-31 22:58:43] [INFO ] Deduced a trap composed of 90 places in 236 ms of which 3 ms to minimize.
[2024-05-31 22:58:43] [INFO ] Deduced a trap composed of 126 places in 233 ms of which 3 ms to minimize.
[2024-05-31 22:58:44] [INFO ] Deduced a trap composed of 130 places in 240 ms of which 2 ms to minimize.
[2024-05-31 22:58:44] [INFO ] Deduced a trap composed of 123 places in 237 ms of which 2 ms to minimize.
[2024-05-31 22:58:44] [INFO ] Deduced a trap composed of 130 places in 239 ms of which 3 ms to minimize.
[2024-05-31 22:58:44] [INFO ] Deduced a trap composed of 122 places in 231 ms of which 3 ms to minimize.
[2024-05-31 22:58:44] [INFO ] Deduced a trap composed of 121 places in 222 ms of which 3 ms to minimize.
[2024-05-31 22:58:45] [INFO ] Deduced a trap composed of 88 places in 226 ms of which 3 ms to minimize.
[2024-05-31 22:58:45] [INFO ] Deduced a trap composed of 119 places in 239 ms of which 2 ms to minimize.
[2024-05-31 22:58:45] [INFO ] Deduced a trap composed of 126 places in 226 ms of which 3 ms to minimize.
[2024-05-31 22:58:45] [INFO ] Deduced a trap composed of 121 places in 224 ms of which 2 ms to minimize.
[2024-05-31 22:58:46] [INFO ] Deduced a trap composed of 120 places in 223 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/473 variables, 20/182 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 22:58:46] [INFO ] Deduced a trap composed of 139 places in 240 ms of which 3 ms to minimize.
[2024-05-31 22:58:46] [INFO ] Deduced a trap composed of 123 places in 239 ms of which 3 ms to minimize.
[2024-05-31 22:58:47] [INFO ] Deduced a trap composed of 145 places in 248 ms of which 3 ms to minimize.
[2024-05-31 22:58:47] [INFO ] Deduced a trap composed of 135 places in 246 ms of which 2 ms to minimize.
[2024-05-31 22:58:47] [INFO ] Deduced a trap composed of 139 places in 266 ms of which 2 ms to minimize.
[2024-05-31 22:58:47] [INFO ] Deduced a trap composed of 135 places in 256 ms of which 3 ms to minimize.
[2024-05-31 22:58:48] [INFO ] Deduced a trap composed of 134 places in 254 ms of which 2 ms to minimize.
[2024-05-31 22:58:48] [INFO ] Deduced a trap composed of 145 places in 255 ms of which 2 ms to minimize.
[2024-05-31 22:58:48] [INFO ] Deduced a trap composed of 134 places in 246 ms of which 3 ms to minimize.
[2024-05-31 22:58:48] [INFO ] Deduced a trap composed of 129 places in 256 ms of which 3 ms to minimize.
[2024-05-31 22:58:49] [INFO ] Deduced a trap composed of 139 places in 240 ms of which 2 ms to minimize.
[2024-05-31 22:58:49] [INFO ] Deduced a trap composed of 137 places in 228 ms of which 3 ms to minimize.
[2024-05-31 22:58:49] [INFO ] Deduced a trap composed of 135 places in 253 ms of which 2 ms to minimize.
[2024-05-31 22:58:49] [INFO ] Deduced a trap composed of 135 places in 246 ms of which 3 ms to minimize.
[2024-05-31 22:58:50] [INFO ] Deduced a trap composed of 135 places in 243 ms of which 2 ms to minimize.
[2024-05-31 22:58:50] [INFO ] Deduced a trap composed of 142 places in 259 ms of which 3 ms to minimize.
[2024-05-31 22:58:50] [INFO ] Deduced a trap composed of 138 places in 243 ms of which 3 ms to minimize.
[2024-05-31 22:58:50] [INFO ] Deduced a trap composed of 125 places in 226 ms of which 3 ms to minimize.
[2024-05-31 22:58:51] [INFO ] Deduced a trap composed of 128 places in 247 ms of which 3 ms to minimize.
[2024-05-31 22:58:51] [INFO ] Deduced a trap composed of 141 places in 236 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/473 variables, 20/202 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 22:58:51] [INFO ] Deduced a trap composed of 148 places in 221 ms of which 2 ms to minimize.
[2024-05-31 22:58:51] [INFO ] Deduced a trap composed of 137 places in 241 ms of which 2 ms to minimize.
[2024-05-31 22:58:52] [INFO ] Deduced a trap composed of 125 places in 226 ms of which 3 ms to minimize.
[2024-05-31 22:58:52] [INFO ] Deduced a trap composed of 106 places in 243 ms of which 3 ms to minimize.
[2024-05-31 22:58:52] [INFO ] Deduced a trap composed of 23 places in 223 ms of which 3 ms to minimize.
[2024-05-31 22:58:52] [INFO ] Deduced a trap composed of 120 places in 220 ms of which 2 ms to minimize.
[2024-05-31 22:58:53] [INFO ] Deduced a trap composed of 160 places in 228 ms of which 3 ms to minimize.
[2024-05-31 22:58:53] [INFO ] Deduced a trap composed of 127 places in 248 ms of which 3 ms to minimize.
[2024-05-31 22:58:53] [INFO ] Deduced a trap composed of 130 places in 223 ms of which 3 ms to minimize.
[2024-05-31 22:58:53] [INFO ] Deduced a trap composed of 127 places in 224 ms of which 3 ms to minimize.
[2024-05-31 22:58:54] [INFO ] Deduced a trap composed of 144 places in 243 ms of which 3 ms to minimize.
[2024-05-31 22:58:54] [INFO ] Deduced a trap composed of 127 places in 236 ms of which 3 ms to minimize.
[2024-05-31 22:58:54] [INFO ] Deduced a trap composed of 119 places in 227 ms of which 3 ms to minimize.
[2024-05-31 22:58:54] [INFO ] Deduced a trap composed of 123 places in 223 ms of which 3 ms to minimize.
[2024-05-31 22:58:55] [INFO ] Deduced a trap composed of 122 places in 227 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/473 variables, 15/217 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/473 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 455/928 variables, 473/690 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/928 variables, 73/763 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/928 variables, 4/767 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 22:59:04] [INFO ] Deduced a trap composed of 47 places in 103 ms of which 1 ms to minimize.
[2024-05-31 22:59:05] [INFO ] Deduced a trap composed of 28 places in 112 ms of which 2 ms to minimize.
[2024-05-31 22:59:05] [INFO ] Deduced a trap composed of 32 places in 114 ms of which 2 ms to minimize.
[2024-05-31 22:59:05] [INFO ] Deduced a trap composed of 34 places in 111 ms of which 1 ms to minimize.
[2024-05-31 22:59:06] [INFO ] Deduced a trap composed of 41 places in 99 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/928 variables, 5/772 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/928 variables, 0/772 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SMT process timed out in 45711ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 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 14 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 15 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 10 ms. Remains 478 /478 variables (removed 0) and now considering 455/455 (removed 0) transitions.
[2024-05-31 22:59:10] [INFO ] Invariant cache hit.
[2024-05-31 22:59:11] [INFO ] Implicit Places using invariants in 1456 ms returned [42, 48, 69, 74, 95, 100, 120, 126, 147, 152, 153, 174, 179, 200, 206, 213, 227, 232, 255, 261, 283, 288, 309, 314, 336, 341, 362, 369, 390, 392, 396, 416, 422, 444, 449, 453, 470, 476]
[2024-05-31 22:59:11] [INFO ] Actually due to overlaps returned [213, 152]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1458 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 476/478 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 476 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 475 transition count 454
Applied a total of 2 rules in 20 ms. Remains 475 /476 variables (removed 1) and now considering 454/455 (removed 1) transitions.
// Phase 1: matrix 454 rows 475 cols
[2024-05-31 22:59:11] [INFO ] Invariants computation overflowed in 37 ms
[2024-05-31 22:59:12] [INFO ] Implicit Places using invariants in 481 ms returned []
// Phase 1: matrix 454 rows 475 cols
[2024-05-31 22:59:12] [INFO ] Invariants computation overflowed in 33 ms
[2024-05-31 22:59:12] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-31 22:59:28] [INFO ] Implicit Places using invariants and state equation in 16382 ms returned [42, 48, 69, 74, 95, 100, 120, 126, 147, 152, 173, 178, 199, 205, 224, 229, 252, 258, 280, 285, 306, 311, 333, 338, 359, 366, 387, 389, 393, 413, 419, 441, 446, 450, 467, 473]
[2024-05-31 22:59:28] [INFO ] Actually due to overlaps returned [450, 389]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 16866 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 473/478 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 473 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 472 transition count 453
Applied a total of 2 rules in 19 ms. Remains 472 /473 variables (removed 1) and now considering 453/454 (removed 1) transitions.
// Phase 1: matrix 453 rows 472 cols
[2024-05-31 22:59:28] [INFO ] Invariants computation overflowed in 34 ms
[2024-05-31 22:59:29] [INFO ] Implicit Places using invariants in 471 ms returned []
// Phase 1: matrix 453 rows 472 cols
[2024-05-31 22:59:29] [INFO ] Invariants computation overflowed in 42 ms
[2024-05-31 22:59:29] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-31 22:59:39] [INFO ] Implicit Places using invariants and state equation in 10323 ms returned [42, 48, 69, 74, 95, 100, 120, 126, 147, 152, 173, 178, 199, 205, 224, 229, 252, 258, 280, 285, 306, 311, 333, 338, 359, 366, 387, 392, 412, 418, 440, 445, 464, 470]
[2024-05-31 22:59:39] [INFO ] Actually due to overlaps returned [48, 42]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 10796 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 470/478 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 470 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 469 transition count 452
Applied a total of 2 rules in 25 ms. Remains 469 /470 variables (removed 1) and now considering 452/453 (removed 1) transitions.
// Phase 1: matrix 452 rows 469 cols
[2024-05-31 22:59:39] [INFO ] Invariants computation overflowed in 35 ms
[2024-05-31 22:59:39] [INFO ] Implicit Places using invariants in 460 ms returned []
// Phase 1: matrix 452 rows 469 cols
[2024-05-31 22:59:40] [INFO ] Invariants computation overflowed in 38 ms
[2024-05-31 22:59:40] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-31 22:59:48] [INFO ] Implicit Places using invariants and state equation in 8927 ms returned [66, 71, 92, 97, 117, 123, 144, 149, 170, 175, 196, 202, 221, 226, 249, 255, 277, 282, 303, 308, 330, 335, 356, 363, 384, 389, 409, 415, 437, 442, 461, 467]
[2024-05-31 22:59:48] [INFO ] Actually due to overlaps returned [71, 66]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 9389 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 467/478 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 467 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 466 transition count 451
Applied a total of 2 rules in 17 ms. Remains 466 /467 variables (removed 1) and now considering 451/452 (removed 1) transitions.
// Phase 1: matrix 451 rows 466 cols
[2024-05-31 22:59:48] [INFO ] Invariants computation overflowed in 50 ms
[2024-05-31 22:59:49] [INFO ] Implicit Places using invariants in 430 ms returned []
// Phase 1: matrix 451 rows 466 cols
[2024-05-31 22:59:49] [INFO ] Invariants computation overflowed in 53 ms
[2024-05-31 22:59:49] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-31 22:59:57] [INFO ] Implicit Places using invariants and state equation in 8556 ms returned [89, 94, 114, 120, 141, 146, 167, 172, 193, 199, 218, 223, 246, 252, 274, 279, 300, 305, 327, 332, 353, 360, 381, 386, 406, 412, 434, 439, 458, 464]
[2024-05-31 22:59:57] [INFO ] Actually due to overlaps returned [94, 89]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 8989 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 464/478 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 464 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 463 transition count 450
Applied a total of 2 rules in 16 ms. Remains 463 /464 variables (removed 1) and now considering 450/451 (removed 1) transitions.
// Phase 1: matrix 450 rows 463 cols
[2024-05-31 22:59:58] [INFO ] Invariants computation overflowed in 57 ms
[2024-05-31 22:59:58] [INFO ] Implicit Places using invariants in 413 ms returned []
// Phase 1: matrix 450 rows 463 cols
[2024-05-31 22:59:58] [INFO ] Invariants computation overflowed in 51 ms
[2024-05-31 22:59:58] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-31 23:00:08] [INFO ] Implicit Places using invariants and state equation in 10582 ms returned [111, 117, 138, 143, 164, 169, 190, 196, 215, 220, 243, 249, 271, 276, 297, 302, 324, 329, 350, 357, 378, 383, 403, 409, 431, 436, 455, 461]
[2024-05-31 23:00:08] [INFO ] Actually due to overlaps returned [117, 111]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 11019 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 461/478 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 461 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 460 transition count 449
Applied a total of 2 rules in 31 ms. Remains 460 /461 variables (removed 1) and now considering 449/450 (removed 1) transitions.
// Phase 1: matrix 449 rows 460 cols
[2024-05-31 23:00:09] [INFO ] Invariants computation overflowed in 39 ms
[2024-05-31 23:00:09] [INFO ] Implicit Places using invariants in 392 ms returned []
// Phase 1: matrix 449 rows 460 cols
[2024-05-31 23:00:09] [INFO ] Invariants computation overflowed in 32 ms
[2024-05-31 23:00:09] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-31 23:00:30] [INFO ] Implicit Places using invariants and state equation in 20962 ms returned [135, 140, 161, 166, 187, 193, 212, 217, 240, 246, 268, 273, 294, 299, 321, 326, 347, 354, 375, 380, 400, 406, 428, 433, 452, 458]
[2024-05-31 23:00:30] [INFO ] Actually due to overlaps returned [140, 135]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 21364 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 458/478 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 458 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 457 transition count 448
Applied a total of 2 rules in 24 ms. Remains 457 /458 variables (removed 1) and now considering 448/449 (removed 1) transitions.
// Phase 1: matrix 448 rows 457 cols
[2024-05-31 23:00:30] [INFO ] Invariants computation overflowed in 34 ms
[2024-05-31 23:00:30] [INFO ] Implicit Places using invariants in 368 ms returned []
// Phase 1: matrix 448 rows 457 cols
[2024-05-31 23:00:30] [INFO ] Invariants computation overflowed in 27 ms
[2024-05-31 23:00:31] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-31 23:00:40] [INFO ] Implicit Places using invariants and state equation in 9413 ms returned [158, 163, 184, 190, 209, 214, 237, 243, 265, 270, 291, 296, 318, 323, 344, 351, 372, 377, 397, 403, 425, 430, 449, 455]
[2024-05-31 23:00:40] [INFO ] Actually due to overlaps returned [163, 158]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 9783 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 455/478 places, 448/455 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 455 transition count 448
Applied a total of 1 rules in 17 ms. Remains 455 /455 variables (removed 0) and now considering 448/448 (removed 0) transitions.
// Phase 1: matrix 448 rows 455 cols
[2024-05-31 23:00:40] [INFO ] Invariants computation overflowed in 32 ms
[2024-05-31 23:00:40] [INFO ] Implicit Places using invariants in 370 ms returned []
// Phase 1: matrix 448 rows 455 cols
[2024-05-31 23:00:40] [INFO ] Invariants computation overflowed in 30 ms
[2024-05-31 23:00:40] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-31 23:00:53] [INFO ] Implicit Places using invariants and state equation in 13368 ms returned [182, 188, 207, 212, 235, 241, 263, 268, 289, 294, 316, 321, 342, 349, 370, 375, 395, 401, 423, 428, 447, 453]
[2024-05-31 23:00:53] [INFO ] Actually due to overlaps returned [188, 182]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 13751 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 453/478 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 453 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 452 transition count 447
Applied a total of 2 rules in 17 ms. Remains 452 /453 variables (removed 1) and now considering 447/448 (removed 1) transitions.
// Phase 1: matrix 447 rows 452 cols
[2024-05-31 23:00:53] [INFO ] Invariants computation overflowed in 29 ms
[2024-05-31 23:00:54] [INFO ] Implicit Places using invariants in 340 ms returned []
// Phase 1: matrix 447 rows 452 cols
[2024-05-31 23:00:54] [INFO ] Invariants computation overflowed in 31 ms
[2024-05-31 23:00:54] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-31 23:01:07] [INFO ] Implicit Places using invariants and state equation in 12785 ms returned [204, 209, 232, 238, 260, 265, 286, 291, 313, 318, 339, 346, 367, 372, 392, 398, 420, 425, 444, 450]
[2024-05-31 23:01:07] [INFO ] Actually due to overlaps returned [209, 204]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 13142 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 10 : 450/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 450 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 449 transition count 446
Applied a total of 2 rules in 21 ms. Remains 449 /450 variables (removed 1) and now considering 446/447 (removed 1) transitions.
// Phase 1: matrix 446 rows 449 cols
[2024-05-31 23:01:07] [INFO ] Invariants computation overflowed in 41 ms
[2024-05-31 23:01:07] [INFO ] Implicit Places using invariants in 362 ms returned []
// Phase 1: matrix 446 rows 449 cols
[2024-05-31 23:01:07] [INFO ] Invariants computation overflowed in 36 ms
[2024-05-31 23:01:07] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-31 23:01:16] [INFO ] Implicit Places using invariants and state equation in 9244 ms returned [229, 235, 257, 262, 283, 288, 310, 315, 336, 343, 364, 369, 389, 395, 417, 422, 441, 447]
[2024-05-31 23:01:16] [INFO ] Actually due to overlaps returned [235, 229]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 9606 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 11 : 447/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 447 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 446 transition count 445
Applied a total of 2 rules in 18 ms. Remains 446 /447 variables (removed 1) and now considering 445/446 (removed 1) transitions.
// Phase 1: matrix 445 rows 446 cols
[2024-05-31 23:01:16] [INFO ] Invariants computation overflowed in 47 ms
[2024-05-31 23:01:17] [INFO ] Implicit Places using invariants in 354 ms returned []
// Phase 1: matrix 445 rows 446 cols
[2024-05-31 23:01:17] [INFO ] Invariants computation overflowed in 45 ms
[2024-05-31 23:01:17] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-31 23:01:24] [INFO ] Implicit Places using invariants and state equation in 7198 ms returned [254, 259, 280, 285, 307, 312, 333, 340, 361, 366, 386, 392, 414, 419, 438, 444]
[2024-05-31 23:01:24] [INFO ] Actually due to overlaps returned [259, 254]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 7556 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 12 : 444/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 444 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 443 transition count 444
Applied a total of 2 rules in 16 ms. Remains 443 /444 variables (removed 1) and now considering 444/445 (removed 1) transitions.
// Phase 1: matrix 444 rows 443 cols
[2024-05-31 23:01:24] [INFO ] Invariants computation overflowed in 42 ms
[2024-05-31 23:01:24] [INFO ] Implicit Places using invariants in 331 ms returned []
// Phase 1: matrix 444 rows 443 cols
[2024-05-31 23:01:24] [INFO ] Invariants computation overflowed in 50 ms
[2024-05-31 23:01:24] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-31 23:01:33] [INFO ] Implicit Places using invariants and state equation in 8792 ms returned [277, 282, 304, 309, 330, 337, 358, 363, 383, 389, 411, 416, 435, 441]
[2024-05-31 23:01:33] [INFO ] Actually due to overlaps returned [282, 277]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 9130 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 13 : 441/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 441 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 440 transition count 443
Applied a total of 2 rules in 17 ms. Remains 440 /441 variables (removed 1) and now considering 443/444 (removed 1) transitions.
// Phase 1: matrix 443 rows 440 cols
[2024-05-31 23:01:33] [INFO ] Invariants computation overflowed in 35 ms
[2024-05-31 23:01:33] [INFO ] Implicit Places using invariants in 323 ms returned []
// Phase 1: matrix 443 rows 440 cols
[2024-05-31 23:01:33] [INFO ] Invariants computation overflowed in 39 ms
[2024-05-31 23:01:34] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-31 23:01:41] [INFO ] Implicit Places using invariants and state equation in 7598 ms returned [301, 306, 327, 334, 355, 360, 380, 386, 408, 413, 432, 438]
[2024-05-31 23:01:41] [INFO ] Actually due to overlaps returned [306, 301]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 7928 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 14 : 438/478 places, 443/455 transitions.
Applied a total of 0 rules in 8 ms. Remains 438 /438 variables (removed 0) and now considering 443/443 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 15 iterations and 151061 ms. Remains : 438/478 places, 443/455 transitions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 114 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 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 6 out of 558 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 558/558 places, 535/535 transitions.
Applied a total of 0 rules in 18 ms. Remains 558 /558 variables (removed 0) and now considering 535/535 (removed 0) transitions.
// Phase 1: matrix 535 rows 558 cols
[2024-05-31 23:01:41] [INFO ] Computed 99 invariants in 51 ms
[2024-05-31 23:01:42] [INFO ] Implicit Places using invariants in 316 ms returned []
[2024-05-31 23:01:42] [INFO ] Invariant cache hit.
[2024-05-31 23:01:42] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-31 23:01:50] [INFO ] Implicit Places using invariants and state equation in 8130 ms returned []
Implicit Place search using SMT with State Equation took 8448 ms to find 0 implicit places.
[2024-05-31 23:01:50] [INFO ] Redundant transitions in 2 ms returned []
Running 534 sub problems to find dead transitions.
[2024-05-31 23:01:50] [INFO ] Invariant cache hit.
[2024-05-31 23:01:50] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/557 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/557 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/557 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 3 (OVERLAPS) 535/1092 variables, 557/656 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1092 variables, 38/694 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1092 variables, 0/694 constraints. Problems are: Problem set: 0 solved, 534 unsolved
SMT process timed out in 30111ms, After SMT, problems are : Problem set: 0 solved, 534 unsolved
Search for dead transitions found 0 dead transitions in 30118ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38605 ms. Remains : 558/558 places, 535/535 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1738 edges and 558 vertex of which 557 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)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 138 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 90 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (5568 resets) in 242 ms. (164 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (3174 resets) in 185 ms. (215 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (3271 resets) in 174 ms. (228 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (3221 resets) in 197 ms. (202 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (3225 resets) in 246 ms. (161 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 203862 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :0 out of 4
Probabilistic random walk after 203862 steps, saw 101958 distinct states, run finished after 3001 ms. (steps per millisecond=67 ) properties seen :0
[2024-05-31 23:02:24] [INFO ] Invariant cache hit.
[2024-05-31 23:02:24] [INFO ] State equation strengthened by 38 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 271/277 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 211/488 variables, 52/90 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/488 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 14/502 variables, 5/95 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/502 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 525/1027 variables, 502/597 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1027 variables, 36/633 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1027 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 60/1087 variables, 51/684 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1087 variables, 2/686 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1087 variables, 1/687 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1087 variables, 0/687 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 2/1089 variables, 2/689 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1089 variables, 2/691 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1089 variables, 0/691 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 4/1093 variables, 3/694 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1093 variables, 1/695 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1093 variables, 0/695 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/1093 variables, 0/695 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1093/1093 variables, and 695 constraints, problems are : Problem set: 0 solved, 4 unsolved in 816 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 558/558 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 271/277 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 211/488 variables, 52/90 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/488 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 14/502 variables, 5/95 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 23:02:25] [INFO ] Deduced a trap composed of 6 places in 114 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/502 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/502 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 525/1027 variables, 502/598 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1027 variables, 36/634 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1027 variables, 4/638 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1027 variables, 0/638 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 60/1087 variables, 51/689 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1087 variables, 2/691 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1087 variables, 1/692 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 23:02:28] [INFO ] Deduced a trap composed of 34 places in 119 ms of which 2 ms to minimize.
[2024-05-31 23:02:28] [INFO ] Deduced a trap composed of 46 places in 122 ms of which 2 ms to minimize.
[2024-05-31 23:02:28] [INFO ] Deduced a trap composed of 47 places in 116 ms of which 2 ms to minimize.
[2024-05-31 23:02:28] [INFO ] Deduced a trap composed of 50 places in 118 ms of which 2 ms to minimize.
[2024-05-31 23:02:28] [INFO ] Deduced a trap composed of 46 places in 114 ms of which 2 ms to minimize.
[2024-05-31 23:02:28] [INFO ] Deduced a trap composed of 46 places in 112 ms of which 3 ms to minimize.
[2024-05-31 23:02:29] [INFO ] Deduced a trap composed of 30 places in 117 ms of which 2 ms to minimize.
[2024-05-31 23:02:29] [INFO ] Deduced a trap composed of 36 places in 116 ms of which 2 ms to minimize.
[2024-05-31 23:02:29] [INFO ] Deduced a trap composed of 42 places in 99 ms of which 2 ms to minimize.
[2024-05-31 23:02:29] [INFO ] Deduced a trap composed of 51 places in 100 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1087/1093 variables, and 702 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 95/97 constraints, State Equation: 553/558 constraints, ReadFeed: 37/38 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 11/11 constraints]
After SMT, in 5843ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 558 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 558/558 places, 535/535 transitions.
Graph (complete) has 1658 edges and 558 vertex of which 557 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 557 transition count 534
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 557 transition count 533
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 556 transition count 533
Free-agglomeration rule (complex) applied 78 times.
Iterating global reduction 2 with 78 rules applied. Total rules applied 82 place count 556 transition count 455
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 2 with 78 rules applied. Total rules applied 160 place count 478 transition count 455
Partial Free-agglomeration rule applied 75 times.
Drop transitions (Partial Free agglomeration) removed 75 transitions
Iterating global reduction 3 with 75 rules applied. Total rules applied 235 place count 478 transition count 455
Applied a total of 235 rules in 48 ms. Remains 478 /558 variables (removed 80) and now considering 455/535 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 478/558 places, 455/535 transitions.
RANDOM walk for 40000 steps (5116 resets) in 458 ms. (87 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (3370 resets) in 434 ms. (91 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (3391 resets) in 415 ms. (96 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (3409 resets) in 554 ms. (72 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (3362 resets) in 317 ms. (125 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 182386 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :0 out of 4
Probabilistic random walk after 182386 steps, saw 91214 distinct states, run finished after 3001 ms. (steps per millisecond=60 ) properties seen :0
// Phase 1: matrix 455 rows 478 cols
[2024-05-31 23:02:33] [INFO ] Computed 99 invariants in 50 ms
[2024-05-31 23:02:33] [INFO ] State equation strengthened by 73 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 261/267 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 53/320 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/320 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 149/469 variables, 54/95 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/469 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 4/473 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/473 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 455/928 variables, 473/570 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/928 variables, 73/643 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/928 variables, 0/643 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 5/933 variables, 5/648 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/933 variables, 2/650 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/933 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/933 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 933/933 variables, and 650 constraints, problems are : Problem set: 0 solved, 4 unsolved in 624 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 96/96 constraints, State Equation: 478/478 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 261/267 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 53/320 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/320 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 149/469 variables, 54/95 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 23:02:34] [INFO ] Deduced a trap composed of 4 places in 227 ms of which 3 ms to minimize.
[2024-05-31 23:02:34] [INFO ] Deduced a trap composed of 7 places in 224 ms of which 3 ms to minimize.
[2024-05-31 23:02:35] [INFO ] Deduced a trap composed of 7 places in 223 ms of which 3 ms to minimize.
[2024-05-31 23:02:35] [INFO ] Deduced a trap composed of 9 places in 244 ms of which 3 ms to minimize.
[2024-05-31 23:02:35] [INFO ] Deduced a trap composed of 4 places in 229 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/469 variables, 5/100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/469 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 4/473 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 23:02:35] [INFO ] Deduced a trap composed of 11 places in 245 ms of which 3 ms to minimize.
[2024-05-31 23:02:36] [INFO ] Deduced a trap composed of 12 places in 238 ms of which 3 ms to minimize.
[2024-05-31 23:02:36] [INFO ] Deduced a trap composed of 10 places in 241 ms of which 2 ms to minimize.
[2024-05-31 23:02:36] [INFO ] Deduced a trap composed of 13 places in 226 ms of which 2 ms to minimize.
[2024-05-31 23:02:36] [INFO ] Deduced a trap composed of 114 places in 217 ms of which 2 ms to minimize.
[2024-05-31 23:02:37] [INFO ] Deduced a trap composed of 16 places in 244 ms of which 3 ms to minimize.
[2024-05-31 23:02:37] [INFO ] Deduced a trap composed of 22 places in 241 ms of which 7 ms to minimize.
[2024-05-31 23:02:37] [INFO ] Deduced a trap composed of 21 places in 219 ms of which 2 ms to minimize.
[2024-05-31 23:02:37] [INFO ] Deduced a trap composed of 24 places in 238 ms of which 2 ms to minimize.
[2024-05-31 23:02:38] [INFO ] Deduced a trap composed of 27 places in 237 ms of which 3 ms to minimize.
[2024-05-31 23:02:38] [INFO ] Deduced a trap composed of 13 places in 232 ms of which 3 ms to minimize.
[2024-05-31 23:02:38] [INFO ] Deduced a trap composed of 16 places in 223 ms of which 3 ms to minimize.
[2024-05-31 23:02:38] [INFO ] Deduced a trap composed of 14 places in 237 ms of which 3 ms to minimize.
[2024-05-31 23:02:39] [INFO ] Deduced a trap composed of 20 places in 235 ms of which 3 ms to minimize.
[2024-05-31 23:02:39] [INFO ] Deduced a trap composed of 18 places in 233 ms of which 3 ms to minimize.
[2024-05-31 23:02:39] [INFO ] Deduced a trap composed of 124 places in 245 ms of which 2 ms to minimize.
[2024-05-31 23:02:39] [INFO ] Deduced a trap composed of 16 places in 238 ms of which 2 ms to minimize.
[2024-05-31 23:02:40] [INFO ] Deduced a trap composed of 28 places in 231 ms of which 2 ms to minimize.
[2024-05-31 23:02:40] [INFO ] Deduced a trap composed of 31 places in 232 ms of which 3 ms to minimize.
[2024-05-31 23:02:40] [INFO ] Deduced a trap composed of 126 places in 223 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/473 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 23:02:40] [INFO ] Deduced a trap composed of 29 places in 213 ms of which 3 ms to minimize.
[2024-05-31 23:02:41] [INFO ] Deduced a trap composed of 31 places in 212 ms of which 2 ms to minimize.
[2024-05-31 23:02:41] [INFO ] Deduced a trap composed of 137 places in 226 ms of which 3 ms to minimize.
[2024-05-31 23:02:41] [INFO ] Deduced a trap composed of 34 places in 224 ms of which 3 ms to minimize.
[2024-05-31 23:02:41] [INFO ] Deduced a trap composed of 37 places in 222 ms of which 3 ms to minimize.
[2024-05-31 23:02:42] [INFO ] Deduced a trap composed of 35 places in 222 ms of which 2 ms to minimize.
[2024-05-31 23:02:42] [INFO ] Deduced a trap composed of 37 places in 209 ms of which 3 ms to minimize.
[2024-05-31 23:02:42] [INFO ] Deduced a trap composed of 40 places in 231 ms of which 3 ms to minimize.
[2024-05-31 23:02:42] [INFO ] Deduced a trap composed of 48 places in 228 ms of which 3 ms to minimize.
[2024-05-31 23:02:42] [INFO ] Deduced a trap composed of 108 places in 225 ms of which 3 ms to minimize.
[2024-05-31 23:02:43] [INFO ] Deduced a trap composed of 15 places in 225 ms of which 3 ms to minimize.
[2024-05-31 23:02:43] [INFO ] Deduced a trap composed of 44 places in 217 ms of which 3 ms to minimize.
[2024-05-31 23:02:43] [INFO ] Deduced a trap composed of 112 places in 228 ms of which 2 ms to minimize.
[2024-05-31 23:02:43] [INFO ] Deduced a trap composed of 131 places in 224 ms of which 3 ms to minimize.
[2024-05-31 23:02:44] [INFO ] Deduced a trap composed of 9 places in 228 ms of which 3 ms to minimize.
[2024-05-31 23:02:44] [INFO ] Deduced a trap composed of 136 places in 229 ms of which 3 ms to minimize.
[2024-05-31 23:02:44] [INFO ] Deduced a trap composed of 30 places in 226 ms of which 3 ms to minimize.
[2024-05-31 23:02:44] [INFO ] Deduced a trap composed of 133 places in 223 ms of which 2 ms to minimize.
[2024-05-31 23:02:45] [INFO ] Deduced a trap composed of 124 places in 226 ms of which 2 ms to minimize.
[2024-05-31 23:02:45] [INFO ] Deduced a trap composed of 37 places in 229 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/473 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 23:02:45] [INFO ] Deduced a trap composed of 37 places in 225 ms of which 3 ms to minimize.
[2024-05-31 23:02:45] [INFO ] Deduced a trap composed of 125 places in 228 ms of which 3 ms to minimize.
[2024-05-31 23:02:46] [INFO ] Deduced a trap composed of 120 places in 224 ms of which 2 ms to minimize.
[2024-05-31 23:02:46] [INFO ] Deduced a trap composed of 140 places in 225 ms of which 3 ms to minimize.
[2024-05-31 23:02:46] [INFO ] Deduced a trap composed of 129 places in 232 ms of which 2 ms to minimize.
[2024-05-31 23:02:46] [INFO ] Deduced a trap composed of 120 places in 224 ms of which 3 ms to minimize.
[2024-05-31 23:02:46] [INFO ] Deduced a trap composed of 38 places in 120 ms of which 1 ms to minimize.
[2024-05-31 23:02:47] [INFO ] Deduced a trap composed of 41 places in 113 ms of which 1 ms to minimize.
[2024-05-31 23:02:47] [INFO ] Deduced a trap composed of 42 places in 115 ms of which 2 ms to minimize.
[2024-05-31 23:02:47] [INFO ] Deduced a trap composed of 136 places in 231 ms of which 2 ms to minimize.
[2024-05-31 23:02:47] [INFO ] Deduced a trap composed of 144 places in 238 ms of which 3 ms to minimize.
[2024-05-31 23:02:47] [INFO ] Deduced a trap composed of 33 places in 224 ms of which 3 ms to minimize.
[2024-05-31 23:02:48] [INFO ] Deduced a trap composed of 134 places in 217 ms of which 3 ms to minimize.
[2024-05-31 23:02:48] [INFO ] Deduced a trap composed of 135 places in 227 ms of which 3 ms to minimize.
[2024-05-31 23:02:48] [INFO ] Deduced a trap composed of 117 places in 234 ms of which 2 ms to minimize.
[2024-05-31 23:02:48] [INFO ] Deduced a trap composed of 130 places in 228 ms of which 2 ms to minimize.
[2024-05-31 23:02:49] [INFO ] Deduced a trap composed of 17 places in 231 ms of which 3 ms to minimize.
[2024-05-31 23:02:49] [INFO ] Deduced a trap composed of 124 places in 235 ms of which 3 ms to minimize.
[2024-05-31 23:02:49] [INFO ] Deduced a trap composed of 122 places in 234 ms of which 2 ms to minimize.
[2024-05-31 23:02:49] [INFO ] Deduced a trap composed of 121 places in 233 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/473 variables, 20/162 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 23:02:50] [INFO ] Deduced a trap composed of 141 places in 230 ms of which 3 ms to minimize.
[2024-05-31 23:02:50] [INFO ] Deduced a trap composed of 141 places in 231 ms of which 2 ms to minimize.
[2024-05-31 23:02:50] [INFO ] Deduced a trap composed of 137 places in 230 ms of which 3 ms to minimize.
[2024-05-31 23:02:50] [INFO ] Deduced a trap composed of 135 places in 228 ms of which 2 ms to minimize.
[2024-05-31 23:02:51] [INFO ] Deduced a trap composed of 136 places in 233 ms of which 3 ms to minimize.
[2024-05-31 23:02:51] [INFO ] Deduced a trap composed of 134 places in 234 ms of which 2 ms to minimize.
[2024-05-31 23:02:51] [INFO ] Deduced a trap composed of 136 places in 235 ms of which 3 ms to minimize.
[2024-05-31 23:02:51] [INFO ] Deduced a trap composed of 19 places in 222 ms of which 3 ms to minimize.
[2024-05-31 23:02:52] [INFO ] Deduced a trap composed of 90 places in 216 ms of which 3 ms to minimize.
[2024-05-31 23:02:52] [INFO ] Deduced a trap composed of 126 places in 215 ms of which 2 ms to minimize.
[2024-05-31 23:02:52] [INFO ] Deduced a trap composed of 130 places in 218 ms of which 3 ms to minimize.
[2024-05-31 23:02:52] [INFO ] Deduced a trap composed of 123 places in 230 ms of which 2 ms to minimize.
[2024-05-31 23:02:52] [INFO ] Deduced a trap composed of 130 places in 228 ms of which 2 ms to minimize.
[2024-05-31 23:02:53] [INFO ] Deduced a trap composed of 122 places in 229 ms of which 2 ms to minimize.
[2024-05-31 23:02:53] [INFO ] Deduced a trap composed of 121 places in 240 ms of which 3 ms to minimize.
[2024-05-31 23:02:53] [INFO ] Deduced a trap composed of 88 places in 228 ms of which 2 ms to minimize.
[2024-05-31 23:02:53] [INFO ] Deduced a trap composed of 119 places in 232 ms of which 3 ms to minimize.
[2024-05-31 23:02:54] [INFO ] Deduced a trap composed of 126 places in 227 ms of which 3 ms to minimize.
[2024-05-31 23:02:54] [INFO ] Deduced a trap composed of 121 places in 253 ms of which 3 ms to minimize.
[2024-05-31 23:02:54] [INFO ] Deduced a trap composed of 120 places in 224 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/473 variables, 20/182 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 23:02:54] [INFO ] Deduced a trap composed of 139 places in 249 ms of which 2 ms to minimize.
[2024-05-31 23:02:55] [INFO ] Deduced a trap composed of 123 places in 244 ms of which 3 ms to minimize.
[2024-05-31 23:02:55] [INFO ] Deduced a trap composed of 145 places in 249 ms of which 3 ms to minimize.
[2024-05-31 23:02:55] [INFO ] Deduced a trap composed of 135 places in 241 ms of which 4 ms to minimize.
[2024-05-31 23:02:56] [INFO ] Deduced a trap composed of 139 places in 244 ms of which 3 ms to minimize.
[2024-05-31 23:02:56] [INFO ] Deduced a trap composed of 135 places in 246 ms of which 3 ms to minimize.
[2024-05-31 23:02:56] [INFO ] Deduced a trap composed of 134 places in 244 ms of which 3 ms to minimize.
[2024-05-31 23:02:56] [INFO ] Deduced a trap composed of 145 places in 239 ms of which 3 ms to minimize.
[2024-05-31 23:02:57] [INFO ] Deduced a trap composed of 134 places in 244 ms of which 3 ms to minimize.
[2024-05-31 23:02:57] [INFO ] Deduced a trap composed of 129 places in 248 ms of which 3 ms to minimize.
[2024-05-31 23:02:57] [INFO ] Deduced a trap composed of 139 places in 247 ms of which 3 ms to minimize.
[2024-05-31 23:02:57] [INFO ] Deduced a trap composed of 137 places in 242 ms of which 3 ms to minimize.
[2024-05-31 23:02:58] [INFO ] Deduced a trap composed of 135 places in 243 ms of which 3 ms to minimize.
[2024-05-31 23:02:58] [INFO ] Deduced a trap composed of 135 places in 253 ms of which 3 ms to minimize.
[2024-05-31 23:02:58] [INFO ] Deduced a trap composed of 135 places in 251 ms of which 3 ms to minimize.
[2024-05-31 23:02:58] [INFO ] Deduced a trap composed of 142 places in 242 ms of which 2 ms to minimize.
[2024-05-31 23:02:59] [INFO ] Deduced a trap composed of 138 places in 245 ms of which 3 ms to minimize.
[2024-05-31 23:02:59] [INFO ] Deduced a trap composed of 125 places in 241 ms of which 3 ms to minimize.
[2024-05-31 23:02:59] [INFO ] Deduced a trap composed of 128 places in 249 ms of which 3 ms to minimize.
[2024-05-31 23:02:59] [INFO ] Deduced a trap composed of 141 places in 240 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/473 variables, 20/202 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 23:03:00] [INFO ] Deduced a trap composed of 148 places in 236 ms of which 3 ms to minimize.
[2024-05-31 23:03:00] [INFO ] Deduced a trap composed of 137 places in 232 ms of which 3 ms to minimize.
[2024-05-31 23:03:00] [INFO ] Deduced a trap composed of 125 places in 242 ms of which 3 ms to minimize.
[2024-05-31 23:03:00] [INFO ] Deduced a trap composed of 106 places in 227 ms of which 2 ms to minimize.
[2024-05-31 23:03:01] [INFO ] Deduced a trap composed of 23 places in 236 ms of which 2 ms to minimize.
[2024-05-31 23:03:01] [INFO ] Deduced a trap composed of 120 places in 233 ms of which 3 ms to minimize.
[2024-05-31 23:03:01] [INFO ] Deduced a trap composed of 160 places in 231 ms of which 3 ms to minimize.
[2024-05-31 23:03:01] [INFO ] Deduced a trap composed of 127 places in 238 ms of which 2 ms to minimize.
[2024-05-31 23:03:02] [INFO ] Deduced a trap composed of 130 places in 226 ms of which 2 ms to minimize.
[2024-05-31 23:03:02] [INFO ] Deduced a trap composed of 127 places in 240 ms of which 3 ms to minimize.
[2024-05-31 23:03:02] [INFO ] Deduced a trap composed of 144 places in 239 ms of which 3 ms to minimize.
[2024-05-31 23:03:02] [INFO ] Deduced a trap composed of 127 places in 235 ms of which 2 ms to minimize.
[2024-05-31 23:03:03] [INFO ] Deduced a trap composed of 119 places in 225 ms of which 3 ms to minimize.
[2024-05-31 23:03:03] [INFO ] Deduced a trap composed of 123 places in 233 ms of which 3 ms to minimize.
[2024-05-31 23:03:03] [INFO ] Deduced a trap composed of 122 places in 219 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/473 variables, 15/217 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/473 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 455/928 variables, 473/690 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/928 variables, 73/763 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/928 variables, 4/767 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 23:03:12] [INFO ] Deduced a trap composed of 22 places in 105 ms of which 1 ms to minimize.
[2024-05-31 23:03:12] [INFO ] Deduced a trap composed of 34 places in 117 ms of which 2 ms to minimize.
[2024-05-31 23:03:13] [INFO ] Deduced a trap composed of 28 places in 107 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/928 variables, 3/770 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 23:03:14] [INFO ] Deduced a trap composed of 53 places in 92 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/928 variables, 1/771 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 23:03:14] [INFO ] Deduced a trap composed of 72 places in 94 ms of which 2 ms to minimize.
[2024-05-31 23:03:15] [INFO ] Deduced a trap composed of 47 places in 85 ms of which 2 ms to minimize.
[2024-05-31 23:03:15] [INFO ] Deduced a trap composed of 47 places in 89 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/928 variables, 3/774 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 23:03:17] [INFO ] Deduced a trap composed of 151 places in 204 ms of which 2 ms to minimize.
[2024-05-31 23:03:17] [INFO ] Deduced a trap composed of 117 places in 219 ms of which 3 ms to minimize.
[2024-05-31 23:03:17] [INFO ] Deduced a trap composed of 85 places in 87 ms of which 1 ms to minimize.
[2024-05-31 23:03:18] [INFO ] Deduced a trap composed of 110 places in 222 ms of which 3 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/928 variables, 4/778 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/928 variables, 0/778 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 933/933 variables, and 783 constraints, problems are : Problem set: 0 solved, 4 unsolved in 45014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/3 constraints, Generalized P Invariants (flows): 96/96 constraints, State Equation: 478/478 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 131/131 constraints]
After SMT, in 45697ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 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 17 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 17 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 10 ms. Remains 478 /478 variables (removed 0) and now considering 455/455 (removed 0) transitions.
[2024-05-31 23:03:19] [INFO ] Invariant cache hit.
[2024-05-31 23:03:20] [INFO ] Implicit Places using invariants in 1468 ms returned [42, 48, 69, 74, 95, 100, 120, 126, 147, 152, 153, 174, 179, 200, 206, 213, 227, 232, 255, 261, 283, 288, 309, 314, 336, 341, 362, 369, 390, 392, 396, 416, 422, 444, 449, 453, 470, 476]
[2024-05-31 23:03:20] [INFO ] Actually due to overlaps returned [213, 152]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1474 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 476/478 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 476 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 475 transition count 454
Applied a total of 2 rules in 23 ms. Remains 475 /476 variables (removed 1) and now considering 454/455 (removed 1) transitions.
// Phase 1: matrix 454 rows 475 cols
[2024-05-31 23:03:20] [INFO ] Invariants computation overflowed in 41 ms
[2024-05-31 23:03:21] [INFO ] Implicit Places using invariants in 491 ms returned []
// Phase 1: matrix 454 rows 475 cols
[2024-05-31 23:03:21] [INFO ] Invariants computation overflowed in 41 ms
[2024-05-31 23:03:21] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-31 23:03:37] [INFO ] Implicit Places using invariants and state equation in 15769 ms returned [42, 48, 69, 74, 95, 100, 120, 126, 147, 152, 173, 178, 199, 205, 224, 229, 252, 258, 280, 285, 306, 311, 333, 338, 359, 366, 387, 389, 393, 413, 419, 441, 446, 450, 467, 473]
[2024-05-31 23:03:37] [INFO ] Actually due to overlaps returned [450, 389]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 16264 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 473/478 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 473 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 472 transition count 453
Applied a total of 2 rules in 22 ms. Remains 472 /473 variables (removed 1) and now considering 453/454 (removed 1) transitions.
// Phase 1: matrix 453 rows 472 cols
[2024-05-31 23:03:37] [INFO ] Invariants computation overflowed in 40 ms
[2024-05-31 23:03:37] [INFO ] Implicit Places using invariants in 451 ms returned []
// Phase 1: matrix 453 rows 472 cols
[2024-05-31 23:03:37] [INFO ] Invariants computation overflowed in 37 ms
[2024-05-31 23:03:37] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-31 23:03:47] [INFO ] Implicit Places using invariants and state equation in 9664 ms returned [42, 48, 69, 74, 95, 100, 120, 126, 147, 152, 173, 178, 199, 205, 224, 229, 252, 258, 280, 285, 306, 311, 333, 338, 359, 366, 387, 392, 412, 418, 440, 445, 464, 470]
[2024-05-31 23:03:47] [INFO ] Actually due to overlaps returned [48, 42]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 10118 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 470/478 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 470 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 469 transition count 452
Applied a total of 2 rules in 17 ms. Remains 469 /470 variables (removed 1) and now considering 452/453 (removed 1) transitions.
// Phase 1: matrix 452 rows 469 cols
[2024-05-31 23:03:47] [INFO ] Invariants computation overflowed in 36 ms
[2024-05-31 23:03:47] [INFO ] Implicit Places using invariants in 424 ms returned []
// Phase 1: matrix 452 rows 469 cols
[2024-05-31 23:03:47] [INFO ] Invariants computation overflowed in 36 ms
[2024-05-31 23:03:47] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-31 23:03:56] [INFO ] Implicit Places using invariants and state equation in 8946 ms returned [66, 71, 92, 97, 117, 123, 144, 149, 170, 175, 196, 202, 221, 226, 249, 255, 277, 282, 303, 308, 330, 335, 356, 363, 384, 389, 409, 415, 437, 442, 461, 467]
[2024-05-31 23:03:56] [INFO ] Actually due to overlaps returned [71, 66]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 9372 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 467/478 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 467 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 466 transition count 451
Applied a total of 2 rules in 24 ms. Remains 466 /467 variables (removed 1) and now considering 451/452 (removed 1) transitions.
// Phase 1: matrix 451 rows 466 cols
[2024-05-31 23:03:56] [INFO ] Invariants computation overflowed in 57 ms
[2024-05-31 23:03:57] [INFO ] Implicit Places using invariants in 443 ms returned []
// Phase 1: matrix 451 rows 466 cols
[2024-05-31 23:03:57] [INFO ] Invariants computation overflowed in 45 ms
[2024-05-31 23:03:57] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-31 23:04:06] [INFO ] Implicit Places using invariants and state equation in 9125 ms returned [89, 94, 114, 120, 141, 146, 167, 172, 193, 199, 218, 223, 246, 252, 274, 279, 300, 305, 327, 332, 353, 360, 381, 386, 406, 412, 434, 439, 458, 464]
[2024-05-31 23:04:06] [INFO ] Actually due to overlaps returned [94, 89]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 9570 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 464/478 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 464 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 463 transition count 450
Applied a total of 2 rules in 22 ms. Remains 463 /464 variables (removed 1) and now considering 450/451 (removed 1) transitions.
// Phase 1: matrix 450 rows 463 cols
[2024-05-31 23:04:06] [INFO ] Invariants computation overflowed in 60 ms
[2024-05-31 23:04:06] [INFO ] Implicit Places using invariants in 427 ms returned []
// Phase 1: matrix 450 rows 463 cols
[2024-05-31 23:04:06] [INFO ] Invariants computation overflowed in 52 ms
[2024-05-31 23:04:06] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-31 23:04:17] [INFO ] Implicit Places using invariants and state equation in 11085 ms returned [111, 117, 138, 143, 164, 169, 190, 196, 215, 220, 243, 249, 271, 276, 297, 302, 324, 329, 350, 357, 378, 383, 403, 409, 431, 436, 455, 461]
[2024-05-31 23:04:17] [INFO ] Actually due to overlaps returned [117, 111]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 11518 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 461/478 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 461 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 460 transition count 449
Applied a total of 2 rules in 22 ms. Remains 460 /461 variables (removed 1) and now considering 449/450 (removed 1) transitions.
// Phase 1: matrix 449 rows 460 cols
[2024-05-31 23:04:17] [INFO ] Invariants computation overflowed in 40 ms
[2024-05-31 23:04:18] [INFO ] Implicit Places using invariants in 405 ms returned []
// Phase 1: matrix 449 rows 460 cols
[2024-05-31 23:04:18] [INFO ] Invariants computation overflowed in 42 ms
[2024-05-31 23:04:18] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-31 23:04:37] [INFO ] Implicit Places using invariants and state equation in 19660 ms returned [135, 140, 161, 166, 187, 193, 212, 217, 240, 246, 268, 273, 294, 299, 321, 326, 347, 354, 375, 380, 400, 406, 428, 433, 452, 458]
[2024-05-31 23:04:37] [INFO ] Actually due to overlaps returned [140, 135]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 20081 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 458/478 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 458 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 457 transition count 448
Applied a total of 2 rules in 16 ms. Remains 457 /458 variables (removed 1) and now considering 448/449 (removed 1) transitions.
// Phase 1: matrix 448 rows 457 cols
[2024-05-31 23:04:37] [INFO ] Invariants computation overflowed in 40 ms
[2024-05-31 23:04:38] [INFO ] Implicit Places using invariants in 400 ms returned []
// Phase 1: matrix 448 rows 457 cols
[2024-05-31 23:04:38] [INFO ] Invariants computation overflowed in 33 ms
[2024-05-31 23:04:38] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-31 23:04:47] [INFO ] Implicit Places using invariants and state equation in 9405 ms returned [158, 163, 184, 190, 209, 214, 237, 243, 265, 270, 291, 296, 318, 323, 344, 351, 372, 377, 397, 403, 425, 430, 449, 455]
[2024-05-31 23:04:47] [INFO ] Actually due to overlaps returned [163, 158]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 9808 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 455/478 places, 448/455 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 455 transition count 448
Applied a total of 1 rules in 24 ms. Remains 455 /455 variables (removed 0) and now considering 448/448 (removed 0) transitions.
// Phase 1: matrix 448 rows 455 cols
[2024-05-31 23:04:47] [INFO ] Invariants computation overflowed in 35 ms
[2024-05-31 23:04:48] [INFO ] Implicit Places using invariants in 369 ms returned []
// Phase 1: matrix 448 rows 455 cols
[2024-05-31 23:04:48] [INFO ] Invariants computation overflowed in 29 ms
[2024-05-31 23:04:48] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-31 23:05:01] [INFO ] Implicit Places using invariants and state equation in 13286 ms returned [182, 188, 207, 212, 235, 241, 263, 268, 289, 294, 316, 321, 342, 349, 370, 375, 395, 401, 423, 428, 447, 453]
[2024-05-31 23:05:01] [INFO ] Actually due to overlaps returned [188, 182]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 13658 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 453/478 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 453 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 452 transition count 447
Applied a total of 2 rules in 20 ms. Remains 452 /453 variables (removed 1) and now considering 447/448 (removed 1) transitions.
// Phase 1: matrix 447 rows 452 cols
[2024-05-31 23:05:01] [INFO ] Invariants computation overflowed in 33 ms
[2024-05-31 23:05:01] [INFO ] Implicit Places using invariants in 357 ms returned []
// Phase 1: matrix 447 rows 452 cols
[2024-05-31 23:05:01] [INFO ] Invariants computation overflowed in 36 ms
[2024-05-31 23:05:02] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-31 23:05:14] [INFO ] Implicit Places using invariants and state equation in 13080 ms returned [204, 209, 232, 238, 260, 265, 286, 291, 313, 318, 339, 346, 367, 372, 392, 398, 420, 425, 444, 450]
[2024-05-31 23:05:14] [INFO ] Actually due to overlaps returned [209, 204]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 13440 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 10 : 450/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 450 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 449 transition count 446
Applied a total of 2 rules in 19 ms. Remains 449 /450 variables (removed 1) and now considering 446/447 (removed 1) transitions.
// Phase 1: matrix 446 rows 449 cols
[2024-05-31 23:05:14] [INFO ] Invariants computation overflowed in 42 ms
[2024-05-31 23:05:15] [INFO ] Implicit Places using invariants in 365 ms returned []
// Phase 1: matrix 446 rows 449 cols
[2024-05-31 23:05:15] [INFO ] Invariants computation overflowed in 40 ms
[2024-05-31 23:05:15] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-31 23:05:24] [INFO ] Implicit Places using invariants and state equation in 9070 ms returned [229, 235, 257, 262, 283, 288, 310, 315, 336, 343, 364, 369, 389, 395, 417, 422, 441, 447]
[2024-05-31 23:05:24] [INFO ] Actually due to overlaps returned [235, 229]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 9439 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 11 : 447/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 447 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 446 transition count 445
Applied a total of 2 rules in 31 ms. Remains 446 /447 variables (removed 1) and now considering 445/446 (removed 1) transitions.
// Phase 1: matrix 445 rows 446 cols
[2024-05-31 23:05:24] [INFO ] Invariants computation overflowed in 56 ms
[2024-05-31 23:05:24] [INFO ] Implicit Places using invariants in 354 ms returned []
// Phase 1: matrix 445 rows 446 cols
[2024-05-31 23:05:24] [INFO ] Invariants computation overflowed in 50 ms
[2024-05-31 23:05:24] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-31 23:05:31] [INFO ] Implicit Places using invariants and state equation in 7126 ms returned [254, 259, 280, 285, 307, 312, 333, 340, 361, 366, 386, 392, 414, 419, 438, 444]
[2024-05-31 23:05:31] [INFO ] Actually due to overlaps returned [259, 254]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 7482 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 12 : 444/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 444 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 443 transition count 444
Applied a total of 2 rules in 16 ms. Remains 443 /444 variables (removed 1) and now considering 444/445 (removed 1) transitions.
// Phase 1: matrix 444 rows 443 cols
[2024-05-31 23:05:31] [INFO ] Invariants computation overflowed in 48 ms
[2024-05-31 23:05:32] [INFO ] Implicit Places using invariants in 341 ms returned []
// Phase 1: matrix 444 rows 443 cols
[2024-05-31 23:05:32] [INFO ] Invariants computation overflowed in 52 ms
[2024-05-31 23:05:32] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-31 23:05:40] [INFO ] Implicit Places using invariants and state equation in 8550 ms returned [277, 282, 304, 309, 330, 337, 358, 363, 383, 389, 411, 416, 435, 441]
[2024-05-31 23:05:40] [INFO ] Actually due to overlaps returned [282, 277]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 8893 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 13 : 441/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 441 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 440 transition count 443
Applied a total of 2 rules in 25 ms. Remains 440 /441 variables (removed 1) and now considering 443/444 (removed 1) transitions.
// Phase 1: matrix 443 rows 440 cols
[2024-05-31 23:05:40] [INFO ] Invariants computation overflowed in 44 ms
[2024-05-31 23:05:41] [INFO ] Implicit Places using invariants in 310 ms returned []
// Phase 1: matrix 443 rows 440 cols
[2024-05-31 23:05:41] [INFO ] Invariants computation overflowed in 37 ms
[2024-05-31 23:05:41] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-31 23:05:48] [INFO ] Implicit Places using invariants and state equation in 7262 ms returned [301, 306, 327, 334, 355, 360, 380, 386, 408, 413, 432, 438]
[2024-05-31 23:05:48] [INFO ] Actually due to overlaps returned [306, 301]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 7574 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 14 : 438/478 places, 443/455 transitions.
Applied a total of 0 rules in 12 ms. Remains 438 /438 variables (removed 0) and now considering 443/443 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 15 iterations and 148997 ms. Remains : 438/478 places, 443/455 transitions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 113 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 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 13822 reset in 123 ms.
Product exploration explored 100000 steps with 13997 reset in 128 ms.
Support contains 6 out of 558 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 558/558 places, 535/535 transitions.
Applied a total of 0 rules in 10 ms. Remains 558 /558 variables (removed 0) and now considering 535/535 (removed 0) transitions.
// Phase 1: matrix 535 rows 558 cols
[2024-05-31 23:05:49] [INFO ] Computed 99 invariants in 56 ms
[2024-05-31 23:05:49] [INFO ] Implicit Places using invariants in 323 ms returned []
[2024-05-31 23:05:49] [INFO ] Invariant cache hit.
[2024-05-31 23:05:49] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-31 23:05:57] [INFO ] Implicit Places using invariants and state equation in 8370 ms returned []
Implicit Place search using SMT with State Equation took 8712 ms to find 0 implicit places.
[2024-05-31 23:05:57] [INFO ] Redundant transitions in 4 ms returned []
Running 534 sub problems to find dead transitions.
[2024-05-31 23:05:57] [INFO ] Invariant cache hit.
[2024-05-31 23:05:57] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/557 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/557 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/557 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 3 (OVERLAPS) 535/1092 variables, 557/656 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1092 variables, 38/694 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1092 variables, 0/694 constraints. Problems are: Problem set: 0 solved, 534 unsolved
SMT process timed out in 30105ms, After SMT, problems are : Problem set: 0 solved, 534 unsolved
Search for dead transitions found 0 dead transitions in 30111ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38848 ms. Remains : 558/558 places, 535/535 transitions.
Treatment of property DoubleExponent-PT-020-LTLCardinality-14 finished in 536217 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)))'
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(p1)))))'
[2024-05-31 23:06:28] [INFO ] Flatten gal took : 42 ms
[2024-05-31 23:06:28] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2024-05-31 23:06:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1057 places, 997 transitions and 2802 arcs took 9 ms.
Total runtime 2147019 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : DoubleExponent-PT-020-LTLCardinality-12
Could not compute solution for formula : DoubleExponent-PT-020-LTLCardinality-14

BK_STOP 1717197570911

--------------------
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 LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name DoubleExponent-PT-020-LTLCardinality-12
ltl formula formula --ltl=/tmp/4167/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1057 places, 997 transitions and 2802 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4167/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4167/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.250 real 0.020 user 0.060 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4167/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4167/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 1059 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1058, there are 1000 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~1046 levels ~10000 states ~11116 transitions
pnml2lts-mc( 2/ 4): ~1152 levels ~20000 states ~22220 transitions
pnml2lts-mc( 3/ 4): ~1211 levels ~40000 states ~44508 transitions
pnml2lts-mc( 3/ 4): ~1315 levels ~80000 states ~88976 transitions
pnml2lts-mc( 3/ 4): ~1497 levels ~160000 states ~177896 transitions
pnml2lts-mc( 3/ 4): ~2308 levels ~320000 states ~355572 transitions
pnml2lts-mc( 3/ 4): ~3486 levels ~640000 states ~711352 transitions
pnml2lts-mc( 3/ 4): ~6555 levels ~1280000 states ~1423024 transitions
pnml2lts-mc( 2/ 4): ~12558 levels ~2560000 states ~2841872 transitions
pnml2lts-mc( 2/ 4): ~19121 levels ~5120000 states ~5678724 transitions
pnml2lts-mc( 2/ 4): ~19586 levels ~10240000 states ~11345260 transitions
pnml2lts-mc( 2/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 11092568
pnml2lts-mc( 0/ 4): unique states count: 11488516
pnml2lts-mc( 0/ 4): unique transitions count: 12717455
pnml2lts-mc( 0/ 4): - self-loop count: 1198029
pnml2lts-mc( 0/ 4): - claim dead count: 37047
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 12020208
pnml2lts-mc( 0/ 4): - cum. max stack depth: 453845
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 12020208 states 13318818 transitions, fanout: 1.108
pnml2lts-mc( 0/ 4): Total exploration time 378.400 sec (378.380 sec minimum, 378.390 sec on average)
pnml2lts-mc( 0/ 4): States per second: 31766, Transitions per second: 35198
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 151.9MB, 13.8 B/state, compr.: 0.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 34.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 1027 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 151.9MB (~256.0MB paged-in)
ltl formula name DoubleExponent-PT-020-LTLCardinality-14
ltl formula formula --ltl=/tmp/4167/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1057 places, 997 transitions and 2802 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.100 real 0.020 user 0.040 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4167/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4167/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4167/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4167/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 1058 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1058, there are 1008 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~1023 levels ~10000 states ~11172 transitions
pnml2lts-mc( 0/ 4): ~1162 levels ~20000 states ~22280 transitions
pnml2lts-mc( 0/ 4): ~1293 levels ~40000 states ~44460 transitions
pnml2lts-mc( 0/ 4): ~1476 levels ~80000 states ~88824 transitions
pnml2lts-mc( 0/ 4): ~1713 levels ~160000 states ~177548 transitions
pnml2lts-mc( 0/ 4): ~2674 levels ~320000 states ~355144 transitions
pnml2lts-mc( 0/ 4): ~4724 levels ~640000 states ~710088 transitions
pnml2lts-mc( 0/ 4): ~8264 levels ~1280000 states ~1420956 transitions
pnml2lts-mc( 0/ 4): ~14974 levels ~2560000 states ~2842572 transitions
pnml2lts-mc( 0/ 4): ~19179 levels ~5120000 states ~5677520 transitions
pnml2lts-mc( 1/ 4): ~19696 levels ~10240000 states ~11332192 transitions
pnml2lts-mc( 0/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 12451327
pnml2lts-mc( 0/ 4): unique states count: 12473132
pnml2lts-mc( 0/ 4): unique transitions count: 13800813
pnml2lts-mc( 0/ 4): - self-loop count: 1330660
pnml2lts-mc( 0/ 4): - claim dead count: 26729
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 12883697
pnml2lts-mc( 0/ 4): - cum. max stack depth: 80996
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 12883697 states 14265333 transitions, fanout: 1.107
pnml2lts-mc( 0/ 4): Total exploration time 402.300 sec (402.290 sec minimum, 402.295 sec on average)
pnml2lts-mc( 0/ 4): States per second: 32025, Transitions per second: 35459
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 159.2MB, 13.4 B/state, compr.: 0.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 37.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 1027 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 159.2MB (~256.0MB paged-in)

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="LTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is DoubleExponent-PT-020, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r488-tall-171631132900563"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;