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-171631132900561.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 CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r488-tall-171631132900561
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1717194473194

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
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:27:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 22:27:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:27:54] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2024-05-31 22:27:54] [INFO ] Transformed 1064 places.
[2024-05-31 22:27:54] [INFO ] Transformed 998 transitions.
[2024-05-31 22:27:54] [INFO ] Parsed PT model containing 1064 places and 998 transitions and 2814 arcs in 197 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
Support contains 139 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 146 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:27:55] [INFO ] Invariants computation overflowed in 131 ms
[2024-05-31 22:27:55] [INFO ] Implicit Places using invariants in 851 ms returned []
// Phase 1: matrix 998 rows 1060 cols
[2024-05-31 22:27:55] [INFO ] Invariants computation overflowed in 91 ms
[2024-05-31 22:28:13] [INFO ] Implicit Places using invariants and state equation in 17884 ms returned [28]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 18800 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1059/1064 places, 998/998 transitions.
Applied a total of 0 rules in 61 ms. Remains 1059 /1059 variables (removed 0) and now considering 998/998 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 19028 ms. Remains : 1059/1064 places, 998/998 transitions.
Support contains 139 out of 1059 places after structural reductions.
[2024-05-31 22:28:13] [INFO ] Flatten gal took : 93 ms
[2024-05-31 22:28:14] [INFO ] Flatten gal took : 51 ms
[2024-05-31 22:28:14] [INFO ] Input system was already deterministic with 998 transitions.
RANDOM walk for 40000 steps (1308 resets) in 1905 ms. (20 steps per ms) remains 87/88 properties
BEST_FIRST walk for 4001 steps (108 resets) in 93 ms. (42 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4000 steps (109 resets) in 45 ms. (86 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4000 steps (111 resets) in 60 ms. (65 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4000 steps (116 resets) in 56 ms. (70 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4000 steps (111 resets) in 63 ms. (62 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4000 steps (109 resets) in 45 ms. (86 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4000 steps (117 resets) in 41 ms. (95 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4000 steps (113 resets) in 57 ms. (68 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4000 steps (106 resets) in 34 ms. (114 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4001 steps (113 resets) in 32 ms. (121 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4001 steps (116 resets) in 32 ms. (121 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4000 steps (113 resets) in 35 ms. (111 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4000 steps (106 resets) in 32 ms. (121 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4001 steps (112 resets) in 43 ms. (90 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4001 steps (115 resets) in 37 ms. (105 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4000 steps (112 resets) in 57 ms. (68 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4000 steps (110 resets) in 69 ms. (57 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4000 steps (111 resets) in 33 ms. (117 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4000 steps (111 resets) in 30 ms. (129 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4001 steps (114 resets) in 30 ms. (129 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4000 steps (110 resets) in 39 ms. (100 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4000 steps (113 resets) in 37 ms. (105 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4000 steps (110 resets) in 32 ms. (121 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4001 steps (120 resets) in 32 ms. (121 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4000 steps (114 resets) in 74 ms. (53 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4000 steps (110 resets) in 42 ms. (93 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4000 steps (112 resets) in 36 ms. (108 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4001 steps (116 resets) in 42 ms. (93 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4001 steps (118 resets) in 56 ms. (70 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4001 steps (105 resets) in 40 ms. (97 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4001 steps (114 resets) in 50 ms. (78 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4002 steps (110 resets) in 49 ms. (80 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4000 steps (110 resets) in 39 ms. (100 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4000 steps (109 resets) in 39 ms. (100 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4002 steps (109 resets) in 38 ms. (102 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4001 steps (112 resets) in 44 ms. (88 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4000 steps (108 resets) in 53 ms. (74 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4000 steps (114 resets) in 39 ms. (100 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4000 steps (111 resets) in 40 ms. (97 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4000 steps (106 resets) in 41 ms. (95 steps per ms) remains 85/87 properties
BEST_FIRST walk for 4001 steps (110 resets) in 37 ms. (105 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4001 steps (107 resets) in 43 ms. (90 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4000 steps (109 resets) in 38 ms. (102 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4000 steps (111 resets) in 42 ms. (93 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4000 steps (108 resets) in 41 ms. (95 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4000 steps (114 resets) in 29 ms. (133 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4001 steps (114 resets) in 27 ms. (142 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4001 steps (112 resets) in 45 ms. (86 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4001 steps (109 resets) in 26 ms. (148 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4001 steps (104 resets) in 27 ms. (142 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4002 steps (116 resets) in 29 ms. (133 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4000 steps (110 resets) in 28 ms. (137 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4001 steps (111 resets) in 30 ms. (129 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4000 steps (111 resets) in 30 ms. (129 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4001 steps (111 resets) in 30 ms. (129 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4001 steps (113 resets) in 30 ms. (129 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4000 steps (115 resets) in 31 ms. (125 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4000 steps (112 resets) in 28 ms. (137 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4002 steps (108 resets) in 39 ms. (100 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4001 steps (112 resets) in 34 ms. (114 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4002 steps (109 resets) in 30 ms. (129 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4000 steps (111 resets) in 28 ms. (137 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4001 steps (104 resets) in 41 ms. (95 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4000 steps (110 resets) in 28 ms. (137 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4000 steps (120 resets) in 29 ms. (133 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4001 steps (103 resets) in 27 ms. (142 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4001 steps (113 resets) in 29 ms. (133 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4000 steps (115 resets) in 34 ms. (114 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4000 steps (112 resets) in 31 ms. (125 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4001 steps (110 resets) in 30 ms. (129 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4001 steps (112 resets) in 50 ms. (78 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4000 steps (116 resets) in 36 ms. (108 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4000 steps (108 resets) in 40 ms. (97 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4000 steps (105 resets) in 35 ms. (111 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4002 steps (112 resets) in 35 ms. (111 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4001 steps (115 resets) in 34 ms. (114 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4001 steps (111 resets) in 29 ms. (133 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4000 steps (111 resets) in 29 ms. (133 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4001 steps (111 resets) in 29 ms. (133 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4001 steps (113 resets) in 27 ms. (142 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4000 steps (111 resets) in 29 ms. (133 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4002 steps (112 resets) in 28 ms. (138 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4001 steps (109 resets) in 26 ms. (148 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4001 steps (111 resets) in 71 ms. (55 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4001 steps (107 resets) in 50 ms. (78 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4001 steps (114 resets) in 58 ms. (67 steps per ms) remains 85/85 properties
Interrupted probabilistic random walk after 127358 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :4 out of 85
Probabilistic random walk after 127358 steps, saw 63691 distinct states, run finished after 3015 ms. (steps per millisecond=42 ) properties seen :4
// Phase 1: matrix 998 rows 1059 cols
[2024-05-31 22:28:19] [INFO ] Computed 100 invariants in 111 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (OVERLAPS) 752/882 variables, 87/87 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/882 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (OVERLAPS) 6/888 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/888 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (OVERLAPS) 56/944 variables, 11/100 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/944 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (OVERLAPS) 973/1917 variables, 944/1044 constraints. Problems are: Problem set: 0 solved, 81 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1917/2057 variables, and 1044 constraints, problems are : Problem set: 0 solved, 81 unsolved in 5018 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 98/98 constraints, State Equation: 944/1059 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 81 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (OVERLAPS) 752/882 variables, 87/87 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/882 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (OVERLAPS) 6/888 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/888 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (OVERLAPS) 56/944 variables, 11/100 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/944 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (OVERLAPS) 973/1917 variables, 944/1044 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1917 variables, 58/1102 constraints. Problems are: Problem set: 0 solved, 81 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1917/2057 variables, and 1102 constraints, problems are : Problem set: 0 solved, 81 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 98/98 constraints, State Equation: 944/1059 constraints, PredecessorRefiner: 58/81 constraints, Known Traps: 0/0 constraints]
After SMT, in 10252ms problems are : Problem set: 0 solved, 81 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 130 out of 1059 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1059/1059 places, 998/998 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 135 transitions
Trivial Post-agglo rules discarded 135 transitions
Performed 135 trivial Post agglomeration. Transition count delta: 135
Iterating post reduction 0 with 135 rules applied. Total rules applied 135 place count 1059 transition count 863
Reduce places removed 135 places and 0 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Iterating post reduction 1 with 165 rules applied. Total rules applied 300 place count 924 transition count 833
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 330 place count 894 transition count 833
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 330 place count 894 transition count 799
Deduced a syphon composed of 34 places in 10 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 398 place count 860 transition count 799
Performed 126 Post agglomeration using F-continuation condition.Transition count delta: 126
Deduced a syphon composed of 126 places in 16 ms
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 3 with 252 rules applied. Total rules applied 650 place count 734 transition count 673
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 23 places in 13 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 696 place count 711 transition count 673
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 697 place count 711 transition count 672
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 698 place count 710 transition count 672
Free-agglomeration rule (complex) applied 87 times.
Iterating global reduction 4 with 87 rules applied. Total rules applied 785 place count 710 transition count 585
Reduce places removed 87 places and 0 transitions.
Iterating post reduction 4 with 87 rules applied. Total rules applied 872 place count 623 transition count 585
Partial Free-agglomeration rule applied 74 times.
Drop transitions (Partial Free agglomeration) removed 74 transitions
Iterating global reduction 5 with 74 rules applied. Total rules applied 946 place count 623 transition count 585
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 947 place count 622 transition count 584
Applied a total of 947 rules in 333 ms. Remains 622 /1059 variables (removed 437) and now considering 584/998 (removed 414) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 333 ms. Remains : 622/1059 places, 584/998 transitions.
RANDOM walk for 40000 steps (4627 resets) in 881 ms. (45 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4001 steps (313 resets) in 37 ms. (105 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4001 steps (318 resets) in 31 ms. (125 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4001 steps (309 resets) in 41 ms. (95 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4000 steps (305 resets) in 51 ms. (76 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4001 steps (311 resets) in 33 ms. (117 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4001 steps (307 resets) in 49 ms. (80 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4000 steps (315 resets) in 50 ms. (78 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4001 steps (308 resets) in 46 ms. (85 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4000 steps (312 resets) in 39 ms. (100 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4002 steps (320 resets) in 38 ms. (102 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4003 steps (321 resets) in 31 ms. (125 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4000 steps (319 resets) in 29 ms. (133 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4002 steps (315 resets) in 27 ms. (142 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4000 steps (317 resets) in 37 ms. (105 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4000 steps (313 resets) in 42 ms. (93 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4002 steps (322 resets) in 44 ms. (88 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4002 steps (304 resets) in 33 ms. (117 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4003 steps (323 resets) in 30 ms. (129 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4001 steps (325 resets) in 62 ms. (63 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4001 steps (312 resets) in 51 ms. (76 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4001 steps (320 resets) in 36 ms. (108 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4000 steps (302 resets) in 37 ms. (105 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4001 steps (314 resets) in 54 ms. (72 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4000 steps (304 resets) in 27 ms. (142 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4003 steps (303 resets) in 31 ms. (125 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4003 steps (321 resets) in 27 ms. (142 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4001 steps (309 resets) in 30 ms. (129 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4001 steps (304 resets) in 33 ms. (117 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4001 steps (322 resets) in 30 ms. (129 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4002 steps (307 resets) in 31 ms. (125 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4002 steps (325 resets) in 35 ms. (111 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4001 steps (315 resets) in 30 ms. (129 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4002 steps (304 resets) in 35 ms. (111 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4001 steps (301 resets) in 24 ms. (160 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4001 steps (309 resets) in 22 ms. (173 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4002 steps (313 resets) in 23 ms. (166 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4003 steps (318 resets) in 21 ms. (181 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4001 steps (325 resets) in 21 ms. (181 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4000 steps (348 resets) in 23 ms. (166 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4002 steps (315 resets) in 23 ms. (166 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4000 steps (313 resets) in 21 ms. (181 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4001 steps (316 resets) in 24 ms. (160 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4000 steps (315 resets) in 23 ms. (166 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4003 steps (302 resets) in 24 ms. (160 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4002 steps (305 resets) in 38 ms. (102 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4002 steps (315 resets) in 24 ms. (160 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4000 steps (309 resets) in 22 ms. (173 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4002 steps (325 resets) in 23 ms. (166 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4002 steps (303 resets) in 22 ms. (174 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4003 steps (321 resets) in 22 ms. (174 steps per ms) remains 81/81 properties
Interrupted probabilistic random walk after 138060 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :1 out of 81
Probabilistic random walk after 138060 steps, saw 69407 distinct states, run finished after 3002 ms. (steps per millisecond=45 ) properties seen :1
// Phase 1: matrix 584 rows 622 cols
[2024-05-31 22:28:33] [INFO ] Invariants computation overflowed in 74 ms
[2024-05-31 22:28:33] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (OVERLAPS) 359/487 variables, 128/128 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/487 variables, 3/131 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/487 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 615/1102 variables, 402/533 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1102 variables, 40/573 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1102 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (OVERLAPS) 103/1205 variables, 91/664 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1205 variables, 2/666 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1205 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 80 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp72 is UNSAT
Problem AtomicPropp76 is UNSAT
Problem AtomicPropp78 is UNSAT
At refinement iteration 10 (OVERLAPS) 1/1206 variables, 1/667 constraints. Problems are: Problem set: 14 solved, 66 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1206 variables, 0/667 constraints. Problems are: Problem set: 14 solved, 66 unsolved
At refinement iteration 12 (OVERLAPS) 0/1206 variables, 0/667 constraints. Problems are: Problem set: 14 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1206/1206 variables, and 667 constraints, problems are : Problem set: 14 solved, 66 unsolved in 26687 ms.
Refiners :[State Equation: 622/622 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 14 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 14 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 314/422 variables, 108/108 constraints. Problems are: Problem set: 14 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/422 variables, 2/110 constraints. Problems are: Problem set: 14 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/422 variables, 2/112 constraints. Problems are: Problem set: 14 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/422 variables, 0/112 constraints. Problems are: Problem set: 14 solved, 66 unsolved
At refinement iteration 5 (OVERLAPS) 620/1042 variables, 379/491 constraints. Problems are: Problem set: 14 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1042 variables, 36/527 constraints. Problems are: Problem set: 14 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1042 variables, 63/590 constraints. Problems are: Problem set: 14 solved, 66 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1042 variables, 0/590 constraints. Problems are: Problem set: 14 solved, 66 unsolved
At refinement iteration 9 (OVERLAPS) 159/1201 variables, 131/721 constraints. Problems are: Problem set: 14 solved, 66 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1201 variables, 7/728 constraints. Problems are: Problem set: 14 solved, 66 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1201 variables, 1/729 constraints. Problems are: Problem set: 14 solved, 66 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1201/1206 variables, and 729 constraints, problems are : Problem set: 14 solved, 66 unsolved in 45019 ms.
Refiners :[State Equation: 618/622 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 66/80 constraints, Known Traps: 0/0 constraints]
After SMT, in 71837ms problems are : Problem set: 14 solved, 66 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 108 out of 622 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 622/622 places, 584/584 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 622 transition count 582
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 620 transition count 582
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 620 transition count 580
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 618 transition count 580
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 3 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 28 place count 608 transition count 570
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 607 transition count 570
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 607 transition count 569
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 32 place count 606 transition count 569
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 38 place count 606 transition count 563
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 44 place count 600 transition count 563
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 47 place count 600 transition count 563
Applied a total of 47 rules in 106 ms. Remains 600 /622 variables (removed 22) and now considering 563/584 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 600/622 places, 563/584 transitions.
RANDOM walk for 40000 steps (5114 resets) in 357 ms. (111 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (336 resets) in 27 ms. (142 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (351 resets) in 23 ms. (166 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (345 resets) in 21 ms. (181 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (329 resets) in 21 ms. (181 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (328 resets) in 22 ms. (173 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (339 resets) in 51 ms. (76 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4000 steps (335 resets) in 29 ms. (133 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (357 resets) in 44 ms. (88 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (336 resets) in 19 ms. (200 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4000 steps (323 resets) in 18 ms. (210 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (337 resets) in 50 ms. (78 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (318 resets) in 29 ms. (133 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (358 resets) in 33 ms. (117 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (347 resets) in 28 ms. (138 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (327 resets) in 37 ms. (105 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (352 resets) in 35 ms. (111 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (321 resets) in 43 ms. (90 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4000 steps (340 resets) in 30 ms. (129 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (327 resets) in 22 ms. (174 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (337 resets) in 37 ms. (105 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (333 resets) in 37 ms. (105 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (352 resets) in 22 ms. (174 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (321 resets) in 22 ms. (174 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4000 steps (340 resets) in 53 ms. (74 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (350 resets) in 25 ms. (153 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4000 steps (341 resets) in 51 ms. (76 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (317 resets) in 32 ms. (121 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (328 resets) in 21 ms. (181 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (336 resets) in 42 ms. (93 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (339 resets) in 44 ms. (88 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4000 steps (320 resets) in 33 ms. (117 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (346 resets) in 26 ms. (148 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4000 steps (349 resets) in 35 ms. (111 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4000 steps (332 resets) in 36 ms. (108 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (338 resets) in 28 ms. (138 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (342 resets) in 38 ms. (102 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (335 resets) in 49 ms. (80 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (331 resets) in 40 ms. (97 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4000 steps (314 resets) in 37 ms. (105 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (339 resets) in 30 ms. (129 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (336 resets) in 41 ms. (95 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (329 resets) in 21 ms. (181 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (340 resets) in 22 ms. (174 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (334 resets) in 33 ms. (117 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (331 resets) in 34 ms. (114 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (352 resets) in 45 ms. (87 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (345 resets) in 40 ms. (97 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4000 steps (347 resets) in 61 ms. (64 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (342 resets) in 30 ms. (129 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (333 resets) in 23 ms. (166 steps per ms) remains 66/66 properties
Interrupted probabilistic random walk after 126329 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :0 out of 66
Probabilistic random walk after 126329 steps, saw 63496 distinct states, run finished after 3001 ms. (steps per millisecond=42 ) properties seen :0
// Phase 1: matrix 563 rows 600 cols
[2024-05-31 22:29:49] [INFO ] Invariants computation overflowed in 80 ms
[2024-05-31 22:29:49] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 319/427 variables, 108/108 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/427 variables, 3/111 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/427 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 605/1032 variables, 378/489 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1032 variables, 36/525 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1032 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (OVERLAPS) 130/1162 variables, 113/638 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1162 variables, 6/644 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1162 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 10 (OVERLAPS) 1/1163 variables, 1/645 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1163 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 12 (OVERLAPS) 0/1163 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1163/1163 variables, and 645 constraints, problems are : Problem set: 0 solved, 66 unsolved in 33359 ms.
Refiners :[State Equation: 600/600 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 319/427 variables, 108/108 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/427 variables, 3/111 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/427 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/427 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (OVERLAPS) 605/1032 variables, 378/491 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1032 variables, 36/527 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1032 variables, 63/590 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1032 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (OVERLAPS) 130/1162 variables, 113/703 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1162 variables, 6/709 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1162 variables, 1/710 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1162 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 13 (OVERLAPS) 1/1163 variables, 1/711 constraints. Problems are: Problem set: 0 solved, 66 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1163/1163 variables, and 711 constraints, problems are : Problem set: 0 solved, 66 unsolved in 75023 ms.
Refiners :[State Equation: 600/600 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints]
After SMT, in 108494ms problems are : Problem set: 0 solved, 66 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 108 out of 600 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 600/600 places, 563/563 transitions.
Applied a total of 0 rules in 20 ms. Remains 600 /600 variables (removed 0) and now considering 563/563 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 600/600 places, 563/563 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 600/600 places, 563/563 transitions.
Applied a total of 0 rules in 13 ms. Remains 600 /600 variables (removed 0) and now considering 563/563 (removed 0) transitions.
// Phase 1: matrix 563 rows 600 cols
[2024-05-31 22:31:38] [INFO ] Invariants computation overflowed in 47 ms
[2024-05-31 22:31:38] [INFO ] Implicit Places using invariants in 398 ms returned []
// Phase 1: matrix 563 rows 600 cols
[2024-05-31 22:31:38] [INFO ] Invariants computation overflowed in 56 ms
[2024-05-31 22:31:38] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-31 22:31:49] [INFO ] Implicit Places using invariants and state equation in 11341 ms returned [32, 60, 66, 87, 94, 119, 124, 148, 154, 179, 185, 210, 216, 243, 251, 261, 279, 284, 312, 318, 414, 421, 489, 522, 529, 554, 562, 566, 597]
[2024-05-31 22:31:49] [INFO ] Actually due to overlaps returned [261, 216, 529, 312, 414, 522, 185, 210, 318, 421]
Discarding 10 places :
Implicit Place search using SMT with State Equation took 11761 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 590/600 places, 563/563 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 590 transition count 561
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 588 transition count 561
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 588 transition count 561
Applied a total of 7 rules in 38 ms. Remains 588 /590 variables (removed 2) and now considering 561/563 (removed 2) transitions.
// Phase 1: matrix 561 rows 588 cols
[2024-05-31 22:31:50] [INFO ] Invariants computation overflowed in 48 ms
[2024-05-31 22:31:50] [INFO ] Implicit Places using invariants in 279 ms returned []
// Phase 1: matrix 561 rows 588 cols
[2024-05-31 22:31:50] [INFO ] Invariants computation overflowed in 55 ms
[2024-05-31 22:31:50] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-31 22:32:03] [INFO ] Implicit Places using invariants and state equation in 13263 ms returned [32, 60, 66, 87, 94, 119, 124, 148, 154, 179, 239, 247, 273, 278, 479, 542, 550, 554, 585]
[2024-05-31 22:32:03] [INFO ] Actually due to overlaps returned [554, 247, 550, 479, 239, 542]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 13544 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 582/600 places, 561/563 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 582 transition count 560
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 581 transition count 560
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 5 place count 581 transition count 560
Applied a total of 5 rules in 35 ms. Remains 581 /582 variables (removed 1) and now considering 560/561 (removed 1) transitions.
// Phase 1: matrix 560 rows 581 cols
[2024-05-31 22:32:03] [INFO ] Invariants computation overflowed in 45 ms
[2024-05-31 22:32:03] [INFO ] Implicit Places using invariants in 244 ms returned []
// Phase 1: matrix 560 rows 581 cols
[2024-05-31 22:32:03] [INFO ] Invariants computation overflowed in 45 ms
[2024-05-31 22:32:04] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-31 22:32:22] [INFO ] Implicit Places using invariants and state equation in 18731 ms returned [32, 60, 66, 87, 94, 119, 124, 148, 154, 179, 271, 276, 578]
[2024-05-31 22:32:22] [INFO ] Actually due to overlaps returned [66, 60, 271, 578, 276]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 18983 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 576/600 places, 560/563 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 576 transition count 559
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 575 transition count 559
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 575 transition count 559
Applied a total of 3 rules in 37 ms. Remains 575 /576 variables (removed 1) and now considering 559/560 (removed 1) transitions.
// Phase 1: matrix 559 rows 575 cols
[2024-05-31 22:32:22] [INFO ] Invariants computation overflowed in 46 ms
[2024-05-31 22:32:22] [INFO ] Implicit Places using invariants in 241 ms returned []
// Phase 1: matrix 559 rows 575 cols
[2024-05-31 22:32:22] [INFO ] Invariants computation overflowed in 38 ms
[2024-05-31 22:32:23] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-31 22:32:50] [INFO ] Implicit Places using invariants and state equation in 27532 ms returned [32, 84, 91, 116, 121, 145, 151, 176]
[2024-05-31 22:32:50] [INFO ] Actually due to overlaps returned [91, 84, 32]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 27781 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 572/600 places, 559/563 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 572 transition count 558
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 571 transition count 558
Applied a total of 2 rules in 28 ms. Remains 571 /572 variables (removed 1) and now considering 558/559 (removed 1) transitions.
// Phase 1: matrix 558 rows 571 cols
[2024-05-31 22:32:50] [INFO ] Invariants computation overflowed in 47 ms
[2024-05-31 22:32:50] [INFO ] Implicit Places using invariants in 249 ms returned []
// Phase 1: matrix 558 rows 571 cols
[2024-05-31 22:32:50] [INFO ] Invariants computation overflowed in 39 ms
[2024-05-31 22:32:50] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-31 22:33:21] [INFO ] Performed 5/571 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 22:33:27] [INFO ] Implicit Places using invariants and state equation in 36988 ms returned [112, 117, 141, 147, 172]
[2024-05-31 22:33:27] [INFO ] Actually due to overlaps returned [117, 112]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 37257 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 569/600 places, 558/563 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 569 transition count 557
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 568 transition count 557
Applied a total of 2 rules in 22 ms. Remains 568 /569 variables (removed 1) and now considering 557/558 (removed 1) transitions.
// Phase 1: matrix 557 rows 568 cols
[2024-05-31 22:33:27] [INFO ] Invariants computation overflowed in 34 ms
[2024-05-31 22:33:28] [INFO ] Implicit Places using invariants in 382 ms returned []
// Phase 1: matrix 557 rows 568 cols
[2024-05-31 22:33:28] [INFO ] Invariants computation overflowed in 32 ms
[2024-05-31 22:33:28] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-31 22:33:36] [INFO ] Implicit Places using invariants and state equation in 8221 ms returned [138, 144, 169]
[2024-05-31 22:33:36] [INFO ] Actually due to overlaps returned [138, 144]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 8611 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 566/600 places, 557/563 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 566 transition count 556
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 565 transition count 556
Applied a total of 2 rules in 21 ms. Remains 565 /566 variables (removed 1) and now considering 556/557 (removed 1) transitions.
// Phase 1: matrix 556 rows 565 cols
[2024-05-31 22:33:36] [INFO ] Invariants computation overflowed in 36 ms
[2024-05-31 22:33:36] [INFO ] Implicit Places using invariants in 296 ms returned []
// Phase 1: matrix 556 rows 565 cols
[2024-05-31 22:33:36] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-31 22:33:36] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-31 22:33:45] [INFO ] Implicit Places using invariants and state equation in 9118 ms returned [166]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 9430 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 564/600 places, 556/563 transitions.
Applied a total of 0 rules in 10 ms. Remains 564 /564 variables (removed 0) and now considering 556/556 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 8 iterations and 127581 ms. Remains : 564/600 places, 556/563 transitions.
Successfully simplified 14 atomic propositions for a total of 16 simplifications.
FORMULA DoubleExponent-PT-020-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-31 22:33:45] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-31 22:33:45] [INFO ] Flatten gal took : 40 ms
[2024-05-31 22:33:45] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA DoubleExponent-PT-020-CTLCardinality-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-020-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-31 22:33:45] [INFO ] Flatten gal took : 40 ms
[2024-05-31 22:33:45] [INFO ] Input system was already deterministic with 998 transitions.
Support contains 90 out of 1059 places (down from 99) after GAL structural reductions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 1808 edges and 1059 vertex of which 1057 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.10 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 1059/1059 places, 998/998 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 241 place count 1058 transition count 756
Reduce places removed 241 places and 0 transitions.
Iterating post reduction 1 with 241 rules applied. Total rules applied 482 place count 817 transition count 756
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 482 place count 817 transition count 716
Deduced a syphon composed of 40 places in 7 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 562 place count 777 transition count 716
Performed 141 Post agglomeration using F-continuation condition.Transition count delta: 141
Deduced a syphon composed of 141 places in 3 ms
Reduce places removed 141 places and 0 transitions.
Iterating global reduction 2 with 282 rules applied. Total rules applied 844 place count 636 transition count 575
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 845 place count 635 transition count 574
Applied a total of 845 rules in 89 ms. Remains 635 /1059 variables (removed 424) and now considering 574/998 (removed 424) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 89 ms. Remains : 635/1059 places, 574/998 transitions.
[2024-05-31 22:33:46] [INFO ] Flatten gal took : 22 ms
[2024-05-31 22:33:46] [INFO ] Flatten gal took : 22 ms
[2024-05-31 22:33:46] [INFO ] Input system was already deterministic with 574 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1059/1059 places, 998/998 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 241 place count 1058 transition count 756
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 483 place count 817 transition count 755
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 484 place count 816 transition count 755
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 484 place count 816 transition count 715
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 564 place count 776 transition count 715
Performed 141 Post agglomeration using F-continuation condition.Transition count delta: 141
Deduced a syphon composed of 141 places in 3 ms
Reduce places removed 141 places and 0 transitions.
Iterating global reduction 3 with 282 rules applied. Total rules applied 846 place count 635 transition count 574
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 847 place count 635 transition count 574
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 848 place count 634 transition count 573
Applied a total of 848 rules in 92 ms. Remains 634 /1059 variables (removed 425) and now considering 573/998 (removed 425) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 92 ms. Remains : 634/1059 places, 573/998 transitions.
[2024-05-31 22:33:46] [INFO ] Flatten gal took : 23 ms
[2024-05-31 22:33:46] [INFO ] Flatten gal took : 22 ms
[2024-05-31 22:33:46] [INFO ] Input system was already deterministic with 573 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1059/1059 places, 998/998 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 241 place count 1058 transition count 756
Reduce places removed 241 places and 0 transitions.
Iterating post reduction 1 with 241 rules applied. Total rules applied 482 place count 817 transition count 756
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 39 Pre rules applied. Total rules applied 482 place count 817 transition count 717
Deduced a syphon composed of 39 places in 7 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 560 place count 778 transition count 717
Performed 141 Post agglomeration using F-continuation condition.Transition count delta: 141
Deduced a syphon composed of 141 places in 3 ms
Reduce places removed 141 places and 0 transitions.
Iterating global reduction 2 with 282 rules applied. Total rules applied 842 place count 637 transition count 576
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 843 place count 636 transition count 575
Applied a total of 843 rules in 69 ms. Remains 636 /1059 variables (removed 423) and now considering 575/998 (removed 423) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 70 ms. Remains : 636/1059 places, 575/998 transitions.
[2024-05-31 22:33:46] [INFO ] Flatten gal took : 20 ms
[2024-05-31 22:33:46] [INFO ] Flatten gal took : 20 ms
[2024-05-31 22:33:46] [INFO ] Input system was already deterministic with 575 transitions.
RANDOM walk for 40000 steps (4124 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (2707 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 485993 steps, run timeout after 3001 ms. (steps per millisecond=161 ) properties seen :0 out of 1
Probabilistic random walk after 485993 steps, saw 243059 distinct states, run finished after 3001 ms. (steps per millisecond=161 ) properties seen :0
// Phase 1: matrix 575 rows 636 cols
[2024-05-31 22:33:49] [INFO ] Invariants computation overflowed in 66 ms
[2024-05-31 22:33:49] [INFO ] State equation strengthened by 37 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/30 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 58/88 variables, 27/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 98/186 variables, 48/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 118/304 variables, 61/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/304 variables, 4/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/304 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 122/426 variables, 64/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/426 variables, 4/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/426 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 120/546 variables, 64/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/546 variables, 4/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/546 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 101/647 variables, 57/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/647 variables, 5/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/647 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 71/718 variables, 39/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/718 variables, 3/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/718 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 62/780 variables, 33/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/780 variables, 2/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/780 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 61/841 variables, 32/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/841 variables, 2/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/841 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 61/902 variables, 32/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/902 variables, 2/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/902 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 61/963 variables, 32/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/963 variables, 2/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/963 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 61/1024 variables, 32/562 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1024 variables, 2/564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1024 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 61/1085 variables, 32/596 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1085 variables, 2/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1085 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 60/1145 variables, 32/630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1145 variables, 2/632 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1145 variables, 0/632 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 46/1191 variables, 26/658 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1191 variables, 1/659 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1191 variables, 0/659 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (OVERLAPS) 19/1210 variables, 13/672 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1210 variables, 0/672 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (OVERLAPS) 1/1211 variables, 1/673 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1211 variables, 0/673 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (OVERLAPS) 0/1211 variables, 0/673 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1211/1211 variables, and 673 constraints, problems are : Problem set: 0 solved, 1 unsolved in 488 ms.
Refiners :[State Equation: 636/636 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/30 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 58/88 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/88 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 98/186 variables, 48/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/186 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 118/304 variables, 61/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/304 variables, 4/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/304 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 122/426 variables, 64/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/426 variables, 4/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/426 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 120/546 variables, 64/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/546 variables, 4/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/546 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 101/647 variables, 57/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/647 variables, 5/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/647 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 71/718 variables, 39/391 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/718 variables, 3/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/718 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 62/780 variables, 33/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/780 variables, 2/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/780 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 61/841 variables, 32/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/841 variables, 2/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/841 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 61/902 variables, 32/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/902 variables, 2/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/902 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 61/963 variables, 32/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/963 variables, 2/531 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/963 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 61/1024 variables, 32/563 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1024 variables, 2/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1024 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 61/1085 variables, 32/597 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1085 variables, 2/599 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1085 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 60/1145 variables, 32/631 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1145 variables, 2/633 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1145 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (OVERLAPS) 46/1191 variables, 26/659 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1191 variables, 1/660 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:33:53] [INFO ] Deduced a trap composed of 62 places in 115 ms of which 13 ms to minimize.
[2024-05-31 22:33:53] [INFO ] Deduced a trap composed of 60 places in 109 ms of which 2 ms to minimize.
[2024-05-31 22:33:53] [INFO ] Deduced a trap composed of 60 places in 93 ms of which 2 ms to minimize.
[2024-05-31 22:33:53] [INFO ] Deduced a trap composed of 55 places in 131 ms of which 2 ms to minimize.
[2024-05-31 22:33:53] [INFO ] Deduced a trap composed of 56 places in 142 ms of which 4 ms to minimize.
[2024-05-31 22:33:54] [INFO ] Deduced a trap composed of 52 places in 295 ms of which 15 ms to minimize.
[2024-05-31 22:33:54] [INFO ] Deduced a trap composed of 47 places in 145 ms of which 3 ms to minimize.
[2024-05-31 22:33:54] [INFO ] Deduced a trap composed of 47 places in 128 ms of which 2 ms to minimize.
[2024-05-31 22:33:54] [INFO ] Deduced a trap composed of 48 places in 101 ms of which 2 ms to minimize.
[2024-05-31 22:33:54] [INFO ] Deduced a trap composed of 44 places in 105 ms of which 2 ms to minimize.
[2024-05-31 22:33:54] [INFO ] Deduced a trap composed of 43 places in 102 ms of which 2 ms to minimize.
[2024-05-31 22:33:55] [INFO ] Deduced a trap composed of 40 places in 113 ms of which 2 ms to minimize.
SMT process timed out in 5596ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 636 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 636/636 places, 575/575 transitions.
Graph (complete) has 1595 edges and 636 vertex of which 634 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 633 transition count 573
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 633 transition count 572
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 632 transition count 572
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 3 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 1 with 84 rules applied. Total rules applied 90 place count 590 transition count 530
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 1 with 74 rules applied. Total rules applied 164 place count 553 transition count 530
Free-agglomeration rule (complex) applied 78 times.
Iterating global reduction 1 with 78 rules applied. Total rules applied 242 place count 553 transition count 452
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 320 place count 475 transition count 452
Partial Free-agglomeration rule applied 78 times.
Drop transitions (Partial Free agglomeration) removed 78 transitions
Iterating global reduction 2 with 78 rules applied. Total rules applied 398 place count 475 transition count 452
Applied a total of 398 rules in 71 ms. Remains 475 /636 variables (removed 161) and now considering 452/575 (removed 123) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 475/636 places, 452/575 transitions.
RANDOM walk for 4000000 steps (509219 resets) in 5355 ms. (746 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000000 steps (337080 resets) in 3167 ms. (1262 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1006341 steps, run timeout after 6001 ms. (steps per millisecond=167 ) properties seen :0 out of 1
Probabilistic random walk after 1006341 steps, saw 503498 distinct states, run finished after 6001 ms. (steps per millisecond=167 ) properties seen :0
// Phase 1: matrix 452 rows 475 cols
[2024-05-31 22:34:03] [INFO ] Invariants computation overflowed in 36 ms
[2024-05-31 22:34:03] [INFO ] State equation strengthened by 78 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/29 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 191/220 variables, 47/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 6/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/220 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 522/742 variables, 267/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/742 variables, 43/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/742 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 185/927 variables, 151/524 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/927 variables, 29/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/927 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/927 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 927/927 variables, and 553 constraints, problems are : Problem set: 0 solved, 1 unsolved in 616 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/29 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 191/220 variables, 47/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 6/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/220 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/220 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 522/742 variables, 267/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/742 variables, 43/374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/742 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 185/927 variables, 151/525 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/927 variables, 29/554 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:34:05] [INFO ] Deduced a trap composed of 48 places in 99 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/927 variables, 1/555 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/927 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/927 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 927/927 variables, and 555 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1130 ms.
Refiners :[State Equation: 475/475 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1811ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 30007 ms.
Support contains 2 out of 475 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 452/452 transitions.
Applied a total of 0 rules in 11 ms. Remains 475 /475 variables (removed 0) and now considering 452/452 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 475/475 places, 452/452 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 452/452 transitions.
Applied a total of 0 rules in 10 ms. Remains 475 /475 variables (removed 0) and now considering 452/452 (removed 0) transitions.
// Phase 1: matrix 452 rows 475 cols
[2024-05-31 22:34:35] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-31 22:34:35] [INFO ] Implicit Places using invariants in 615 ms returned []
// Phase 1: matrix 452 rows 475 cols
[2024-05-31 22:34:35] [INFO ] Invariants computation overflowed in 31 ms
[2024-05-31 22:34:36] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 22:34:49] [INFO ] Implicit Places using invariants and state equation in 14071 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 146, 151, 152, 172, 177, 198, 204, 211, 225, 230, 253, 259, 281, 286, 306, 311, 332, 337, 358, 366, 387, 389, 393, 413, 419, 441, 446, 450, 467, 473]
[2024-05-31 22:34:49] [INFO ] Actually due to overlaps returned [211, 151]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 14698 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 473/475 places, 452/452 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 451
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 451
Applied a total of 2 rules in 23 ms. Remains 472 /473 variables (removed 1) and now considering 451/452 (removed 1) transitions.
// Phase 1: matrix 451 rows 472 cols
[2024-05-31 22:34:50] [INFO ] Invariants computation overflowed in 66 ms
[2024-05-31 22:34:50] [INFO ] Implicit Places using invariants in 506 ms returned []
// Phase 1: matrix 451 rows 472 cols
[2024-05-31 22:34:50] [INFO ] Invariants computation overflowed in 41 ms
[2024-05-31 22:34:50] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 22:35:04] [INFO ] Implicit Places using invariants and state equation in 13954 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 146, 151, 171, 176, 197, 203, 222, 227, 250, 256, 278, 283, 303, 308, 329, 334, 355, 363, 384, 386, 390, 410, 416, 438, 443, 447, 464, 470]
[2024-05-31 22:35:04] [INFO ] Actually due to overlaps returned [447, 386]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 14476 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 470/475 places, 451/452 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 450
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 450
Applied a total of 2 rules in 20 ms. Remains 469 /470 variables (removed 1) and now considering 450/451 (removed 1) transitions.
// Phase 1: matrix 450 rows 469 cols
[2024-05-31 22:35:04] [INFO ] Computed 95 invariants in 82 ms
[2024-05-31 22:35:05] [INFO ] Implicit Places using invariants in 1271 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 146, 151, 171, 176, 197, 203, 222, 227, 250, 256, 278, 283, 303, 308, 329, 334, 355, 363, 384, 389, 409, 415, 437, 442, 461, 467]
[2024-05-31 22:35:05] [INFO ] Actually due to overlaps returned [48, 42]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1288 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 467/475 places, 450/452 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 449
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 449
Applied a total of 2 rules in 34 ms. Remains 466 /467 variables (removed 1) and now considering 449/450 (removed 1) transitions.
// Phase 1: matrix 449 rows 466 cols
[2024-05-31 22:35:05] [INFO ] Invariants computation overflowed in 71 ms
[2024-05-31 22:35:06] [INFO ] Implicit Places using invariants in 510 ms returned []
// Phase 1: matrix 449 rows 466 cols
[2024-05-31 22:35:06] [INFO ] Invariants computation overflowed in 25 ms
[2024-05-31 22:35:06] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 22:35:15] [INFO ] Implicit Places using invariants and state equation in 8996 ms returned [65, 70, 91, 96, 116, 122, 143, 148, 168, 173, 194, 200, 219, 224, 247, 253, 275, 280, 300, 305, 326, 331, 352, 360, 381, 386, 406, 412, 434, 439, 458, 464]
[2024-05-31 22:35:15] [INFO ] Actually due to overlaps returned [70, 65]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 9509 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 464/475 places, 449/452 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 448
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 448
Applied a total of 2 rules in 19 ms. Remains 463 /464 variables (removed 1) and now considering 448/449 (removed 1) transitions.
// Phase 1: matrix 448 rows 463 cols
[2024-05-31 22:35:15] [INFO ] Invariants computation overflowed in 27 ms
[2024-05-31 22:35:15] [INFO ] Implicit Places using invariants in 624 ms returned []
// Phase 1: matrix 448 rows 463 cols
[2024-05-31 22:35:15] [INFO ] Invariants computation overflowed in 27 ms
[2024-05-31 22:35:16] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 22:35:33] [INFO ] Implicit Places using invariants and state equation in 17852 ms returned [88, 93, 113, 119, 140, 145, 165, 170, 191, 197, 216, 221, 244, 250, 272, 277, 297, 302, 323, 328, 349, 357, 378, 383, 403, 409, 431, 436, 455, 461]
[2024-05-31 22:35:33] [INFO ] Actually due to overlaps returned [93, 88]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 18498 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 461/475 places, 448/452 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 447
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 447
Applied a total of 2 rules in 17 ms. Remains 460 /461 variables (removed 1) and now considering 447/448 (removed 1) transitions.
// Phase 1: matrix 447 rows 460 cols
[2024-05-31 22:35:33] [INFO ] Invariants computation overflowed in 27 ms
[2024-05-31 22:35:34] [INFO ] Implicit Places using invariants in 431 ms returned []
// Phase 1: matrix 447 rows 460 cols
[2024-05-31 22:35:34] [INFO ] Invariants computation overflowed in 29 ms
[2024-05-31 22:35:34] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 22:35:44] [INFO ] Implicit Places using invariants and state equation in 10662 ms returned [110, 116, 137, 142, 162, 167, 188, 194, 213, 218, 241, 247, 269, 274, 294, 299, 320, 325, 346, 354, 375, 380, 400, 406, 428, 433, 452, 458]
[2024-05-31 22:35:44] [INFO ] Actually due to overlaps returned [116, 110]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 11107 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 458/475 places, 447/452 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 446
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 446
Applied a total of 2 rules in 23 ms. Remains 457 /458 variables (removed 1) and now considering 446/447 (removed 1) transitions.
// Phase 1: matrix 446 rows 457 cols
[2024-05-31 22:35:44] [INFO ] Invariants computation overflowed in 26 ms
[2024-05-31 22:35:45] [INFO ] Implicit Places using invariants in 370 ms returned []
// Phase 1: matrix 446 rows 457 cols
[2024-05-31 22:35:45] [INFO ] Invariants computation overflowed in 25 ms
[2024-05-31 22:35:45] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 22:35:57] [INFO ] Implicit Places using invariants and state equation in 12169 ms returned [134, 139, 159, 164, 185, 191, 210, 215, 238, 244, 266, 271, 291, 296, 317, 322, 343, 351, 372, 377, 397, 403, 425, 430, 449, 455]
[2024-05-31 22:35:57] [INFO ] Actually due to overlaps returned [139, 134]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 12543 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 455/475 places, 446/452 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 445
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 445
Applied a total of 2 rules in 21 ms. Remains 454 /455 variables (removed 1) and now considering 445/446 (removed 1) transitions.
// Phase 1: matrix 445 rows 454 cols
[2024-05-31 22:35:57] [INFO ] Invariants computation overflowed in 31 ms
[2024-05-31 22:35:57] [INFO ] Implicit Places using invariants in 359 ms returned []
// Phase 1: matrix 445 rows 454 cols
[2024-05-31 22:35:57] [INFO ] Invariants computation overflowed in 26 ms
[2024-05-31 22:35:58] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 22:36:12] [INFO ] Implicit Places using invariants and state equation in 14126 ms returned [156, 161, 182, 188, 207, 212, 235, 241, 263, 268, 288, 293, 314, 319, 340, 348, 369, 374, 394, 400, 422, 427, 446, 452]
[2024-05-31 22:36:12] [INFO ] Actually due to overlaps returned [161, 156]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 14501 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 452/475 places, 445/452 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 444
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 444
Applied a total of 2 rules in 18 ms. Remains 451 /452 variables (removed 1) and now considering 444/445 (removed 1) transitions.
// Phase 1: matrix 444 rows 451 cols
[2024-05-31 22:36:12] [INFO ] Invariants computation overflowed in 39 ms
[2024-05-31 22:36:12] [INFO ] Implicit Places using invariants in 372 ms returned []
// Phase 1: matrix 444 rows 451 cols
[2024-05-31 22:36:12] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-31 22:36:12] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 22:36:44] [INFO ] Performed 3/451 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-05-31 22:36:52] [INFO ] Implicit Places using invariants and state equation in 40471 ms returned [179, 185, 204, 209, 232, 238, 260, 265, 285, 290, 311, 316, 337, 345, 366, 371, 391, 397, 419, 424, 443, 449]
[2024-05-31 22:36:52] [INFO ] Actually due to overlaps returned [185, 179]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 40865 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 449/475 places, 444/452 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 443
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 443
Applied a total of 2 rules in 17 ms. Remains 448 /449 variables (removed 1) and now considering 443/444 (removed 1) transitions.
// Phase 1: matrix 443 rows 448 cols
[2024-05-31 22:36:52] [INFO ] Invariants computation overflowed in 30 ms
[2024-05-31 22:36:53] [INFO ] Implicit Places using invariants in 339 ms returned []
// Phase 1: matrix 443 rows 448 cols
[2024-05-31 22:36:53] [INFO ] Invariants computation overflowed in 25 ms
[2024-05-31 22:36:53] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 22:36:59] [INFO ] Implicit Places using invariants and state equation in 6567 ms returned [201, 206, 229, 235, 257, 262, 282, 287, 308, 313, 334, 342, 363, 368, 388, 394, 416, 421, 440, 446]
[2024-05-31 22:36:59] [INFO ] Actually due to overlaps returned [206, 201]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 6908 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 10 : 446/475 places, 443/452 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 442
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 442
Applied a total of 2 rules in 15 ms. Remains 445 /446 variables (removed 1) and now considering 442/443 (removed 1) transitions.
// Phase 1: matrix 442 rows 445 cols
[2024-05-31 22:36:59] [INFO ] Invariants computation overflowed in 32 ms
[2024-05-31 22:37:00] [INFO ] Implicit Places using invariants in 350 ms returned []
// Phase 1: matrix 442 rows 445 cols
[2024-05-31 22:37:00] [INFO ] Invariants computation overflowed in 27 ms
[2024-05-31 22:37:00] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 22:37:18] [INFO ] Implicit Places using invariants and state equation in 17968 ms returned [226, 232, 254, 259, 279, 284, 305, 310, 331, 339, 360, 365, 385, 391, 413, 418, 437, 443]
[2024-05-31 22:37:18] [INFO ] Actually due to overlaps returned [232, 226]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 18325 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 11 : 443/475 places, 442/452 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 441
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 441
Applied a total of 2 rules in 20 ms. Remains 442 /443 variables (removed 1) and now considering 441/442 (removed 1) transitions.
// Phase 1: matrix 441 rows 442 cols
[2024-05-31 22:37:18] [INFO ] Invariants computation overflowed in 46 ms
[2024-05-31 22:37:18] [INFO ] Implicit Places using invariants in 361 ms returned []
// Phase 1: matrix 441 rows 442 cols
[2024-05-31 22:37:18] [INFO ] Invariants computation overflowed in 44 ms
[2024-05-31 22:37:18] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 22:37:24] [INFO ] Implicit Places using invariants and state equation in 5703 ms returned [251, 256, 276, 281, 302, 307, 328, 336, 357, 362, 382, 388, 410, 415, 434, 440]
[2024-05-31 22:37:24] [INFO ] Actually due to overlaps returned [256, 251]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 6069 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 12 : 440/475 places, 441/452 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 440
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 440
Applied a total of 2 rules in 18 ms. Remains 439 /440 variables (removed 1) and now considering 440/441 (removed 1) transitions.
// Phase 1: matrix 440 rows 439 cols
[2024-05-31 22:37:24] [INFO ] Computed 75 invariants in 47 ms
[2024-05-31 22:37:24] [INFO ] Implicit Places using invariants in 588 ms returned [273, 278, 299, 304, 325, 333, 354, 359, 379, 385, 407, 412, 431, 437]
[2024-05-31 22:37:24] [INFO ] Actually due to overlaps returned [278, 273]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 590 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 13 : 437/475 places, 440/452 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 439
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 439
Applied a total of 2 rules in 16 ms. Remains 436 /437 variables (removed 1) and now considering 439/440 (removed 1) transitions.
// Phase 1: matrix 439 rows 436 cols
[2024-05-31 22:37:24] [INFO ] Invariants computation overflowed in 40 ms
[2024-05-31 22:37:25] [INFO ] Implicit Places using invariants in 333 ms returned []
// Phase 1: matrix 439 rows 436 cols
[2024-05-31 22:37:25] [INFO ] Invariants computation overflowed in 49 ms
[2024-05-31 22:37:25] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 22:37:34] [INFO ] Implicit Places using invariants and state equation in 9628 ms returned [296, 301, 322, 330, 351, 356, 376, 382, 404, 409, 428, 434]
[2024-05-31 22:37:34] [INFO ] Actually due to overlaps returned [301, 296]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 9963 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 14 : 434/475 places, 439/452 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 438
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 438
Applied a total of 2 rules in 15 ms. Remains 433 /434 variables (removed 1) and now considering 438/439 (removed 1) transitions.
// Phase 1: matrix 438 rows 433 cols
[2024-05-31 22:37:34] [INFO ] Invariants computation overflowed in 49 ms
[2024-05-31 22:37:35] [INFO ] Implicit Places using invariants in 326 ms returned []
// Phase 1: matrix 438 rows 433 cols
[2024-05-31 22:37:35] [INFO ] Invariants computation overflowed in 43 ms
[2024-05-31 22:37:35] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 22:37:42] [INFO ] Implicit Places using invariants and state equation in 7068 ms returned [319, 327, 348, 353, 373, 379, 401, 406, 425, 431]
[2024-05-31 22:37:42] [INFO ] Actually due to overlaps returned [327, 319]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 7406 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 15 : 431/475 places, 438/452 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 437
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 437
Applied a total of 2 rules in 14 ms. Remains 430 /431 variables (removed 1) and now considering 437/438 (removed 1) transitions.
// Phase 1: matrix 437 rows 430 cols
[2024-05-31 22:37:42] [INFO ] Computed 69 invariants in 50 ms
[2024-05-31 22:37:42] [INFO ] Implicit Places using invariants in 452 ms returned [345, 350, 370, 376, 398, 403, 422, 428]
[2024-05-31 22:37:42] [INFO ] Actually due to overlaps returned [350, 345]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 463 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 16 : 428/475 places, 437/452 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 436
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 436
Applied a total of 2 rules in 14 ms. Remains 427 /428 variables (removed 1) and now considering 436/437 (removed 1) transitions.
// Phase 1: matrix 436 rows 427 cols
[2024-05-31 22:37:42] [INFO ] Invariants computation overflowed in 43 ms
[2024-05-31 22:37:43] [INFO ] Implicit Places using invariants in 299 ms returned []
// Phase 1: matrix 436 rows 427 cols
[2024-05-31 22:37:43] [INFO ] Invariants computation overflowed in 38 ms
[2024-05-31 22:37:43] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 22:37:49] [INFO ] Implicit Places using invariants and state equation in 6462 ms returned [367, 373, 395, 400, 419, 425]
[2024-05-31 22:37:49] [INFO ] Actually due to overlaps returned [373, 367]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 6775 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 17 : 425/475 places, 436/452 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 435
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 435
Applied a total of 2 rules in 23 ms. Remains 424 /425 variables (removed 1) and now considering 435/436 (removed 1) transitions.
// Phase 1: matrix 435 rows 424 cols
[2024-05-31 22:37:49] [INFO ] Invariants computation overflowed in 38 ms
[2024-05-31 22:37:49] [INFO ] Implicit Places using invariants in 286 ms returned []
// Phase 1: matrix 435 rows 424 cols
[2024-05-31 22:37:49] [INFO ] Invariants computation overflowed in 38 ms
[2024-05-31 22:37:50] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 22:37:58] [INFO ] Implicit Places using invariants and state equation in 8278 ms returned [392, 397, 416, 422]
[2024-05-31 22:37:58] [INFO ] Actually due to overlaps returned [397, 392]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 8583 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 18 : 422/475 places, 435/452 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 434
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 434
Applied a total of 2 rules in 18 ms. Remains 421 /422 variables (removed 1) and now considering 434/435 (removed 1) transitions.
// Phase 1: matrix 434 rows 421 cols
[2024-05-31 22:37:58] [INFO ] Invariants computation overflowed in 39 ms
[2024-05-31 22:37:58] [INFO ] Implicit Places using invariants in 284 ms returned []
// Phase 1: matrix 434 rows 421 cols
[2024-05-31 22:37:58] [INFO ] Invariants computation overflowed in 39 ms
[2024-05-31 22:37:58] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 22:38:06] [INFO ] Implicit Places using invariants and state equation in 8302 ms returned [413, 419]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 8607 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 19 : 419/475 places, 434/452 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 433
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 433
Applied a total of 2 rules in 20 ms. Remains 418 /419 variables (removed 1) and now considering 433/434 (removed 1) transitions.
// Phase 1: matrix 433 rows 418 cols
[2024-05-31 22:38:06] [INFO ] Invariants computation overflowed in 39 ms
[2024-05-31 22:38:07] [INFO ] Implicit Places using invariants in 282 ms returned []
// Phase 1: matrix 433 rows 418 cols
[2024-05-31 22:38:07] [INFO ] Invariants computation overflowed in 40 ms
[2024-05-31 22:38:07] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 22:38:12] [INFO ] Implicit Places using invariants and state equation in 5714 ms returned []
Implicit Place search using SMT with State Equation took 6032 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 20 : 418/475 places, 433/452 transitions.
Finished structural reductions in REACHABILITY mode , in 20 iterations and 217587 ms. Remains : 418/475 places, 433/452 transitions.
RANDOM walk for 4000000 steps (571360 resets) in 5769 ms. (693 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000002 steps (363458 resets) in 3507 ms. (1140 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1083668 steps, run timeout after 6001 ms. (steps per millisecond=180 ) properties seen :0 out of 1
Probabilistic random walk after 1083668 steps, saw 541949 distinct states, run finished after 6001 ms. (steps per millisecond=180 ) properties seen :0
// Phase 1: matrix 433 rows 418 cols
[2024-05-31 22:38:21] [INFO ] Invariants computation overflowed in 47 ms
[2024-05-31 22:38:21] [INFO ] State equation strengthened by 78 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/30 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 161/191 variables, 33/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 6/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 440/631 variables, 201/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/631 variables, 43/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/631 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 220/851 variables, 174/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/851 variables, 29/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/851 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/851 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 851/851 variables, and 496 constraints, problems are : Problem set: 0 solved, 1 unsolved in 386 ms.
Refiners :[State Equation: 418/418 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/30 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 161/191 variables, 33/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 6/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 440/631 variables, 201/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/631 variables, 43/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/631 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 220/851 variables, 174/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/851 variables, 29/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:38:25] [INFO ] Deduced a trap composed of 42 places in 163 ms of which 3 ms to minimize.
[2024-05-31 22:38:25] [INFO ] Deduced a trap composed of 45 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:38:25] [INFO ] Deduced a trap composed of 48 places in 162 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/851 variables, 3/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/851 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/851 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 851/851 variables, and 500 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4023 ms.
Refiners :[State Equation: 418/418 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 4464ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 30001 ms.
Support contains 2 out of 418 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 418/418 places, 433/433 transitions.
Applied a total of 0 rules in 8 ms. Remains 418 /418 variables (removed 0) and now considering 433/433 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 418/418 places, 433/433 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 418/418 places, 433/433 transitions.
Applied a total of 0 rules in 8 ms. Remains 418 /418 variables (removed 0) and now considering 433/433 (removed 0) transitions.
// Phase 1: matrix 433 rows 418 cols
[2024-05-31 22:38:55] [INFO ] Invariants computation overflowed in 47 ms
[2024-05-31 22:38:56] [INFO ] Implicit Places using invariants in 301 ms returned []
// Phase 1: matrix 433 rows 418 cols
[2024-05-31 22:38:56] [INFO ] Invariants computation overflowed in 40 ms
[2024-05-31 22:38:56] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 22:39:01] [INFO ] Implicit Places using invariants and state equation in 5687 ms returned []
Implicit Place search using SMT with State Equation took 5991 ms to find 0 implicit places.
[2024-05-31 22:39:01] [INFO ] Redundant transitions in 30 ms returned []
Running 432 sub problems to find dead transitions.
// Phase 1: matrix 433 rows 418 cols
[2024-05-31 22:39:01] [INFO ] Invariants computation overflowed in 48 ms
[2024-05-31 22:39:01] [INFO ] State equation strengthened by 78 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/417 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 1 (OVERLAPS) 433/850 variables, 417/417 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/850 variables, 78/495 constraints. Problems are: Problem set: 0 solved, 432 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/850 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 4 (OVERLAPS) 1/851 variables, 1/496 constraints. Problems are: Problem set: 0 solved, 432 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 851/851 variables, and 496 constraints, problems are : Problem set: 0 solved, 432 unsolved in 30030 ms.
Refiners :[State Equation: 418/418 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 432/432 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 432 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/417 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 1 (OVERLAPS) 433/850 variables, 417/417 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/850 variables, 78/495 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/850 variables, 429/924 constraints. Problems are: Problem set: 0 solved, 432 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 850/851 variables, and 924 constraints, problems are : Problem set: 0 solved, 432 unsolved in 30027 ms.
Refiners :[State Equation: 417/418 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 429/432 constraints, Known Traps: 0/0 constraints]
After SMT, in 60559ms problems are : Problem set: 0 solved, 432 unsolved
Search for dead transitions found 0 dead transitions in 60566ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66606 ms. Remains : 418/418 places, 433/433 transitions.
RANDOM walk for 400000 steps (57104 resets) in 1347 ms. (296 steps per ms) remains 1/1 properties
Running SMT prover for 1 properties.
// Phase 1: matrix 433 rows 418 cols
[2024-05-31 22:40:02] [INFO ] Invariants computation overflowed in 52 ms
[2024-05-31 22:40:03] [INFO ] After 243ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-31 22:40:03] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 22:40:03] [INFO ] After 487ms SMT Verify possible using 78 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 22:40:03] [INFO ] After 528ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 22:40:03] [INFO ] After 856ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 22:40:04] [INFO ] After 323ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 22:40:05] [INFO ] After 1093ms SMT Verify possible using 78 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 22:40:05] [INFO ] Deduced a trap composed of 42 places in 179 ms of which 3 ms to minimize.
[2024-05-31 22:40:05] [INFO ] Deduced a trap composed of 126 places in 173 ms of which 2 ms to minimize.
[2024-05-31 22:40:05] [INFO ] Deduced a trap composed of 45 places in 177 ms of which 2 ms to minimize.
[2024-05-31 22:40:06] [INFO ] Deduced a trap composed of 132 places in 175 ms of which 3 ms to minimize.
[2024-05-31 22:40:06] [INFO ] Deduced a trap composed of 135 places in 160 ms of which 2 ms to minimize.
[2024-05-31 22:40:06] [INFO ] Deduced a trap composed of 24 places in 181 ms of which 3 ms to minimize.
[2024-05-31 22:40:06] [INFO ] Deduced a trap composed of 126 places in 175 ms of which 3 ms to minimize.
[2024-05-31 22:40:07] [INFO ] Deduced a trap composed of 133 places in 166 ms of which 2 ms to minimize.
[2024-05-31 22:40:07] [INFO ] Deduced a trap composed of 131 places in 180 ms of which 2 ms to minimize.
[2024-05-31 22:40:07] [INFO ] Deduced a trap composed of 131 places in 176 ms of which 3 ms to minimize.
[2024-05-31 22:40:07] [INFO ] Deduced a trap composed of 133 places in 172 ms of which 3 ms to minimize.
[2024-05-31 22:40:08] [INFO ] Deduced a trap composed of 25 places in 172 ms of which 3 ms to minimize.
[2024-05-31 22:40:08] [INFO ] Deduced a trap composed of 138 places in 173 ms of which 3 ms to minimize.
[2024-05-31 22:40:08] [INFO ] Deduced a trap composed of 133 places in 177 ms of which 2 ms to minimize.
[2024-05-31 22:40:09] [INFO ] Deduced a trap composed of 130 places in 180 ms of which 2 ms to minimize.
[2024-05-31 22:40:09] [INFO ] Deduced a trap composed of 123 places in 177 ms of which 3 ms to minimize.
[2024-05-31 22:40:09] [INFO ] Deduced a trap composed of 28 places in 172 ms of which 2 ms to minimize.
[2024-05-31 22:40:10] [INFO ] Deduced a trap composed of 138 places in 175 ms of which 4 ms to minimize.
[2024-05-31 22:40:10] [INFO ] Deduced a trap composed of 131 places in 163 ms of which 2 ms to minimize.
[2024-05-31 22:40:10] [INFO ] Deduced a trap composed of 129 places in 165 ms of which 2 ms to minimize.
[2024-05-31 22:40:10] [INFO ] Deduced a trap composed of 135 places in 163 ms of which 3 ms to minimize.
[2024-05-31 22:40:11] [INFO ] Deduced a trap composed of 136 places in 177 ms of which 2 ms to minimize.
[2024-05-31 22:40:11] [INFO ] Deduced a trap composed of 134 places in 169 ms of which 2 ms to minimize.
[2024-05-31 22:40:11] [INFO ] Deduced a trap composed of 131 places in 174 ms of which 3 ms to minimize.
[2024-05-31 22:40:11] [INFO ] Deduced a trap composed of 121 places in 164 ms of which 2 ms to minimize.
[2024-05-31 22:40:12] [INFO ] Deduced a trap composed of 134 places in 168 ms of which 2 ms to minimize.
[2024-05-31 22:40:12] [INFO ] Deduced a trap composed of 139 places in 181 ms of which 2 ms to minimize.
[2024-05-31 22:40:12] [INFO ] Deduced a trap composed of 125 places in 173 ms of which 2 ms to minimize.
[2024-05-31 22:40:12] [INFO ] Deduced a trap composed of 135 places in 180 ms of which 3 ms to minimize.
[2024-05-31 22:40:13] [INFO ] Deduced a trap composed of 132 places in 179 ms of which 2 ms to minimize.
[2024-05-31 22:40:13] [INFO ] Deduced a trap composed of 131 places in 175 ms of which 2 ms to minimize.
[2024-05-31 22:40:13] [INFO ] Deduced a trap composed of 31 places in 173 ms of which 2 ms to minimize.
[2024-05-31 22:40:13] [INFO ] Deduced a trap composed of 49 places in 161 ms of which 3 ms to minimize.
[2024-05-31 22:40:14] [INFO ] Deduced a trap composed of 81 places in 176 ms of which 3 ms to minimize.
[2024-05-31 22:40:14] [INFO ] Deduced a trap composed of 80 places in 181 ms of which 4 ms to minimize.
[2024-05-31 22:40:14] [INFO ] Deduced a trap composed of 81 places in 176 ms of which 3 ms to minimize.
[2024-05-31 22:40:14] [INFO ] Deduced a trap composed of 83 places in 172 ms of which 2 ms to minimize.
[2024-05-31 22:40:14] [INFO ] Deduced a trap composed of 43 places in 94 ms of which 2 ms to minimize.
[2024-05-31 22:40:15] [INFO ] Deduced a trap composed of 59 places in 90 ms of which 1 ms to minimize.
[2024-05-31 22:40:15] [INFO ] Deduced a trap composed of 53 places in 91 ms of which 3 ms to minimize.
[2024-05-31 22:40:15] [INFO ] Deduced a trap composed of 60 places in 86 ms of which 2 ms to minimize.
[2024-05-31 22:40:15] [INFO ] Deduced a trap composed of 46 places in 87 ms of which 2 ms to minimize.
[2024-05-31 22:40:15] [INFO ] Deduced a trap composed of 51 places in 88 ms of which 1 ms to minimize.
[2024-05-31 22:40:16] [INFO ] Deduced a trap composed of 57 places in 83 ms of which 2 ms to minimize.
[2024-05-31 22:40:16] [INFO ] Deduced a trap composed of 49 places in 74 ms of which 1 ms to minimize.
[2024-05-31 22:40:16] [INFO ] Deduced a trap composed of 69 places in 61 ms of which 1 ms to minimize.
[2024-05-31 22:40:16] [INFO ] Deduced a trap composed of 79 places in 63 ms of which 1 ms to minimize.
[2024-05-31 22:40:16] [INFO ] Deduced a trap composed of 55 places in 63 ms of which 2 ms to minimize.
[2024-05-31 22:40:17] [INFO ] Trap strengthening (SAT) tested/added 49/48 trap constraints in 11662 ms
TRAPS : Iteration 1
[2024-05-31 22:40:17] [INFO ] After 12982ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 22:40:17] [INFO ] After 13436ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
RANDOM walk for 4000000 steps (572131 resets) in 4447 ms. (899 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000002 steps (364155 resets) in 3035 ms. (1317 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1051553 steps, run timeout after 6001 ms. (steps per millisecond=175 ) properties seen :0 out of 1
Probabilistic random walk after 1051553 steps, saw 525881 distinct states, run finished after 6001 ms. (steps per millisecond=175 ) properties seen :0
// Phase 1: matrix 433 rows 418 cols
[2024-05-31 22:40:25] [INFO ] Invariants computation overflowed in 59 ms
[2024-05-31 22:40:25] [INFO ] State equation strengthened by 78 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/30 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 161/191 variables, 33/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 6/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 440/631 variables, 201/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/631 variables, 43/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/631 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 220/851 variables, 174/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/851 variables, 29/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/851 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/851 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 851/851 variables, and 496 constraints, problems are : Problem set: 0 solved, 1 unsolved in 364 ms.
Refiners :[State Equation: 418/418 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/30 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 161/191 variables, 33/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 6/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 440/631 variables, 201/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/631 variables, 43/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/631 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 220/851 variables, 174/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/851 variables, 29/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:40:29] [INFO ] Deduced a trap composed of 42 places in 168 ms of which 3 ms to minimize.
[2024-05-31 22:40:29] [INFO ] Deduced a trap composed of 45 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:40:29] [INFO ] Deduced a trap composed of 48 places in 70 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/851 variables, 3/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/851 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/851 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 851/851 variables, and 500 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3832 ms.
Refiners :[State Equation: 418/418 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 4271ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 30001 ms.
Support contains 2 out of 418 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 418/418 places, 433/433 transitions.
Applied a total of 0 rules in 7 ms. Remains 418 /418 variables (removed 0) and now considering 433/433 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 418/418 places, 433/433 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 418/418 places, 433/433 transitions.
Applied a total of 0 rules in 7 ms. Remains 418 /418 variables (removed 0) and now considering 433/433 (removed 0) transitions.
// Phase 1: matrix 433 rows 418 cols
[2024-05-31 22:40:59] [INFO ] Invariants computation overflowed in 51 ms
[2024-05-31 22:40:59] [INFO ] Implicit Places using invariants in 310 ms returned []
// Phase 1: matrix 433 rows 418 cols
[2024-05-31 22:40:59] [INFO ] Invariants computation overflowed in 40 ms
[2024-05-31 22:41:00] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 22:41:05] [INFO ] Implicit Places using invariants and state equation in 5727 ms returned []
Implicit Place search using SMT with State Equation took 6039 ms to find 0 implicit places.
[2024-05-31 22:41:05] [INFO ] Redundant transitions in 3 ms returned []
Running 432 sub problems to find dead transitions.
// Phase 1: matrix 433 rows 418 cols
[2024-05-31 22:41:05] [INFO ] Invariants computation overflowed in 44 ms
[2024-05-31 22:41:05] [INFO ] State equation strengthened by 78 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/417 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 1 (OVERLAPS) 433/850 variables, 417/417 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/850 variables, 78/495 constraints. Problems are: Problem set: 0 solved, 432 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/850 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 4 (OVERLAPS) 1/851 variables, 1/496 constraints. Problems are: Problem set: 0 solved, 432 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 851/851 variables, and 496 constraints, problems are : Problem set: 0 solved, 432 unsolved in 30022 ms.
Refiners :[State Equation: 418/418 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 432/432 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 432 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/417 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 1 (OVERLAPS) 433/850 variables, 417/417 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/850 variables, 78/495 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/850 variables, 429/924 constraints. Problems are: Problem set: 0 solved, 432 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 850/851 variables, and 924 constraints, problems are : Problem set: 0 solved, 432 unsolved in 30027 ms.
Refiners :[State Equation: 417/418 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 429/432 constraints, Known Traps: 0/0 constraints]
After SMT, in 60526ms problems are : Problem set: 0 solved, 432 unsolved
Search for dead transitions found 0 dead transitions in 60530ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66602 ms. Remains : 418/418 places, 433/433 transitions.
RANDOM walk for 400000 steps (57135 resets) in 564 ms. (707 steps per ms) remains 1/1 properties
Running SMT prover for 1 properties.
// Phase 1: matrix 433 rows 418 cols
[2024-05-31 22:42:06] [INFO ] Invariants computation overflowed in 43 ms
[2024-05-31 22:42:06] [INFO ] After 247ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-31 22:42:06] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 22:42:07] [INFO ] After 518ms SMT Verify possible using 78 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 22:42:07] [INFO ] After 559ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 22:42:07] [INFO ] After 873ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 22:42:07] [INFO ] After 301ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 22:42:08] [INFO ] After 1085ms SMT Verify possible using 78 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 22:42:08] [INFO ] Deduced a trap composed of 42 places in 183 ms of which 3 ms to minimize.
[2024-05-31 22:42:09] [INFO ] Deduced a trap composed of 126 places in 176 ms of which 2 ms to minimize.
[2024-05-31 22:42:09] [INFO ] Deduced a trap composed of 45 places in 175 ms of which 3 ms to minimize.
[2024-05-31 22:42:09] [INFO ] Deduced a trap composed of 132 places in 177 ms of which 3 ms to minimize.
[2024-05-31 22:42:09] [INFO ] Deduced a trap composed of 135 places in 154 ms of which 2 ms to minimize.
[2024-05-31 22:42:10] [INFO ] Deduced a trap composed of 24 places in 178 ms of which 3 ms to minimize.
[2024-05-31 22:42:10] [INFO ] Deduced a trap composed of 126 places in 175 ms of which 3 ms to minimize.
[2024-05-31 22:42:10] [INFO ] Deduced a trap composed of 133 places in 180 ms of which 2 ms to minimize.
[2024-05-31 22:42:10] [INFO ] Deduced a trap composed of 131 places in 172 ms of which 2 ms to minimize.
[2024-05-31 22:42:10] [INFO ] Deduced a trap composed of 131 places in 175 ms of which 3 ms to minimize.
[2024-05-31 22:42:11] [INFO ] Deduced a trap composed of 133 places in 178 ms of which 2 ms to minimize.
[2024-05-31 22:42:11] [INFO ] Deduced a trap composed of 25 places in 164 ms of which 3 ms to minimize.
[2024-05-31 22:42:11] [INFO ] Deduced a trap composed of 138 places in 177 ms of which 3 ms to minimize.
[2024-05-31 22:42:12] [INFO ] Deduced a trap composed of 133 places in 167 ms of which 2 ms to minimize.
[2024-05-31 22:42:12] [INFO ] Deduced a trap composed of 130 places in 176 ms of which 2 ms to minimize.
[2024-05-31 22:42:13] [INFO ] Deduced a trap composed of 123 places in 177 ms of which 3 ms to minimize.
[2024-05-31 22:42:13] [INFO ] Deduced a trap composed of 28 places in 178 ms of which 2 ms to minimize.
[2024-05-31 22:42:13] [INFO ] Deduced a trap composed of 138 places in 177 ms of which 2 ms to minimize.
[2024-05-31 22:42:14] [INFO ] Deduced a trap composed of 131 places in 178 ms of which 3 ms to minimize.
[2024-05-31 22:42:14] [INFO ] Deduced a trap composed of 129 places in 168 ms of which 2 ms to minimize.
[2024-05-31 22:42:14] [INFO ] Deduced a trap composed of 135 places in 177 ms of which 2 ms to minimize.
[2024-05-31 22:42:14] [INFO ] Deduced a trap composed of 136 places in 161 ms of which 2 ms to minimize.
[2024-05-31 22:42:14] [INFO ] Deduced a trap composed of 134 places in 156 ms of which 2 ms to minimize.
[2024-05-31 22:42:14] [INFO ] Deduced a trap composed of 131 places in 155 ms of which 2 ms to minimize.
[2024-05-31 22:42:15] [INFO ] Deduced a trap composed of 121 places in 157 ms of which 3 ms to minimize.
[2024-05-31 22:42:15] [INFO ] Deduced a trap composed of 134 places in 175 ms of which 2 ms to minimize.
[2024-05-31 22:42:15] [INFO ] Deduced a trap composed of 139 places in 174 ms of which 3 ms to minimize.
[2024-05-31 22:42:16] [INFO ] Deduced a trap composed of 125 places in 172 ms of which 3 ms to minimize.
[2024-05-31 22:42:16] [INFO ] Deduced a trap composed of 135 places in 160 ms of which 2 ms to minimize.
[2024-05-31 22:42:16] [INFO ] Deduced a trap composed of 132 places in 163 ms of which 2 ms to minimize.
[2024-05-31 22:42:16] [INFO ] Deduced a trap composed of 131 places in 161 ms of which 3 ms to minimize.
[2024-05-31 22:42:16] [INFO ] Deduced a trap composed of 31 places in 160 ms of which 2 ms to minimize.
[2024-05-31 22:42:17] [INFO ] Deduced a trap composed of 49 places in 174 ms of which 2 ms to minimize.
[2024-05-31 22:42:17] [INFO ] Deduced a trap composed of 81 places in 179 ms of which 3 ms to minimize.
[2024-05-31 22:42:17] [INFO ] Deduced a trap composed of 80 places in 177 ms of which 2 ms to minimize.
[2024-05-31 22:42:17] [INFO ] Deduced a trap composed of 81 places in 171 ms of which 3 ms to minimize.
[2024-05-31 22:42:18] [INFO ] Deduced a trap composed of 83 places in 173 ms of which 3 ms to minimize.
[2024-05-31 22:42:18] [INFO ] Deduced a trap composed of 43 places in 87 ms of which 2 ms to minimize.
[2024-05-31 22:42:18] [INFO ] Deduced a trap composed of 59 places in 79 ms of which 1 ms to minimize.
[2024-05-31 22:42:18] [INFO ] Deduced a trap composed of 53 places in 85 ms of which 2 ms to minimize.
[2024-05-31 22:42:18] [INFO ] Deduced a trap composed of 60 places in 82 ms of which 1 ms to minimize.
[2024-05-31 22:42:18] [INFO ] Deduced a trap composed of 46 places in 88 ms of which 2 ms to minimize.
[2024-05-31 22:42:19] [INFO ] Deduced a trap composed of 51 places in 80 ms of which 1 ms to minimize.
[2024-05-31 22:42:19] [INFO ] Deduced a trap composed of 57 places in 79 ms of which 2 ms to minimize.
[2024-05-31 22:42:19] [INFO ] Deduced a trap composed of 49 places in 66 ms of which 1 ms to minimize.
[2024-05-31 22:42:19] [INFO ] Deduced a trap composed of 69 places in 66 ms of which 1 ms to minimize.
[2024-05-31 22:42:19] [INFO ] Deduced a trap composed of 79 places in 66 ms of which 1 ms to minimize.
[2024-05-31 22:42:20] [INFO ] Deduced a trap composed of 55 places in 91 ms of which 1 ms to minimize.
[2024-05-31 22:42:20] [INFO ] Trap strengthening (SAT) tested/added 49/48 trap constraints in 11600 ms
TRAPS : Iteration 1
[2024-05-31 22:42:20] [INFO ] After 12919ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 22:42:20] [INFO ] After 13355ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
RANDOM walk for 40000 steps (5733 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3603 resets) in 78 ms. (506 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 540630 steps, run timeout after 3001 ms. (steps per millisecond=180 ) properties seen :0 out of 1
Probabilistic random walk after 540630 steps, saw 270375 distinct states, run finished after 3001 ms. (steps per millisecond=180 ) properties seen :0
// Phase 1: matrix 433 rows 418 cols
[2024-05-31 22:42:23] [INFO ] Invariants computation overflowed in 47 ms
[2024-05-31 22:42:23] [INFO ] State equation strengthened by 78 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/30 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 161/191 variables, 33/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 6/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 440/631 variables, 201/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/631 variables, 43/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/631 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 220/851 variables, 174/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/851 variables, 29/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/851 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/851 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 851/851 variables, and 496 constraints, problems are : Problem set: 0 solved, 1 unsolved in 360 ms.
Refiners :[State Equation: 418/418 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/30 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 161/191 variables, 33/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 6/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 440/631 variables, 201/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/631 variables, 43/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/631 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 851/851 variables, and 468 constraints, problems are : Problem set: 0 solved, 1 unsolved in 789 ms.
Refiners :[State Equation: 418/418 constraints, ReadFeed: 49/78 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1217ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 30001 ms.
Support contains 2 out of 418 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 418/418 places, 433/433 transitions.
Applied a total of 0 rules in 7 ms. Remains 418 /418 variables (removed 0) and now considering 433/433 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 418/418 places, 433/433 transitions.
RANDOM walk for 40000 steps (5718 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (3627 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 539958 steps, run timeout after 3001 ms. (steps per millisecond=179 ) properties seen :0 out of 1
Probabilistic random walk after 539958 steps, saw 270039 distinct states, run finished after 3001 ms. (steps per millisecond=179 ) properties seen :0
// Phase 1: matrix 433 rows 418 cols
[2024-05-31 22:42:57] [INFO ] Invariants computation overflowed in 40 ms
[2024-05-31 22:42:57] [INFO ] State equation strengthened by 78 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/30 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 161/191 variables, 33/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 6/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 440/631 variables, 201/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/631 variables, 43/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/631 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 220/851 variables, 174/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/851 variables, 29/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/851 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/851 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 851/851 variables, and 496 constraints, problems are : Problem set: 0 solved, 1 unsolved in 344 ms.
Refiners :[State Equation: 418/418 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/30 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 161/191 variables, 33/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 6/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 440/631 variables, 201/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/631 variables, 43/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/631 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 220/851 variables, 174/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/851 variables, 29/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/851 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/851 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 851/851 variables, and 497 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1309 ms.
Refiners :[State Equation: 418/418 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1741ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 30000 ms.
Support contains 2 out of 418 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 418/418 places, 433/433 transitions.
Applied a total of 0 rules in 8 ms. Remains 418 /418 variables (removed 0) and now considering 433/433 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 418/418 places, 433/433 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 418/418 places, 433/433 transitions.
Applied a total of 0 rules in 7 ms. Remains 418 /418 variables (removed 0) and now considering 433/433 (removed 0) transitions.
// Phase 1: matrix 433 rows 418 cols
[2024-05-31 22:43:29] [INFO ] Invariants computation overflowed in 47 ms
[2024-05-31 22:43:29] [INFO ] Implicit Places using invariants in 290 ms returned []
// Phase 1: matrix 433 rows 418 cols
[2024-05-31 22:43:30] [INFO ] Invariants computation overflowed in 38 ms
[2024-05-31 22:43:30] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 22:43:35] [INFO ] Implicit Places using invariants and state equation in 5554 ms returned []
Implicit Place search using SMT with State Equation took 5867 ms to find 0 implicit places.
[2024-05-31 22:43:35] [INFO ] Redundant transitions in 3 ms returned []
Running 432 sub problems to find dead transitions.
// Phase 1: matrix 433 rows 418 cols
[2024-05-31 22:43:35] [INFO ] Invariants computation overflowed in 43 ms
[2024-05-31 22:43:35] [INFO ] State equation strengthened by 78 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/417 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 1 (OVERLAPS) 433/850 variables, 417/417 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/850 variables, 78/495 constraints. Problems are: Problem set: 0 solved, 432 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/850 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 4 (OVERLAPS) 1/851 variables, 1/496 constraints. Problems are: Problem set: 0 solved, 432 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 851/851 variables, and 496 constraints, problems are : Problem set: 0 solved, 432 unsolved in 30017 ms.
Refiners :[State Equation: 418/418 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 432/432 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 432 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/417 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 1 (OVERLAPS) 433/850 variables, 417/417 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/850 variables, 78/495 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/850 variables, 429/924 constraints. Problems are: Problem set: 0 solved, 432 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 850/851 variables, and 924 constraints, problems are : Problem set: 0 solved, 432 unsolved in 30022 ms.
Refiners :[State Equation: 417/418 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 429/432 constraints, Known Traps: 0/0 constraints]
After SMT, in 60404ms problems are : Problem set: 0 solved, 432 unsolved
Search for dead transitions found 0 dead transitions in 60409ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66295 ms. Remains : 418/418 places, 433/433 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 418 transition count 432
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 417 transition count 432
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 2 place count 417 transition count 396
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 74 place count 381 transition count 396
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 93 place count 362 transition count 377
Iterating global reduction 2 with 19 rules applied. Total rules applied 112 place count 362 transition count 377
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 114 place count 361 transition count 376
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 116 place count 361 transition count 374
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 118 place count 359 transition count 374
Applied a total of 118 rules in 54 ms. Remains 359 /418 variables (removed 59) and now considering 374/433 (removed 59) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 374 rows 359 cols
[2024-05-31 22:44:36] [INFO ] Invariants computation overflowed in 24 ms
[2024-05-31 22:44:36] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 22:44:36] [INFO ] After 272ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 22:44:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 22:44:36] [INFO ] After 23ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 22:44:36] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 2 ms to minimize.
[2024-05-31 22:44:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
TRAPS : Iteration 1
[2024-05-31 22:44:36] [INFO ] After 208ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 22:44:36] [INFO ] After 561ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 711 ms.
Starting structural reductions in LTL mode, iteration 0 : 1059/1059 places, 998/998 transitions.
Applied a total of 0 rules in 32 ms. Remains 1059 /1059 variables (removed 0) and now considering 998/998 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32 ms. Remains : 1059/1059 places, 998/998 transitions.
[2024-05-31 22:44:36] [INFO ] Flatten gal took : 26 ms
[2024-05-31 22:44:36] [INFO ] Flatten gal took : 27 ms
[2024-05-31 22:44:36] [INFO ] Input system was already deterministic with 998 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1059/1059 places, 998/998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 230 transitions
Trivial Post-agglo rules discarded 230 transitions
Performed 230 trivial Post agglomeration. Transition count delta: 230
Iterating post reduction 0 with 230 rules applied. Total rules applied 230 place count 1058 transition count 767
Reduce places removed 230 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 233 rules applied. Total rules applied 463 place count 828 transition count 764
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 466 place count 825 transition count 764
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 42 Pre rules applied. Total rules applied 466 place count 825 transition count 722
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 550 place count 783 transition count 722
Performed 137 Post agglomeration using F-continuation condition.Transition count delta: 137
Deduced a syphon composed of 137 places in 4 ms
Reduce places removed 137 places and 0 transitions.
Iterating global reduction 3 with 274 rules applied. Total rules applied 824 place count 646 transition count 585
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 825 place count 645 transition count 584
Applied a total of 825 rules in 123 ms. Remains 645 /1059 variables (removed 414) and now considering 584/998 (removed 414) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 123 ms. Remains : 645/1059 places, 584/998 transitions.
[2024-05-31 22:44:37] [INFO ] Flatten gal took : 26 ms
[2024-05-31 22:44:37] [INFO ] Flatten gal took : 31 ms
[2024-05-31 22:44:37] [INFO ] Input system was already deterministic with 584 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1059/1059 places, 998/998 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 237 place count 1058 transition count 760
Reduce places removed 237 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 238 rules applied. Total rules applied 475 place count 821 transition count 759
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 476 place count 820 transition count 759
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 476 place count 820 transition count 719
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 556 place count 780 transition count 719
Performed 141 Post agglomeration using F-continuation condition.Transition count delta: 141
Deduced a syphon composed of 141 places in 3 ms
Reduce places removed 141 places and 0 transitions.
Iterating global reduction 3 with 282 rules applied. Total rules applied 838 place count 639 transition count 578
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 839 place count 638 transition count 577
Applied a total of 839 rules in 68 ms. Remains 638 /1059 variables (removed 421) and now considering 577/998 (removed 421) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 69 ms. Remains : 638/1059 places, 577/998 transitions.
[2024-05-31 22:44:37] [INFO ] Flatten gal took : 28 ms
[2024-05-31 22:44:37] [INFO ] Flatten gal took : 18 ms
[2024-05-31 22:44:37] [INFO ] Input system was already deterministic with 577 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1059/1059 places, 998/998 transitions.
Applied a total of 0 rules in 87 ms. Remains 1059 /1059 variables (removed 0) and now considering 998/998 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 87 ms. Remains : 1059/1059 places, 998/998 transitions.
[2024-05-31 22:44:37] [INFO ] Flatten gal took : 23 ms
[2024-05-31 22:44:37] [INFO ] Flatten gal took : 33 ms
[2024-05-31 22:44:37] [INFO ] Input system was already deterministic with 998 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1059/1059 places, 998/998 transitions.
Applied a total of 0 rules in 31 ms. Remains 1059 /1059 variables (removed 0) and now considering 998/998 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31 ms. Remains : 1059/1059 places, 998/998 transitions.
[2024-05-31 22:44:37] [INFO ] Flatten gal took : 37 ms
[2024-05-31 22:44:37] [INFO ] Flatten gal took : 24 ms
[2024-05-31 22:44:37] [INFO ] Input system was already deterministic with 998 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1059/1059 places, 998/998 transitions.
Applied a total of 0 rules in 42 ms. Remains 1059 /1059 variables (removed 0) and now considering 998/998 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43 ms. Remains : 1059/1059 places, 998/998 transitions.
[2024-05-31 22:44:37] [INFO ] Flatten gal took : 23 ms
[2024-05-31 22:44:37] [INFO ] Flatten gal took : 25 ms
[2024-05-31 22:44:37] [INFO ] Input system was already deterministic with 998 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1059/1059 places, 998/998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 230 transitions
Trivial Post-agglo rules discarded 230 transitions
Performed 230 trivial Post agglomeration. Transition count delta: 230
Iterating post reduction 0 with 230 rules applied. Total rules applied 230 place count 1058 transition count 767
Reduce places removed 230 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 234 rules applied. Total rules applied 464 place count 828 transition count 763
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 468 place count 824 transition count 763
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 468 place count 824 transition count 722
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 550 place count 783 transition count 722
Performed 139 Post agglomeration using F-continuation condition.Transition count delta: 139
Deduced a syphon composed of 139 places in 3 ms
Reduce places removed 139 places and 0 transitions.
Iterating global reduction 3 with 278 rules applied. Total rules applied 828 place count 644 transition count 583
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 829 place count 643 transition count 582
Applied a total of 829 rules in 63 ms. Remains 643 /1059 variables (removed 416) and now considering 582/998 (removed 416) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 64 ms. Remains : 643/1059 places, 582/998 transitions.
[2024-05-31 22:44:37] [INFO ] Flatten gal took : 15 ms
[2024-05-31 22:44:37] [INFO ] Flatten gal took : 15 ms
[2024-05-31 22:44:37] [INFO ] Input system was already deterministic with 582 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1059/1059 places, 998/998 transitions.
Applied a total of 0 rules in 28 ms. Remains 1059 /1059 variables (removed 0) and now considering 998/998 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 1059/1059 places, 998/998 transitions.
[2024-05-31 22:44:37] [INFO ] Flatten gal took : 21 ms
[2024-05-31 22:44:37] [INFO ] Flatten gal took : 22 ms
[2024-05-31 22:44:38] [INFO ] Input system was already deterministic with 998 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1059/1059 places, 998/998 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 242 place count 1058 transition count 755
Reduce places removed 242 places and 0 transitions.
Iterating post reduction 1 with 242 rules applied. Total rules applied 484 place count 816 transition count 755
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 38 Pre rules applied. Total rules applied 484 place count 816 transition count 717
Deduced a syphon composed of 38 places in 6 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 560 place count 778 transition count 717
Performed 141 Post agglomeration using F-continuation condition.Transition count delta: 141
Deduced a syphon composed of 141 places in 3 ms
Reduce places removed 141 places and 0 transitions.
Iterating global reduction 2 with 282 rules applied. Total rules applied 842 place count 637 transition count 576
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 843 place count 636 transition count 575
Applied a total of 843 rules in 60 ms. Remains 636 /1059 variables (removed 423) and now considering 575/998 (removed 423) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60 ms. Remains : 636/1059 places, 575/998 transitions.
[2024-05-31 22:44:38] [INFO ] Flatten gal took : 14 ms
[2024-05-31 22:44:38] [INFO ] Flatten gal took : 15 ms
[2024-05-31 22:44:38] [INFO ] Input system was already deterministic with 575 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1059/1059 places, 998/998 transitions.
Applied a total of 0 rules in 45 ms. Remains 1059 /1059 variables (removed 0) and now considering 998/998 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46 ms. Remains : 1059/1059 places, 998/998 transitions.
[2024-05-31 22:44:38] [INFO ] Flatten gal took : 21 ms
[2024-05-31 22:44:38] [INFO ] Flatten gal took : 21 ms
[2024-05-31 22:44:38] [INFO ] Input system was already deterministic with 998 transitions.
[2024-05-31 22:44:38] [INFO ] Flatten gal took : 21 ms
[2024-05-31 22:44:38] [INFO ] Flatten gal took : 22 ms
[2024-05-31 22:44:38] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-05-31 22:44:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1059 places, 998 transitions and 2807 arcs took 7 ms.
Total runtime 1004060 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : DoubleExponent-PT-020-CTLCardinality-2024-02
Could not compute solution for formula : DoubleExponent-PT-020-CTLCardinality-2024-03
Could not compute solution for formula : DoubleExponent-PT-020-CTLCardinality-2024-04
Could not compute solution for formula : DoubleExponent-PT-020-CTLCardinality-2024-05
Could not compute solution for formula : DoubleExponent-PT-020-CTLCardinality-2024-06
Could not compute solution for formula : DoubleExponent-PT-020-CTLCardinality-2024-07
Could not compute solution for formula : DoubleExponent-PT-020-CTLCardinality-2024-08
Could not compute solution for formula : DoubleExponent-PT-020-CTLCardinality-2024-09
Could not compute solution for formula : DoubleExponent-PT-020-CTLCardinality-2024-10
Could not compute solution for formula : DoubleExponent-PT-020-CTLCardinality-2024-11
Could not compute solution for formula : DoubleExponent-PT-020-CTLCardinality-2023-12
Could not compute solution for formula : DoubleExponent-PT-020-CTLCardinality-2023-14
Could not compute solution for formula : DoubleExponent-PT-020-CTLCardinality-2023-15

BK_STOP 1717195478674

--------------------
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 CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name DoubleExponent-PT-020-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/1225/ctl_0_
ctl formula name DoubleExponent-PT-020-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/1225/ctl_1_
ctl formula name DoubleExponent-PT-020-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/1225/ctl_2_
ctl formula name DoubleExponent-PT-020-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/1225/ctl_3_
ctl formula name DoubleExponent-PT-020-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/1225/ctl_4_
ctl formula name DoubleExponent-PT-020-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/1225/ctl_5_
ctl formula name DoubleExponent-PT-020-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/1225/ctl_6_
ctl formula name DoubleExponent-PT-020-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/1225/ctl_7_
ctl formula name DoubleExponent-PT-020-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/1225/ctl_8_
ctl formula name DoubleExponent-PT-020-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/1225/ctl_9_
ctl formula name DoubleExponent-PT-020-CTLCardinality-2023-12
ctl formula formula --ctl=/tmp/1225/ctl_10_
ctl formula name DoubleExponent-PT-020-CTLCardinality-2023-14
ctl formula formula --ctl=/tmp/1225/ctl_11_
ctl formula name DoubleExponent-PT-020-CTLCardinality-2023-15
ctl formula formula --ctl=/tmp/1225/ctl_12_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="CTLCardinality"
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 CTLCardinality"
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-171631132900561"
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 [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;